• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.362-364
• /
• 1992

In this paper, the development of a fiber optic network for an integrated digital protection relay system is described. The structure of the developed network is determined to loosen the optic requirements and to have good extensibility while providing sufficient functions for protection and control for substations. The network has a hierarchical structure with two levels. The upper level handles data for monitoring and control of the system with star topology. The lower level manages the real time data for bus protection with one-to-one connections. Communication flows of each level are described. The HDLC is employed as the network protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.1-4
• /
• 2005

This paper deals with the mechanism and control protocols required in order to reconcile the P2MP topology into the Ethernet framework. This paper specifies the multi-point control protocol(MPCP) to operate an optical multi-point network. Also it is applied to method of bandwidth limitation of downstream traffic

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.525-534
• /
• 2005

This paper proposes the architecture and the methods of security network management for auto-configuration of security systems by extending the existing policy-based network management architecture. The architecture and the methods proposed in this paper enable a security management sewer to automatically decide the best-suited security policy to apply to a security system and the most effective and efficient security system to perform security policy rule, based on the role and capability information of security systems and the role and time information of security policy. For integrated control of network system and security system, this paper also proposes SNMP protocol based security network topology map generator. To show the excellence of the proposed architecture and methods, we simulate and evaluate the automatic response against attacks.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.182-192
• /
• 1999

The advance of the MPEG(Moving Picture Expert Group) and DSP(Digital Signal Processing) technologies lead the energence of the information appliances which are gradually digitalized and embedded the high-speed networking function. This paper proposes a CHANCE(Cost-effective Home ATM Network for the Consumer Electronics) protocol supporting the ATM-based high-speed networking between the information appliances within the home, and designs its specific functions including the network management and signalling function. The CHANCE protocol is basically based on the tree topology, and supports the plug-and-play function by using only the header field of the ATM cells. Unlike the existing ATM Warren protocol which uses the source routed addressing scheme to control the in-home devices from the Warren controller, the CHANCE protocol can support the inter-device controls as well as the controls from the CHANCE controller by using the switch and device identifier.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.177-183
• /
• 2008

In this paper we suggest a hybrid MAC protocol for wireless sensor networks (WSN) to enhance network performance. The proposed MAC scheme is specifically designed for wireless sensor networks which consist of lots nodes. The contributions of this paper are: First, the proposed scheduling algorithm is independent of network topology. Even though the BS node has lots of one hop node in dense mode network, all the time slots can be assigned fully without increasing frequencies. Second, BS one hop nodes can use more than one time slots if necessary, so total network performance is increased. We compare the network performance of the proposed scheme with previous one, HyMAC [1].

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.456-469
• /
• 2009

We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.