Projective cone scheduling (PCS) algorithms for packet switches of maximal throughput

@inproceedings{Ross2009ProjectiveCS,
  title={Projective cone scheduling (PCS) algorithms for packet switches of maximal throughput},
  author={Kevin Ross and Nicholas Bambos},
  booktitle={TNET},
  year={2009}
}
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. First, we identify a rich class of throughput-optimal linear controls, which choose the service configuration S maximizing the projection 〈S,BX〉 when the backlog is X. The matrix B is arbitrarily fixed in the… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
17 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

Similar Papers

Loading similar papers…