Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2004-01-05
2008-08-05
Backer, Firmin (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S473000, C370S474000
Reexamination Certificate
active
07408938
ABSTRACT:
A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.
REFERENCES:
patent: 5631907 (1997-05-01), Guarneri et al.
patent: 5822317 (1998-10-01), Shibata
patent: 6609223 (2003-08-01), Wolfgang
patent: 6940854 (2005-09-01), Acharya et al.
patent: 2003/0063569 (2003-04-01), Kalliokulju et al.
patent: 2003/0156599 (2003-08-01), Casaccia et al.
patent: 2003/0179698 (2003-09-01), Lu
patent: 2004/0213238 (2004-10-01), Peled
patent: 2004/0246905 (2004-12-01), Dunagan et al.
Alswede, Cai, Li, and Yeung, “Network information flow,” IEEE Trans. Information Theory, vol. 46, No. 4, pp. 1204-1216, Jul. 2000.
Li, Yeung, and Cai, “Linear Network Coding,” IEEE Trans. Information Theory, vol. 49, No. 2, pp. 371-381, Feb. 2003.
Koetter and Médard, “Beyond Routing: An algebraic approach to network coding,” Proc. INFOCOM, IEEE 2002, pp. 122-130.
Jaggi, Jain, and Chou, “Low Complexity Algebraic Multicast Network Codes,” IEEE Int'l Symp. on Information Theory, Yokohama, Japan, Jun. 2003.
Sanders, Egner, and Tolhuizen, “Polynomial time algorithms for network information flow,” ACM Symp. on Parallelism in Algorithms and Architectures, San Diego, Jun. 7-9, 2003, pp. 286-294.
Jaggi, Sanders, Chou, Effros, Egner, Jain, and Tolhuizen, “Polynomial Time Algorithms for Multicast Network Code Construction,” IEEE Trans. Information Theory, Jul. 18, 2003, pp. 1-14.
Albanese, Blömer, Edmonds, Luby, and Sudan, “Priority Encoding Transmission,” IEEE Trans. Information Theory, vol. 42, No. 6, pp. 1737-1744, Nov. 1996.
Davis and Danskin, “Joint Source and Channel Coding for Image Transmission Over Lossy Packet Networks,” SPIE Conf. on Wavelet Applications to Digital Image Processing, vol. 2847, Denver, Aug. 1996, pp. 376-387.
Mohr, Riskin, and Ladner, “Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction,” IEEE J. Selected Areas in Communication, vol. 18, No. 6, pp. 819-828, Jun. 2000.
Puri and Ramchandran, “Multiple description source coding using forward error correction codes,” IEEE Conf. on Signals, Systems, and Computers, Asilomar, Oct. 1999. pp. 342-346.
Stockhammer and Buchner, “Progressive texture video streaming for lossy packet networks,” Proc. 11th Int'l Packet Video Workshop, Kyongju, May 2001, pp. 1-12.
Leibl, Stockhammer, Wagner, Pandel, Baese, Nguyen, and Burkert, “An RTP payload format for erasure-resilient transmission of progressive multimedia streams,” IETF Internet Draft draft-ietf-avt-uxp-00.txt, Feb. 2001, pp. 1-19.
Goldberg and Tarjan, “A New Approach to the Maximum-Flow Problem,” Journal of the Association for Computing Machinery, vol. 35, No. 4, Oct. 1988, pp. 921-940.
Dumitrescu, Wu and Wang, “Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams,” IEEE Trans. Multimedia, 2002 IEEE, pp. 73-82.
Karzanov, “Determining the Maximal Flow in a Network by the Method of Preflows,” Soviet Math. Dokl., vol. 15, (1974), No. 2, 4 pages.
Chou Philip A.
Jain Kamal
Wu Yunnan
Backer Firmin
Faroul Farah
Lee & Hayes PLLC
Microsoft Coporation
LandOfFree
System and method for efficient broadcast of information... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for efficient broadcast of information..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for efficient broadcast of information... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4007268