Sciweavers

352 search results - page 52 / 71
» Proof-Checking a Data Link Protocol
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
ICPPW
2005
IEEE
14 years 1 months ago
A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...
Zhi Li, Yu-Kwong Kwok
JCSS
2006
56views more  JCSS 2006»
13 years 7 months ago
Determining model accuracy of network traces
Accurate network modeling is critical to the design of network protocols. Traditional modeling approaches, such as Discrete Time Markov Chains (DTMC) are limited in their ability ...
Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph
IPSN
2007
Springer
14 years 1 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
14 years 7 months ago
Learning nonstationary models of normal network traffic for detecting novel attacks
Traditional intrusion detection systems (IDS) detect attacks by comparing current behavior to signatures of known attacks. One main drawback is the inability of detecting new atta...
Matthew V. Mahoney, Philip K. Chan