Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

QoS Routing Under Adversarial Binary Uncertainty



Vladimir V. Marbukh


A cost-based admission control and routing scheme admits an arriving request on the minimum cost route if this cost does not exceed the cost of the request, and rejects the request otherwise. Cost based 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 expected future revenue losses due to insufficient resources to service future requests. In the latter case the cost of a route represents the expected level of QoS, e.g., bandwidth, delay, packet loss, etc., provided to the request carried on this route. This paper explores different approaches intended to guard against adversarial uncertainty, i.e., worst case scenario, with respect to the resource costs lying within known confidence intervals. We assume that the network minimizes and the adversarial environment maximizes the loss or risk resulted from non-optimal admission and routing decisions due to the uncertainty. In a symmetric case we explicitly identify the optimal network strategy by solving the corresponding game of the network against environment.
Proceedings Title
Proceedings of International Conference on Communications (ICC 2002)
Conference Dates
April 1-2, 2002
Conference Location
New York, NY


Marbukh, V. (2002), QoS Routing Under Adversarial Binary Uncertainty, Proceedings of International Conference on Communications (ICC 2002), New York, NY, [online], (Accessed June 16, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created April 1, 2002, Updated February 19, 2017