Advanced

Optimal link capacity dimensioning in proportionally fair networks

Pioro, Michal LU ; Malicsko, Gabor and Fodor, Gabor (2002) Second International IFIP-TC6 Networking Conference , May 19–24, 2002 In NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications 2345. p.277-288
Abstract
We consider the problem of link capacity dimensioning and bandwidth allocation in networks that support elastic flows and maintain proportional fairness among these flows. We assume that a certain allocated bandwidth to a user demand generates revenue for the network operator. On the other hand, the operator incurs a capacity dependent cost for each link in the network. The operator's profit is the difference between the revenue and the total link cost. Under this assumption, the problem is to determine the bandwidth of the flows and the link capacities such that the profit is maximized. We first show that under fairly general assumptions, the optimum allocation of flows leads to selecting the lowest cost paths between... (More)
We consider the problem of link capacity dimensioning and bandwidth allocation in networks that support elastic flows and maintain proportional fairness among these flows. We assume that a certain allocated bandwidth to a user demand generates revenue for the network operator. On the other hand, the operator incurs a capacity dependent cost for each link in the network. The operator's profit is the difference between the revenue and the total link cost. Under this assumption, the problem is to determine the bandwidth of the flows and the link capacities such that the profit is maximized. We first show that under fairly general assumptions, the optimum allocation of flows leads to selecting the lowest cost paths between originator-destination pairs. We also derive explicit formulae for the bandwidth allocated to these flows. We distinguish the case when the operator's capacity budget is fixed ("equality budget constraint", in which case the profit is maximized when the revenue is maximized) and the case when the budget is upper-bounded ("inequality budget constraint", in which case the profit can - in general - be maximized by using some portion of the capacity budget). Finally, we show numerical examples to highlight some of the trade-offs between profit maximization, revenue maximization and fairness. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
packet networks, proportional fairness, elastic traffic, Internet, convex optimization, network design
in
NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications
volume
2345
pages
277 - 288
publisher
Springer
conference name
Second International IFIP-TC6 Networking Conference , May 19–24, 2002
external identifiers
  • Scopus:84948182748
ISSN
0302-9743
ISBN
3-540-43709-6
DOI
10.1007/3-540-47906-6_22
language
English
LU publication?
yes
id
b6c1de8d-61e9-4a8b-90be-3fd70cc4e113 (old id 1002804)
date added to LUP
2008-02-22 10:49:26
date last changed
2016-10-13 05:09:54
@misc{b6c1de8d-61e9-4a8b-90be-3fd70cc4e113,
  abstract     = {We consider the problem of link capacity dimensioning and bandwidth allocation in networks that support elastic flows and maintain proportional fairness among these flows. We assume that a certain allocated bandwidth to a user demand generates revenue for the network operator. On the other hand, the operator incurs a capacity dependent cost for each link in the network. The operator's profit is the difference between the revenue and the total link cost. Under this assumption, the problem is to determine the bandwidth of the flows and the link capacities such that the profit is maximized. We first show that under fairly general assumptions, the optimum allocation of flows leads to selecting the lowest cost paths between originator-destination pairs. We also derive explicit formulae for the bandwidth allocated to these flows. We distinguish the case when the operator's capacity budget is fixed ("equality budget constraint", in which case the profit is maximized when the revenue is maximized) and the case when the budget is upper-bounded ("inequality budget constraint", in which case the profit can - in general - be maximized by using some portion of the capacity budget). Finally, we show numerical examples to highlight some of the trade-offs between profit maximization, revenue maximization and fairness.},
  author       = {Pioro, Michal and Malicsko, Gabor and Fodor, Gabor},
  isbn         = {3-540-43709-6},
  issn         = {0302-9743},
  keyword      = {packet networks,proportional fairness,elastic traffic,Internet,convex optimization,network design},
  language     = {eng},
  pages        = {277--288},
  publisher    = {ARRAY(0x995e330)},
  series       = {NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications},
  title        = {Optimal link capacity dimensioning in proportionally fair networks},
  url          = {http://dx.doi.org/10.1007/3-540-47906-6_22},
  volume       = {2345},
  year         = {2002},
}