Sciweavers

11112 search results - page 1679 / 2223
» Computing Stuttering Simulations
Sort
View
CONEXT
2008
ACM
15 years 8 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
CONEXT
2008
ACM
15 years 8 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...
DCOSS
2008
Springer
15 years 8 months ago
Multi-root, Multi-Query Processing in Sensor Networks
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...
Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz
DCOSS
2008
Springer
15 years 8 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
DSN
2008
IEEE
15 years 8 months ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie
« Prev « First page 1679 / 2223 Last » Next »