An asymptotically optimal push-pull method for multicasting over a random network
We consider allcast and 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....
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Swamy, Vasuki Narasimha Bhashyam, Srikrishna Sundaresan, Rajesh Viswanath, Pramod |
| description | We consider allcast and 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 links 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 without network coding. |
| doi_str_mv | 10.48550/arxiv.1210.3187 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1210_3187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1210_3187</sourcerecordid><originalsourceid>FETCH-LOGICAL-a657-9c13d20fc2f81019a53b0fce0ec64c88c93d0b317537a3bc89396a7e47fa0d923</originalsourceid><addsrcrecordid>eNotjz1rwzAYhLV0KGn3TkV_wKlkWZY0htAvCJRCdvNaH4mJZBlZTut_X7vtdNxxHPcg9EDJtpKckydI3911S8slYFSKW_S56zGMcxhyzJ0G72cch9wF8HiYxnMxTN7jYPM5GuxiwmHya2_MXX_C8WoTBpygNzHg3uavmC536MaBH-39v27Q8eX5uH8rDh-v7_vdoYCai0JpykxJnC6dpIQq4KxdnCVW15WWUitmSMuo4EwAa7VUTNUgbCUcEKNKtkGPf7O_SM2Qls9pbla0ZkVjP8-BSnY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An asymptotically optimal push-pull method for multicasting over a random network</title><source>arXiv.org</source><creator>Swamy, Vasuki Narasimha ; Bhashyam, Srikrishna ; Sundaresan, Rajesh ; Viswanath, Pramod</creator><creatorcontrib>Swamy, Vasuki Narasimha ; Bhashyam, Srikrishna ; Sundaresan, Rajesh ; Viswanath, Pramod</creatorcontrib><description>We consider allcast and 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 links 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 without network coding.</description><identifier>DOI: 10.48550/arxiv.1210.3187</identifier><language>eng</language><subject>Computer Science - Information Theory ; Computer Science - Networking and Internet Architecture ; Mathematics - Information Theory</subject><creationdate>2012-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1210.3187$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1210.3187$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Swamy, Vasuki Narasimha</creatorcontrib><creatorcontrib>Bhashyam, Srikrishna</creatorcontrib><creatorcontrib>Sundaresan, Rajesh</creatorcontrib><creatorcontrib>Viswanath, Pramod</creatorcontrib><title>An asymptotically optimal push-pull method for multicasting over a random network</title><description>We consider allcast and 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 links 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 without network coding.</description><subject>Computer Science - Information Theory</subject><subject>Computer Science - Networking and Internet Architecture</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjz1rwzAYhLV0KGn3TkV_wKlkWZY0htAvCJRCdvNaH4mJZBlZTut_X7vtdNxxHPcg9EDJtpKckydI3911S8slYFSKW_S56zGMcxhyzJ0G72cch9wF8HiYxnMxTN7jYPM5GuxiwmHya2_MXX_C8WoTBpygNzHg3uavmC536MaBH-39v27Q8eX5uH8rDh-v7_vdoYCai0JpykxJnC6dpIQq4KxdnCVW15WWUitmSMuo4EwAa7VUTNUgbCUcEKNKtkGPf7O_SM2Qls9pbla0ZkVjP8-BSnY</recordid><startdate>20121011</startdate><enddate>20121011</enddate><creator>Swamy, Vasuki Narasimha</creator><creator>Bhashyam, Srikrishna</creator><creator>Sundaresan, Rajesh</creator><creator>Viswanath, Pramod</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20121011</creationdate><title>An asymptotically optimal push-pull method for multicasting over a random network</title><author>Swamy, Vasuki Narasimha ; Bhashyam, Srikrishna ; Sundaresan, Rajesh ; Viswanath, Pramod</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a657-9c13d20fc2f81019a53b0fce0ec64c88c93d0b317537a3bc89396a7e47fa0d923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computer Science - Information Theory</topic><topic>Computer Science - Networking and Internet Architecture</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Swamy, Vasuki Narasimha</creatorcontrib><creatorcontrib>Bhashyam, Srikrishna</creatorcontrib><creatorcontrib>Sundaresan, Rajesh</creatorcontrib><creatorcontrib>Viswanath, Pramod</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Swamy, Vasuki Narasimha</au><au>Bhashyam, Srikrishna</au><au>Sundaresan, Rajesh</au><au>Viswanath, Pramod</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An asymptotically optimal push-pull method for multicasting over a random network</atitle><date>2012-10-11</date><risdate>2012</risdate><abstract>We consider allcast and 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 links 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 without network coding.</abstract><doi>10.48550/arxiv.1210.3187</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1210.3187 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1210_3187 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Computer Science - Networking and Internet Architecture Mathematics - Information Theory |
| 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=2025-01-11T23%3A33%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20asymptotically%20optimal%20push-pull%20method%20for%20multicasting%20over%20a%20random%20network&rft.au=Swamy,%20Vasuki%20Narasimha&rft.date=2012-10-11&rft_id=info:doi/10.48550/arxiv.1210.3187&rft_dat=%3Carxiv_GOX%3E1210_3187%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |