Joining a broadcast channel
DC CAFC
First Claim
1. A computer-based, non-routing table based, non-switch based method for adding a participant to a network of participants, each participant being connected to three or more other participants, the method comprising:
- identifying a pair of participants of the network that are connected wherein a seeking participant contacts a fully connected portal computer, which in turn sends an edge connection request to a number of randomly selected neighboring participants to which the seeking participant is to connect;
disconnecting the participants of the identified pair from each other; and
connecting each participant of the identified pair of participants to the seeking participant.
4 Assignments
Litigations
2 Petitions
Accused Products
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.
119 Citations
17 Claims
-
1. A computer-based, non-routing table based, non-switch based method for adding a participant to a network of participants, each participant being connected to three or more other participants, the method comprising:
-
identifying a pair of participants of the network that are connected wherein a seeking participant contacts a fully connected portal computer, which in turn sends an edge connection request to a number of randomly selected neighboring participants to which the seeking participant is to connect;
disconnecting the participants of the identified pair from each other; and
connecting each participant of the identified pair of participants to the seeking participant. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer-based, non-switch based method for adding nodes to a graph that is m-regular and m-connected to maintain the graph as m-regular, where m is four or greater, the method comprising:
-
identifying p pairs of nodes of the graph that are connected, where p is one half of m, wherein a seeking node contacts a fully connected portal node, which in turn sends an edge connection request to a number of randomly selected neighboring nodes to which the seeking node is to connect;
disconnecting the nodes of each identified pair from each other; and
connecting each node of the identified pairs of nodes to the seeking node. - View Dependent Claims (15, 16, 17)
-
Specification
-
- Resources
-
Current AssigneePH Madison Funding, LLC
-
Original AssigneeThe Boeing Co.
-
InventorsBourassa, Virgil E., Holt, Fred B.
-
Primary Examiner(s)Burgess, Glenton B.
-
Assistant Examiner(s)EDELMAN, BRADLEY E
-
Application NumberUS09/629,570Time in Patent Office1,786 DaysField of Search709/221, 709/220, 709/252, 709/243, 709/227, 709/223, 709/204, 709/238, 370/225, 370/260, 370/400, 455/428US Class Current709/221CPC Class CodesH04L 12/1822 Conducting the conference, ...H04L 12/1827 Network arrangements for co...H04L 12/185 with management of multicas...H04L 12/1854 with non-centralised forwar...H04L 67/54 Presence management, e.g. m...H04L 69/329 in the application layer [O...
