Sciweavers

830 search results - page 71 / 166
» Route kernels for trees
Sort
View
ICALP
2003
Springer
15 years 9 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 10 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
CNSR
2006
IEEE
138views Communications» more  CNSR 2006»
15 years 10 months ago
MPLS-based Multicast Shared Trees
Abstract— This paper presents a study of our proposed architecture for the setup of a MultiPoint-to-MultiPoint (MP2MP) Label Switched Path (LSP). This form of LSP is needed for e...
Ashraf Matrawy, Wei Yi, Ioannis Lambadaris, Chung-...
INFOCOM
1999
IEEE
15 years 8 months ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
EUROMICRO
2007
IEEE
15 years 10 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...