• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.259-267
• /
• 1997

The advent of B-ISDN using ATM(asynchronous transfer mode) made possible a variety of new multimedia services, however it also created a problem of congestion control due to bursty nature of various traffic sources. To tackle this problem, UPC/NPC(user parameter control/network parameter control) have been actively studied and DRLB(dynamic rate leaky bucket) algorithm, in which the token generation rate is changed according to states of data source andbuffer occupancy, is a good example of the UPC/NPC. However, the DRLB algorithm has drawbacks of low efficiency and difficult real-time implementation for bursty traffic sources because the determination of token generation rate in the algorithm is based on the present state of network. In this paper, we propose a more plastic and effective congestion control algorithm by combining the DRLB algorithm and neural network based prediction to remedy the drawbacks of the DRLB algorithm, and verify the efficacy of the proposed method by computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.684-690
• /
• 2003

In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.633-638
• /
• 1994

Asynchronous Transfer Model(ATM) has a fixed-length packet transport scheme. It is one of promising proposals in Broadband ISDN(B-ISDN). Since the packet length is fixed, it can be potentially to perform the various service to user. In this paper, a queueing model for an ATM Multiplexer loaded by the Continuous Bit Rate(CBR) traffic and the bursty traffic sources is analyzed. The queueing system has a finite buffer size. The cell loss probabilities with the simple and recurcive form for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. The results of this study may be used as guidelines in buffer design problems and performance analysis of ATM multiplexing system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.117-120
• /
• 2001

In this paper, a contention-based reservation MAC protocol is proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability through the downlink control channel. Mobile terminals, which have a traffic burst, select randomly a RAS minislot and transmit the reservation request packet with the received transmission probability. The reservation request packet contains the number of packets in the buffer. The base station allocates slots based on the buffer status of the received reservation request packets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.117-124
• /
• 1998

As window sized increases, the throughput input-buffered packet switch with a window scheme improves on random traffic condition. However, the improvement diminishes quickly under bursty traffic. In this paper, we propose Burst Head Addressable FIFO mechanism and memory structure having search capability in unit of burst header to compensate the sensitiveness of the windowed scheme to bursty traffic. The performance of a input-buffered switch using the proposed Burst Header Addressable FIFO input buffer was analyzed using computer simulations. The maximum throughput of the conventional FIFO scheme approaches an asymptotic value 0.5 as mean burst length increases. The maximum throughput of the proposed scheme is greater than that of the conventional scheme for any mean burst length and window size.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.330-341
• /
• 2007

This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method. The PPS involves numerous packet switches that operate independently and in parallel. The conventional PPS dispatch algorithm adopts a round robin (RR) method. The class of PPS is characterized by deployment of parallel low-speed switches whose all memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SW-PPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR method. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW method. Under various operating conditions, our proposed model and analysis successfully exhibit these performance characteristics including throughput, cell delay, and cell drop rate.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.416-423
• /
• 2003

This paper proposes a continuous-time queuing model of a shared-buffer packet switch and an approximate algorithm. N arrival processes have heterogeneous busty traffic characteristics. The arrival processes are modeled by Coxian distribution with order 2 that is equivalent to Interruped Poisson Process. The service time is modeled by Erlang distribution with r stages. First the approximate algorithm performs the aggregation of N arrival processes as a single state variable. Next the algorithm discompose the queuing system into N subsystems which are represented by aggregated state variables. And the balance equations based on these aggregated state variables are solved for by iterative method. Finally the algorithm is validated by comparing the results with those of simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.707-715
• /
• 2003

In this paper, we propose a new MAC(Medium Access Control) protocol using Movable-boundary, which tries to guarantee Qos for multimedia traffic in the slotted CDMA system. In this scheme, the traffic scheduler assigns channel resource according to the packet priority per service class and adapts the Movable-boundary concept in which the minimum resource is assigned to each traffic class; the remaining resource if it is available can be assigned dynamically according to the temporal demand of other traffic classes. For performance analysis, we performed computer simulations to obtain throughput and packet loss rate and compared the results with Fixed-boundary system. We observed that the error rate of voice traffic could be maintained below a prescribed value while bursty traffic such as video source shares the same channel. In comparison with Fixed-boundary scheme, our protocol exhibits better throughput and packet loss rate performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.25-34
• /
• 2004

UMTS network, evolved from GSM, includes packet core network that consists of SGSNS and GGSNs. Service providers should consider subscriber mobility, location registration, and subscriber distribution when designing packet core networks and network elements. Since one of the major traffic sources for IMT-2000 will be data which has bursty characteristics, new design guidelines for dimensioning of SGSN and GGSN should be proposed under various constraints of system parameters. In this paper, we first evaluate the performance of signaling traffic for packet call subscribers. After that, we also obtain the impact of bursty data traffic on the SGSN and GGSN by simulation, and suggest new dimensioning guidelines for packet core network of UMTS under various environments.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.87-90
• /
• 1998

Many recent studies have been conducted involving the transport of constant and variable bit rate MPEG-2 video in asynchronous transfer mode (ATM) networks. In this study, the traffic control of supporting MPEG-2 video communications in ATM networks under unloaded or loaded network conditions, in which the generated traffic sources are bursty in nature, are considered. We analyse about MPEG-2 traffic and design a model, which makes use of the ATM OAM funcation in order to support the traffic control functions. To implement the model, we propose a scheme, which combines the performance management OAM function and the bandwidth allocation function. Especially, we design this scheme to control the VBR (Variable Bit Rate)MPEG-2 video traffic.