Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time
In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate t...
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 | 580 |
---|---|
container_issue | |
container_start_page | 575 |
container_title | |
container_volume | |
creator | Bin Bin Chen Primet, P.V.-B. |
description | In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate the efficient scheduling of endpoint resources, networks should provide a service which guarantees that a specified amount of data is transferred within a strict time window. Existing "FixRate-FixTime" resource reservation architectures such as IntServ/RSVP reserve for each flow a constant amount of resource from a specified starting time. Instead, a bulk data transfer can start at any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. This paper proposes a flexible "Multi-Interval" resource reservation approach, which divides the active window of a transfer into multiple sub-intervals, and reserves constant amount of resource in each of them. We identify a possible evolution path towards the proposed architecture, and use simulations to demonstrate the potential performance gain from increasing flexibility. |
doi_str_mv | 10.1109/ICC.2007.100 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4288771</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4288771</ieee_id><sourcerecordid>4288771</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-c345f6ac31f5fa00a865c77c086c67f7b60696c4490782c832b27cfe6b990c413</originalsourceid><addsrcrecordid>eNotjDtPwzAYAC0eEqV0Y2PxH0j4_LbHEkpbqRIDQYyV49qtIS_FqVD_PUUw3XCnQ-ieQE4ImMd1UeQUQOUE4AJNiGE6I1qzSzQzShNOOQcmGFydnRCQMQnqBt2m9AkgqGFkgj7ejn3fDWNs9_jpWH_hZztaXA62TcEPCXcBr-L-kC3aHZ73fR2dHWPXJvwdxwNeHu25HL3f4aJr-tr_OlzGxt-h62Dr5Gf_nKL3l0VZrLLN63JdzDdZJEqMmWNcBGkdI0EEC2C1FE4pB1o6qYKqJEgjHecGlKZOM1pR5YKXlTHgOGFT9PD3jd77bT_Exg6nLadaK0XYD3UJUcc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bin Bin Chen ; Primet, P.V.-B.</creator><creatorcontrib>Bin Bin Chen ; Primet, P.V.-B.</creatorcontrib><description>In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate the efficient scheduling of endpoint resources, networks should provide a service which guarantees that a specified amount of data is transferred within a strict time window. Existing "FixRate-FixTime" resource reservation architectures such as IntServ/RSVP reserve for each flow a constant amount of resource from a specified starting time. Instead, a bulk data transfer can start at any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. This paper proposes a flexible "Multi-Interval" resource reservation approach, which divides the active window of a transfer into multiple sub-intervals, and reserves constant amount of resource in each of them. We identify a possible evolution path towards the proposed architecture, and use simulations to demonstrate the potential performance gain from increasing flexibility.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 9781424403530</identifier><identifier>ISBN: 1424403537</identifier><identifier>EISSN: 1938-1883</identifier><identifier>DOI: 10.1109/ICC.2007.100</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Bandwidth ; Computer applications ; Computer networks ; Distributed computing ; Grid computing ; High energy physics instrumentation computing ; Instruments ; Processor scheduling ; Resource management</subject><ispartof>2007 IEEE International Conference on Communications, 2007, p.575-580</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/4288771$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4288771$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bin Bin Chen</creatorcontrib><creatorcontrib>Primet, P.V.-B.</creatorcontrib><title>Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time</title><title>2007 IEEE International Conference on Communications</title><addtitle>ICC</addtitle><description>In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate the efficient scheduling of endpoint resources, networks should provide a service which guarantees that a specified amount of data is transferred within a strict time window. Existing "FixRate-FixTime" resource reservation architectures such as IntServ/RSVP reserve for each flow a constant amount of resource from a specified starting time. Instead, a bulk data transfer can start at any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. This paper proposes a flexible "Multi-Interval" resource reservation approach, which divides the active window of a transfer into multiple sub-intervals, and reserves constant amount of resource in each of them. We identify a possible evolution path towards the proposed architecture, and use simulations to demonstrate the potential performance gain from increasing flexibility.</description><subject>Application software</subject><subject>Bandwidth</subject><subject>Computer applications</subject><subject>Computer networks</subject><subject>Distributed computing</subject><subject>Grid computing</subject><subject>High energy physics instrumentation computing</subject><subject>Instruments</subject><subject>Processor scheduling</subject><subject>Resource management</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>9781424403530</isbn><isbn>1424403537</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjDtPwzAYAC0eEqV0Y2PxH0j4_LbHEkpbqRIDQYyV49qtIS_FqVD_PUUw3XCnQ-ieQE4ImMd1UeQUQOUE4AJNiGE6I1qzSzQzShNOOQcmGFydnRCQMQnqBt2m9AkgqGFkgj7ejn3fDWNs9_jpWH_hZztaXA62TcEPCXcBr-L-kC3aHZ73fR2dHWPXJvwdxwNeHu25HL3f4aJr-tr_OlzGxt-h62Dr5Gf_nKL3l0VZrLLN63JdzDdZJEqMmWNcBGkdI0EEC2C1FE4pB1o6qYKqJEgjHecGlKZOM1pR5YKXlTHgOGFT9PD3jd77bT_Exg6nLadaK0XYD3UJUcc</recordid><startdate>200706</startdate><enddate>200706</enddate><creator>Bin Bin Chen</creator><creator>Primet, P.V.-B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200706</creationdate><title>Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time</title><author>Bin Bin Chen ; Primet, P.V.-B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-c345f6ac31f5fa00a865c77c086c67f7b60696c4490782c832b27cfe6b990c413</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Application software</topic><topic>Bandwidth</topic><topic>Computer applications</topic><topic>Computer networks</topic><topic>Distributed computing</topic><topic>Grid computing</topic><topic>High energy physics instrumentation computing</topic><topic>Instruments</topic><topic>Processor scheduling</topic><topic>Resource management</topic><toplevel>online_resources</toplevel><creatorcontrib>Bin Bin Chen</creatorcontrib><creatorcontrib>Primet, P.V.-B.</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>Bin Bin Chen</au><au>Primet, P.V.-B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time</atitle><btitle>2007 IEEE International Conference on Communications</btitle><stitle>ICC</stitle><date>2007-06</date><risdate>2007</risdate><spage>575</spage><epage>580</epage><pages>575-580</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>9781424403530</isbn><isbn>1424403537</isbn><abstract>In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, which often require reliable and efficient transfer of gigabits or even terabits of data among endpoints. To facilitate the efficient scheduling of endpoint resources, networks should provide a service which guarantees that a specified amount of data is transferred within a strict time window. Existing "FixRate-FixTime" resource reservation architectures such as IntServ/RSVP reserve for each flow a constant amount of resource from a specified starting time. Instead, a bulk data transfer can start at any time after its arrival, use any and even time variant bandwidth value, as long as it is completed before its deadline. This paper proposes a flexible "Multi-Interval" resource reservation approach, which divides the active window of a transfer into multiple sub-intervals, and reserves constant amount of resource in each of them. We identify a possible evolution path towards the proposed architecture, and use simulations to demonstrate the potential performance gain from increasing flexibility.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2007.100</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1550-3607 |
ispartof | 2007 IEEE International Conference on Communications, 2007, p.575-580 |
issn | 1550-3607 1938-1883 |
language | eng |
recordid | cdi_ieee_primary_4288771 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Application software Bandwidth Computer applications Computer networks Distributed computing Grid computing High energy physics instrumentation computing Instruments Processor scheduling Resource management |
title | Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T12%3A48%3A28IST&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=Supporting%20Bulk%20Data%20Transfers%20of%20High-End%20Applications%20with%20Guaranteed%20Completion%20Time&rft.btitle=2007%20IEEE%20International%20Conference%20on%20Communications&rft.au=Bin%20Bin%20Chen&rft.date=2007-06&rft.spage=575&rft.epage=580&rft.pages=575-580&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=9781424403530&rft.isbn_list=1424403537&rft_id=info:doi/10.1109/ICC.2007.100&rft_dat=%3Cieee_6IE%3E4288771%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4288771&rfr_iscdi=true |