EP 1782245 A4 20100825 - SYSTEMS FOR DISTRIBUTING DATA OVER A COMPUTER NETWORK AND METHODS FOR ARRANGING NODES FOR DISTRIBUTION OF DATA OVER A COMPUTER NETWORK
Title (en)
SYSTEMS FOR DISTRIBUTING DATA OVER A COMPUTER NETWORK AND METHODS FOR ARRANGING NODES FOR DISTRIBUTION OF DATA OVER A COMPUTER NETWORK
Title (de)
SYSTEME ZUM VERTEILEN VON DATEN ÜBER EIN COMPUTERNETZWERK UND VERFAHREN ZUM ANORDNEN VON KNOTEN ZUR VERTEILUNG VON DATEN ÜBER EIN COMPUTERNETZWERK
Title (fr)
SYSTEMES DESTINES A DISTRIBUER DES DONNEES SUR UN RESEAU INFORMATIQUE ET PROCEDES DESTINES A AGENCER DES NOEUDS EN VUE D'UNE DISTRIBUTION DE DONNEES SUR UN RESEAU INFORMATIQUE
Publication
Application
Priority
- US 2005024515 W 20050711
- US 58687604 P 20040709
Abstract (en)
[origin: WO2006010111A2] Various embodiments of the present invention relate to a system for distributing data (e.g., content data) over a computer network and a method of arranging receiver nodes in a computer network such that the capacity of a server is effectively increased (e.g., the capacity of a server may be effectively multiplied many times over; the capacity of the server may be effectively increased exponentially). In one embodiment the present invention may take advantage of the excess capacity many receiver nodes possess, and may use such receiver nodes as repeaters. The distribution system may include node(s) having database(s) which indicate ancestor(s) and/or descendant(s) of the node so that reconfiguration of the distribution network may be accomplished without burdening the system's primary server. An embodiment of the present invention may include a process for configuring a computer information distribution network having a primary server node and user nodes docked in a cascaded relationship, and reconfiguring the network in the event that a user node departs from the network. In one example (which example is intended to be illustrative and not restrictive), the process may include the steps of providing a new user node (or connection requesting user node) with a connection address list of nodes within the network, having the new user node (or connection requesting user node) go to (or attempt to go to) the node at the top of the connection address list, determine whether that node is still part of the distribution network, and connect thereto if it is, and if it is not, to go to (or attempt to go to) the next node on the connection address list. In another example (which example is intended to be illustrative and not restrictive), when a user node departs from the distribution network, a propagation signal may be transmitted to the nodes below it in the network, causing them to move up in the network in a predetermined order. In another example (which example is intended to be illustrative and not restrictive), the present invention may provide a decentralized approach which provides, to each new user node (or connection requesting user node) a path back to the root server.
IPC 8 full level
G06F 15/16 (2006.01); H04L 29/08 (2006.01)
CPC (source: EP)
H04L 67/10 (2013.01); H04L 67/104 (2013.01); H04L 67/1044 (2013.01); H04L 67/1089 (2013.01); H04L 67/1074 (2013.01)
Citation (search report)
- [Y] US 2003051051 A1 20030313 - O'NEAL MICHAEL [US], et al
- [Y] WO 03069467 A1 20030821 - HORIZON A GLIMPSE OF TOMORROW [US]
- See references of WO 2006010111A2
Designated contracting state (EPC)
AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR
DOCDB simple family (publication)
WO 2006010111 A2 20060126; WO 2006010111 A3 20070412; CA 2577443 A1 20060126; CA 2577443 C 20170822; CA 2975031 A1 20060126; CA 2975031 C 20191217; EP 1782245 A2 20070509; EP 1782245 A4 20100825
DOCDB simple family (application)
US 2005024515 W 20050711; CA 2577443 A 20050711; CA 2975031 A 20050711; EP 05769257 A 20050711