• Title/Summary/Keyword: Buffer and Burst

Search Result 53, Processing Time 0.023 seconds

Buffer Management Algorithms in Unbounded Buffers

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.721-724
    • /
    • 2010
  • In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

On Statistical Multiplexing of Data Signals with Dynamic Buffer Control (Buffer의 동적제어에 의한 데이터 신호의 통계적 다중화에 관한 연구)

  • 김낙명;은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.3
    • /
    • pp.61-68
    • /
    • 1983
  • In this paper various aspects of statistical maltiplexing of data signs have been investigated. A queueing model with finite waiting room and batch poisson arrivals is studied assuming that data signals are transmitted at a constant rate. Using traffic intensity and average burst length as parameters, overflow probabilities and expected queueing delay due to buffering are obtained. Also, a real system model of a statistical multiplexer that can be directly used in micro-programmed hardware realization is proposed. To examine the performance of the system, computer simulation has been done at various conditions. The results obtained can be used in designing a buffer efficiently.

  • PDF

A Study on the Performance Analysis of Broadband ISDN Traffic (광대역 ISDN의 트래픽 성능분석에 관한 연구)

  • 구창회;박광채;이재호
    • 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.

  • PDF

A Practical Connection Admission Control Scheme in ATM Networks (ATM망에서 실용적 연결수락제어 기법)

  • Kang, Koo-Hong;Park, Sang-Jo
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.181-187
    • /
    • 2002
  • Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

An Effective BECN Typed QoS Guaranteeing Mechanism in Optical Burst Switching Networks (광 버스트 교환망에서 BECN 방식의 효과적인 QoS 보장 방법)

  • Choi Young-Bok
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.441-446
    • /
    • 2006
  • In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. The OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However, the OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method to minimize burst loss in the deflection routing based networks. In addition, we propose a QoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

A Study of ATM Switch Performance Analysis in Consideration of Cell Processing Due Time and Priority (셀 처리 요구 시간 및 우선 순위를 고려한 ATM 스위치의 성능 분석에 관한 연구)

  • 양우석;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1910-1916
    • /
    • 1999
  • This paper suggested to solve ATM switch performance and service rate which was input buffer managed scheme in ATM network with burst traffic characteristics, For this purpose, ATM multiplexer is prepared before sending for handling burst random input traffic to multiplex and then sort based on cell inter-arrival time and cell processing due time which had been marked after that. The server looks for cell header with the most shortest due time and sends it, thus it is satisfied that real time traffic for instance CBR and rt-VBR was guaranteed cell processing time to send fast than non real time traffic. For analysis of ATM switch performance with cell processing due time and priority, each output port has divided into four different virtual buffer and each buffer has assigned different cell inter-arrival time and processing due time according to ATM Forum for example CBT/rt-VBR, nrt-VBR, ABR and UBR and showed it’s optimal service parameters then analyzed service rate behaviors according to each traffic characteristics.

  • PDF

DRAM Buffer Data Management Techniques to Enhance SSD Performance (SSD 성능 향상을 위한 DRAM 버퍼 데이터 처리 기법)

  • Im, Kwang-Seok;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.7
    • /
    • pp.57-64
    • /
    • 2011
  • To adjust the difference of bandwidth between host interface and NAND flash memory, DRAM is adopted as the buffer management in SSD (Solid-state Disk). In this paper, we propose cost-effective techniques to enhance SSD performance instead of using expensive high bandwidth DRAM. The SSD data can be classified into three groups such as user data, meta data for handling user data, and FEC(Forward Error Correction) parity/ CRC(Cyclic Redundancy Check) for error control. In order to improve the performance by considering the features of each data, we devise a flexible burst control method through monitoring system and a page based FEC parity/CRC application. Experimental results show that proposed methods enhance the SSD performance up to 25.9% with a negligible 0.07% increase in chip size.

Energy Saving Characteristics on Burst Packet Configuration Method using Adaptive Inverse-function Buffering Interval in IP Core Networks (IP 네트워크에서 적응적 역함수 버퍼링 구간을 적용한 버스트패킷 구성 방식에서 에너지 절약 특성)

  • Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.8
    • /
    • pp.19-27
    • /
    • 2016
  • Nowadays the adaptive buffering techniques for burst stream packet configuration and its operation algorithm to save energy in IP core network have been studied. This paper explains the selection method of packet buffering interval for energy saving when configuring burst stream packet at the ingress router in IP core network. Especially the adaptive buffering interval and its implementation scheme are required to improve the energy saving efficiency at the input part of the ingress router. In this paper, we propose the best adaptive buffering scheme that a current buffering interval is adaptively buffering scheme based on the input traffic of the past buffering interval, and analyze its characteristics of energy saving and end-to-end delay by computer simulation. We show the improvement of energy saving effect and reduction of mean delay variation when using an appropriate inverse-function selecting the buffering interval for the configuration of burst stream packet in this paper. We confirm this method have superior properties compared to other method. The proposed method shows that it is less sensitive to the various input traffic type of ingress router and a practical method.

The Relation of CLR and Blocking Probability for CBR Traffic in the Wireless ATM Access Network

  • Lee, Ha-Cheol;Lee, Byung-Seub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1158-1163
    • /
    • 2002
  • In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.

The Improved Dual Leaky Bucket Algorithm for Multimedia Synchronization (미디어동기화를 위한 개선된 Dual Leaky Bucket 알고리즘)

  • 최용길;이기영
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.50-53
    • /
    • 1998
  • In this paper, the modified Usage Parameter Control(UPC) method based on Dual Leaky Bucket algorithm is proposed to improve the perfor mance of multimedia synchronization and to control burst traffic. In the proposed algorithm, Synchronous cells are by passed to the 2nd stage Leaky Bucket (LB) of the DLB. for overloaded traffic condition, the violated cells are saved in a temporary buffer and they are retransmitted when the 2nd stage bucket is empty.

  • PDF