An Asymptotically Optimal Push-Pull Method for Multicasting Over a Random Network
We consider all-cast 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:
| Veröffentlicht in: | IEEE transactions on information theory 2013-08, Vol.59 (8), p.5075-5087 |
|---|---|
| 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 | 5087 |
|---|---|
| container_issue | 8 |
| container_start_page | 5075 |
| container_title | IEEE transactions on information theory |
| container_volume | 59 |
| creator | Swamy, Vasuki Narasimha Bhashyam, Srikrishna Sundaresan, Rajesh Viswanath, Pramod |
| description | We consider all-cast 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.1109/TIT.2013.2253543 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2013_2253543</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6482634</ieee_id><sourcerecordid>3022411781</sourcerecordid><originalsourceid>FETCH-LOGICAL-c321t-482d94bcd71771515fe3d048eb39978dbcbe446b3f00b32368b456d04d60b53</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt3wUtAPG7N525yLMWPQmur9h42u1m7dbupSVbpvzdLS0_DMM_M8D4A3GI0whjJx9V0NSII0xEhnHJGz8AAc54lMuXsHAwQwiKRjIlLcOX9JraMYzIA7-MWjv1-uws21EXeNHu42IV6mzdw2fl1suyaBs5NWNsSVtbBedf0nA91-wUXv8bBHH7kbWm38M2EP-u-r8FFlTfe3BzrEHw-P60mr8ls8TKdjGdJQQkOCROklEwXZYazDHPMK0NLxITRVMpMlLrQhrFU0wohTQlNhWY8jUSZIs3pENwfru6c_emMD2pjO9fGhwozhDJKhBCRQgeqcNZ7Zyq1czGb2yuMVK9NRW2q16aO2uLKw_Fw7qOPyuVtUfvTHsm4lAz33N2Bq40xp3EaY6WU0X_he3S1</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1400732888</pqid></control><display><type>article</type><title>An Asymptotically Optimal Push-Pull Method for Multicasting Over a Random Network</title><source>IEEE Electronic Library (IEL)</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 all-cast 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>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2013.2253543</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; All-cast ; Applied sciences ; Asymptotic methods ; broadcast ; Encoding ; Erdős-Rényi random graph ; Exact sciences and technology ; flows ; Information theory ; Information, signal and communications theory ; matching ; multicast ; Multicast communication ; Network coding ; Peer-to-peer computing ; random graph ; Random variables ; Relays ; Steiner tree ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Traffic flow ; Transmission and modulation (techniques and equipments) ; tree packing ; Upper bound</subject><ispartof>IEEE transactions on information theory, 2013-08, Vol.59 (8), p.5075-5087</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c321t-482d94bcd71771515fe3d048eb39978dbcbe446b3f00b32368b456d04d60b53</citedby><cites>FETCH-LOGICAL-c321t-482d94bcd71771515fe3d048eb39978dbcbe446b3f00b32368b456d04d60b53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6482634$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6482634$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27599413$$DView record in Pascal Francis$$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><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We consider all-cast 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>Algorithms</subject><subject>All-cast</subject><subject>Applied sciences</subject><subject>Asymptotic methods</subject><subject>broadcast</subject><subject>Encoding</subject><subject>Erdős-Rényi random graph</subject><subject>Exact sciences and technology</subject><subject>flows</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>matching</subject><subject>multicast</subject><subject>Multicast communication</subject><subject>Network coding</subject><subject>Peer-to-peer computing</subject><subject>random graph</subject><subject>Random variables</subject><subject>Relays</subject><subject>Steiner tree</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Traffic flow</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>tree packing</subject><subject>Upper bound</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWKt3wUtAPG7N525yLMWPQmur9h42u1m7dbupSVbpvzdLS0_DMM_M8D4A3GI0whjJx9V0NSII0xEhnHJGz8AAc54lMuXsHAwQwiKRjIlLcOX9JraMYzIA7-MWjv1-uws21EXeNHu42IV6mzdw2fl1suyaBs5NWNsSVtbBedf0nA91-wUXv8bBHH7kbWm38M2EP-u-r8FFlTfe3BzrEHw-P60mr8ls8TKdjGdJQQkOCROklEwXZYazDHPMK0NLxITRVMpMlLrQhrFU0wohTQlNhWY8jUSZIs3pENwfru6c_emMD2pjO9fGhwozhDJKhBCRQgeqcNZ7Zyq1czGb2yuMVK9NRW2q16aO2uLKw_Fw7qOPyuVtUfvTHsm4lAz33N2Bq40xp3EaY6WU0X_he3S1</recordid><startdate>20130801</startdate><enddate>20130801</enddate><creator>Swamy, Vasuki Narasimha</creator><creator>Bhashyam, Srikrishna</creator><creator>Sundaresan, Rajesh</creator><creator>Viswanath, Pramod</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130801</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-c321t-482d94bcd71771515fe3d048eb39978dbcbe446b3f00b32368b456d04d60b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>All-cast</topic><topic>Applied sciences</topic><topic>Asymptotic methods</topic><topic>broadcast</topic><topic>Encoding</topic><topic>Erdős-Rényi random graph</topic><topic>Exact sciences and technology</topic><topic>flows</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>matching</topic><topic>multicast</topic><topic>Multicast communication</topic><topic>Network coding</topic><topic>Peer-to-peer computing</topic><topic>random graph</topic><topic>Random variables</topic><topic>Relays</topic><topic>Steiner tree</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Traffic flow</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>tree packing</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Swamy, Vasuki Narasimha</creatorcontrib><creatorcontrib>Bhashyam, Srikrishna</creatorcontrib><creatorcontrib>Sundaresan, Rajesh</creatorcontrib><creatorcontrib>Viswanath, Pramod</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><jtitle>IEEE transactions on information theory</jtitle></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><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2013-08-01</date><risdate>2013</risdate><volume>59</volume><issue>8</issue><spage>5075</spage><epage>5087</epage><pages>5075-5087</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We consider all-cast 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><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2013.2253543</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2013-08, Vol.59 (8), p.5075-5087 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2013_2253543 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms All-cast Applied sciences Asymptotic methods broadcast Encoding Erdős-Rényi random graph Exact sciences and technology flows Information theory Information, signal and communications theory matching multicast Multicast communication Network coding Peer-to-peer computing random graph Random variables Relays Steiner tree Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Traffic flow Transmission and modulation (techniques and equipments) tree packing 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-24T20%3A07%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&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.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Swamy,%20Vasuki%20Narasimha&rft.date=2013-08-01&rft.volume=59&rft.issue=8&rft.spage=5075&rft.epage=5087&rft.pages=5075-5087&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2013.2253543&rft_dat=%3Cproquest_RIE%3E3022411781%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1400732888&rft_id=info:pmid/&rft_ieee_id=6482634&rfr_iscdi=true |