Skip to main content
U.S. flag

An official website of the United States government

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.

Dynamic Routing and Congestion Control Through Random Assignment of Routes

Published

Author(s)

Fern Y. Hunt, Vladimir V. Marbukh

Abstract

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 use the entropy to modulate between the two extremes of path specification; minimum cost path selection on one end and equiprobable path allocation on the other. We explore the trade-off between stability and utility in two sample topologies.
Proceedings Title
Proceedings of the 5th International Conference on Cybernetics and Information Technologies, Systems and Applications: CITSA 2008
Conference Dates
June 29-July 2, 2008
Conference Location
Orlando, FL

Keywords

cross-layer, TCP/IP algorithms

Citation

Hunt, F. and Marbukh, V. (2008), Dynamic Routing and Congestion Control Through Random Assignment of Routes, Proceedings of the 5th International Conference on Cybernetics and Information Technologies, Systems and Applications: CITSA 2008, Orlando, FL, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=152133 (Accessed December 9, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created July 15, 2008, Updated February 19, 2017