|
|
Volumn 1, Issue , 1995, Pages 212-219
|
|
Comparison of dynamic multicast routing algorithms for wide-areapacket switched (asynchronous transfer mode) networks
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ASYNCHRONOUS TRANSFER MODE NETWORKS;
DYNAMIC MULTICAST;
DYNAMIC MULTICAST ROUTING;
GREEDY ALGORITHMS;
MULTIPOINT;
PACKET SWITCHED NETWORKS;
RANDOM GRAPHS;
SHORTEST PATH ALGORITHMS;
SIMULATION RESULTS;
STEINER TREES;
WIDE AREAS;
ASYNCHRONOUS TRANSFER MODE;
DYNAMIC ROUTING ALGORITHMS;
GRAPH THEORY;
HEURISTIC ALGORITHMS;
MULTICASTING;
PACKET NETWORKS;
SWITCHING CIRCUITS;
TREES (MATHEMATICS);
ROUTING ALGORITHMS;
|
|
EID: 61849173557
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/INFCOM.1995.515879 Document Type: Conference Paper |
|
Times cited : (40)
|
|
References (0)
|
