An O(1) scheduling algorithm for variable-size packet switching systems

Shunyuan Ye, Yanming Shen, Shivendra Panwar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100% throughut for input-queued switches for any admissible Bernoulli traffic, ALGO3 [1] and EMHW [2] have the lowest computation complexity, which is O(logN), where N is the number of ports in the switch. In this paper, we propose a randomized scheduling algorithm, which can also stabilize the system for any admissible traffic that satisfies the strong law of large number. The algorithm has a complexity of O(1). Since the complexity does not increase with the size of a switch, the algorithm is highly scalable and a good choice for future high-speed switch designs. We also show that the algorithm can be implemented in a distributed way by using a low-rate control channel. Simulation results show that the algorithm can provide a good delay performance as compared to algorithms with higher computation complexity.

Original languageEnglish (US)
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages1683-1690
Number of pages8
DOIs
StatePublished - 2010
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: Sep 29 2010Oct 1 2010

Other

Other48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
CountryUnited States
CityMonticello, IL
Period9/29/1010/1/10

Fingerprint

Packet switching
Switching systems
Scheduling algorithms
Switches
Telecommunication traffic
Internet

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Ye, S., Shen, Y., & Panwar, S. (2010). An O(1) scheduling algorithm for variable-size packet switching systems. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 (pp. 1683-1690). [5707119] https://doi.org/10.1109/ALLERTON.2010.5707119

An O(1) scheduling algorithm for variable-size packet switching systems. / Ye, Shunyuan; Shen, Yanming; Panwar, Shivendra.

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 1683-1690 5707119.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ye, S, Shen, Y & Panwar, S 2010, An O(1) scheduling algorithm for variable-size packet switching systems. in 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010., 5707119, pp. 1683-1690, 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, United States, 9/29/10. https://doi.org/10.1109/ALLERTON.2010.5707119
Ye S, Shen Y, Panwar S. An O(1) scheduling algorithm for variable-size packet switching systems. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 1683-1690. 5707119 https://doi.org/10.1109/ALLERTON.2010.5707119
Ye, Shunyuan ; Shen, Yanming ; Panwar, Shivendra. / An O(1) scheduling algorithm for variable-size packet switching systems. 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. pp. 1683-1690
@inproceedings{f8cc554022c24b169874ad05c39d5f66,
title = "An O(1) scheduling algorithm for variable-size packet switching systems",
abstract = "Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100{\%} throughut for input-queued switches for any admissible Bernoulli traffic, ALGO3 [1] and EMHW [2] have the lowest computation complexity, which is O(logN), where N is the number of ports in the switch. In this paper, we propose a randomized scheduling algorithm, which can also stabilize the system for any admissible traffic that satisfies the strong law of large number. The algorithm has a complexity of O(1). Since the complexity does not increase with the size of a switch, the algorithm is highly scalable and a good choice for future high-speed switch designs. We also show that the algorithm can be implemented in a distributed way by using a low-rate control channel. Simulation results show that the algorithm can provide a good delay performance as compared to algorithms with higher computation complexity.",
author = "Shunyuan Ye and Yanming Shen and Shivendra Panwar",
year = "2010",
doi = "10.1109/ALLERTON.2010.5707119",
language = "English (US)",
isbn = "9781424482146",
pages = "1683--1690",
booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

}

TY - GEN

T1 - An O(1) scheduling algorithm for variable-size packet switching systems

AU - Ye, Shunyuan

AU - Shen, Yanming

AU - Panwar, Shivendra

PY - 2010

Y1 - 2010

N2 - Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100% throughut for input-queued switches for any admissible Bernoulli traffic, ALGO3 [1] and EMHW [2] have the lowest computation complexity, which is O(logN), where N is the number of ports in the switch. In this paper, we propose a randomized scheduling algorithm, which can also stabilize the system for any admissible traffic that satisfies the strong law of large number. The algorithm has a complexity of O(1). Since the complexity does not increase with the size of a switch, the algorithm is highly scalable and a good choice for future high-speed switch designs. We also show that the algorithm can be implemented in a distributed way by using a low-rate control channel. Simulation results show that the algorithm can provide a good delay performance as compared to algorithms with higher computation complexity.

AB - Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100% throughut for input-queued switches for any admissible Bernoulli traffic, ALGO3 [1] and EMHW [2] have the lowest computation complexity, which is O(logN), where N is the number of ports in the switch. In this paper, we propose a randomized scheduling algorithm, which can also stabilize the system for any admissible traffic that satisfies the strong law of large number. The algorithm has a complexity of O(1). Since the complexity does not increase with the size of a switch, the algorithm is highly scalable and a good choice for future high-speed switch designs. We also show that the algorithm can be implemented in a distributed way by using a low-rate control channel. Simulation results show that the algorithm can provide a good delay performance as compared to algorithms with higher computation complexity.

UR - http://www.scopus.com/inward/record.url?scp=79952423338&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952423338&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2010.5707119

DO - 10.1109/ALLERTON.2010.5707119

M3 - Conference contribution

SN - 9781424482146

SP - 1683

EP - 1690

BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

ER -