Harmonic buffer management policy for shared memory switches

In this paper we consider shared-memory switches. We introduce a novel general nonpreemptive buffer management scheme, which considers the queues ordered by their size. We propose a new scheduling policy, based on our general scheme, which we call the Harmonic policy. We analyze the performance of the Harmonic policy by means of competitive analysis and demonstrate that its throughput competitive ratio is at most ln(N) + 2, where N is the number of output ports. We also present a lower bound of Ω(log N/log log N) on the performance of any online deterministic policy. Our simulations also show that the Harmonic policy achieves high throughput and easily adapts to changing load conditions.

[1]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of ethernet LAN traffic at the source level , 1995, SIGCOMM '95.

[2]  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.

[3]  M. Irland,et al.  Buffer Management in a Packet Switch , 1978, IEEE Trans. Commun..

[4]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

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

[6]  Boaz Patt-Shamir,et al.  Buffer overflow management in QoS switches , 2001, STOC '01.

[7]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

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

[9]  Takahiko Kozaki,et al.  32*32 shared buffer type ATM switch VLSIs for B-ISDN , 1991, ICC 91 International Conference on Communications Conference Record.

[10]  Yishay Mansour,et al.  Competitve buffer management for shared-memory switches , 2001, SPAA '01.

[11]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[12]  Yishay Mansour,et al.  Competitive queue policies for differentiated services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams (extended abstract) , 2000, PODC.

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

[15]  H. Kroner.  Comparative performance study of space priority mechanisms for ATM networks , 1990, INFOCOM 1990.

[16]  John A. Copeland,et al.  Buffer management for shared-memory ATM switches , 2000, IEEE Communications Surveys & Tutorials.

[17]  Fabio M. Chiussi,et al.  Dynamic partitioning: a mechanism for shared memory management , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  P. Pruthi,et al.  Heavy-tailed on/off source behavior and self-similar traffic , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[19]  Yishay Mansour,et al.  Loss-bounded analysis for differentiated services , 2001, ACM-SIAM Symposium on Discrete Algorithms.

[20]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[21]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[22]  Ashok K. Agrawala,et al.  On the Design of Optimal Policy for Sharing Finite Buffers , 1984, IEEE Trans. Commun..

[23]  Andras Veres,et al.  The chaotic nature of TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[24]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.