NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
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.
A Model of Joint Congestion Control and Routing Through Random Assignment of Paths
Published
Author(s)
Fern Y. Hunt, Vladimir V. Marbukh
Abstract
We investigate the trade-off between utility and path diversity in a model of congestion control where there can be multiple routes between two locations in a network The model contains a random route allocation scheme for each source s (user or TCP session) where the degree of randomness and therefore path diversity is controlled by hs, the entropy of the route distribution.
Hunt, F.
and Marbukh, V.
(2010),
A Model of Joint Congestion Control and Routing Through Random Assignment of Paths, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=902537
(Accessed October 3, 2025)