36 search results - page 2 / 8 » A Heuristic Algorithm for the Multi-constrained Multicast Tr... |
INFOCOM
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
INFOCOM
1999
IEEE
13 years 9 months ago
1999
IEEE
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
INFOCOM
1995
IEEE
13 years 9 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
GLOBECOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
ICCNMC
2005
Springer
13 years 11 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...