Skip to main content
Article thumbnail
Location of Repository

Compact Routing with Slack in Low Doubling Dimension ABSTRACT

By Goran Konjevod, Andréa W. Richa, Hai Yu and Donglin Xia

Abstract

We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek nameindependent routing schemes with (1 + ɛ) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a small fraction of nodes to have large storage, say size of O(n log n) bits, or (ii) a small fraction of source-destination pairs to have larger, but still constant, stretch. In this paper, given any constant ɛ ∈ (0, 1), any δ ∈ Θ(1 / polylog n) and any connected edge-weighted undirected graph G with doubling dimension α ∈ O(log log n) andarbitrary node names, we presen

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6862
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.duke.edu/~fishha... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.