Zobraziť v EDS

System and technique for sliding window network coding-based packet generation

Uložené v:
Podrobná bibliografia
Názov: System and technique for sliding window network coding-based packet generation
Patent Number: 11424,861
Dátum vydania: August 23, 2022
Appl. No: 16/497555
Application Filed: March 29, 2018
Abstrakt: A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a “shifted” row echelon coefficient matrix.
Inventors: Massachusetts Institute of Technology (Cambridge, MA, US); Code On Network Coding, LLC (Cambridge, MA, US); Technische Universität Dresden (Dresden, DE)
Assignees: Massachusetts Institute of Technology (Cambridge, MA, US), Code On Network Coding, LLC (Cambridge, MA, US), Technische Universität Dresden (Dresden, DE)
Claim: 1. A method of decoding packetized data in the presence of packet erasures, the method comprising, by a decoder, repeatedly: receiving a coded packet comprising a packet sequence number, a coefficient vector having a fixed length w, and a coded symbol encoded as a linear combination of w input symbols using the coefficient vector; determining whether the packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number; and when the packet sequence number is within the sliding window, decoding the coded symbol into one or more of the w input symbols using the coefficient vector.
Claim: 2. A method according to claim 1 , wherein the fixed size of the sliding window was predetermined according to a round-trip time for data traveling between the decoder and an encoder via a data channel.
Claim: 3. A method according to claim 1 , wherein receiving comprises receiving a coded packet having a packet sequence number that is out of order.
Claim: 4. A method according to claim 1 , wherein receiving comprises receiving a plurality of packets including the coded packet and decoding comprises correcting an error in one of the plurality of packets according to a forward error correcting code.
Claim: 5. A method according to claim 1 , wherein decoding comprises decoding according to a systematic code or a linear network code.
Claim: 6. A method according to claim 1 , wherein decoding comprises setting the decoder sequence number equal to the packet sequence number of the received packet when the packet sequence number of the received packet is greater than the decoder sequence number.
Claim: 7. A method according to claim 1 , wherein decoding using the coefficient vector comprises generating a packet erasure when the coefficient vector has a non-zero entry associated with an input symbol whose sequence number is outside the sliding window.
Claim: 8. A method according to claim 1 , wherein decoding using the coefficient vector comprises performing Gaussian elimination on a matrix, one row of which includes the coefficient vector.
Claim: 9. A method according to claim 8 , wherein decoding using the coefficient vector comprises, prior to performing the Gaussian elimination, deleting each row of the matrix that has a non-zero coefficient entry associated with an input symbol whose sequence number is outside the sliding window.
Claim: 10. A method according to claim 8 , wherein performing the Gaussian elimination comprises pivoting on a column of the matrix whose index equals the decoder sequence number modulo the size of the sliding window.
Claim: 11. A method according to claim 1 , further comprising the decoder providing feedback to an encoder via a data channel, thereby enabling the encoder to transmit, via the data channel, one or more packets reencoding any data that the decoder did not decode due to a packet erasure.
Claim: 12. The method of claim 1 wherein: the packet sequency number comprises a largest sequence number of an input symbol used in the encoding of the coded symbol; and decoding the coded symbol includes using forward error correction (FEC) based on a latest f
Claim: 13. A decoder for decoding packetized data in the presence of packet erasures, the decoder comprising: a buffer for receiving a coded symbol from a coded packet comprising a packet sequence number, a coefficient vector having a fixed length w, and the coded symbol encoded as a linear combination of w input symbols using the coefficient vector; a register for storing a decoder sequence number; a determining unit for determining whether the packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than the decoder sequence number stored in the register; and a decoding module for decoding, when the determining unit determines that the packet sequence number is within the sliding window, the received coded symbol into one or more of the w input symbols using the coefficient vector.
Claim: 14. A decoder according to claim 13 , wherein the buffer can receive a plurality of symbols including the coded symbol, from a corresponding plurality of packets including the coded packet, and the decoding module can correct an error in one of the plurality of packets according to a forward error correcting code.
Claim: 15. A decoder according to claim 13 , wherein the decoding module can decode according to a systematic code or a linear network code.
Claim: 16. A decoder according to claim 13 , wherein the decoding module can write the packet sequence number of a received packet into the register when the packet sequence number of the received packet is greater than the decoder sequence number stored in the register.
Claim: 17. A decoder according to claim 13 , wherein the decoding module can generate a packet erasure when the coefficient vector has a non-zero entry associated with an input symbol whose sequence number is outside the sliding window.
Claim: 18. A decoder according to claim 13 , further comprising a memory for storing a matrix, wherein the decoding module can store the coefficient vector in one row of the matrix and performing Gaussian elimination on the matrix.
Claim: 19. A decoder according to claim 18 , wherein the decoding module can delete from the memory, prior to performing the Gaussian elimination, each row of the matrix that has a non-zero coefficient entry associated with an input symbol whose sequence number is outside the sliding window.
Claim: 20. A decoder according to claim 18 , wherein the decoding module can perform the Gaussian elimination by pivoting on a column of the matrix whose index equals the decoder sequence number modulo the size of the sliding window.
Claim: 21. A decoder according to claim 13 , further comprising a feedback module capable of providing feedback to an encoder via a data channel, thereby enabling the encoder to transmit, via the data channel, one or more packets reencoding any data that the decoder did not decode due to a packet erasure.
Claim: 22. The decoder of claim 13 wherein: the packet sequence number comprises a largest sequence number of an input symbol used in the encoding of the coded symbol; the decoder sequence number corresponds to a largest packet sequency number received by the decoder; the sliding window has a fixed size w determined by measuring a round-trip time; and the decoding module is configured to use forward error correction based on a latest f
Claim: 23. A decoder for decoding packetized data in the presence of packet erasures, the decoder comprising: receiving means for receiving a coded symbol from a coded packet comprising a packet sequence number, a coefficient vector having a fixed length w, and the coded symbol encoded as a linear combination of w input symbols using the coefficient vector; storing means for storing a decoder sequence number; determining means for determining whether the packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than the decoder sequence number stored in a register; and decoding means for decoding, when the determining means determines that the packet sequence number is within the sliding window, the received coded symbol into one or more of the w input symbols using the coefficient vector.
Patent References Cited: 5577056 November 1996 Malik et al.
5870412 February 1999 Schuster et al.
6128773 October 2000 Snider
6621851 September 2003 Agee et al.
6885653 April 2005 Choi et al.
7064489 June 2006 Price
7071853 July 2006 Price
7095343 August 2006 Xie et al.
7164691 January 2007 Knapp et al.
7283564 October 2007 Knapp et al.
7349440 March 2008 Chou et al.
7408938 August 2008 Chou
7414978 August 2008 Lun et al.
7529198 May 2009 Jain et al.
7706365 April 2010 Effros et al.
7760728 July 2010 Chou et al.
7821980 October 2010 Chakrabarti et al.
7876677 January 2011 Cheshire
7912003 March 2011 Radunovic et al.
7930617 April 2011 Gass et al.
7945842 May 2011 He
8040836 October 2011 Wu et al.
8068426 November 2011 Sundararajan et al.
8130776 March 2012 Sundararajan
8279781 October 2012 Lucani et al.
8451756 May 2013 Lucani et al.
8482441 July 2013 Medard et al.
8504504 August 2013 Liu
8571214 October 2013 Lima et al.
8780693 July 2014 Kim et al.
9019643 April 2015 Medard et al.
9025607 May 2015 Zeger et al.
9137492 September 2015 Lima et al.
9143274 September 2015 Zeger et al.
9160687 October 2015 Haeupler et al.
9185529 November 2015 Medard et al.
9253608 February 2016 Medard et al.
9271123 February 2016 Medard et al.
9294113 March 2016 Feizi-Khankandi et al.
9361936 June 2016 Medard et al.
9369255 June 2016 Medard et al.
9369541 June 2016 Medard et al.
9537759 January 2017 Calmon et al.
9544126 January 2017 Zeger et al.
9559831 January 2017 Zeger et al.
9607003 March 2017 Medard et al.
2003/0055614 March 2003 Pelikan
2003/0214951 November 2003 Joshi et al.
2004/0001494 January 2004 Barrack et al.
2004/0062248 April 2004 Nagarajan et al.
2004/0203752 October 2004 Wojaczynski et al.
2005/0010675 January 2005 Jaggi et al.
2005/0078653 April 2005 Agashe et al.
2005/0152391 July 2005 Effros et al.
2005/0251721 November 2005 Ramesh et al.
2006/0020560 January 2006 Rodriguez et al.
2006/0146791 July 2006 Deb et al.
2006/0224760 October 2006 Yu et al.
2007/0046686 March 2007 Keller
2007/0116027 May 2007 Ciavaglia et al.
2007/0274324 November 2007 Wu et al.
2008/0043676 February 2008 Mousseau et al.
2008/0049746 February 2008 Morrill et al.
2008/0104488 May 2008 Cheng
2008/0123579 May 2008 Kozat et al.
2008/0259796 October 2008 Abousleman et al.
2008/0291834 November 2008 Chou et al.
2008/0320363 December 2008 He
2009/0003216 January 2009 Radunovic et al.
2009/0135717 May 2009 Kamal et al.
2009/0153576 June 2009 Keller
2009/0175320 July 2009 Haustein et al.
2009/0198829 August 2009 Sengupta et al.
2009/0207930 August 2009 Sirkeci et al.
2009/0238097 September 2009 Le Bars et al.
2009/0248898 October 2009 Gkantsidis et al.
2009/0285148 November 2009 Luo et al.
2009/0310582 December 2009 Beser
2009/0313459 December 2009 Horvath
2009/0316763 December 2009 Erkip et al.
2010/0014669 January 2010 Jiang
2010/0046371 February 2010 Sundararajan et al.
2010/0054164 March 2010 Lucani et al.
2010/0057636 March 2010 Brennan
2010/0111165 May 2010 Kim et al.
2010/0146357 June 2010 Larsson
2011/0238855 September 2011 Korsunsky et al.
2011/0243324 October 2011 Lima et al.
2012/0218891 August 2012 Sundararajan et al.
2012/0300692 November 2012 Sfar et al.
2013/0077501 March 2013 Krishnaswamy et al.
2013/0107764 May 2013 Zeger et al.
2013/0114481 May 2013 Kim et al.
2013/0114611 May 2013 Zeger et al.
2013/0195106 August 2013 Calmon
2015/0256354 September 2015 Zeger et al.
2015/0372809 December 2015 Lima et al.
2016/0006676 January 2016 Haeupler et al.
2016/0154970 June 2016 Calmon et al.
2016/0157127 June 2016 Zeger et al.
2016/0302134 October 2016 Kim et al.
1 638 239 March 2006
WO 2007/109216 September 2007
WO 2010/005181 January 2010
WO 2010/005181 January 2010
WO 2010/025362 March 2010
WO 2010/025362 March 2010
WO 2011/043754 April 2011
WO 2011/119909 September 2011
WO 2012/167034 December 2012
WO 2013/006697 January 2013
WO 2013/067488 May 2013
WO 2013/116456 August 2013
WO2014/078596 May 2014
WO 2014/159570 October 2014
WO 2014/160194 October 2014
Other References: Karzand et al: “Low delay random linear coding over a stream”, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Sep. 1, 2015 (Sep. 1, 2015), XP055293611, ISBN: 978-1-4799-8009-3 https://arxiv.org/pdf/1509.00167v1.pdf (Year: 2015). cited by examiner
U.S. Appl. No. 15/427,536, filed Feb. 8, 2017, Medard et al. cited by applicant
U.S. Appl. No. 15/358,776, filed Nov. 22, 2016, Calmon, et al. cited by applicant
PCT International Search Report and Written Opinion of the ISA for Appl. No. PCT/US2013/24039 dated Apr. 12, 2013. cited by applicant
PCT International Search Report of the ISA for PCT/US2009/055359 dated Mar. 30, 2011. cited by applicant
PCT Written Opinion of the ISA for PCT/US2009/055359 dated Mar. 30, 2011. cited by applicant
International Preliminary Report on Patentability of the ISA for PCT/US2009/055359 dated Apr. 12, 2011. cited by applicant
U.S. Pat. No. 8,279,781 issued on Oct. 2, 2012 (Lucani et al.); Part 1 of 3. cited by applicant
U.S. Pat. No. 8,279,781 issued on Oct. 2, 2012 (Lucani et al.); Part 2 of 3. cited by applicant
U.S. Pat. No. 8,279,781 issued on Oct. 2, 2012 (Lucani et al.); Part 3 of 3. cited by applicant
U.S. Pat. No. 8,451,756 issued on May 28, 2013 (Lucani et al.); Part 1 of 4. cited by applicant
U.S. Pat. No. 8,451,756 issued on May 28, 2013 (Lucani et al.); Part 2 of 4. cited by applicant
U.S. Pat. No. 8,451,756 issued on May 28, 2013 (Lucani et al.); Part 3 of 4. cited by applicant
U.S. Pat. No. 8,451,756 issued on May 28, 2013 (Lucani et al.); Part 4 of 4. cited by applicant
PCT International Preliminary Report on Patentability with Written Opinion for PCT/US2013/024039 dated Aug. 5, 2014 7 Pages. cited by applicant
European Extended Search Report dated Aug. 7, 2015 corresponding to European Application No. 13742964.3; 11 Pages. cited by applicant
Tomozei et al., “First Report on Novel Protocol Components with Network Coding;” Network Coding for Robust Architectures in Volatile Environments: Collaborate Project, No. 215252; Submitted Jan. 15, 2010; 78 Pages. cited by applicant
Zhuoqun et al., “An Improved MPTCP in Coded Wireless Mesh Networks;” Proceedings of the 2nd IEEE International Conference on Broadband Network and Multimedia Technology; Oct. 18, 2009; 6 Pages. cited by applicant
Response (with Amended Claims) to European Office Action dated Apr. 8, 2016 corresponding to European Application No. 13742964.3; Response filed on Jun. 20, 2016; 12 Pages. cited by applicant
U.S. Non-Final Office Action dated Jun. 30, 2015 corresponding to U.S. Appl. No. 13/754,398; 29 Pages. cited by applicant
Response to U.S. Non-Final Office Action dated Jun. 30, 2015 corresponding to U.S. Appl. No. 13/754,398; Response filed Oct. 29, 2015; 13 Pages. cited by applicant
U.S. Final Office Action dated Feb. 16, 2016 corresponding to U.S. Appl. No. 13/754,398; 21 Pages. cited by applicant
Response to U.S. Final Office Action dated Feb. 16, 2016 corresponding to U.S. Appl. No. 13/754,398; Response filed on Aug. 12, 2016; 7 Pages. cited by applicant
Notice of Allowance dated Aug. 25, 2016 corresponding to U.S. Appl. No. 13/754,398; 8 Pages. cited by applicant
Response to Communication under Rule 71 (3) dated Aug. 8, 2017 from European Patent Application No. 13742964.3 as filed on Nov. 20, 2017; 6 Pages. cited by applicant
Communication Under Rule 71(3) EPC dated Dec. 14, 2017 from European Appl. No. 13742964.3; 66 Pages. cited by applicant
U.S. Non-Final Office Action dated Jul. 27, 2017 for U.S. Appl. No. 15/358,776; 55 Pages. cited by applicant
Response to U.S. Non-Final Office Action dated Jul. 27, 2017 for U.S. Appl. No. 15/358,776; Response filed on Oct. 27, 2017; 18 pages. cited by applicant
Notice of Allowance dated Mar. 7, 2018 for U.S. Appl. No. 15/358,776; 21 pages. cited by applicant
PCT International Preliminary Report on Patentability dated Oct. 1, 2019 for International Application No. PCT/US2018/025168; 9 Pages. cited by applicant
Bilbao et al., “Network Coding in the Link Layer for Reliable Narrowband Powerline Communications;” Proceedings of the IEEE Journal on Selected Areas in Communications, vol. 34, No. 7; Jul. 2016; 13 Pages. cited by applicant
Cloud et al., “Multi-Path Low Delay Network Codes;” IEEE Global Communications Conference (GLOBECOM) 2016; Sep. 2016; pp. 272-285; 7 Pages. cited by applicant
Cloud et al., “Network Coding Over SATCOM: Lessons Learned;” International Conference on Wireless and Satellite Systems, vol. 154; Jun. 2015; 14 Pages. cited by applicant
Karafillis et al., “An Algorithm for Improving Sliding Window Network Coding in TCP;” 47th Annual Conference on Information Sciences and Systems (CISS); Mar. 2013; 5 Pages. cited by applicant
Karzand et al., “Low Delay Random Linear Coding Over a Stream;” 52nd Annual Allerton Conference on Communication, Control, and Computing; Sep. 30, 2014; 14 Pages. cited by applicant
Kim et al., “Network Coded TCP (CTCP);” ACM Mobicom 2013; Last Revised Apr. 12, 2013; 12 Pages. cited by applicant
Roca et al., “Block or Convolutional AL-FEC Codes? A Performance Comparison for Robust Low-Latency Communications;” PRIVATICS—Privacy Models, Architectures and Tools for the Information Society; Feb. 20, 2017; 7 Pages. cited by applicant
Sundararajan et al., “Network Coding Meets TCP;” Proceedings of IEEE INFOCOM; Oct. 2008; pp. 280-288; 9 Pages. cited by applicant
PCT International Search Report and Written Opinion dated Jul. 12, 2018 for International Application No. PCT/US2018/025168; 17 Pages. cited by applicant
Examination Report dated Nov. 10, 2020 for European Application No. 18720064.7; 5 pages. cited by applicant
“Data Service Options for Spread Spectrum Systems: Radio Link Protocol Type 3;” 3GPP2 C.S0017-010-A; Version 2.0; Sep. 2005. cited by applicant
“Guest Editorial Wireless Video Transmission;” IEEE Journal on Selected Areas in Communications; vol. 28; No. 3; Apr. 2010; pp. 297-298. cited by applicant
Abichar, et al.; “WiMax vs. LTE: Who Will Lead the Broadband Mobile Internet?;” Mobile Computing; IEEE Computer Society; IT Pro May/Jun. 2010; pp. 26-32. cited by applicant
AbuZeid, et al.; “IR-HARQ vs. Joint Channel-Network Coding for Cooperative Wireless Communication;” Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT); Aug. 2011; pp. 39-43. cited by applicant
Acedanski, et al.; “How Good is Random Linear Coding Based Distributed Network Storage?;” Proc. 1st Workshop on Network Coding, Theory, and Applications (Netcod'05); Apr. 2005; 6 pages. cited by applicant
Adamson, et al.; “Multicast Negative-Acknowledgment (NACK) Building Blocks;” Internet Engineering Task Force (IETF),RFC; vol. 5401; Nov. 2008; 42 pages. cited by applicant
Adamson, et al.; “NACK-Oriented Reliable (NORM) Transport Protocol;” Internet Engineering Task Force (IETF); RFC; vol. 5740; Nov. 2009; 94 pages. cited by applicant
Adamson, et al.; “Quantitative Prediction of NACK-Oriented Reliable Multicast (NORM) Feedback;” Proceedings, MILCOM 2000; vol. 2; Oct. 2002; 6 pages. cited by applicant
Ahiswede, et al.; “Network Information Flow;” IEEE Transactions on Information Theory; vol. 46; No. 4; Jul. 2000; pp. 1204-1216. cited by applicant
Ahmed, et al.; “On the Scaling Law of Network Coding Gains in Wireless Networks;” IEEE; MILCOM 2007; Oct. 2007; 7 pages. cited by applicant
Allman, et al.; “Fast Retransmit / Fast Recovery—TCP Congestion Control;” IETF; Section 3.2; RFC 2581; http://tools.ietf.org/html/rfc2581#section-3.2; Apr. 1999; downloaded on Nov. 2, 2011; 14 pages. cited by applicant
Armstrong, et al.; “Distributed Storage with Communcation Costs;” IEEE Forty-Ninth Annual Allerton Conference—Allerton House; Sep. 28-30, 2011; pp. 1358-1365. cited by applicant
Awerbuch, et al.; “On-Line Generalized Steiner Problem;” Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms; pp. 1-12; 1996. cited by applicant
Baek, et al.; “The International Journal of Computer and Telecommunications Networking;” vol. 56; Issue 6; Apr. 2012; pp. 1745-1762. cited by applicant
Baron, et al.; “Coding Schemes for Multislot Messages in Multichannel ALOHA With Deadlines;” IEEE Transactions on Wireless Communications; vol. 1; No. 2; Apr. 2002; pp. 292-301. cited by applicant
Bellare, et al.; “A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation;” Proc. 38th Annual Symposium on Foundations of Computer Science; Oct. 1997; pp. 1-32. cited by applicant
Berman, et al.; “Improved Approximations for the Steiner Tree Problem;” Jorunal of Algorithms; Chapter 39; pp. 325-334. cited by applicant
Bhadra, et al.; “Looking at Large Networks: Coding vs. Queuing;” Proc. of the 25th IEEE International Conference on Computer Communications (INFOCOM); Apr. 2006; 12 pages. cited by applicant
Bharath-Kumar, et al.; “Routing to Multiple Destinations in Computer Networks;” IEEE Transactions on Communications; vol. Com-31; No. 3; Mar. 1983; pp. 343-351. cited by applicant
Bhargava, et al.; “Forward Error Correction Coding;” Mobile Communications Handbook; Part 1: Basic Principals; 1999; 18 pages. cited by applicant
Birk, et al.; “Judicious Use of Redundant Transmissions in Multichannel ALOHA Networks with Deadlines;” IEEE Journal on Selected Areas in Communications; vol. 17; No. 2; Feb. 1999; pp. 257-269. cited by applicant
Bisson, et al.; “Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests;” Proceedings of the Fifteenth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'07); Oct. 2007; pp. 402-409. cited by applicant
Bonnin, et al.; “Automatic Multi-Interface Management Through Profile Handling;” Springer; Mobile Networks and Applications; Feb. 2009; pp. 4-17. cited by applicant
Borokhovich, et al.; “Tight bounds for Algebraic Gossip on Graphs;” Proc. of the IEEE International Symposium on Information Theory (ISIT); Jun. 13-18, 2010; 14 pages. cited by applicant
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks”; IEEE INFOCOM; 2010 Proceedings IEEE; Mar. 14-19, 2010; 9 pages. cited by applicant
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks;” Power Point Presentation; BCAM Seminar; Bilbao, Sep. 30, 2010; 36 pages. cited by applicant
Bui, et al.; “A Markovian Approach to Multipath Data Transfer in Overlay Networks;” IEEE Transactions on Parallel and Distributed Systems; vol. 21; No. 10; Oct. 2010; pp. 1398-1411. cited by applicant
Cai, et al.; “Secure Network Coding;” IEEE; ISIT; Jun. 30-Jul. 5, 202; p. 323. cited by applicant
Calmon, et al.; “Network Coding Over Multiple Network Interfaces Using TCP;” Presentation; Information Theory and Applications Workshop (ITA) 2012; San Diego, CA; Feb. 5, 2012; 55 pages. cited by applicant
Cardinal, et al; “Minimum Entrophy Combinatorial Optimization Problems;” Data Structure and Algorithms, Discrete Mathematics; Aug. 17, 2010; pp. 1-16. cited by applicant
Castro, et al.; “Upper and Lower Error Bounds for Active Learning;” The 44'th Annual Allerton Conference on Communication, Control and Computing; vol. 2, No. 2.1; 2006, 10 pages. cited by applicant
Celik, et al.; “MAC for Networks with Multipacket Reception Capability and Spatially Distributed Nodes;” Proc. IEEE INFOCOM 2008; Apr. 2008; 9 pages. cited by applicant
Celik; “Distributed MAC Protocol for Networks with Multipacket Reception Capability and Spatially Distributed Nodes;” Master's Thesis; MIT Department of Electrical Engineering and Computer Science; May 2007; 127 pages. cited by applicant
Cha, et al.; “I Tube, You Tube, Eveybody Tubes: Analyzing the World's Largest User Generated Content Video System;” 7th ACM GIGCOMM Conference on Internet Measurement; IMC'07; Oct. 24-26, 2007; 13 pages. cited by applicant
Chakrabarti, et al.; “Approximation Algorithms for the Unsplittable Flow Problem;” Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization; Sep. 2005, pp. 1-27. cited by applicant
Chakrabarti, et al.; Approximation Algorithms for the Unsplittable Flow Problem; Algorithmica (2007); Springer Science—Business Media, Aug. 2006; 16 pages. cited by applicant
Charikar, et al.; “Approximation Algorithms for Directed Steiner Problems;” Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 1-15; 1998. cited by applicant
Chen, et al.; “Pipeline Network Coding for Multicast Streams;” ICMU Org.; 2010; 7 pages. cited by applicant
Chou, et al.; “FEC and Pseudo-ARQ for Receiver-driven Layered Multicast of Audio and Video;” Data Compression Conference (DCC), 2000; Proceedings; Jan. 2000; 10 pages. cited by applicant
Chou, et al.; “Practical Network Coding;” Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing; Oct. 2003; 10 pages. cited by applicant
Cisco Visual Networking Index: Forecast and Methodology; 2009-2014; White Paper; Jun. 2, 2010; pp. 1-17. cited by applicant
Cloud, et al.; “Co-Designing Multi-Packet Reception, Network Coding, and MAC Using a Simple Predictive Model;” arXiv:1101.5779v1 [cs.NI]; Submitted to W.Opt 2011;Jan. 30, 2011; pp. 1-8. cited by applicant
Cloud, et al.; “Effects of MAC approaches on non-monotonic saturation with COPE—a simple case study;” Military Communication Conference, 2011—MILCOM; Aug. 11, 2011; 7 pages. cited by applicant
Cloud, et al.; “MAC Centered Cooperation—Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput;” IEEE Journal on Selected Areas in Communications; vol. 30; No. 2; Feb. 2012; pp. 1-8. cited by applicant
Cloud, et al.; “Multi-Path TCP with Network Coding;” Wireless@mit—MIT Center for Wireless Networks and Mobile Computing; 2012 Inaugural Retreat; Oct. 10-11, 2012. cited by applicant
Cloud, et al; U.S. Appl. No. 13/654,953, filed Oct. 18, 2012. cited by applicant
Costa, et al.; “Informed Network Coding for Minimum Decoding Delay;” Fifth IEEE International Conference on Mobile Ad-hoc and Sensor Systems; Sep. 2008; pp. 80-91. cited by applicant
Coughlin, et al.; Years of Destiny: HDD Capital Spending and Technology Developments from 2012-2016; IEEE Santa Clara Valley Magnetics Society; Jun. 19, 2012; pp. 1-28. cited by applicant
Dana, et al.; “Capacity of Wireless Erasure Networks;” IEEE Transactions on Information Theory; vol. 52; No. 3; Mar. 2006; pp. 789-804. cited by applicant
Dana, et al.; “Capacity of Wireless Erasure Networks;” Jan. 2006; 41 pages. cited by applicant
Deb, et al.; “Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering;” Proc. of the 42nd Allerton Conference on Communication, Control, and Computing; Jan. 2004; 10 pages. cited by applicant
Deb, et al.; “On Random Network Coding Based Information Dissemination;” Proc. of the IEEE International Symposium on Information Theory (ISIT); Sep. 4-9, 2005; 5 pages. cited by applicant
Demers, et al.; “Epidemic Algorithms for Replicated Database Maintenance;” PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing; Jan. 1987; pp. 1-12. cited by applicant
Dias, et al.; “Performance Analysis of HARQ in WiMax Networks Considering Imperfect Channel Estimation;” The 7th International Telecommunications Symposium (ITS 2010); 2010; 5 pages. cited by applicant
Dimakis, et al.; “A Survey on Network Codes for Distributed Storage;” Proceedings of the IEEE; vol. 99; No. 3; Mar. 2011; pp. 476-489. cited by applicant
Dimakis, et al.; “Network Coding for Distributed Storage Systems;” IEEE/ACM Transactions on Information Theory; vol. 56; No. 9; pp. 1-13. cited by applicant
Donoho, et al.; “Estimating Covariances of Locally Stationary Processes: Rates of Convergence of Best Basis Methods;” Statistics, Stanford University, Stanford, California, USA, Tech. Rep; 1998; pp. 1-64. cited by applicant
Effros; Distortion-Rate Bounds for Fixed-and Variable-Rate Multiresolution Source Codes; IEEE Transactions on Information Theory; vol. 45, No. 6; Sep. 1999; pp. 1887-1910. cited by applicant
Effros; “Universal Multiresolution Source Codes;” IEEE Transactions on Information Theory; vol. 47; No. 6; Sep. 2001; pp. 2113-2129. cited by applicant
El Bahri, et al.; “Performance Comparison of Type I, II and III Hybrid ARQ Schemes over AWGN Channels;” 2004 IEEE International Conference on Industrial Technology (ICIT); vol. 3; Dec. 8-10, 2004; pp. 1417-1421. cited by applicant
Eryilmaz, et al.; On Delay Performance Gains From Network Coding; Information Sciences and Systems; 2006 40th Annual Conference on Mar. 22-24, 2006; 7 pages. cited by applicant
Fan, et al.; “Reliable Relay Assisted Wireless Multicast Using Network Coding;” IEEE Journal on Selected Areas in communications; vol. 27; No. 5; Jun. 2009; pp. 749-762. cited by applicant
Feizi, et al.; “Locally Adaptive Sampling;” Communication, Control, and Computing; 2010; 48th Annual Allerton Conference, IEEE; Sep. 29, 2010; pp. 152-159. cited by applicant
Feizi, et al.; “On Network Functional Compression;” arXiv online repository; URL: http://arxiv.org/pdf/1011.5496v2.pdf; Nov. 30, 2010p pp. 1-60. cited by applicant
Feizi, et al.; “When Do Only Sources Need to Compute? On Functional Compression in Tree Networks;” 47th Annual Allerton Conference, IEEE; Sep. 30, 2009; pp. 447-454. cited by applicant
Feizi, et al; “Cases Where Finding a Minimum Entrophy Coloring of a Characteristic Graph is a Polynomial Time Problem;” IEEE International Symposium on Information Theory; Jun. 13, 2010; pp. 116-120. cited by applicant
Ferner, et al.; “Toward Sustainable Networking: Storage Area Networks with Network Coding;” Fiftieth Annual Allerton Conference; IEEE; Oct. 1-5, 2012; pp. 517-524. cited by applicant
Ford; “Architectural Guidelines for Multipath TCP Development;” Internet Engineering Task Force; Internet-Draft; Dec. 8, 2010; 17 pages. cited by applicant
Ford; “TCP Extension for Multipath Operation with Multiple Addresses draft-ford-mptcp-multiaddressed-03;” Internet Engineering Task Force; Internet-Draft; Mar. 8, 2010; 35 pages. cited by applicant
Fragouli, et al.; “Wireless Network Coding: Opportunities & Challenges;” MILCOM; Oct. 2007; 8 pages. cited by applicant
Frossard, et al.; “Media Streaming With Network Diversity;” Invited Paper; Proceedings of the IEEE; vol. 96, No. 1; Jan. 2008; pp. 39-53. cited by applicant
Galbraith, et al.; (HGST); “Iterative Detection Read Channel Technology in Hard Disk Drives;” Whitepaper; Nov. 2008; 8 pages. cited by applicant
Garcia-Luna-Aceves; “Challenges: Towards Truly Scalable Ad Hoc Networks;” MobiCom 2007; Sep. 2007; pp. 207-214. cited by applicant
Garcia-Luna-Aceves; “Extending the Capacity of Ad Hoc Networks Beyond Network Coding;” IWCMC 07; Proceedings of the 2007 International Conference on Wireless Communications and Mobile Computing; ACM; 2007; pp. 91-96. cited by applicant
Ghaderi, et al.; Reliability Gain of Network Coding in Lossy Wireless Networks; Infocom 2008; The 27th Conference on Computer Communications IEEE; Apr. 13-18, 2008; 5 pages. cited by applicant
Gheorghiu, et al.; “Multipath TCP with Network Coding for Wireless Mesh Networks;” IEEE Communications (ICC) 2010 International Conference; May 23-27, 2010; 5 pages. cited by applicant
Gheorghiu, et al.; “On the Performance of Network Coding in Multi-Resolution Wireless Video Streaming;” IEEE International Symposium on Jun. 9-11, 2010; 6 pages. cited by applicant
Ghez, et al.; “Stability Properties of Slotted Aloha with Multipacket Reception Capability;” IEEE Transactions on Automatic Control; vol. 33; No. 7; Jul. 1988; pp. 640-649. cited by applicant
Gkantsidis, et al.; “Cooperative Security for Network Coding File Distribution;” Proc. IEEE Infocom; Apr. 2006; 13 pages. cited by applicant
Gollakota, et al.; “ZigZag Decoding: Combating Hidden Terminals in Wireless Networks;” SIGCOMM Aug. 17-22, 2008; pp. 159-170. cited by applicant
Golrezaei, et al.; “FemtoCaching: Wireless Video Content Delivery Through Distributed Caching Helpers;” arXiv:1109.4179v2; Apr. 7, 2012; pp. 1-11. cited by applicant
Grant, et al.; “Graph Implementation for Nonsmooth Convex Programs;” LNCIS 371; Springer-Verlag Limited; Jan. 2008; pp. 95-110. cited by applicant
Gupta; “The Capacity of Wireless Networks;” IEEE Transactions on Information Theory; vol. 46; No. 2; Mar. 2000; pp. 388-404. cited by applicant
Hadzi-Velkov, et al.; “Capture Effect in IEEE 802.11 Basic Service Area Under Influence of Rayleigh Fading and Near/Far Effect;” IEEE; PIMRC 202; vol. 1; Sep. 2002; 5 pages. cited by applicant
Haeupler, et al.; “One Packet Suffices—Highly Efficient Packetized Network Coding With Finite Memory;” IEEE International Symposium on Information Theory (ISIT) Proceedings; Jul. 31, 2011-Aug. 5, 2011; 5 pages. cited by applicant
Haeupler; “Analyzing Network Coding Gossip Made Easy;” Proc. of the 43rd Symposium on Theory of Computing (STOC); Jan. 2011, 13 pages. cited by applicant
Haeupler, et al.; “Optimality of Network Coding in Packet Networks;” ArXiv, Feb. 17, 2011; 5 pages. cited by applicant
Haley, et. al.; “Reversible Low-Density Parity-Check Codes;” IEEE Transactions on Information Theory; vol. 55; No. 5; May 2009; pp. 2016-2036. cited by applicant
Halloush, et al.; “Network Coding with Multi-Generation Mixing: Analysis and Applications for Video Communication;” IEEE International Conference on Communications; May 19, 2008; pp. 198-202. cited by applicant
Han, et al.; “Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet;” IEEE/ACM Transactions on Networking (TON); vol. 14; No. 6, Dec. 2006; 26 pages. cited by applicant
Han, et al.; “On Nework Coding for Security;” IEEE Military Communications Conference; Oct. 2007; pp. 1-6. cited by applicant
Hassner, et al.; “4K Bye-Sector HDD-Data Format Standard;” Windows Hardware and Driver Central; San Jose, CA; Aug. 14, 2013; 5 pages. cited by applicant
Ho, et al.; “A Random Linear Network Coding Approach to Multicast;” IEEE Transactions on Information Theory; vol. 52; No. 10; Oct. 2006, pp. 4413-4430. cited by applicant
Ho, et al.; “Byzantine Modification Detection in Multicast Networks using Randomized Network Coding;” IEEE; ISIT; Jun. 27-Jul. 2, 2004; p. 144. cited by applicant
Ho, et al.; “Network Coding from a Network Flow Perspective;” ISIT; Jun.-Jul. 2003; 6 pages. cited by applicant
Ho, et al.; “On Randomized Network Coding;” Proceedings of 41st Annual Allerton Conference on Communications, Control and Computing; Oct. 2003; 10 pages. cited by applicant
Ho, et al.; “On the utility of network coding in dynamic environments;” International Workshop on Wireless AD-HOC Networks (IWWAN); 2004; pp. 1-5. cited by applicant
Ho, et al.; “The Benefits of Coding over Routing in a Randomized Setting;” Proceedings of 2003 IEEE International Symposium on Information Theory; Jun. 2003; pp. 1-6. cited by applicant
Ho, et al.; “The Benefits of Coding over Routing in a Randomized Setting;” IEEE; ISIT Jun. 29-Jul. 4, 2003; p. 442. cited by applicant
Hofri; “Disk Scheduling: FCFS vs. SSTF Revisited;” Communications of the ACM; vol. 23; No. 11; Nov. 1980; pp. 645-653. cited by applicant
Hong, et al.; Network-coding-based hybrid ARQ scheme for mobile relay networks; Electronics Letters; vol. 46; No. 7; Apr. 1, 2010; 2 pages. cited by applicant
International Disk Drive Equipment and Materials Assoc.; “Advanced Standard;” in Windows Hardware Engineering Conf.; May 2005; 11 pages. cited by applicant
Iyer, et al.; “Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O;” SIGOPS Operating Sys. Review; vol. 35; No. 5; Dec. 2001; 14 pages. cited by applicant
Jacobson, et al.; “Disk scheduling algorithms based on rotational position;” Hewlett-Packard laboratories; Palo Alto, CA; Technical Report HPL-CSP-91-7rev1; Feb. 26, 1991; 17 pages. cited by applicant
Jaggi, et al.; “Low Complexity Algebraic Multicast Network Codes;” Proceedings of the IEEE International Symposium on Information Theory; Jul. 4, 2003; 1 page. cited by applicant
Jaggi, et al.; “Resilient Network Coding in the Presence of Byzantine Adversaries;” Proc. IEEE INFOCOM; May 2007; 9 pages. cited by applicant
Jakubczak, et al.; “One-Size-Fits-All Wireless Video;” ACM Sig-Comm Hotnets 2009; 6 pages. cited by applicant
Jamieson, et al.; “PPR: Partial Packet Recovery for Wireless Networks;” SIGCOMM 07; Aug. 27-31, 2007; 12 pages. cited by applicant
Jamieson, et al.; “PPR: Partial Packet Recovery for Wireless Networks;” Presentation; SIGCOMM 07; Aug. 27-31, 2007; 25 pages. cited by applicant
Jannaty, et al.; “Full Two-Dimensional Markov Chain Analysis of Thermal Soft Errors in Subthreshold Nanoscale CMOS Devices;” IEEE Transactions on Device and Materials Reliability; vol. 11; No. 1; Mar. 2011; pp. 50-59. cited by applicant
Ji, et. al; “A network coding based hybrid ARQ algorithm for wireless video broadcast;” Science China; Information Sciences; vol. 54; No. 6; Jun. 2011; pp. 1327-1332. cited by applicant
Jin, et al.; “Adaptive Random Network Coding in WiMAX;” Communications, 2008; ICC'08 IEEE International Conference on May 19-23, 2008; 5 pages. cited by applicant
Jin, et al.; “Is Random Network Coding Helpful in WiMax;” IEEE 27th Conference on Computer Communications; Apr. 2008; 5 pages. cited by applicant
Jolfaei, et al.; “A New Efficient Selective Repeat Protocol for Point-To_Multipoint Communication;” Communications 1993; ICC'93 Genova Technical Program, Conference Record; IEEE International Conference on May 23-26, 1993; vol. 2; pp. 1113-1117. cited by applicant
Karkpinski, et al.; “New Approximation Algorithms for the Steiner Tree Problems;” Technical Report, Electronic Colloquium on Computational Complexity (ECCC) TR95-030; 1995; pp. 1-17. cited by applicant
Karp, et al.; “Randomized Rumor Spreading;” IEEE Proceeding FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science; Jan. 2000; pp. 565-574. cited by applicant
Katti, et al.; “XORs in the Air: Practical Wireless Network Coding;” IEEE/ACM Transactions on Networking; vol. 16; No. 3; 2008; pp. 1-14. cited by applicant
Katti, et al.; “XORs in the Air: Practical Wireless Network Coding;” ACM SIGCOMM '06; Computer Communications Review; vol. 36; Sep. 11-15, 2006; 12 pages. cited by applicant
Kempe, et al.; “Protocols and Impossibility Results for Gossip-Based Communication Mechanisms;” Foundations of Computer Science, Jan. 2002; Proceedings. The 43rd Annual IEEE Symposium; pp. 471-480. cited by applicant
Key, et al.; “Combining Multipath Routing and Congestion Control for Robustness;” In Proceedings of IEEE CISS, 2006, 6 pages. cited by applicant
Kim, et al.; “Modeling Network Coded TCP Throughout: A Simple Model and its Validation;” VALUETOOLS '11 Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools; May 16-20, 2011; 10 pages. cited by applicant
Kim, et al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Cornell University Library, http://arxiv.org/abs/1008.0420, Aug. 2010, 3 pages. cited by applicant
Kim, et al.; “Network Coding for Multi-Resolution Multicast;” IEEE INFOCOM 2010; Mar. 2010; 9 pages. cited by applicant
Kim, et al.; “Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula;” Computers and Operations Research; vol. 30; No. 3; Mar. 2003; pp. 1-20. cited by applicant
Kim, et. al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, arXiv: 1008.0420v1 [cs.IT] Aug. 2, 2010; 9 pages. cited by applicant
Kim, et. al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Nov. 2010, Presentation; 19 pages. cited by applicant
Kodialam, et al., “Online Multicast Routing With Bandwidth Guarantees: A New Approach Using Multicast Network Flow;” IEEE/ACM Transactions on Networking; vol. 11; No. 4; Aug. 2003; pp. 676-686; cited by applicant
Koetter, et al.; “An Algebraic Approach to Network Coding;” IEEE/ACM Transactions on Networking; vol. 11, No. 5; Oct. 2003; pp. 782-795. cited by applicant
Koetter, et al.; “Beyond Routing: An Algebraic Approach to Network Coding;” IEEE Infocom; 2002; 9 pages. cited by applicant
Koutsonikolas, et al.; “Efficient Online WiFi Delivery of Layered-Coding Media using Inter-layer Network Coding; ”Distributed Computing Systems (ICDCS); 2011 31st International Conference on Jun. 2011; 11 pages. cited by applicant
Kritzner, et al.; “Priority Based Packet Scheduling with Tunable Reliability for Wireless Streaming;” Lecture Notes in Computer Science; 2004; pp. 707-717. cited by applicant
Kuhn, et al.; “Distributed Computation in Dynamic Networks;” Proc. of the 42rd Symposium on Theory of Computing (STOC); Jun. 5-8, 2010; 10 pages. cited by applicant
Lai; “Sequential Analysis: Some Classical Problems and New Challenges”; Statistica Sinica, vol. 11, No. 2; 2001; pp. 303-350. cited by applicant
Landau; “Application of the Volterra Series to the Analysis and Design of an Angle Track Loop;” IEEE Transactions on Aerospace and Electronic Systems; vol. AES-8, No. 3; May 1972; pp. 306-318. cited by applicant
Larsson, et al.; “Analysis of Network Coded HARQ for Multiple Unicast Flows;” Communication (ICC) 2010 IEEE International Conference on May 23-27, 2010 pp. 1-6. cited by applicant
Larsson, et al.; “Multi-User ARQ;” Vehicular Technology Conference; 2006; VTC (2006-Spring); IEEE 63rd; vol. 4; May 7-10, 2006; pp. 2052-2057. cited by applicant
Larsson; “Analysis of Multi-User ARQ with Multiple Unicast Flows Under Non-iid Reception Probabilities;” Wireless Communication and Networking Conference 2007; WCNC 2007; IEEE; Mar. 11-15, 2007; pp. 384-388. cited by applicant
Larsson; “Multicast Multiuser ARQ;” Wireless Communications and Networking Conference (WCNC) 2008; IEEE; Apr. 3, 2008; pp. 1985-1990. cited by applicant
Le, et al.; “How Many Packets Can We Encode?—An Analysis of Practical Wireless Network Coding;” INFOCOM 2008; The 27th Conference on Computer Communications, IEEE; 2008; pp. 1040-1048. cited by applicant
Lee, et al.; “Content Distribution in VANETs using Network Coding: The Effect of Disk I/O and Processing O/H;” Proc. IEEE SECON; Jan. 2008; pp. 117-125. cited by applicant
Lehman, et al; “Complexity Classification of Network Information Flow Problems;” SODA 04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; Jan. 2004; pp. 9-10. cited by applicant
Li, et al.; “N-in-1 Retransmission with Network Coding;” IEEE Transactions on Wireless Communications; vol. 9; No. 9; Sep. 2010; pp. 2689-2694. cited by applicant
Li, et al.; “Robust and Flexible Scalable Video Multicast with Network Coding over P2P Network;” 2nd International Congress on Image and Signal Processing, IEEE: Oct. 17, 2009; pp. 1-5. cited by applicant
Li,et al.; “Linear Network Coding;” IEEE Transactions on Information Theory; vol. 49; No. 2; Feb. 2003; pp. 371-381. cited by applicant
Lima, et al.; “An Information-Theoretic Cryptanalysis of Network Coding—is Protecting the Code Enough;” International Symposium on Information Theory and its Applications; Dec. 2008; 6 pages. cited by applicant
Lima, et al.; “Random Linear Network Coding: A free cipher?” IEEE International Symposium on Information Theory; Jun. 2007; pp. 1-5. cited by applicant
Lima, et al.; “Secure Network Coding for Multi-Resolution Wireless Video Streaming;” IEEE Journal on Selected Areas in Communications; vol. 28; No. 3; Apr. 2010; pp. 377-388. cited by applicant
Lima, et al.; “Towards Secure Multiresolution Network Coding;” IEEE Information Theory Workshop; Jun. 12, 2009; pp. 125-129. cited by applicant
Liu, et al.; “The Throughput Order of Ad Hoc Networks Employing Network Coding and Broadcasting;” Military Communications Conference; MILCOM 2006; Oct. 2006; pp. 1-7. cited by applicant
Liu, et al.; “Using Layered Video to Provide Incentives in P2P Live Streaming;” P2P-TV07: Proceedings of the 2007 Workshop on Peer-to-peer Streaming and IP-TV; Aug. 31, 2007 ACM; 6 pages. cited by applicant
Luby, et al.; “The Use of Forward Error Correction (FEC) in Reliable Multicast;” Internet Society Request for Comments; RFC 3453; Dec. 2002; 18 pages. cited by applicant
Lucani et al.; “On Coding for Delay New Approaches based on Network Coding in Network Coding in Networks with Large Latency;” Presentation in NetCod; Slide Presentation; Jun. 16, 2009; 17 pages. cited by applicant
Lucani et al; “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach;” presented Switzerland; Conference: NetCod 2009, Lausanne, Switzerland; Jun. 2009; 6 pages. cited by applicant
Lucani et al; “On Coding for Delay—New Approaches Based on Network Coding in Networks with Large Latency;” Conference: ITA Workshop, San Diego, USA; Feb. 2009; 10 pages. cited by applicant
Lucani et al; “On Coding for Delay New Approaches based on Network Coding in Networks with Large Latency;” Conference ITA Workshop, San Diego, USA; Slide Presentation; Feb. 13, 2009; 11 pages. cited by applicant
Lucani et al; “Random Linear Network Coding for Time Division Duplexing: Energy Analysis;” Conference: ICC 2009, Dresden, Germany; Jun. 2009; 5 pages. cited by applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in ICC; Slide Presentation; Jun. 16, 2009; 6 pages. cited by applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in INFOCOM; Slide Presentation; Apr. 23, 2009; 10 pages. cited by applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis;” Conference ISIT 2009, Seoul, Korea; Jul. 2009; 5 pages. cited by applicant
Lucani et al; “Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations;” Conference: GLOBECOM 2009, Hawaii, USA; Dec. 2009; 6 pages. cited by applicant
Lucani, et al.; “Network Coding for Data Dissemination: It is Not What You Know, but What Your Neighbors Don't Know;” Modeling and Optimization in Mobile, AdHoc, and Wireless Networks 2009; WiOPT 2009; 7th International Symposium on Jun. 23-27, 2009; pp. 1-8. cited by applicant
Lucani, et al.; “Network Coding Schemes for Underwater Networks;” WUWNet 07; Sep. 14, 2007; pp. 25-32. cited by applicant
Lucani, et al.; “Systematic Network Coding for Time-Division Duplexing;” Proceedings of the IEEE International Symposium on Information Theory (ISIT); ; Jun. 13-18, 2010; pp. 2403-2407. cited by applicant
Lun, et al.; “Further Results on Coding for Reliable Communication over Packet Networks;” Information Theory, ISIT 2005 Proceedings International Symposium on Sep. 4-9, 2005; 5 pages. cited by applicant
Lun, et al.; “On Coding for Reliable Communication Over Packet Networks;” Physical Communication; vol. 1; No. 1; Jan. 2008; pp. 10 pages. cited by applicant
Lun, et al.; “On Coding for Reliable Communication over Packet Networks;” LIDS Publication #2741; Jan. 2007; 33 pages. cited by applicant
Lun, et al.; An Analysis of Finite-Memory Random Linear Coding on Packet Streams; Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks; Apr. 3-6, 2006; pp. 1-6. cited by applicant
Lun; “Efficient Operation of Coded Packet Networks;” Ph.D. Dissertation; Massachusetts Institute of Technology; Jun. 2006; 130 pages. cited by applicant
Magli, et al.; “An Overview of Network Coding for Multimedia Streaming;” IEEE International Conference; Jun. 28, 2009; pp. 1488-1491. cited by applicant
Mallat, et al.; “Adaptive Covariance Estimation of Locally Stationary Processes;” Annals of Statistics, vol. 26, No. 1; 1998; pp. 1-43. cited by applicant
Manssour, et al.; “A Unicast Retransmission Scheme based on Network Coding;” IEEE Transactions on Vehicular Technology; vol. 61; Issue 2; Nov. 2011; 7 pages. cited by applicant
Maymounkov, et al.; “Methods for Efficient Network Coding;” Proc. of the 44th Allerton Conference on Communication, Control, and Computing; Sep. 2006; 10 pages. cited by applicant
Médard, et al.; “On Coding for Non-Multicast Networks;” invited paper, 41st Allerton Annual Conference on Communication, Control; Outgrowth of supervised student research Publications of Muriel Médard and Computing; vol. 1; Oct. 2003; 9 pages. cited by applicant
Medard; “Some New Directions for Network Coding in Content Distribution”, RLE, EECS, MIT, Seminar to Alcatel Lucent, Nov. 2010, 29 pages. cited by applicant
Merchant, et al.; “Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation;” IEEE Transactions on Computers; vol. 45; No. 3; Mar. 1996; pp. 367-373. cited by applicant
Metzner; “An Improved Broadcast Retransmission Protocol;” IEEE Transactions on Communications; vol. COM-32; No. 6; Jun. 1984; pp. 679-683. cited by applicant
Mosk-Aoyama, et al.; “Information Dissemination via Network Coding;” ISIT 2006; IEEE; Jul. 9-14, 2006; pp. 1748-1752. cited by applicant
Moyer, et al.; “A Survey of Security Issues in Multicast Communications;” IEEE Network; vol. 13; No. 6; Nov./Dec. 1999; pp. 12-23. cited by applicant
Nguyen, et al.; “Internet Media Streaming Using Network Coding and Path Diversity;” IEEE Global Telecommunications Conference; Nov. 30—Dec. 4, 2008; 5 pages. cited by applicant
Nguyen, et al.; “Wireless Broadcast Using Network Coding;” Vehicular Technology IEEE Transactions on Feb. 2009; vol. 58; Issue 2; 25 pages. cited by applicant
Nguyen, et al; “Video Streaming with Network Coding;” Journal of Signal Processing Systems; vol. 59; Issue 3; DOI: 10.1007/s11265-009-0342-7; Jun. 2010; 25 pages. cited by applicant
Nobel; “Hypothesis Testing for Families of Ergodic Processes;” Bernoulli-London, vol. 12, No. 2; 2006; 21 pages. cited by applicant
Noguichi, et al.; “Performance Evaluation of New Multicast Architecture with Network Coding;” IEICE Transactions on Communication, E86-B; No. 6; Jun. 2003; 3 pages. cited by applicant
NS Version 1—LBNL Network Simulator; web page—http://ee.lel.gov/ns/; Mar. 21, 2011; 3 pages. cited by applicant
Nyandoro, et al.; “Service Differentiation in Wireless LANs based on Capture;” IEEE GLOBECOM 2005; vol. 6; Dec. 2005; 5 pages. cited by applicant
Oliveira, et al.; “A Network Coding Approach to Secret Key Distribution;” IEEE Transactions on Information Forensics and Security; vol. 3; No. 3; pp. 414-423; Sep. 2008. cited by applicant
Parandehgheibi, et al.; “Access-Network Association Policies for Media Streaming in Heterogeneous Environments;” Apr. 2010; pp. 1-8. cited by applicant
Peng, et al.; “Research on Network Coding based Hybrid-ARQ Scheme for Wireless Networks;” Communication Systems (ICCS); 2010 IEEE International Conference on Nov. 17-19, 2010; pp. 218-222. cited by applicant
Popovici, et al.; “Robust, Portable I/O Scheduling with the Disk Mimic;” Proc. USENIX Annual Tech. Conf. San Antonio, Texas, Jun. 2003; 14 pages. cited by applicant
Qureshi, et al.; “An Efficient Network Coding based Retransmission Algorithm for Wireless Multicast;” Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on Sep. 13-16, 2009; 5 pages. cited by applicant
Radunovic, et al.; “Horizon: Balancing TCP Over Multiple Paths in Wireless Mesh Network;” Proc. 14th ACM International Conference on Mobile Computing and Networking; Sep. 2008; 12 pages. cited by applicant
Ramanathan; “Multicast Tree Generation in Networks with Asymmetric Links;” IEEE Transactions on Networking; vol. 4; Aug. 1996; pp. 1-12. cited by applicant
Rezaee, et al.; “Multi Packet Reception and Network Coding;” Presentation at the 2010 Military Communications Conference Unclassified Technical Program; Nov. 2, 2010; 15 pages. cited by applicant
Rezaee, et al.; “An Analysis of Speeding Multicast by Acknowledgment Reduction Technique (SMART) with Homogeneous and Heterogeneous Links—A Method of Types Approach;” Signals, Systems and Computers (ASILOMAR) 2011 Conference; IEEE; Nov. 2011; pp. 21-27. cited by applicant
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART);” ArXiv:1104.2941v2 [cs.NI] Sep. 10, 2011; 6 pages. cited by applicant
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART) Enabling Robustness of QoE to the Number of Users;” IEEE Journal on Selected Areas in Communication; vol. 30, No. 7; Aug. 2012; pp. 1270-1280. cited by applicant
Rezaee, et.al.; “Multi Packet Reception and Network Coding;” Military Communications Conference; 2010; MILCOM 2010; IEEE; Oct. 31, 2010-Nov. 3, 2010; pp. 1393-1398. cited by applicant
Rezaee; “Network Coding, Multi-Packet Reception, and Feedback: Design Tools for Wireless Broadcast Networks;” Submitted to Department of Electrical Engineering and Computer Science at Massachusetts Institute of Technology; Sep. 2011; 92 pages. cited by applicant
Riemensberger, et al.; “Optimal Slotted Random Access in Coded Wireless Packet Networks;” WiOPt 10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks; Jul. 13, 2010; pp. 374-379. cited by applicant
Roughgarden, et al.; “How Bad is Selfish Routing?” Journal of the ACM; vol. 49, No. 2; Mar. 2002; pp. 236-259. cited by applicant
Ruemmler, et al.; “An introduction to disk drive modeling;” IEEE Computers; vol. 27; No. 3; Mar. 17-29, 1994; 17 pages. cited by applicant
Ryabko, et al.; “On Hypotheses Testing for Ergodic Processes;” Information Theory Workshop; ITW'08; IEEE; 2008; pp. 281-283. cited by applicant
Sanders, et al.; “Polynomial Time Algorithms for Network Information Flow;” 15th ACM Symposium on Parallel Algorithms and Architectures; Jun. 2003; pp. 1-9. cited by applicant
Sayenko, et al.; “Performance Analysis of the IEEE 802.16 ARQ Mechanism;” MSWiM'07; Oct. 22-26, 2007; pp. 314-322. cited by applicant
Scharf; “MPTCP Application Interface Considerations draft-scharf-mptcp-ap-04;” Internet Engineering Task Force; Internet-Draft; Nov. 22, 2010; 26 pages. cited by applicant
Seferoglu, et al.; “Opportunistic Network Coding for Video Streaming over Wireless;” Packet Video; Nov. 2007; 10 pages. cited by applicant
Sengupta, et al.; “An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing;” in INFOCOM 2007; 26th IEEE International Conference on Computer Communications; Jun. 2007; 9 pages. cited by applicant
Servetto, et al.; “Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks;” WSNA 02; Sep. 28, 2002; 10 pages. cited by applicant
Shenker, et al.; “Pricing in computer networks: reshaping the research agenda;” Telecommunications Policy; vol. 20, No. 3; Jan. 1996; pp. 183-201. cited by applicant
Sherali, et al.; “Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs;” Elsevier Operations Research Letters 19 (Jan. 1996); pp. 105-113. cited by applicant
Shields; “The Interactions Between Ergodic Theory and Information Theory;” IEEE Transactions on Information Theory, vol. 44, No. 6; Oct. 1998; pp. 2079-2093. cited by applicant
Shrader, et al.; “Systematic wireless network coding;” Military Conference, 2009; MILCOM 2009; IEEE; 7 pages. cited by applicant
Shrader, et al; “Routing and Rate Control for Coded Cooperation in a Satellite-Terrestrial Network;” IEEE: The 2011 Military Communications Conference—Track 2—Network Protocols and Performance; Nov. 7-10, 2011; pp. 735-740. cited by applicant
Shriver, et al.; “An analytic behavior model for disk drives with readahead caches and request reordering;” Proc. SIGMETRICS/Performance, Joint Conf. on Meas. and Modeling Comp. Sys.; ACM; Jan. 1998; 10 pages. cited by applicant
Song, et al.; “Zero-Error Network Coding for Acyclic Networks;” IEEE Transactions on Information Theory; vol. 49, No. 12; Dec. 2003; pp. 3129-3139. cited by applicant
SongPu, et al.; Performance analysis of joint chase combining and network coding in wireless broadcast retransmission; Wireless Communication, Network and Mobile Computing 2008; WiCOM '08, 4th International Conference on Oct. 12-14, 2008; pp. 1-4. cited by applicant
Soo Suh; “Send-On-Delta Sensor Data Transmission With a Linear Predictor;” Sensors; ISSN 1424-8220; vol. 7; No. 4; Apr. 26, 2007; pp. 537-547. cited by applicant
Sun, et al.; “Cooperative Hybrid-ARQ Protocol with Network Coding;” Communications and Networking in China 2009—ChinaCOM 2009; Fourth International Conference on Aug. 26-28, 2009; pp. 1-5. cited by applicant
Sundaram, et al.; “Multirate Media Streaming Using Network Coding;” Proc. 43rd Allerton Conference on Communication, Control, and Computing; Sep. 2005; 7 pages. cited by applicant
Sundararajan, et al.; “ARQ for Network Coding;” ISIT Proc. of the IEEE International Symposium on Information Theory (ISIT); Jul. 6-11, 2008; pp. 1651-1655. cited by applicant
Sundararajan, et al.; “Network Coding Meets TCP: Theory and Implementation;” Proceedings of the IEEE; vol. 99, Issue 3; Mar. 2011; pp. 490-512. cited by applicant
Sundararajan, et al.; “Network coding meets TCP;” InfoCOM 2009; IEEE, Apr. 19-25, 2009; pp. 280-288. cited by applicant
Sundararajan, et al.; On Queueing in Coded Networks—Queue Size Follows Degrees of Freedom; IEEE Information Theory Workshop on Information Theory for Wireless Networks (ITW); Jul. 1-6, 2007; 6 pages. cited by applicant
Teerapittayanon, et al.; “Network Coding as a WiMAX Link Reliability Mechanism;” Multiple Access Communication; Lectures Notes in Computer Science; vol. 7642; pp. 1-12; 2012. cited by applicant
Teerapittayanon, et al.; “Performance Enhancements in Next Generation Wireless Networks Using Network Coding: A Case Study in WiMAX;” Massachusetts Institute of Technology; Jun. 2012; 130 pages. cited by applicant
Thobaben; “Joint Network/Channel Coding for Multi-User Hybrid-ARQ;” Source and Channel Coding (SCC) 2008; 7th International ITG Conference on Jan. 14-16, 2008; 6 pages. cited by applicant
Tosun, et al.; “Efficient Multi-Layer Coding and Encryption of MPEG Video Streams;” Proc. 2000 IEEE International Conference on Multimedia and Expo; vol. 1; 2000; pp. 119-122. cited by applicant
Tosun, et al.; “Lightweight Security Mechanisms for Wireless Video Transmission;” Proc. Intl. Conference on Information Technology, Coding and Computing; Apr. 2001; pp. 157-161. cited by applicant
Tran, et al.; “A Hybrid Network Coding Technique for Single-Hop Wireless Networks;” IEEE Journal on Selected Areas in Communications; vol. 27; No. 5; Jun. 2009; pp. 685-698. cited by applicant
Tran, et al.; “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks;” Network Coding, Theory and Applications; 2008; NetCod 2008; Fourth Workshop on Jan. 3-4, 2008; pp. 1-6. cited by applicant
Trung, et al.; “Quality Enhancement for Motion JPEG Using Temporal Redundancies;” IEEE Transactions on Circuits and System for Video Technology, vol. 18; No. 5; May 2008; pp. 609-619. cited by applicant
Tsatsanis, et al.; “Network Assisted Diversity for Random Access Wireless Data Networks;” Signals, Systems & amp; Computers; IEEE; vol. 1; Nov. 1-4, 1988; pp. 83-87. cited by applicant
Valancius, et al.; “Greening the Internet with Nano Data Centers;” Proc. 5th International Conference on Emerging Networking Experiments and Technologies; CoNEXT 2009; ACM 2009; Dec. 1-4, 2009; pp. 37-48. cited by applicant
Vasudevan, et al.; “Algebraic Gossip on Arbitrary Networks;” arXiv:0901.1444; Jan. 2009; 5 pages. cited by applicant
Velambi, et al.; “Throughput and Latency in Finite-Buffer Line Networks;” IEEE Transactions on Information Theory; vol. 57; No. 6; Jun. 2011; pp. 3622-3643. cited by applicant
Vien, al.; “Network Coding-based Block ACK for Wireless Relay Networks;” Proceedings of IEEE Vehicular Technology Conference (VTC2011-Spring); May 2011; 5 pages. cited by applicant
Vien, et al.; “Network Coding-based ARQ Retransmission Strategies for Two-Way Wireless Relay Networks;” Software, Telecommunications and Computer Networks (SoftCOM) 2010; International Conference on Sep. 23-25, 2010; 5 pages. cited by applicant
Vilela, et al.; “Lightweight Security for Network Coding;” IEEE International Conference on Communications; May 2008; 5 pages. cited by applicant
Wang, et al.; “Capacity-Delay Tradeoff for Information Dissemination Modalities in Wireless Networks;” in Information Theory; ISIT 2008; IEEE International Symposium; Jul. 2008; pp. 677-681. cited by applicant
Wang, et al.; “Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception;” in INFOCOM 2008; The 27th Conference on Computer Communications; IEEE; Apr. 2008; pp. 1517-1525. cited by applicant
Wang, et al.; Multipath Live Streaming via TCP: Scheme, Performance and Benefits; ACM Transactions on Multimedia Computing, Communications and Applications; vol. 5; No. 3; Article 25; Aug. 2009; pp. 1-23. cited by applicant
Widmer, et al.; “Network Coding for Efficient Communication in Extreme Networks;” Applications, Technologies, Architectures, and Protocols for Computer Communication; Aug. 2005; pp. 284-291. cited by applicant
Wieselthier, et al.; “Energy Efficient Broadcast and Multicast Trees in Wireless Networks;” Mobile Networks and Applications 7; Jan. 2002; pp. 481-492. cited by applicant
Wieselthier, et al.; “Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting;” IEEE Transactions on Mobile Computing; vol. 1, No. 3; Jul.-Sep. 2002; pp. 176-191. cited by applicant
Wilhelm; “An Anomaly in Disk Scheduling: A Comparison of FCFS and SSTF Seek Scheduling Using an Empirical Model for Disk Access;” Communications of the ACM, vol. 19; No. 1; Jan. 1976; pp. 13-17. cited by applicant
Wu, et al.; “A Trellis Connectivity Analysis of Random Linear Network Coding with Buffering;” Proc. of the International Symposium on Information Theory (ISIT); Jul. 9-14, 2006; pp. 768-772. cited by applicant
Yazdi, et al.; “Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast;” IEEE INFOCOM 2009; Apr. 19-25, 2009; pp. 1576-2580. cited by applicant
Yeung; “Multilevel Diversity Coding with Distortion;” IEEE Transactions on Information Theory; vol. 41, No. 2; Mar. 1995; pp. 412-422. cited by applicant
Yong, et al.; “XOR Retransmission in Multicast Error Recovery;” Networks 2000; ICON; Proceedings IEEE International Conference on Sep. 5-8, 2000; pp. 336-340. cited by applicant
Yun, et al.; “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm;” IEEE Transactions on Information Theory; vol. 53, No. 12; Dec. 2007; pp. 4628-4639. cited by applicant
Yun, et al.; Towards Zero Retransmission Overhead: A Symbol Level Network Coding Approach to Retransmission; IEEE Transactions on Mobile Computing; vol. 10; No. 8; Aug. 2011; pp. 1083-1095. cited by applicant
Zeger; “Packet Erasure Coding with Random Access to Reduce Losses of Delay Sensitive Multislot Messages;” IEEE; Paper ID #900482; Aug. 18, 2009; pp. 1-8. cited by applicant
Zhang, et al.; “Collision Resolution in Packet Radio Networks Using Rotational Invariance Techniques;” IEEE Transactions on Communication; vol. 50; No. 1; Jan. 2002; pp. 146-155. cited by applicant
Zhang, et al.; “Optimized Multipath Network Coding in Loss Wireless Networks;” ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributing Computing Systems; Jan. 2008; 12 pages. cited by applicant
Zhang, et al.; Dual XOR in the Air: A Network Coding Based Retransmission Scheme for Wireless Broadcasting; Communications (ICC) 2011 IEEE International Conference on Jun. 5-9, 2011; pp. 1-6. cited by applicant
Zhao, et al.; “A Multiqueue Service Room MAC Protocol for Wireless Networks With Multipacket Reception;” IEEE/ACM Transactions on Networking; vol. 11; No. 1; Feb. 2003; pp. 125-137. cited by applicant
Zhao, et al.; “On analyzing and improving COPE performance;” Information Theory and Applications Workshop (ITA), Jan. 2010; pp. 1-6. cited by applicant
Zhu, et al.; “Multicast with Network Coding in Application-Layer Overlay Networks;” IEEE Journal on Selected Areas in Communications; vol. 22; No. 1; Jan. 2004; pp. 1-13. cited by applicant
Office Action dated Nov. 17, 2021 for Application No. 201880022129.9; 4 Pages. cited by applicant
Intention to Grant dated Feb. 16, 2022, for Application No. 18 720 064.7-1216; 11 Pages. cited by applicant
Response to Office Action filed Mar. 29, 2022, for Application No. 201880022129.9; 16 Pages. cited by applicant
Assistant Examiner: Lu, Xuan
Primary Examiner: Yao, Kwang B
Attorney, Agent or Firm: Daly, Crowley, Mofford & Durkee, LLP
Prístupové číslo: edspgr.11424861
Databáza: USPTO Patent Grants
Popis
Abstrakt:A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a “shifted” row echelon coefficient matrix.