Sciweavers

846 search results - page 24 / 170
» The stability of paths in a dynamic network
Sort
View
SIGMETRICS
2002
ACM
133views Hardware» more  SIGMETRICS 2002»
14 years 11 months ago
On the stability of network distance estimation
Estimating end-to-end Internet distance can benefit many applications and services, such as efficient overlay construction, overlay routing and location, and peer-topeer systems. ...
Yan Chen, Khian Hao Lim, Randy H. Katz, Chris Over...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 1 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 4 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
JNW
2006
98views more  JNW 2006»
14 years 11 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
DSN
2009
IEEE
15 years 6 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...