Performance analysis of data packet discarding in ATM networks

IEEE/ACM Transactions on Networking

Volumn 7, Issue 2, 1999, Pages 216-227

  Kim, Yonghwan ^a,c   Li, San Qi ^b,c  

^a CISCO SYSTEMS   (United States)

^b The University of Texas at Austin   (United States)

^c IEEE

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CONGESTION CONTROL (COMMUNICATION); MATHEMATICAL MODELS; PACKET NETWORKS; QUEUEING THEORY; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION TRAFFIC;

PACKET TAIL DISCARDING METHOD; PACKET-LEVEL CONTROL; STOCHASTIC MODELING;

ASYNCHRONOUS TRANSFER MODE;

EID: 0032674351     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.769769     Document Type: Article

References (16)

1. D. E. McDysan and D. L. Spohn, ATM: Theory and Application. New York: McGraw-Hill, 1995.
2. V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM '88, Stanford, CA, Aug. 1988, pp. 14-329.
3. G. Armitage and K. Adams, "Packet reassembly during cell loss," IEEE Network Mag., vol. 7, pp. 26-34, Sept. 1993.
4. S. Floyd and A. Romanov, "Dynamics of TCP traffic over ATM networks," IEEE J. Select. Areas Commun., vol. 13, pp. 633-641, May 1995.
5. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
6. A. E. Kamal, "Performance modeling of partial packet discarding using the end-of-packet indicator in AAL type 5," IEEE/ACM Trans. Networking, vol. 4, pp. 929-940, Dec. 1996.
7. J. S. Turner, "Maintaining high throughput during overload in ATM switches," in Proc. IEEE Infocom '96 Conf., Mar. 1996, pp. 287-295.
8. Y. Lapid, R. Rom, and M. Side, "Analysis of packet discarding policies in high-speed networks," in Proc. IEEE Infocom'97 Conf., Apr. 1997, pp. 1193-1200.
9. A. Bhargava and M. G. Hluchyj, "Frame losses due to buffer overflows in fast packet networks," in Proc. IEEE Infocom'90 Conf., June 1990, pp. 132-139.
10. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models. Baltimore, MD: Johns Hopkins Univ. Press, 1981.
11. S. Q. Li and H. D. Sheng, "Generalized folding algorithm for Sojourn time analysis of finite QBD processes and its queueing applications," Commun. Statist. - Stochastic Models, vol. 12, no. 3, pp. 507-522, 1 996.
12. H. D. Sheng and S. Q. Li, "Second order effect of binary sources on characteristics of queue and loss rate," IEEE Trans. Commun., vol. 42, pp. 1162-1173, Mar. 1994.
13. S. Q. Li and H. D. Sheng, "Discrete queueing analysis of multi-media traffic with diversity of correlation and burstiness properties," IEEE Trans. Commun., vol. 42, pp. 1339-1351, Mar. 1994.
14. J. Ye and S. Q. Li, "Folding algorithm: A computational method for finite QBD processes with level-dependent transitions," IEEE Trans. Commun., vol. 42, pp. 625-639, Feb. 1994.
15. J. G. Kemeny and J. L. Snell, Finite Markov Chains. New York: Springer-Verlag, 1976.
16. W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Reading, MA: Addison-Wesley, 1994.