Fair queueing architectures for high-speed networks

@article{Greenberg1996FairQA,
  title={Fair queueing architectures for high-speed networks},
  author={Albert G. Greenberg},
  journal={Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},
  year={1996},
  pages={198-}
}
Summary form only given, as follows. High-speed links in emerging communication networks require simple and efficient algorithms for apportioning bandwidth to competing connections. A single link may carry traffic for thousands of connections with different quality-of-service parameters, requiring scalable switch architectures that avoid performing operations for every connection or cell during each transmission slot. Still, effective cell scheduling algorithms should provide delay and… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

An application‐ and management‐based approach to ATM scheduling

VIEW 1 EXCERPT
CITES BACKGROUND

A distributed protocol to schedule and monitor ATM real-time traffic

  • H. Le Pocher, V. C. M. Leung, Donald Gillies
  • Computer Science
  • 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997
  • 1997