Sciweavers

1432 search results - page 185 / 287
» Hardness of robust network design
Sort
View
IPPS
2009
IEEE
16 years 29 days ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
ANCS
2007
ACM
15 years 10 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ANCS
2007
ACM
15 years 10 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy
SIGMETRICS
2008
ACM
15 years 6 months ago
Traffic capacity of multi-cell WLANS
Performance of WLANs has been extensively studied during the past few years. While the focus has mostly been on isolated cells, the coverage of WLANs is in practice most often rea...
Thomas Bonald, Ali Ibrahim, James Roberts
SENSYS
2010
ACM
15 years 4 months ago
AutoWitness: locating and tracking stolen property while tolerating GPS and radio outages
We present AutoWitness, a system to deter, detect, and track personal property theft, improve historically dismal stolen property recovery rates, and disrupt stolen property distr...
Santanu Guha, Kurt Plarre, Daniel Lissner, Somnath...