System and method for multicast conferencing and online discussion groups
Patent 6154463 Issued on November 28, 2000. Estimated Expiration Date: August 26, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
A system and method for multicast conferencing and online discussion groups using a periodically determined a close-to-optimal Steiner spanning tree. Both the system and method are suitable for stationary and/or mobile group members.
Other References
"Dualcast: A Scheme for Reliable Multicasting" by S. Aggarwal et al., IEEE Computer Society Press; Apr. 1994, pp. 15-22; Proceedings 1994 Int'l Conference on Network Protocols, Oct. 25-28, 1994, Boston Massachusetts
"Steiner's Problem in Graphs & Its Implications" by L. Hakimi; Networks, 1: pp. 113-133, published 1971 by John Wiley & Sons, Inc
"Multicast Routing for Multimedia Communication" by Kompella et al., IEEE/ACM Transactions on Networking, vol. 1, No. 3, Jun. 1993; pp. 286-292
"Core Based Trees (CBT); An Architecture for Scalable Inter-Domain Multicast Routing" by Tony Ballardie et al.; ACM SIGCOMM '93 Conference Proceedings, Communications Architectures, Protocols & Applications, vol. 23, No. 4, Oct. 1993; pp. 85-95
"How Bad is Naive Multicast Routing?" by Matthew Doar et al., IEEE Infocom '93 Proceedings vol. 1, 12th Annual Joint Conference of the IEEE Computer & Communications Societies, San Francisco, CA; 82-89
"Routing of Multipoint Connections" by Bernard M. Waxman; IEEE Journal on Selected Areas In Communications, vol. 6, No. 9, Dec. 1988; pp. 1617-1622
"Distance Vector Multicast Routing Protocol" by D. Waitzman et al.; Nov. 1988; Networking Working Group: Request for Comments: RFC 1075; http://info.internet.isi.edu:80/in-notes/rfc/files/rfc1075
"Host Extensions for IP Multicasting"by S. Deering; Aug. 1989; Network Working Group Request for Comments: 1112; Obsoletes: RFCs 988, 1054 http://info.internet.isi.edu:80/in-notes/rfc/files/rfc1112
"The Tradeoffs of Multicast Trees & Algorithms" by Liming Wei et al.; to appear in Proc. of 1994 Int'l Conf. on Computer Communications & Networks; Technical Rept.; Sep. 1993
"An Approximate Solution for the Steiner Problem in Graphs" by H. Takahashi et al.; Math. Japonica 24, No. 6, (1980) pp. 573-577
"Comparison of Multicast Routing Algorithms for High-Speed Networks" by H. F. Salama et al., IBM Technical Report, Sep. 1994; TR-29.1930 (94A004206)
"Mechanisms for Broadcast & Selective Broadcast"; Ph.D. Thesis, Jun. 1980; by D. W. Wall for Stanford University (87 pgs.)
"Multicast Routing in Datagram Internetworks and Extended LANs" by S. E. Deering & D. R. Cheriton; ACM Transactions ion computer Systems, vol. 8, No. 2, May 1990, pp. 85-110
"Multicast Routing Extensions for OSOPF" by John Moy,Communications of the ACM, Aug. 1994, vol. 37, No. 8, pp. 61-66
"MBONE: The Multicast Backbone" by Hans Eriksson; Communications of the ACM, Aug. 1994, vol. 37, No. 8, pp. 54-60
"An Architecture for Wide-Area Multicast Routing" by S. Deering et al..Computer Communication Review; ACM SIGCOM '94 Proc. of Conf. on Communications Architectures, Protocols & Applications, Aug.31-Sep. 2, 1994, London, UK; vol. 24, No. 4, Oct. 1994; pp. 126-135
"Multicasting for Multimedia Applications" by V. Kompella et al.; Proc. of IEEE Infocom; 1992; pp. 2078-2085
"Reducibility Among Combinatorial Problems" by Richard M. Karp; Complexity of Computer Computations: Proc. of Sym. held Mar. 20-22, 1972, at IBM TJ Watson Research Center; published by Plenum Press, 1972; pp. 85-103
"The Computation of Nearly Minimal Steiner Trees in Graphs" by V. J. Rayward-Smith International Journal of Mathematical Education in Science & Technology, 193, vol. 14, No. 1, pp. 15-2
August 26, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
