Sciweavers

248 search results - page 32 / 50
» Performance and stability bounds for dynamic networks
Sort
View
NSDI
2004
14 years 11 months ago
Structure Management for Scalable Overlay Service Construction
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
Kai Shen
INFOCOM
2010
IEEE
14 years 8 months ago
Multicast Scheduling with Cooperation and Network Coding in Cognitive Radio Networks
—Cognitive Radio Networks (CRNs) have recently emerged as a promising technology to improve spectrum utilization by allowing secondary users to dynamically access idle primary ch...
Jin Jin, Hong Xu, Baochun Li
IPSN
2004
Springer
15 years 3 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...
TKDE
2012
487views Formal Methods» more  TKDE 2012»
13 years 13 days ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
PODC
2004
ACM
15 years 3 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan