Sciweavers

227 search results - page 16 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
ANTSW
2006
Springer
15 years 1 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
CISS
2008
IEEE
14 years 11 months ago
Network tomography based on additive metrics
Inference of the network structure (e.g., routing topology) and dynamics (e.g., traffic matrices, link performance) is an important component in many network design and management ...
Jian Ni, Sekhar Tatikonda
IPPS
1999
IEEE
15 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CN
2007
168views more  CN 2007»
14 years 9 months ago
Network anomaly detection with incomplete audit data
With the ever increasing deployment and usage of gigabit networks, traditional network anomaly detection based Intrusion Detection Systems (IDS) have not scaled accordingly. Most,...
Animesh Patcha, Jung-Min Park