Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network
Grzegorz Zalewski , Włodzimierz Ogryczak
AbstractDimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given tra�c demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for di�erent 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.
|Journal series||Journal of Telecommunications and Information Technology, ISSN 1509-4553, e-ISSN 1899-8852|
|Publication size in sheets||0.5|
|Keywords in English||allocation problem, decision problems, fair-optimization, linear programming, multi-criteria, networks, ordered weighted averaging, OWA, reference point method, RPM|
|project||Development of methodology of control, decision support and production management. Project leader: Zieliński Cezary,
, Phone: 5102, start date 19-05-2015, end date 31-12-2016, 504/02233/1031, Completed
|Score|| = 12.0, 27-03-2017, ArticleFromJournal|
= 12.0, 27-03-2017, ArticleFromJournal
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.