By Topic

Shortest-path algorithms for time-dependent networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Orda ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; R. Rom

The authors consider the shortest-path problem in networks in which the length (or weight) of the edges change with time according to arbitrary functions. They present algorithms for finding the shortest-path and minimum-delay under various waiting constraints and investigate the quality of the derived path. They also show that if departure time from the source node is unrestricted and delay functions are continuous then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted strategy. The optimal waiting time for such cases is also computed. In more restricted transit, it is shown that there exist cases where the minimum delay is finite yet the path that achieves it is infinite.<>

Published in:

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Date of Conference:

27-31 March 1988