Sciweavers

184 search results - page 23 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
DSN
2003
IEEE
14 years 21 days ago
A Preemptive Deterministic Scheduling Algorithm for Multithreaded Replicas
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K...
INFOCOM
2010
IEEE
13 years 5 months ago
Topological Properties Affect the Power of Network Coding in Decentralized Broadcast
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...
Di Niu, Baochun Li
ISCC
2003
IEEE
14 years 21 days ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian
VTC
2008
IEEE
179views Communications» more  VTC 2008»
14 years 1 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
SAC
2006
ACM
14 years 1 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed