Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

29 March 2024
 
  » arxiv » cs.DC/9903009

 Article overview


Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
Harry Buhrman ; Jaap-Henk Hoepman ; Paul Vitanyi ;
Date 10 Mar 1999
Subject Distributed, Parallel, and Cluster Computing; Architecture; Computational Complexity; Data Structures and Algorithms; Networking and Internet Architecture ACM-class: C.2, F.2, D.4 | cs.DC cs.AR cs.CC cs.DS cs.NI
AffiliationCWI), Jaap-Henk Hoepman, Paul Vitanyi (CWI and University of Amsterdam
AbstractWe use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs $Theta (n^2)$ bits are necessary and sufficient for shortest path routing. By `almost all graphs’ we mean the Kolmogorov random graphs which constitute a fraction of $1-1/n^c$ of all graphs on $n$ nodes, where $c > 0$ is an arbitrary fixed constant. There is a model for which the average case lower bound rises to $Omega(n^2 log n)$ and another model where the average case upper bound drops to $O(n log^2 n)$. This clearly exposes the sensitivity of such bounds to the model under consideration. If paths have to be short, but need not be shortest (if the stretch factor may be larger than 1), then much less space is needed on average, even in the more demanding models. Full-information routing requires $Theta (n^3)$ bits on average. For worst-case static networks we prove a $Omega(n^2 log n)$ lower bound for shortest path routing and all stretch factors $<2$ in some networks where free relabeling is not allowed.
Source arXiv, cs.DC/9903009
Other source [GID 810523] cs.DC/9903009
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica