Discovering Bounds of Performance of Self-Organizing Content Delivery Systems

Discovering Bounds of Performance of Self-Organizing Content Delivery Systems

Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Szkaliczki, T., Sobe, A., Boszormenyi, L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Dynamic Networks
Evaluation
Global Optimization
Integer Linear Programming
Self-organization
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 104
container_issue
container_start_page 97
container_title
container_volume
creator Szkaliczki, T.
Sobe, A.
Boszormenyi, L.
description Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however, it is important to compute the global optimum to serve as a theoretical bound. In this paper we define a formal model describing the problem of content placement and use an integer linear programming (ILP) based optimization method. With this method we discover the Quality of Service (QoS) bounds of a self-organizing content delivery system. We further demonstrate how to balance between run-time complexity and accuracy of the model by applying a use case.
doi_str_mv 10.1109/SASOW.2012.26
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6498387</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6498387</ieee_id><sourcerecordid>6498387</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-60c1d00bf7b8e9cd3df35e8d2f3b3bc0ab0717d7628934f7bf9f0d06098795a13</originalsourceid><addsrcrecordid>eNotjM1KxDAYRSMiqGOXrtz0BVq_NM3fcuw4KoxUqOJyaJsvQ6Q_klShPr0ddHU5l3MvIdcUUkpB31brqnxPM6BZmokTEmmpQArNc6U5PSWXNBeSccqZPidRCB8AQGEpAC7I88aFdvxG74ZDfDd-DSbEo41f0NvR9_XQ4hEr7GxS-kM9uJ-jWIzDhMMUb7Bzy3aOqzlM2IcrcmbrLmD0nyvytr1_LR6TXfnwVKx3iaOST4mAlhqAxspGoW4NM5ZxVCazrGFNC3UDkkojRaY0yxfLagsGBGglNa8pW5Gbv1-HiPtP7_raz3uRa8WUZL_D2E7c</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Discovering Bounds of Performance of Self-Organizing Content Delivery Systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Szkaliczki, T. ; Sobe, A. ; Boszormenyi, L.</creator><creatorcontrib>Szkaliczki, T. ; Sobe, A. ; Boszormenyi, L.</creatorcontrib><description>Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however, it is important to compute the global optimum to serve as a theoretical bound. In this paper we define a formal model describing the problem of content placement and use an integer linear programming (ILP) based optimization method. With this method we discover the Quality of Service (QoS) bounds of a self-organizing content delivery system. We further demonstrate how to balance between run-time complexity and accuracy of the model by applying a use case.</description><identifier>ISBN: 1467351539</identifier><identifier>ISBN: 9781467351539</identifier><identifier>EISBN: 9780769548951</identifier><identifier>EISBN: 0769548954</identifier><identifier>DOI: 10.1109/SASOW.2012.26</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Dynamic Networks ; Evaluation ; Global Optimization ; Integer Linear Programming ; Self-organization</subject><ispartof>2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops, 2012, p.97-104</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/6498387$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6498387$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Szkaliczki, T.</creatorcontrib><creatorcontrib>Sobe, A.</creatorcontrib><creatorcontrib>Boszormenyi, L.</creatorcontrib><title>Discovering Bounds of Performance of Self-Organizing Content Delivery Systems</title><title>2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops</title><addtitle>sasow</addtitle><description>Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however, it is important to compute the global optimum to serve as a theoretical bound. In this paper we define a formal model describing the problem of content placement and use an integer linear programming (ILP) based optimization method. With this method we discover the Quality of Service (QoS) bounds of a self-organizing content delivery system. We further demonstrate how to balance between run-time complexity and accuracy of the model by applying a use case.</description><subject>Dynamic Networks</subject><subject>Evaluation</subject><subject>Global Optimization</subject><subject>Integer Linear Programming</subject><subject>Self-organization</subject><isbn>1467351539</isbn><isbn>9781467351539</isbn><isbn>9780769548951</isbn><isbn>0769548954</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjM1KxDAYRSMiqGOXrtz0BVq_NM3fcuw4KoxUqOJyaJsvQ6Q_klShPr0ddHU5l3MvIdcUUkpB31brqnxPM6BZmokTEmmpQArNc6U5PSWXNBeSccqZPidRCB8AQGEpAC7I88aFdvxG74ZDfDd-DSbEo41f0NvR9_XQ4hEr7GxS-kM9uJ-jWIzDhMMUb7Bzy3aOqzlM2IcrcmbrLmD0nyvytr1_LR6TXfnwVKx3iaOST4mAlhqAxspGoW4NM5ZxVCazrGFNC3UDkkojRaY0yxfLagsGBGglNa8pW5Gbv1-HiPtP7_raz3uRa8WUZL_D2E7c</recordid><startdate>201209</startdate><enddate>201209</enddate><creator>Szkaliczki, T.</creator><creator>Sobe, A.</creator><creator>Boszormenyi, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201209</creationdate><title>Discovering Bounds of Performance of Self-Organizing Content Delivery Systems</title><author>Szkaliczki, T. ; Sobe, A. ; Boszormenyi, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-60c1d00bf7b8e9cd3df35e8d2f3b3bc0ab0717d7628934f7bf9f0d06098795a13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Dynamic Networks</topic><topic>Evaluation</topic><topic>Global Optimization</topic><topic>Integer Linear Programming</topic><topic>Self-organization</topic><toplevel>online_resources</toplevel><creatorcontrib>Szkaliczki, T.</creatorcontrib><creatorcontrib>Sobe, A.</creatorcontrib><creatorcontrib>Boszormenyi, L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Szkaliczki, T.</au><au>Sobe, A.</au><au>Boszormenyi, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Discovering Bounds of Performance of Self-Organizing Content Delivery Systems</atitle><btitle>2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops</btitle><stitle>sasow</stitle><date>2012-09</date><risdate>2012</risdate><spage>97</spage><epage>104</epage><pages>97-104</pages><isbn>1467351539</isbn><isbn>9781467351539</isbn><eisbn>9780769548951</eisbn><eisbn>0769548954</eisbn><coden>IEEPAD</coden><abstract>Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however, it is important to compute the global optimum to serve as a theoretical bound. In this paper we define a formal model describing the problem of content placement and use an integer linear programming (ILP) based optimization method. With this method we discover the Quality of Service (QoS) bounds of a self-organizing content delivery system. We further demonstrate how to balance between run-time complexity and accuracy of the model by applying a use case.</abstract><pub>IEEE</pub><doi>10.1109/SASOW.2012.26</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1467351539
ispartof 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops, 2012, p.97-104
issn
language eng
recordid cdi_ieee_primary_6498387
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Dynamic Networks
Evaluation
Global Optimization
Integer Linear Programming
Self-organization
title Discovering Bounds of Performance of Self-Organizing Content Delivery Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T13%3A16%3A41IST&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=Discovering%20Bounds%20of%20Performance%20of%20Self-Organizing%20Content%20Delivery%20Systems&rft.btitle=2012%20IEEE%20Sixth%20International%20Conference%20on%20Self-Adaptive%20and%20Self-Organizing%20Systems%20Workshops&rft.au=Szkaliczki,%20T.&rft.date=2012-09&rft.spage=97&rft.epage=104&rft.pages=97-104&rft.isbn=1467351539&rft.isbn_list=9781467351539&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SASOW.2012.26&rft_dat=%3Cieee_6IE%3E6498387%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769548951&rft.eisbn_list=0769548954&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6498387&rfr_iscdi=true