End-to-end network QoS via scheduling of flexible resource reservation requests
Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (...
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 | 10 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Sharma, Sushant Katramatos, Dimitrios Yu, Dantong |
| description | Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics. |
| doi_str_mv | 10.1145/2063384.2063475 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>acm_6IE</sourceid><recordid>TN_cdi_ieee_primary_6114455</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6114455</ieee_id><sourcerecordid>acm_books_10_1145_2063384_2063475</sourcerecordid><originalsourceid>FETCH-LOGICAL-a2035-1ed744a27a70f61a797651cce42c35ae8b0185944695d34784f6f4d4f8c2db0f3</originalsourceid><addsrcrecordid>eNqNkDtPwzAURs1LopTODCweWVL8djKiqjykSggBEpvlJNdgmsZgpwX-PSmtECPT_XSP7ifdg9AJJWNKhTxnRHGei_F6Ci130FG_JZxoTZ920YBRpTPBud77C_Z_ASsO0SilV0IIpUxKqgbodtrWWRcyaGvcQvcR4hzfhXu88han6gXqZePbZxwcdg18-rIBHCGFZax-AsSV7Xxo-_y-hNSlY3TgbJNgtJ1D9Hg5fZhcZ7Pbq5vJxSyzjHCZUai1EJZpq4lT1OpCK0mrCgSruLSQl4TmshBCFbLuf82FU07UwuUVq0vi-BCdbno9AJi36Bc2fhnVaxJS9nS8obZamDKEeTKUmLVDs3Votg5NGT2s687-ecC_AQb4atk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>End-to-end network QoS via scheduling of flexible resource reservation requests</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sharma, Sushant ; Katramatos, Dimitrios ; Yu, Dantong</creator><creatorcontrib>Sharma, Sushant ; Katramatos, Dimitrios ; Yu, Dantong</creatorcontrib><description>Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.</description><identifier>ISSN: 2167-4329</identifier><identifier>ISBN: 145030771X</identifier><identifier>ISBN: 9781450307710</identifier><identifier>EISSN: 2167-4337</identifier><identifier>EISBN: 145030771X</identifier><identifier>EISBN: 9781450307710</identifier><identifier>DOI: 10.1145/2063384.2063475</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Availability ; Bandwidth ; Computer systems organization -- Dependable and fault-tolerant systems and networks ; End-to-end QoS ; General and reference -- Cross-computing tools and techniques -- Performance ; Networks -- Network performance evaluation ; NP-hard problem ; Polynomials ; Quality of service ; Resource Reservation ; Schedules ; Scheduling ; Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Process management -- Scheduling ; Wide area networks</subject><ispartof>2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2011, p.1-10</ispartof><rights>2011 ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6114455$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6114455$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sharma, Sushant</creatorcontrib><creatorcontrib>Katramatos, Dimitrios</creatorcontrib><creatorcontrib>Yu, Dantong</creatorcontrib><title>End-to-end network QoS via scheduling of flexible resource reservation requests</title><title>2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</title><addtitle>SC</addtitle><description>Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.</description><subject>Availability</subject><subject>Bandwidth</subject><subject>Computer systems organization -- Dependable and fault-tolerant systems and networks</subject><subject>End-to-end QoS</subject><subject>General and reference -- Cross-computing tools and techniques -- Performance</subject><subject>Networks -- Network performance evaluation</subject><subject>NP-hard problem</subject><subject>Polynomials</subject><subject>Quality of service</subject><subject>Resource Reservation</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Process management -- Scheduling</subject><subject>Wide area networks</subject><issn>2167-4329</issn><issn>2167-4337</issn><isbn>145030771X</isbn><isbn>9781450307710</isbn><isbn>145030771X</isbn><isbn>9781450307710</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNqNkDtPwzAURs1LopTODCweWVL8djKiqjykSggBEpvlJNdgmsZgpwX-PSmtECPT_XSP7ifdg9AJJWNKhTxnRHGei_F6Ci130FG_JZxoTZ920YBRpTPBud77C_Z_ASsO0SilV0IIpUxKqgbodtrWWRcyaGvcQvcR4hzfhXu88han6gXqZePbZxwcdg18-rIBHCGFZax-AsSV7Xxo-_y-hNSlY3TgbJNgtJ1D9Hg5fZhcZ7Pbq5vJxSyzjHCZUai1EJZpq4lT1OpCK0mrCgSruLSQl4TmshBCFbLuf82FU07UwuUVq0vi-BCdbno9AJi36Bc2fhnVaxJS9nS8obZamDKEeTKUmLVDs3Votg5NGT2s687-ecC_AQb4atk</recordid><startdate>20111112</startdate><enddate>20111112</enddate><creator>Sharma, Sushant</creator><creator>Katramatos, Dimitrios</creator><creator>Yu, Dantong</creator><general>ACM</general><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20111112</creationdate><title>End-to-end network QoS via scheduling of flexible resource reservation requests</title><author>Sharma, Sushant ; Katramatos, Dimitrios ; Yu, Dantong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a2035-1ed744a27a70f61a797651cce42c35ae8b0185944695d34784f6f4d4f8c2db0f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Availability</topic><topic>Bandwidth</topic><topic>Computer systems organization -- Dependable and fault-tolerant systems and networks</topic><topic>End-to-end QoS</topic><topic>General and reference -- Cross-computing tools and techniques -- Performance</topic><topic>Networks -- Network performance evaluation</topic><topic>NP-hard problem</topic><topic>Polynomials</topic><topic>Quality of service</topic><topic>Resource Reservation</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Process management -- Scheduling</topic><topic>Wide area networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Sharma, Sushant</creatorcontrib><creatorcontrib>Katramatos, Dimitrios</creatorcontrib><creatorcontrib>Yu, Dantong</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>Sharma, Sushant</au><au>Katramatos, Dimitrios</au><au>Yu, Dantong</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>End-to-end network QoS via scheduling of flexible resource reservation requests</atitle><btitle>2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</btitle><stitle>SC</stitle><date>2011-11-12</date><risdate>2011</risdate><spage>1</spage><epage>10</epage><pages>1-10</pages><issn>2167-4329</issn><eissn>2167-4337</eissn><isbn>145030771X</isbn><isbn>9781450307710</isbn><eisbn>145030771X</eisbn><eisbn>9781450307710</eisbn><abstract>Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/2063384.2063475</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2167-4329 |
| ispartof | 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2011, p.1-10 |
| issn | 2167-4329 2167-4337 |
| language | eng |
| recordid | cdi_ieee_primary_6114455 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Availability Bandwidth Computer systems organization -- Dependable and fault-tolerant systems and networks End-to-end QoS General and reference -- Cross-computing tools and techniques -- Performance Networks -- Network performance evaluation NP-hard problem Polynomials Quality of service Resource Reservation Schedules Scheduling Software and its engineering -- Software organization and properties -- Contextual software domains -- Operating systems -- Process management -- Scheduling Wide area networks |
| title | End-to-end network QoS via scheduling of flexible resource reservation requests |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T15%3A04%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=End-to-end%20network%20QoS%20via%20scheduling%20of%20flexible%20resource%20reservation%20requests&rft.btitle=2011%20International%20Conference%20for%20High%20Performance%20Computing,%20Networking,%20Storage%20and%20Analysis%20(SC)&rft.au=Sharma,%20Sushant&rft.date=2011-11-12&rft.spage=1&rft.epage=10&rft.pages=1-10&rft.issn=2167-4329&rft.eissn=2167-4337&rft.isbn=145030771X&rft.isbn_list=9781450307710&rft_id=info:doi/10.1145/2063384.2063475&rft_dat=%3Cacm_6IE%3Eacm_books_10_1145_2063384_2063475%3C/acm_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=145030771X&rft.eisbn_list=9781450307710&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6114455&rfr_iscdi=true |