Routing with end-to-end QoS guarantees in broadband networks
We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed...
Uložené v:
| Vydané v: | IEEE/ACM transactions on networking Ročník 7; číslo 3; s. 365 - 374 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.06.1999
|
| Predmet: | |
| ISSN: | 1063-6692 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the connection, for which a straightforward yet computationally costly solution exists. Accordingly, we establish several approximation schemes that offer substantially lower computational complexity. We then consider the more general problem of optimizing the route choice in terms of balancing loads and accommodating multiple connections, for which we formulate and validate several optimal algorithms. We discuss the implementation of such schemes in the context of link-state and distance-vector protocols. Next, we consider the fundamental problem of constrained path optimization. This problem, typical of quality of service routing, is NP-hard. While standard approximation methods exist, their complexity may often be prohibitive in terms of scalability. Such approximations do not make use of the particular properties of large-scale networks, such as the face that the path selection process is typically presented with a hierarchical, aggregated topology. By exploiting the structure of such topologies, we obtain an /spl epsiv/-optimal algorithm for the constrained shortest-path problem, which offers a substantial improvement in terms of scalability. |
|---|---|
| AbstractList | We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the Guaranteed Service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the connection, for which a straightforward yet computationally costly solution exists. Accordingly, we establish several approximation schemes that offer substantially lower computational complexity. We then consider the more general problem of optimizing the route choice in terms of balancing loads and accommodating multiple connections, for which we formulate and validate several optimal algorithms. We discuss the implementation of such schemes in the context of link-state and distance-vector protocols. Next, we consider the fundamental problem of constrained path optimization. This problem, typical of quality of service routing, is NP-hard. While standard approximation methods exist, their complexity may often be prohibitive in terms of scalability. Such approximations do not make use of the particular properties of large-scale networks, such as the fact that the path selection process is typically presented with a hierarchical, aggregated topology. By exploiting the structure of such topologies, we obtain an epsilon -optimal algorithm for the constrained shortest-path problem, which offers a substantial improvement in terms of scalability. We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the connection, for which a straightforward yet computationally costly solution exists. Accordingly, we establish several approximation schemes that offer substantially lower computational complexity. We then consider the more general problem of optimizing the route choice in terms of balancing loads and accommodating multiple connections, for which we formulate and validate several optimal algorithms. We discuss the implementation of such schemes in the context of link-state and distance-vector protocols. Next, we consider the fundamental problem of constrained path optimization. This problem, typical of quality of service routing, is NP-hard. While standard approximation methods exist, their complexity may often be prohibitive in terms of scalability. Such approximations do not make use of the particular properties of large-scale networks, such as the face that the path selection process is typically presented with a hierarchical, aggregated topology. By exploiting the structure of such topologies, we obtain an /spl epsiv/-optimal algorithm for the constrained shortest-path problem, which offers a substantial improvement in terms of scalability. We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the connection, for which a straightforward yet computationally costly solution exists. Accordingly, we establish several approximation schemes that offer substantially lower computational complexity. We then consider the more general problem of optimizing the route choice in terms of balancing loads and accommodating multiple connections, for which we formulate and validate several optimal algorithms. We discuss the implementation of such schemes in the context of link-state and distance-vector protocols. Next, we consider the fundamental problem of constrained path optimization. This problem, typical of quality of service routing, is NP-hard. While standard approximation methods exist, their complexity may often be prohibitive in terms of scalability. Such approximations do not make use of the particular properties of large-scale networks, such as the face that the path selection process is typically presented with a hierarchical, aggregated topology. By exploiting the structure of such topologies, we obtain an epsilon-optimal algorithm for the constrained shortest-path problem, which offers a substantial improvement in terms of scalability |
| Author | Orda, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Orda fullname: Orda, A. organization: Dept. of Electr. Eng., Israel Inst. of Technol., Haifa, Israel |
| BookMark | eNqFkEtPAjEUhbvAREAXbl3NysTFwG3LtDRxY4ivhMT4Wk_uzNzBKrTYlhD_vRCIC2PC6izO953F6bGO844YO-Mw4BzM0MBAayOg6LAuByVzpYw4Zr0YPwC4BKG67OrZr5J1s2xt03tGrsmTzzeRPfmXbLbCgC4Rxcy6rAoemwo3naO09uEznrCjFueRTvfZZ2-3N6-T-3z6ePcwuZ7mtZQm5QUhcCxAVQ3VAqDQI64VITdC4rhVlSaSJBFkgVI2rdBt3VSmGWPDeasK2WcXu91l8F8riqlc2FjTfI6O_CqWwoDQoPVhcKxASIDDoOYjtWX77HIH1sHHGKgtl8EuMHyXHMrty6WBcvfyhh3-YWubMFnvUkA7_9c43xmWiH6X9-UP_wqJqg |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1007_s10957_014_0624_5 crossref_primary_10_1016_S0020_0190_01_00323_4 crossref_primary_10_1016_S0140_3664_01_00358_9 crossref_primary_10_1109_TCOMM_2003_811420 crossref_primary_10_1016_j_comcom_2007_10_043 crossref_primary_10_1109_TSMCC_2003_817354 crossref_primary_10_1155_2012_374961 crossref_primary_10_1016_j_jpdc_2017_10_005 crossref_primary_10_1016_S1389_1286_00_00209_7 crossref_primary_10_1109_TC_2003_1204827 crossref_primary_10_1109_TPDS_2006_90 crossref_primary_10_1111_j_1475_3995_2010_00766_x crossref_primary_10_1109_65_768484 crossref_primary_10_1109_TNET_2005_850217 crossref_primary_10_4028_www_scientific_net_AMM_443_487 crossref_primary_10_1007_s11235_009_9217_2 crossref_primary_10_1016_j_comnet_2004_11_002 crossref_primary_10_1023_B_NETS_0000015655_31348_1b crossref_primary_10_1109_TNET_2004_826248 crossref_primary_10_1002_nem_485 crossref_primary_10_1016_j_jnca_2003_10_003 crossref_primary_10_1016_j_peva_2003_11_002 crossref_primary_10_1016_j_future_2009_02_002 crossref_primary_10_1145_774749_774760 crossref_primary_10_1109_49_898740 crossref_primary_10_1016_S1389_1286_00_00119_5 crossref_primary_10_1016_j_amc_2006_07_153 crossref_primary_10_1023_A_1024113813535 crossref_primary_10_1049_iet_com_20050457 crossref_primary_10_1109_90_779203 crossref_primary_10_1109_90_993305 crossref_primary_10_1007_BF02949823 crossref_primary_10_1109_TMM_2003_811627 crossref_primary_10_1016_j_comcom_2016_09_006 crossref_primary_10_1016_j_cor_2016_12_009 crossref_primary_10_1016_j_ejor_2008_07_020 crossref_primary_10_1016_S0898_1221_02_00264_X crossref_primary_10_1109_TNET_2007_900712 crossref_primary_10_1145_345063_339427 crossref_primary_10_1002_dac_3570 crossref_primary_10_1109_TNET_2004_836112 crossref_primary_10_1109_TNET_2003_815299 crossref_primary_10_1109_TNET_2002_803917 crossref_primary_10_1016_j_peva_2008_04_008 crossref_primary_10_1007_s11047_011_9252_2 crossref_primary_10_1109_TNET_2006_890089 |
| Cites_doi | 10.1109/ICNP.1997.643711 10.17487/rfc2386 10.1007/978-0-387-35170-4_12 10.1109/ICNP.1997.643713 10.1109/90.532860 10.1109/5.469298 10.1109/90.748088 10.1109/90.298432 10.1287/moor.17.1.36 10.1145/210613.210625 10.1109/GLOCOM.1997.644603 10.1145/285243.285251 10.1109/4236.769425 10.1109/90.779203 |
| ContentType | Journal Article |
| DBID | RIA RIE AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 7SP |
| DOI | 10.1109/90.779205 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Electronics & Communications Abstracts |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Electronics & Communications Abstracts |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 374 |
| ExternalDocumentID | 10_1109_90_779205 779205 |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 7SP |
| ID | FETCH-LOGICAL-c339t-5ea01a506bdec200574176ea1923a8f6b7ee3e3a035a33df27fcdb9d8ad11f653 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 93 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000081627000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6692 |
| IngestDate | Sat Sep 27 21:30:58 EDT 2025 Mon Sep 29 04:13:38 EDT 2025 Sun Sep 28 06:31:42 EDT 2025 Tue Nov 18 22:32:17 EST 2025 Sat Nov 29 03:05:10 EST 2025 Tue Aug 26 21:00:26 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c339t-5ea01a506bdec200574176ea1923a8f6b7ee3e3a035a33df27fcdb9d8ad11f653 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 27146602 |
| PQPubID | 23500 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_28602300 crossref_primary_10_1109_90_779205 crossref_citationtrail_10_1109_90_779205 proquest_miscellaneous_29027077 proquest_miscellaneous_27146602 ieee_primary_779205 |
| PublicationCentury | 1900 |
| PublicationDate | 1999-06-01 |
| PublicationDateYYYYMMDD | 1999-06-01 |
| PublicationDate_xml | – month: 06 year: 1999 text: 1999-06-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 1999 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref12 ref15 ref14 ahuja (ref2) 1993 ref11 garey (ref6) 1979 ref21 (ref1) 1996 ref17 (ref16) 0 ref18 ref8 ref7 ref9 ref4 wang (ref20) 1996; 14 apostolopoulos (ref3) 1998 ref5 gupta (ref10) 1993 shenker (ref19) 1997 |
| References_xml | – ident: ref18 doi: 10.1109/ICNP.1997.643711 – ident: ref5 doi: 10.17487/rfc2386 – year: 1996 ident: ref1 publication-title: Private Network-Network Interface Specification v1 0 (PNNI) – ident: ref15 doi: 10.1007/978-0-387-35170-4_12 – ident: ref4 doi: 10.1109/ICNP.1997.643713 – ident: ref7 doi: 10.1109/90.532860 – ident: ref21 doi: 10.1109/5.469298 – year: 1993 ident: ref10 publication-title: Performance modeling and management of high-speed networks – ident: ref14 doi: 10.1109/90.748088 – year: 1993 ident: ref2 publication-title: Networks Flows – ident: ref17 doi: 10.1109/90.298432 – year: 1979 ident: ref6 publication-title: Computers and Intractability – ident: ref11 doi: 10.1287/moor.17.1.36 – ident: ref13 doi: 10.1145/210613.210625 – year: 0 ident: ref16 publication-title: Routing with end to end QoS guarantees in broadband networks – ident: ref9 doi: 10.1109/GLOCOM.1997.644603 – year: 1998 ident: ref3 article-title: quality of service based routing: a performance perspective publication-title: SIGCOMM doi: 10.1145/285243.285251 – year: 1997 ident: ref19 publication-title: Specification of guaranteed quality of service – ident: ref12 doi: 10.1109/4236.769425 – volume: 14 start-page: 1288 year: 1996 ident: ref20 article-title: quality-of-service routing for supporting multimedia applications publication-title: IEEE J Selected Areas in Communication – ident: ref8 doi: 10.1109/90.779203 |
| SSID | ssj0013026 |
| Score | 1.9508849 |
| Snippet | We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 365 |
| SubjectTerms | Broadband communication Computational complexity Delay IP networks Network topology Processor scheduling Quality of service Routing Scalability Web and internet services |
| Title | Routing with end-to-end QoS guarantees in broadband networks |
| URI | https://ieeexplore.ieee.org/document/779205 https://www.proquest.com/docview/27146602 https://www.proquest.com/docview/28602300 https://www.proquest.com/docview/29027077 |
| Volume | 7 |
| WOSCitedRecordID | wos000081627000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 1063-6692 databaseCode: RIE dateStart: 19930101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0013026 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA86fNAHP6bi_Azigy_Zrk2bNOCLiMOnoaiwt5I2VxlIK2vn32_SdlNxDHxqaK9NuRzJXe7y-xFylQVeEgjfMB46CjPjKaakjXnsSq-M0CYF3pBNyNEoGo_VY4uzXZ-FQcS6-Az7rlnn8k2RztxW2UBK5Tu80nUpRXNU6zthADWzmg1wOBNC-S2IkAdqoKDfvPhr6am5VP5MwPWqMtz51__sku3WeaS3zWjvkTXMu2TrB6TgPrlxJT62Rd0GK8XcsKpg9kKfimf6Zu3BaRJLOslpMi20SbR9lje14OUBeR3ev9w9sJYhgaWcq4qFqMHTIYjEYOr2h6x_IAVq57bpKBOJROTINfBQc24yX2apSZSJtPG8TIT8kHTyIscjQiF0n8qAYwRBlnEVoAwEWHdBp9oTYY9cz5UXpy18uGOxeI_rMAJUrCBuFNIjlwvRjwYzY5lQ1yl0ITC_ezEfkNjauUte6ByLWRn70s7pAvwVEo5OiwOskFA2CAcpj5f2fUI2W0wGBt4p6VTTGZ6RjfSzmpTT89rcvgCrWNMU |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA-igvrgx1ScXyvigy_Zrk2bLOCLiGPiHIoT9lbS5ioDaWXd_PtN2m4qjoFPDe21KZcjuctdfj9CLhPfjXzuacoCS2GmXUmlMDGPWeml5krHwEqyCdHvt4dD-VThbBdnYRCxKD7Dpm0WuXydxVO7VdYSQnoWr3TNEmdVh7W-UwZQcKuZEIdRzqVXwQi5IFsSmuWrvxafgk3lzxRcrCudnX_90S7ZrtxH56Yc7z2ygmmNbP0AFdwn17bIx7Qcu8XqYKrpJKPm4jxnL86bsQirS8ydUepE40zpSJlnaVkNnh-Q187d4LZLK44EGjMmJzRABa4KgEcaY7tDZDwEwVFZx021Ex4JRIZMAQsUYzrxRBLrSOq20q6b8IAdktU0S_GIOBDYTyXAsA1-kjDpo_A5GIdBxcrlQZ1czZQXxhWAuOWxeA-LQAJkKCEsFVInF3PRjxI1Y5FQzSp0LjC725gNSGgs3aYvVIrZNA89YWZ1Dt4SCUuoxQCWSEgThoMQxwv7bpCN7uCxF_bu-w8nZLNCaKDgnpLVyXiKZ2Q9_pyM8vF5YXpfz43WXQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Routing+with+end-to-end+QoS+guarantees+in+broadband+networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Orda%2C+Ariel&rft.date=1999-06-01&rft.issn=1063-6692&rft.volume=7&rft.issue=3&rft.spage=365&rft.epage=374&rft_id=info:doi/10.1109%2F90.779205&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |