Title :
Projective Cone Scheduling (PCS) Algorithms for Packet Switches of Maximal Throughput
Author :
Ross, Kevin ; Bambos, Nicholas
Author_Institution :
Baskin Sch. of Eng., Univ. of California at Santa Cruz, Santa Cruz, CA
fDate :
6/1/2009 12:00:00 AM
Abstract :
We study the (generalized) packet switch scheduling problem, where service configurations are dynamically chosen in response to queue backlogs, so as to maximize the throughput without any knowledge of the long term traffic load. Service configurations and traffic traces are arbitrary.
Keywords :
packet switching; queueing theory; scheduling; telecommunication traffic; PCS algorithm; long term traffic load; packet switch scheduling; projective cone scheduling; queue backlogs; Cone scheduling; maximal throughput; packet switch; queueing network; stability;
Journal_Title :
Networking, IEEE/ACM Transactions on
DOI :
10.1109/TNET.2008.2002557
