Sciweavers

1424 search results - page 239 / 285
» On the efficiency of fluid simulation of networks
Sort
View
GLOBECOM
2007
IEEE
16 years 14 days ago
A Distributed Bandwidth Sharing Heuristic for Backup LSP Computation
— With the advent of MPLS, the restoration times of communications is decreased down to 50 ms by the use of preconfigured backup LSPs. To ensure there are enough resources after ...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
AINA
2010
IEEE
15 years 11 months ago
The Cost Effective Pre-processing Based NFA Pattern Matching Architecture for NIDS
—Network Intrusion Detection System (NIDS) is a system which can detect network attacks resulted from worms and viruses on the Internet. An efficient pattern matching algorithm p...
Yeim-Kuan Chang, Chen-Rong Chang, Cheng-Chien Su
HPCC
2009
Springer
15 years 10 months ago
Load Scheduling Strategies for Parallel DNA Sequencing Applications
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
Sudha Gunturu, Xiaolin Li, Laurence Tianruo Yang
ERCIMDL
2006
Springer
161views Education» more  ERCIMDL 2006»
15 years 9 months ago
Scalable Semantic Overlay Generation for P2P-Based Digital Libraries
The advent of digital libraries along with the tremendous growth of digital content call for distributed and scalable approaches for managing vast data collections. Peer-to-peer (P...
Christos Doulkeridis, Kjetil Nørvåg, ...
NSDI
2004
15 years 7 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer