![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912 | - |
| Identifier | https://doi.org/10.26233/heallink.tuc.24471 | - |
| Language | en | - |
| Extent | 73 pages | en |
| Title | Decomposition methods for network utility maximization | en |
| Creator | Kostoulas Georgios | en |
| Creator | Κωστουλας Γεωργιος | el |
| Contributor [Thesis Supervisor] | Liavas Athanasios | en |
| Contributor [Thesis Supervisor] | Λιαβας Αθανασιος | el |
| Contributor [Committee Member] | Paterakis Michalis | en |
| Contributor [Committee Member] | Πατερακης Μιχαλης | el |
| Contributor [Committee Member] | Koutsakis Polychronis | en |
| Contributor [Committee Member] | Κουτσακης Πολυχρονης | el |
| Publisher | Πολυτεχνείο Κρήτης | el |
| Publisher | Technical University of Crete | en |
| Academic Unit | Technical University of Crete::School of Electronic and Computer Engineering | en |
| Academic Unit | Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρονικών Μηχανικών και Μηχανικών Υπολογιστών | el |
| Content Summary | Network Utility Maximization (NUM) is the problem of allocating the right amount of resources to the nodes of a network, in order to maximize an overall utility function. There are many optimization tools to solve this problem in a centralized manner. In this thesis, we discuss distributed ways to solve various formulations of NUM problems. We decompose the problems into subproblems using Primal Decomposition, by applying direct resource allocation and then adjust the resources by small steps until equilibrium, and Dual Decomposition by pricing the resource in such manner that each node achieves the optimal utility. Many alternatives can be derived from these two methods, in different NUM formulations, with the use of multilevel decompositions. These decompositions may lead to better understanding of existing networks, reverse engineering of network protocols like TCP, better management of existing networks, and ways to design and operate new networks by layering as optimization. Finally, we experiment with the message passing of these algorithms and try to minimize the data transferred by quantizing the values. | en |
| Type of Item | Διπλωματική Εργασία | el |
| Type of Item | Diploma Work | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-03-23 | - |
| Date of Publication | 2015 | - |
| Subject | Project networks | en |
| Subject | network analysis planning | en |
| Subject | project networks | en |
| Subject | Optimization (Mathematics) | en |
| Subject | Optimization techniques | en |
| Subject | Optimization theory | en |
| Subject | Systems optimization | en |
| Subject | mathematical optimization | en |
| Subject | optimization mathematics | en |
| Subject | optimization techniques | en |
| Subject | optimization theory | en |
| Subject | systems optimization | en |
| Bibliographic Citation | Georgios Kostoulas, "Decomposition methods for network utility maximization", Diploma Work, School of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece, 2015 | en |
| Bibliographic Citation | Γεώργιος Κωστούλας, "Decomposition methods for network utility maximization", Διπλωματική Εργασία, Σχολή Ηλεκτρονικών Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2015 | el |
Copyright © DIAS 2013
