Delay Guarantee of Virtual Clock Server

IEEE/ACM Transactions on Networking

Volumn 3, Issue 6, 1995, Pages 683-689

  Xie, Geoffrey G ^a   Lam, Simon S ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

delay guarantee; packet; priority queue; rate based service discipline; switching; throughput guarantee; Virtual clock

Indexed keywords

COMPUTER NETWORKS; PACKET SWITCHING; TELECOMMUNICATION TRAFFIC;

DELAY GUARANTEE; PRIORITY QUEUE; THROUGHPUT GUARANTEE; VIRTUAL CLOCK SERVICE DISCIPLINE;

PACKET NETWORKS;

EID: 0029541014     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.477714     Document Type: Article

References (15)

1. G. M. Bernstein, “Reserved bandwidth and reservationless traffic in rate allocating servers/’ Comput. Commun. Rev., pp. 6-24, July 1993.
2. A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queuing algorithm,” in Proc. ACM SIGCOMM, 1989, pp. 3-12.
3. D. Ferrari and D. Verma, “A scheme for Real time channel establishment in wide-area networks,” IEEE J. Select. Areas Commun., pp. 368-379, Apr. 1990.
4. N. R. Figueira and J. Pasquale, “An upper bound on delay for the virtual clock service discipline,” IEEE/ACM Trans. Networking, vol. 3 no. 4, Aug. 1995.
5. S. J. Golestani, “A self-clocked fair queueing scheme for high speed applications,” in Proc. IEEE INFOCOM, 1994.
6. P. Goyal, S. S. Lam, and H. M. Vin, “Determining end-to-end delay bounds in heterogeneous networks,” in Proc. Workshop Network and OS Support for Digital Audio Video, April 1995.
7. S. S. Lam and G. G. Xie, “Burst Scheduling: architecture and algorithm for switching packet video,” Department of Computer Sciences, University of Texas, Austin, TX, Technical Rep. TR-94-20, July 1994. Abbreviated version in Proc. IEEE INFOCOM, 1995.
8. “Burst scheduling networks: flow specification and performance guarantees,” in Proc. Workshop on Network and OS Support for Digital Audio Video, April 1995.
9. —,”Group priority scheduling,” Department of Computer Sciences, University of Texas at Austin, Tech. rep. TR-95-28, 1995; available http://www.cs.utexas.edu/users/lann/NRL. An abbreviated version to appear in Proc. IEEE INFOCOM ' ‘96.
10. A. K. Parekh and R. G. Gallager, “A generialized processor sharing approach to flow control in integrated services networks: the single node case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
11. “A generialized processor sharing approach to flow control in integrated services networks: the multiple node case,” IEEE/ACM Trans. Networking, vol. 2, no. 2, pp. 137-150, Apr. 1994.
12. G. G. Xie and S. S. Lam, “Delay guarantee of virtual clock server,” Department of Computer Sciences, University of Texas, Austin, TX, Technical Report TR-94-24, 1994, presented at 9th IEEE Workshop on Computer Communications, October 1994.
13. H. Zhang and S. Keshav, “Comparison of rated-based service disciplines,” inProc. ACM SIGCOMM, 1991, pp. 113-121.
14. L. Zhang, “A new architecture for packet-switched network protocols,” Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1989.
15. “Virtual clock: a new traffic control algorithm for packet switching networks,” in Proc. ACM SIGCOMM, Aug. 1990, pp. 19-29.