Global Patent Index - EP 1368948 A2

EP 1368948 A2 20031210 - METHOD AND APPARATUS FOR LARGE PAYLOAD DISTRIBUTION IN A NETWORK

Title (en)

METHOD AND APPARATUS FOR LARGE PAYLOAD DISTRIBUTION IN A NETWORK

Title (de)

VERFAHREN UND VORRICHTUNG ZUR VERTEILUNG VON GROSSER NUTZLAST ÜBER EIN NETZ

Title (fr)

PROCEDE ET APPAREIL DE REPARTITION DE FICHIERS DE CHARGE UTILE DE GRANDE TAILLE DANS UN RESEAU

Publication

EP 1368948 A2 20031210 (EN)

Application

EP 01989004 A 20011026

Priority

  • US 0132638 W 20011026
  • US 26628600 P 20001026
  • US 68164401 A 20010515
  • US 68166501 A 20010517
  • US 68166801 A 20010518
  • US 68166901 A 20010518
  • US 68167101 A 20010518
  • US 68167201 A 20010518
  • US 68167301 A 20010518

Abstract (en)

[origin: WO0235799A2] Large payload files are selectively partitioned in blocks and theblocks distributed to a plurality of distribution stations at theedge of the network qualified to have the data. Each qualified station decides how much and what portion of the content to save locally, based on information such as network location and environment, usage, popularity, and other distribution criteria defined by the content provider. Different pieces of a large payload file may be available from different nodes, however, when a user requests access to the large payload file, for example, through an application server, a virtual file control system creates an illusion that the entire file is present at the connected node. However, since only selective portions of the large payload file may actually be resident at that node's storage at the time of request, a cluster of distribution servers at the distribution station may download the non-resident portions of the file as the applicationserver is servicing the user. The download may be in parallel andusually from the least congested nodes. New nodes added to the network learn from other nodes in the network what content they should have and downlaod the required content, in a desired amount, onto their local storage devices from the nearest and least congested nodes without interrupting network operation. Each node manages its local storage and decides what content to prune based on information such as usage patterns.

IPC 1-7

H04L 29/06; G06F 17/30

IPC 8 full level

G06F 17/30 (2006.01); H04L 12/803 (2013.01); H04L 29/06 (2006.01)

CPC (source: EP)

G06F 16/182 (2018.12); G06F 16/188 (2018.12); H04L 47/125 (2013.01); H04L 67/1095 (2013.01)

Citation (search report)

See references of WO 0235799A2

Designated contracting state (EPC)

AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

DOCDB simple family (publication)

WO 0235799 A2 20020502; WO 0235799 A3 20030925; AU 2444802 A 20020506; CN 100525288 C 20090805; CN 1481635 A 20040310; EP 1368948 A2 20031210

DOCDB simple family (application)

US 0132638 W 20011026; AU 2444802 A 20011026; CN 01820814 A 20011026; EP 01989004 A 20011026