Broadcasting network
DC CAFCFirst Claim
1. A non-routing table based computer network having a plurality of participants, each participant having connections to at least three neighbor participants, wherein an originating participant sends data to the other participants by sending the data through each of its connections to its neighbor participants, wherein each participant sends data that it receives from a neighbor participant to its other neighbor participants, wherein data is numbered sequentially so that data received out of order can be queued and rearranged, further wherein the network is m-regular and m-connected, where m is the number of neighbor participants of each participant, and further wherein the number of participants is at least two greater than m thus resulting in a non-complete graph.
4 Assignments
Litigations
6 Petitions
Accused Products
Abstract
A technique for broadcasting data across a network is provided. An originating participant sends data to another participant, which in turn sends the data that it receives from a neighbor participant to its other neighbor participants. Communication in the broadcast network is controlled by a contact module that locates the neighbor participants to which the seeking participant can be connected and by a join module that establishes the connection between the neighbor participants and the seeking participant. Data is numbered sequentially so that data that is received out of order can be queued and rearranged.
126 Citations
24 Claims
- 1. A non-routing table based computer network having a plurality of participants, each participant having connections to at least three neighbor participants, wherein an originating participant sends data to the other participants by sending the data through each of its connections to its neighbor participants, wherein each participant sends data that it receives from a neighbor participant to its other neighbor participants, wherein data is numbered sequentially so that data received out of order can be queued and rearranged, further wherein the network is m-regular and m-connected, where m is the number of neighbor participants of each participant, and further wherein the number of participants is at least two greater than m thus resulting in a non-complete graph.
-
10. A non-routing table based broadcast channel for participants, comprising:
-
a communications network that provides peer-to-peer communications between the participants connected to the broadcast channel; and
for each participant connected to the broadcast channel, an indication of four neighbor participants of that participant; and
a broadcast component that receives data from a neighbor participant using the communications network and that sends the received data to its other neighbor participants to effect the broadcasting of the data to each participant of the to broadcast channel, wherein the network is m-regular and m-connected, where m is the number of neighbor participants of each participant, and further wherein the number of participants is at least two greater than m thus resulting in a non-complete graph. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A non-routing table based computer-readable medium containing instructions for controlling communications of a participant of a broadcast channel within a network, by a method comprising:
-
locating a portal computer;
requesting the located portal computer to provide an indication of neighbor participants to which the participant can be connected;
receiving the indications of the neighbor participants; and
establishing a connection between the participant and each of the indicated neighbor participants, wherein a connection between the portal computer and the participant is not established, wherein a connection between the portal computer and the neighbor participants is not established, further wherein the network is m-regular and m-connected, where m is the number of neighbor participants of each participant, and further wherein the number of participants is at least two greater than m thus resulting in a non-complete graph. - View Dependent Claims (20, 21, 22, 23, 24)
receiving data from a neighbor participant of the participant; and
transmitting the received data to the other neighbor participants.
-
-
23. The computer-readable medium of claim 19 including:
-
receiving a request to connect to another participant;
disconnecting from a neighbor participant; and
connecting to the other participant.
-
-
24. The computer-readable medium of claim 19 wherein the connections are established using the TCP/IP protocol.
Specification