Resource allocation in load-constrained multihop wireless networks

Xi Fang, Dejun Yang, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this paper, we study the influence of network entity load constraints on network resource allocation. We focus on the problem of allocating network resources to optimize the total utility of multiple users in a wireless network, taking into account four resource and social requirements: 1) user QoS rate constraints, 2) node max load constraints, 3) node load balance constraints, and 4) node-user load constraints. We formulate this problem as a programming system. In order to solve this programming system, we first propose an optimization framework, called α-approximation dual subgradient algorithm, which may be applicable for many networking optimization problems. Given an approximation/optimal algorithm for solving the subproblem at each iteration, the framework leads to a result that can provide the following bounds at each iteration: 1) the bounds on the Lagrangian multipliers; 2) the bound on the amount of feasibility violation of the generated primal solutions; and 3) the upper and lower bounds on the gap between the optimal solution and the generated primal solutions. Based on this framework, we then present a distributed iterative algorithm to solve the network resource allocation problem. At each iteration, we provide bounds on the amount of feasibility violation, the gap between our solution and the optimal solution, node queue lengths, user utility deficits, and node load violation ratios.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages280-288
Number of pages9
DOIs
StatePublished - 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Resource allocation
Wireless networks
Computer systems programming
Quality of service

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Fang, X., Yang, D., & Xue, G. (2012). Resource allocation in load-constrained multihop wireless networks. In Proceedings - IEEE INFOCOM (pp. 280-288). [6195705] https://doi.org/10.1109/INFCOM.2012.6195705

Resource allocation in load-constrained multihop wireless networks. / Fang, Xi; Yang, Dejun; Xue, Guoliang.

Proceedings - IEEE INFOCOM. 2012. p. 280-288 6195705.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fang, X, Yang, D & Xue, G 2012, Resource allocation in load-constrained multihop wireless networks. in Proceedings - IEEE INFOCOM., 6195705, pp. 280-288, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195705
Fang, Xi ; Yang, Dejun ; Xue, Guoliang. / Resource allocation in load-constrained multihop wireless networks. Proceedings - IEEE INFOCOM. 2012. pp. 280-288
@inproceedings{175a2b1b285b42339969e66c97ed5f3e,
title = "Resource allocation in load-constrained multihop wireless networks",
abstract = "In this paper, we study the influence of network entity load constraints on network resource allocation. We focus on the problem of allocating network resources to optimize the total utility of multiple users in a wireless network, taking into account four resource and social requirements: 1) user QoS rate constraints, 2) node max load constraints, 3) node load balance constraints, and 4) node-user load constraints. We formulate this problem as a programming system. In order to solve this programming system, we first propose an optimization framework, called α-approximation dual subgradient algorithm, which may be applicable for many networking optimization problems. Given an approximation/optimal algorithm for solving the subproblem at each iteration, the framework leads to a result that can provide the following bounds at each iteration: 1) the bounds on the Lagrangian multipliers; 2) the bound on the amount of feasibility violation of the generated primal solutions; and 3) the upper and lower bounds on the gap between the optimal solution and the generated primal solutions. Based on this framework, we then present a distributed iterative algorithm to solve the network resource allocation problem. At each iteration, we provide bounds on the amount of feasibility violation, the gap between our solution and the optimal solution, node queue lengths, user utility deficits, and node load violation ratios.",
author = "Xi Fang and Dejun Yang and Guoliang Xue",
year = "2012",
doi = "10.1109/INFCOM.2012.6195705",
language = "English (US)",
isbn = "9781467307758",
pages = "280--288",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Resource allocation in load-constrained multihop wireless networks

AU - Fang, Xi

AU - Yang, Dejun

AU - Xue, Guoliang

PY - 2012

Y1 - 2012

N2 - In this paper, we study the influence of network entity load constraints on network resource allocation. We focus on the problem of allocating network resources to optimize the total utility of multiple users in a wireless network, taking into account four resource and social requirements: 1) user QoS rate constraints, 2) node max load constraints, 3) node load balance constraints, and 4) node-user load constraints. We formulate this problem as a programming system. In order to solve this programming system, we first propose an optimization framework, called α-approximation dual subgradient algorithm, which may be applicable for many networking optimization problems. Given an approximation/optimal algorithm for solving the subproblem at each iteration, the framework leads to a result that can provide the following bounds at each iteration: 1) the bounds on the Lagrangian multipliers; 2) the bound on the amount of feasibility violation of the generated primal solutions; and 3) the upper and lower bounds on the gap between the optimal solution and the generated primal solutions. Based on this framework, we then present a distributed iterative algorithm to solve the network resource allocation problem. At each iteration, we provide bounds on the amount of feasibility violation, the gap between our solution and the optimal solution, node queue lengths, user utility deficits, and node load violation ratios.

AB - In this paper, we study the influence of network entity load constraints on network resource allocation. We focus on the problem of allocating network resources to optimize the total utility of multiple users in a wireless network, taking into account four resource and social requirements: 1) user QoS rate constraints, 2) node max load constraints, 3) node load balance constraints, and 4) node-user load constraints. We formulate this problem as a programming system. In order to solve this programming system, we first propose an optimization framework, called α-approximation dual subgradient algorithm, which may be applicable for many networking optimization problems. Given an approximation/optimal algorithm for solving the subproblem at each iteration, the framework leads to a result that can provide the following bounds at each iteration: 1) the bounds on the Lagrangian multipliers; 2) the bound on the amount of feasibility violation of the generated primal solutions; and 3) the upper and lower bounds on the gap between the optimal solution and the generated primal solutions. Based on this framework, we then present a distributed iterative algorithm to solve the network resource allocation problem. At each iteration, we provide bounds on the amount of feasibility violation, the gap between our solution and the optimal solution, node queue lengths, user utility deficits, and node load violation ratios.

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

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

U2 - 10.1109/INFCOM.2012.6195705

DO - 10.1109/INFCOM.2012.6195705

M3 - Conference contribution

AN - SCOPUS:84861606051

SN - 9781467307758

SP - 280

EP - 288

BT - Proceedings - IEEE INFOCOM

ER -