Optimal link capacity dimensioning in proportionally fair networks
(2002) Second International IFIPTC6 Networking Conference , May 19–24, 2002 In Lecture Notes in Computer Science 2345. p.277288 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 originatordestination 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 upperbounded ("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 tradeoffs between profit maximization, revenue maximization and fairness. (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/1002804
 author
 Pioro, Michal ^{LU} ; Malicsko, Gabor and Fodor, Gabor
 organization
 publishing date
 2002
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 packet networks, proportional fairness, elastic traffic, Internet, convex optimization, network design
 in
 Lecture Notes in Computer Science
 volume
 2345
 pages
 277  288
 publisher
 Springer
 conference name
 Second International IFIPTC6 Networking Conference , May 19–24, 2002
 external identifiers

 scopus:84948182748
 ISSN
 03029743
 ISBN
 3540437096
 DOI
 10.1007/3540479066_22
 language
 English
 LU publication?
 yes
 id
 b6c1de8d61e94a8b90be3fd70cc4e113 (old id 1002804)
 date added to LUP
 20080222 10:49:26
 date last changed
 20180107 11:17:03
@inproceedings{b6c1de8d61e94a8b90be3fd70cc4e113, 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 originatordestination 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 upperbounded ("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 tradeoffs between profit maximization, revenue maximization and fairness.}, author = {Pioro, Michal and Malicsko, Gabor and Fodor, Gabor}, booktitle = {Lecture Notes in Computer Science}, isbn = {3540437096}, issn = {03029743}, keyword = {packet networks,proportional fairness,elastic traffic,Internet,convex optimization,network design}, language = {eng}, pages = {277288}, publisher = {Springer}, title = {Optimal link capacity dimensioning in proportionally fair networks}, url = {http://dx.doi.org/10.1007/3540479066_22}, volume = {2345}, year = {2002}, }