• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.361-368
• /
• 2011

In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.829-836
• /
• 2013

Wireless mesh networks(WMNs) are wireless backbone networks technology consisting of a multi-hop routers. Location management is essential to provide a service to the terminal in WMNs. IEEE 802.11s standards have two basic location management scheme for location management - the proxy registration procedure and the associated station discovery protocol. These basic schemes, however, suffer from serious drawbacks including redundancy control message, ineffective location information maintenance, additional delay time. This paper propose an on-demand station location management scheme using 6-address structure of IEEE 802.11s. Through analysis and experimental evaluation on simulation, we show that proposal scheme reduce control message and forwarding delay time.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.196-208
• /
• 2005

In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.165-173
• /
• 2008

In this paper, we propose a new reliable broadcast protocol referred to as timer-based reliable broadcast (TRB) for wireless sensor networks (WSNs). The proposed TRB scheme exploits (1) bitmap based explicit ACK to effectively reduce the unnecessary error control messages and (2) randomized timer for ACK transmission to substantially reduce the possibility of contentions. Although it has been argued that 100% reliability is not necessary in WSNs, there should be messages (such as mission-critical message, task assignment, software updates, etc.) that need to be reliably delivered to the entire sensor field. We propose to use the TRB algorithm for such cases. Performance evaluation shows that the TRB scheme achieves 100 % reliability significantly better than other schemes with expense of slightly increased energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.977-983
• /
• 2010

In mobile and secure military networks, full-meshed IPSec tunnels, which do correspond to not physical links but logical links between each IPSec device and its peer, are required to provide multicast communications. All IPSec devices need support in changing IPSec tunnels by a way of using a multicast group key which is updated dynamically. Tactical terminals, which often constitute a group, need also secure multicast communications in the same group members. Then, the multicast group key is required to be updated dynamically in order to support group members' mobility. This paper presents challenging issues of designing a secure and dynamic group key management of which concept is based on the Diffie-Hellman (DH) key exchange algorithm and key trees. The advantage of our dynamic tree based key management is that it enables the dynamic group members to periodically receive status information from every peer members and effectively update a group key based on dynamically changing environments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.31-36
• /
• 2005

In this paper, we propose a new optical switching system as a infrastructure of the BcN, in which the high traffic volume will be expected due to the multimedia service, like P2P services. Because the JET protocol, the most popular protocol in OBS (Optical Burst Switching) research area, has high blocking probability for burst, it prevents commercialization in real network for its low throughput in TCP layer. To improve high blocking rate in OBS network, we segment large network into small network and perform burst scheduling to avoid burst loss. By using proposed scheme, Internet provider can reduce network deployment cost in Metro network as well as large mesh core networks

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.394-400
• /
• 2002

Networks of Workstations(NOWs), that has features of flexibility and scalability, recently has emerged as an inexpensive alternative to massively parallel multicomputers. However it is not easier to perform deadlock-free multicast than regular topologies like mash or hypercube. Single phase differential multicast(SPDM) is a modified multicast algorithm with less burden of the root node. By applying quality of serviece(QoS), a specific node can have differentiated service and artificial change of message flow pattern is also available. As the results of performance evaluation experiments, SPDM has lower latency and lower packet concentration rate of the root node than the case of SPAM, and has ability to control network load distribution among switch nodes by controlling the assignment rate among nodes.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.63-70
• /
• 2009

This paper proposes a novel path finding approach of a mobile robot using RF strength in sensor network. In the experiments based on the proposed method, a mobile robot attempts to find its location, heading direction and the shortest path in the indoor environment. The experimental system consisting of mesh network shares node data and send them to base station. The triangulation and the proposed Grid method calculate the location and heading angle of the robot. In addition, the robot finds the shortest path by using the base station attached on it to receive data of environment around each node. Kalman filter reduces the straight line error when the robot estimates the strength of received signal. The experimental results show the effectiveness of the proposed algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.224-229
• /
• 2004

The objective of this work is not only to perform feasibility studies on the CFD (computational fluid dynamics) analysis for the capillary system design but also to provide an enhanced understanding of the autonomous capillary flow. The capillary flow is evaluated by means of the commercial CFD software of FLUENT, which includes the VOF (volume-of-fluid) model for multiphase flow analysis. The effect of wall adhesion at fluid interfaces in contact with rigid boundaries is considered in terms of static contact angle. Feasibility studies are first performed, including mesh-resolution influence on pressure profile, which has a sudden increase at the liquid/gas interface. Then we perform both 2D and 3D simulations and examine the transient nature of the capillary flow. Analytical solutions are also derived for simple cases and compared with numerical results. Through this work, essential information on the capillary system design is brought out. Our efforts and initial success in numerical description of the microfluidic capillary flows enhance the fundamental understanding of the autonomous capillary flow and will eventually pave the road for full-scale, computer-aided design of microfluidic networks.