• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.123-126
• /
• 2000

In this paper, we are proposed to pushing window input buffer A.T.M Switch that is not use memory read and write of general window police. Pushing window switch is superior to general window switch in performance but is large to general window switch in cross point number. Max throughput and Cell occupying probability results are verified by analysis an simulation. The evaluation of performance is max throughput and cell loss probability and mean queue length.

• Journal of Korea Multimedia Society
• /
• v.21 no.4
• /
• pp.493-498
• /
• 2018

In this paper, we provide the performance analyses of a dual-hop amplify-and-forward(AF) relay transmission composed of asymmetric radio-frequence(RF) and free-space optical(FSO) links. In the mixed RF/FSO system, a relay is equipped with two receive antennas for RF signals and one additional transmit antenna for FSO signals. In order to improve a performance of RF link, a switch-and-stay (SSC) diversity technique is applied at the relay which can provide a proper link performance with a low complexity. Specifically, we offer the performance analyses of the proposed system in terms of outage probability and secrecy outage probability. In numerical examples, we compare the system performances with no diversity and selection combining systems and verify our analytical results via computer-based Monte-Carlo simulations.

• Journal of the Korea Society for Simulation
• /
• v.8 no.4
• /
• pp.1-8
• /
• 1999

This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.139-156
• /
• 1993

Various ATM switches have been proposed since Asynchronous Transfer Mode (ATM) was recognized as appropriate for implementing broadband integrated services digital network (BISDN). An ATM switching network may be evaluated on two sides : traffic performances (maximum throughput, delay, and packet loss probability, etc.) and structural features (complexity, i.e. the number of switch elements necessary to construct the same size switching network, maintenance, modularity, and fault tolerance, etc.). ATM switching networks proposed to date tend to show the contrary characteristics between structural features and traffic performance. The Knockout Switch, which is well known as one of ATM switches, shows a good traffic performance but it needs so many switch elements and buffers. In this paper, we propose an input and output buffered Knockout Switch for the purpose of reducing the number of switch elements and buffers of the existing Knockout Switch. We analyze the traffic performance and the structural features of the proposed switching architecture through a discrete time Markov chain and compare with those of the existing Knockout Switch. It was found that the proposed architecture could reduce more than 40 percent of switch elements and more than 30 percent of buffers under a given requirement of cell loss probability of the switch.

• 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.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 the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.35-45
• /
• 1999

This paper presents an interconnection network for load balancing on a multimedia server and proposes a simple probabilistic model of the interconnection network for analysing the traffic characteristics. Because the switch uses deflection algorithm for routing, the traffic load on the switch seriously affects deflection probability. In this paper, we trace the deflection probability as a function of the traffic load according to the model. By comparing the result with the empirical result, we prove that the model is useful for estimating the deflection probability and traffic saturation point against the amount of packets getting into the switch.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.79-81
• /
• 1987

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

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.1-5
• /
• 1999

An ATM switch is the basic component of an ATM network, and its functioning is to switch incoming cells arriving at an input port to the output port associated with an appropriate virtual path. In case of an ATM switch with buffer sharing scheme, the performance analysis is very difficult due to the interactions between the address queues. In this paper, the influences of the degree of traffic burstiness and some traffic routing properties are investigated by using the simulation. Also, some cell access strategies including priority access and cell dropping are compared in terms of cell loss probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1922-1931
• /
• 1999

A multicast traffic’s feature is the function of providing a point to multipoints cell transmission, which is emerging from the main function of ATM switch. However, when a conventional point-to-point switch executes a multicast function, the excess load is occurred because unicast cell as well as multicast cell passed the copy network. Additionally, due to the excess load, multicast cells collide with other cells in a switch. Thus a deadlock that losses cells raises, extremely diminishes the performance of switch. An input queued switch also has a defect of the HOL (Head of Line) blocking that less lessens the performance of the switch. In the proposed multicast switch, we use shared memory switch to reduce HOL blocking and deadlock. In order to decrease switch’s complexity and cell's processing time, to improve a throughput, we utilize the method that routes a cell on a separated paths by traffic pattern and the scheduling algorithm that processes a maximum 2N cell at once in the control part. Besides, when cells is congested at an output port, a cell loss probability increases. Thus we use the Output Memory (OM) to reduce the cell loss probability. And we make use of the method that stores the assigned memory (UM, MM) with a cell by a traffic pattern and clears the cell of the Output memory after a fixed saving time to improve the memory utilization rate. The performance of the proposed switch is executed and compared with the conventional policy under the burst traffic condition through both the analysis based on Markov chain and simulation.