Routing algorithms based on 2D turn model for irregular networks
In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns f...
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 | 294 |
|---|---|
| container_issue | |
| container_start_page | 289 |
| container_title | |
| container_volume | |
| creator | Jouraku, A. Koibuchi, M. Amano, H. Funahashi, A. |
| description | In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks. |
| doi_str_mv | 10.1109/ISPAN.2002.1004296 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1004296</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1004296</ieee_id><sourcerecordid>1004296</sourcerecordid><originalsourceid>FETCH-LOGICAL-i217t-fbcc5a00fef0169bfb3c15ed89904b9afec570bf01318ced4fc199d0c6619d8b3</originalsourceid><addsrcrecordid>eNotj9lKw0AYRgcXsNa-gN7MCyT-M8lsd5a6FYqKC3hXZo3RJCMzCeLbW7Dfzbk4cOBD6JxASQioy_XL0_KhpAC0JAA1VfwAzWglWMGoeD9EpyC4YoQJJY7QjIAURQ1SnaBFzp-wG2OS12KGrp7jNLZDg3XXxNSOH33GRmfvcBwwvcbjlAbcR-c7HGLCbUq-mTqd8ODHn5i-8hk6DrrLfrHnHL3d3ryu7ovN4916tdwULSViLIKxlmmA4AMQrkwwlSXMO6kU1Ebp4C0TYHayItJ6VwdLlHJgOSfKSVPN0cV_t_Xeb79T2-v0u92fr_4ArlpM2w</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Routing algorithms based on 2D turn model for irregular networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jouraku, A. ; Koibuchi, M. ; Amano, H. ; Funahashi, A.</creator><creatorcontrib>Jouraku, A. ; Koibuchi, M. ; Amano, H. ; Funahashi, A.</creatorcontrib><description>In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.</description><identifier>ISSN: 1087-4089</identifier><identifier>ISBN: 0769515797</identifier><identifier>ISBN: 9780769515793</identifier><identifier>EISSN: 2375-527X</identifier><identifier>DOI: 10.1109/ISPAN.2002.1004296</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Computer science ; Electronic mail ; Information technology ; Routing ; Switches ; System recovery ; Telecommunication traffic ; Traffic control ; Tree graphs</subject><ispartof>Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02, 2002, p.289-294</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/1004296$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1004296$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jouraku, A.</creatorcontrib><creatorcontrib>Koibuchi, M.</creatorcontrib><creatorcontrib>Amano, H.</creatorcontrib><creatorcontrib>Funahashi, A.</creatorcontrib><title>Routing algorithms based on 2D turn model for irregular networks</title><title>Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02</title><addtitle>ISPAN</addtitle><description>In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.</description><subject>Bandwidth</subject><subject>Computer science</subject><subject>Electronic mail</subject><subject>Information technology</subject><subject>Routing</subject><subject>Switches</subject><subject>System recovery</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Tree graphs</subject><issn>1087-4089</issn><issn>2375-527X</issn><isbn>0769515797</isbn><isbn>9780769515793</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2002</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj9lKw0AYRgcXsNa-gN7MCyT-M8lsd5a6FYqKC3hXZo3RJCMzCeLbW7Dfzbk4cOBD6JxASQioy_XL0_KhpAC0JAA1VfwAzWglWMGoeD9EpyC4YoQJJY7QjIAURQ1SnaBFzp-wG2OS12KGrp7jNLZDg3XXxNSOH33GRmfvcBwwvcbjlAbcR-c7HGLCbUq-mTqd8ODHn5i-8hk6DrrLfrHnHL3d3ryu7ovN4916tdwULSViLIKxlmmA4AMQrkwwlSXMO6kU1Ebp4C0TYHayItJ6VwdLlHJgOSfKSVPN0cV_t_Xeb79T2-v0u92fr_4ArlpM2w</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Jouraku, A.</creator><creator>Koibuchi, M.</creator><creator>Amano, H.</creator><creator>Funahashi, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2002</creationdate><title>Routing algorithms based on 2D turn model for irregular networks</title><author>Jouraku, A. ; Koibuchi, M. ; Amano, H. ; Funahashi, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i217t-fbcc5a00fef0169bfb3c15ed89904b9afec570bf01318ced4fc199d0c6619d8b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Bandwidth</topic><topic>Computer science</topic><topic>Electronic mail</topic><topic>Information technology</topic><topic>Routing</topic><topic>Switches</topic><topic>System recovery</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Tree graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Jouraku, A.</creatorcontrib><creatorcontrib>Koibuchi, M.</creatorcontrib><creatorcontrib>Amano, H.</creatorcontrib><creatorcontrib>Funahashi, A.</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>Jouraku, A.</au><au>Koibuchi, M.</au><au>Amano, H.</au><au>Funahashi, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Routing algorithms based on 2D turn model for irregular networks</atitle><btitle>Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02</btitle><stitle>ISPAN</stitle><date>2002</date><risdate>2002</risdate><spage>289</spage><epage>294</epage><pages>289-294</pages><issn>1087-4089</issn><eissn>2375-527X</eissn><isbn>0769515797</isbn><isbn>9780769515793</isbn><abstract>In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.</abstract><pub>IEEE</pub><doi>10.1109/ISPAN.2002.1004296</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1087-4089 |
| ispartof | Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02, 2002, p.289-294 |
| issn | 1087-4089 2375-527X |
| language | eng |
| recordid | cdi_ieee_primary_1004296 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bandwidth Computer science Electronic mail Information technology Routing Switches System recovery Telecommunication traffic Traffic control Tree graphs |
| title | Routing algorithms based on 2D turn model for irregular networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T09%3A46%3A33IST&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=Routing%20algorithms%20based%20on%202D%20turn%20model%20for%20irregular%20networks&rft.btitle=Proceedings%20International%20Symposium%20on%20Parallel%20Architectures,%20Algorithms%20and%20Networks.%20I-SPAN'02&rft.au=Jouraku,%20A.&rft.date=2002&rft.spage=289&rft.epage=294&rft.pages=289-294&rft.issn=1087-4089&rft.eissn=2375-527X&rft.isbn=0769515797&rft.isbn_list=9780769515793&rft_id=info:doi/10.1109/ISPAN.2002.1004296&rft_dat=%3Cieee_6IE%3E1004296%3C/ieee_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=1004296&rfr_iscdi=true |