Sciweavers

625 search results - page 48 / 125
» Semi-preemptive routing on trees
Sort
View
FOCS
1994
IEEE
14 years 3 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
AINA
2009
IEEE
14 years 5 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
ICALP
2003
Springer
14 years 4 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»
14 years 5 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»
14 years 5 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-...