Distributed shortest-path protocols for time-dependent networks

Distributed Computing

Volumn 10, Issue 1, 1996, Pages 49-62

  Orda, Ariel ^a   Rom, Raphael ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Distributed protocols; Interval scheme; Shortest path; Time dependency

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; NETWORK PROTOCOLS; TIME VARYING NETWORKS;

DISTRIBUTED SHORTEST PATH PROTOCOLS; PARAMETRIZATION; TIME DELAY FUNCTIONS; TIMING CONSTRAINTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030196020     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050023     Document Type: Article

References (17)

1. Segall A: The modeling of adaptive routing in data communication networks. IEEE Trans Commun COM-25(1): 85-95 (1977)
2. Anderson EJ, Nash P, Philpott AB: A class of continuous network How problems. Math Oper Res 7(4): 501-514 (1982)
3. Stassinopoulos GI, Konstuntopoulos P: Optimal congestion control in single destination networks. IEEE Trans Commun COM-33(8): 792- 800 (1985)
4. Sasaki G, Hajek B: Optimal dynamic routing in a single commodity network by iterative methods. IEEE Trails Commun COM-35(1): 1199- 1206 (1987)
5. Philpott AB: Continuous-time flows in networks. Math Oper Res 15(4): 640 -661 (1990)
6. Orda A, Rom R: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3): 607- 625 (1990)
7. Orda A, Rom R: Minimum weight paths in time-dependent networks. Networks 21(3): 295- 319 (1991)
8. Orda A, Rom R: Location of central nodes in time varying computer networks. Oper Res Lett 10(3): 143- 152 (1991)
9. Deo N, Pang CY: Shortest-path algorithms: taxonomy and annotation. Networks 14: 275 -323 (1984)
10. Dreyfus SE: An appraisal of some shortest path algorithms. Oper Res 17: 395-412 (1969)
11. Dijkstra, EW: A note on two problems in connection with graphs. Numer Analysis 1: 269- 271 (1959)
12. Ford Jr LR, Fulkerson DR: Flows in networks. Princeton University Press, Princeton, New Jersey 1962
13. Segall A: Distributed network protocols IEEE Trans Inf Theory (1983)
14. McQuillan JM, Falk G, Richer I: A review of the development and performance of the ARPANET routing algorithm. IEEE Trans Commun COM-26(12): 1802- 1811 (1978)
15. Awerbuch B: Complexity of network synchronization J ACM 32(4): 804 -823 (1985)
16. Orda A: Time dependent networks. D.Sc. Dissertation, Department of Electrical Engineering, Technion, Haifa, Israel, 1991
17. Orda A, Rom R, Sidi M: Minimum delay routing in stochastic networks. IEEE ACM Trans Networking 1(2): 187-198 (1993)