Sciweavers

806 search results - page 84 / 162
» Lower Bounds on Correction Networks
Sort
View
MOBIHOC
2004
ACM
16 years 5 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
IPPS
1999
IEEE
15 years 10 months ago
A Consistent History Link Connectivity Protocol
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...
Paul S. LeMahieu, Jehoshua Bruck
NETWORKING
2004
15 years 7 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
TON
1998
68views more  TON 1998»
15 years 5 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
SENSYS
2004
ACM
15 years 11 months ago
The dynamic behavior of a data dissemination protocol for network programming at scale
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
Jonathan W. Hui, David E. Culler