• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.2
• /
• pp.86-94
• /
• 2014

Optical packet switching (OPS) is being considered as one of the switching technologies for a future optical internet. For contention resolution in an optical packet switching (OPS) system, the wavelength dimension is generally used in combination with a fiber delay line (FDL) buffer. In this article, we propose a method to reduce the number of tunable wavelength converters (TWCs) by sharing TWCs for a cost-effective design of an asynchronous OPS system with a shared or an output FDL buffer. Asynchronous and variable-length packets are considered in the OPS system design. To investigate the number of TWCs needed for the OPS system, an algorithm is proposed, which searches for an available TWC and an unused internal wavelength, as well as an outgoing channel. This algorithm is applied to an OPS system with a shared or an output FDL buffer. Also, the number of internal wavelengths (i.e., the conversion range of the TWC) needed for an asynchronous OPS system is presented for cost reduction of the OPS system.

• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.35-42
• /
• 2012

Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.114-123
• /
• 1985

This is the second part of the four-part paper describing the development of a packet-switched computer network named the cORNET In this paper, following the first par paper that describes the concepts of the KORNET and the development of the network management center (NMC), wc present the design of the KORNET and the development of the network node processor (NNP) The initial configuration of the KORNET consists of three NNP's and one NMC. We have developed each NNP as a microprocessor-based (Mc68000) multiprocessor system, and implemented the NMC using a super-mini computer (Mv/8000) For the KORNET we use the virtual circuit (VC) method as the packet service strategy and the distributed adaptive routing algorithm to adapt efficiently the variation of node and link status. Also, we use a dynamic buffer management algorithm for efficient storage management. Thc hardware of the NNP system has been designed with emphasis on modularity so that it may be expanded esily . Also, the software of the NNP system has been developed according to the CCITT recommendations X.25, X.3, X.28 and X.29.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.1
• /
• pp.34-40
• /
• 2010

As internet spread widely, various service which use the internet have been provided. One of the service is a internet phone. Its usage is increasing by the advantage of cost. But it has a falling off in quality of speech. because it use packet switching method while existing telephone use circuit switching method. Although vocoder use PLC (Packet Loss Concealment) algorithm, it has a weakness of continuous packet loss. In this paper, we propose methods to improve a lowering in quality of speech under continuous loss of packet by using PLC algorithm used in advanced G.729 and G.711. The proposed methods are LP (Linear Prediction) parameter interpolation, excitation signal reconstruction and excitation signal gain reconstruction. As a result, the proposed method shows superior performance about 11%.

• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.43-58
• /
• 1998

Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.103-113
• /
• 1985

This is the first part of the four-part paper describing the development of a packet-switched computer network named the KORNET In this paper, we present the overview of the KORNET, and discuss various aspects on the development of the netwo management center (NMC). The NMC acts as a nerve center of the network, performing such functions as network monitoring, subscriber and network management and routing manage-ment using operator dialogues. In the implementation of the NMC, we have developed various application softwares that include operator interface, primary/srcondary pan, session layer and packet level adaptor. As for packet, link and physical level protocols, we have modified the XODIAC X.25 originally developed by Data General, Inc. All the net-work protocols we have developed comply completely with the CCITT recommendations.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.18-29
• /
• 2016

In this paper, we discuss the issues of providing protection for point-to-multipoint connections in both Ethernet and MPLS-TP-based packet transport networks. We introduce two types of per-leaf protection-linear and ring. Neither of the two types requires that modifications to existing standards be made. Their performances can be improved by a collective signal fail mechanism proposed in this paper. In addition, two schemes - tree protection and hybrid protection - are newly proposed to reduce the service recovery time when a single failure leads to multiple signal fail events, which in turn places a significant amount of processing burden upon a root node. The behavior of the tree protection protocol is designed with minimal modifications to existing standards. The hybrid protection scheme is devised to maximize the benefits of per-leaf protection and tree protection. To observe how well each scheme achieves an efficient traffic recovery, we evaluate their performances using a test bed as well as computer simulation based on the formulae found in this paper.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.93-102
• /
• 2006

Traditionally, diffusion of telecommunications services has been considerably affected by presence of critical mass and network externalities, and thus shown the so-called late take-off phenomenon. However, as telecommunications network evolves from circuit switching to packet switching, enabling diverse new services such as Internet access, Internet banking and web hosting, it seems this traditional diffusion patterns are changing. By comparing diffusion of the packet-based services with those of circuit-based services and durable goods, we have found the late take-off phenomenon is not involved in diffusion of newly introduced the packet-based services. Moreover, we concluded diffusion of the packet-based services is much faster than that of durable goods, thus showing early take-off phenomenon. Based on this empirical result, we suggest Telcos and ISPs should pay as much attention to the growth state as the introduction stage in order for their packet-based services to be successful in the markets.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.181-187
• /
• 2003

In high speed packet switching network, packet service by priority scheme prefer to QoS. Efficient packet service according to the priority scheme in high speed packet switch is a key point. Therefore development of priority service algorithm in the packet switch is very important. In this paper, we proposed W-iSLIP algorithm that service time take queue length into consideration and compared the proposed W-iSLIP algorithm to other previous proposed algorithm through simulation. Simulation results show 2.6% performance elevation in average delay, and 34.6% performance elevation in priority service.