Performance analysis of threshold-based selective drop mechanism for high performance packet switches

Performance Evaluation

Volumn 57, Issue 1, 2004, Pages 89-103

  Yang, Jui Pin ^a  

^a INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE   (Taiwan)

Author keywords

Fairness; Robust; Selective drop; Threshold

Indexed keywords

COMPUTER SIMULATION; PROBABILITY; QUEUEING NETWORKS; RESOURCE ALLOCATION; ROBUSTNESS (CONTROL SYSTEMS); SWITCHES; TELECOMMUNICATION TRAFFIC;

FAIRNESS; ROBUST; SELECTIVE DROP; THRESHOLD;

PACKET NETWORKS;

EID: 1842842967     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2003.10.001     Document Type: Article

References (22)

1. Hluchyj M.G., Karol M.J. Queueing in high-performance packet switching. IEEE J. Sel. Areas Commun. 6(9):1988;1587-1597.
2. Irland M.I. Buffer management in a packet switch. IEEE Trans. Commun. COM-26:1978;328-337.
3. Kamoun F., Kleinrock L. Analysis of shared finite storage in a computer node environment under general traffic conditions. IEEE Trans. Commun. COM-28:1980;992-1003.
4. Choudhury A.K., Hahne E.L. Dynamic queue length thresholds for shared-memory packet switches. IEEE/ACM Trans. Networking. 6(2):1998;130-140.
5. Hahne E.L., Choudhury A.K. Dynamic queue length thresholds for multiple loss priorities. IEEE/ACM Trans. Networking. 10(3):2002;368-380.
6. R. Fan, A. Ishii, B. Mark, G. Ramamurthy, Q. Ren, An optimal buffer management scheme with dynamic thresholds, in: Proceedings of the GLBECOM'99, 1999, pp. 631-637.
7. Chu Y.S., Yang J.P., Wu C.S., Liang M.C. Partial sharing and partial partitioning buffer management scheme for shared buffer packet switches. IEICE Trans. Commun. E85-B(1):2002;79-88.
8. J.P. Yang, M.C. Liang, Y.S. Chu, C.S. Wu, Dynamic thresholds for shared buffer switches with variable length packets, in: Proceedings of the HPSR 2002, 2002, pp. 157-160.
9. S.X. Wei, E.J. Coyle, M.-T.T. Hsiao, An optimal buffer management policy for high-performance packet switching, in: Proceedings of the GLOBECOM'91, 1991, pp. 924-928.
10. Kroner H., Hebuterne G., Boyer P., Gravey A. Priority management in ATM switching nodes. IEEE J. Sel. Areas Commun. 9(3):1991;418-427.
11. C.G. Kang, H.H. Tan, Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks, in: Proceedings of the INFOCOM'94, 1994, pp. 4c.1.1-4c.1.10.
12. A.K. Choudhury, E.L. Hahne, Space priority management in a shared memory ATM switch, in: Proceedings of the GLOBECOM'93, 1993, pp. 1375-1383.
13. Cidon I., Georgiadis L., Guerin R. Optimal buffer sharing. IEEE J. Sel. Areas Commun. 13(7):1995;1229-1239.
14. Sharma S., Viniotis Y. Optimal buffer management policies for shared-buffer ATM switches. IEEE/ACM Trans. Networking. 7(4):1999;575-587.
15. Roy R., Panwar S.S. Efficient buffer sharing in shared memory ATM systems with space priority traffic. IEEE Commun. Lett. 6(4):2002;162-164.
16. Choudhury A.K., Hahne E.L. New implementation of multi-priority pushout for shared memory ATM switches. Comput. Commun. 19:1996;245-256.
17. Yang J.P., Chu Y.S., Liang M.C. Threshold-based selective drop for shared buffer packet switches. IEEE Commun. Lett. 7:2003;183-185.
18. I. Stoica, S. Shenker, H. Zhang, Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed network, in: Proceedings of the SIGCOMM'98, 1998, pp. 118-130.
19. Z. Cao, Z. Wang, E. Zegura, Rainbow fair bandwidth sharing without per-flow state, in: Proceedings of the INFOCOM 2000, 2000, pp. 922-931.
20. H. Li, K. Siu, H. Tzeng, C. Ikeda, H. Suzuki, TCP performance over ABR and UBR services in ATM, in: Proceedings of the IPCCC'96, 1996.
21. B. Braden et al., Recommendations on queue management and congestion avoidance in the Internet, RFC 2309.
22. A. Mankin, K. Ramakrishnan, Gateway congestion control survey, RFC 1254.