Sciweavers

Share
CORR
2008
Springer
106views Education» more  CORR 2008»
8 years 6 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
INFOCOM
1997
IEEE
8 years 10 months ago
Re-Routing in Circuit Switched Networks
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...
INFOCOM
2000
IEEE
8 years 10 months ago
Alternate Path Routing for Multicast
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
Daniel Zappala
INFOCOM
2006
IEEE
9 years 7 days ago
How to Select a Good Alternate Path in Large Peer-to-Peer Systems?
Abstract— When multiple paths are available between communicating hosts, application quality can be improved by switching among them to always use the best one. The key to such a...
Teng Fei, Shu Tao, Lixin Gao, Roch Guérin
ICC
2007
IEEE
121views Communications» more  ICC 2007»
9 years 16 days ago
Scalable Resilient Overlay Networks Using Destination-Guided Detouring
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
Sameer Qazi, Tim Moors
books