Network Decomposition in Practice: An Application to Optimal Resource Allocation
In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tande...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 6 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Kallitsis, M. G. Michailidis, G. Devetsikiotis, M. |
| description | In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates resources to network services with specific quality-of-service requirements. Finally, we evaluate our framework and compare its performance against a system utilizing deterministic bounds obtained from network calculus. |
| doi_str_mv | 10.1109/GLOCOM.2011.6133664 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6133664</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6133664</ieee_id><sourcerecordid>6133664</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-b0b678da081d4ab58650b3e51bfb062a16c6011e56c4fa57aec1b755c58569723</originalsourceid><addsrcrecordid>eNpVkM1KAzEUheMfWGufoJu8wNTcTO5Nxt1QtQrVKaLQXUnSFKLTZpgZEd_eYrtxdRYfHL5zGBuDmACI4mY2r6bV80QKgAlBnhOpEzYqtAEllSokGXPKBhI1ZZrU8uwfI3XOBlDkIkNZLC_ZVdd9CIHKIAzY4iX036n95HfBp22TutjHtONxxxet9X304ZaXO142TR29_WN94lXTx62t-Wvo0lfrAy_rOh3wNbvY2LoLo2MO2fvD_dv0MZtXs6dpOc8iaOwzJxxps7bCwFpZh4ZQuDwguI0TJC2Qp_3agOTVxqK2wYPTiB4NUqFlPmTjQ28MIayadu_T_qyO5-S_7KNUmg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Network Decomposition in Practice: An Application to Optimal Resource Allocation</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kallitsis, M. G. ; Michailidis, G. ; Devetsikiotis, M.</creator><creatorcontrib>Kallitsis, M. G. ; Michailidis, G. ; Devetsikiotis, M.</creatorcontrib><description>In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates resources to network services with specific quality-of-service requirements. Finally, we evaluate our framework and compare its performance against a system utilizing deterministic bounds obtained from network calculus.</description><identifier>ISSN: 1930-529X</identifier><identifier>ISBN: 9781424492664</identifier><identifier>ISBN: 1424492661</identifier><identifier>EISSN: 2576-764X</identifier><identifier>EISBN: 9781424492688</identifier><identifier>EISBN: 9781424492671</identifier><identifier>EISBN: 1424492688</identifier><identifier>EISBN: 142449267X</identifier><identifier>DOI: 10.1109/GLOCOM.2011.6133664</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Calculus ; Measurement ; Optimization ; Peer to peer computing ; Quality of service ; Resource management</subject><ispartof>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011, p.1-6</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6133664$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6133664$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kallitsis, M. G.</creatorcontrib><creatorcontrib>Michailidis, G.</creatorcontrib><creatorcontrib>Devetsikiotis, M.</creatorcontrib><title>Network Decomposition in Practice: An Application to Optimal Resource Allocation</title><title>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</title><addtitle>GLOCOM</addtitle><description>In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates resources to network services with specific quality-of-service requirements. Finally, we evaluate our framework and compare its performance against a system utilizing deterministic bounds obtained from network calculus.</description><subject>Bandwidth</subject><subject>Calculus</subject><subject>Measurement</subject><subject>Optimization</subject><subject>Peer to peer computing</subject><subject>Quality of service</subject><subject>Resource management</subject><issn>1930-529X</issn><issn>2576-764X</issn><isbn>9781424492664</isbn><isbn>1424492661</isbn><isbn>9781424492688</isbn><isbn>9781424492671</isbn><isbn>1424492688</isbn><isbn>142449267X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkM1KAzEUheMfWGufoJu8wNTcTO5Nxt1QtQrVKaLQXUnSFKLTZpgZEd_eYrtxdRYfHL5zGBuDmACI4mY2r6bV80QKgAlBnhOpEzYqtAEllSokGXPKBhI1ZZrU8uwfI3XOBlDkIkNZLC_ZVdd9CIHKIAzY4iX036n95HfBp22TutjHtONxxxet9X304ZaXO142TR29_WN94lXTx62t-Wvo0lfrAy_rOh3wNbvY2LoLo2MO2fvD_dv0MZtXs6dpOc8iaOwzJxxps7bCwFpZh4ZQuDwguI0TJC2Qp_3agOTVxqK2wYPTiB4NUqFlPmTjQ28MIayadu_T_qyO5-S_7KNUmg</recordid><startdate>201112</startdate><enddate>201112</enddate><creator>Kallitsis, M. G.</creator><creator>Michailidis, G.</creator><creator>Devetsikiotis, M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201112</creationdate><title>Network Decomposition in Practice: An Application to Optimal Resource Allocation</title><author>Kallitsis, M. G. ; Michailidis, G. ; Devetsikiotis, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-b0b678da081d4ab58650b3e51bfb062a16c6011e56c4fa57aec1b755c58569723</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Bandwidth</topic><topic>Calculus</topic><topic>Measurement</topic><topic>Optimization</topic><topic>Peer to peer computing</topic><topic>Quality of service</topic><topic>Resource management</topic><toplevel>online_resources</toplevel><creatorcontrib>Kallitsis, M. G.</creatorcontrib><creatorcontrib>Michailidis, G.</creatorcontrib><creatorcontrib>Devetsikiotis, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kallitsis, M. G.</au><au>Michailidis, G.</au><au>Devetsikiotis, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Network Decomposition in Practice: An Application to Optimal Resource Allocation</atitle><btitle>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</btitle><stitle>GLOCOM</stitle><date>2011-12</date><risdate>2011</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><issn>1930-529X</issn><eissn>2576-764X</eissn><isbn>9781424492664</isbn><isbn>1424492661</isbn><eisbn>9781424492688</eisbn><eisbn>9781424492671</eisbn><eisbn>1424492688</eisbn><eisbn>142449267X</eisbn><abstract>In this paper, we propose the use of network decomposition under an optimal resource allocation framework. We develop a methodology where recursive formulas can be utilized for calculating the desired end-to-end performance bounds (i.e., backlog bound violation probability) of flows traversing tandem, acyclic queueing networks. We use those performance metrics in an optimization framework that allocates resources to network services with specific quality-of-service requirements. Finally, we evaluate our framework and compare its performance against a system utilizing deterministic bounds obtained from network calculus.</abstract><pub>IEEE</pub><doi>10.1109/GLOCOM.2011.6133664</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1930-529X |
| ispartof | 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011, p.1-6 |
| issn | 1930-529X 2576-764X |
| language | eng |
| recordid | cdi_ieee_primary_6133664 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bandwidth Calculus Measurement Optimization Peer to peer computing Quality of service Resource management |
| title | Network Decomposition in Practice: An Application to Optimal Resource Allocation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T00%3A40%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Network%20Decomposition%20in%20Practice:%20An%20Application%20to%20Optimal%20Resource%20Allocation&rft.btitle=2011%20IEEE%20Global%20Telecommunications%20Conference%20-%20GLOBECOM%202011&rft.au=Kallitsis,%20M.%20G.&rft.date=2011-12&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.issn=1930-529X&rft.eissn=2576-764X&rft.isbn=9781424492664&rft.isbn_list=1424492661&rft_id=info:doi/10.1109/GLOCOM.2011.6133664&rft_dat=%3Cieee_6IE%3E6133664%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424492688&rft.eisbn_list=9781424492671&rft.eisbn_list=1424492688&rft.eisbn_list=142449267X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6133664&rfr_iscdi=true |