Sciweavers

846 search results - page 37 / 170
» The stability of paths in a dynamic network
Sort
View
MOBIHOC
2004
ACM
15 years 11 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
INFOCOM
2003
IEEE
15 years 5 months ago
Measuring Bottleneck Bandwidth of Targeted Path Segments
Abstract— Accurate measurement of network bandwidth is crucial for network management applications as well as flexible Internet applications and protocols which actively manage ...
Khaled Harfoush, Azer Bestavros, John W. Byers
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 8 hour ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
TELETRAFFIC
2007
Springer
15 years 5 months ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia
IPPS
2003
IEEE
15 years 5 months ago
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
This paper presents a generic scheme for a central, yet untackled issue in overlay dynamic networks: maintaining stability over long life and against malicious adversaries. The ge...
Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair B...