The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2009 vol.58)
pp: 956-969
Jianyu Lou , University of Missouri-Kansas City, Kansas City
Most packet scheduling algorithms for input-queued switches operate on fixed-sized packets known as cells. In reality, communication traffic in many systems such as Internet runs on variable-sized packets. Motivated by potential savings of segmentation and reassembly, there has been increasing interest in scheduling variable-sized packets in a nonpreemptive manner known as packet-mode scheduling. This paper studies frame-based packet-mode scheduling for better scalability. It first shows that the admissible condition is no longer sufficient for packet-mode scheduling. Then, a relation between the frame size and packet sizes is derived that classifies under what conditions the packet-mode scheduling problem is polynomial solvable or is NP-hard. This relation reveals an interesting result that under various packet size distributions, it may be polynomial solvable even if many different packet sizes occur in the packet set, whereas it may be NP-hard with just two packet sizes present. Finally, as a practical solution, this paper studies how a speedup can help packet-mode scheduling. It is shown that the admissible condition becomes sufficient also when a speedup of two is used. A simple algorithm with a speedup of two is presented.
Cell-mode scheduling, frame-based scheduling, input-queued switch, NP-hard, packet-mode scheduling.
Jianyu Lou, "Frame-Based Packet-Mode Scheduling for Input-Queued Switches", IEEE Transactions on Computers, vol.58, no. 7, pp. 956-969, July 2009, doi:10.1109/TC.2008.222
[1] N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100 percent Throughput in an Input-Queued Switch,” IEEE Trans. Comm., vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
[2] N. McKeown, “iSLIP: A Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, Apr. 1999.
[3] A. Kam and K. Siu, “Linear-Complexity Algorithms for QoS Support in Input-Queued Switches with No Speedup,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1040-1056, Jun. 1999.
[4] M.A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, “Packet-Mode Scheduling in Input-Queued Cell-Based Switches,” IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 666-678, Oct. 2002.
[5] Y. Ganjali, A. Keshavarzian, and D. Shah, “Input Queued Switches: Cell Switching vs. Packet Switching,” Proc. IEEE INFOCOM '03, pp. 1651-1658, 2003.
[6] L. Tassiulas, “Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input-Queued Switches,” Proc. IEEE INFOCOM '98, pp. 553-559, 1998.
[7] P. Giaccone, B. Prabhakar, and D. Shah, “Towards Simple, High Performance Schedulers for High-Aggregate Bandwidth Switches,” Proc. IEEE INFOCOM '02, pp. 1160-1169, 2002.
[8] T. Lee and C. Lam, “Path Switching—A Quasi-Static Routing Scheme for Large Scale ATM Packet Switches,” IEEE J. Selected Areas in Comm., vol. 15, no. 5, pp. 914-924, June 1997.
[9] S. Li and N. Ansari, “Input-Queued Switching with QoS Guarantees,” Proc. IEEE INFOCOM '99, pp. 1152-1159, 1999.
[10] M. Andrews and L. Zhang, “Achieving Stability in Networks of Input-Queued Switches,” Proc. INFOCOM '01, pp. 1673-1679, 2000.
[11] M.A. Marsan, E. Leonardi, M. Mellia, and F. Neri, “On the Throughput Achievable by Isolated and Interconnected Input-Queued Switches under Multiclass Traffic,” Proc. INFOCOM '02, pp. 1605-1614, 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. 497-501, 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 Input-Queued Switches,” Proc. INFOCOM '03, pp. 1384-1394, 2003.
[15] C. Chang, W. Chen, and H. Huang, “Birkhoff-von Neumann Input Buffered Crossbar Switches,” Proc. IEEE INFOCOM '00, pp.1614-1623, 2000.
[16] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 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. 921-940, 1988.
[19] T. Gonzalez and S. Shani, “Open Shop Scheduling to Mininize Finish Time,” J. ACM, vol. 23, pp. 665-679, 1976.
[20] B. Towles and W.J. Dally, “Guaranteed Scheduling for Switches with Configuration Overhead,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 835-847, Oct. 2003.
[21] T. Inukai, “An Efficient SS/TDMA Time Slot Assignment Algorithm,” IEEE Trans. Comm., vol. 27, no. 10, pp. 1449-1455, Oct. 1979.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool