NIST · ИТ · daddc300164a8be51cc5
Dynamic Routing and Congestion Control Through Random Assignment of Routes
We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to
NIST · ИТОфициальный источник · 2008-07-15
{
"title_en": "Dynamic Routing and Congestion Control Through Random Assignment of Routes",
"designation": "",
"series": "",
"status": "",
"date": "2008-07-15",
"date_original": "July 15, 2008",
"url": "https://www.nist.gov/publications/dynamic-routing-and-congestion-control-through-random-assignment-routes",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Fern Y. Hunt , Vladimir V. Marbukh",
"abstract_excerpt_en": "We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to",
"id": "daddc300164a8be51cc5",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Dynamic Routing and Congestion Control Through Random Assignment of Routes",
"designation": "",
"series": "",
"status": "",
"date": "2008-07-15",
"date_original": "July 15, 2008",
"url": "https://www.nist.gov/publications/dynamic-routing-and-congestion-control-through-random-assignment-routes",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Fern Y. Hunt , Vladimir V. Marbukh",
"abstract_excerpt_en": "We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to"
}
],
"translation_state": "none"
}