Feedback-based online network coding

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S412000

Reexamination Certificate

active

08068426

ABSTRACT:
A method, apparatus and computer program product for feedback-based online network coding is presented. In one embodiment, a transmitting node determines a linear combination of packets to transmit from a transmit queue. The transmitting node transmits the linear combination of packets. The transmitting node determines whether a packet can be removed from the transmit queue, wherein when a determination is made that a packet can be removed from the transmit queue then removing the packet from the transmit queue, and when a determination is made that a packet cannot be removed from the transmit queue then refraining from removing the packet from the transmit queue.

REFERENCES:
patent: 6621851 (2003-09-01), Agee et al.
patent: 7760728 (2010-07-01), Chou et al.
patent: 7876677 (2011-01-01), Cheshire
patent: 2003/0214951 (2003-11-01), Joshi et al.
patent: 2005/0078653 (2005-04-01), Agashe et al.
patent: 2005/0251721 (2005-11-01), Ramesh et al.
patent: 2007/0116027 (2007-05-01), Ciavaglia et al.
patent: 2009/0175320 (2009-07-01), Haustein et al.
patent: 2010/0046371 (2010-02-01), Sundararajan et al.
patent: 2010/0054164 (2010-03-01), Lucani et al.
patent: 1 638 239 (2006-03-01), None
patent: 2007/109216 (2007-09-01), None
patent: 2010/005181 (2010-01-01), None
patent: 2010/025362 (2010-03-01), None
Lucani, et al., “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach”, presented Switzerland, Conference: NetCod 2009, Lausanne, Switzgerland; Jun. 2009; p. 6.
Lucani, et al., “On-Coding for Delay—New Approaches Based on Network Coding the Networks with Large Latency;” Conference: ITA Workshop, San Diego, USA; Feb. 2009; p. 10.
Lucani, et al., “Random Linear Network Coding for Time Division Duplexing: Energy Analysis;” Conference: ICC 2009, Dresden, Germany; Jun. 2009; p. 5.
Lucani, et al., “Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations;” Conference: Globe.com 2009, Hawaii, USA; Dec. 2009, pp. 6.
Lucani, et al., “Random Linear Network coding for Time-Division Duplexing: Queueing Analysis:” Conference ISIT 2009, Seoul, Korea; Jul. 2009; p. 5.
Lucani, et al., Random Linear Network coding for Time-Division Duplexing: when the stop talking and start listening; Presentation in INFOCOM; Slide Presentation; Apr. 23, 2009; p. 10.
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; 12 pages.
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, p. 6.
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; p. 17.
International Preliminary Report on Patentability of the ISA for PCT/US2009/055359 dated Apr. 21, 2011.
PCT Search Report of the ISA for PCT/US2009/055359 dated Mar. 30, 2011.
Written Opinion of the ISA for PCT/US2009/055359 dated Mar. 30, 2011.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Feedback-based online network coding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Feedback-based online network coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feedback-based online network coding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4269802

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.