Determining end-to-end delay bounds in heterogeneous networks

Multimedia Systems

Volumn 5, Issue 3, 1997, Pages 157-163

  Goyal, Pawan ^a,b   Lam, Simon S ^{a,c,d,e,f,g,h}   Vin, Harrick M ^a,g,h,i,j  

^a University of Texas at Austin   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c WASHINGTON STATE UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e ARPA Network Measurement Center   (United States)

^f IBM T J WATSON RESEARCH CENTER   (United States)

^g UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^h University of Texas ^*  (United States)

ⁱ UNIVERSITY OF CALIFORNIA   (United States)

^j IEEE   (United States)

more..

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000937631     PISSN: 09424962     EISSN: None     Source Type: Journal    
DOI: 10.1007/s005300050052     Document Type: Article

References (19)

1. Clark DD, Shenker S, Zhang L (1992) Supporting real-time applications in an integrated services packet network. In: Proceedings of ACM SIGCOMM, pp 14-26
2. Cruz RL (1991) A calculus for network delay, Part I: network elements in isolation. IEEE Trans Inf Theory 37:114-131
3. Cruz RL (1991) A calculus for network delay, Part II: network analysis. IEEE Trans Inf Theory, 37:132-141
4. Davin J, Heybey A (1990) A simulation study of fair queueing and policy enforcement. Comput Commun Rev 20(5):23-29
5. Demers A, Keshav S, Shenker S (1989) Analysis and simulation of a fair queueing algorithm. In: Proceedings of ACM SIGCOMM, pp 1-12
6. Ferrari D, Verma DC (1990) A scheme for real-time channel establishment in wide-area networks. IEEE J Sel Areas Commun 8:368-379
7. Figuera N, Pasquale J (1995) Leave-in-time: a new service discipline for real-time communication in a packet-switching data network. In: ACM SIGCOMM 95, pp 207-218
8. Golestani SJ (1991) A framing strategy for congestion management. IEEE J Scl Areas Commun pp 1064-1077
9. Golestani SJ (1994) A self-clocked fair queueing scheme for highspeed applications. In: Proceedings of INFOCOM '94
10. Kalmanek CR, Kanakia H, Keshav S (1990) Rate-controlled servers for very high-speed networks. In: Proceedings of IEEE GLOBECOM '9O, San Diego. CA, pp 300.3.1-300.3.9
11. Lam SS, Xie GG (1995) Burst scheduling: architecture and algorithm for switching packet video. In: Proceedings of INFOCOM '95
12. Parekh AK, Gallager RG (1994) A generalized processor-sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans Networking 2(2):137-150
13. Parekh AK (1992) A generalized processor-sharing approach to flow control in integrated services networks. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, Mass.
14. Shenker S(1994) Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines. In: Proceedings of ACM SIGCOMM '94, pp 47-57
15. Xie GG, Lam SS (1994) Delay Guarantee of Virtual Clock Server. Technical Report TR-94-24, Dept. of Computer Sciences. UT-Austin, TX
16. Yaron O, Sidi M (1994) Generalized processor-sharing networks with exponentially bounded burstiness arrivals. In: Proceedings of INFOCOM '94
17. Zhang H. Ferrari D (1993) Rate-controlled static priority queueing. In: Proceedings of INFOCOM '93, volume 2, pp 227-236
18. Zhang H, Keshav S (1991) Comparison of rate-based service disciplines. In: Proceedings of ACM SIGCOMM, pp 113-121
19. Zhang L (1990) Virtual clock: a new traffic control algorithm for packet-switching networks. In: Proceedings of ACM SIGCOMM '9O, pp 19-29