NDLI: QoS routing under adversarial binary uncertainty

Content Provider	IEEE Xplore Digital Library
Author	Marbukh, V.
Copyright Year	2002
Description	Author affiliation: Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA (Marbukh, V.)
Abstract	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 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 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 provided to the request. In both cases, due to aggregation, the statistical nature of the resource costs, propagation and queueing delays in disseminating signaling information, and a nonsteady or adversarial operational environment, the exact resource cost may be unknown. Usually, this uncertainty is modeled by assuming that resource costs are random variables with fixed probability distributions, which may or may not be known to the network. This paper explores a different approach 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 resulting 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.
Starting Page	2268
Ending Page	2272
File Size	200241
Page Count	5
File Format	PDF
ISBN	0780374002
DOI	10.1109/ICC.2002.997250
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-04-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Uncertainty Admission control Cost function Electrical capacitance tomography Bandwidth Propagation delay Random variables Probability distribution
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Minimum cost routing: Robustness through randomization

A. Cost based admission control and routing.

Competitive admission control and routing of multi-class traffic with statistical QoS guarantees

Localized QoS Routing with End-to-End Delay Guarantees

Cost-based QoS routing

Empirical probability based QoS routing

On transitional probabilistic routing in cognitive radio mesh networks

Adaptive Call Admission Control for Real Time Video Communications Based on Delay Probability Distribution

QoS routing in networks with uncertain parameters

QoS routing under adversarial binary uncertainty

Similar Documents

Minimum cost routing: Robustness through randomization

A. Cost based admission control and routing.

Competitive admission control and routing of multi-class traffic with statistical QoS guarantees

Localized QoS Routing with End-to-End Delay Guarantees

Cost-based QoS routing

Empirical probability based QoS routing

On transitional probabilistic routing in cognitive radio mesh networks

Adaptive Call Admission Control for Real Time Video Communications Based on Delay Probability Distribution

QoS routing in networks with uncertain parameters

QoS routing under adversarial binary uncertainty