Sciweavers

105 search results - page 6 / 21
» Distributed Algorithms for Computing Alternate Paths Avoidin...
Sort
View
BROADNETS
2006
IEEE
14 years 1 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
CN
2010
95views more  CN 2010»
13 years 7 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
SIGCOMM
2009
ACM
14 years 2 months ago
Practical, distributed channel assignment and routing in dual-radio mesh networks
Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose h...
Aditya Dhananjay, Hui Zhang, Jinyang Li, Lakshmina...
ICNP
2002
IEEE
14 years 15 days ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
CN
2004
108views more  CN 2004»
13 years 7 months ago
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
Samphel Norden, Milind M. Buddhikot, Marcel Waldvo...