Abstract
Purchase PDF (403 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (230 K)
-MIRS, where 
doi:10.1016/j.tcs.2004.12.008 
Copyright © 2005 Elsevier B.V. All rights reserved.
Received 8 September 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we consider routing with compact tables in reliability networks. More precisely, we study interval routing on random graphs obtained from a base graph B by independently removing each edge with a failure probability 1-p. We focus on additive stretched routing for n-node random graphs for which the base B is a square mesh and p=0.5, that is the percolation model at the critical phase. We show a lower bound of
on the number of intervals required per edge for every additive stretch δ
0. On the other side, our experimental results show that the size of the largest biconnected components is Θ(n0.827), and thus that there exists a trivial shortest-path routing scheme using at most O(n0.827) intervals per edge.
The results are extended to random meshes of higher dimension. We show that, asymptotically almost surely, the number of intervals per edge for a random r-dimensional mesh with n nodes is , for every additive stretch δ
0 and for every integral dimension .
Keywords: Compact routing tables; Reliability networks; Random graphs; Interval routing; Percolation theory
