A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks

Jingyao Wang, Mahmoud Ashour, Constantino Manuel Lagoa, Necdet S. Aybat, Hao Che

Research output: Contribution to journalArticle

Abstract

As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is “hard” to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of O(1∕K), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.

Original languageEnglish (US)
Article number108506
JournalAutomatica
Volume109
DOIs
StatePublished - Nov 1 2019

Fingerprint

Telecommunication networks
Internet
Routers
Packet switching
Packet networks
Switching networks
Resource allocation
Telecommunication links
Flow of fluids
Bandwidth

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

@article{c57b90c3f2c44f8690c1cc61a9071e1f,
title = "A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks",
abstract = "As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is “hard” to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of O(1∕K), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.",
author = "Jingyao Wang and Mahmoud Ashour and Lagoa, {Constantino Manuel} and Aybat, {Necdet S.} and Hao Che",
year = "2019",
month = "11",
day = "1",
doi = "10.1016/j.automatica.2019.108506",
language = "English (US)",
volume = "109",
journal = "Automatica",
issn = "0005-1098",
publisher = "Elsevier Limited",

}

A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks. / Wang, Jingyao; Ashour, Mahmoud; Lagoa, Constantino Manuel; Aybat, Necdet S.; Che, Hao.

In: Automatica, Vol. 109, 108506, 01.11.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks

AU - Wang, Jingyao

AU - Ashour, Mahmoud

AU - Lagoa, Constantino Manuel

AU - Aybat, Necdet S.

AU - Che, Hao

PY - 2019/11/1

Y1 - 2019/11/1

N2 - As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is “hard” to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of O(1∕K), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.

AB - As IP video services have emerged to be the predominant Internet application, how to optimize the Internet resource allocation, while satisfying the quality of experience (QoE) for users of video services and other Internet applications becomes a challenge. This is because the QoE perceived by a user of video services can be characterized by a staircase function of the data rate, which is nonconcave and hence it is “hard” to find the optimal operating point. The work in this paper aims at tackling this challenge. It considers the packet routing problem among multiple end points in packet switching networks based on a connectionless, hop-by-hop forwarding paradigm. We model this traffic allocation problem using a fluid flow model and let the link bandwidth be the only resource to be shared. To maximize the utilization of resources and avoid congestion, we formulate the problem as a network utility maximization problem. More precisely, the objective of this paper is to design a Fully Distributed Traffic Allocation Algorithm (FDTAA) that is applicable to a large class of nonconcave utility functions. Moreover, FDTAA runs in a fully distributed way: it enables each router to independently address and route each data unit using immediate local information in parallel, without referring to any global information of the communication network. FDTAA requires minimum computation workload, since the routing decision made at each router is solely based on the destination information carried in each unit. In addition, the network utility values corresponding to the FDTAA iterate sequence converge to the optimal network utility value at the rate of O(1∕K), where K is the iteration counter. These theoretical results are exemplified by the simulation performed on an example communication network.

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

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

U2 - 10.1016/j.automatica.2019.108506

DO - 10.1016/j.automatica.2019.108506

M3 - Article

AN - SCOPUS:85069891629

VL - 109

JO - Automatica

JF - Automatica

SN - 0005-1098

M1 - 108506

ER -