Modeling and Analysis of Adaptive Buffer Sharing Scheme for Consecutive Packet Loss Reduction in Broadband Networks

High speed networks provide realtime variable bit rate service with diversified traffic flow characteristics and quality requirements. The variable bit rate traffic has stringent delay and packet loss requirements. The burstiness of the correlated traffic makes dynamic buffer management highly desirable to satisfy the Quality of Service (QoS) requirements. This paper presents an algorithm for optimization of adaptive buffer allocation scheme for traffic based on loss of consecutive packets in data-stream and buffer occupancy level. Buffer is designed to allow the input traffic to be partitioned into different priority classes and based on the input traffic behavior it controls the threshold dynamically. This algorithm allows input packets to enter into buffer if its occupancy level is less than the threshold value for priority of that packet. The threshold is dynamically varied in runtime based on packet loss behavior. The simulation is run for two priority classes of the input traffic – realtime and non-realtime classes. The simulation results show that Adaptive Partial Buffer Sharing (ADPBS) has better performance than Static Partial Buffer Sharing (SPBS) and First In First Out (FIFO) queue under the same traffic conditions.

Authors:

• Sakshi Kausha
• R.K Sharma

Keywords:

• Buffer Management
• Consecutive packet loss
• Quality-of-Service
• Priority based packet discarding
• partial buffersharing.

References:

[1] S. Sahu, P. Nain, D. Towsley, C. Diot, and V. Fioroiu, "On achievable
Service differentiation with token bucket marking for TCP", Proceeding
of ACM SIGMETRICS, pp. 22-33, June 2000.
[2] D.D Clark, W. Fang, "Explicit Allocation of Best Effort Packet delivery
Scheme", IEEE/ACM Transactions on Networking, vol. 6, no.4, pp. 362-
373, August, 1998.
[3] J.W. Causey, H.S. Kim, "Comparison of buffer allocation schemes in
ATM switches: Complete sharing, partial sharing, and dedicated
allocation", International Conference on Communications, May
1994;Vol.2; pp.1164-1168.
[4] D. Mitra and I.Ziedins, "Virtual partitioning by dynamic priorities: Fair
and efficient resource-sharing by several services, Broadband
Communications: Network Services, Applications, Future Directions."
Lecture Notes in Computer Science, Spinger Verlag, 1996;pp. 173-185.
[5] Cho, Jeong-Woo, Dong Ho, "Dynamic buffer management scheme
based on rate estimation in packet-switched networks", Computer
Networks, August, 2002;Vol.39, No.6; pp.769-787.
[6] L.Georgiadis, I. Cidon, R. Guerin, and A. Khamisy, "Optimal Buffer
Sharing", IEEE J. Select. Areas Commun., Sept. 1995, vol. 13; pp. 1229-
1240,.
[7] A. K. Choudhury and E.L. Hahne, "Space Priority Management in a
shared Memory ATM Switch", in Proc. IEEE GLOBECOM -93, vol. 3,
(Houstan, Texas), Dec.1993; pp. 1375-1383.
[8] C. Dovrilis, P. Ramanathan, "Proportional differentiated services, part II:
Loss rate differentiation and packet dropping", Proceeding of IWQoS,
June 2000; pp.52-61.
[9] Czachovski T. and Peregrine F., "A queuing model for optimal control
of partial buffer sharing", In ATM Computer Operation Research, Feb
98. 25(2): 113-126.
[10] C. G. Kang and H.H. Tan, "Queuing analysis of explicit priority
assignment partial buffers haring schemes for ATM networks",
IEEE/ACM INFOCOM, March 1993;pp. 810-819.
[11] G. Ascia, V. Catania, and D. Panno, "An Efficient Buffer Management
Policy Based on An Integerated Fuzzy-Ga Approach", IEEE/ACM
INFOCOM, June 2002.