Network Coding over Time-Varying Networks by Means of Virtual Graphs
We present a method for network coding over time-varying networks with attractive tradeoffs between throughput and decoding-delay. We model the time-varying networks as a sequence of topology graphs. The method relies on designing a deterministic network code for a fixed virtual graph derived from t...
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 | 1647 |
|---|---|
| container_issue | |
| container_start_page | 1642 |
| container_title | |
| container_volume | |
| creator | Papadopoulos, H.C. Kozat, U.C. Pepin, C. Sundberg, C.-E.W. Ramprashad, S.A. |
| description | We present a method for network coding over time-varying networks with attractive tradeoffs between throughput and decoding-delay. We model the time-varying networks as a sequence of topology graphs. The method relies on designing a deterministic network code for a fixed virtual graph derived from the actual sequence of topologies, and on exploiting proper buffering in order to implement the code over the actual network. We show that, under certain conditions, this approach can achieve the maximum achievable throughput over the given time- varying network. We also present simulation results that validate the theoretical findings. |
| doi_str_mv | 10.1109/GLOCOM.2007.316 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4411226</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4411226</ieee_id><sourcerecordid>4411226</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-bb51c95942fdf6b19e56dca07d75c94cdf639f535b763315748174f92d5a3b6c3</originalsourceid><addsrcrecordid>eNpFjz1PwzAYhM2XRFqYGVj8BxL82n7teEQBAlJKllJ1q5zEhkDbVHEA9d8TRCWmk547ne4IuQKWADBzkxdlVs4SzphOBKgjMgHJpQQmhTomEUetYq3k8uTf4OkpicAIFiM3y3MyCeGdMZQpQkTunt3w3fUfNOuadvtKuy_X03m7cfHC9vtfcggEWu3pzNltoJ2ni7YfPu2a5r3dvYULcubtOrjLg07Jy8P9PHuMizJ_ym6LuAWNQ1xVCLVBI7lvvKrAOFRNbZluNNZG1iMUxqPASishALVMQUtveINWVKoWU3L919s651a7vt2MG1fjSeBciR-lFE2h</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Network Coding over Time-Varying Networks by Means of Virtual Graphs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Papadopoulos, H.C. ; Kozat, U.C. ; Pepin, C. ; Sundberg, C.-E.W. ; Ramprashad, S.A.</creator><creatorcontrib>Papadopoulos, H.C. ; Kozat, U.C. ; Pepin, C. ; Sundberg, C.-E.W. ; Ramprashad, S.A.</creatorcontrib><description>We present a method for network coding over time-varying networks with attractive tradeoffs between throughput and decoding-delay. We model the time-varying networks as a sequence of topology graphs. The method relies on designing a deterministic network code for a fixed virtual graph derived from the actual sequence of topologies, and on exploiting proper buffering in order to implement the code over the actual network. We show that, under certain conditions, this approach can achieve the maximum achievable throughput over the given time- varying network. We also present simulation results that validate the theoretical findings.</description><identifier>ISSN: 1930-529X</identifier><identifier>ISBN: 1424410428</identifier><identifier>ISBN: 9781424410422</identifier><identifier>EISSN: 2576-764X</identifier><identifier>EISBN: 1424410436</identifier><identifier>EISBN: 9781424410439</identifier><identifier>DOI: 10.1109/GLOCOM.2007.316</identifier><language>eng</language><publisher>IEEE</publisher><subject>Decoding ; Design methodology ; Fluctuations ; Linear code ; Multicast algorithms ; Network coding ; Network topology ; Switches ; Throughput ; Time varying systems</subject><ispartof>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, 2007, p.1642-1647</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/4411226$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4411226$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Papadopoulos, H.C.</creatorcontrib><creatorcontrib>Kozat, U.C.</creatorcontrib><creatorcontrib>Pepin, C.</creatorcontrib><creatorcontrib>Sundberg, C.-E.W.</creatorcontrib><creatorcontrib>Ramprashad, S.A.</creatorcontrib><title>Network Coding over Time-Varying Networks by Means of Virtual Graphs</title><title>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference</title><addtitle>GLOCOM</addtitle><description>We present a method for network coding over time-varying networks with attractive tradeoffs between throughput and decoding-delay. We model the time-varying networks as a sequence of topology graphs. The method relies on designing a deterministic network code for a fixed virtual graph derived from the actual sequence of topologies, and on exploiting proper buffering in order to implement the code over the actual network. We show that, under certain conditions, this approach can achieve the maximum achievable throughput over the given time- varying network. We also present simulation results that validate the theoretical findings.</description><subject>Decoding</subject><subject>Design methodology</subject><subject>Fluctuations</subject><subject>Linear code</subject><subject>Multicast algorithms</subject><subject>Network coding</subject><subject>Network topology</subject><subject>Switches</subject><subject>Throughput</subject><subject>Time varying systems</subject><issn>1930-529X</issn><issn>2576-764X</issn><isbn>1424410428</isbn><isbn>9781424410422</isbn><isbn>1424410436</isbn><isbn>9781424410439</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFjz1PwzAYhM2XRFqYGVj8BxL82n7teEQBAlJKllJ1q5zEhkDbVHEA9d8TRCWmk547ne4IuQKWADBzkxdlVs4SzphOBKgjMgHJpQQmhTomEUetYq3k8uTf4OkpicAIFiM3y3MyCeGdMZQpQkTunt3w3fUfNOuadvtKuy_X03m7cfHC9vtfcggEWu3pzNltoJ2ni7YfPu2a5r3dvYULcubtOrjLg07Jy8P9PHuMizJ_ym6LuAWNQ1xVCLVBI7lvvKrAOFRNbZluNNZG1iMUxqPASishALVMQUtveINWVKoWU3L919s651a7vt2MG1fjSeBciR-lFE2h</recordid><startdate>200711</startdate><enddate>200711</enddate><creator>Papadopoulos, H.C.</creator><creator>Kozat, U.C.</creator><creator>Pepin, C.</creator><creator>Sundberg, C.-E.W.</creator><creator>Ramprashad, S.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200711</creationdate><title>Network Coding over Time-Varying Networks by Means of Virtual Graphs</title><author>Papadopoulos, H.C. ; Kozat, U.C. ; Pepin, C. ; Sundberg, C.-E.W. ; Ramprashad, S.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-bb51c95942fdf6b19e56dca07d75c94cdf639f535b763315748174f92d5a3b6c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Decoding</topic><topic>Design methodology</topic><topic>Fluctuations</topic><topic>Linear code</topic><topic>Multicast algorithms</topic><topic>Network coding</topic><topic>Network topology</topic><topic>Switches</topic><topic>Throughput</topic><topic>Time varying systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Papadopoulos, H.C.</creatorcontrib><creatorcontrib>Kozat, U.C.</creatorcontrib><creatorcontrib>Pepin, C.</creatorcontrib><creatorcontrib>Sundberg, C.-E.W.</creatorcontrib><creatorcontrib>Ramprashad, S.A.</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>Papadopoulos, H.C.</au><au>Kozat, U.C.</au><au>Pepin, C.</au><au>Sundberg, C.-E.W.</au><au>Ramprashad, S.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Network Coding over Time-Varying Networks by Means of Virtual Graphs</atitle><btitle>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference</btitle><stitle>GLOCOM</stitle><date>2007-11</date><risdate>2007</risdate><spage>1642</spage><epage>1647</epage><pages>1642-1647</pages><issn>1930-529X</issn><eissn>2576-764X</eissn><isbn>1424410428</isbn><isbn>9781424410422</isbn><eisbn>1424410436</eisbn><eisbn>9781424410439</eisbn><abstract>We present a method for network coding over time-varying networks with attractive tradeoffs between throughput and decoding-delay. We model the time-varying networks as a sequence of topology graphs. The method relies on designing a deterministic network code for a fixed virtual graph derived from the actual sequence of topologies, and on exploiting proper buffering in order to implement the code over the actual network. We show that, under certain conditions, this approach can achieve the maximum achievable throughput over the given time- varying network. We also present simulation results that validate the theoretical findings.</abstract><pub>IEEE</pub><doi>10.1109/GLOCOM.2007.316</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1930-529X |
| ispartof | IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, 2007, p.1642-1647 |
| issn | 1930-529X 2576-764X |
| language | eng |
| recordid | cdi_ieee_primary_4411226 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Decoding Design methodology Fluctuations Linear code Multicast algorithms Network coding Network topology Switches Throughput Time varying systems |
| title | Network Coding over Time-Varying Networks by Means of Virtual Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T07%3A43%3A13IST&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=Network%20Coding%20over%20Time-Varying%20Networks%20by%20Means%20of%20Virtual%20Graphs&rft.btitle=IEEE%20GLOBECOM%202007%20-%20IEEE%20Global%20Telecommunications%20Conference&rft.au=Papadopoulos,%20H.C.&rft.date=2007-11&rft.spage=1642&rft.epage=1647&rft.pages=1642-1647&rft.issn=1930-529X&rft.eissn=2576-764X&rft.isbn=1424410428&rft.isbn_list=9781424410422&rft_id=info:doi/10.1109/GLOCOM.2007.316&rft_dat=%3Cieee_6IE%3E4411226%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424410436&rft.eisbn_list=9781424410439&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4411226&rfr_iscdi=true |