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.

A Mathematical Model of Joint Congestion Control and Routing in Multisource Networks

Published

Author(s)

Fern Y. Hunt, Vladimir V. Marbukh, Yi Wang

Abstract

In this paper we study a model of joint congestion control and routing in a ring of network sources with a single destination at the center. A utility maximization problem subject to routing constraints is posed and equations for its solution are presented. In the very symmetric situation where all sources have the same route allocation probabilities and the same link capacities we find conditions for convergence of a continuous approximation to these equations and confirm convergence for the original equations numerically. Despite the symmetry the sources do not always behave identically.
Proceedings Title
Proceedings of the 2011 IEEE Multiconference on Systems and Control
Conference Dates
September 28-30, 2011
Conference Location
Denver, CO

Keywords

TCP/IP protocols, mathematical modeling

Citation

Hunt, F. , Marbukh, V. and Wang, Y. (2011), A Mathematical Model of Joint Congestion Control and Routing in Multisource Networks, Proceedings of the 2011 IEEE Multiconference on Systems and Control, Denver, CO, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=907904 (Accessed December 12, 2024)

Issues

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

Created September 28, 2011, Updated June 2, 2021