Sciweavers

460 search results - page 9 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
SPAA
2003
ACM
14 years 28 days ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
WOWMOM
2005
ACM
115views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
Precise Distributed Localization Algorithms for Wireless Networks
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Saad Biaz, Yiming Ji
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Single-Source Stochastic Routing
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...
Shuchi Chawla, Tim Roughgarden
CONEXT
2006
ACM
14 years 1 months ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia