NIST · ИТ · cc6e658216adb8caaea8
Congestion Due to Random Walk Routing
In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal degree with a
NIST · ИТОфициальный источник · 2013-08-31
{
"title_en": "Congestion Due to Random Walk Routing",
"designation": "",
"series": "",
"status": "",
"date": "2013-08-31",
"date_original": "August 31, 2013",
"url": "https://www.nist.gov/publications/congestion-due-random-walk-routing",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh , Iraj Saniee, Onuttom Narayan",
"abstract_excerpt_en": "In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal degree with a",
"id": "cc6e658216adb8caaea8",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Congestion Due to Random Walk Routing",
"designation": "",
"series": "",
"status": "",
"date": "2013-08-31",
"date_original": "August 31, 2013",
"url": "https://www.nist.gov/publications/congestion-due-random-walk-routing",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh , Iraj Saniee, Onuttom Narayan",
"abstract_excerpt_en": "In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal degree with a"
}
],
"translation_state": "none"
}