Joining a broadcast channel

Details Joining a broadcast channel Joining a broadcast channel

2005-06-21

2005-06-21

Burgess, Glenton B. (Department: 2153)

Electrical computers and digital processing systems: multicomput

Network computer configuring

Reconfiguring

C709S252000, C709S243000, C709S227000

Reexamination Certificate

active

06910069

ABSTRACT:
A technique for adding a participant to a network is provided. This technique allows for the simultaneous sharing of information among many participants in a network without the placement of a high overhead on the underlying communication network. To connect to the broadcast channel, a seeking computer first locates a computer that is fully connected to the broadcast channel. The seeking computer then establishes a connection with a number of the computers that are already connected to the broadcast channel. The technique for adding a participant to a network includes identifying a pair of participants that are connected to the network, disconnecting the participants of the identified pair from each other, and connecting each participant of the identified pair of participants to the added participant.

REFERENCES:
patent: 4912656 (1990-03-01), Cain et al.
patent: 5056085 (1991-10-01), Vu
patent: 5058105 (1991-10-01), Mansour et al.
patent: 5079767 (1992-01-01), Perlman
patent: 5099235 (1992-03-01), Crookshanks
patent: 5101480 (1992-03-01), Shin et al.
patent: 5117422 (1992-05-01), Hauptschein et al.
patent: 5309437 (1994-05-01), Perlman et al.
patent: 5345558 (1994-09-01), Opher et al.
patent: 5426637 (1995-06-01), Derby et al.
patent: 5459725 (1995-10-01), Bodner et al.
patent: 5471623 (1995-11-01), Napolitano, Jr.
patent: 5511168 (1996-04-01), Perlman et al.
patent: 5535199 (1996-07-01), Amri et al.
patent: 5568487 (1996-10-01), Sitbon et al.
patent: 5636371 (1997-06-01), Yu
patent: 5644714 (1997-07-01), Kikinis
patent: 5673265 (1997-09-01), Gupta et al.
patent: 5696903 (1997-12-01), Mahany
patent: 5732074 (1998-03-01), Spaur et al.
patent: 5732086 (1998-03-01), Liang et al.
patent: 5732219 (1998-03-01), Blumer et al.
patent: 5734865 (1998-03-01), Yu
patent: 5737526 (1998-04-01), Periasamy et al.
patent: 5754830 (1998-05-01), Butts et al.
patent: 5757795 (1998-05-01), Schnell
patent: 5761425 (1998-06-01), Miller
patent: 5764756 (1998-06-01), Onweller
patent: 5790548 (1998-08-01), Sistanizadeh et al.
patent: 5790553 (1998-08-01), Deaton, Jr. et al.
patent: 5799016 (1998-08-01), Onweller
patent: 5802285 (1998-09-01), Hirviniemi
patent: 5850592 (1998-12-01), Ramanathan
patent: 5864711 (1999-01-01), Mairs et al.
patent: 5867660 (1999-02-01), Schmidt et al.
patent: 5867667 (1999-02-01), Butman et al.
patent: 5870605 (1999-02-01), Bracho et al.
patent: 5874960 (1999-02-01), Mairs et al.
patent: 5899980 (1999-05-01), Wilf et al.
patent: 5907610 (1999-05-01), Onweller
patent: 5925097 (1999-07-01), Gopinath et al.
patent: 5928335 (1999-07-01), Morita
patent: 5935215 (1999-08-01), Bell et al.
patent: 5946316 (1999-08-01), Chen et al.
patent: 5948054 (1999-09-01), Nielsen
patent: 5949975 (1999-09-01), Batty et al.
patent: 5953318 (1999-09-01), Nattkemper et al.
patent: 5956484 (1999-09-01), Rosenberg et al.
patent: 5970232 (1999-10-01), Passint et al.
patent: 5974043 (1999-10-01), Solomon
patent: 5987506 (1999-11-01), Carter et al.
patent: 6003088 (1999-12-01), Houston et al.
patent: 6013107 (2000-01-01), Blackshear et al.
patent: 6023734 (2000-02-01), Ratcliff et al.
patent: 6029171 (2000-02-01), Smiga et al.
patent: 6032188 (2000-02-01), Mairs et al.
patent: 6038602 (2000-03-01), Ishikawa
patent: 6047289 (2000-04-01), Thorne et al.
patent: 6065063 (2000-05-01), Abali
patent: 6073177 (2000-06-01), Hebel et al.
patent: 6094676 (2000-07-01), Gray et al.
patent: 6115580 (2000-09-01), Chuprun et al.
patent: 6151633 (2000-11-01), Hurst
patent: 6167432 (2000-12-01), Jiang
patent: 6173314 (2001-01-01), Kurashima et al.
patent: 6195366 (2001-02-01), Kayashima
patent: 6199116 (2001-03-01), May et al.
patent: 6216177 (2001-04-01), Mairs et al.
patent: 6223212 (2001-04-01), Batty et al.
patent: 6243691 (2001-06-01), Fisher et al.
patent: 6252884 (2001-06-01), Hunter
patent: 6268855 (2001-07-01), Mairs et al.
patent: 6269080 (2001-07-01), Kumar
patent: 6271839 (2001-08-01), Mairs et al.
patent: 6272548 (2001-08-01), Cotter et al.
patent: 6285363 (2001-09-01), Mairs et al.
patent: 6304928 (2001-10-01), Mairs et al.
patent: 6321270 (2001-11-01), Crawley
patent: 6353599 (2002-03-01), Bi et al.
patent: 6415270 (2002-07-01), Rackson et al.
patent: 6434622 (2002-08-01), Monteiro et al.
patent: 6463078 (2002-10-01), Engstrom et al.
patent: 6490247 (2002-12-01), Gilbert et al.
patent: 6499251 (2002-12-01), Weder
patent: 6505289 (2003-01-01), Han et al.
patent: 6524189 (2003-02-01), Rautila
patent: 6553020 (2003-04-01), Hughes et al.
patent: 6603742 (2003-08-01), Steele et al.
patent: 6611872 (2003-08-01), McCanne
patent: 6618752 (2003-09-01), Moore et al.
patent: 6701344 (2004-03-01), Holt et al.
patent: 2002/0027896 (2002-03-01), Hughes et al.
Cho et al., “A Flood Routing Method for Data Networks,” Sep. 1997, Proceedings of 1997 International Conference on Information, Communications and Signal Processing, vol. 3, pp. 1418-1422.
Bandyopadhyay et al., “A Flexible Architecture for Multi-Hop Optical Networks,” Oct. 1998, 7th International Conference on Computer Communications and Networks, 1998, pp. 472-478.
Hsu, “On Four-Connecting a Triconnected Graph,” Oct. 1992, Annual Symposium on Foundations of Computer Science, 1992, pp. 70-79.
Shiokawa et al., “Performance Analysis of Network Connective Probability of Multihop Network under Correlated Breakage,” Jun. 1996, 1996 IEEE International Conference on Communications, vol. 3, pp. 1581-1585.
Komine et al., “A Distributed Restoration Algorithm for Multiple-Link and Node Failures of Transport Networks,” Dec. 199 IEEE Globecom '90, ‘Communications: Connecting the Future,’ vol. 1, pp. 459-463.
U.S. Appl. No. 09/629,576, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,577, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,575, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,572, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,023, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,043, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,024, filed Jul. 31, 2000, Bourassa et al.
U.S. Appl. No. 09/629,042, filed Jul. 31, 2000, Bourassa et al.
Murphy, Patricia, A., “The Next Generation Networking Paradigm: Producer/Consumer Model,” Dedicated Systems Magazine—2000 (pp. 26-28).
The Gamer's Guide, “First-Person Shooters,” Oct. 20, 1998 (4 pages).
The O'Reilly Network, “Gnutella: Alive, Well, and Changing Fast,” Jan. 25, 2001 (5 pages) http://www.open2p.com/1pt/ . . . [Accessed Jan. 29, 2002].
Oram, Andy, “Gnutella and Freenet Represents True Technological Innovation,” May 12, 2000 (7 pages) The O'Reilly Network http://www.oreillynet.com/1pt . . . [Accessed Jan. 29, 2003].
Internetworking Technologies Handbook, Chapter 43 (pp. 43-1-43-16).
Oram, Andy, “Peer-to-Peer Makes the Internet Interesting Again,” Sep. 22, 2000 (7 pages) The O'Reilly Network http://linux.oreillynet.com/1pt . . . [Accessed Jan. 29, 2002].
Monte, Richard, “The Random Walk for Dummies,”MIT Undergraduate Journal of Mathematics (pp. 143-148).
Srinivasan, R., “XDR: External Data Representation Standard,” Sun Microsystems, Aug. 1995 (20 pages) Internet RFC/STD/FYI/BCP Archives http://www.faqs.org/rfcs/rfc1832.html [Accessed Jan. 29, 2002].
A Databeam Corporate White Paper, “A Primer on the T.120 Series Standards,” Copyright 1995 (pp. 1-16).
Kessler, Gary, C., “An Overview of TCP/IP Protocols and the Internet,” Apr. 23, 1999 (23 pages) Hill Associates, Inc. http://www.hill.com/library/publications/t . . . [Accessed Jan. 29, 2002].
Bondy, J.A., and Murty, U.S.R., “Graph Theory with Applications,” Chapters 1-3 (pp. 1-47), 1976 American Elsevier Publishing Co., Inc., New York, New York.
Cormen, Thomas, H. et al., Introduction to Algorithms, Chapter 5.3 (pp. 84-91), Chapter 12 (pp. 218-243), Chapter 13 (p. 245), 1990, The MIT Press, Cambridge, Massachusetts, McGraw-Hill Book Company, New York.
The Common Object Request Broker:

Affiliated with

Also associated with

Rating

Joining a broadcast channel does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Joining a broadcast channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joining a broadcast channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3511951