Fundamental trade-offs in aggregate packet scheduling

International Conference on Network Protocols

Volumn , Issue , 2001, Pages 129-137

  Zhang, Zhi Li ^a   Duan, Zhenhai ^a   Hou, Yiwei Thomas ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); ENCODING (SYMBOLS); INTERNET; NETWORK PROTOCOLS; RESOURCE ALLOCATION; ROUTERS; TELECOMMUNICATION TRAFFIC;

DYNAMIC EARLIEST TIME FIRST; PACKET SCHEDULING; STATIC EARLIEST TIME FIRST; WORST CASE EDGE TO EDGE DELAY BOUND;

PACKET SWITCHING;

EID: 0035704303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Delay jitter bounds and packet scale rate guarantee for expedited forwarding
2. An architecture for differentiated services
3. Delay bounds in a network with aggregate scheduling
4. A calculus for network delay, Part I: Network elements in isolation
5. Sced+: Efficient management of quality of service guarantees
6. An expedited forwarding PHB
7. The 'virtual wire' per-domain behavior
8. A versatile packet multiplexer for quality-of-service networks
9. Providing guaranteed services without per flow management
10. Virtual time reference system: A unifying scheduling framework for scalable support of guaranteed services
11. Fundamental trade-offs in aggregate packet scheduling