632 search results - page 12 / 127 » On Routing in Circulant Graphs |
TPDS
2010
13 years 8 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...