• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1596-1606
• /
• 2010

In this paper, we present a new analytical model that can precisely estimate the blocking performance of wavelength-routed WDM networks with sparse-partial-limited wavelength conversion (SPLWC). The proposed model accounts for the two sources of call blocking in a wavelength converter: range blocking originated from the limited conversion range of a wavelength converter; and capacity blocking induced from the limited number of wavelength converters. Based on the proposed model, we also present a new converter placement algorithm that minimizes the amount of wavelength conversion capability, while satisfying the given constraint on the network-wide blocking probability. From the numerical results obtained from the EON, we demonstrate that the blocking probability of the analytical model closely matches with that of the simulation. We also show that, by efficiently combining the existing sparse, partial, and limited wavelength conversion, the SPL WC can achieve the required blocking performance with the least amount of wavelength conversion cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.730-738
• /
• 2004

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service termination, probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versus throughput as a function of traffic parameters with several service termination probability can be derived via mathematical formulation and the relative differences of transmission delay is also compared.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.185-188
• /
• 2004

Sufficient bandwidth that can support multimedia service has to be provided in the next generation wireless communication system. In this paper, the effective handoff scheme considering the position of mobile terminal is proposed. In addition, the dynamic channel allocation scheme is proposed. The shared channel in this algorithm can reduce more the blocking probability and the dropping probability. The proposed algorithms are simulated by SMPL library in C language. The simulation results show that the blocking probability and the dropping probability of the call can be reduced up to $60\%\;and\;10\%$ using the proposed algorithms, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.426-435
• /
• 2005

this paper, we made out blocking probability analysis for a new authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Besides, we proposed advanced handover method and blocking probability analysis for wireless PKI. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate, queue service rate, queue size

• 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 KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1248-1257
• /
• 1999

MDDS는 디스크 시스템의 성능을 향상시키기 위해 하이퍼큐브의 각 노드에 디스크 블록들을 분산 저장하며, 인접한 노드에서 분산 저장하고 있는 디스크 블록을 중복 저장하고 있는 디스크 시스템이다. 본 논문에서는 디스크 서비스 시간을 분석하기 위한 선행 연구로서 소스 노드에서 생성된 디스크 서비스 요구 메시지가 디스크 서비스를 제공하는 목적 노드에 수신될 때까지의 시간인 전송 시간을 분석한다. 이러한 메시지의 전송 시간을 분석하기 위해 이 메시지가 링크를 통해 전송되지 못하고 대기할 확률인 전송 대기 확률을 분석한다. 이들 메시지의 전송 대기 확률을 분석하기 위해 메시지가 각 링크에서 전송되지 못하고 대기해야 하는 시간인 전송 대기 시간을 분석한다. 또 디스크 서비스 요구 메시지의 전송을 위해 링크가 사용되는 비를 분석하며, 메시지의 전송 대기 확률, 전송 대기 시간, 메시지 전송을 위해 링크가 사용될 비를 이용하여 디스크 서비스 요구 메시지의 전송 시간을 분석한다. Abstract Mirrored Declustering Disk System(MDDS) is the disk system to enhance the performance of disk system for hypercube. In MDDS, each node stores the disk blocks using the declustering technique. And the node also duplicates the disk blocks stored in neighboring nodes. In this paper, as the leading research for analyzing the disk service time, we analyze the transmission time of the disk service request message from the source node to the destination node. To analyze the transmission time of disk service request message, we analyze the probability of blocking the message related to the disk service request. For the analysis of the blocking probability, we analyze the blocking time at the link. We also analyze the rate at which the transmission link is used for transferring the disk service requests. And we analyze the transmission time of disk service request message by using the blocking probability, the blocking time, and the usage rate of link for transmitting the message.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.85-92
• /
• 2000

Channel management is critical in designing a cellular mobile system that offers high capacity and high quality. In this paper, an integrated channel management scheme is proposed, which consists of a dynamic channel allocation scheme and an admission control scheme. The dynamic channel allocation scheme allocates a call request the channel which minimizes the impact on its interfering cell, and consists of two types of channel allocation strategies : nominal channel allocation strategy and non-nominal channel allocation strategy. The admission control scheme named the variable cutoff priority scheme reserves some frequency channels for handoff cells in each cell the number of which varies according to the blocking probability of handoff class in that cell. Computationl tests are performed to evaluate the performance of the proposed scheme in terms of overall blocking probability, defined by the weighted value of the blocking probabilities of new calls and handoff calls. The results show that the proposed scheme yields better performance than other compared schemes.

• 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 Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2215-2227
• /
• 1994

A multicast switch, which can provide a single uniform switching function for vastly different classes of traffic, is crucial for the successful deployment of intergrated broadband networks. In this paper, we study the call blocking probability of heterogeneous circuit emulated traffic in a multicast switch. A previous work on the analysis of homogeneous traffic, where all calls have the same fan-out, show the performance showed that the call blocking probability increases rapidly as fan out increases. We study the performance of heterogeneous traffic, which consists of calls of different fan out, and show the performance gaps between larger fan-out traffic and smaller fan-out traffic are larger than those of homogeneous traffic these results indicate the necessity of efficient resource allocation policies to improve the performance of multicast calls. We conclude the paper introducing several methods to improve the performance of multicast traffic.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.