Sciweavers

15 search results - page 3 / 3
» On Interval Routing Schemes and Treewidth
Sort
View
TPDS
2010
126views more  TPDS 2010»
13 years 12 hour ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
IJNSEC
2007
122views more  IJNSEC 2007»
13 years 5 months ago
Detecting Blackhole Attack on AODV-based Mobile Ad Hoc Networks by Dynamic Learning Method
This paper analyzes the blackhole attack which is one of the possible attacks in ad hoc networks. In a blackhole attack, a malicious node impersonates a destination node by sendin...
Satoshi Kurosawa, Hidehisa Nakayama, Nei Kato, Abb...
NOMS
2008
IEEE
13 years 11 months ago
Self-tuning network support for MANETs
Abstract—Rapid and unpredictable topology changes and resource constraints make delivering packets in a MANET (Mobile Ad hoc Network) a challenging task. Routing information has ...
Yangcheng Huang, Saleem N. Bhatti, Søren-Ak...
DSN
2006
IEEE
13 years 11 months ago
Improving BGP Convergence Delay for Large-Scale Failures
Border Gateway Protocol (BGP) is the standard routing protocol used in the Internet for routing packets between the Autonomous Systems (ASes). It is known that BGP can take hundre...
Amit Sahoo, Krishna Kant, Prasant Mohapatra
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
13 years 10 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke