Results 1 
3 of
3
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 > 0. ..."
Abstract

Cited by 31 (13 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.