A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers
暂无分享,去创建一个
[1] Tim Roughgarden,et al. Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[2] Frank K. Hwang,et al. Control Algorithms for Rearrangeable Clos Networks , 1983, IEEE Trans. Commun..
[3] Masayoshi Nabeshima. Performance Evaluation of a Combined Input- and Crosspoint-Queued Switch , 2000 .
[4] Nick McKeown,et al. Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..
[5] Ted H. Szymanski,et al. Randomized routing of virtual connections in essentially nonblocking log N-depth networks , 1995, IEEE Trans. Commun..
[6] C. Cardot. Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks" , 1986, IEEE Trans. Commun..
[7] Cheng-Shang Chang,et al. Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[8] Dave Gilbert,et al. Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS , 2010, IEEE Journal on Selected Areas in Communications.
[9] S. Srikanthan,et al. Novel algorithm for Clos-type networks , 1990 .
[10] Dave Gilbert,et al. Low jitter guaranteed-rate communications for cluster computing systems , 2008 .
[11] Ted H. Szymanski. A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks , 2008, AccessNets.
[12] Y. K. Chiu,et al. Comment on 'Novel algorithm for Clos-type networks' (and reply) , 1991 .
[13] M. Paull. Reswitching of connection networks , 1962 .
[14] Ted H. Szymanski. Throughput and QoS optimization in nonuniform multichannel wireless mesh networks , 2008, Q2SWinet '08.
[15] Nick McKeown,et al. A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1996 .
[16] Cheng-Shang Chang,et al. On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).
[17] Jonathan S. Turner,et al. Multirate Clos networks , 2003, IEEE Commun. Mag..
[18] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .
[19] Dave Gilbert,et al. Internet Multicasting of IPTV With Essentially-Zero Delay Jitter , 2009, IEEE Transactions on Broadcasting.
[20] T.H. Szymanski. Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks , 2009, 2009 IEEE Sarnoff Symposium.
[21] Marshall Hall,et al. Combinatorial Theory: Hall/Combinatorial , 1988 .
[22] Frank Hwang,et al. The Mathematical Theory of Nonblocking Switching Networks , 1998 .
[23] Marek Kubale. Comments on "Decomposition of Permutation Networks" , 1982, IEEE Trans. Computers.
[24] T.H. Szymanski. A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition , 2006, 2006 Workshop on High Performance Switching and Routing.
[25] Samuel P. Morgan,et al. Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..
[26] Bruce Hajek,et al. Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.
[27] William J. Dally,et al. Guaranteed scheduling for switches with configuration overhead , 2003, IEEE/ACM Trans. Netw..
[28] G. Raina,et al. Buffer sizes for large multiplexers: TCP queueing theory and instability analysis , 2005, Next Generation Internet Networks, 2005.
[29] Rene L. Cruz,et al. A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.
[30] Amogh Dhamdhere,et al. Open issues in router buffer sizing , 2006, CCRV.
[31] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[32] A. Mullin,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[33] Can Emre Koksal,et al. Rate quantization and service quality over single crossbar switches , 2004, IEEE INFOCOM 2004.
[34] T.H. Szymanski,et al. Delivery of Guaranteed Rate Internet Traffic with Very Low Delay Jitter , 2007, 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
[35] Rene L. Cruz,et al. A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.
[36] Nick McKeown,et al. ATM input-buffered switches with the guaranteed-rate property , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).
[37] Nick McKeown,et al. Update on buffer sizing in internet routers , 2006, CCRV.
[38] Andrzej Jajszczyk. A Simple Algorithm for the Control of Rearrangeable Switching Networks , 1985, IEEE Trans. Commun..
[39] A. Yavuz Oruç,et al. A nonbacktracking matrix decomposition algorithm for routing on Clos networks , 1993, IEEE Trans. Commun..
[40] Guido Appenzeller,et al. Sizing router buffers , 2004, SIGCOMM '04.
[41] Andrzej Jajszczyk. Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution , 2003, IEEE Commun. Mag..
[42] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.
[43] Laxmi N. Bhuyan,et al. Guaranteed smooth switch scheduling with low complexity , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..
[44] Murali S. Kodialam,et al. On guaranteed smooth scheduling for input-queued switches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[45] S. Andresen. The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..
[46] Marco Ajmone Marsan,et al. Bounds on delays and queue lengths in input-queued cell switches , 2003, JACM.
[47] Rade Stanojevic,et al. A critique of recently proposed buffer-sizing strategies , 2007, CCRV.
[48] H. R. Ramanujam. Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.
[49] T. Inukai,et al. An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..
[50] Harrick M. Vin,et al. Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.