Extreme flow decomposition for multi-source multicast with intra-session network coding
Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session network coding (MISNC) problem. However, it is still hard to solve using conventional methods due to the enormous scale of variables or constraints...
Saved in:
| Published in: | Journal of parallel and distributed computing Vol. 175; pp. 80 - 91 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.05.2023
|
| Subjects: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session network coding (MISNC) problem. However, it is still hard to solve using conventional methods due to the enormous scale of variables or constraints. In this paper, we try to solve this problem in terms of throughput maximization from an algorithmic perspective. We propose a novel formulation based on the extreme flow decomposition technique, which facilitates the design and analysis of approximation and online algorithms. For the offline scenario, we develop a fully polynomial time approximation scheme (FPTAS) which can find a (1+ω)-approximation solution for any specified ω>0. For the online scenario, we develop an online primal-dual algorithm which proves O(1)-competitive and violates link capacities by a factor of O(logm), where m is the link number. The proposed algorithms share an elegant primal-dual form and thereby have inherent advantages of simplicity, efficiency, and scalability. To better understand the proposed approach, we devise delicate numerical examples on an extended butterfly network to validate the effects of algorithmic parameters and make an interesting comparison between the offline and online cases. We also perform large-scale simulations on real networks to validate the effectiveness of the proposed FPTAS and online algorithm.
•Extreme flow decomposition technique for intra-session network coding.•Offline FPTAS with provable approximation ratio.•Online primal-dual algorithm with provable competitive ratio.•Large-scale experiments using public datasets. |
|---|---|
| AbstractList | Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session network coding (MISNC) problem. However, it is still hard to solve using conventional methods due to the enormous scale of variables or constraints. In this paper, we try to solve this problem in terms of throughput maximization from an algorithmic perspective. We propose a novel formulation based on the extreme flow decomposition technique, which facilitates the design and analysis of approximation and online algorithms. For the offline scenario, we develop a fully polynomial time approximation scheme (FPTAS) which can find a (1+ω)-approximation solution for any specified ω>0. For the online scenario, we develop an online primal-dual algorithm which proves O(1)-competitive and violates link capacities by a factor of O(logm), where m is the link number. The proposed algorithms share an elegant primal-dual form and thereby have inherent advantages of simplicity, efficiency, and scalability. To better understand the proposed approach, we devise delicate numerical examples on an extended butterfly network to validate the effects of algorithmic parameters and make an interesting comparison between the offline and online cases. We also perform large-scale simulations on real networks to validate the effectiveness of the proposed FPTAS and online algorithm.
•Extreme flow decomposition technique for intra-session network coding.•Offline FPTAS with provable approximation ratio.•Online primal-dual algorithm with provable competitive ratio.•Large-scale experiments using public datasets. |
| Author | Zhang, Jianwei |
| Author_xml | – sequence: 1 givenname: Jianwei orcidid: 0000-0003-2728-3357 surname: Zhang fullname: Zhang, Jianwei email: janyway@outlook.com organization: School of Information Science and Engineering, Yunnan University, Kunming, 650500, China |
| BookMark | eNp9kM1KAzEUhYNUsK2-gKt5gRlvkmkyA26k1B8ouFFchpDcaMbOpCSpo29vh7p2dTlwv8PhW5DZEAYk5JpCRYGKm67q9tZUDBivgFYA_IzMKbSihKZuZmQOsual5HR1QRYpdQCUrmQzJ2-b7xyxx8LtwlhYNKHfh-SzD0PhQiz6wy77MoVDNHgKRqdcjD5_FH7IUZcJU5q-B8xjiJ-FCdYP75fk3Oldwqu_uySv95uX9WO5fX54Wt9tS8NWNJfMCiuQu5YasA0IoVurqYVaGm1qaBiCZG1jJK2RGSac1Npy4Ti3rNFO8iVhp14TQ0oRndpH3-v4oyioSY3q1KRGTWoUUHVUc4RuTxAel315jCoZj4NB6yOarGzw_-G_WFlw7w |
| Cites_doi | 10.1109/TNET.2008.919325 10.1016/j.future.2019.05.044 10.1016/j.comnet.2021.108517 10.1016/j.comnet.2018.06.015 10.1109/TPDS.2022.3196840 10.1109/LWC.2021.3129893 10.1109/TIT.2006.881746 10.1007/s00186-017-0604-2 10.1109/LCOMM.2018.2833547 10.1109/JSAC.2020.2986612 10.1137/S0097539704446232 10.1109/18.850663 10.1109/TIT.2011.2145630 10.1109/TVT.2017.2786701 10.1145/964725.633039 10.1109/TAC.2007.910665 10.1145/1328911.1328924 10.1109/JSYST.2021.3114393 10.1109/TPDS.2019.2937524 10.1007/s11276-020-02284-5 10.1016/j.comnet.2012.11.017 10.1109/TVT.2019.2933667 10.1109/TIT.2008.2009809 10.1109/MNET.2018.1700297 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Inc. |
| Copyright_xml | – notice: 2023 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jpdc.2023.01.003 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 91 |
| ExternalDocumentID | 10_1016_j_jpdc_2023_01_003 S0743731523000035 |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61902346 funderid: https://doi.org/10.13039/501100001809 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c251t-2d6d6e3f91c0d8066a9da1d047cac4082e07298c714e2c26f7aad36f33d28af73 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000964138900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sat Nov 29 07:16:59 EST 2025 Fri Feb 23 02:38:37 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Multicast Network coding Extreme flow Online algorithm Approximation algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c251t-2d6d6e3f91c0d8066a9da1d047cac4082e07298c714e2c26f7aad36f33d28af73 |
| ORCID | 0000-0003-2728-3357 |
| PageCount | 12 |
| ParticipantIDs | crossref_primary_10_1016_j_jpdc_2023_01_003 elsevier_sciencedirect_doi_10_1016_j_jpdc_2023_01_003 |
| PublicationCentury | 2000 |
| PublicationDate | May 2023 2023-05-00 |
| PublicationDateYYYYMMDD | 2023-05-01 |
| PublicationDate_xml | – month: 05 year: 2023 text: May 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Ho, Médard, Koetter (br0160) 2006; 52 Malathy, Porkodi, Sampathkumar (br0330) 2020; 26 Bhatia, Hao, Kodialam (br0300) 2015 Even, Moti (br0180) 2012 Hao, Kodialam, Lakshman (br0310) 2016 Garg, Koenemann (br0280) 2007; 37 Cao, Kodialam, Lakshman (br0240) 2014 Ahlswede, Cai, Li (br0010) 2000; 46 Kodialam, Nandagopal (br0210) 2005 Ma, Liang, Wu (br0260) 2019; 31 Kodialam, Nandagopal (br0200) 2003 Spring, Mahajan, Wetherall (br0370) 2002; 32 Palomar, Chiang (br0150) 2007; 52 Zhang, Wang (br0060) 2022; 33 Karakostas (br0270) 2008; 4 Zhang (br0390) 2022; 16 Bhatia, Kodialam, Lakshman (br0230) 2008; 16 Gay, Schaus, Vissicchio (br0380) 2017 Zhang, Zhao (br0320) 2021; 200 Zhang, Wang, Geng (br0430) 2022 Sengupta, Liu, Chen (br0190) 2011; 57 Zhang, Zhang, Sun (br0020) 2018; 22 Fabregat, Donoso, Solano (br0050) 2004; vol. 113 Zhang, Zhao, Zheng (br0220) 2021; 11 Ho, Viswanathan (br0110) 2009; 55 Wu, Li (br0090) 2007 Agarwal, Kodialam, Lakshman (br0070) 2013 Alhussein, Zhuang (br0400) 2020; 38 Cui, Chen, Ho (br0290) 2007 Raayatpanah, Fathabadi, Khalaj (br0140) 2013; 57 Wang, Li, Tong (br0340) 2019 Huang, Hsu, Shen (br0130) 2016 Zhu, Li, Huang, Wu (br0360) 2018; 67 Bertsekas (br0120) 1998 Xu, Liang, Galis (br0250) 2018; 143 Lun, Ratnakar, Koetter (br0100) 2005 Zhang, Li, Chen (br0040) 2019; 33 Li, Li, Lau (br0080) 2006; 14 Ling, Datta, Xu (br0030) 2019; 100 Xu, Samanta, Li (br0350) 2019; 68 Holzhauser, Krumke (br0410) 2018; 87 Even (10.1016/j.jpdc.2023.01.003_br0180) 2012 Wu (10.1016/j.jpdc.2023.01.003_br0090) 2007 Zhang (10.1016/j.jpdc.2023.01.003_br0060) 2022; 33 Cao (10.1016/j.jpdc.2023.01.003_br0240) 2014 Garg (10.1016/j.jpdc.2023.01.003_br0280) 2007; 37 Hao (10.1016/j.jpdc.2023.01.003_br0310) 2016 Bhatia (10.1016/j.jpdc.2023.01.003_br0300) 2015 Fabregat (10.1016/j.jpdc.2023.01.003_br0050) 2004; vol. 113 Xu (10.1016/j.jpdc.2023.01.003_br0250) 2018; 143 Li (10.1016/j.jpdc.2023.01.003_br0080) 2006; 14 Zhu (10.1016/j.jpdc.2023.01.003_br0360) 2018; 67 Huang (10.1016/j.jpdc.2023.01.003_br0130) 2016 Spring (10.1016/j.jpdc.2023.01.003_br0370) 2002; 32 Raayatpanah (10.1016/j.jpdc.2023.01.003_br0140) 2013; 57 Zhang (10.1016/j.jpdc.2023.01.003_br0020) 2018; 22 Alhussein (10.1016/j.jpdc.2023.01.003_br0400) 2020; 38 Ma (10.1016/j.jpdc.2023.01.003_br0260) 2019; 31 Ho (10.1016/j.jpdc.2023.01.003_br0160) 2006; 52 Wang (10.1016/j.jpdc.2023.01.003_br0340) 2019 Karakostas (10.1016/j.jpdc.2023.01.003_br0270) 2008; 4 Palomar (10.1016/j.jpdc.2023.01.003_br0150) 2007; 52 Sengupta (10.1016/j.jpdc.2023.01.003_br0190) 2011; 57 Zhang (10.1016/j.jpdc.2023.01.003_br0320) 2021; 200 Zhang (10.1016/j.jpdc.2023.01.003_br0430) 2022 Zhang (10.1016/j.jpdc.2023.01.003_br0040) 2019; 33 Bhatia (10.1016/j.jpdc.2023.01.003_br0230) 2008; 16 Ahlswede (10.1016/j.jpdc.2023.01.003_br0010) 2000; 46 Malathy (10.1016/j.jpdc.2023.01.003_br0330) 2020; 26 Agarwal (10.1016/j.jpdc.2023.01.003_br0070) 2013 Cui (10.1016/j.jpdc.2023.01.003_br0290) 2007 Bertsekas (10.1016/j.jpdc.2023.01.003_br0120) 1998 Lun (10.1016/j.jpdc.2023.01.003_br0100) 2005 Holzhauser (10.1016/j.jpdc.2023.01.003_br0410) 2018; 87 Zhang (10.1016/j.jpdc.2023.01.003_br0390) 2022; 16 Gay (10.1016/j.jpdc.2023.01.003_br0380) Ho (10.1016/j.jpdc.2023.01.003_br0110) 2009; 55 Zhang (10.1016/j.jpdc.2023.01.003_br0220) 2021; 11 Ling (10.1016/j.jpdc.2023.01.003_br0030) 2019; 100 Kodialam (10.1016/j.jpdc.2023.01.003_br0200) 2003 Kodialam (10.1016/j.jpdc.2023.01.003_br0210) 2005 Xu (10.1016/j.jpdc.2023.01.003_br0350) 2019; 68 |
| References_xml | – start-page: 6041 year: 2007 end-page: 6046 ident: br0290 article-title: Optimization based rate control for multicast with network coding: a multipath formulation publication-title: Proc. IEEE CDC – volume: 37 start-page: 630 year: 2007 end-page: 652 ident: br0280 article-title: Faster and simpler algorithms for multicommodity flow and other fractional packing problems publication-title: SIAM J. Comput. – volume: 31 start-page: 393 year: 2019 end-page: 407 ident: br0260 article-title: Throughput maximization of NFV-enabled multicasting in mobile edge cloud networks publication-title: IEEE Trans. Parallel Distrib. Syst. – volume: 33 start-page: 113 year: 2019 end-page: 119 ident: br0040 article-title: Joint opportunistic routing and intra-flow network coding in multi-hop wireless networks: a survey publication-title: IEEE Netw. – year: 2012 ident: br0180 article-title: Online multi-commodity flow with high demands publication-title: Proc. International Workshop on Approximation and Online Algorithms – start-page: 42 year: 2003 end-page: 54 ident: br0200 article-title: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem publication-title: Proc. ACM MOBICOM – volume: 52 start-page: 2254 year: 2007 end-page: 2269 ident: br0150 article-title: Alternative distributed algorithms for network utility maximization: framework and applications publication-title: IEEE Trans. Autom. Control – start-page: 1 year: 2016 end-page: 9 ident: br0310 article-title: Optimizing restoration with segment routing publication-title: Proc. IEEE INFOCOM – start-page: 1 year: 2019 end-page: 6 ident: br0340 article-title: Cooperative network-coded multicast for layered content delivery in D2D-enhanced HetNets publication-title: Proc. IEEE ISCC – volume: 38 start-page: 1089 year: 2020 end-page: 1101 ident: br0400 article-title: Robust online composition, routing and NF placement for NFV-enabled services publication-title: IEEE J. Sel. Areas Commun. – volume: 22 start-page: 1478 year: 2018 end-page: 1481 ident: br0020 article-title: Minimizing the maximum link utilization in multicast multi-commodity flow networks publication-title: IEEE Commun. Lett. – volume: 32 start-page: 133 year: 2002 end-page: 145 ident: br0370 article-title: Measuring ISP topologies with Rocketfuel publication-title: Comput. Commun. Rev. – volume: 143 start-page: 15 year: 2018 end-page: 29 ident: br0250 article-title: Throughput optimization for admitting NFV-enabled requests in cloud networks publication-title: Comput. Netw. – volume: 26 start-page: 3657 year: 2020 end-page: 3674 ident: br0330 article-title: An optimal network coding based backpressure routing approach for massive IoT network publication-title: Wirel. Netw. – volume: 67 start-page: 4020 year: 2018 end-page: 4030 ident: br0360 article-title: Miss and forward: exploiting diversity with intrasession network coding publication-title: IEEE Trans. Veh. Technol. – volume: 4 start-page: 1 year: 2008 end-page: 17 ident: br0270 article-title: Faster approximation schemes for fractional multicommodity flow problems publication-title: ACM Trans. Algorithms – volume: 100 start-page: 440 year: 2019 end-page: 455 ident: br0030 article-title: On hybrid network coding for visual traffic surveillance publication-title: Future Gener. Comput. Syst. – volume: 11 start-page: 396 year: 2021 end-page: 400 ident: br0220 article-title: SR-WMN: online network throughput optimization in wireless mesh networks with segment routing publication-title: IEEE Wirel. Commun. Lett. – volume: 55 start-page: 797 year: 2009 end-page: 815 ident: br0110 article-title: Dynamic algorithms for multicast with intra-session network coding publication-title: IEEE Trans. Inf. Theory – start-page: 65 year: 2014 end-page: 70 ident: br0240 article-title: Traffic steering in software defined networks: planning and online routing publication-title: Proc. ACM SIGCOMM – volume: 57 start-page: 1113 year: 2013 end-page: 1123 ident: br0140 article-title: Minimum cost multiple multicast network coding with quantized rates publication-title: Comput. Netw. – volume: 57 start-page: 5072 year: 2011 end-page: 5087 ident: br0190 article-title: Peer-to-peer streaming capacity publication-title: IEEE Trans. Inf. Theory – volume: 68 start-page: 10066 year: 2019 end-page: 10080 ident: br0350 article-title: Network coding for data delivery in caching at edge: concept, model, and algorithms publication-title: IEEE Trans. Veh. Technol. – start-page: 2211 year: 2013 end-page: 2219 ident: br0070 article-title: Traffic engineering in software defined networks publication-title: Proc. IEEE INFOCOM – start-page: 678 year: 2007 end-page: 690 ident: br0090 article-title: Optimal rate allocation in overlay content distribution publication-title: Proc. IFIP NETWORKING – start-page: 657 year: 2015 end-page: 665 ident: br0300 article-title: Optimized network traffic engineering using segment routing publication-title: Proc. IEEE INFOCOM – volume: 200 year: 2021 ident: br0320 article-title: Q-SR: an extensible optimization framework for segment routing publication-title: Comput. Netw. – volume: 46 start-page: 1204 year: 2000 end-page: 1216 ident: br0010 article-title: Network information flow publication-title: IEEE Trans. Inf. Theory – start-page: 1 year: 2016 end-page: 9 ident: br0130 article-title: Multicast traffic engineering for software-defined networks publication-title: Proc. IEEE INFOCOM – start-page: 1607 year: 2005 end-page: 1617 ident: br0100 article-title: Achieving minimum-cost multicast: a decentralized approach based on network coding publication-title: Proc. IEEE INFOCOM – start-page: 73 year: 2005 end-page: 87 ident: br0210 article-title: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks publication-title: Proc. ACM MOBICOM – year: 2022 ident: br0430 article-title: Delay-optimized multicast tree packing in software-defined networks publication-title: IEEE Trans. Serv. Comput. – volume: vol. 113 start-page: 399 year: 2004 ident: br0050 article-title: Multitree routing for multicast flows: a genetic algorithm approach publication-title: Recent Advances in Artificial Intelligence Research and Development – volume: 16 start-page: 3829 year: 2022 end-page: 3832 ident: br0390 article-title: Online multipath routing via multiplicative weight update publication-title: IEEE Syst. J. – volume: 16 start-page: 1321 year: 2008 end-page: 1330 ident: br0230 article-title: Bandwidth guaranteed routing with fast restoration against link and node failures publication-title: IEEE/ACM Trans. Netw. – volume: 33 start-page: 4563 year: 2022 end-page: 4580 ident: br0060 article-title: Elastic and reliable bandwidth reservation based on distributed traffic monitoring and control publication-title: IEEE Trans. Parallel Distrib. Syst. – year: 2017 ident: br0380 article-title: REPETITA: repeatable experiments for performance evaluation of traffic-engineering algorithms – volume: 87 start-page: 19 year: 2018 end-page: 50 ident: br0410 article-title: A generalized approximation framework for fractional network flow and packing problems publication-title: Math. Methods Oper. Res. – year: 1998 ident: br0120 article-title: Network Optimization: Continuous and Discrete Models – volume: 52 start-page: 4413 year: 2006 end-page: 4430 ident: br0160 article-title: A random linear network coding approach to multicast publication-title: IEEE Trans. Inf. Theory – volume: 14 start-page: 2467 year: 2006 end-page: 2485 ident: br0080 article-title: On achieving maximum multicast throughput in undirected networks publication-title: IEEE/ACM Trans. Netw. – volume: 16 start-page: 1321 issue: 6 year: 2008 ident: 10.1016/j.jpdc.2023.01.003_br0230 article-title: Bandwidth guaranteed routing with fast restoration against link and node failures publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2008.919325 – volume: 100 start-page: 440 year: 2019 ident: 10.1016/j.jpdc.2023.01.003_br0030 article-title: On hybrid network coding for visual traffic surveillance publication-title: Future Gener. Comput. Syst. doi: 10.1016/j.future.2019.05.044 – start-page: 1607 year: 2005 ident: 10.1016/j.jpdc.2023.01.003_br0100 article-title: Achieving minimum-cost multicast: a decentralized approach based on network coding – volume: 200 year: 2021 ident: 10.1016/j.jpdc.2023.01.003_br0320 article-title: Q-SR: an extensible optimization framework for segment routing publication-title: Comput. Netw. doi: 10.1016/j.comnet.2021.108517 – volume: 143 start-page: 15 year: 2018 ident: 10.1016/j.jpdc.2023.01.003_br0250 article-title: Throughput optimization for admitting NFV-enabled requests in cloud networks publication-title: Comput. Netw. doi: 10.1016/j.comnet.2018.06.015 – start-page: 678 year: 2007 ident: 10.1016/j.jpdc.2023.01.003_br0090 article-title: Optimal rate allocation in overlay content distribution – volume: 33 start-page: 4563 issue: 12 year: 2022 ident: 10.1016/j.jpdc.2023.01.003_br0060 article-title: Elastic and reliable bandwidth reservation based on distributed traffic monitoring and control publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2022.3196840 – year: 1998 ident: 10.1016/j.jpdc.2023.01.003_br0120 – volume: 11 start-page: 396 issue: 2 year: 2021 ident: 10.1016/j.jpdc.2023.01.003_br0220 article-title: SR-WMN: online network throughput optimization in wireless mesh networks with segment routing publication-title: IEEE Wirel. Commun. Lett. doi: 10.1109/LWC.2021.3129893 – start-page: 65 year: 2014 ident: 10.1016/j.jpdc.2023.01.003_br0240 article-title: Traffic steering in software defined networks: planning and online routing – volume: vol. 113 start-page: 399 year: 2004 ident: 10.1016/j.jpdc.2023.01.003_br0050 article-title: Multitree routing for multicast flows: a genetic algorithm approach – year: 2012 ident: 10.1016/j.jpdc.2023.01.003_br0180 article-title: Online multi-commodity flow with high demands – volume: 52 start-page: 4413 issue: 10 year: 2006 ident: 10.1016/j.jpdc.2023.01.003_br0160 article-title: A random linear network coding approach to multicast publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2006.881746 – volume: 87 start-page: 19 issue: 1 year: 2018 ident: 10.1016/j.jpdc.2023.01.003_br0410 article-title: A generalized approximation framework for fractional network flow and packing problems publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-017-0604-2 – start-page: 657 year: 2015 ident: 10.1016/j.jpdc.2023.01.003_br0300 article-title: Optimized network traffic engineering using segment routing – volume: 22 start-page: 1478 issue: 7 year: 2018 ident: 10.1016/j.jpdc.2023.01.003_br0020 article-title: Minimizing the maximum link utilization in multicast multi-commodity flow networks publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2018.2833547 – start-page: 2211 year: 2013 ident: 10.1016/j.jpdc.2023.01.003_br0070 article-title: Traffic engineering in software defined networks – volume: 38 start-page: 1089 issue: 6 year: 2020 ident: 10.1016/j.jpdc.2023.01.003_br0400 article-title: Robust online composition, routing and NF placement for NFV-enabled services publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2020.2986612 – year: 2022 ident: 10.1016/j.jpdc.2023.01.003_br0430 article-title: Delay-optimized multicast tree packing in software-defined networks publication-title: IEEE Trans. Serv. Comput. – volume: 37 start-page: 630 issue: 2 year: 2007 ident: 10.1016/j.jpdc.2023.01.003_br0280 article-title: Faster and simpler algorithms for multicommodity flow and other fractional packing problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539704446232 – start-page: 1 year: 2016 ident: 10.1016/j.jpdc.2023.01.003_br0130 article-title: Multicast traffic engineering for software-defined networks – ident: 10.1016/j.jpdc.2023.01.003_br0380 – volume: 46 start-page: 1204 issue: 4 year: 2000 ident: 10.1016/j.jpdc.2023.01.003_br0010 article-title: Network information flow publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.850663 – volume: 57 start-page: 5072 issue: 8 year: 2011 ident: 10.1016/j.jpdc.2023.01.003_br0190 article-title: Peer-to-peer streaming capacity publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2011.2145630 – start-page: 73 year: 2005 ident: 10.1016/j.jpdc.2023.01.003_br0210 article-title: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks – volume: 67 start-page: 4020 issue: 5 year: 2018 ident: 10.1016/j.jpdc.2023.01.003_br0360 article-title: Miss and forward: exploiting diversity with intrasession network coding publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2017.2786701 – volume: 32 start-page: 133 issue: 4 year: 2002 ident: 10.1016/j.jpdc.2023.01.003_br0370 article-title: Measuring ISP topologies with Rocketfuel publication-title: Comput. Commun. Rev. doi: 10.1145/964725.633039 – start-page: 1 year: 2019 ident: 10.1016/j.jpdc.2023.01.003_br0340 article-title: Cooperative network-coded multicast for layered content delivery in D2D-enhanced HetNets – volume: 52 start-page: 2254 issue: 12 year: 2007 ident: 10.1016/j.jpdc.2023.01.003_br0150 article-title: Alternative distributed algorithms for network utility maximization: framework and applications publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2007.910665 – volume: 4 start-page: 1 issue: 1 year: 2008 ident: 10.1016/j.jpdc.2023.01.003_br0270 article-title: Faster approximation schemes for fractional multicommodity flow problems publication-title: ACM Trans. Algorithms doi: 10.1145/1328911.1328924 – volume: 16 start-page: 3829 issue: 3 year: 2022 ident: 10.1016/j.jpdc.2023.01.003_br0390 article-title: Online multipath routing via multiplicative weight update publication-title: IEEE Syst. J. doi: 10.1109/JSYST.2021.3114393 – volume: 14 start-page: 2467 issue: SI year: 2006 ident: 10.1016/j.jpdc.2023.01.003_br0080 article-title: On achieving maximum multicast throughput in undirected networks publication-title: IEEE/ACM Trans. Netw. – volume: 31 start-page: 393 issue: 2 year: 2019 ident: 10.1016/j.jpdc.2023.01.003_br0260 article-title: Throughput maximization of NFV-enabled multicasting in mobile edge cloud networks publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2019.2937524 – volume: 26 start-page: 3657 year: 2020 ident: 10.1016/j.jpdc.2023.01.003_br0330 article-title: An optimal network coding based backpressure routing approach for massive IoT network publication-title: Wirel. Netw. doi: 10.1007/s11276-020-02284-5 – volume: 57 start-page: 1113 issue: 5 year: 2013 ident: 10.1016/j.jpdc.2023.01.003_br0140 article-title: Minimum cost multiple multicast network coding with quantized rates publication-title: Comput. Netw. doi: 10.1016/j.comnet.2012.11.017 – volume: 68 start-page: 10066 issue: 10 year: 2019 ident: 10.1016/j.jpdc.2023.01.003_br0350 article-title: Network coding for data delivery in caching at edge: concept, model, and algorithms publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2019.2933667 – start-page: 1 year: 2016 ident: 10.1016/j.jpdc.2023.01.003_br0310 article-title: Optimizing restoration with segment routing – start-page: 6041 year: 2007 ident: 10.1016/j.jpdc.2023.01.003_br0290 article-title: Optimization based rate control for multicast with network coding: a multipath formulation – start-page: 42 year: 2003 ident: 10.1016/j.jpdc.2023.01.003_br0200 article-title: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem – volume: 55 start-page: 797 issue: 2 year: 2009 ident: 10.1016/j.jpdc.2023.01.003_br0110 article-title: Dynamic algorithms for multicast with intra-session network coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2008.2009809 – volume: 33 start-page: 113 issue: 1 year: 2019 ident: 10.1016/j.jpdc.2023.01.003_br0040 article-title: Joint opportunistic routing and intra-flow network coding in multi-hop wireless networks: a survey publication-title: IEEE Netw. doi: 10.1109/MNET.2018.1700297 |
| SSID | ssj0011578 |
| Score | 2.3493638 |
| Snippet | Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 80 |
| SubjectTerms | Approximation algorithm Extreme flow Multicast Network coding Online algorithm |
| Title | Extreme flow decomposition for multi-source multicast with intra-session network coding |
| URI | https://dx.doi.org/10.1016/j.jpdc.2023.01.003 |
| Volume | 175 |
| WOSCitedRecordID | wos000964138900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELZQYWDhjXjLA1sUlNhN7IwIFQEDYgDRLUr8kFpVaUVT6M_nHDtpykswsERJpDiJP-vufD5_H0LnIs5DolUM0xKd-10iAz9PAuqrMJKacUW0zCuxCXZ_z_v95MHJW00rOQFWFHw-Tyb_CjXcA7DN1tk_wN00CjfgHECHI8AOx18B35uXJufn6dH4zZPK1Iy7wqyqpLCqIPRtzt5eiGxa2nzswGR6_aml6vAKWyHuiXHj3z5HsYY6fDRSlnBAGhZeI6Clqr1yk1lZP9hOTd_BiHxTg3a-gbSq-5xZMqSmjNpNmI0NZVHLClptJudPrRjXJ0ttkwbDi-FEGiZJQiv21IAu_FK9Fv_BXTVFhHV92jA1baSmjTQI04r7dZWwKOEdtHp52-vfNctKYWRdc_0LbheVLfj7-CVfRyqt6ONxC224DseXFu5ttKKKHbRZS3JgZ6F30bNDHxv08RL6GNDHbfRxgz426OMl9LFDH1v099DTde_x6sZ32hm-gIi19ImMZayoTkIRSA5xZZbILJRBl4lMGJFxZSjjuWBhVxFBYs2yTNJYUyoJzzSj-6hTjAt1gDBnNMoFtJEI0SW5gAk-zaIgh5kuT5SUh8ir-ymdWIqU9HtsDlFUd2XqgjwbvKUwMn547uhPbzlG64uxe4I65ctMnaI18VoOpi9nbli8A2-UeEo |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Extreme+flow+decomposition+for+multi-source+multicast+with+intra-session+network+coding&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Zhang%2C+Jianwei&rft.date=2023-05-01&rft.issn=0743-7315&rft.volume=175&rft.spage=80&rft.epage=91&rft_id=info:doi/10.1016%2Fj.jpdc.2023.01.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jpdc_2023_01_003 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |