4e18bff1d91e2aec4466 · QoS Routing Under Adversarial Binary Uncertainty
QoS Routing Under Adversarial Binary Uncertainty
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
{
"title_en": "QoS Routing Under Adversarial Binary Uncertainty",
"designation": "",
"series": "",
"status": "",
"date": "2002-04-01",
"date_original": "April 1, 2002",
"url": "https://www.nist.gov/publications/qos-routing-under-adversarial-binary-uncertainty",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh",
"abstract_excerpt_en": "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",
"id": "4e18bff1d91e2aec4466",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "QoS Routing Under Adversarial Binary Uncertainty",
"designation": "",
"series": "",
"status": "",
"date": "2002-04-01",
"date_original": "April 1, 2002",
"url": "https://www.nist.gov/publications/qos-routing-under-adversarial-binary-uncertainty",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh",
"abstract_excerpt_en": "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"
}
],
"translation_state": "none"
}