A scalable approach to the partition of QoS requirements in unicast and multicast

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2002, Pages 685-694

  Orda, Ariel ^a   Sprintson, Alexander ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximations; Multicast; Performance dependent costs; QoS; QoS partition; Resource allocation; Routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADBAND NETWORKS; BROADCASTING; COMPUTATIONAL COMPLEXITY; MULTICASTING; QUALITY OF SERVICE; RESOURCE ALLOCATION;

PERFORMANCE DEPENDENT COSTS; QUALITY OF SERVICE PARTITION PROBLEMS; QUALITY OF SERVICE REQUIREMENTS; QUALITY OF SERVICE ROUTING; UNICAST;

REQUIREMENTS ENGINEERING;

EID: 0036343679     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. An architecture for differentiated services
2. Qos routing with performance-dependent costs
3. Call admission and resource reservation for multicast sessions
4. QoS-based routing in networks with inaccurate state and metrics information
5. Resource allocation in a multicast tree
6. Optimal partition of QoS requirements on unicast paths and multicast trees
7. Efficient QoS partition and routing of unicast and multicast
8. QoS routing: The precomputation perspective
9. A scalable approach to the partition of QoS requirements in unicast and multicast. EE Pub. No. 1281, depaartment of electrical engineering, technion, Haifa, Israel, June
10. Optimal partition of qos requirements with discrete cost functions