Optimal contention-free unicast-based multicasting in switch-based networks of workstations

A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts...

Full description

Saved in:
Bibliographic Details
Main Authors: Libeskind-Hadas, R., Mazzoni, D., Rajagopalan, R.
Format: Conference Proceeding
Language:English
Subjects:
Communication switching
Delay
Hardware
Intelligent networks
Multicast algorithms
Routing
Switches
System recovery
Unicast
Workstations
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 364
container_issue
container_start_page 358
container_title
container_volume
creator Libeskind-Hadas, R.
Mazzoni, D.
Rajagopalan, R.
description A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.
doi_str_mv 10.1109/IPPS.1998.669940
format conference_proceeding
fullrecord <record><control><sourceid>proquest_CHZPO</sourceid><recordid>TN_cdi_proquest_miscellaneous_26725021</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>669940</ieee_id><sourcerecordid>26725021</sourcerecordid><originalsourceid>FETCH-LOGICAL-i273t-476bbdf7d3b4dddb3d1777fa0d5077a4621acf23f7967076f90091159602fc693</originalsourceid><addsrcrecordid>eNotUMFKAzEUDKhgW72Lp5y8bX1JdvM2RylaC4UW1JOHJbtJNLrN1k2W4t9b255mhhkGZgi5YTBlDNT9Yr1-mTKlyqmUSuVwRsZQslKWOeTynIwYSJEhE-KSjGP8AuAgCjki76tt8hvd0qYLyYbku5C53lo6BN_omLJaR2voZmjTQfvwQX2gcedT83kyg027rv-OtHP0QJL-74lX5MLpNtrrE07I29Pj6-w5W67mi9nDMvMcRcpylHVtHBpR58aYWhiGiE6DKQBR55Iz3TguHCqJgNIpAMVYoSRw10glJuTu2Lvtu5_BxlRtfGxs2-pguyFWXCIvgLN98PYY9Nbaatvvh_e_1fEw8Qf2b2Db</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>26725021</pqid></control><display><type>conference_proceeding</type><title>Optimal contention-free unicast-based multicasting in switch-based networks of workstations</title><source>IEEE Xplore All Conference Series</source><creator>Libeskind-Hadas, R. ; Mazzoni, D. ; Rajagopalan, R.</creator><creatorcontrib>Libeskind-Hadas, R. ; Mazzoni, D. ; Rajagopalan, R.</creatorcontrib><description>A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.</description><identifier>ISSN: 1063-7133</identifier><identifier>ISBN: 0818684046</identifier><identifier>ISBN: 9780818684043</identifier><identifier>DOI: 10.1109/IPPS.1998.669940</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communication switching ; Delay ; Hardware ; Intelligent networks ; Multicast algorithms ; Routing ; Switches ; System recovery ; Unicast ; Workstations</subject><ispartof>Proceedings - International Parallel Processing Symposium, 1998, p.358-364</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/669940$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,4050,4051,23930,23931,25140,27924,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/669940$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Libeskind-Hadas, R.</creatorcontrib><creatorcontrib>Mazzoni, D.</creatorcontrib><creatorcontrib>Rajagopalan, R.</creatorcontrib><title>Optimal contention-free unicast-based multicasting in switch-based networks of workstations</title><title>Proceedings - International Parallel Processing Symposium</title><addtitle>IPPS</addtitle><description>A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.</description><subject>Communication switching</subject><subject>Delay</subject><subject>Hardware</subject><subject>Intelligent networks</subject><subject>Multicast algorithms</subject><subject>Routing</subject><subject>Switches</subject><subject>System recovery</subject><subject>Unicast</subject><subject>Workstations</subject><issn>1063-7133</issn><isbn>0818684046</isbn><isbn>9780818684043</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotUMFKAzEUDKhgW72Lp5y8bX1JdvM2RylaC4UW1JOHJbtJNLrN1k2W4t9b255mhhkGZgi5YTBlDNT9Yr1-mTKlyqmUSuVwRsZQslKWOeTynIwYSJEhE-KSjGP8AuAgCjki76tt8hvd0qYLyYbku5C53lo6BN_omLJaR2voZmjTQfvwQX2gcedT83kyg027rv-OtHP0QJL-74lX5MLpNtrrE07I29Pj6-w5W67mi9nDMvMcRcpylHVtHBpR58aYWhiGiE6DKQBR55Iz3TguHCqJgNIpAMVYoSRw10glJuTu2Lvtu5_BxlRtfGxs2-pguyFWXCIvgLN98PYY9Nbaatvvh_e_1fEw8Qf2b2Db</recordid><startdate>1998</startdate><enddate>1998</enddate><creator>Libeskind-Hadas, R.</creator><creator>Mazzoni, D.</creator><creator>Rajagopalan, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1998</creationdate><title>Optimal contention-free unicast-based multicasting in switch-based networks of workstations</title><author>Libeskind-Hadas, R. ; Mazzoni, D. ; Rajagopalan, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i273t-476bbdf7d3b4dddb3d1777fa0d5077a4621acf23f7967076f90091159602fc693</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Communication switching</topic><topic>Delay</topic><topic>Hardware</topic><topic>Intelligent networks</topic><topic>Multicast algorithms</topic><topic>Routing</topic><topic>Switches</topic><topic>System recovery</topic><topic>Unicast</topic><topic>Workstations</topic><toplevel>online_resources</toplevel><creatorcontrib>Libeskind-Hadas, R.</creatorcontrib><creatorcontrib>Mazzoni, D.</creatorcontrib><creatorcontrib>Rajagopalan, R.</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/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Libeskind-Hadas, R.</au><au>Mazzoni, D.</au><au>Rajagopalan, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimal contention-free unicast-based multicasting in switch-based networks of workstations</atitle><btitle>Proceedings - International Parallel Processing Symposium</btitle><stitle>IPPS</stitle><date>1998</date><risdate>1998</risdate><spage>358</spage><epage>364</epage><pages>358-364</pages><issn>1063-7133</issn><isbn>0818684046</isbn><isbn>9780818684043</isbn><abstract>A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.</abstract><pub>IEEE</pub><doi>10.1109/IPPS.1998.669940</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-7133
ispartof Proceedings - International Parallel Processing Symposium, 1998, p.358-364
issn 1063-7133
language eng
recordid cdi_proquest_miscellaneous_26725021
source IEEE Xplore All Conference Series
subjects Communication switching
Delay
Hardware
Intelligent networks
Multicast algorithms
Routing
Switches
System recovery
Unicast
Workstations
title Optimal contention-free unicast-based multicasting in switch-based networks of workstations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T04%3A28%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimal%20contention-free%20unicast-based%20multicasting%20in%20switch-based%20networks%20of%20workstations&rft.btitle=Proceedings%20-%20International%20Parallel%20Processing%20Symposium&rft.au=Libeskind-Hadas,%20R.&rft.date=1998&rft.spage=358&rft.epage=364&rft.pages=358-364&rft.issn=1063-7133&rft.isbn=0818684046&rft.isbn_list=9780818684043&rft_id=info:doi/10.1109/IPPS.1998.669940&rft_dat=%3Cproquest_CHZPO%3E26725021%3C/proquest_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i273t-476bbdf7d3b4dddb3d1777fa0d5077a4621acf23f7967076f90091159602fc693%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=26725021&rft_id=info:pmid/&rft_ieee_id=669940&rfr_iscdi=true