Buffer overflow management in QoS switches

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 520-529

  Kesselman, Alexander ^a,b   Lotker, Zvi ^a,b   Mansour, Yishay ^a,b   Patt Shamir, Boaz ^a,b   Schieber, Baruch ^c   Sviridenko, Maxim ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Sedot Negev Regional Council   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; QUALITY OF SERVICE; THEOREM PROVING;

BUFFER OVERFLOW MANAGEMENT;

PACKET SWITCHING;

EID: 0034819572     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380847     Document Type: Conference Paper

References (22)

1. Competitive queue policies for diffrentiated services
2. On-line load balancing with applications to machine scheduling and virtual circuit routing
3. A unified approach to approximating resource allocation and scheduling
4. Approximating the throughput of multiple machines under real-time scheduling
5. On the competitiveness of online real-time task scheduling
6. Online scheduling in the presence of overload
7. An architecture for differentiated services
8. An approach to service allocation in the internet
9. Random early detection gateways for congestion avoidance
10. An expedited forwarding PHB
11. Loss-bounded analysis for differentiated services
12. D-over: An optimal on-line scheduling algorithm for overloaded real-time systems
13. Packet droping policies for ATM and IP networks
14. The drop from front strategy in TCP and in TCP over ATM
15. On the self-similar nature of ethernet traffic (extended version)
16. On-line interval scheduling
17. Optimal smoothing schedules for real-time streams
18. Simple performance models of differentiated services for the internet
19. Off-line admission control for general scheduling problems
20. The chaotic nature of TCP congestion control