Average stretch analysis of compact routing schemes

Abstract

This paper presents some analytic results concerning the pivot interval routing (PIR) strategy of [T. Eilam, C. Gavoille, D. Peleg, Compact routing schemes with low stretch factor, J. Algorithms 46(2) (2003) 97-114, Preliminary version appeared. in: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, June 1998, pp. 11-20.] That strategy allows message routing on every weighted n-node network along paths whose stretch (namely, the ratio between their length and the distance between their endpoints) is at most five, and whose average stretch is at most three, with routing tables of size O (sqrt(n) log3 / 2 n) bits per node. In addition, the route lengths are at most 2 D (⌈ 1.5 D ⌉ for uniform weights) where D is the weighted diameter of the network. The PIR strategy can be constructed in polynomial time and can be implemented so that the generated scheme is in the form of an interval routing scheme (IRS), using at most O (sqrt(n log n)) intervals per link. Here, it is shown that there exists an unweighted n-node graph G and an identity assignment ID for its nodes such that for every R ∈ PIR on G with a set of pivots computed by a greedy cover algorithm (respectively, a randomized algorithm), AvStrG (R) > 3 - o (1) (respectively, with high probability). Also, it is shown that for almost every unweighted n-node graph G, and for every R ∈ PIR on G, AvStrG (R) = 1.875 ± o (1). A comparison between PIR and HCPk, the hierarchical routing strategy presented in [B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990) 307-341.] is also given. © 2006 Elsevier B.V. All rights reserved.