Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth

Computer Networks

Volumn 42, Issue 1, 2003, Pages 65-80

  Su, Xun ^a   De Veciana, Gustavo ^a  

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

Author keywords

Bandwidth sharing; Dynamic routing; Expected flow perceived load; Load prediction

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; DATA TRANSFER; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

BANDWIDTH SHARING;

ROUTERS;

EID: 0037447686     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(02)00456-5     Document Type: Article

References (25)

1. V. Jacobson, Congestion avoidance and control, Proc. ACM Sigcomm, 1988, pp. 314-329.
2. Bertsekas D., Gallager R. Data Networks. 1992;Prentice Hall, Englewood Cliffs, NJ.
3. A. Forum, P-NNI draft specification, Tech. rep., March 1995.
4. Shenker S. Fundamental design issues for the future Internet. IEEE J. Select. Areas Commun. 13(7):1995;1176-1188.
5. Kelly F. Notes on effective bandwidths. Kelly F., Zachary S., Ziedins I. Stochastic Networks: Theory and Applications. 1996;141-168 Oxford University Press, Oxford.
6. S. McCanne, Scalable compression and transmission of internet multicast video, Ph.D. Thesis, University of California at Berkeley, 1996.
7. C. Courcoubetis, A. Dimakis, M. Reiman, Providing bandwidth guarantees over a best-effort network: call-admission and pricing, in: Proc. IEEE Infocom, 2001, pp. 459-467.
8. Mandelbaum A., Massey W., Reiman M. Strong approximations for Markovian service networks. Queue. Sys. 30:1998;149-201.
9. Plotkin S. Competitive routing of virtual circuit in ATM networks. IEEE J. Select. Areas Commun. 13(6):1995;1128-1136.
10. A. Shaikh, J. Rexford, K. Shin, Load-sensitive routing of long-lived IP flows, Proc. ACM Sigcomm, 1999.
11. Q. Ma, P. Steenkiste, H. Zhang, Routing high-bandwidth traffic in max-min fair share networks, Proc. ACM Sigcomm, 1996, pp. 206-217.
12. Gibbens R., Kelly F. Resource pricing and the evolution of congestion control. Automatica. 1999;1969-1985.
13. L. Massoulié, J. Roberts, Bandwidth sharing: objectives and algorithms, in: Proc. IEEE Infocom, 1999, pp. 1395-1403.
14. S. Yang, G. de Veciana, Size based adaptive bandwidth allocation: Optimizing the QoS for elastic flows, in: Proc. IEEE Infocom, 2002.
15. Wang Z., Crowcroft J. Analysis of shortest-path routing algorithms in a dynamic network environment. ACM Comput. Commun. Rev. 22(2):1992;63-71.
16. G. Apostolopoulos, R. Guérin, S. Tripathi, Quality of service based routing: A performance perspective, in: Proc. ACM Sigcomm, 1998, pp. 17-28.
17. Q. Ma, P. Steenkiste, On path selection for traffic with bandwidth guarantees, Fifth IEEE International Conference on Network Protocols, 1997.
18. M. Kodialam, T. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, in: Proc. IEEE Infocom, 2000, pp. 884-893.
19. Kelly F. Network routing. Proc. Roy. Soc. Lond. A. 337:1991;343-367.
20. Gibbens R. Dynamic routing in fully connected networks. IMA J. Math. Control Inf. 7:1990;77-111.
21. M. Alanyali, B. Hajek, On simple algorithms for dynamic load balancing, Proc. IEEE INFOCOM, 1995, pp. 230-238.
22. Wang Z., Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14(7):1996;1228-1235.
23. S. Nelakuditi, Z. Zhang, R. Tsang, Adaptive proportional routing: A localized QoS routing approach, Proc. IEEE Infocom, 2000, pp. 1566-1575.
24. Gibbens R., Kelly F., Turner S. Dynamic routing in multiparented networks. IEEE/ACM Trans. Network. 1(2):1993;261-270.
25. Brockwell P.J., Davis R.A. Introduction to Time Series and Forecasting. 1996;Springer, New York.