Dynamic constrained multipath routing for MPLS networks

Multipath routing employs multiple parallel paths between a traffic source and destination in order to relax the most heavily congested link in the Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link...

Full description

Saved in:
Bibliographic Details
Main Authors: Yongho Seok, Youngseok Lee, Yanghee Choi, Changhoon Kim
Format: Conference Proceeding
Language:English
Subjects:
Character generation
Chromium
Multiprotocol label switching
Routing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 353
container_issue
container_start_page 348
container_title
container_volume
creator Yongho Seok
Youngseok Lee
Yanghee Choi
Changhoon Kim
description Multipath routing employs multiple parallel paths between a traffic source and destination in order to relax the most heavily congested link in the Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than the conventional shortest path. In addition, even though we can accommodate more traffic by establishing more paths between the same node pair, it is advised to limit the number of paths for practical reasons such as manageability. This paper presents a heuristic algorithm for hop-count and path count constrained dynamic multipath routing. The objective we adopted in this paper is to minimize the maximum of link utilization. We also obtain the traffic split ratio among the paths, for routers based on traffic partitioning by hashing at the flow level. The extensive simulation results show that the proposed algorithm always minimizes the maximum of link utilization and reduces the number of blocked requests.
doi_str_mv 10.1109/ICCCN.2001.956289
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_956289</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>956289</ieee_id><sourcerecordid>956289</sourcerecordid><originalsourceid>FETCH-LOGICAL-i174t-49474d591920fbea473a6fe52ed165b726288f294e795f20bad11e8aca268f483</originalsourceid><addsrcrecordid>eNotj8lOwzAURS0GiVD6AbDyDyS85yG2lyhMlcIgAevKSWwwNEnluEL9eyKVu7mrc3UuIZcIBSKY61VVVc8FA8DCyJJpc0QyVnKVG8HhmJyD0sAVMs1PSDYDMmcg5RlZTtM3zOFGIGBG1O1-sH1oaTsOU4o2DK6j_W6TwtamLxrHXQrDJ_VjpE-v9RsdXPod4890QU693Uxu-d8L8nF_91495vXLw6q6qfOASqRcGKFEJw0aBr5xVihuS-8kcx2WslFsVteeGeGUkZ5BYztEp21rWam90HxBrg67wTm33sbQ27hfHy7zP5eiR74</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamic constrained multipath routing for MPLS networks</title><source>IEEE Xplore All Conference Series</source><creator>Yongho Seok ; Youngseok Lee ; Yanghee Choi ; Changhoon Kim</creator><creatorcontrib>Yongho Seok ; Youngseok Lee ; Yanghee Choi ; Changhoon Kim</creatorcontrib><description>Multipath routing employs multiple parallel paths between a traffic source and destination in order to relax the most heavily congested link in the Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than the conventional shortest path. In addition, even though we can accommodate more traffic by establishing more paths between the same node pair, it is advised to limit the number of paths for practical reasons such as manageability. This paper presents a heuristic algorithm for hop-count and path count constrained dynamic multipath routing. The objective we adopted in this paper is to minimize the maximum of link utilization. We also obtain the traffic split ratio among the paths, for routers based on traffic partitioning by hashing at the flow level. The extensive simulation results show that the proposed algorithm always minimizes the maximum of link utilization and reduces the number of blocked requests.</description><identifier>ISSN: 1095-2055</identifier><identifier>ISBN: 0780371283</identifier><identifier>ISBN: 9780780371286</identifier><identifier>EISSN: 2637-9430</identifier><identifier>DOI: 10.1109/ICCCN.2001.956289</identifier><language>eng</language><publisher>IEEE</publisher><subject>Character generation ; Chromium ; Multiprotocol label switching ; Routing</subject><ispartof>Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495), 2001, p.348-353</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/956289$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/956289$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yongho Seok</creatorcontrib><creatorcontrib>Youngseok Lee</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Changhoon Kim</creatorcontrib><title>Dynamic constrained multipath routing for MPLS networks</title><title>Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495)</title><addtitle>ICCCN</addtitle><description>Multipath routing employs multiple parallel paths between a traffic source and destination in order to relax the most heavily congested link in the Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than the conventional shortest path. In addition, even though we can accommodate more traffic by establishing more paths between the same node pair, it is advised to limit the number of paths for practical reasons such as manageability. This paper presents a heuristic algorithm for hop-count and path count constrained dynamic multipath routing. The objective we adopted in this paper is to minimize the maximum of link utilization. We also obtain the traffic split ratio among the paths, for routers based on traffic partitioning by hashing at the flow level. The extensive simulation results show that the proposed algorithm always minimizes the maximum of link utilization and reduces the number of blocked requests.</description><subject>Character generation</subject><subject>Chromium</subject><subject>Multiprotocol label switching</subject><subject>Routing</subject><issn>1095-2055</issn><issn>2637-9430</issn><isbn>0780371283</isbn><isbn>9780780371286</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj8lOwzAURS0GiVD6AbDyDyS85yG2lyhMlcIgAevKSWwwNEnluEL9eyKVu7mrc3UuIZcIBSKY61VVVc8FA8DCyJJpc0QyVnKVG8HhmJyD0sAVMs1PSDYDMmcg5RlZTtM3zOFGIGBG1O1-sH1oaTsOU4o2DK6j_W6TwtamLxrHXQrDJ_VjpE-v9RsdXPod4890QU693Uxu-d8L8nF_91495vXLw6q6qfOASqRcGKFEJw0aBr5xVihuS-8kcx2WslFsVteeGeGUkZ5BYztEp21rWam90HxBrg67wTm33sbQ27hfHy7zP5eiR74</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Yongho Seok</creator><creator>Youngseok Lee</creator><creator>Yanghee Choi</creator><creator>Changhoon Kim</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2001</creationdate><title>Dynamic constrained multipath routing for MPLS networks</title><author>Yongho Seok ; Youngseok Lee ; Yanghee Choi ; Changhoon Kim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i174t-49474d591920fbea473a6fe52ed165b726288f294e795f20bad11e8aca268f483</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Character generation</topic><topic>Chromium</topic><topic>Multiprotocol label switching</topic><topic>Routing</topic><toplevel>online_resources</toplevel><creatorcontrib>Yongho Seok</creatorcontrib><creatorcontrib>Youngseok Lee</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Changhoon Kim</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 Xplore</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>Yongho Seok</au><au>Youngseok Lee</au><au>Yanghee Choi</au><au>Changhoon Kim</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamic constrained multipath routing for MPLS networks</atitle><btitle>Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495)</btitle><stitle>ICCCN</stitle><date>2001</date><risdate>2001</risdate><spage>348</spage><epage>353</epage><pages>348-353</pages><issn>1095-2055</issn><eissn>2637-9430</eissn><isbn>0780371283</isbn><isbn>9780780371286</isbn><abstract>Multipath routing employs multiple parallel paths between a traffic source and destination in order to relax the most heavily congested link in the Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than the conventional shortest path. In addition, even though we can accommodate more traffic by establishing more paths between the same node pair, it is advised to limit the number of paths for practical reasons such as manageability. This paper presents a heuristic algorithm for hop-count and path count constrained dynamic multipath routing. The objective we adopted in this paper is to minimize the maximum of link utilization. We also obtain the traffic split ratio among the paths, for routers based on traffic partitioning by hashing at the flow level. The extensive simulation results show that the proposed algorithm always minimizes the maximum of link utilization and reduces the number of blocked requests.</abstract><pub>IEEE</pub><doi>10.1109/ICCCN.2001.956289</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1095-2055
ispartof Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495), 2001, p.348-353
issn 1095-2055
2637-9430
language eng
recordid cdi_ieee_primary_956289
source IEEE Xplore All Conference Series
subjects Character generation
Chromium
Multiprotocol label switching
Routing
title Dynamic constrained multipath routing for MPLS networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A07%3A35IST&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=Dynamic%20constrained%20multipath%20routing%20for%20MPLS%20networks&rft.btitle=Proceedings%20Tenth%20International%20Conference%20on%20Computer%20Communications%20and%20Networks%20(Cat.%20No.01EX495)&rft.au=Yongho%20Seok&rft.date=2001&rft.spage=348&rft.epage=353&rft.pages=348-353&rft.issn=1095-2055&rft.eissn=2637-9430&rft.isbn=0780371283&rft.isbn_list=9780780371286&rft_id=info:doi/10.1109/ICCCN.2001.956289&rft_dat=%3Cieee_CHZPO%3E956289%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i174t-49474d591920fbea473a6fe52ed165b726288f294e795f20bad11e8aca268f483%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=956289&rfr_iscdi=true