Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bandwidth-efficient delay-and loss-tolerant overlay routing
 

Summary: Bandwidth-efficient delay- and loss-tolerant
overlay routing
Wojciech Galuba, Karl Aberer
Ecole Polytechnique F´ed´erale de Lausanne (EPFL)
wojciech.galuba@epfl.ch
project: http://lsirpeople.epfl.ch/galuba/ffp
Zoran Despotovic, Wolfgang Kellerer
DOCOMO Euro-Labs, Munich, Germany
Motivation. Peer-to-peer (P2P) systems are
mostly deployed in heterogeneous environments
with resource availability varying not only across
the nodes but also over time. If any of the shared
computational, storage or network resources are
exhausted, failures and delays occur. The com-
monly used crash-stop failure model assumes that
once a node stops sending messages it never again
resumes. Such failures are trivially detected and
appropriate algorithms are run that maintain the
connectivity and routing efficiency of the P2P over-
lay under continuous arrivals and departures of the

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences