• 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 Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2117-2126
• /
• 1998

본 논문에서는 내부 스피드업을 갖는 배처-베니안 망 스위칭 구조에 관한 분석적 모델을 제안하고 성능분석 결과를 제시한다. 또한, 이 모델에서 다양한 큐잉 기법들이 다른 트래픽 분포하에서 비교된다. 높은 스위칭 스피드업을 갖는 배처-베니안 망에서, 입력 및 출력 트래픽 분포에 영향을 받는 버퍼링 기법의 성능은 전체 스위칭 망의 성능에 커다란 영향을 주게 된다. 따라서 본 고에서는 제안된 모델링 기법을 사용하여 베니안 망들의 큐잉 기법을 분석하며, 큐잉 기법을 통하여 큐잉 성능과 입력 트래픽의 관계를 규명한다.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.95-104
• /
• 2002

This paper presents some studies on the Internet TCP/IP(Transmission Control Protocol-Internet Protocol) traffic over ATM(Asynchronous Transfer Mode) UBR(Unspecified Bit Rate) and ABR(Available Bit Rate) classes of service. Fuzzy logic prediction has been used to improve the efficiency and fairness of traffic throughput. For TCP/IP over UBR, a novel fuzzy logic based cell dropping scheme is presented. This is referred to as fuzzy logic selective cell drop (FSCD). A key feature of the scheme is its ability to accept or drop a new incoming packet dynamically based on the predicted future buffer condition in the switch. This is achieved by using fuzzy logic prediction for the production of a drop factor. Packet dropping decision is then based on this drop factor and a predefined threshold value. Simulation results show that the proposed scheme significantly improves TCP/IP efficiency and fairness. To study TCP/IP over ABR, we applied the fuzzy logic ABR service buffer management scheme from our previous work to both approximate and exact fair rate computation ER(Explicit cell Rate) switch algorithms. We then compared the performance of the fuzzy logic control with conventional schemes. Simulation results show that on zero TCP packet loss, the fuzzy logic control scheme achieves maximum efficiency and perfect fairness with a smaller buffer size. When mixed with VBR traffic, the fuzzy logic control scheme achieves higher efficiency with lower cell loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1190-1200
• /
• 1993

In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.448-456
• /
• 2003

In this parer, an ABR (Available Bit Rate) congestion control algorithm for voice transmission in ATM networks was proposed. To deal with the network congestion problem, not only the buffer level of a switch but also the variation of the buffer level were considered. Also, to resolve the unfairness among sources where the bit transfer rates vary, a loading factor that is used to adjust the bit rate was introduced. To show the superiority of this paper over others, simulation was done with a network of 7 voice sources and 4 switches, which was represented by Petri net model. ExSpect was used for simulation. The simulation results showed that there was improvement in network utilization and that unfairness among sources were resolved a lot.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.52-63
• /
• 1998

In this paper, several improvements to a copy network proposed previously for multicast packet switching are described. The improvements provide a solution to some problems inherent in multicasting. The input fairness problem caused by overf low is solved by a dynamic starting point decider(DSD), which can calculate running sums of copy requests starting from any input port. The starting point is changed adaptively in every time slot based on both the fill level of the input buffers in current time slot and the overflow situations of the previous time slot. Using the fill level of the conventional network. The DSD also provides the function of regulating overall copy requests according to the amount of input traffics. This is an essential function in improving overall throughputs of the copy networks. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the DSD in a straightforward manner. The hardware for the DSD is derived with the objective of simple architectures for the high speed operation. Simulation study of the copy network under various traffic conditions is presented to evaluate its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1926-1940
• /
• 1998

This paper is the part II of research results on the performance evaluation of fully interconnected ATM switch, and includes the performance evaluation results for bursty traffic and nonuniform distribution. The switch model is a fyully interconnected switch type proposed by ETRI and is the proper architecutre for a small-sized switch element. The proposed switch consists of two steps of buffering scheme in the switch fabric in order to effectively absorb the effect of bursty nature of ATM traffic. The switch uses bit addressing method for addressing shcmeme and thus it is easy to implement multicasting function without adding additional functional block. In order to incorporate the bursty nature of traffic in ATM networks, we use IBP(Interrupted Bernoulli Process) model as an input traffic model as well as random traffic model which has been used as a traditional traffic model. In order to design the various scenarios for simulation, we considered both uniform and nonuniform output distribution, and also implemented multicast function. In this paper, we presented the simulation results in diverse environments and evaluated the performance of the switch.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.2
• /
• pp.134-145
• /
• 2004

With rapid growth in the amount of data transferred on the Internet, traditional storage systems have reached the limits of their capacity and performance. SAN (Storage Area Network), which connects hosts to disk with the Fibre Channel switches, provides one of the powerful solutions to scale the data storage and servers. In this environment, the maintenance of data consistency among hosts is an important issue because multiple hosts share the files on disks attached to the SAN. To preserve data consistency, each host can execute the disk I/O whenever disk read and write operations are requested. However, frequent disk I/O requests cause the deterioration of the overall performance of a SAN cluster. In this paper, we introduce a SANtopia global buffer manager to improve the performance of a SAN cluster reducing the number of disk I/Os. We describe the design and algorithms of the SANtopia global buffer manager, which provides a buffer cache sharing mechanism among the hosts in the SAN cluster. Micro-benchmark results to measure the performance of block I/O operations show that the global buffer manager achieves speed-up by the factor of 1.8-12.8 compared with the existing method using disk I/O operations. Also, File system micro-benchmark results show that SANtopia file system with the global buffer manager improves performance by the factor of 1.06 in case of directories and 1.14 in case of files compared with the file system without a global buffer manager.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.980-988
• /
• 1993

In this paper, performance of 8-ISDN traffic for the buffer size which is requested of important parameters in switch/multiplexer of B-ISDN with multimedia traffic is analyzed. Multimedia traffic is modeled as a traffic, which is composed of poisson distribution traffic and burst traffic with exponential/geometric ON time duration(Burst duration) Performance of traffic which is modeled as a multimedia traffic is analysed and buffer size, can provide the high quality service, is presented for the cell loss probability. It is simulated using event scheduling approach method which is provided by simulation package, PC SIMSCRIPT II.5. Simulation program is composed of PREAMBLE, MAIN, INITIAL, ARRIVAL, DEPARTURE and STOP·SIM modules. Specially, in case of mixed traffic simulation, ARRIVAL module is composed of ARRIVAL I and ARRIVAL II, and cells are generated independently by each module.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2275-2282
• /
• 1999

In ATM networks, bandwidth allocation using available bandwidth is important to control ABR traffic efficiently. However, it is difficult to dynamically assign bandwidth on bursty traffic, because the tracking of the existing available bandwidth information uses statistical value. In this paper, we propose a output-bufferd ATM switch using Per-VC queueing scheme with timer and Controller. The controller determines whether each VC is in congestion state or not, and the timer can assign dynamically as determining the available bandwidth for the Present period by Backlogged time and total link capacity, and then transmitting the determined bandwidth to source. Instead of using statistical parameters, the proposed scheme can improve link efficiency as allocating the bandwidth of the next period, by use of measured bandwidth during the current period.