
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jianyu Lou, Xiaojun Shen, "FrameBased PacketMode Scheduling for InputQueued Switches," IEEE Transactions on Computers, vol. 58, no. 7, pp. 956969, July, 2009.  
BibTex  x  
@article{ 10.1109/TC.2008.222, author = {Jianyu Lou and Xiaojun Shen}, title = {FrameBased PacketMode Scheduling for InputQueued Switches}, journal ={IEEE Transactions on Computers}, volume = {58}, number = {7}, issn = {00189340}, year = {2009}, pages = {956969}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.222}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  FrameBased PacketMode Scheduling for InputQueued Switches IS  7 SN  00189340 SP956 EP969 EPD  956969 A1  Jianyu Lou, A1  Xiaojun Shen, PY  2009 KW  Cellmode scheduling KW  framebased scheduling KW  inputqueued switch KW  NPhard KW  packetmode scheduling. VL  58 JA  IEEE Transactions on Computers ER   
[1] N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100 percent Throughput in an InputQueued Switch,” IEEE Trans. Comm., vol. 47, no. 8, pp. 12601267, Aug. 1999.
[2] N. McKeown, “iSLIP: A Scheduling Algorithm for InputQueued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188201, Apr. 1999.
[3] A. Kam and K. Siu, “LinearComplexity Algorithms for QoS Support in InputQueued Switches with No Speedup,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 10401056, Jun. 1999.
[4] M.A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, “PacketMode Scheduling in InputQueued CellBased Switches,” IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 666678, Oct. 2002.
[5] Y. Ganjali, A. Keshavarzian, and D. Shah, “Input Queued Switches: Cell Switching vs. Packet Switching,” Proc. IEEE INFOCOM '03, pp. 16511658, 2003.
[6] L. Tassiulas, “Linear Complexity Algorithms for Maximum Throughput in Radio Networks and InputQueued Switches,” Proc. IEEE INFOCOM '98, pp. 553559, 1998.
[7] P. Giaccone, B. Prabhakar, and D. Shah, “Towards Simple, High Performance Schedulers for HighAggregate Bandwidth Switches,” Proc. IEEE INFOCOM '02, pp. 11601169, 2002.
[8] T. Lee and C. Lam, “Path Switching—A QuasiStatic Routing Scheme for Large Scale ATM Packet Switches,” IEEE J. Selected Areas in Comm., vol. 15, no. 5, pp. 914924, June 1997.
[9] S. Li and N. Ansari, “InputQueued Switching with QoS Guarantees,” Proc. IEEE INFOCOM '99, pp. 11521159, 1999.
[10] M. Andrews and L. Zhang, “Achieving Stability in Networks of InputQueued Switches,” Proc. INFOCOM '01, pp. 16731679, 2000.
[11] M.A. Marsan, E. Leonardi, M. Mellia, and F. Neri, “On the Throughput Achievable by Isolated and Interconnected InputQueued Switches under Multiclass Traffic,” Proc. INFOCOM '02, pp. 16051614, 2002.
[12] I. Gopal and C.K. Wong, “Minimizing the Number of Switchings in a SS/TDMA System,” IEEE Trans. Comm., vol. 33, no. 6, pp. 497501, June 1985.
[13] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2003.
[14] I. Keslassy, M. Kodialam, T.V. Lakshman, and D. Stiliadis, “On Guaranteed Smooth Scheduling for InputQueued Switches,” Proc. INFOCOM '03, pp. 13841394, 2003.
[15] C. Chang, W. Chen, and H. Huang, “Birkhoffvon Neumann Input Buffered Crossbar Switches,” Proc. IEEE INFOCOM '00, pp.16141623, 2000.
[16] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. PrenticeHall, 1993.
[17] S. Even, Graph Algorithms. IEEE CS Press, 1979.
[18] A.D. Goldberg and R.E. Tarjan, “A New Approach to the Maximal Flow Problem,” J. ACM, vol. 35, pp. 921940, 1988.
[19] T. Gonzalez and S. Shani, “Open Shop Scheduling to Mininize Finish Time,” J. ACM, vol. 23, pp. 665679, 1976.
[20] B. Towles and W.J. Dally, “Guaranteed Scheduling for Switches with Configuration Overhead,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 835847, Oct. 2003.
[21] T. Inukai, “An Efficient SS/TDMA Time Slot Assignment Algorithm,” IEEE Trans. Comm., vol. 27, no. 10, pp. 14491455, Oct. 1979.