Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Achieving Convergence-Free Routing using Failure-Carrying Packets
 

Summary: Achieving Convergence-Free Routing using
Failure-Carrying Packets
Karthik Lakshminarayanan
University of California, Berkeley
Matthew Caesar
University of California, Berkeley
Murali Rangan
University of California, Berkeley
Tom Anderson
University of Washington
Scott Shenker
University of California, Berkeley
Ion Stoica
University of California, Berkeley
ABSTRACT
Current distributed routing paradigms (such as link-state, distance-
vector, and path-vector) involve a convergence process consisting
of an iterative exploration of intermediate routes triggered by cer-
tain events such as link failures. The convergence process increases
router load, introduces outages and transient loops, and slows re-

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison
Anderson, Tom - Department of Computer Science and Engineering, University of Washington at Seattle
Stoica, Ion - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collections: Computer Technologies and Information Sciences