Stefan Rührup, Christian Schindelhauer  Home/Search
Context
Related
| wwwcs.unipaderborn.de/cs/a...esa05.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: wwwcs.unipaderbor...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of routing a message in a processor mesh with faulty processors. The number and positions of faulty processors is unknown. It is known that a flooding strategy like expanding ring search can route a message in the minimum number of steps h while it causes a traffic (i.e. the total number of messages) of O(h^2). For optimizing traffic a single-path strategy is optimal producing traffic O(p + h), where p is the perimeter length of the barriers formed by the faulty nodes.... (Update)
Active bibliography (related documents): More All
2.0: Improved Bounds for Online Multi-Path Routing in Faulty.. - Rührup, Schindelhauer (2006) (Correct)
0.4: Aligned Virtual Coordinates for Greedy Geometric Routing .. - Ke Liu, Nael.. (Correct)
0.2: Online Multi-Path Routing in a Maze - Rührup, Schindelhauer (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@inproceedings{ ruehrup05online,
author = {Stefan R{\"u}hrup and Christian Schindelhauer},
title = {Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio},
booktitle = {Proceedings of the 13th European Symposium on Algorithms (ESA'05), LNCS 3669},
year = {2005},
pages = {23--34},
url = {citeseer.ist.psu.edu/744550.html} }
Citations (may not include all citations):315 Routing with guaranteed delivery in ad hoc wireless networks - Bose, Morin et al. - 2001
280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
83 Navigating in unfamiliar geometric terrain - Blum, Raghavan et al. - 1997
79 Path-planning strategies for a point mobile automaton moving.. (context) - Lumelsky, Stepanov - 1987
75 Compass routing on geometric networks - Kranakis, Singh et al. - 1999
75 A survey on position-based routing in mobile ad hoc networks - Mauve, Widmer et al. - 2001
66 Beyond competitive analysis - Koutsoupias, Papadimitriou - 2000
47 Robot navigation in unknown terrains: Introductory survey of.. - Rao, Kareti et al. - 1993
21 Asymptotically optimal geometric mobile ad-hoc routing - Kuhn, Wattenhofer et al. - 2002
19 line searching and navigation (context) - Berman - 1998
14 Algorithmic and complexity issues of robot motion in an unce.. (context) - Lumelsky - 1987
11 Robot navigation with range queries (context) - Angluin, Westbrook et al. - 1996
9 Wormhole routing techniques for directly connected multicomp.. - Mohapatra - 1998
8 Reconfiguring Arrays with Faults Part I: Worst-case Faults - Cole, Maggs et al. - 1997
5 Shortest paths without a map (context) - Papadimitriou, Yannakakis
5 Fault-tolerant message routing for multiprocessors - Zakrevski, Karpovsky - 1998
4 Fault-tolerant adaptive and minimal routing in mesh-connecte.. - Wu - 2000
2 Extended minimal routing in 2-d meshes with faulty blocks (context) - Wu, Jiang - 2002
2 Competitive time and traffic analysis of position-based rout.. (context) - uhrup, Schindelhauer - 2005
1 Online routing in faulty meshes with sublinear comparative t.. (context) - uhrup, Schindelhauer - 2005
Documents on the same site (http://wwwcs.uni-paderborn.de/cs/ag-madh/WWW/sr/publications.html): More
Online Multi-Path Routing in a Maze - Rührup, Schindelhauer (2005) (Correct)
Competitive Time and Traffic Analysis of Position-based.. - Rührup, Schindelhauer (2005) (Correct)
Performance Analysis of the Hierarchical Layer Graph.. - Rührup.. (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC