Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
暂无分享,去创建一个
[1] Bruce M. Maggs,et al. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..
[2] Srinivasan Keshav,et al. On CBR service , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[3] Jörg Liebeherr,et al. A near-optimal packet scheduler for QoS networks , 1997, Proceedings of INFOCOM '97.
[4] Rafail Ostrovsky,et al. Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.
[5] Yuval Rabani,et al. Distributed packet switching in arbitrary networks , 1996, STOC '96.
[6] Dimitrios Stiliadis,et al. Traffic scheduling in packet-switched networks: analysis, design, and implementation , 1996 .
[7] Harrick M. Vin,et al. Determining end-to-end delay bounds in heterogeneous networks , 1997, Multimedia Systems.
[8] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.
[9] David Clark,et al. Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.
[10] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[11] Roch Guérin,et al. Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.
[12] S. Jamaloddin Golestani,et al. A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..
[13] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[14] Srinivasan Keshav,et al. An Engineering Approach to Computer Networking: ATM Networks , 1996 .
[15] S. Jamaloddin Golestani,et al. Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..
[16] Abhay Parekh,et al. Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.
[17] Jim Kurose,et al. On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements , 1993, SIGCOMM 1993.
[18] Lisa Zhang,et al. General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[19] Rene L. Cruz,et al. A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.
[20] Dinesh C. Verma,et al. A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..
[21] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[22] Harrick M. Vin,et al. Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.
[23] Rene L. Cruz,et al. A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.
[24] Anindo Banerjea,et al. The Tenet real-time protocol suite: design, implementation, and experiences , 1996, TNET.
[25] Domenico Ferrari,et al. Exact admission control for networks with a bounded delay service , 1996, TNET.