• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.173-182
• /
• 1997

In this paper, an efficient dynamic channel assignment scheme is suggested, which consists of two types of channel allocation strategies : ordinary channel allocation strategy and channel reallocation strategy. An analysis on the handoff probabilities of handoff and new calls is also performed, and using the analyzed handoff probability, the presented scheme is compared with other existing schemes in terms of three types of blocking probabilities- new call blocking probability, handoff call blocking probability, and network blocking probability (incomplete service probability). Simulation results show that the presented scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, the scheme has much smaller number of reallocation than other schemes.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.740-754
• /
• 2015

This paper focuses on the reverse blocking busbar protection scheme with aim to improve the speed of its operation and at the same time to increase operational reliability, flexibility and stability of the protection during external and internal faults by implementation of the extended functionality provided by the IEC61850 standard-based protective Intelligent Electronic Devices (IEDs). The practical implementation of the scheme by the use of IEC 61850 standard communication protocol is investigated. The proposed scheme is designed for a radial type of a distribution network and is modeled and simulated in the DigSILENT software environment for various faults on the busbar and its outgoing feeders. A laboratory test bench is built using three ABB IEDs 670 series that are compliant with the IEC 61850 standard, CMC 356 Omicron test injection device, PC, MOXA switch, and a DC power supplier. Two types of the reverse blocking signals between the IEDs in the test bench are considered: hard wired and Ethernet communication by using IEC 61850 standard GOOSE messages. Comparative experimental study of the operational trip response speeds of the two implementations for various traffic conditions of the communication network shows that the performance of the protection scheme for the case of Ethernet IEC 61850 standard-based communication is better.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.485-492
• /
• 2003

This paper presents a new modified input buffered switch, which called a grouped input buffered (GIB) switch, to eliminate the influence of HOL blocking when using multiple input buffers in ATM switches. The GIB switch consists of grouped sub switches per a network stage. The switch gives extra paths and buffered switching elements between groups for transferring the blocked cells. As the result, the proposed model can reduce the effect by the HOL blocking and thereafter it enhances the performance of the switch. The simulation results show that the proposed scheme has good performance in comparison with previous works by using the parameters such as throughput, cell loss, delay and system power.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.85-91
• /
• 2021

Some sections of the highway are closed due to disasters and accidents. In this situation, it analyzes what kind of situation occurs due to functional failure in the highway network. The domestic highway network can be expressed as a graph. Blocking some sections of the highway can turn into a national disaster. In this paper, we analyze the robustness of the domestic highway network. The robustness of expressways refers to the degree to which the traffic conditions of the domestic expressway network deteriorate due to the blockage of some sections. The greater the robustness, the smaller the effect of some blocking appears. This study is used to evaluate the congestion level of one section of the transportation network, and a value obtained by dividing the section traffic volume (V) by the section traffic volume (C) is used. This study analyzes the robustness of highways by using the actual traffic volume data of the departure and arrival points of domestic highways, and analyzes the changes in traffic volume due to partial blockage through experimental calculations. Although this analysis cannot reflect the exact reality of domestic highways, it is judged to be sufficient for the purpose of confirming the basic robustness of the overall network.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.142-145
• /
• 1986

The traffic characteristics of digital switch network depend on the structure, blocking probability, path searching method and etc. This paper presents the study of TDX-1 switch network traffic capacity by considering some decisive factors such as call processing software, switch network structure and control scheme. Conclusively the study shows that the switch network of TDX-1 can handle approximatly up to 1650 Erlang.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.809-819
• /
• 2000

This paper deals with an optimal capacity allocation problem and performance analysis in Advanced Information Communication Processing System(AICPS). AICPS is a gateway system interconnection PSTN(Public Switched Telephone Network), ISDN(Intergrated Services Digital Network), PSDN(Packet Switched Data Network), internet, Frame Relay and ATM together. This study considers not only ISDN and Internet but also user behavior of On-line service which is analyzed by Markov process. A call blocking probability of TNAS and INAS is computed by Erlang's formula. Then, PNAS and WNAS's call blocking probability are computed by Stochastic knapsack modeling. The result is compared with result of simulation. Finally, we allocate an optimal capacity minimizing total call blocking probability.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.85-95
• /
• 1998

In this study, we consider a recursive procedure to obtain the stationary probability distribution for analyzing Coxian queueing networks with finite queues. This network deals with multiple class customers. Due to the state space representing multiple class customers, the sub-matrices corresponding to states can not be square matrices and can not be inverted. Therefore, we introduce more complex recursive method to avoid the singular problem. The open queueing network that we study consists of 3 parallel first-level sources linked to a single second level queue. We consider two types of schemes for entering a queue. The first scheme is assumed to be the first-blocked-first-enter (FBFE) and the second scheme is the higher-priority-first-enter (HPFE). Arrival and service times are assume to have a Coxian distribution with two phases. Comparison between the resulting using Gauss-Seidel method and recursive procedure will be shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1841-1851
• /
• 1999

Banyan network has been widely employed as a basic building block for ATM switches. But the banyan network has very low routing capacity because of the internal blocking problem. Hence, a dilated banyan network has been used as one solution that can overcome the internal blocking problem. However, tremendous network capacity is wasted in the dilated network In this paper, we propose a dilated banyan network with deflection routing and recirculation mechanism to fully utilize the wasted capacity. The performance of the proposed switch is analysed under uniform traffic assumption. Numerical and simulation results show that the proposed switch yields a significant improvement of the maximum throughput as compared that of the pure dilated banyan network.