Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network

Authors

  • Grzegorz Zalewski
  • Włodzimierz Ogryczak

DOI:

https://doi.org/10.26636/jtit.2016.3.732

Keywords:

allocation problem, decision problems, fair-optimization, linear programming, multi-criteria, networks, ordered weighted averaging, OWA, reference point method, RPM

Abstract

Dimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given trac demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for dierent demands. Problem the decision-making basic algorithms to maximize the total revenue may lead to the solutions that are unacceptable, due to "starvation" or "locking" of some demand paths less attractive with respect to the total revenue. Therefore, the fair optimization approaches must be applied. In this paper, two fair optimization methods are analyzed: the method of ordered weighted average (OWA) and the reference point method (RPM). The study assumes that ows can be bifurcated thus realized in multiple path schemes. To implement optimization model the AMPL was used with general-purpose linear programming solvers. As an example of the data, the Polish backbone network was used.

Downloads

Download data is not yet available.

Downloads

Published

2016-09-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
G. Zalewski and W. Ogryczak, “Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network”, JTIT, vol. 65, no. 3, pp. 18–24, Sep. 2016, doi: 10.26636/jtit.2016.3.732.

Most read articles by the same author(s)

<< < 1 2