Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Minimum delay routing in stochastic 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
$31 $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

3 Author(s)
Orda, A. ; Dept. of Electr. Eng., Technion-Israel, Haifa, Israel ; Rom, R. ; Sidi, M.

The authors consider the problem of traveling with least expected delay in networks whose link delays change probabilistically according to Markov chains. This is a typical routing problem in dynamic computer communication networks. They formulate several optimization problems, posed on infinite and finite horizons, and consider them with and without using memory in the decision making process. It is proved that all these problems are, in general, intractable. However, for networks with nodal stochastic delays, a simple polynomial optimal solution is presented. This is typical of high-speed networks, in which the dominant delays are incurred by the nodes. For more general networks, a tractable ε-optimal solution is presented. The performance of a regular shortest-path algorithm in such an environment is considered

Published in:

INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE

Date of Conference:

4-8 May 1992