TY - GEN
T1 - Utility-based end-to-end flow control for services with time-varying rate requirements
AU - Kim, Byung Gook
AU - Lee, Jang Won
PY - 2009
Y1 - 2009
N2 - In this paper, we study a utility based flow control problem for a communication network. In most previous works on utility based flow control, the utility function of each user, which represents its satisfaction to the allocated data rate, is assumed to be fixed. This implies that the degree of the rate requirement of each user is assumed to be fixed over the entire duration of its session. However, in the communication network, many services are variable rate services, i.e., the degree of their rate requirement varies over time. Hence, in this paper, we allow the degree of the rate requirement of each user to change over time and model it by using a stochastic utility function that varies stochastically according to the variation of the degree of its rate requirement. We formulate a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on the link capacity. By solving the stochastic optimization problem, we develop a distributed flow control algorithm that converges to the optimal rate allocation.
AB - In this paper, we study a utility based flow control problem for a communication network. In most previous works on utility based flow control, the utility function of each user, which represents its satisfaction to the allocated data rate, is assumed to be fixed. This implies that the degree of the rate requirement of each user is assumed to be fixed over the entire duration of its session. However, in the communication network, many services are variable rate services, i.e., the degree of their rate requirement varies over time. Hence, in this paper, we allow the degree of the rate requirement of each user to change over time and model it by using a stochastic utility function that varies stochastically according to the variation of the degree of its rate requirement. We formulate a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on the link capacity. By solving the stochastic optimization problem, we develop a distributed flow control algorithm that converges to the optimal rate allocation.
UR - http://www.scopus.com/inward/record.url?scp=63749095659&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=63749095659&partnerID=8YFLogxK
U2 - 10.1109/CCNC.2009.4784758
DO - 10.1109/CCNC.2009.4784758
M3 - Conference contribution
AN - SCOPUS:63749095659
SN - 9781424423095
T3 - 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
BT - 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
T2 - 2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
Y2 - 10 January 2009 through 13 January 2009
ER -