Sciweavers

244 search results - page 14 / 49
» Analyzing the performance of randomized information sharing
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
TWC
2008
110views more  TWC 2008»
13 years 7 months ago
Information outage probability and diversity order of symmetric coordinate interleaved orthogonal designs
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...
Hoojin Lee, Jeffrey G. Andrews, Edward J. Powers
TCC
2007
Springer
93views Cryptology» more  TCC 2007»
14 years 1 months ago
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke L...
ICNS
2009
IEEE
13 years 5 months ago
A BitTorrent Performance Evaluation Framework
In the last decade, file sharing systems have generally been dominated by P2P solutions. Whereas e-mail and HTTP have been the killer apps of the earlier Internet, a large percent...
Razvan Deaconescu, Razvan Rughinis, Nicolae Tapus
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 16 days ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh