Harmonic buffer management policy for shared memory switches

We introduce a new general scheme for shared memory nonpreemptive scheduling policies. Our scheme utilizes a system of inequalities and thresholds and accepts a packet if it does not violate any of the inequalities. We demonstrate that many of the existing policies can be described using our scheme, thus validating its generality. We propose a new scheduling policy, based on our general scheme, which we call the harmonic policy. Our simulations show that the harmonic policy both achieves high throughput and easily adapts to changing load conditions. We also perform a theoretical analysis of the harmonic policy and demonstrate that its throughput competitive ratio is almost optimal.

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

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

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

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

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

[6]  Hans Kröner,et al.  Comparative performance study of space priority mechanisms for ATM networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  Takahiko Kozaki,et al.  32 x 32 Shared Buffer Type ATM Switch VLSI's for B-ISDN's , 1991, IEEE J. Sel. Areas Commun..

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

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

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

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

[12]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[13]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

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

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

[16]  L. Lipsky,et al.  Analytic Model of Performance in Telecommunication Systems, Based on On-oo Traac Sources with Self-similar Behavior , 1999 .

[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]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

[19]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams , 2004, PODC '00.

[20]  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).

[21]  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).

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

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

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

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

[26]  Boaz Patt-Shamir,et al.  Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..

[27]  I. Buffer Management in a Packet Switch , 2022 .