Pushout with virtual thresholds buffer management scheme in a shared buffer ATM switch

In this paper we investigate the performance metrics of buffer management schemes. In general, the selective pushout (SP) scheme can support very low loss probability of the high-priority cells, but it may cause unfairness of buffer allocation among different output queues and high overall cell loss probability. In order to fit the dynamic required performance metrics of ATM switches, a novel buffer management scheme called pushout with virtual thresholds (PVT) is proposed. In the PVT scheme, each output queue is guaranteed to increase in length until its virtual threshold (VT). Simulation results show the PVT can dynamically achieve the fairness and low overall cell loss probability or very low loss probability of the high priority cells by adequately adjusting the VT. Specially, when the VT = 0, the PVT control can be viewed as the SP control.

[1]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[2]  A. K. Choudhury,et al.  Space priority management in a shared memory ATM switch , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[3]  A. K. Choudhury,et al.  Dynamic queue length thresholds for shared-memory packet switches , 1998, TNET.

[4]  M. C. Liang,et al.  Partial Sharing and Partial Partitioning Buffer Management Scheme for Shared Buffer Packet Switches (Special Issue on Internet Technology II) , 2002 .

[5]  Edward J. Coyle,et al.  An optimal buffer management policy for high-performance packet switching , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[6]  Farouk Kamoun,et al.  Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions , 1980, IEEE Trans. Commun..

[7]  Yuming Liu,et al.  Multi-level threshold for priority buffer space management in ATM networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[8]  David W. Petr,et al.  Nested threshold cell discarding for ATM overload control: optimization under cell loss constraints , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[9]  Harry H. Tan,et al.  Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  Roch Guérin,et al.  Optimal Buffer Sharing , 1995, IEEE J. Sel. Areas Commun..

[11]  Chung Gu Kang,et al.  Queueing analysis of explicit priority assignment partial buffer sharing schemes for ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[12]  Hans Kröner,et al.  Priority Management in ATM Switching Nodes , 1991, IEEE J. Sel. Areas Commun..

[13]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Chie Dou,et al.  Performance Study of Buffer Control Schemes and Cell Discard Mechanisms in a Shared Buffer ATM Switch , 1998 .