Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Threshold-based Filtering Buffer Management Scheme in a Shared Buffer Packet Switch

  • Yang, Jui-Pin (Department of Electrical Engineering, National Chung Cheng University) ;
  • Liang, Ming-Cheng (Department of Electronic Engineering, I-Shou University) ;
  • Chu, Yuan-Sun (Department of Electrical Engineering, National Chung Cheng University)
  • Published : 2003.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.

Keywords

References

  1. M. G. Hluchyj and M. J. Karol, 'Queuing in high-performance packetswitching,' IEEE J. Setect. Areas Commun., vol. 6, no. 9, pp. 1587-1597, 1988 https://doi.org/10.1109/49.12886
  2. M. I.Irtand, 'Buffer management in a packet switch,' IEEE Trans. Com-mun., vol. COM-26, pp. 328-337, 1978
  3. F. Kamoun and L. Kleinrock, 'Analysis of shared finite storage in a cornputer node environment under general traffic conditions,' IEEE Trans.Commun., vol. COM-28, pp. 992-1003, 1980
  4. A. K. Choudhury and E. L. Hahne, 'Dynamic queue length thresholds forshared-memory packet switches,' IEEE/ACM Trans. Networking, vol. 6,no.2,PP.130-140. 1998 https://doi.org/10.1109/90.664262
  5. E. L. Hahne and A. K. Choudhury, 'Dynamic queue length thresholds formultiple loss priorities,' IEEE/ACM Trans. Networking, vol. 10, no. 3, pp.368-380, 2002 https://doi.org/10.1109/TNET.2002.1012368
  6. S. Kiishnan, A. K. Choudhury, and F. M. Chiussi, 'Dynamic partition-ing: A mechanism for shared memory management,' in Proc. IEEE IN-F0C0M'99, 1999, pp. 144-152
  7. K. Kumaran and D. Mitra, 'Performance and Huid simulations of a novelshared buffer management system,' Proc. IEEE 1NF0C0M'98, 1998. pp.1449-1461
  8. R. Fan et at., 'An optimal buffer management scheme with dynamicthresholds,' Proc. IEEE GLBEC0M'99, 1999, pp. 631-637
  9. Y. S. Chu et at., 'Partial sharing and partial partitioning buffer management scheme for shared buffer packet switches,' IEICE Trans. Commun.,vol. E85-B,no.1,pp.79-88, 2002
  10. J. P. Yang et aI, 'Dynamic thresholds for shared buffer switches with vari-able length packets,' Proc. IEEE HPSR2002, 2002, pp. 3b.1.1-3b.1.4
  11. S. X. Wei, E. J. Coyle, and M-T. T. Hsiao, 'An optimal buffer managementpolicy for high-performance packet switching,' in Prvc. IEEE GLOBE-C0M'91.1991, pp. 924-928
  12. H. Kroner et al., 'Priority management in ATM switching nodes,' IEEE J.Select. Areas Commun., vol. 9, no. 3, pp. 418-427, 1991 https://doi.org/10.1109/49.76641
  13. C. G. Kang and H. H. Tan, 'Queuing analysis of explicit policy assign-ment push-out buffer sharing schemes for ATM networks,' in Proc. IEEEINF0C0M'94, 1994, pp. 4c.1.1-4c.1.10
  14. A. K. Choudhury and E. L. Hahne, 'Space priority management in ashared memory ATM switch,' in Proc. IEEE GL0BEC0M'93, 1993, pp.1375-1383
  15. C. G. Kang and H. H. Tan, 'Queuing analysis of explicit policy assign-ment push-out buffer sharing schemes for ATM networks,' in Proc. IEEEINF0C0M'94, 1994, pp. 4c.1.1-4c.1.10
  16. I. Cidon, L. Georgiadis, and R. Giierin, 'Optimal buffer shahng,' IEEE J.Setect. Areas Commun., vol. 13, no. 7, pp. 1229-1239, 1995 https://doi.org/10.1109/49.414642
  17. S. Sharma and Y. Viniotis, 'Optimal buffer management policies forshared-buffer ATM switches,' IEEE/ACM Trans. Networking, vol. 7, no. 4. pp.575-587,1999 https://doi.org/10.1109/90.793030
  18. A. K. Choudhury and E. L. Hahne, 'New implementation of multi-prioritypushout for shared memory ATM switches,' Comput. Commun., vol. 19, pp. 245-256, 1996 https://doi.org/10.1016/0140-3664(96)01055-9
  19. L. Kleinrock, Queuing Systems, vol. I: Theory, New York: WileyInterscience, 1975
  20. E. B. Saff and A. D. Snider, fundamentals ofcomplex analysis for mathematics, science, and engineering, New Jersey: Prentice Hall, 1993
  21. V. Paxson and S. Floyd, 'Wide-area traffic: The failure ofpoisson modeling,' in Proc. ACM SIGC0MM'94, 1994, pp. 257-268
  22. M. E. Crovella and A. Bestavros, 'Self-similahty in World Wide Web traf-lic: Evidence and possible causes,' IEEE/ACM Trans. Networking, vol. 5, no. 4, pp. 835-846, 1997 https://doi.org/10.1109/90.650143
  23. S. Dill et al., 'Self-similarity in the web,' ACM Trans. Internet Technol.pp.205-223, 2002
  24. S. Floyd and V. Jacobson, 'Random early detection gateways for conges-tion avoidance,' IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 397-413, 1993 https://doi.org/10.1109/90.251892