Sciweavers

474 search results - page 10 / 95
» On Multicast Path Finding Algorithms
Sort
View
ISVC
2009
Springer
14 years 2 months ago
Energetic Path Finding across Massive Terrain Data
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
Andrew Tsui, Zoë J. Wood
INFOCOM
1999
IEEE
13 years 12 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
ICDCSW
2002
IEEE
14 years 17 days ago
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
COMCOM
2008
100views more  COMCOM 2008»
13 years 7 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
FOCS
2007
IEEE
14 years 1 months ago
Finding Disjoint Paths in Expanders Deterministically and Online
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
Noga Alon, Michael R. Capalbo