Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
| Hi-index | 0.00 |
This work investigates the benefits and drawbacks of using a lottery to schedule and drop packets within a router. We find that a lottery can provide many distinct levels of service without requiring that per-flow state be maintained in the routers. We also investigate the re-ordering within a flow that can occur if a lottery is used to pick packets to forward without regard to their flow order.