By Topic

Minimum cost routing: Robustness through randomization

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

1 Author(s)
Marbukh, V. ; Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA

A minimum cost routing admits an arriving request on the minimum cost route if this minimum cost does not exceed the cost of the request, and rejects the request otherwise. Minimum cost routing strategies naturally arise as a result of optimization of the network performance or incorporating quality of service (QoS) requirements into the admission and routing processes. In the former case the implied cost of the resources represents the expected future revenue losses due to insufficient resources for servicing future requests. In the latter case the cost of a route represents the QoS provided to the request. In both cases due to the aggregation, delays in disseminating signaling information, statistical inferences, nonsteady or adversarial operational environment the cost of the resources may not be known exactly. Usually this uncertainty is modeled by assuming that the resource costs are random variables with some fixed probability distributions. We propose to explore a different approach intended to guard against the worst case scenario with respect to the resource costs. We solve the corresponding game in a symmetric case.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002