The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Robust dimensioning of proportionally fair networks

På svenska

Author

  • Michal Pioro
  • Eligijus Kubilinskas
  • Pål Nilsson

Summary, in English

The notion of proportional fairness has recently gained considerable interest as a potential means for a fair allocation of bandwidth between the end nodes of demands in the networks carrying elastic traffic. The issue of proportionally fair allocation of bandwidth for the nominal state of the network has been studied before, both in the capacitated (link capacities given) and the uncapacitated (link capacities are also subject to optimisation) cases. In the presented paper, we address a more complicated uncapacitated problem - optimisation of link capacities for a proportionally fair network robust to failures. We formulate a relevant optimisation problem and propose efficient solution algorithms. Efficiency of the algorithms is illustrated with numerical examples including large networks. The design approach is applicable to IP/MPLS networks based on leased transmission capacity.

Publishing year

2005

Language

English

Pages

241-251

Publication/Series

European Transactions on Telecommunications

Volume

16

Issue

3

Document type

Journal article

Publisher

John Wiley & Sons Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Communication Systems

Status

Published

ISBN/ISSN/Other

  • ISSN: 1541-8251