474 search results - page 13 / 95 » On Multicast Path Finding Algorithms |
ISAAC
2003
Springer
14 years 25 days ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...
ADBIS
2000
Springer
13 years 12 months ago
2000
Springer
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
ICCNMC
2005
Springer
14 years 1 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, ...