Maximum Throughput Analysis of a Datagram Switch for Broadband Networks

IEICE Transactions on Communications

Volumn E81-B, Issue 2, 1998, Pages 354-372

  Giacomazzl, Paolo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Analysis; Connectionless; Datagram; Maximum throughput; Switching

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; BROADBAND NETWORKS; DATA COMMUNICATION SYSTEMS; INTERCONNECTION NETWORKS; PACKET NETWORKS;

DATAGRAM SWITCHES; MAXIMUM THROUGHPUT ANALYSIS;

SWITCHING NETWORKS;

EID: 0031999464     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. CCITT Recommendation 1.371, Traffic control and congestion control in B-ISDN, CCITT, Geneva, 1992.
2. CCITT SG XVIII Draft Recommendation 1.150, BISDN ATM functional characteristics, Geneva, May 1990.
3. S. Bhagwat, D. Tipper, K. Balakrishnan, and A. Mahapatra, Comparative evaluation of output buffer management schemes in ATM networks, Proc. IEEE ICC'94, New Orleans, pp. 1174-1178, May 1994.
4. R. Chipalkatti, J. F. Kurose, and D. Toesley, Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer, Proc. IEEE INFOCOM'89, pp. 774-783, June 1989.
5. J. W. Causey and H. S. Kim, Comparison of buffer allocation schemes in ATM switches: Complete sharing, partial sharing and dedicated allocation, Proc. IEEE ICC'94, New Orleans, pp. 1164-1168, May 1994.
6. C. G. Chang and H. H. Tan, Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks, Proc. IEEE INFOCOM'94, pp. 500-509, June 1994.
7. H. J. Chao and H. Cheng, A New QOS-guaranteed cell discarding strategy: Self-calibrating pushout, Proc. IEEE GLOBECOM '94, San Fransisco, CA, 1994.
8. H. J. Chao and I. H. Pekan, Queue management with multiple delay and loss priorities for ATM switches, Proc. IEEE ICC94, New Orleans, pp. 1184-1189, May 1994
9. H. J. Chao and N. Uzun, A VLSI Sequencer chip for ATM traffic shaper and queue manager, IEEE J. SolidState Circuits, vol.27, no. 11, pp. 1634-1643, Nov. 1992.
10. J. Daigle, Queueing Theory for Telecommunications, Addison Wesley, 1992.
11. A. Demers, S. Keshav, and S. Shenker, Analysis and simulation of a fair queueing algorithm, Proc. ACM SIGCOMM'89, pp. 3-12, 1989.
12. J. M. Hyman, A.A. Lazar, and G. Pacific!, Real-time scheduling with quality of service constraints, IEEE J. Sel. Areas Commun., vol.9, no. 7, pp. 1052-1063, Sept. 1991.
13. H. M. Goldberg, Analysis of the earliest due date scheduling rule in queueing systems, Math. Oper. Res., vol. 2, no. 2, pp. 145-154, May 1977.
14. I. W. Habib and T. N. Saadawi, Multimedia traffic characteristics in broadband networks, IEEE Communications Magazine, pp. 48-54, July 1992.
15. J. R. Jackson, Queues with dynamic priority Discipline, Management Science, vol. 8, no. 1, pp. 18-34, 1961.
16. D. S. Lee and B. Sengupta, Queueing analysis of a threshold based priority scheme for ATM networks, IEEE/ ACM Trans. Networking, vol. 1, no. 6, pp. 709-717, Dec. 1993.
17. Y. Lim and J. Kobza, Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switch, IEEE Trans. Commun., vol. 38, no. 5, pp. 659-665, May 1990.
18. A. Y. Lin and J. A. Silveste, Priority queueing strategies and buffer allocation protocols for traffic control at an ATM integrated broadband switching system, IEEE J. Sel. Areas Commun., vol.9, no. 9, pp. 1524-1536, Dec. 1991.
19. M. Murata, Analysis of a discrete-time single-server queue with bursty inputs for traffic control in ATM networks, IEEE J. Sel. Areas Commun., vol. 8, no. 3, pp. 468-476, April 1990.
20. Y. Ohba and M. Murata, Analysis of interdeparture processes for bursty traffic in ATM networks, IEEE J. Sel. Areas Commun., vol. 9, no. 3, pp. 468-476, April 1991.
21. A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks-The single node case, ACM/IEEE Trans. Networks, vol. 1, no. 3, pp. 344-357, June 1993.
22. D. W. Petr and V. S. Frost, Nested threshold cell discarding for ATM overload control: Optimization under cell loss constraints, Proc. IEEE INFOCOM'91, Bal Harbour, FL, April 1991.
23. S. Suri, D. Tipper, and G. Meempat, A comparative evaluation of space priority strategies in ATM networks, Proc. IEEE INFOCOM'94, pp. 516-523, June 1994.
24. Y. Takagi, S. Hino, and T. Takahashi, Priority assignment control of ATM line buffers with multiple QOS classes, IEEE J. Sel. Areas Commun., vol.9, no. 7, pp. 1078-1092, Sept. 1991.
25. J. Lee, C. Kim, and C. Lee, Rate-based scheduling discipline for packet switching networks, Electronics Letters, vol.31, no. 14, pp. 1130-1131, July 1995.
26. H. Zhang and S. Keshav, Comparison of rate-based service disciplines, ACM SIGCOMM'91, pp. 113-121.