Narzędzia help

Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
first last
cannonical link button


International Journal of Electronics and Telecommunications

Tytuł artykułu

Overlay Multicast Optimization : IBM ILOG CPLEX

Autorzy Kucharzak, M.  Zydek, D.  Poźniak-Koszałka, I. 
Treść / Zawartość
Warianty tytułu
Języki publikacji EN
EN IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixed integer. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
Słowa kluczowe
EN overlay multicast   maximum flows   linear programming   mixed-integer programming  
Wydawca Polish Academy of Sciences, Committee of Electronics and Telecommunication
Czasopismo International Journal of Electronics and Telecommunications
Rocznik 2012
Tom Vol. 58, No. 4
Strony 381--388
Opis fizyczny Bibliogr. 26 poz., tab., wykr.
autor Kucharzak, M.
autor Zydek, D.
autor Poźniak-Koszałka, I.
[1] GNU Linear Programming Kit, GNU Project, 2008,
[2] Gurobi Optimizer Reference Manual, Gurobi Optimization Inc., 2012,
[3] QSopt Version 1.0, QSopt, 2003,
[4] XPRESS Solver, FICO (Fair Isaac Corporation),
[5] XA Linear Optimizer System, Sunset Software Technology, Inc., 2012,
[6] Linear Program Solver LiPS, MIT, 2011,
[7] Ipsolve, LP SOLVE,
[8] S. E. Deering and D. R. Cheriton, „Multicast routing in datagram internetworks and extended LANs”, ACM Transactions on Computer Systems, vol. 8, pp. 85-110, 1990.
[9] B. Akbari, H. R. Rabiee, and M. Ghanbari, „An optimal discrete rate allocation for overlay video multicasting”, Computer Communications, vol. 31, no. 3, pp. 551-562, 2008, DOI: 10.1016/j.comcom.2007.08.025.
[10] Y. Chu, S. G. Rao, and H. Zhang, „A case for end system multicast”, in Proceedings of ACM Sigmetrics, 2000, pp. 1-12.
[11] Y. Cui, Y. Xue, and K. Nahrstedt, „Optimal resource allocation in overlay multicast”, in Proc. of 11th International Conference on Network Protocols, ICNP, 2003.
[12] M. Kucharzak and K. Walkowiak, „A mixed integer formulation for multicast flow assignment in multilayer networks”, in Proc. Fifth Int. Broadband and Biomedical Communications (IB2Com) Conf., 2010, pp. 1-4.
[13] M. Kucharzak and K. Walkowiak, „Maximum flow trees in overlay multicast: Modeling and optimization”, in Proc. 2nd Baltic Congress Future Internet Communications (BCFIC), 2012, pp. 260-267.
[14] M. Kucharzak and K. Walkowiak, „Modelling of Minimum Cost Overlay Multicast Tree in Two Layer Networks”, International Journal of Electronics and Telecommunications, vol. 57, no. 3, pp. 317-322, 2011.
[15] A. Sentinelli, G. Marfia, M. Gerla, L. Kleinrock, and S. Tewari, „Will iptv ride the peer-to-peer stream peer-to-peer multimedia streaming”, Communications Magazine, IEEE, vol. 45, no. 6, pp. 86-92, 2007.
[16] C. Wu and B. Li, „Optimal rate allocation in overlay content distribution”, in Networking, 2007, pp. 678-690.
[17] C. Wu and B. Li, „On meeting p2p streaming bandwidth demand with limited supplies”, in Proc. of the Fifteenth Annual SPIE/ACM International Conference on Multimedia Computing and Networking, 2008.
[18] G. Wu and T. Chiueh, „Peer to peer file download and streaming. rpe report, tr-185”, 2005.
[19] Y. Zhu and B. Li, „Overlay networks with linear capacity constraints”, IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 2, pp. 159-173, 2008.
[20] IBM, „Quick start to IBM ILOG optimization products”, Online, available at
[21] K. Jain, M. Mahdian, and M. R. Salavatipour, „Packing steiner trees”, in SODA'03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2003, pp. 266-274.
[22] M. Kucharzak and K. Walkowiak, „Fractional spanning tree packing problem with survivability constraints for throughput maximization in overlay multicast networks”, in Proc. 3rd Int. Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) Congress, 2011, pp. 1-7.
[23] M. Kucharzak and K. Walkowiak „An improved annealing algorithm for throughput maximization in static overlay-based multicast systems” in HAIS (1), ser. Lecture Notes in Computer Science, E. Corchado, M. Kurzynski, and M. Wozniak, Eds., vol. 6678. Springer, 2011, pp. 364-371, DOI: 10.1007/978-3-642-21219-2 46.
[24] M. Kucharzak and K. Walkowiak, „On modelling of fair throughput allocation in overlay multicast networks”, in NEW2AN, ser. Lecture Notes in Computer Science, S. Balandin, Y. Koucheryavy, and H. Hu, Eds., vol. 6869. Springer, 2011, pp. 529-540, DOI: 10.1007/978-3-642-22875-9 48.
[25] Ookla. (2012, October) Net index. [Online]. Available:
[26] IBM ILOG CPLEX 12.1, User's Manual for CPLEX, 2009.
Kolekcja BazTech
Identyfikator YADDA bwmeta1.element.baztech-article-BWAD-0032-0012