Results 1 
4 of
4
Routing in Distributed Networks: Overview and Open Problems
 ACM SIGACT News  Distributed Computing Column
, 2001
"... This article focuses on routing messages in distributed networks with efficient data structures. After an overview of the various results of the literature, we point some interestingly open problems. ..."
Abstract

Cited by 49 (12 self)
 Add to MetaCart
This article focuses on routing messages in distributed networks with efficient data structures. After an overview of the various results of the literature, we point some interestingly open problems.
Compact Routing Tables for Graphs of Bounded Genus
, 2000
"... This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, for any constant > ..."
Abstract

Cited by 30 (12 self)
 Add to MetaCart
This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, for any constant > 0. We obtain the same bounds for graphs of crossingedge number bounded by o(n= log n), and we generalize for graphs of genus bounded by > 0 yielding a size of n log +O(n) bits per node. Actually we prove a sharp upper bound of 2n log k +O(n) for graphs of pagenumber k, and a lower bound of n log k o(n log k) bits. These results are obtained by the use of dominating sets, compact coding of noncrossing partitions, and kpage representation of graphs.
ACM SIGACT News Distributed Computing Column 2
 SIGACT News
"... The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, veri cation, internet, and ..."
Abstract
 Add to MetaCart
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, veri cation, internet, and the web.
Average Stretch Analysis of Compact Routing Schemes
, 2004
"... This paper presents some analytic results concerning the Pivot Interval Routing (PIR) strategy of [8]. That strategy allows message routing on every weighted nnode network along paths whose stretch (namely, the ratio between their length and the distance between their endpoints) is at most ve, ..."
Abstract
 Add to MetaCart
This paper presents some analytic results concerning the Pivot Interval Routing (PIR) strategy of [8]. That strategy allows message routing on every weighted nnode network along paths whose stretch (namely, the ratio between their length and the distance between their endpoints) is at most ve, and whose average stretch is at most three, with routing tables of size O( n) bits per node. In addition, the route lengths are at most 2D (d1:5De 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( n log n) intervals per link. Here it is shown that there exists an unweighted nnode graph G and an identity assignment ID for its nodes such that for every R 2 PIR1 on G with a set of pivots computed by a greedy cover algorithm (respectively, a randomized algorithm), AvStrG (R) > 3 o(1) (resp., with high probability). Also, it is shown that for almost every unweighted nnode graph G, and for every R 2 PIR1 on G, AvStrG (R) = 1:875 o(1). A comparison between PIR and HCP k , the hierarchical routing strategy presented in [3] is also given.