By Topic

Minimum-expected-delay alternate routing

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

2 Author(s)
Ogier, R.G. ; SRI Int., Menlo Park, CA, USA ; Rutenburg, V.

The authors consider the problem of finding a routing strategy that minimizes the expected delay from every source to a single destination in a network in which each link fails and recovers according to a Markov chain. It is assumed that each node knows the current state of its own outgoing links and the state-transition probabilities for every link of the network. It is shown that the general problem is #P-complete, and two special cases are considered: case 1 assumes the network is a directed acyclic graph oriented toward the destination, and case 2 assumes that the link states are independent from slot to slot. For each case, it is proved that the optimal routing strategy has a simple state-independent representation. An efficient algorithm is presented for finding the optimal strategy.

Published in:

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

Date of Conference:

0-0 May 1992