Sciweavers

1768 search results - page 186 / 354
» Optimal routing in Chord
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
15 years 29 days ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
CP
2010
Springer
14 years 12 months ago
Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
Russell Bent, Pascal Van Hentenryck
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
88
Voted
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 1 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
ICC
2009
IEEE
196views Communications» more  ICC 2009»
15 years 8 months ago
Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
Sucha Supittayapornpong, Poompat Saengudomlert