Projective Cone Scheduling (PCS) Algorithms for Packet Switches of Maximal Throughput

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.