Sciweavers

845 search results - page 24 / 169
» Diagnosabilities of regular networks
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Minerva: Learning to Infer Network Path Properties
—Knowledge of the network path properties such as latency, hop count, loss and bandwidth is key to the performance of overlay networks, grids and p2p applications. Network operat...
Rita H. Wouhaybi, Puneet Sharma, Sujata Banerjee, ...
SIGCOMM
2006
ACM
14 years 1 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
VLSISP
2008
140views more  VLSISP 2008»
13 years 7 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
ANCS
2007
ACM
13 years 12 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
2010
IEEE
13 years 6 months ago
Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
Elias Kehdi, Baochun Li