Sciweavers

98 search results - page 4 / 20
» The Synchronization of Periodic Routing Messages
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Can coexisting overlays inadvertently step on each other?
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
CLUSTER
2006
IEEE
14 years 1 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
SIGCOMM
1997
ACM
13 years 11 months ago
Internet Routing Instability
Abstract—This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet ...
Craig Labovitz, G. Robert Malan, Farnam Jahanian
JCST
2008
144views more  JCST 2008»
13 years 7 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
SPDP
1993
IEEE
13 years 11 months ago
Group Membership in a Synchronous Distributed System
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
Gianluigi Alari, Augusto Ciuffoletti