IP Library › Granted Patent US 12,506,878
Granted Patent B1
US 12,506,878 · App. 18/647,873 · Granted Dec 23, 2025

Streaming codes for variable size messages accommodating partial burst losses

Inventor: Michael H. Rudow (Cleveland, OH)
H04N19/149H04N19/164
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,506,878
App. No.
18/647,873
Granted
Dec 23, 2025
Kind
B1
Abstract

Video frames to be transmitted are split into two components U and V, which can be different sizes depending on criteria such as burst and packet loss estimates provided as feedback from a receiver based on actual or predicted burst and packet losses. Parity symbols are generate for a frame, i, that is a function of the symbols of V[i−τ:i] and U[i−τ] so that for any partial burst the symbols of first component of data frames are all recovered by t time slots after the start of the burst and the symbols of the second component of each data frame are recovered t time slots later.

Claims (36)

1 . An erasure-coding based, live communication method for sending a real-time stream of video frames from a sender to a receiver, the method comprising:

obtaining, by the sender and for each frame i of a plurality of video frames of said video stream, loss estimation parameters for the video frame i including a burst loss estimate, b i , for the video frame i and a per-frame packet loss estimate, l i , for the video frame i;

partitioning, by the sender and for each video frame i of a plurality of video frames of said video stream, a set of video data symbols D[i] into a first set of video data symbols U[i] and a second set of video data symbols V[i] by using said estimated b i-τ through b i and l i-τ through l (i+bi−1) to determine a minimum size for U[i] and then identifying how many symbols are partitioned to U[i] between this minimum value and all symbols of D[i] and allocating the rest to V[i], wherein τ is a function of a predetermined maximum tolerable latency of the video stream expressed as a whole number of frames;

generating, by the sender and for each video frame i, a set of one or more streaming FEC code parity symbols P[i] based on the symbols: V[i−τ] through V[i−|], U[i−τ], and the symbols of V[i] but not U[i], wherein the number of parity symbols for the ith video frame is determined as a function of the size of U[i−τ];

encoding, by the sender and for each video frame i, the symbols of D[i] and P[i] into a plurality, c i , of channel frames such that each of U[i], V[i], and P[i] is spread evenly across the plurality of channel frames, wherein each of U[i] and V[i] is selectively zero-padded by as little as possible and the size of P[i] is selectively increased by as little as possible to ensure that the size of each of U[i], V[i], and P[i] is evenly divisible by c i , and wherein c i is selected to be as small as possible under the conditions that (a) evenly spreading the symbols over the channel frames leads to a channel frame size that is no more than a predetermined maximum transmittable unit size and (b) c i times l i is an integer or rounds up to be an integer where the increase due to rounding is small relative to the product; and

transmitting the plurality of channel frames by the sender to the receiver over a lossy communication channel that can introduce burst losses including partial burst losses.

2 . The method of claim 1 , wherein the value of t is chosen based on the frame rate and one-way propagation delay from the sender to the receiver.

3 . The method of claim 1 , wherein the P[i] is the sum of two quantities P[i]:=P 1 [i]+P 2 [i], wherein the symbols of P 1 [i] are linear combinations of the symbols of U[i−τ], and wherein the symbols of P 2 [i] are linear combinations of the symbols of V[i−τ], . . . , V[i].

4 . The method of claim 1 , wherein setting the number of parity symbols sent for the ith video frame as a function of the size of U[i−τ] comprises:

setting the number of parity symbols sent for the ith video frame to be the size of U[i−τ] times l i-τ and optionally increasing the resulting number of parity symbols to be evenly divisible by the number of channel frames sent for the ith video frame.

5 . The method of claim 1 , wherein the sender receives the loss estimation parameters for the video frame i as feedback from the receiver.

6 . The method of claim 1 , wherein the sender is configured to receive loss estimation parameters as feedback from the receiver, and wherein, when the sender has not received loss estimation parameters for the video frame i from the receiver, the sender sets the loss estimation parameters for the video frame i to values used for a prior video frame.

7 . The method of claim 1 , wherein the sender is configured to receive loss estimation parameters as feedback from the receiver, and wherein the sender determines the loss estimation parameters for the video frame i based on feedback from the receiver for one or more prior video frames.

8 . The method of claim 1 , further comprising:

decoding, by the receiver, a burst across i to j consecutive frames where j is an integer between one and b; to solve a system of linear equations corresponding to the symbols of D[i−τ] through D[i+τ−1], wherein the symbols of D[i−τ] through D[i−1] are combined with the received symbols V[i] through V[i+τ−1] and received symbols of P[i] through P[i+τ−1] to recover V[i] through V[i+b i −1] and then for each r in i to j the symbols of V[r] through V[r+τ] are combined with the received symbols of U[r] and P[r+τ] to recover U[r].

9 . The method of claim 8 , wherein the receiver is configured to transmit loss estimation parameters as feedback to the sender, optionally wherein the receiver uses machine learning to determine the loss estimation parameters for the video frame i based at least on channel characteristics for at least one prior video frame.

10 . The method of claim 8 , wherein the sender performs video data compression to produce the plurality of video frames of said video stream, optionally wherein the receiver sends a reset request to the sender to reset video compression upon determining that a recovered compressed video frame cannot be rendered due to dependence on an earlier unrecovered compressed video frame.

11 . A video streaming system comprising:

a sender for sending a real-time stream of video frames from a sender to a receiver, wherein the sender is configured to:

obtain, for each frame i of a plurality of video frames of said video stream, loss estimation parameters for the video frame i including a burst loss estimate, b i , for the video frame i and a per-frame packet loss estimate, l i , for the video frame i;

partition, for each video frame i of a plurality of video frames of said video stream, a set of video data symbols D[i] into a first set of video data symbols U[i] and a second set of video data symbols V[i] by using said estimated b i-τ through b i and l i-τ through l (i+bi-1) to determine a minimum size for U[i] and then identifying how many symbols are partitioned to U[i] between this minimum value and all symbols of D[i] and allocating the rest to V[i], wherein τ is a function of a predetermined maximum tolerable latency of the video stream expressed as a whole number of frames;

generate, for each video frame i, a set of one or more streaming FEC code parity symbols P[i] based on the symbols: V[i−τ] through V[i−1], U[i−τ], and the symbols of V[i] but not U[i], wherein the number of parity symbols for the ith video frame is determined as a function of the size of U[i−τ];

encode, for each video frame i, the symbols of D[i] and P[i] into a plurality, c i , of channel frames such that each of U[i], V[i], and P[i] is spread evenly across the plurality of channel frames, wherein each of U[i] and V[i] is selectively zero-padded by as little as possible and the size of P[i] is selectively increased by as little as possible to ensure that the size of each of U[i], V[i], and P[i] is evenly divisible by c i , and wherein c i is selected to be as small as possible under the conditions that (a) evenly spreading the symbols over the channel frames leads to a channel frame size that is no more than a predetermined maximum transmittable unit size and (b) c i times l i is an integer or rounds up to be an integer where the increase due to rounding is small relative to the product; and

transmit the plurality of channel frames to the receiver over a lossy communication channel that can introduce burst losses including partial burst losses.

12 . The system of claim 11 , wherein the value of τ is chosen based on the frame rate and one-way propagation delay from the sender to the receiver.

13 . The system of claim 11 , wherein the P[i] is the sum of two quantities P[i]:=P 1 [i]+P 2 [i], wherein the symbols of P 1 [i] are linear combinations of the symbols of U[i−τ], and wherein the symbols of P 2 [i] are linear combinations of the symbols of V[i−τ], . . . , V[i].

14 . The system of claim 11 , wherein setting the number of parity symbols sent for the ith video frame as a function of the size of U[i−τ] comprises:

setting the number of parity symbols sent for the ith video frame to be the size of U[i−τ] times l i-τ and optionally increasing the resulting number of parity symbols to be evenly divisible by the number of channel frames sent for the ith video frame.

15 . The system of claim 11 , wherein the sender receives the loss estimation parameters for the video frame i as feedback from the receiver.

16 . The system of claim 11 , wherein the sender is configured to receive loss estimation parameters as feedback from the receiver, and wherein, when the sender has not received loss estimation parameters for the video frame i from the receiver, the sender sets the loss estimation parameters for the video frame i to values used for a prior video frame.

17 . The system of claim 11 , wherein the sender is configured to receive loss estimation parameters as feedback from the receiver, and wherein the sender determines the loss estimation parameters for the video frame i based on feedback from the receiver for one or more prior video frames.

18 . The system of claim 11 , further comprising:

the receiver, wherein the receiver is configured to:

decode a burst across i to j consecutive frames where j is an integer between one and b i to solve a system of linear equations corresponding to the symbols of D[i−τ] through D[i+τ−1], wherein the symbols of D[i−τ] through D[i−1] are combined with the received symbols V[i] through V[i+τ−1] and received symbols of P[i] through P[i+τ−1] to recover V[i] through V[i+b i −1] and then for each r in i to j the symbols of V[r] through V[r+τ] are combined with the received symbols of U[r] and P[r+t] to recover U[r].

19 . The system of claim 18 , wherein the receiver is configured to transmit loss estimation parameters as feedback to the sender, optionally wherein the receiver uses machine learning to determine the loss estimation parameters for the video frame i based at least on channel characteristics for at least one prior video frame.

20 . The system of claim 18 , wherein the sender performs video data compression to produce the plurality of video frames of said video stream, optionally wherein the receiver sends a reset request to the sender to reset video compression upon determining that a recovered compressed video frame cannot be rendered due to dependence on an earlier unrecovered compressed video frame.

Continuity (1)
Provisional Application 63523184 · Jun 26, 2023
References Cited (141)
US 5699365A · Klayman et al. · 1997 [cited by applicant]
US 6421387B1 · Rhee · 2002 [cited by applicant]
US 6694478B1 · Martinian et al. · 2004 [cited by applicant]
US 7257664B2 · Zhang · 2007 [cited by applicant]
US 8352832B2 · Khisti et al. · 2013 [cited by applicant]
US 8375266B2 · Zhang · 2013 [cited by applicant]
US 8775889B2 · Zhang · 2014 [cited by applicant]
US 9209897B2 · Amitai et al. · 2015 [cited by applicant]
US 9641803B1 · Badr et al. · 2017 [cited by applicant]
US 9843413B2 · Badr et al. · 2017 [cited by applicant]
US 10833710B2 · Caramma · 2020 [cited by applicant]
US 10979175B2 · Low et al. · 2021 [cited by applicant]
US 11036525B2 · Momchilov · 2021 [cited by applicant]
US 11303690B1 · Bhattacharyya et al. · 2022 [cited by applicant]
US 20130039410A1 · Tan et al. · 2013 [cited by applicant]
US 20130070844A1 · Malladi et al. · 2013 [cited by applicant]
US 20130097470A1 · Hwang et al. · 2013 [cited by applicant]
US 20130156420A1 · Amitai et al. · 2013 [cited by applicant]
US 20140101521A1 · Myung · 2014 [cited by examiner]
US 20170279558A1 · Badr et al. · 2017 [cited by applicant]
US 20180034583A1 · Low et al. · 2018 [cited by applicant]
US 20190007069A1 · Caramma · 2019 [cited by applicant]
US 20190339997A1 · Momchilov · 2019 [cited by applicant]
US 20200044772A1 · Low et al. · 2020 [cited by applicant]
US 20200177311A1 · Ho · 2020 [cited by examiner]
US 20200322008A1 · Lomayev · 2020 [cited by examiner]
US 20220124543A1 · Orhan et al. · 2022 [cited by applicant]
US 20230106959A1 · Ananthanarayanan et al. · 2023 [cited by applicant]
CA 2978211C · 2023 [cited by examiner]
CN 101427495B · 2013 [cited by examiner]
WO 2019213556A1 · 2019 [cited by applicant]
Wang, Y., et al., “Error Control and Concealment for Video Communication: A Review,” Proceedings of the IEEE, vol. 86, No. 5, May 1998 (24 pages). [cited by applicant]
Watson, M. et al, “Forward Error Correction (FEC) Framework,” Internet Engineering Task Force (IETF), Oct. 2011 (42 pages). [cited by applicant]
Weiring, M., et al., “Reinforcement Learning, State of the Art,” Adaptation, Learning, And Optimization, vol. 12, 2012 (653 pages). [cited by applicant]
White, G., et al, “A Simulation Study of CoDel, SFQ-CoDel and PIE in DOCSIS 3.0 Network,” Active Queue Management Algorithms for DOCSIS 3.0, Cable Television Laboratories, Inc., Apr. 2013 (45 pages). [cited by applicant]
Wong, A., et al., “Deep multiagent reinforcement learning: challenges and directions,” Artificial Intelligence Review (2023) 56:5023-5056 (34 pages). [cited by applicant]
Wu, D., et al., “Transporting Real-Time Video over the Internet: Challenges and Approaches,” Proceedings of the IEEE, vol. 88, No. 12, Dec. 2000 (21 pages). [cited by applicant]
Yang, Y., et al., “An Overview of Multi-agent Reinforcement Learning from Game Theoretical Perspective,” arXiv:2011.00583v3 [cs.MA] Mar. 18, 2021 (129 pages). [cited by applicant]
Yaqoob A. et al., “A Survey on Adaptive 360 Video Streaming: Solutions, Challenges and Opportunities,” IEEE Communications Surveys & Tutorials, vol. 22, No. 4, Fourth Quarter 2020 (38 pages). [cited by applicant]
Zadnik, J., et al., “Image and Video Coding Techniques for Ultra-low Latency,” ACM Computing Surveys, vol. 54, No. 11s, Article 231. Publication date: Sep. 2022 (35 pages). [cited by applicant]
Zhang, K., et al., “Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms,” arXiv:1911.10635v2 [cs.LG] Apr. 28, 2021 (73 pages). [cited by applicant]
Li, Z., et al., “Correcting Erasure Bursts with Minimum Decoding Delay,” https://www.comm.toronto.edu/˜akhisti/burst_erasure.pdf, pp. 33-39, 2011 (7 pages). [cited by applicant]
Li, Z., et al., “Forward Error Protection For Low-Delay Packet Video,” Proceedings of 2010 IEEE 18th International Packet Video Workshop, Hong Kong, Dec. 13-14, 2010 (8 pages). [cited by applicant]
Lin, C., “A RED-FEC Mechanism for Video TransmissionOver WLANs,” IEEE Transactions on Broadcasting, vol. 54, No. 3, Sep. 2008 (8 pages). [cited by applicant]
Lykouris, T., et al., “Competitive Caching with Machine Learned Advice,” 2021. J. ACM 68, 4, Article 24 (Jul. 2021), (pp. 24:1-24:25 (25 pages). [cited by applicant]
Ma, S., et al., “Image and V+B63:B75ideo Compression with Neural Networks: A Review,” IEEE Transactions On Circuits And Systems For Video Technology, arXiv:1904.03567v2 [cs.CV] Apr. 10, 2019 (16 pages). [cited by applicant]
Martinian, E., et al., “Burst Erasure Correction Codes With Low Decoding Delay,” IEEE Transactions On Information Theory, vol. 50, No. 10, Oct. 2004 pp. 2494-2502 (9 pages). [cited by applicant]
Maturana, F., et al., “Access-optimal Linear MDS Convertible Codes for All Parameters,” available on arXiv, 2020 (6 pages). [cited by applicant]
Mazyavkina, N., et al., “Reinforcement learning for combinatorial optimization: A survey,” Computers & Operations Research 134 (2021) 105400 (15 pages). [cited by applicant]
McCanne, S. et al., “Joint Source/Channel Coding for Multicast Packet Video,” Proceedings., International Conference on Image Processing, Washington, DC, USA, 1995, pp. 25-28 vol. 1, doi: 10.1109/ICIP.1995.529030 (4 pag… [cited by applicant]
Mitzenmacher, M., “A Model for Learned Bloom Filters, and Optimizing by Sandwiching,” 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), Montréal, Canada (10 Pages). [cited by applicant]
Moerland, T., et al., “Model-based Reinforcement Learning: A Survey,” Foundations and Trends® in Machine Learning, vol. 16, No. 1, pp. 1-118, 2023 (43 pages). [cited by applicant]
Nagy, M., et al., “Congestion Control using FEC for Conversational Multimedia Communication,” MMSys '14 Mar. 19-21, 2014, Singapore, Singapore (12pages). [cited by applicant]
Narra, H., et al., “Collage Inference: Using Coded Redundancy for Lowering Latency Variation in Distributed Image Classification Systems,” 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)… [cited by applicant]
Nichols, K., et al., “Controlled Delay Active Queue Management,” Internet Engineering Task Force (IETF), Jan. 2018 (25 pages). [cited by applicant]
Nowroozi, E., et al., “A survey of machine learning techniques in adversarial image forensics,” Computers & Security 100 (2021) 102092 (25 pages). [cited by applicant]
Orosz, P., et al., “A Case Study on Correlating Video QoS and QoE,” 2014 IEEE Network Operations and Management Symposium (NOMS) (5 pages). [cited by applicant]
O'Shea, T. et al., “An Introduction to Deep Learning for the Physical Layer,” IEEE Transactions On Cognitive Communications And Networking, vol. 3, No. 4, Dec. 2017. [cited by applicant]
Pan, R., et al., “Proportional Integral Controller Enhanced (PIE): A Lightweight Control Scheme to Address the Bufferbloat Problem,” Internet Engineering Task Force (IETF), Feb. 2017 (30 pages). [cited by applicant]
Park, K., “AFEC: An Adaptive Forward Error-Correction Protocol and Its Analysis,” Department of Computer Science Technical Reports, Report No. 97-038, 1997 (25 pages). [cited by applicant]
Perkins, C., et al., “A Survey of Packet Loss Recovery Techniques for Streaming Audio,” IEEE Network Sep./Oct. 1998 pp. 40-48 (9 pages). [cited by applicant]
Ponlatha, S., et al., “Comparison of Video Compression Standards,” International Journal of Computer and Electrical Engineering, vol. 5, No. 6, Dec. 2013 (7 pages). [cited by applicant]
Powell, W., “A unified framework for stochastic optimization,” European Journal of Operational Research (2018) pp. 1-27 (27 pages). [cited by applicant]
Raghavendra, R., et al., “Characterizing High-bandwidth Real-time Video Traffic in Residential Broadband Networks,” WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France… [cited by applicant]
Rao, N., et al., “Analysis of the Effect of QoS on Video Conferencing QoE,” https://ieeexplore.ieee.org/abstract/document/8766591, 2019 (6 pages). [cited by applicant]
Rippel, O., et al., “Learned Video Compression,” Computer Vision Foundation, arXiv:1811.06981, Nov. 16, 2018 (10 pages). [cited by applicant]
Rosenberg, J., et al., “An RTP Payload Format for Generic Forward Error Correction,” Network Working Group, Columbia University, Dec. 1999 (26 pages). [cited by applicant]
Rudow, M. et al., “A locality-based approach for coded computation,” arXiv:2002.02440v1 [cs.IT], Feb. 6, 2020 (18 pages). [cited by applicant]
Rudow, M. et al., “A locality-based lens for Coded computation,” retrieved from the internet at: //2021 IEEE International Symposium on Information Theory (ISIT) © 2021 IEEE | DOI: 10.1109/ISIT45174.2021.9518056// (6 pa… [cited by applicant]
Rudow, M. et al., “Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages,” arXiv:2205.08521v1 [cs.IT] Extended Version, May 17, 2022 (13 pages). [cited by applicant]
Rudow, M., “Discrete Logarithm and Minimum Circuit Size,” Inf. Process. Lett. (2017) http://dx.doi.org/10.1016/j.ipl.2017.07.005 (10 pages). [cited by applicant]
Rudow, M., “Efficient loss recovery for videoconferencing via streaming codes and machine learning,” Carnegie Mellon University, Thesis, retrieved from the internet at //https://doi.org/10.1184/R1/24992973.v1//, May 202… [cited by applicant]
Rudow, M., et al., “Learning-augmented streaming codes for variable-size messages under partial burst losses,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, (20 pages). [cited by applicant]
Rudow, M., et al., “On expanding the toolkit of locality-based coded computation to the coordinates of inputs,” 2023 IEEE International Symposium on Information Theory (ISIT) (10 pages). [cited by applicant]
Rudow, M., et al., “On expanding the toolkit of locality-based coded computation to the coordinates of inputs,” 2023 IEEE International Symposium on Information Theory (ISIT) (6 pages). [cited by applicant]
Rudow, M., et al., “Online Versus Offline Rate in Streaming Codes for Variable-Size Messages,” arXiv:2006.03045v2 [cs.IT] Feb. 27, 2023 (21 pages). [cited by applicant]
Rudow, M., et al., “Online Versus Offline Rate In Streaming Codes For Variable-Size Messages,” 2020 IEEE International Symposium on Information Theory (ISIT), 2020 (6 pages). [cited by applicant]
Rudow, M., et al., “Compression-informed coded computing,” In 2023 IEEE International Symposium on Information Theory (ISIT), pp. 2177-2182, 2023 (6 pages). [cited by applicant]
Rudow, M., et al., “Learning-augmented streaming codes are approximately optimal for variable-size messages,” 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, pp. 474-479, 2022 (6 pages). [cited by applicant]
Rudow, M., et al., “Learning-Augmented Streaming Codes For Variable-Size Messages Under Partial Burst Losses,” In 2023 IEEE International Symposium on Information Theory (ISIT), pp. 1101-1106, 2023 (6 pages). [cited by applicant]
Rudow, M., et al., “Online versus offline rate in streaming codes for variable-size messages,” IEEE Transactions on Information Theory, vol. 69, No. 6, pp. 3674-3690, 2023 (17 pages). [cited by applicant]
Rudow, M., et al., “Streaming codes for variable-size arrivals,” 2018 56th Annual Allerton Conference on Communication, Control, and Computing, (Allerton). IEEE, 2018 (8 pages). [cited by applicant]
Rudow, M., et al., “Streaming Codes for Variable-Size Messages,” IEEE Transactions on Information Theory, vol. 68, No. 9, pp. 5823-5849, Sep. 2022 (27 pages). [cited by applicant]
Rudow, M., et al., “Tambur: Efficient loss recovery for videoconferencing via streaming codes,” In Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, Apr. 17-19, 2023 (20 pages). [cited by applicant]
Sharma, S., “Active Queue Management for Forward Error Correction,” International Journal of Computing and Business Research (IJCBR) ISSN (Online) : 2229-6166, vol. 3, Issue 2, May 2012 (7 pages). [cited by applicant]
Sullivan, G., et al., “Video Compression-From Concepts to the H.264/AVC Standard,” Proceedings of the IEEE, vol. 93, No. 1, Jan. 2005 (14 pages). [cited by applicant]
Sztrik, J., “Basic Queueing Theory,” https://irh.inf.unideb.hu/˜jsztrik/education/16/SOR_Main_Angol.pdf, 2016 (246 pages). [cited by applicant]
Tan, W., et al., “Video Multicast using Layered FEC and Scalable Compression,” in IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 3, pp. 373-386, Mar. 2001, doi: 10.1109/76.911162 (30 pages). [cited by applicant]
Uehara, M. et al., “A Review of Off-Policy Evaluation in Reinforcement Learning,” arXiv:2212.06355v1 [stat.ML] Dec. 13, 2022 (27 pages). [cited by applicant]
Usman, M., et al., “Survey of Error Concealment Techniques: Research Directions and Open Issues,” 2015 Picture Coding Symposium (PCS), Cairns, QLD, Australia, 2015, pp. 233-238, doi: 10.1109/PCS.2015.7170081 (7 pages). [cited by applicant]
Wah, B., et al. “Survey of Error-Concealment Schemes for Real-Time Audio and Video Transmissions over the Internet,” Proceedings International Symposium on Multimedia Software Engineering 2000 (8 pages). [cited by applicant]
Adams, R., “Active Queue Management: A Survey,” IEEE Communications Surveys & Tutorials, vol. 15, No. 3, Third Quarter 2013 (52 pages). [cited by applicant]
Adan, I., et al., “Queueing Theory,” retrieved from the internet at https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=097d866985fc04b986d1f28885de7a0c1e89fce9, Feb. 14, 2001 (180 pages). [cited by applicant]
Adler, N., et al., “Burst-Erasure Correcting Codes With Optimal Average Delay,” IEEE Transactions On Information Theory, vol. 63, No. 5, May 2017, pp. 2848-2865 (18 pages). [cited by applicant]
Agrawal, A., et al., “A Rewriting System for Convex Optimization Problems,” arXiv:1709.04494v2 [math. OC] Jan. 22, 2019, (18 pages). [cited by applicant]
Alemu, T., “The Interaction of Forward Error Correction and Active Queue Management,” JDIR'04 : 6èmes Journées Doctorales Informatique et Réseau, Nov. 2004, Lannion, France. lirmm-00108649. [cited by applicant]
Almomani, O., et al, “Impact of Large Block FEC with Different Queue Sizes of Drop Tail and RED Queue Policy on Video Streaming Quality over Internet,” 2010 Second International Conference on Network Applications, Proto… [cited by applicant]
Almomani, O., et al, “Performance Study of Large Block FEC with Drop Tail for Video Streaming over the Internet,” 2009 First International Conference on Networks & Communications (4 pages). [cited by applicant]
Alwahab, D., “A Simulation-Based Survey of Active Queue Management Algorithms,” ICCBN 2018, Feb. 24-26, 2018, Singapore, Singapore, DOI: https://doi.org/10.1145/3193092.3193106 (7 pages). [cited by applicant]
Arulkumaran, K., et al., “A Brief Survey of Deep Reinforcement Learning,” IEEE Signal Processing Magazine, Special Issue On Deep Learning For Image Understanding (Arxiv Extended Version), arXiv:1708.05866v2 [cs.LG] Sep.… [cited by applicant]
Author Unknown, “Series G: Transmission Systems and Media, Digital Systems and Networks, Quality of service and performance,” ITU-T, Telecommunication Standardization Sector of ITU, Sep. 2001 (18 pages). [cited by applicant]
Badr, A., et al., “Embedded MDS Codes for Multicast Streaming,” 2015 IEEE International Symposium on Information Theory (ISIT) (5 pages). [cited by applicant]
Baguda, Y., et al., “Adaptive FEC Error Control Scheme for Wireless video Transmission,” 2010 The 12th International Conference on Advanced Communication Technology (ICACT) (5 pages). [cited by applicant]
Bandung, Y., “Qos Analysis for WebRTC Videoconference on Bandwidth-Limited Network,” The 20th International Symposium on Wireless Personal Multimedia Communications (WPMC2017), 2017 IEEE pp. 547-553 (7 pages). [cited by applicant]
Boykov, Y., et al., “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,” IEEE Transactions On Pattern Analysis And Machine Intelligence, vol. 26, No. 9, Sep. 2004, pp. 1124-1137… [cited by applicant]
Brockners, F. “The Case for FEC fueled TCP-like Congestion Control,” Kommunikation in Verteilten Systemen (KiVS) 11. ITG/GI-Fachtagung. Darmstadt, Mar. 2-5, 1999, retrieved from the internet https://citeseerx.ist.psu.ed… [cited by applicant]
Canese, L., et al., “Multi-Agent Reinforcement Learning: A Review of Challenges and Applications,” Appl. Sci. 2021, 11, 4948. https://doi.org/ 10.3390/U.S. Appl. No. 11/114,948 (25 pages). [cited by applicant]
Carlucci, G., et al., “Analysis and Design of the Google Congestion Control for Web Real-time Communication(WebRTC),” Proceedings of the 7th International Conference on Multimedia Systems, retrieved from the internet at… [cited by applicant]
Chang, H., et al., “Can You See Me Now? A Measurement Study of Zoom, Webex, and Meet,” IMC '21, Nov. 2-4, 2021, Virtual Event, USA, pp. 216-228 (13 pages). [cited by applicant]
Clarke, R., “Image and Video Compression: A Survey,” Creative Commons License, vol. 10, pp. 20-32, 1999 (13 pages). [cited by applicant]
Cohen, A., et al., “Adaptive Causal Network Coding With Feedback,” EEE Transactions On Communications, vol. 68, No. 7, Jul. 2020 (17 pages). [cited by applicant]
Dischinger, M., et al., “Characterizing Residential Broadband Networks,” 07, Oct. 24-26, 2007, San Diego, California, USA, pp. 43-56, (14 pages). [cited by applicant]
Domanovitz, D., “An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures,” IEEE Transactions On Information Theory, vol. 68, No. 1, Jan. 2022 (19 pages). [cited by applicant]
Duanmu, et al., “A Quality-of-Experience Index for Streaming Video,” IEEE Journal Of Selected Topics In Signal Processing, vol. 11, No. 1, Feb. 2017 (13 pages). [cited by applicant]
Dudzicz, D., et al., “An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures,” IEEE Transactions On Communications, vol. 68, No. 1, Jan. 2020 pp. 12-25 (14 pages). [cited by applicant]
Ellis et al., Performance analysis of AL-FEC for RTP-based streaming video traffic to residential users, IEEE, pp. 1 to 6. (Year: 2012). [cited by applicant]
Falk, B., et al., “Properties of Constacyclic Codes Under the Schur Product,” arXiv:1810.07630v2 [cs. IT] Oct. 18, 2018 (24 pages). [cited by applicant]
Falk, B., et al., “Properties of Constacyclic Codes Under the Schur Product,” Designs, Codes and Cryptography (2020) 88:993-1021 (29 pages). [cited by applicant]
Floyd, S. et al., “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Transactions on Networking. vol. I . No 1. Aug. 1993 (17 pages). [cited by applicant]
Forney, Jr., G., “Burst-Correcting Codes for the Classic Bursty Channel,” IEEE Transactions On Communications Technology, Oct. 1971, pp. 772-781 (10 pages). [cited by applicant]
Friedman, T., et al., “RTP Control Protocol Extended Reports (RTCP XR),” Network Working Group, Nov. 2003 (55 pages). [cited by applicant]
Frossard, P., “Joint Source/FEC Rate Selection for Quality-Optimal MPEG-2 Video Delivery,” IEEE Transactions On Image Processing, vol. 10, No. 12, Dec. 2001(11 pages). [cited by applicant]
Geist, M., et al., “Off-policy Learning With Eligibility Traces: A Survey,” Journal of Machine Learning Research 15 (2014) 289-333 (45 pages). [cited by applicant]
Gettys, J., “Bufferbloat: Dark Buffers in the Internet,” Published by the IEEE Computer Society, May/Jun. 2011 (2 pages). [cited by applicant]
Ghavamzadeh, M., et al., “Bayesian Reinforcement Learning: A Survey,” Foundations and Trends® in Machine Learning, vol. 8, No. 5-6 (2015) 359-483, 2015, 28 pages. [cited by applicant]
Gilbert, E., “Capacity of a Burst-Noise Channel,” The Bell System Technical Journal, Sep. 1960, pp. 1253-1265 (13 pages). [cited by applicant]
Ha, H., et al., “Layer-based RED-FEC (L-RED-FEC) method for wireless scalable video streaming,” Electronics Letters Sep. 25, 2014 vol. 50 No. 20 pp. 1438-1440 (2 pages). [cited by applicant]
Huo, Y., et al., “A Tutorial and Review on Inter-Layer FEC Coded Layered Video Streaming,” IEEE Communications Surveys & Tutorials 2015 (44 pages). [cited by applicant]
Ibrahim, I. et al., “Task Scheduling Algorithms in Cloud Computing: A Review,” Turkish Journal of Computer and Mathematics Education, vol. 12 No. 4 (2021), pp. 1041-1053 (13 pages). [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2024/043054, mailed Dec. 31, 2024 (19 pages). [cited by applicant]
Jeon, Y., et al., “Blind Detection for MIMO Systems With Low-Resolution ADCs Using Supervised Learning,” IEEE ICC 2017 Signal Processing for Communications Symposium (6 pages). [cited by applicant]
Jiang, P., et al., “Wireless Semantic Communications for Video Conferencing,” IEEE Journal on Selected Areas in Communications, vol. 41, No. 1, Jan. 2023 (15 pages). [cited by applicant]
Kaelbling, L., et al., “Reinforcement Learning: A Survey,” Journal of Articial Intelligence Research 4 (1996) 237-285 (49 pages). [cited by applicant]
Kazemi, M., et al., “A review of temporal video error concealment techniques and their suitability for HEVC and VVC,” Multimedia Tools and Applications (2021) 80:12685-12730 (46 pages). [cited by applicant]
Kotz, D., et al., “Crawdad: A Community, Resource for Archiving, Wireless Data at Dartmouth,” Conferences—HP Labs, www.computer.org/pervasive (3 pages). [cited by applicant]
Krishan, M., et al., “A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures,” 2019 IEEE (5 pages). [cited by applicant]
Kuhn, N., et al. “Forward Erasure Correction (FEC) Coding and Congestion Control in Transport,” RFC: 9265, Internet Research Task Force (IRTF), Jul. 2022 (21 pages). [cited by applicant]
Le Gall, D., “MPEG: A Video Compression Standard for Multimedia Applications,” Digital Image and Video Standards; Communications of the ACM, vol. 34, No. 4, Apr. 1991 (13 pages). [cited by applicant]
Levine, S., et al., “Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems,” arXiv:2005.01643v3 [cs.LG] Nov. 1, 2020 (43 pages). [cited by applicant]
Li, T., “Reparo: Loss-Resilient Generative Codec for Video Conferencing,” arXiv:2305.14135v1 [cs.NI] May 23, 2023 (17 pages). [cited by applicant]
Li, Y., “Deep Reinforcement Learning: An Overview,” arXiv:1701.07274v6 [cs.LG] Nov. 26, 2018 (85 pages). [cited by applicant]