Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Weak State Routing for Large Scale Dynamic Networks Utku Gnay Acer Shivkumar
 

Summary: Weak State Routing for Large Scale Dynamic Networks
Utku GŁnay Acer Shivkumar
Kalyanaraman
Alhussein A. Abouzeid
Department of Electrical, Computer and Systems Engineering
Rensselaer Polytechnic Institute
Troy, NY, USA
aceru@rpi.edu, {shivkuma,abouzeid}@ecse.rpi.edu
ABSTRACT
Routing in communication networks involves the indirection from
a persistent name (or ID) to a locator and delivering packets based
upon the locator. In a large-scale, highly dynamic network, the
ID-to-locator mappings are both large in number, and change of-
ten. Traditional routing protocols require high overhead to keep
these indirections up-to-date. In this paper, we propose Weak State
Routing (WSR), a routing mechanism for large-scale highly dy-
namic networks. WSR's novelty is that it uses random directional
walks biased occasionally by weak indirection state information in
intermediate nodes. The indirection state information is weak, i.e.
interpreted not as absolute truth, but as probabilistic hints. Nodes

  

Source: Abouzeid, Alhussein A. - Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute

 

Collections: Engineering; Computer Technologies and Information Sciences