Stochastic utility-based flow control algorithm for services with time-varying rate requirements

Byung Gook Kim, Jang Won Lee

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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 communication networks, many services are variable rate services, i.e., the degree of their rate requirement varies over time, which cannot be modeled with traditional static utility functions. To resolve this issue and appropriately model services with variable rate requirements, we propose a stochastic utility function that varies stochastically according to the variation of the degree of the rate requirement of a service. We formulate a flow control problem as a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on link capacity and QoS requirement. By solving the stochastic optimization problem, we develop a distributed flow control algorithm that converges to the optimal rate allocation.

Original languageEnglish
Pages (from-to)1329-1342
Number of pages14
JournalComputer Networks
Volume56
Issue number4
DOIs
Publication statusPublished - 2012 Mar 16

Fingerprint

Flow control
Telecommunication networks
Quality of service

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{009a8fea8781485496a808d6bbe4a35a,
title = "Stochastic utility-based flow control algorithm for services with time-varying rate requirements",
abstract = "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 communication networks, many services are variable rate services, i.e., the degree of their rate requirement varies over time, which cannot be modeled with traditional static utility functions. To resolve this issue and appropriately model services with variable rate requirements, we propose a stochastic utility function that varies stochastically according to the variation of the degree of the rate requirement of a service. We formulate a flow control problem as a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on link capacity and QoS requirement. By solving the stochastic optimization problem, we develop a distributed flow control algorithm that converges to the optimal rate allocation.",
author = "Kim, {Byung Gook} and Lee, {Jang Won}",
year = "2012",
month = "3",
day = "16",
doi = "10.1016/j.comnet.2011.12.008",
language = "English",
volume = "56",
pages = "1329--1342",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "4",

}

Stochastic utility-based flow control algorithm for services with time-varying rate requirements. / Kim, Byung Gook; Lee, Jang Won.

In: Computer Networks, Vol. 56, No. 4, 16.03.2012, p. 1329-1342.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Stochastic utility-based flow control algorithm for services with time-varying rate requirements

AU - Kim, Byung Gook

AU - Lee, Jang Won

PY - 2012/3/16

Y1 - 2012/3/16

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 communication networks, many services are variable rate services, i.e., the degree of their rate requirement varies over time, which cannot be modeled with traditional static utility functions. To resolve this issue and appropriately model services with variable rate requirements, we propose a stochastic utility function that varies stochastically according to the variation of the degree of the rate requirement of a service. We formulate a flow control problem as a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on link capacity and QoS requirement. 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 communication networks, many services are variable rate services, i.e., the degree of their rate requirement varies over time, which cannot be modeled with traditional static utility functions. To resolve this issue and appropriately model services with variable rate requirements, we propose a stochastic utility function that varies stochastically according to the variation of the degree of the rate requirement of a service. We formulate a flow control problem as a stochastic optimization problem with stochastic utility functions that aims at maximizing the average network utility while satisfying the constraint on link capacity and QoS requirement. 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=84858154015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858154015&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2011.12.008

DO - 10.1016/j.comnet.2011.12.008

M3 - Article

AN - SCOPUS:84858154015

VL - 56

SP - 1329

EP - 1342

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 4

ER -