• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1231-1242
• /
• 1997

This paper deals with an IP mukticast protocol in support of host mobility. Most of the previous multicast schemes have utilized an underlying logical strucuture of network topology,in order to provide a certain degree of order and predictability.On the other hand,mobility implies that a host location relaative to the rest of the net-work changes with time;the physical connectivity of the entire network is thus modified as move.In this case.some multicast datagrams nay not delivered properly,or may delivered twice or more,to a mobile host because the destinations will keep moving whlist datagrams are dekivered with different time delay.This paper first describes the relation between host mobility and multicast, by exploring the possible interactions,and presents a multicast scheme in support of Internet host mobility.A revised scheme is then proposed to adapt the multicast semantic and to optimize the communication overhead.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.891-900
• /
• 2005

This paper studies network recovery methods for WDM optical mesh networks, concentrating on improving spare resource utilization. The resource efficiency can be obtained by sharing spare resources needed for network recovery. To improve the sharability of spare resources in WDM networks, methods to share backup paths us well as spare capacity should be studied. The proposed method in this paper uses multiple ring-covers and this method provides fast and simple recovery operation by exploiting the characteristics of logical ring topology, and also provides efficient resource utilization by using multiple distributed backup paths to improve the sharability of overall spare resources in the networks. This method can provide layered reliability to network service by enabling hierarchical robustness against multiple failures. The performance results show that the proposed method provide improved resource efficiency for single failure and enhanced robustness for multiple failures.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1320-1332
• /
• 1998

We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2221-2234
• /
• 1997

Distributed mutual exclusion algorithms have employed two approaches to achieve mutual exclusion and can be divided into two broad classes:token-based and permission-based. Token-based algorithms share a unique token among the nodes and a node is allowed to access its common resources if it possesses the token. Permission-based algorithms require one or more successive rounds of message exchanges among the nodes to obtain the permission to access the common resources. A hypercube architecture has earned wide acceptance in multiprocessor systems in the past few years because of its simple, yet rich topology. Accordingly, we study distributed permission-based mutual exclusion algorithms for hypercubes, and design a distributed permission-based mutual exclusion algorithm based on a new information structure adapted to the hypercubes. The new information structure is a request set of T-pattern from a logical mesh that is embedded into a hypercube. If a node wants to access the common resources, it sends request message to all nodes in the request set by Lan's multicast algorithm. Once the node receives a grant message from all nodes in the request set, it accesses the common resource. We evaluate our algorithm with respect to minimum round-trip delay, blocking delay, and the number of messages per access to the common resource.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.417-424
• /
• 2007

Mesh networks using WLAN technology have been paid attention as a key wireless access technology. However, many technical issues still exist for its successful deployment. One of those issues is the routing problem that addresses the path setup through a WLAN mesh network for the data exchanges between a station and a wired network. Since the characteristics of a WLAN mesh network can be very dynamic, the use of single routing protocol would not fit for all environments whether it is reactive or proactive. Therefore, it is required to develop an adaptive routing protocol that modifies itself according to the changes in the network parameters. As a logical first step for the development, an analytical model considering all the dynamic features of a WLAN mesh network is required to evaluate the performance of a reactive and a proactive routing scheme. In this paper, we propose an analytical model that makes us scrutinize the impact of the network and station parameters on the performance of each routing protocol. Our model includes the size of a mesh network, the density of stations, mobility of stations. and the duration of network topology change. We applied our model to the AODV that is a representative reactive routing protocol and DSDV that is a representative proactive routing protocol to analyze the tradeoff between AODV and DSDV in dynamic network environments. Our model is expected to help developing an adaptive routing protocol for a WLAN mesh network.

• Convergence Security Journal
• /
• v.20 no.4
• /
• pp.143-151
• /
• 2020

The cyber battlefield called the fifth battlefield, is not based on geological information unlike the existing traditional battlefiels in the land, sea, air and space, and has a characteristics that all information has tightly coupled correlation to be anlayized. Because the cyber battlefield has created by the network connection of computers located on the physical battlefield, it is not completely seperated from the geolocational information but it has dependency on network topology and software's vulnerabilities. Therefore, the analysis for cyber battlefield should be provided in a form that can recognize information from multiple domains at a glance, rather than a single geographical or logical aspect. In this paper, we describe a study on the development of the cyber operation COP(Common Operational Picture), which is essential for command and control in the cyber warfare. In particular, we propose an architecure for cyber operation COP to intuitively display information based on visualization techniques applying the multi-layering concept from multiple domains that need to be correlated such as cyber assets, threats, and missions. With this proposed cyber operation COP with multi-layered visualization that helps to describe correlated information among cyber factors, we expect the commanders actually perfcrm cyber command and control in the very complex and unclear cyber battlefield.