Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks

New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. In this paper, we use and extend a recently proposed graph theoretic model, which helps capture the evolving characteristic of such networks, in order to propose and formally analyze least cost journey (the analog of paths in usual graphs) in a class of dynamic networks, where the changes in the topology can be predicted in advance. Cost measures investigated here are hop count (shortest journeys), arrival date (foremost journeys), and time span (fastest journeys).

[1]  Jonathan Halpern,et al.  Shortest path with time constraints on movement and parking , 1974, Networks.

[2]  Martin Skutella,et al.  Flows over time with load-dependent transit times , 2002, SODA '02.

[3]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[4]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[5]  Martin Skutella,et al.  The Quickest Multicommodity Flow Problem , 2002, IPCO.

[6]  Markus Werner,et al.  Capacity Dimensioning of ISL Networks in Broadband LEO Satellite Systems , 1999 .

[7]  Afonso Ferreira,et al.  Computing multicast trees in dynamic networks using evolving graphs , 2002 .

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[9]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[10]  Afonso Ferreira,et al.  Topological design, routing, and handover in satellite networks , 2002 .

[11]  Christian Scheideler.  Models and Techniques for Communication in Dynamic Networks , 2002, STACS.

[12]  Andrew B. Philpott,et al.  Continuous-Time Flows in Networks , 1990, Math. Oper. Res..

[13]  Eylem Ekici,et al.  Datagram routing algorithm for LEO satellite networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Martin Skutella,et al.  Time-Expanded Graphs for Flow-Dependent Transit Times , 2002, ESA.

[16]  Peter Winkler,et al.  Wide-Sense Nonblocking WDM Cross-Connects , 2002, ESA.

[17]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[18]  M. Werner,et al.  Traffic Flows and Dynamic Routing in LEO Intersatellite Link Networks. , 1997 .