Abstract
For the development in this section, it is convenient to represent the capacity constraints (2.2) in vector form. To this end, let R be a matrix that is defined as follows: the (r, l)th entry of R is 1 if source r’s route passes through link l and is zero otherwise. Thus, R is an | S| × |L| routing matrix which provides information on the links contained in all the source’s routes in the network. Let y l be the total arrival rate of traffic at link l.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Srikant, R. (2004). Congestion Control: A decentralized solution to the resource allocation problem. In: The Mathematics of Internet Congestion Control. Systems & Control: Foundations & Applications. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8216-3_3
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8216-3_3
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6498-9
Online ISBN: 978-0-8176-8216-3
eBook Packages: Springer Book Archive