Routing with polynomial communication-space trade-off
| Author(s) : | David Peleg Baruch Awerbuch, |
| Publisher : | N/A |
| Publication Date : | 1992 |
| ISSN : | N/A |
| Abstract : | This paper presents a family of memory-balanced routing schemes that use relatively short paths while storing relatively little routing information. The hierarchical schemes H k (for every integer k 1) guarantee a stretch factor of O(k 2) on the length of the routes and require storing at most O(kn 1, |