An asymptotically optimal push-pull method for multicasting over a random network

An asymptotically optimal push-pull method for multicasting over a random network

We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Swamy, V. N., Sundaresan, R., Viswanath, P.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bipartite graph
Educational institutions
Manganese
Network coding
Random variables
Relays
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 233
container_issue
container_start_page 229
container_title
container_volume
creator Swamy, V. N.
Sundaresan, R.
Viswanath, P.
description We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.
doi_str_mv 10.1109/ISIT.2012.6283922
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6283922</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6283922</ieee_id><sourcerecordid>6283922</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-97cbffe8558172845410b90fcf15f7e91b34e750b453358c469158f4c02cd3823</originalsourceid><addsrcrecordid>eNpNUEtLxDAYjC9wWfsDxEv-QGu-PJrkuCy6FhZEXM9LH4lbTZvSpkr_vV1cwbnMYYaZYRC6BZIAEH2fvWa7hBKgSUoV05SeoUhLBTyVjAqp2DlaUBAyVgDy4r-mSHr5pxEtrlE0DB9khjxaxQK9rFqcD1PTBR_qMnduwr4LdZM73I3DIe5G53BjwsFX2PoeN6M7-oZQt-_Yf5ke57jP28o3uDXh2_efN-jK5m4w0YmX6O3xYbd-irfPm2y92sb1XBxiLcvCWqOEUCCp4oIDKTSxpQVhpdFQMG6kIAUXjAlV8lSDUJaXhJYVU5Qt0d1vbm2M2Xf9vLmf9qeD2A-TylUP</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An asymptotically optimal push-pull method for multicasting over a random network</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Swamy, V. N. ; Sundaresan, R. ; Viswanath, P.</creator><creatorcontrib>Swamy, V. N. ; Sundaresan, R. ; Viswanath, P.</creatorcontrib><description>We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 9781467325806</identifier><identifier>ISBN: 1467325805</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 9781467325783</identifier><identifier>EISBN: 1467325791</identifier><identifier>EISBN: 9781467325790</identifier><identifier>EISBN: 1467325783</identifier><identifier>DOI: 10.1109/ISIT.2012.6283922</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bipartite graph ; Educational institutions ; Manganese ; Network coding ; Random variables ; Relays ; Upper bound</subject><ispartof>2012 IEEE International Symposium on Information Theory Proceedings, 2012, p.229-233</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/6283922$$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/6283922$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Swamy, V. N.</creatorcontrib><creatorcontrib>Sundaresan, R.</creatorcontrib><creatorcontrib>Viswanath, P.</creatorcontrib><title>An asymptotically optimal push-pull method for multicasting over a random network</title><title>2012 IEEE International Symposium on Information Theory Proceedings</title><addtitle>ISIT</addtitle><description>We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.</description><subject>Bipartite graph</subject><subject>Educational institutions</subject><subject>Manganese</subject><subject>Network coding</subject><subject>Random variables</subject><subject>Relays</subject><subject>Upper bound</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>9781467325806</isbn><isbn>1467325805</isbn><isbn>9781467325783</isbn><isbn>1467325791</isbn><isbn>9781467325790</isbn><isbn>1467325783</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpNUEtLxDAYjC9wWfsDxEv-QGu-PJrkuCy6FhZEXM9LH4lbTZvSpkr_vV1cwbnMYYaZYRC6BZIAEH2fvWa7hBKgSUoV05SeoUhLBTyVjAqp2DlaUBAyVgDy4r-mSHr5pxEtrlE0DB9khjxaxQK9rFqcD1PTBR_qMnduwr4LdZM73I3DIe5G53BjwsFX2PoeN6M7-oZQt-_Yf5ke57jP28o3uDXh2_efN-jK5m4w0YmX6O3xYbd-irfPm2y92sb1XBxiLcvCWqOEUCCp4oIDKTSxpQVhpdFQMG6kIAUXjAlV8lSDUJaXhJYVU5Qt0d1vbm2M2Xf9vLmf9qeD2A-TylUP</recordid><startdate>201207</startdate><enddate>201207</enddate><creator>Swamy, V. N.</creator><creator>Sundaresan, R.</creator><creator>Viswanath, P.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201207</creationdate><title>An asymptotically optimal push-pull method for multicasting over a random network</title><author>Swamy, V. N. ; Sundaresan, R. ; Viswanath, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-97cbffe8558172845410b90fcf15f7e91b34e750b453358c469158f4c02cd3823</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Bipartite graph</topic><topic>Educational institutions</topic><topic>Manganese</topic><topic>Network coding</topic><topic>Random variables</topic><topic>Relays</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Swamy, V. N.</creatorcontrib><creatorcontrib>Sundaresan, R.</creatorcontrib><creatorcontrib>Viswanath, P.</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Swamy, V. N.</au><au>Sundaresan, R.</au><au>Viswanath, P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An asymptotically optimal push-pull method for multicasting over a random network</atitle><btitle>2012 IEEE International Symposium on Information Theory Proceedings</btitle><stitle>ISIT</stitle><date>2012-07</date><risdate>2012</risdate><spage>229</spage><epage>233</epage><pages>229-233</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>9781467325806</isbn><isbn>1467325805</isbn><eisbn>9781467325783</eisbn><eisbn>1467325791</eisbn><eisbn>9781467325790</eisbn><eisbn>1467325783</eisbn><abstract>We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2012.6283922</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2157-8095
ispartof 2012 IEEE International Symposium on Information Theory Proceedings, 2012, p.229-233
issn 2157-8095
2157-8117
language eng
recordid cdi_ieee_primary_6283922
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bipartite graph
Educational institutions
Manganese
Network coding
Random variables
Relays
Upper bound
title An asymptotically optimal push-pull method for multicasting over a random network
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T18%3A43%3A36IST&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=An%20asymptotically%20optimal%20push-pull%20method%20for%20multicasting%20over%20a%20random%20network&rft.btitle=2012%20IEEE%20International%20Symposium%20on%20Information%20Theory%20Proceedings&rft.au=Swamy,%20V.%20N.&rft.date=2012-07&rft.spage=229&rft.epage=233&rft.pages=229-233&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=9781467325806&rft.isbn_list=1467325805&rft_id=info:doi/10.1109/ISIT.2012.6283922&rft_dat=%3Cieee_6IE%3E6283922%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467325783&rft.eisbn_list=1467325791&rft.eisbn_list=9781467325790&rft.eisbn_list=1467325783&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6283922&rfr_iscdi=true