Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Upper and Lower Bounds for Routing Schemes in Dynamic Networks
 

Summary: Upper and Lower Bounds for
Routing Schemes in Dynamic Networks
(Abstract)
Yehuda Afek
AT&T Bell Labs &
Computer Science Department
Tel­Aviv University
Eli Gafni \Lambda
Computer Science Department
U.C.L.A. and Tel­Aviv University
Moty Ricklin
Computer Science Department
Tel­Aviv University
Abstract
We present an algorithm and two lower bounds for
the problem of constructing and maintaining routing
schemes in dynamic networks. The algorithm distribu­
tively assignes addresses to nodes and constructs rout­
ing tables in a dynamically growing tree. The resulting
routing scheme routes data messages over the shortest

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences