• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.275-277
• /
• 1999

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.708-720
• /
• 1993

The new preventive control mechanisms for traffic management in BISDN/ATM networks can be divided into Connection Admission Control(CAC), Usage Parameter Control (UPC), and Priority Control. Of these mechanism, Usage Parameter Control continuously monitors the parameters admitted in the network's entry point to guarantee quality of service of connections already admitted. Upon detecting traffic that violates the negotiated parameter, it takes the necessary control measures to prevent congestion. Among these traffic control methods, this paper focuses on the Usage Parameter Control method, and proposes and designs GRACE-LB(Guaranteed Rate Acceptance & Control Element-using Leaky Bucket) which improves upon existing UPC models. GRACE-LB modifies the previous LB model by eliminating the cell buffer, dividing the token Pool into two pools, Long-term pool, Short-term pool, and changing the long-term token generating form using 'Cycle Token' into the same bursty form as the traffic source. Through this, GRACE-LB achieves effective control of the Average Bit Rate(ABR) and burst duration of bursty multimedia traffic which previous LB models found difficult to control. Also, since GRACE-LB can e implemented using only simple operations and there are no cell buffers in it, it has the merit of being easily installed at any place.

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

A cell scheduling method of Queue for the ATM switch is proposed and simulated. In this paper, we present the cell scheduling method proper to the proposed queue and the improved queue with Queue Sharing(QS) structure for CBR, VBR, ABR traffic. The proposed QS structure minimizes the CLS(Cell Loss Ratio) of ABR traffic and decreases the CLR of bursty VBR traffic. Also we propose a cell scheduling method using VRR(Variable Round Robin) scheme proper to the high-speed(ATM) switch. The VRR scheme provides a fairness in terms of service chance for the queues in the ATM switch as well as QOS of their cell delay characteristic of CBR and VBR traffic, QOS of ABR CLR. The simulation results show the proposed method achieves excellent CLR and average cell delay performance for the various ATM traffic services in the Queue Sharing structure.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.603-627
• /
• 1998

The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1756-1763
• /
• 2001

In this paper, we propose an ATM-LAN IWU(interworking unit) with threshold based dynamic bandwidth allocation scheme. We analyze a discrete-time based finite queueing model with deterministic service times in order to investigate the performance of the proposed scheme. It is known that the arrival process of IP packets is bursty. So we use an MMPP(Markov Modulated Poisson Process) to model the bursty input traffic. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effects of the thresholds on the performance of the DBAS(dynamic bandwidth allocation scheme).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.103-118
• /
• 1996

With the advent of B-ISDN based on ATM technonlogy, ther are increasing needs for the interconnection of existing LAN/MAN's through ATM networks. ATM networks, therefore, must provide connectionless service. In this paper, the traffic distributio scheme using multi-path is proposed to support efficient connectionless service in ATM networks. Because the proposed scheme distributed the bursty traffic arrived in the interworking unit (IWU) and the connectionless server (CLS) from LAN-terminals, it alleviates the packet loss ratio caused by buffer overflow at IWU/CLS and is able to use nettowrk resources efficiently according to the network conditions and the amount of the traffic arrived at IWU/CLS. This paper presents the distribution algorithm and the IWU/CLS, CLS-CLS closed-loop rate control scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1291-1293
• /
• 2007

Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.9
• /
• pp.1209-1218
• /
• 1995

In this paper, we develope an ATM switch simulator in order to evaluate the HAN/B-ISDN ATM switch currently being developed by ETRI. It models the basic cell switching functions of the target ATM switch with priority control and multicasting features and it also supports such various traffic models as random or bursty traffic, balanced or unbalanced traffic, multicast traffic models. Using this simulator, we can evaluate the performances of the ATM switch in terms of various performance indices, i.e. cell delay, cell loss probability, etc., and this simulator can be utilized in the system parameter tunings such as the common buffer size and address buffer size.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1811-1818
• /
• 2009

This paper is about the research to maintain and enhance the flow of data of the wireless traffic control. Various types of burst traffic that were found at TCP window flow control have been removed or mitigated using the two-way traffic control. Currently, TCP ACK Compression problem appears during the transmission of the wireless communication control channel because the queues are mostly located at the end system. Therefore, in this paper, the periodic bursty characterist of the source IP queue wilt be analyzed to predict the maximum value of queues. And then the prediction tool will be applied to wireless communication traffic control to handle symmetric traffic as to increase the throughput and improve the performance.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.227-237
• /
• 2008

In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.