Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
A decentralized control strategy for joint resource allocation and routing in node-based wireless data networks. / Baromand, S.; Nekouie, M. A.; Navaie, Keivan.
Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2012 4th International Congress on. New York : IEEE, 2012. p. 71-75.Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - A decentralized control strategy for joint resource allocation and routing in node-based wireless data networks
AU - Baromand, S.
AU - Nekouie, M. A.
AU - Navaie, Keivan
PY - 2012
Y1 - 2012
N2 - The optimal performance of the network can be achieved by simultaneous optimization of routing and resource allocation. We use a delayed dynamic model of queue length in each node to describe the data flows in the network. Unlike similar previous works in the literature we assume that delay exists in the queuing model and so we will have dynamic flow model for the routing of data packets across the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. With these assumptions we formulate the simultaneous routing and resource allocation (SRRA) problem as a convex optimization problem over the network flow variables and the communications variables. By our control strategy, an optimal routing performance in the presence of unknown network delays in network modeling and resource limitations is achieved.
AB - The optimal performance of the network can be achieved by simultaneous optimization of routing and resource allocation. We use a delayed dynamic model of queue length in each node to describe the data flows in the network. Unlike similar previous works in the literature we assume that delay exists in the queuing model and so we will have dynamic flow model for the routing of data packets across the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. With these assumptions we formulate the simultaneous routing and resource allocation (SRRA) problem as a convex optimization problem over the network flow variables and the communications variables. By our control strategy, an optimal routing performance in the presence of unknown network delays in network modeling and resource limitations is achieved.
KW - Terms node-based wireless data networks
KW - optimization method
KW - routing
KW - resource allocation
KW - H-INFINITY CONTROL
KW - TRAFFIC NETWORKS
KW - CONTROL-SYSTEMS
KW - DESIGN
KW - ALGORITHM
KW - DELAY
U2 - 10.1109/ICUMT.2012.6459759
DO - 10.1109/ICUMT.2012.6459759
M3 - Conference contribution/Paper
SN - 9781467320160
SP - 71
EP - 75
BT - Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2012 4th International Congress on
PB - IEEE
CY - New York
T2 - 4th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)
Y2 - 3 October 2012 through 5 October 2012
ER -