Congestion Control: A decentralized solution to the resource allocation problem
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.
KeywordsCongestion Control Resource Allocation Problem Proportional Fairness Multicast Session Dual Algorithm
Unable to display preview. Download preview PDF.