A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition
暂无分享,去创建一个
[1] Samuel P. Morgan,et al. Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..
[2] Andrzej Jajszczyk. A Simple Algorithm for the Control of Rearrangeable Switching Networks , 1985, IEEE Trans. Commun..
[3] A. Yavuz Oruç,et al. A nonbacktracking matrix decomposition algorithm for routing on Clos networks , 1993, IEEE Trans. Commun..
[4] Y. K. Chiu,et al. Comment on 'Novel algorithm for Clos-type networks' (and reply) , 1991 .
[5] M. Paull. Reswitching of connection networks , 1962 .
[6] Can Emre Koksal,et al. Rate quantization and service quality over single crossbar switches , 2004, IEEE INFOCOM 2004.
[7] 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).
[8] S. Andresen. The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..
[9] Kai-Yeung Siu,et al. Linear-complexity algorithms for QoS support in input-queued switches with no speedup , 1999, IEEE J. Sel. Areas Commun..
[10] 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).
[11] 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).
[12] Ted H. Szymanski,et al. Randomized routing of virtual connections in essentially nonblocking log N-depth networks , 1995, IEEE Trans. Commun..
[13] C. Cardot. Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks" , 1986, IEEE Trans. Commun..
[14] S. Srikanthan,et al. Novel algorithm for Clos-type networks , 1990 .
[15] Nick McKeown,et al. Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..
[16] Frank K. Hwang,et al. Control Algorithms for Rearrangeable Clos Networks , 1983, IEEE Trans. Commun..
[17] Harrick M. Vin,et al. Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.
[18] H. R. Ramanujam. Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.
[19] Honglin Wu,et al. Power complexity of multiplexer-based optoelectronic crossbar switches , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[20] Nick McKeown,et al. A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .
[21] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .
[22] Andrzej Jajszczyk. Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution , 2003, IEEE Commun. Mag..
[23] 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).
[24] Bruce Hajek,et al. Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.
[25] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[26] Marek Kubale. Comments on "Decomposition of Permutation Networks" , 1982, IEEE Trans. Computers.