The Stratified Shortest-Paths Problem (invited paper)
In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Strati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | 10 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Griffin, T.G. |
| description | In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used. |
| doi_str_mv | 10.1109/COMSNETS.2010.5432000 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5432000</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5432000</ieee_id><sourcerecordid>5432000</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1370-ece793c6ae5f3ebb54ac6efcb7bc9a0397970bc18e60275734fe8160b10459d53</originalsourceid><addsrcrecordid>eNpVkE1Lw0AQhtePgrXmF4iQox5SZ78y2aOE-gHVFhLPZTedkJXWhs0i-O8NWA-ehpmH92F4GbvhMOcczH25eq3eFnU1FzCetJICAE5YYrDgSiilVVGoUzYVXOtMaDBn_xji-R8blwm7HOPGSEQhL1gyDB-jDZQWoHHKdN1RWsVgo289bdOqO4RIQ8zWNnZDug4Ht6N9eus_v3wceW97CndXbNLa3UDJcc7Y--OiLp-z5erppXxYZp5LhIwaQiOb3JJuJTmnlW1yahuHrjEWpEGD4BpeUA4CNUrVUsFzcHz8z2y1nLHrX68nok0f_N6G782xEfkDoBVNhQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>The Stratified Shortest-Paths Problem (invited paper)</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Griffin, T.G.</creator><creatorcontrib>Griffin, T.G.</creatorcontrib><description>In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.</description><identifier>ISSN: 2155-2487</identifier><identifier>ISBN: 9781424454877</identifier><identifier>ISBN: 1424454875</identifier><identifier>EISSN: 2155-2509</identifier><identifier>EISBN: 9781424454884</identifier><identifier>EISBN: 1424454891</identifier><identifier>EISBN: 9781424454891</identifier><identifier>EISBN: 1424454883</identifier><identifier>DOI: 10.1109/COMSNETS.2010.5432000</identifier><identifier>LCCN: 2009937723</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algebra ; Internet ; Laboratories ; Operations research ; Routing protocols ; Shortest path problem</subject><ispartof>2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010), 2010, p.1-10</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5432000$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5432000$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Griffin, T.G.</creatorcontrib><title>The Stratified Shortest-Paths Problem (invited paper)</title><title>2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)</title><addtitle>COMSNETS</addtitle><description>In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.</description><subject>Algebra</subject><subject>Internet</subject><subject>Laboratories</subject><subject>Operations research</subject><subject>Routing protocols</subject><subject>Shortest path problem</subject><issn>2155-2487</issn><issn>2155-2509</issn><isbn>9781424454877</isbn><isbn>1424454875</isbn><isbn>9781424454884</isbn><isbn>1424454891</isbn><isbn>9781424454891</isbn><isbn>1424454883</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkE1Lw0AQhtePgrXmF4iQox5SZ78y2aOE-gHVFhLPZTedkJXWhs0i-O8NWA-ehpmH92F4GbvhMOcczH25eq3eFnU1FzCetJICAE5YYrDgSiilVVGoUzYVXOtMaDBn_xji-R8blwm7HOPGSEQhL1gyDB-jDZQWoHHKdN1RWsVgo289bdOqO4RIQ8zWNnZDug4Ht6N9eus_v3wceW97CndXbNLa3UDJcc7Y--OiLp-z5erppXxYZp5LhIwaQiOb3JJuJTmnlW1yahuHrjEWpEGD4BpeUA4CNUrVUsFzcHz8z2y1nLHrX68nok0f_N6G782xEfkDoBVNhQ</recordid><startdate>201001</startdate><enddate>201001</enddate><creator>Griffin, T.G.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201001</creationdate><title>The Stratified Shortest-Paths Problem (invited paper)</title><author>Griffin, T.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1370-ece793c6ae5f3ebb54ac6efcb7bc9a0397970bc18e60275734fe8160b10459d53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algebra</topic><topic>Internet</topic><topic>Laboratories</topic><topic>Operations research</topic><topic>Routing protocols</topic><topic>Shortest path problem</topic><toplevel>online_resources</toplevel><creatorcontrib>Griffin, T.G.</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>Griffin, T.G.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>The Stratified Shortest-Paths Problem (invited paper)</atitle><btitle>2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)</btitle><stitle>COMSNETS</stitle><date>2010-01</date><risdate>2010</risdate><spage>1</spage><epage>10</epage><pages>1-10</pages><issn>2155-2487</issn><eissn>2155-2509</eissn><isbn>9781424454877</isbn><isbn>1424454875</isbn><eisbn>9781424454884</eisbn><eisbn>1424454891</eisbn><eisbn>9781424454891</eisbn><eisbn>1424454883</eisbn><abstract>In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.</abstract><pub>IEEE</pub><doi>10.1109/COMSNETS.2010.5432000</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2155-2487 |
| ispartof | 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010), 2010, p.1-10 |
| issn | 2155-2487 2155-2509 |
| language | eng |
| recordid | cdi_ieee_primary_5432000 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algebra Internet Laboratories Operations research Routing protocols Shortest path problem |
| title | The Stratified Shortest-Paths Problem (invited paper) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A35%3A35IST&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=The%20Stratified%20Shortest-Paths%20Problem%20(invited%20paper)&rft.btitle=2010%20Second%20International%20Conference%20on%20COMmunication%20Systems%20and%20NETworks%20(COMSNETS%202010)&rft.au=Griffin,%20T.G.&rft.date=2010-01&rft.spage=1&rft.epage=10&rft.pages=1-10&rft.issn=2155-2487&rft.eissn=2155-2509&rft.isbn=9781424454877&rft.isbn_list=1424454875&rft_id=info:doi/10.1109/COMSNETS.2010.5432000&rft_dat=%3Cieee_6IE%3E5432000%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424454884&rft.eisbn_list=1424454891&rft.eisbn_list=9781424454891&rft.eisbn_list=1424454883&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5432000&rfr_iscdi=true |