Optimal per-node rate allocation to provide per-flow end-to-end delay guarantees in a network of routers supporting guaranteed service class

IEEE International Conference on Communications

Volumn 2, Issue , 2002, Pages 1112-1117

  Diwan, Aniruddha ^a   Kuri, Joy ^a   Kumar, Anurag ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; COSTS; INTERNET; OPTIMIZATION; PROBABILITY; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION LINKS;

PACKET SCHEDULERS;

PACKET NETWORKS;

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

References (16)

1. Specification of guaranteed quality of service
2. Allocation of local quality of service constraints to meet end-to-end requirements
3. Optimal partition of QoS requirements on unicast paths and multicast trees
4. QoS-based routing in networks with inaccurate information: Theory and algorithms
5. QoS routing on networks with uncertain parameters
6. Optimal partition of QoS requirements with discrete cost functions
7. Efficient support of delay and rate guarantees in an Internet
8. Quality-of-Service in packet networks: Basic mechanisms and directions
9. RSVP and integrated services in the Internet
10. Performance bound for guaranteed and adaptive services
11. Latency-rate servers: A general model for analysis of traffic scheduling algorithms
12. Analysis and simulation of a fair queueing algorithm
13. A generalized processor sharing approach to flow control in integrated services networks: The single node case