• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.352-358
• /
• 2003

A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.19-30
• /
• 2008

Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.

• Journal of IKEEE
• /
• v.26 no.4
• /
• pp.614-621
• /
• 2022

This paper proposes RIDS (Random Forest-Based Intrusion Detection), which is an intrusion detection system to detect hacking attack based on random forest. RIDS detects three typical attacks i.e. DoS (Denial of service) attack, fuzzing attack, and spoofing attack. It detects hacking attack based on four parameters, i.e. time interval between data frames, its deviation, Hamming distance between payloads, and its diviation. RIDS was designed in memory-centric architecture and node information is stored in memories. It was designed in scalable architecture where DoS attack, fuzzing attack, and spoofing attack can be all detected by adjusting number and depth of trees. Simulation results show that RIDS has 0.9835 accuracy and 0.9545 F1 score and it can detect three attack types effectively.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.6
• /
• pp.124-136
• /
• 2019

Autonomous driving at intersections requires assistance by exchanging traffic information between traffic objects due to the intersection of various vehicles and complicated driving environment. For this reason, traffic information exchange between adjacent intersections is required, but the node ID representing the intersection in the Korean standard node link system have limitations in updating intersections and identifying location information of intersections through IDs due to the configuration system including serial numbers. In this paper, we designed a coordinate-based intersection ID configuration system created by processing and merging two-dimensional coordinates of intersections to include location information in the intersection ID. In order to verify the applicability of the proposed intersection ID, we applied a new intersection ID to domestic intersections and confirmed that there are no duplicate values. Coordinate-based intersection ID reduces data size by 60% compared to existing node ID, and enables spatial queries such as searching for nearby intersections and extracting intersections in specific areas in the form of boxes without GIS tools. Therefore, coordinate-based intersection ID is expected to be more scalable and utilized than existing node ID.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.457-467
• /
• 2002

In order to simulate cyber attacks and predict network behavior by attacks, we should represent attributes of network components in the simulation model, and should express characteristics of systems that carry out various cyber attacks and defend from these attacks. To simulate how network load may change under the cyber attacks, we extended SSF[9, 10] that is process-based event-oriented simulation system. We added a firewall class and a packet manipulator into the SSFNet that is a component of SSF. The firewall class, which is related to the security, is to simulate cyber attacks, and the packet manipulator is a set of functions to write attack programs for the simulation. The extended SSFNet enables to simulate a network with the security systems and provides advantages that make easy to port already exsiting attack programs and apply them to the simulation evironment. We made a vitual network model to verify operations of the added classes, and simulated a smurf attack that is a representative denial of sevive attack, and observed the network behavior under the smurf attack. The results showed that the firewall class and packet manipulator developed in this paper worked normaly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.585-593
• /
• 2010

Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.1
• /
• pp.62-77
• /
• 2019

Open Data Cube(ODC) has been emerging and developing as the open source platform in the Committee on Earth Observation Satellites(CEOS) for the Global Earth Observation System of Systems(GEOSS) deployed by the Group on Earth Observations (GEO), ODC can be applied to the deployment of scalable and large amounts of free and open satellite images in a cloud computing environment, and ODC-based country or regional application services have been provided for public users on the high performance. This study first summarizes the status of ODC, and then presents concepts and some considering points for linking this platform with Korea Multi-Purpose Satellite (KOMPSAT) images. For the reference, the main contents of ODC with the Google Earth Engine(GEE) were compared. Application procedures of KOMPSAT satellite image to implement ODC service were explained, and an intermediate process related to data ingestion using actual data was demonstrated. As well, it suggested some practical schemes to utilize KOMPSAT satellite images for the ODC application service from the perspective of open data licensing. Policy and technical products for KOMPSAT images to ODC are expected to provide important references for GEOSS in GEO to apply new satellite images of other countries and organizations in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of Advanced Navigation Technology
• /
• v.21 no.6
• /
• pp.659-665
• /
• 2017

In this paper, a low complexity fast Fourier transform(FFT) processor is proposed for multiple input multiple output(MIMO) systems. The IEEE 802.11ac standard has been adopted along with the demand for a system capable of high channel capacity and Gbps transmission in order to utilize various multimedia services using a wireless LAN. The proposed scalable FFT processor can support the variable length of 64, 128, 256, and 512 for 8x8 antenna configuration as specified in IEEE 802.11ac standard with MIMO-OFDM scheme. By reducing the required number of non-trivial multipliers with mixed-radix(MR) and multipath delay commutator(MDC) architecture, the complexity of the proposed FFT processor was dramatically decreased. Implementation results show that the proposed FFT processor can reduced the logic gate count by 50%, compared with the radix-2 SDF FFT processor. Also, compared with the 8-channel MR-2/2/2/4/2/4/2 MDC processor and 8-channel MR-2/2/2/8/8 MDC processor, it is shown that the gate count is reduced by 18% and 17% respectively.