Sciweavers

242 search results - page 12 / 49
» Deterministic small-world communication networks
Sort
View
GLOBECOM
2008
IEEE
15 years 8 months ago
Scalable Redundancy for Sensors-to-Sink Communication
—In this paper, we present a new technique that uses deterministic binary network coding in a distributed manner to enhance the resiliency of Sensor-to-Base information flow aga...
Osameh M. Al-Kofahi, Ahmed E. Kamal
GLOBECOM
2010
IEEE
14 years 12 months ago
Performance-Oriented Routing in Telecommunication Networks
A lot of attention has been devoted to flow routing in networks by the past. Usually, each commodity to be routed is characterized by a single deterministic traffic value. However,...
Hassan Hijazi, Olivier Klopfenstein
154
Voted
ICC
2011
IEEE
237views Communications» more  ICC 2011»
14 years 1 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
FOCS
2007
IEEE
15 years 8 months ago
Finding Disjoint Paths in Expanders Deterministically and Online
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
Noga Alon, Michael R. Capalbo
INFOCOM
2008
IEEE
15 years 8 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...