Sciweavers

1768 search results - page 350 / 354
» Optimal routing in Chord
Sort
View
ADHOC
2007
169views more  ADHOC 2007»
13 years 8 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
ADHOC
2007
113views more  ADHOC 2007»
13 years 8 months ago
Channelization for dynamic multi-frequency, multi-hop wireless cellular networks
Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available links to a base station. We envision an environment in which...
Jaesheung Shin, Raju Kumar, Parthu Kishen, Thomas ...
BMCBI
2008
214views more  BMCBI 2008»
13 years 8 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
COMCOM
2008
120views more  COMCOM 2008»
13 years 8 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner