A new approach for scaling QoS routing algorithms
The paper studies the issue of scaling quality of service (QoS) routing algorithms to large-scale networks using partitioning. In particular, the paper focuses on a new approach which we call stochastic partitioning. We investigate the performance of this technique and develop an intelligent partiti...
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 | 1162 Vol.2 |
|---|---|
| container_issue | |
| container_start_page | 1157 |
| container_title | |
| container_volume | 2 |
| creator | Deb, S.S. Woodward, M.E. |
| description | The paper studies the issue of scaling quality of service (QoS) routing algorithms to large-scale networks using partitioning. In particular, the paper focuses on a new approach which we call stochastic partitioning. We investigate the performance of this technique and develop an intelligent partitioning strategy that reduces the computational effort in routing, usually by orders of magnitude. The trade-off is an increase in QoS blocking probability (probability of failure to find a path that satisfies the QoS constraints). Finally, simulation results are produced which demonstrate the benefits and some practical limitations of stochastic partitioning. |
| doi_str_mv | 10.1109/GLOCOM.2004.1378138 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_pascalfrancis_primary_18142768</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1378138</ieee_id><sourcerecordid>18142768</sourcerecordid><originalsourceid>FETCH-LOGICAL-i135t-db0657a429fef56f06ff4cb36feaa3d49d32cd5d811a18d63b3578a363bd2ee73</originalsourceid><addsrcrecordid>eNpFkE9Lw0AQxRdEUGo-QS978Zi4k_2bYwlahUoQ9Vwm2d12JU3CJiJ-e1NScBiYH8zj8XiErIFlAKx42O6qsnrNcsZEBlwb4OaKJIU2bF5udCHyG5KM4xebR0gBytwS2NDO_VAchthjc6S-j3RssA3dgb717zT239OZsT30MUzH03hHrj22o0sud0U-nx4_yud0V21fys0uDcDllNqaKalR5IV3XirPlPeiqbnyDpFbUVieN1ZaA4BgrOI1l9ogn8Hmzmm-IveL74DnQD5i14RxP8Rwwvi7BwMi18rMuvWiC865__dSAP8D8VxQeg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A new approach for scaling QoS routing algorithms</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Deb, S.S. ; Woodward, M.E.</creator><creatorcontrib>Deb, S.S. ; Woodward, M.E.</creatorcontrib><description>The paper studies the issue of scaling quality of service (QoS) routing algorithms to large-scale networks using partitioning. In particular, the paper focuses on a new approach which we call stochastic partitioning. We investigate the performance of this technique and develop an intelligent partitioning strategy that reduces the computational effort in routing, usually by orders of magnitude. The trade-off is an increase in QoS blocking probability (probability of failure to find a path that satisfies the QoS constraints). Finally, simulation results are produced which demonstrate the benefits and some practical limitations of stochastic partitioning.</description><identifier>ISBN: 9780780387942</identifier><identifier>ISBN: 0780387945</identifier><identifier>DOI: 10.1109/GLOCOM.2004.1378138</identifier><language>eng</language><publisher>Piscataway, New Jersey: IEEE</publisher><subject>Applied sciences ; Computational intelligence ; Computational modeling ; Computer networks ; Exact sciences and technology ; IP networks ; Large-scale systems ; Operation, maintenance, reliability ; Partitioning algorithms ; Quality of service ; Routing ; Scalability ; Stochastic processes ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments)</subject><ispartof>IEEE Global Telecommunications Conference, 2004. GLOBECOM '04, 2004, Vol.2, p.1157-1162 Vol.2</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1378138$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1378138$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18142768$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Deb, S.S.</creatorcontrib><creatorcontrib>Woodward, M.E.</creatorcontrib><title>A new approach for scaling QoS routing algorithms</title><title>IEEE Global Telecommunications Conference, 2004. GLOBECOM '04</title><addtitle>GLOCOM</addtitle><description>The paper studies the issue of scaling quality of service (QoS) routing algorithms to large-scale networks using partitioning. In particular, the paper focuses on a new approach which we call stochastic partitioning. We investigate the performance of this technique and develop an intelligent partitioning strategy that reduces the computational effort in routing, usually by orders of magnitude. The trade-off is an increase in QoS blocking probability (probability of failure to find a path that satisfies the QoS constraints). Finally, simulation results are produced which demonstrate the benefits and some practical limitations of stochastic partitioning.</description><subject>Applied sciences</subject><subject>Computational intelligence</subject><subject>Computational modeling</subject><subject>Computer networks</subject><subject>Exact sciences and technology</subject><subject>IP networks</subject><subject>Large-scale systems</subject><subject>Operation, maintenance, reliability</subject><subject>Partitioning algorithms</subject><subject>Quality of service</subject><subject>Routing</subject><subject>Scalability</subject><subject>Stochastic processes</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><isbn>9780780387942</isbn><isbn>0780387945</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkE9Lw0AQxRdEUGo-QS978Zi4k_2bYwlahUoQ9Vwm2d12JU3CJiJ-e1NScBiYH8zj8XiErIFlAKx42O6qsnrNcsZEBlwb4OaKJIU2bF5udCHyG5KM4xebR0gBytwS2NDO_VAchthjc6S-j3RssA3dgb717zT239OZsT30MUzH03hHrj22o0sud0U-nx4_yud0V21fys0uDcDllNqaKalR5IV3XirPlPeiqbnyDpFbUVieN1ZaA4BgrOI1l9ogn8Hmzmm-IveL74DnQD5i14RxP8Rwwvi7BwMi18rMuvWiC865__dSAP8D8VxQeg</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Deb, S.S.</creator><creator>Woodward, M.E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A new approach for scaling QoS routing algorithms</title><author>Deb, S.S. ; Woodward, M.E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i135t-db0657a429fef56f06ff4cb36feaa3d49d32cd5d811a18d63b3578a363bd2ee73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computational intelligence</topic><topic>Computational modeling</topic><topic>Computer networks</topic><topic>Exact sciences and technology</topic><topic>IP networks</topic><topic>Large-scale systems</topic><topic>Operation, maintenance, reliability</topic><topic>Partitioning algorithms</topic><topic>Quality of service</topic><topic>Routing</topic><topic>Scalability</topic><topic>Stochastic processes</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><toplevel>online_resources</toplevel><creatorcontrib>Deb, S.S.</creatorcontrib><creatorcontrib>Woodward, M.E.</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><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Deb, S.S.</au><au>Woodward, M.E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A new approach for scaling QoS routing algorithms</atitle><btitle>IEEE Global Telecommunications Conference, 2004. GLOBECOM '04</btitle><stitle>GLOCOM</stitle><date>2004</date><risdate>2004</risdate><volume>2</volume><spage>1157</spage><epage>1162 Vol.2</epage><pages>1157-1162 Vol.2</pages><isbn>9780780387942</isbn><isbn>0780387945</isbn><abstract>The paper studies the issue of scaling quality of service (QoS) routing algorithms to large-scale networks using partitioning. In particular, the paper focuses on a new approach which we call stochastic partitioning. We investigate the performance of this technique and develop an intelligent partitioning strategy that reduces the computational effort in routing, usually by orders of magnitude. The trade-off is an increase in QoS blocking probability (probability of failure to find a path that satisfies the QoS constraints). Finally, simulation results are produced which demonstrate the benefits and some practical limitations of stochastic partitioning.</abstract><cop>Piscataway, New Jersey</cop><pub>IEEE</pub><doi>10.1109/GLOCOM.2004.1378138</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780780387942 |
| ispartof | IEEE Global Telecommunications Conference, 2004. GLOBECOM '04, 2004, Vol.2, p.1157-1162 Vol.2 |
| issn | |
| language | eng |
| recordid | cdi_pascalfrancis_primary_18142768 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Applied sciences Computational intelligence Computational modeling Computer networks Exact sciences and technology IP networks Large-scale systems Operation, maintenance, reliability Partitioning algorithms Quality of service Routing Scalability Stochastic processes Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) |
| title | A new approach for scaling QoS routing algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A00%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20new%20approach%20for%20scaling%20QoS%20routing%20algorithms&rft.btitle=IEEE%20Global%20Telecommunications%20Conference,%202004.%20GLOBECOM%20'04&rft.au=Deb,%20S.S.&rft.date=2004&rft.volume=2&rft.spage=1157&rft.epage=1162%20Vol.2&rft.pages=1157-1162%20Vol.2&rft.isbn=9780780387942&rft.isbn_list=0780387945&rft_id=info:doi/10.1109/GLOCOM.2004.1378138&rft_dat=%3Cpascalfrancis_6IE%3E18142768%3C/pascalfrancis_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=1378138&rfr_iscdi=true |