Sciweavers

2654 search results - page 254 / 531
» Space-Time Network Coding
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
EXPERT
2006
84views more  EXPERT 2006»
15 years 6 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach
INFOCOM
2002
IEEE
15 years 11 months ago
On Multiple Description Streaming with Content Delivery Networks
Abstract— CDNs have been widely used to provide low latency, scalability, fault tolerance, and load balancing for the delivery of web content and more recently streaming media. W...
John G. Apostolopoulos, Tina Wong, Susie J. Wee, D...
INFOCOM
2008
IEEE
16 years 1 months ago
Dynamic Jamming Mitigation for Wireless Broadcast Networks
—Wireless communications are inherently symmetric; that is, it takes an attacker the same amount of power to modulate a signal as it does for a legitimate node to modulate the sa...
Jerry T. Chiang, Yih-Chun Hu
INFOCOM
2009
IEEE
16 years 1 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar