Sciweavers

5079 search results - page 319 / 1016
» Hidden-Action in Network Routing
Sort
View
ALGOSENSORS
2007
Springer
15 years 9 months ago
Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks
Abstract. In this paper, we present an Intrusion Detection System designed for wireless sensor networks and show how it can be configured to detect Sinkhole attacks. A Sinkhole at...
Ioannis Krontiris, Tassos Dimitriou, Thanassis Gia...
NGC
2000
Springer
15 years 11 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
16 years 1 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
199
Voted
IWCMC
2010
ACM
16 years 16 days ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
15 years 11 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano