Sciweavers

242 search results - page 47 / 49
» Deterministic small-world communication networks
Sort
View
91
Voted
ANCS
2009
ACM
14 years 7 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
ANCS
2007
ACM
15 years 1 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
INFOCOM
2008
IEEE
15 years 3 months ago
Link Lifetimes and Randomized Neighbor Selection in DHTs
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
Zhongmei Yao, Dmitri Loguinov
MM
2004
ACM
106views Multimedia» more  MM 2004»
15 years 2 months ago
Probabilistic delay guarantees using delay distribution measurement
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
CORR
2010
Springer
170views Education» more  CORR 2010»
14 years 9 months ago
Sidelobe Control in Collaborative Beamforming via Node Selection
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov