Dynamic neural-based buffer management for queuing systems with self-similar characteristics

Buffer management in queuing systems plays an important role in addressing the tradeoff between efficiency measured in terms of overall packet loss and fairness measured in terms of individual source packet loss. Complete partitioning (CP) of a buffer with the best fairness characteristic and complete sharing (CS) of a buffer with the best efficiency characteristic are at the opposite ends of the spectrum of buffer management techniques. Dynamic partitioning buffer management techniques aim at addressing the tradeoff between efficiency and fairness. Ease of implementation is the key issue when determining the practicality of a dynamic buffer management technique. In this paper, two novel dynamic buffer management techniques for queuing systems accommodating self-similar traffic patterns are introduced. The techniques take advantage of the adaptive learning power of perceptron neural networks when applied to arriving traffic patterns of queuing systems. Relying on the water-filling approach, our proposed techniques are capable of coping with the tradeoff between packet loss and fairness issues. Computer simulations reveal that both of the proposed techniques enjoy great efficiency and fairness characteristics as well as ease of implementation.

[1]  Parag Pruthi,et al.  An application of deterministic chaotic maps to model packet traffic , 1995, Queueing Syst. Theory Appl..

[2]  Walter Willinger,et al.  Statistical analysis of CCSN/SS7 traffic data from working CCS subnetworks , 1994, IEEE J. Sel. Areas Commun..

[3]  Luigi Fratta,et al.  ATM: bandwidth assignment and bandwidth enforcement policies , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

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

[5]  Jon W. Mark,et al.  A buffer allocation scheme for ATM networks: complete sharing based on virtual partition , 1995, TNET.

[6]  George W. Irwin,et al.  A hybrid linear/nonlinear training algorithm for feedforward neural networks , 1998, IEEE Trans. Neural Networks.

[7]  San-qi Li,et al.  Predictive Dynamic Bandwidth Allocation for Efficient Transport of Real-Time VBR Video over ATM , 1995, IEEE J. Sel. Areas Commun..

[8]  Edmond A. Jonckheere,et al.  On the predictability of data network traffic , 2003, Proceedings of the 2003 American Control Conference, 2003..

[9]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

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

[11]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

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

[14]  K. Shah,et al.  On the performance limitation of active queue management (AQM) , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Walter Willinger,et al.  Statistical Analysis and Stochastic Modeling of Self-Similar Datatraffic , 1994 .

[16]  Anja Feldmann,et al.  Data networks as cascades: investigating the multifractal nature of Internet WAN traffic , 1998, SIGCOMM '98.

[17]  John A. Silvester,et al.  Priority Queueing Strategies and Buffer Allocation Protocols for Traffic Control at an ATM Integrated Broadband Switching System , 1991, IEEE J. Sel. Areas Commun..

[18]  Steven H. Low,et al.  Equilibrium bandwidth and buffer allocations for elastic traffics , 2000, TNET.

[19]  Jui-Pin Yang Performance analysis of threshold-based selective drop mechanism for high performance packet switches , 2004, Perform. Evaluation.

[20]  G. J. Foschini,et al.  Sharing Memory Optimally , 1983, IEEE Trans. Commun..

[21]  Jui-Pin Yang Performance analysis of threshold-based selective drop mechanism for high performance packet switches , 2004, Perform. Evaluation.

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

[23]  Marwan Krunz,et al.  Application of chaos theory to the modeling of compressed video , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[24]  Abdelnaser Adas,et al.  Traac Models in Broadband Networks , 1997 .

[25]  David Tipper,et al.  Adaptive policies for optimal buffer management in dynamic load environments , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[26]  Kangbok Lee,et al.  Parallel machine scheduling under a grade of service provision , 2004, Comput. Oper. Res..

[27]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

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

[29]  Donald F. Towsley,et al.  Efficient admission control for EDF schedulers , 1997, Proceedings of INFOCOM '97.

[30]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[31]  Laurie Cuthbert,et al.  An accelerated simulation technique for modelling burst scale queueing behaviour in ATM , 1994 .

[32]  Kathleen S. Meier-Hellstern,et al.  TRAFFIC MODELS FOR ISDN DATA USERS: OFFICE AUTOMATION APPLICATION , 1991 .

[33]  Nelson Luis Saldanha da Fonseca,et al.  On the equivalent bandwidth of self-similar sources , 2000, TOMC.

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

[35]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[36]  Scott E. Fahlman,et al.  An empirical study of learning speed in back-propagation networks , 1988 .

[37]  John A. Silvester,et al.  Time scale analysis of an ATM queueing system with long-range dependent traffic , 1997, Proceedings of INFOCOM '97.

[38]  Guy Latouche Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies , 1980, IEEE Trans. Commun..

[39]  Gang Uk Hwang,et al.  Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy , 2004, Comput. Oper. Res..

[40]  Hamid Jafarkhani,et al.  Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach , 2004, HSNMC.

[41]  Yishay Mansour,et al.  Harmonic buffer management policy for shared memory switches , 2004, Theor. Comput. Sci..

[42]  Parag Pruthi,et al.  Chaotic Maps As Models of Packet Traffic , 1994 .

[43]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[44]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[45]  A. Adas,et al.  Traffic models in broadband networks , 1997, IEEE Commun. Mag..

[46]  E. L. Hahne,et al.  Dynamic queue length thresholds for multipriority traffic , 1997 .

[47]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[48]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[49]  David K. Arrowsmith,et al.  The autocorrelation of double intermittency maps and the simulation of computer packet traffic , 2004 .

[50]  E. L. Hahne,et al.  Dynamic queue length thresholds for multiple loss priorities , 2002, TNET.

[51]  Satish K. Tripathi,et al.  Buffer Sharing in Dynamic Load Environment , 1984, IEEE Conference on Computer Communications.

[52]  Daniela Panno,et al.  An adaptive fuzzy threshold scheme for high performance shared-memory switches , 2001, SAC.

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

[54]  Moshe Zukerman,et al.  Fractal traffic: measurements, modelling and performance evaluation , 1995, Proceedings of INFOCOM'95.

[55]  Debasis Mitra,et al.  Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes , 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).

[56]  Walter Willinger,et al.  Long-range dependence in variable-bit-rate video traffic , 1995, IEEE Trans. Commun..

[57]  Yu-Sheng Lin,et al.  Quasi-pushout cell discarding , 1997, IEEE Communications Letters.