Near-Optimal One-Sided Scheduling for Coded Segmented Network Coding

As a variation of random linear network coding, segmented network coding (SNC) has attracted great interest in data dissemination over lossy networks due to its low computational cost. In order to guarantee the success of decoding, SNC can adopt a feedbackless forward error correction (FEC) approach...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník 65; číslo 3; s. 929 - 939
Hlavní autori:	Tang, Bin, Yang, Shenghao, Ye, Baoliu, Guo, Song, Lu, Sanglu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Adaptive scheduling Coding Decoding Encoding Forward error correction Linear programming Mathematical models Network coding Networks Random linear network coding Reliability Scheduling scheduling strategy Segmentation segmented network coding Segments Transfer matrices forward error correction Random linear network coding segmented network coding scheduling strategy
ISSN:	0018-9340, 1557-9956
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	As a variation of random linear network coding, segmented network coding (SNC) has attracted great interest in data dissemination over lossy networks due to its low computational cost. In order to guarantee the success of decoding, SNC can adopt a feedbackless forward error correction (FEC) approach by applying a linear block code to the input packets before segmentation at the source node. In particular, if the empirical rank distribution of transfer matrices of segments is known in advance, several classes of coded SNC can achieve close-to-optimal decoding performance. However, the empirical rank distribution in the absence of feedback has been little investigated yet, making the whole performance of the FEC approach unknown. To close this gap, in this paper, we present the first comprehensive study on the transmission scheduling issue for the FEC approach, aiming at optimizing the rank distribution of transfer matrices with little control overhead. We propose an efficient adaptive scheduling framework for coded SNC in lossy unicast networks. This framework is one-sided (i.e., each network node forwards the segments adaptively only according to its own state) and scalable (i.e., its buffer cost will not keep on growing when the number of input packets goes to infinity). The performance of the framework is further optimized based on a linear programming approach. Extensive numerical results show that our framework performs near-optimally with respect to the empirical rank distribution.
AbstractList	As a variation of random linear network coding, segmented network coding (SNC) has attracted great interest in data dissemination over lossy networks due to its low computational cost. In order to guarantee the success of decoding, SNC can adopt a feedbackless forward error correction (FEC) approach by applying a linear block code to the input packets before segmentation at the source node. In particular, if the empirical rank distribution of transfer matrices of segments is known in advance, several classes of coded SNC can achieve close-to-optimal decoding performance. However, the empirical rank distribution in the absence of feedback has been little investigated yet, making the whole performance of the FEC approach unknown. To close this gap, in this paper, we present the first comprehensive study on the transmission scheduling issue for the FEC approach, aiming at optimizing the rank distribution of transfer matrices with little control overhead. We propose an efficient adaptive scheduling framework for coded SNC in lossy unicast networks. This framework is one-sided (i.e., each network node forwards the segments adaptively only according to its own state) and scalable (i.e., its buffer cost will not keep on growing when the number of input packets goes to infinity). The performance of the framework is further optimized based on a linear programming approach. Extensive numerical results show that our framework performs near-optimally with respect to the empirical rank distribution.
Author	Lu, Sanglu Yang, Shenghao Guo, Song Ye, Baoliu Tang, Bin
Author_xml	– sequence: 1 givenname: Bin surname: Tang fullname: Tang, Bin email: tb@nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China – sequence: 2 givenname: Shenghao surname: Yang fullname: Yang, Shenghao email: shyang@inc.cuhk.edu.hk organization: Institute of Network Coding, The Chinese University of Hong Kong, Hong Kong Special Administrative Region, China – sequence: 3 givenname: Baoliu surname: Ye fullname: Ye, Baoliu email: yebl@nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China – sequence: 4 givenname: Song surname: Guo fullname: Guo, Song email: sguo@u-aizu.ac.jp organization: Performance Evaluation Lab, School of Computer Science and Engineering, The University of Aizu, Aizu-Wakamastu City, Fukushima, Japan – sequence: 5 givenname: Sanglu surname: Lu fullname: Lu, Sanglu email: sanglu@nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
BookMark	eNp9kM9PwjAUgBuDiYCePXgh8eJl8Lpua3c082dC4ACem9K-4XCs2G4x_vcWIR44eGrz8n3tyzcgvcY2SMg1hTGlkE-WxTgGmo7jhKU8j89In6Ypj_I8zXqkD0BFlLMELsjA-w0AZDHkffIwQ-Wi-a6ttqoezRuMFpVBM1rodzRdXTXrUWndqLC_Q1xvsWnDbYbtl3Uf-3lALsl5qWqPV8dzSN6eHpfFSzSdP78W99NIMyHaSCmRiUwbteKZ4ajLUqQ0UTEzKwxbGqpRAS0RQCMToKBUMaciaKzMlFFsSO4O7-6c_ezQt3JbeY11rRq0nZdU0AySFAQN6O0JurGda8J2knLBY4h5zgM1OVDaWe8dlnLnQgj3LSnIfVW5LOS-qjxWDUZ6YuiqVW1lm9apqv7Huzl4FSL-_cIDGxKwH4EOhPk
CODEN	ITCOB4
CitedBy_id	crossref_primary_10_3390_network4040024 crossref_primary_10_1109_TNET_2017_2787726 crossref_primary_10_3390_e22070790 crossref_primary_10_1109_ACCESS_2017_2741972 crossref_primary_10_3390_e25030428 crossref_primary_10_1109_LCOMM_2020_3005349 crossref_primary_10_1109_TVT_2019_2891842 crossref_primary_10_1186_s13634_015_0297_8 crossref_primary_10_3390_s20154334 crossref_primary_10_1109_LCOMM_2016_2636818 crossref_primary_10_1109_ACCESS_2020_2972110 crossref_primary_10_1109_TCOMM_2017_2765641 crossref_primary_10_3390_e25071054
Cites_doi	10.1109/IWQOS.2007.376547 10.1109/TIT.2005.864424 10.1109/ISIT.2006.261636 10.1017/S0305004100036781 10.1109/SFCS.2002.1181950 10.1109/ITWKSPS.2010.5503153 10.1109/TIT.2002.807285 10.1016/j.phycom.2008.01.006 10.1109/ISIT.2012.6283956 10.1109/ITW.2014.6970863 10.1109/ISIT.2011.6034246 10.1109/TIT.2006.874390 10.1109/TIT.2006.881746 10.1145/1282427.1282400 10.1109/INFCOM.2010.5462030 10.1109/18.850663 10.1109/INFCOM.2010.5462249 10.1109/NETCOD.2009.5191397 10.1017/CBO9780511804441 10.1109/TNET.2011.2111382 10.1109/ISIT.2003.1228459 10.1109/TIT.2007.907513 10.1109/TIT.2010.2095111 10.1145/2628036 10.1109/JPROC.2010.2093850 10.1109/ISIT.2011.6034050 10.1109/TIT.2014.2334315
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TC.2015.2435792
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1557-9956
EndPage	939
ExternalDocumentID	4047266901 10_1109_TC_2015_2435792 7110514
Genre	orig-research
GrantInformation_xml	– fundername: Novel Software Technology and Industrialization – fundername: Science and Technology Pillar Program grantid: BE2013116 – fundername: Committee of the Hong Kong grantid: AoE/E-02/08 – fundername: IRSES MobileCloud Project grantid: 612212 – fundername: NSFC grantid: 61170069; 61373014; 91218302; 61321491; 61471215 funderid: 10.13039/501100001809
GroupedDBID	--Z -DZ -~X .DC 0R~ 29I 4.4 5GY 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AGQYO AGSQL AHBIQ AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 TWZ UHB UPT XZL YZZ AAYXX ABUFD CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c388t-aa8686cdab76d7ecff8514a23dbe956d1cea01fe00ce380a0fa2718aa83f6ada3
IEDL.DBID	RIE
ISICitedReferencesCount	31
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000370729600021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9340
IngestDate	Sun Nov 09 09:04:24 EST 2025 Sun Nov 30 03:55:13 EST 2025 Sat Nov 29 01:35:37 EST 2025 Tue Nov 18 22:03:06 EST 2025 Wed Aug 27 02:22:29 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	forward error correction Random linear network coding segmented network coding scheduling strategy
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c388t-aa8686cdab76d7ecff8514a23dbe956d1cea01fe00ce380a0fa2718aa83f6ada3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
PQID	1787202797
PQPubID	85452
PageCount	11
ParticipantIDs	proquest_miscellaneous_1816045081 proquest_journals_1787202797 crossref_primary_10_1109_TC_2015_2435792 ieee_primary_7110514 crossref_citationtrail_10_1109_TC_2015_2435792
PublicationCentury	2000
PublicationDate	2016-March-1 2016-3-1 20160301
PublicationDateYYYYMMDD	2016-03-01
PublicationDate_xml	– month: 03 year: 2016 text: 2016-March-1 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on computers
PublicationTitleAbbrev	TC
PublicationYear	2016
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref34 ref14 ref36 ref30 ref11 lin (ref15) 0 ref2 ref1 ref17 ref16 ref19 ref18 maymounkov (ref10) 0 press (ref35) 2007 ref23 ref26 ref25 heidarzadeh (ref31) 0 ref20 chou (ref9) 0 ref21 ref28 tang (ref24) 0 ref27 shalizi (ref33) 0 ref29 mitzenmacher (ref32) 2004 ref8 ref7 ref4 ref3 ref6 ref5 mahdaviani (ref22) 0
References_xml	– ident: ref8 doi: 10.1109/IWQOS.2007.376547 – ident: ref6 doi: 10.1109/TIT.2005.864424 – ident: ref5 doi: 10.1109/ISIT.2006.261636 – ident: ref29 doi: 10.1017/S0305004100036781 – ident: ref25 doi: 10.1109/SFCS.2002.1181950 – year: 0 ident: ref31 – ident: ref11 doi: 10.1109/ITWKSPS.2010.5503153 – ident: ref2 doi: 10.1109/TIT.2002.807285 – ident: ref7 doi: 10.1016/j.phycom.2008.01.006 – ident: ref21 doi: 10.1109/ISIT.2012.6283956 – year: 0 ident: ref9 article-title: Practical network coding publication-title: Proc Allerton Conf – start-page: 13 year: 0 ident: ref15 article-title: CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding publication-title: Proc IEEE Int Conf Netw Protocols – ident: ref23 doi: 10.1109/ITW.2014.6970863 – ident: ref30 doi: 10.1109/ISIT.2011.6034246 – ident: ref26 doi: 10.1109/TIT.2006.874390 – ident: ref4 doi: 10.1109/TIT.2006.881746 – year: 2007 ident: ref35 publication-title: Numerical Recipes The Art of Scientific Computing – ident: ref14 doi: 10.1145/1282427.1282400 – ident: ref19 doi: 10.1109/INFCOM.2010.5462030 – ident: ref1 doi: 10.1109/18.850663 – year: 2004 ident: ref32 publication-title: Probability and Computing Randomized Algorithms and Probabilistic Analysis – year: 0 ident: ref24 – ident: ref18 doi: 10.1109/INFCOM.2010.5462249 – ident: ref12 doi: 10.1109/NETCOD.2009.5191397 – ident: ref34 doi: 10.1017/CBO9780511804441 – ident: ref16 doi: 10.1109/TNET.2011.2111382 – year: 0 ident: ref22 article-title: Overhead-optimized gamma network codes publication-title: Proc IEEE Int Symp Netw Coding – ident: ref3 doi: 10.1109/ISIT.2003.1228459 – ident: ref28 doi: 10.1109/TIT.2007.907513 – year: 0 ident: ref33 – ident: ref20 doi: 10.1109/TIT.2010.2095111 – ident: ref36 doi: 10.1145/2628036 – ident: ref17 doi: 10.1109/JPROC.2010.2093850 – ident: ref27 doi: 10.1109/ISIT.2011.6034050 – ident: ref13 doi: 10.1109/TIT.2014.2334315 – year: 0 ident: ref10 article-title: Methods for efficient network coding publication-title: Proc Allerton Conf
SSID	ssj0006209
Score	2.3042498
Snippet	As a variation of random linear network coding, segmented network coding (SNC) has attracted great interest in data dissemination over lossy networks due to...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	929
SubjectTerms	Adaptive scheduling Coding Decoding Encoding Forward error correction Linear programming Mathematical models Network coding Networks Random linear network coding Reliability Scheduling scheduling strategy Segmentation segmented network coding Segments Transfer matrices
Title	Near-Optimal One-Sided Scheduling for Coded Segmented Network Coding
URI	https://ieeexplore.ieee.org/document/7110514 https://www.proquest.com/docview/1787202797 https://www.proquest.com/docview/1816045081
Volume	65
WOSCitedRecordID	wos000370729600021&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9956 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006209 issn: 0018-9340 databaseCode: RIE dateStart: 19680101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLYAcYADAwZiMFCROHCgW_ogSY9oMHEaSAyJW5UmDkyCDsHG78dJuwoEHLhVqdNGcWx_Thwb4MRqnWgjyC3hioepLUxYpEyHGcsMAWiGLC18sQkxGsmHh-x2Cc6auzCI6IPPsOce_Vm-meq52yrrC7JV565q9bIQorqr1WhdvgjniEiAk5TVaXwilvXHAxfCdd6LCRqILP5mgXxJlR962BuXYet_w9qEjRpEBhcV17dgCcttaC0KNAS1vG7D-pdsg224HNGqDm9IR7xQ55sSw7uJQUPkT2Rv3LX0gBBsMJj6Rnz06TpNMKoCxV07kezA_fBqPLgO6yIKoU6knIVKSS65NqoQ3AjU1hLGSlWcmALJNzKRRsUii4xpTCRTzKqY7BV1SyxXRiW7sFJOS9yDILay0IKLxBpLjhLKTGLqEsgzQjERig70FhOb6zrDuCt08Zx7T4Nl-XiQO07kNSc6cNp0eK2Sa_xN2nYT35DVc96B7oJzeS1873lESsjt6WQ0ouPmNYmNOwtRJU7nRCMjTmiWANH-718-gDX6P6_CzbqwMnub4yGs6o_Z5P3tyK-9T3_k1hI
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED9VG9LGw8baTZQNCBIPPJDO-ajtPKLAVESXIq1Ie4sc-zwqQYq6lr9_Z-dDIOCBt8g5W5bPd_c7-3wH8NpqnWgjyC3hioeprUxYpUyHGcsMAWiGLK18sQlRFPL2Nvs8gLf9WxhE9MFnOHGf_i7frPXOHZVdCrJVU1e1en-apnHUvNbq9S7vAjoiEuEkZW0in4hll8vcBXFNJzGBA5HFv9kgX1TlD03szcvV8f9N7AkctTAyeNfw_QQGWA_huCvRELQSO4THv-QbHMH7gvZ1uCAt8Z06L2oMb1YGDZF_JYvjHqYHhGGDfO0b8c4n7DRB0YSKu3YiOYUvVx-W-SxsyyiEOpFyGyolueTaqEpwI1BbSygrVXFiKiTvyEQaFYssMqYxkUwxq2KyWNQtsVwZlZzBXr2u8SkEsZWVFlwk1lhylVBmElOXQp4RjolQjGHSLWyp2xzjrtTFt9L7Giwrl3npOFG2nBjDm77Djya9xr9JR27he7J2zcdw0XGubMXvvoxIDblTnYxm9Kr_TYLjbkNUjesd0ciIE54lSPTs7yO_hIPZ8npezj8Wn87hkObCm-CzC9jbbnb4HB7pn9vV_eaF34cPy0XZWQ
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=Near-Optimal+One-Sided+Scheduling+for+Coded+Segmented+Network+Coding&rft.jtitle=IEEE+transactions+on+computers&rft.au=Tang%2C+Bin&rft.au=Yang%2C+Shenghao&rft.au=Ye%2C+Baoliu&rft.au=Guo%2C+Song&rft.date=2016-03-01&rft.issn=0018-9340&rft.volume=65&rft.issue=3&rft.spage=929&rft.epage=939&rft_id=info:doi/10.1109%2FTC.2015.2435792&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon