Multicast routing algorithms for Manhattan Street Network
In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicas...
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 | 404 |
|---|---|
| container_issue | |
| container_start_page | 397 |
| container_title | |
| container_volume | |
| creator | Hoyoung Hwang Hyoungjun Kim Yanghee Choi Chongsang Kim |
| description | In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicast tree which is determined at each routing time. The detailed algorithms and simulation results are presented in this paper. The performance curves obtained show that the proposed algorithms are feasible and practical solutions for the multicast routing over MSN. |
| doi_str_mv | 10.1109/EURMIC.1996.546463 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_546463</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>546463</ieee_id><sourcerecordid>546463</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-27f69014f029227b662a2e7b428bd262395fe1e8fdd1fb770ce530c33e3ede123</originalsourceid><addsrcrecordid>eNotj8tKw0AUQAcfYKz9ga7yA4lz5z1LCdUWGgWt6zJJ7rSjaSKTKeLfK9SzObsDh5AF0BKA2vvl-2u9rkqwVpVSKKH4BckY16qwkspLcksNGKWF0fyKZECNLZSk_IbMp-mD_iEkgJAZsfWpT6F1U8rjeEph2Oeu348xpMNxyv0Y89oNB5eSG_K3FBFT_ozpe4yfd-Tau37C-b9nZPu43FarYvPytK4eNkUwNhVMe2UpCE-ZZUw3SjHHUDeCmaZjinErPQIa33XgG61pi5LTlnPk2CEwPiOLczYg4u4rhqOLP7vzM_8FrbRJIg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Multicast routing algorithms for Manhattan Street Network</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hoyoung Hwang ; Hyoungjun Kim ; Yanghee Choi ; Chongsang Kim</creator><creatorcontrib>Hoyoung Hwang ; Hyoungjun Kim ; Yanghee Choi ; Chongsang Kim</creatorcontrib><description>In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicast tree which is determined at each routing time. The detailed algorithms and simulation results are presented in this paper. The performance curves obtained show that the proposed algorithms are feasible and practical solutions for the multicast routing over MSN.</description><identifier>ISSN: 1089-6503</identifier><identifier>ISBN: 0818674873</identifier><identifier>ISBN: 9780818674877</identifier><identifier>EISSN: 2376-9505</identifier><identifier>DOI: 10.1109/EURMIC.1996.546463</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer networks ; Data mining ; Mesh networks ; Multicast algorithms ; Network topology ; Road accidents ; Routing ; Scalability ; Telecommunication network reliability ; Throughput</subject><ispartof>Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies, 1996, p.397-404</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/546463$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,4049,4050,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/546463$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hoyoung Hwang</creatorcontrib><creatorcontrib>Hyoungjun Kim</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Chongsang Kim</creatorcontrib><title>Multicast routing algorithms for Manhattan Street Network</title><title>Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies</title><addtitle>EURMIC</addtitle><description>In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicast tree which is determined at each routing time. The detailed algorithms and simulation results are presented in this paper. The performance curves obtained show that the proposed algorithms are feasible and practical solutions for the multicast routing over MSN.</description><subject>Computer networks</subject><subject>Data mining</subject><subject>Mesh networks</subject><subject>Multicast algorithms</subject><subject>Network topology</subject><subject>Road accidents</subject><subject>Routing</subject><subject>Scalability</subject><subject>Telecommunication network reliability</subject><subject>Throughput</subject><issn>1089-6503</issn><issn>2376-9505</issn><isbn>0818674873</isbn><isbn>9780818674877</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1996</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tKw0AUQAcfYKz9ga7yA4lz5z1LCdUWGgWt6zJJ7rSjaSKTKeLfK9SzObsDh5AF0BKA2vvl-2u9rkqwVpVSKKH4BckY16qwkspLcksNGKWF0fyKZECNLZSk_IbMp-mD_iEkgJAZsfWpT6F1U8rjeEph2Oeu348xpMNxyv0Y89oNB5eSG_K3FBFT_ozpe4yfd-Tau37C-b9nZPu43FarYvPytK4eNkUwNhVMe2UpCE-ZZUw3SjHHUDeCmaZjinErPQIa33XgG61pi5LTlnPk2CEwPiOLczYg4u4rhqOLP7vzM_8FrbRJIg</recordid><startdate>1996</startdate><enddate>1996</enddate><creator>Hoyoung Hwang</creator><creator>Hyoungjun Kim</creator><creator>Yanghee Choi</creator><creator>Chongsang Kim</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1996</creationdate><title>Multicast routing algorithms for Manhattan Street Network</title><author>Hoyoung Hwang ; Hyoungjun Kim ; Yanghee Choi ; Chongsang Kim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-27f69014f029227b662a2e7b428bd262395fe1e8fdd1fb770ce530c33e3ede123</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Computer networks</topic><topic>Data mining</topic><topic>Mesh networks</topic><topic>Multicast algorithms</topic><topic>Network topology</topic><topic>Road accidents</topic><topic>Routing</topic><topic>Scalability</topic><topic>Telecommunication network reliability</topic><topic>Throughput</topic><toplevel>online_resources</toplevel><creatorcontrib>Hoyoung Hwang</creatorcontrib><creatorcontrib>Hyoungjun Kim</creatorcontrib><creatorcontrib>Yanghee Choi</creatorcontrib><creatorcontrib>Chongsang 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 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>Hoyoung Hwang</au><au>Hyoungjun Kim</au><au>Yanghee Choi</au><au>Chongsang Kim</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Multicast routing algorithms for Manhattan Street Network</atitle><btitle>Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies</btitle><stitle>EURMIC</stitle><date>1996</date><risdate>1996</risdate><spage>397</spage><epage>404</epage><pages>397-404</pages><issn>1089-6503</issn><eissn>2376-9505</eissn><isbn>0818674873</isbn><isbn>9780818674877</isbn><abstract>In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicast tree which is determined at each routing time. The detailed algorithms and simulation results are presented in this paper. The performance curves obtained show that the proposed algorithms are feasible and practical solutions for the multicast routing over MSN.</abstract><pub>IEEE</pub><doi>10.1109/EURMIC.1996.546463</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-6503 |
| ispartof | Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies, 1996, p.397-404 |
| issn | 1089-6503 2376-9505 |
| language | eng |
| recordid | cdi_ieee_primary_546463 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer networks Data mining Mesh networks Multicast algorithms Network topology Road accidents Routing Scalability Telecommunication network reliability Throughput |
| title | Multicast routing algorithms for Manhattan Street Network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T15%3A53%3A16IST&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=Multicast%20routing%20algorithms%20for%20Manhattan%20Street%20Network&rft.btitle=Proceedings%20of%20EUROMICRO%2096.%2022nd%20Euromicro%20Conference.%20Beyond%202000:%20Hardware%20and%20Software%20Design%20Strategies&rft.au=Hoyoung%20Hwang&rft.date=1996&rft.spage=397&rft.epage=404&rft.pages=397-404&rft.issn=1089-6503&rft.eissn=2376-9505&rft.isbn=0818674873&rft.isbn_list=9780818674877&rft_id=info:doi/10.1109/EURMIC.1996.546463&rft_dat=%3Cieee_6IE%3E546463%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=546463&rfr_iscdi=true |