Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-09-27
2011-12-20
Ton, Dang (Department: 2475)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S392000, C370S338000
Reexamination Certificate
active
08081641
ABSTRACT:
One embodiment is directed to transmitting encoded data over a broadcast medium to improve network throughput. A sending node may identify a first packet to be transmitted to a first network node and a second packet to be transmitted to a second network node. The sending node may determine whether the first network node stores the second packet and whether the second network node stores the first packet. If the sending node determines that the first network node stores the second packet and the second network node stores the first packet, it may code together the first and second packets to generate an encoded packet and may transmit the encoded packet over the broadcast medium. Thus, the first packet may be transmitted to the first network node and the second packet may be transmitted to the second node in a single transmission.
REFERENCES:
patent: 5832215 (1998-11-01), Kato et al.
patent: 7027773 (2006-04-01), McMillin
patent: 7100195 (2006-08-01), Underwood
patent: 2004/0143672 (2004-07-01), Padmanabham et al.
patent: 2005/0108368 (2005-05-01), Mohan et al.
patent: 2005/0198187 (2005-09-01), Tierney et al.
patent: 2007/0086485 (2007-04-01), Vega-Garcia et al.
patent: 2007/0274324 (2007-11-01), Wu et al.
patent: 2008/0030513 (2008-02-01), Jiao et al.
patent: 1372306 (2003-12-01), None
Katti, Sachin et al., “The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments,” pp. 1-10.
Katti, Sachin et al., “XORs in the Air: Practical Wireless Network Coding,” SIGCOMM '06, Sep. 11-15, 2006, pp. 243-254.
Chou et al., “Practical Network Coding,”41stAllerton Conf. Communication, On Communication, Control and Computing, Oct. 2003, pp. 40-49.
Ho et al, “Online Incremental Network Coding for Multiple Unicasts,”DIMACS Working Group on Network Coding, Jan. 2005, pp. 1-14.
Ho et al., “The Benefits of Coding Over Routing in a Randomized Setting,”International Symposium on Information Theory(ISIT), Jun. 2003, p. 442.
Ho et al., “The Utility of Network Coding in Dynamic Environments,”International Workshop on Wireless Ad-Hoc Networks(IWWAN), May 2004, pp. 196-200.
Jaggi et al., “Polynomial Time Algorithms for Multicast Network Code Construction,”IEEE Transactions on Information Theory, vol. 51, No. 6, Jun. 2005, pp. 1973-1982.
Koetter et al., “An Algebraic Approach to Network Coding,”IEEE/ACM Transactions on Networking, vol. 11, No. 5, Oct. 2003, pp. 782-795.
Lun et al., “Efficient Operation of wireless Packet Networks Using Network Coding,”International Workshop on Convergent Technologies(IWCT), 2005, pp. 1-5.
Lun et al., “Further Results on Coding for Reliable Communication Over Packet Networks,”IEEE International Symposium on Information Theory(ISIT 05), 2005, 5 pages.
Lun et al., “Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding,”IEEE Infocom, 2005, pp. 1608-1617.
Wu et al., “Information Exchange in Wireless Networks with Network Coding and Physical-Layer Broadcast,”MSR-TR-2004-78, Aug. 2004, 7 pages.
Wu et al., “Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach,”IEEE Infocom, vol. 24, No. 8, Aug. 2006, pp. 1475-1488.
Katabi Dina
Katti Sachin
Rahul Hariharan
Chapin IP Law LLC
Massachusetts Institute of Technology
Randhawa Mandish
Rouille, Esq. David W.
Ton Dang
LandOfFree
Methods and apparatus for 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 Methods and apparatus for network coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for network coding will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4301864