<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912"><efrbr-work:titleOfTheWork>Decomposition methods for network utility maximization</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912"><efrbr-expression:titleOfTheExpression>Decomposition methods for network utility maximization</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Διπλωματική Εργασία
            Diploma Work
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-03-23</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2015</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>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.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="academic unit">Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρονικών Μηχανικών και Μηχανικών Υπολογιστών</efrbr-expression:note></efrbr-expression:expression><efrbr-manifestation:manifestation identifier="http://purl.tuc.gr/dl/dias/EA9380D3-A8D3-4939-890E-A95A52601807"><efrbr-manifestation:titleOfTheManifestation>Kostoulas_Georgios_Dip_2015.pdf</efrbr-manifestation:titleOfTheManifestation><efrbr-manifestation:publicationDistribution><efrbr-manifestation:placeOfPublicationDistribution type="distribution">Chania [Greece]</efrbr-manifestation:placeOfPublicationDistribution><efrbr-manifestation:publisherDistributor type="distributor">Library of TUC</efrbr-manifestation:publisherDistributor><efrbr-manifestation:dateOfPublicationDistribution>2015-03-23</efrbr-manifestation:dateOfPublicationDistribution></efrbr-manifestation:publicationDistribution><efrbr-manifestation:formOfCarrier>application/pdf</efrbr-manifestation:formOfCarrier><efrbr-manifestation:extentOfTheCarrier>1.1 MB</efrbr-manifestation:extentOfTheCarrier><efrbr-manifestation:accessRestrictionsOnTheManifestation>free</efrbr-manifestation:accessRestrictionsOnTheManifestation></efrbr-manifestation:manifestation><efrbr-person:person identifier="http://users.isc.tuc.gr/~gkostoulas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Kostoulas Georgios
            Κωστουλας Γεωργιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~aliavas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Liavas Athanasios
            Λιαβας Αθανασιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mpaterakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Paterakis Michalis
            Πατερακης Μιχαλης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~pkoutsakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Koutsakis Polychronis
            Κουτσακης Πολυχρονης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="0EDDE8E1-50DD-44B9-A4FC-D9B545547C67"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="">
            Πολυτεχνείο Κρήτης
            Technical University of Crete
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh85091074"><efrbr-concept:termForTheConcept>
            Project networks
            network analysis planning
            project networks
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh85082127"><efrbr-concept:termForTheConcept>
            Optimization (Mathematics)
            Optimization techniques
            Optimization theory
            Systems optimization
            mathematical optimization
            optimization mathematics
            optimization techniques
            optimization theory
            systems optimization
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912"/><efrbr-structure:embodiedIn sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="manifestation" targetURI="http://purl.tuc.gr/dl/dias/EA9380D3-A8D3-4939-890E-A95A52601807"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="http://users.isc.tuc.gr/~gkostoulas"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="http://users.isc.tuc.gr/~gkostoulas" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="http://users.isc.tuc.gr/~aliavas" role="http://purl.tuc.gr/dl/dias/vocabs/contributor-roles/1"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mpaterakis" role="http://purl.tuc.gr/dl/dias/vocabs/contributor-roles/2"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="http://users.isc.tuc.gr/~pkoutsakis" role="http://purl.tuc.gr/dl/dias/vocabs/contributor-roles/2"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="person" targetURI="0EDDE8E1-50DD-44B9-A4FC-D9B545547C67" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="concept" targetURI="http://id.loc.gov/authorities/subjects/sh85091074"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/ED0AD883-02EC-4DA7-B5FD-F0E167314912" targetEntity="concept" targetURI="http://id.loc.gov/authorities/subjects/sh85082127"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>