Loading…
Scalable Bandwidth Optimization in Advance Reservation Networks
In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast d...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 100 |
container_issue | |
container_start_page | 95 |
container_title | |
container_volume | |
creator | Schmidt, S. Kunegis, J. |
description | In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast dynamic routing with simple path selection algorithms. Although this is often necessary to satisfy time constraints for answering reservation requests, it inevitably leads to network inefficiencies due to the fact that the resulting uneven load distribution leads to bottlenecks within the network. We propose a combination of fast online bandwidth reservation with background reoptimization which continuously frees up bandwidth for future time slots in order to allow the network to carry more traffic without adding further capacity. A combinatorial time-approximation scheme suitable for large networks will be used. In addition, we evaluate several performance metrics and show that a significant improvement in request admission rate and bandwidth utilization can be achieved under the proposed scheme. |
doi_str_mv | 10.1109/ICON.2007.4444068 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_4444068</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4444068</ieee_id><sourcerecordid>4444068</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-4667264c364b50c721887c2300f7e3a5a7f95d07d7b5060ba58e317dd79658ad3</originalsourceid><addsrcrecordid>eNotkFtrwkAUhLc3qFp_QOlL_kDs2bOXs_tUbOhFEIXWd9lkN3TbGCUJSvvrGzDzMjAfDMMwds9hxjnYx0W2Xs0QgGayF2hzwaaWDJcoJUcB4pKNUAhMFVlzxcYDQCuu2YgrwVNErm_ZuG2_ARCQ5Ig9fRaucnkVkmdX-1P03VeyPnRxF_9cF_d1Eutk7o-uLkLyEdrQHM_xKnSnffPT3rGb0lVtmA4-YZvXl032ni7Xb4tsvkyjhS6VWhNqWQgtcwUFITeGin4zlBSEU45KqzyQpx5ryJ0yQXDynqxWxnkxYQ_n2hhC2B6auHPN73b4QfwDZQ1MEQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Scalable Bandwidth Optimization in Advance Reservation Networks</title><source>IEEE Xplore All Conference Series</source><creator>Schmidt, S. ; Kunegis, J.</creator><creatorcontrib>Schmidt, S. ; Kunegis, J.</creatorcontrib><description>In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast dynamic routing with simple path selection algorithms. Although this is often necessary to satisfy time constraints for answering reservation requests, it inevitably leads to network inefficiencies due to the fact that the resulting uneven load distribution leads to bottlenecks within the network. We propose a combination of fast online bandwidth reservation with background reoptimization which continuously frees up bandwidth for future time slots in order to allow the network to carry more traffic without adding further capacity. A combinatorial time-approximation scheme suitable for large networks will be used. In addition, we evaluate several performance metrics and show that a significant improvement in request admission rate and bandwidth utilization can be achieved under the proposed scheme.</description><identifier>ISSN: 1531-2216</identifier><identifier>ISBN: 1424412293</identifier><identifier>ISBN: 9781424412297</identifier><identifier>EISSN: 2332-5798</identifier><identifier>EISBN: 9781424412303</identifier><identifier>EISBN: 1424412307</identifier><identifier>DOI: 10.1109/ICON.2007.4444068</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Costs ; Delay ; Grid computing ; Multiprotocol label switching ; Quality of service ; Resource management ; Routing ; Telecommunication traffic ; Time factors</subject><ispartof>2007 15th IEEE International Conference on Networks, 2007, p.95-100</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/4444068$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4444068$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Schmidt, S.</creatorcontrib><creatorcontrib>Kunegis, J.</creatorcontrib><title>Scalable Bandwidth Optimization in Advance Reservation Networks</title><title>2007 15th IEEE International Conference on Networks</title><addtitle>ICON</addtitle><description>In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast dynamic routing with simple path selection algorithms. Although this is often necessary to satisfy time constraints for answering reservation requests, it inevitably leads to network inefficiencies due to the fact that the resulting uneven load distribution leads to bottlenecks within the network. We propose a combination of fast online bandwidth reservation with background reoptimization which continuously frees up bandwidth for future time slots in order to allow the network to carry more traffic without adding further capacity. A combinatorial time-approximation scheme suitable for large networks will be used. In addition, we evaluate several performance metrics and show that a significant improvement in request admission rate and bandwidth utilization can be achieved under the proposed scheme.</description><subject>Bandwidth</subject><subject>Costs</subject><subject>Delay</subject><subject>Grid computing</subject><subject>Multiprotocol label switching</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Routing</subject><subject>Telecommunication traffic</subject><subject>Time factors</subject><issn>1531-2216</issn><issn>2332-5798</issn><isbn>1424412293</isbn><isbn>9781424412297</isbn><isbn>9781424412303</isbn><isbn>1424412307</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkFtrwkAUhLc3qFp_QOlL_kDs2bOXs_tUbOhFEIXWd9lkN3TbGCUJSvvrGzDzMjAfDMMwds9hxjnYx0W2Xs0QgGayF2hzwaaWDJcoJUcB4pKNUAhMFVlzxcYDQCuu2YgrwVNErm_ZuG2_ARCQ5Ig9fRaucnkVkmdX-1P03VeyPnRxF_9cF_d1Eutk7o-uLkLyEdrQHM_xKnSnffPT3rGb0lVtmA4-YZvXl032ni7Xb4tsvkyjhS6VWhNqWQgtcwUFITeGin4zlBSEU45KqzyQpx5ryJ0yQXDynqxWxnkxYQ_n2hhC2B6auHPN73b4QfwDZQ1MEQ</recordid><startdate>200711</startdate><enddate>200711</enddate><creator>Schmidt, S.</creator><creator>Kunegis, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200711</creationdate><title>Scalable Bandwidth Optimization in Advance Reservation Networks</title><author>Schmidt, S. ; Kunegis, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-4667264c364b50c721887c2300f7e3a5a7f95d07d7b5060ba58e317dd79658ad3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Bandwidth</topic><topic>Costs</topic><topic>Delay</topic><topic>Grid computing</topic><topic>Multiprotocol label switching</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Routing</topic><topic>Telecommunication traffic</topic><topic>Time factors</topic><toplevel>online_resources</toplevel><creatorcontrib>Schmidt, S.</creatorcontrib><creatorcontrib>Kunegis, J.</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>Schmidt, S.</au><au>Kunegis, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scalable Bandwidth Optimization in Advance Reservation Networks</atitle><btitle>2007 15th IEEE International Conference on Networks</btitle><stitle>ICON</stitle><date>2007-11</date><risdate>2007</risdate><spage>95</spage><epage>100</epage><pages>95-100</pages><issn>1531-2216</issn><eissn>2332-5798</eissn><isbn>1424412293</isbn><isbn>9781424412297</isbn><eisbn>9781424412303</eisbn><eisbn>1424412307</eisbn><abstract>In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast dynamic routing with simple path selection algorithms. Although this is often necessary to satisfy time constraints for answering reservation requests, it inevitably leads to network inefficiencies due to the fact that the resulting uneven load distribution leads to bottlenecks within the network. We propose a combination of fast online bandwidth reservation with background reoptimization which continuously frees up bandwidth for future time slots in order to allow the network to carry more traffic without adding further capacity. A combinatorial time-approximation scheme suitable for large networks will be used. In addition, we evaluate several performance metrics and show that a significant improvement in request admission rate and bandwidth utilization can be achieved under the proposed scheme.</abstract><pub>IEEE</pub><doi>10.1109/ICON.2007.4444068</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1531-2216 |
ispartof | 2007 15th IEEE International Conference on Networks, 2007, p.95-100 |
issn | 1531-2216 2332-5798 |
language | eng |
recordid | cdi_ieee_primary_4444068 |
source | IEEE Xplore All Conference Series |
subjects | Bandwidth Costs Delay Grid computing Multiprotocol label switching Quality of service Resource management Routing Telecommunication traffic Time factors |
title | Scalable Bandwidth Optimization in Advance Reservation Networks |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T22%3A11%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Scalable%20Bandwidth%20Optimization%20in%20Advance%20Reservation%20Networks&rft.btitle=2007%2015th%20IEEE%20International%20Conference%20on%20Networks&rft.au=Schmidt,%20S.&rft.date=2007-11&rft.spage=95&rft.epage=100&rft.pages=95-100&rft.issn=1531-2216&rft.eissn=2332-5798&rft.isbn=1424412293&rft.isbn_list=9781424412297&rft_id=info:doi/10.1109/ICON.2007.4444068&rft.eisbn=9781424412303&rft.eisbn_list=1424412307&rft_dat=%3Cieee_CHZPO%3E4444068%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-4667264c364b50c721887c2300f7e3a5a7f95d07d7b5060ba58e317dd79658ad3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4444068&rfr_iscdi=true |