Sciweavers

58 search results - page 2 / 12
» Two Tree-Based Algorithms for Network Spare Capacity Design
Sort
View
LCN
2005
IEEE
13 years 10 months ago
Light-Trail Networks: Design and Survivability
The light-trail architecture provides a novel solution to address IP-centric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightwe...
Srivatsan Balasubramanian, Wensheng He, Arun K. So...
IPSN
2004
Springer
13 years 10 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
INFOCOM
2003
IEEE
13 years 10 months ago
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
Nikhil Bansal, Zhen Liu
IPPS
2007
IEEE
13 years 11 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
MOBICOM
2005
ACM
13 years 10 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal