Algorithms for multicast connection under multi-path routing model

Information Processing Letters

Volumn 84, Issue 1, 2002, Pages 31-39

  Gu, Jun ^a   Hu, Xiao Dong ^a   Zhang, Mu Hong ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Approximation algorithms; Multicast connection; Network cost; Routing algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; MATHEMATICAL MODELS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS);

MULTI-PATH ROUTING;

MULTICASTING;

EID: 0037120703     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00220-X     Document Type: Article

References (7)

1. Routing to multiple destinations in computer network
2. A greedy heuristic for the set-covering problem
3. Efficient collective communication in WDM networks
4. A fast algorithm for Steiner trees
5. Multicast routing algorithms and protocols: A tutorial