Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating
Reexamination Certificate
2003-06-23
2009-08-11
Pwu, Jeffrey (Department: 2446)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data transfer regulating
C709S230000
Reexamination Certificate
active
07574518
ABSTRACT:
A “multicast code constructor” facilitates network based coding in a multicast environment by determining efficient codes for optimizing network flows, thereby increasing reliable network throughput. The network code constructor processes incoming data at each node on a byte-by-byte level to produce outgoing packets to each node in the network. Network coding is provided in which arithmetic operations can occur in any finite field with more than N-1 elements, where N represents the number of receivers in the network. Further, the complexity of arithmetic employed by the coder is independent of the network capacity, and dependent only on the number of receivers in the network. In addition, in one embodiment, multicast codes are restricted to the portion of the network obtained by a union of unicast flows from a sender node to each receiver node to produce codes which do not flood the network excessively, thereby producing a lower code design complexity.
REFERENCES:
patent: 5926101 (1999-07-01), Dasgupta
patent: 6046978 (2000-04-01), Melnik
patent: 6757738 (2004-06-01), Cao et al.
patent: 6778518 (2004-08-01), Jesse et al.
patent: 6798765 (2004-09-01), Larsson
patent: 2005/0013253 (2005-01-01), Lindskog et al.
patent: 2007/0094181 (2007-04-01), Tayebnejad et al.
R. K. Ahuja, T. I. Magnanti, and J. B. Orlin, “Some Recent Advances in Network Flows”, SIAM Review, vol. 33, pp. 175-219, 1991.
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network Information Flow”, IEEE Transactions on Information Theory, IT-46, pp. 1204-1216, 2000.
Ralf Koetter and Muriel Médard; “Beyond routing: An algebraic approach to network coding.” In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOMM)., vol. 1, pp. 122-130, 2002.
Bloom, B., Space/time trade-offs in hash coding with allowable errors, Commun. ACM, Jul. 1970, pp. 422-426, vol. 13, No. 7.
Lee, S.-J., M. Gerla, and C.-C. Chiang, On-demand multicast routing protocol, Proc. IEEE Wireless Comm. and Networking Conf. (WCNC'99), Sep. 1999, pp. 1298-1302, New Orleans, Louisiana, U.S.A.
Mitzenmacher, M., Compressed bloom filters, IEEE/ACM Transactions on Networking, 2002, vol. 10, No. 5, pp. 604-612.
Jaggi Sidharth
Jain Kamal
Bruckart Benjamin R
Lyon & Harr LLP
Microsoft Corporation
Pwu Jeffrey
Watson Mark A.
LandOfFree
System and method for computing low complexity algebraic... 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 computing low complexity algebraic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for computing low complexity algebraic... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4088102