Sciweavers

830 search results - page 29 / 166
» Route kernels for trees
Sort
View
INFOCOM
1999
IEEE
15 years 8 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
128
Voted
ICAS
2005
IEEE
109views Robotics» more  ICAS 2005»
15 years 9 months ago
Proactive Route Maintenance and Overhead Reduction for Application Layer Multicast
— The purpose of this study is to maintain efficient backup routes for restoring overlay trees. In most conventional methods, after a node leaves the trees, its children start se...
Tetsuya Kusumoto, Yohei Kunichika, Jiro Katto, Sak...
ICDCS
1999
IEEE
15 years 8 months ago
On Providing Quality-of-Service Control for Core-Based Multicast Routing
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
Hung-Ying Tyan, Chao-Ju Hou, Bin Wang 0002
114
Voted
GD
2003
Springer
15 years 9 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
100
Voted
ORL
2008
77views more  ORL 2008»
15 years 3 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...