WO2001093064A1 - Distribution de contenu poste a poste dynamique sur un reseau - Google Patents

Distribution de contenu poste a poste dynamique sur un reseau Download PDF

Info

Publication number
WO2001093064A1
WO2001093064A1 PCT/IL2001/000498 IL0100498W WO0193064A1 WO 2001093064 A1 WO2001093064 A1 WO 2001093064A1 IL 0100498 W IL0100498 W IL 0100498W WO 0193064 A1 WO0193064 A1 WO 0193064A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
request
content
activated
Prior art date
Application number
PCT/IL2001/000498
Other languages
English (en)
Inventor
Moshe Raines
Ittai Golde
Oded Regev
Amit Regev
Ori Eyal
Original Assignee
Emikolo Networks Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Emikolo Networks Inc. filed Critical Emikolo Networks Inc.
Priority to AU64194/01A priority Critical patent/AU6419401A/en
Publication of WO2001093064A1 publication Critical patent/WO2001093064A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/957—Browsing optimisation, e.g. caching or content distillation
    • G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/101—Server selection for load balancing based on network conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1021—Server selection for load balancing based on client or server locations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1063—Discovery through centralising entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/2866—Architectures; Arrangements
    • H04L67/289—Intermediate processing functionally located close to the data consumer application, e.g. in same machine, in same home or in same sub-network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/563—Data redirection of data network streams
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Definitions

  • This invention relates to distribution of data content over a network and more particularly but not exclusively to distribution using peer to peer methodology of data content over the Internet.
  • CDNs Content Distribution Networks
  • CDNs Content Distribution Networks
  • CDN service is based on the deployment of intelligent servers and other networking elements on the edge of various transport networks. These servers monitor networking traffic and served data to users.
  • the networking elements of CDNs usually servers loaded with routing control and caching software, create a unified platform across disparate networks for a site owner to deploy on. CDN usage thus reduces some of the cost to a site owner, spreading the cost of buying different machines for example, and also perhaps spreading the difficulties in maintaining them, over numerous site owners. Nevertheless, as file size grows, CDNs have to buy larger and larger pipes, passing the cost onto their clients, those wishing to distribute content.
  • CDNs do not help to solve the problem of the ever-increasing need for, and cost of, bandwidth to one wishing to deliver content to many different users.
  • an application that caches web objects on different users machines, and redirects other users to download those objects from users who have previously downloaded the same content object.
  • apparatus for use in association with a network content provider for providing dynamic mirroring of objects of said content over said network in cooperation with network nodes activated for interaction with said apparatus by caching downloaded objects, the apparatus comprising: a listing unit for preparing, dynamically updating and storing a listing of at least one object of said content and activated nodes that have been sent said respective object, and a list extractor, associated with said listing unit, for receiving download requests sent to said content provider and for extracting details from said listing of an object specified in said download request, using said extracted details in a response for sending to a requestor, and for reporting to said listing unit on requests originating from activated nodes.
  • said listing unit is operable to discriminate between activated sites on the basis of at least one of type of connection and bandwidth of connection, thereby to enable said response to guide requestors to easily accessible nodes.
  • An embodiment preferably further comprises an object expiration unit for applying to each object an expiration time for said activated nodes to remove said object from cached storage, said unit being associated with said listing unit, thereby to remove activated nodes whose objects have expired from said listing.
  • the list extractor has network location functionality for determining relative locations between a requesting node and activated nodes having a requested object, thereby to favor relatively closeby activated nodes in said response.
  • the apparatus has response tracking functionality for recording activated nodes to which extracted details have recently been sent, and operable to refer requesting sites to at least one of said activated nodes to obtain said details.
  • the apparatus further comprises a node activation unit, said unit operable to send to a node a software agent able to cache objects and send said objects to other network nodes in response to requests therefor, thereby activating said node for use with said apparatus.
  • the node activation unit is operable to determine whether a node is behind a firewall, said apparatus being directable not to regard nodes behind firewalls as activated nodes.
  • the agent is operable to determine whether a node is behind a firewall and indicates said node as a non-activated node if it is behind a firewall.
  • the agent comprises: a request interception unit for intercepting requests for content from a user at said node to compare said request with a list of content sources associated with said apparatus, request forwarding unit for forwarding said request to said apparatus, request modifying unit for modifying said request to be directed at a node specified in said response.
  • a request interception unit for intercepting requests for content from a user at said node to compare said request with a list of content sources associated with said apparatus
  • request forwarding unit for forwarding said request to said apparatus
  • request modifying unit for modifying said request to be directed at a node specified in said response.
  • the agent is operable as an interface between said apparatus and a web-browser at said node.
  • the request modifying unit is operable to select an activated node from said response in accordance with proximity of said activated node over said network.
  • the request modifying unit is operable to select an activated node from said response in accordance with a network connection quality of said activated node with said network.
  • the response comprises a referral to a listed activated node having a requested object so that the user is provided with the experience of having received the object automatically and the entire referral process takes place without the user being aware of it.
  • a network software agent for use at a user node of a network in conjunction with dynamic mirroring apparatus, said agent comprising a caching unit to cache internet data content objects, and a cached object sending unit to send said objects to other network nodes in response to requests therefor, thereby activating said node as a dynamic mirror for use with said apparatus.
  • the agent is operable to determine whether a node is behind a firewall, said agent being directable not to activate said node behind a firewall as a dynamic node.
  • the agent comprises: a request interception unit for intercepting requests for content from a user at said node to compare said request with a list of content sources associated with said apparatus, request forwarding unit for forwarding said request to said apparatus, request modifying unit for modifying said request to be directed at a node specified in said response.
  • a request interception unit for intercepting requests for content from a user at said node to compare said request with a list of content sources associated with said apparatus
  • request forwarding unit for forwarding said request to said apparatus
  • request modifying unit for modifying said request to be directed at a node specified in said response.
  • the agent is operable as an interface between said apparatus and a web-browser at said node.
  • said request modifying unit is operable to select an activated node from said response in accordance with proximity of said activated node over said network.
  • said request modifying unit is operable to select an activated node from said response in accordance with a network connection quality of said activated node with said network.
  • a network software agent for use at a user node of a network in conjunction with dynamic mirroring apparatus, the agent comprising: a request interception unit for intercepting requests for content from a user at said user node to compare said request with a list of content sources associated with said apparatus, request forwarding unit for forwarding said request to said apparatus, request modifying unit for modifying said request to be directed at a dynamic mirror node specified in said response.
  • the agent is operable as an interface between said apparatus and a web-browser at said node.
  • said request modifying unit is operable to select an activated node from said response in accordance with proximity of said activated node over said network.
  • said request modifying unit is operable to select an activated node from said response in accordance with a network connection quality of said activated node with said network.
  • a method of dynamic mirroring of data content over a network comprising: receiving a request for a content object, checking for previous recipients of said content object, sending to a requestor of said content a list of at least one previous recipient of said content, which said previous recipients are network nodes activated for caching of network objects for sending in response to redirected data requests, thereby dynamically mirroring said content objects over said network.
  • said previous recipient is supplied as an activated referral so that the entire process is invisible to the user.
  • the automatic referral need not at the user end so that the user sends out the request via the user client, an ASM is provided including a favored alternative site and the object is downloaded directly to the user from the site recommended in the referral without the user client ever actually sending a request to the alternative site.
  • FIG. 1 shows a simplified schematic of the structure of a large network.
  • Fig 2 shows a server memory running a server application and a content serving site.
  • Figs 3a and 3b show a user memory before and after visiting a server operative according to an embodiment of the present invention.
  • a preferred embodiment of the invention requires a network, a content server having data content, typically arranged as objects, web pages, graphics files etc, and user machines on the network.
  • a simplified view of such a network is given in Fig. 1.
  • a content server 10 is connected via a pipe 12 to an ISP 14.
  • the ISP has a pipe 16 running to a line owner 18, which is connected via pipes 20,22,24 to other ISP's 26,28,30 that in turn connect via various pipes 32-50 to end user computers 52-70.
  • Computers 10,52-70 consist of memory, a CPU, and some mechanism to send and receive information from a network.
  • FIG. 2 is a simplified block diagram showing a server for providing data content over a network according to a first embodiment of the present invention.
  • Computer 10 has content 94-112 to be distributed across a network (fig.l), content serving software 92, and server side software 72.
  • server side application72 there is a copy of a client side agent which end nodes would install on their systems 76, a common object list (COL) 74 which is a dynamically maintained list of what objects 94-112 have been downloaded by which network nodes or user computers 52-70.
  • COL common object list
  • the COL is a list of locations to which objects have been downloaded.
  • the application may generate a subset of the COL, a personalized copy of the COL, an ASM which may contain references for the specific requesting end node to locations which a current end node may go to in the expectation of downloading the respective content object 94-112.
  • the expectation is due to activating the locations to cache downloaded content for sending to subsequent users, as will be described in more detail below.
  • Figs 3 a and 3b are simplified block diagrams respectively showing an end user's machine before (3 a) and after (3b) the user has visited a server application enabled content server.
  • the user machine 52-70 has a content browser 114 connected via modem 116 or the like to the network 32-50.
  • the user Upon visiting the server application enabled site, if the user hasn't already downloaded an agent program previously, either from the current site, or from some other location using the redirection technology, the user receives a small agent program 76.
  • the agent program 76 sits between the browser and the network connection and acts as a proxy for the content browser.
  • Proxy server is just one possible implementation, it may alternatively act as a packet sniffer, or connect directly to the users web browser, or even replace the users web browser, the agent may be a typical plug-in to the browser, or the agent may be a Java applet.
  • the user agent 76 intercepts requests for content, checks whether the request is to an content source that is part of the arrangement and if so, diverts the request to the server application 72, which replies by generating a subset of the COL, an ASM.
  • the user agent downloads the necessary files for the browser 94,98,112, from one of the sites listed in the agents ASM and also caches them for sending on later to other users are redirected thereto.
  • the currently requesting site is added to the COL with the information as to which objects it has downloaded so that future requests for the objects can be redirected thereto.
  • the address of the requesting site is used to determine at least an approximate physical location so that the site can be preferentially recommended to other sites closeby, and less to sites that are far away. Furthermore, in compiling the COL, as much information as possible is obtained as to the quality of the connection at the requesting site so that preferential status can be given to permanently connected sites with wide bandwidth connections as opposed to dialup nodes with narrow bandwidth connections.
  • Fig.l one skilled in the art may see how the present embodiments are not limited to networks of the size or specific structure of the Internet, but might also be used over a corporate Intranet, or any other network, with hubs, routers, and switches.
  • the appliance on the server may store each ASM, or may generate the ASM, or equivalents on the fly, based on the COL 74.
  • the ASM's might be generated per machine, per sub-network, per ISP or any other network division.
  • the user agent may store an ASM on the client machine. It might connect each time to the server application to obtain a list of file locations. Depending on different features, any given user agent may not necessarily cache the content objects. For example, if the node is behind a firewall, it may be deemed pointless to cache the objects since requests for data downloads are likely to fail.
  • the dynamic mirroring application may reside on the content server, as in the above-described example or on a separate machine. In the latter case a single dynamic mirroring application may be applicable to numerous content servers.
  • the separate application server might keep ASM's or generate them on the fly, might keep them per machine, per sub-network, per ISP, or any other network division, just as the content sever based application may.
  • the above-described embodiments are based on the assumption that content servers are sent request for the same content.
  • content servers have responded to requests by downloading the same file, over and over.
  • content objects grow ever larger and it becomes more and more difficult for servers to handle the requests made by thousands if not millions of users.
  • the system is designed to reduce the load on content servers, and reduce the overall network traffic.
  • User 52-70 connecting to an application enabled server 10 preferably has a thin (small) agent 76 installed on their machine, as described briefly above.
  • the agent may act as a local proxy server or as a packet sniffer, or connect directly to the users web browser, or even replace the users web browser fig.3 between the user, and the content server.
  • the agent caches some or all of the objects fig.3 it downloads.
  • the user agent keeps the server application updated as to which objects it has cached. A single agent will work with all servers that are use the application.
  • the server application uses information from the user agent to build and maintain a dynamic Common Object List (COL) 74.
  • COL Common Object List
  • the server application may create an individually tailored ASM, where the ASM is a machine specific (or sub net specific or ISP specific, or any other component of a network specific) list of other agents who have objects that a current agent is requesting.
  • the agent intercepts the request. If that object belongs to an application enabled server, the agent checks its ASM fig. 3, 78, and if there is a copy of that object with another agent the agent downloads the requested object from the other user's agent.
  • the user agent asks the server application for either an updated ASM for the site, or if there is another available agent with the requested object.
  • the server application can then give the user agent a list of possible agents from the COL 74. If any of the user agents obtained from the COL 74 already have the requested object, the requesting agent preferably downloads the requested object from an agent having the object, instead of having to download the object from the content server. If no other agent has the content object requested, the agent downloads the object from the content server. When a second agent requests the same object, that second agent may be redirected to the agent already having the content object, instead of having to download it from the content server.
  • the server application may maintain lists of where given objects are currently obtainable. Either the server application can upload entire lists to agents, or the server application may pass around references to objects, a task that is much lighter than having to serve out the same, large file over and over.
  • the server application may create ASM files for user agents.
  • Those ASM files may contain those agents that are nearest (in terms of network distance) the agent the ASM file is being generated for. Being able to download files from locations close to the user may increase the download speed for the user. Downloading objects from near-by may also reduce the total network traffic by reducing the number of hops for any given content object.
  • the user agent is not limited to downloaded files from only one other agent at a time.
  • the user agent may download one content object from one agent, and another content object from a different agent. In this manner one agent can utilize its full pipe speed, even if the agents around it all have slower pipes.
  • the server application may mark each content object with a time-to-live marking. If the ASM is viewed as yet another content object, and the ASM's are generated per sub-network, instead of per machine, a machine with an ASM that is about to expire can look to other machines near it, and download a fresh ASM. In this manner, rarely will any object, including the ASM, need to be downloaded from the content server, or redirection application server, as the will only have to deploy each ASM file once per sub-net, ISP, or other network division.
  • a content redirecting server can dramatically reduce the load on content servers.
  • the server application/agent combination also reduces total network traffic. Again considering fig.l and assuming that a user machine 52 requests an object, in order for that object to be downloaded from the content server 10, the object would ordinarily have to pass pipes 32, 20, 16, and 12.
  • a nearby user machine 54 may only have to pass through two pipes, 34, and 32When the distances, and hops are greater and greater (a typically download may pass through more than 30 hops) it should be clear to one skilled in the art how reducing the number of hops content must pass through may enhance total network performance.
  • the application may reduce, if not totally eliminate the need for conventional mirror servers. In this manner, the application may reduce hardware and maintenance costs.
  • the agent may not have to talk to the content server, or server application at all.
  • the user agent may well be able to assemble amalgamated content, including web sites from the content objects cached by other agents.
  • the agent does assembles amalgamated content including web sites from other agents, even in the case of a complete server failure, any end node which has an agent that can find a recently updated ASM or has an up to date ASM may still be able to view the content site.
  • the COL preferably keeps accurate lists of what has downloaded and by whom.
  • the COL may thus be used not only to redirect agents to other agents, but also to compile accurate statistics about viewing.
  • the COL keeps track of who got what from where, and who is near whom, therefore accurate records about network usage can be compiled. These records can help pre-generate ASM's to enhance efficiency, or the records might be used for any other purpose a site owner might wish.
  • Each user thus effectively becomes a mirror, and each agent may achieve faster download speeds even than can be managed with close mirrors. Instead of only being able to download an object from one source, the user will have many nearby sources to download the objects that compose the content from, and there is no single download bottle-neck. Even if the user has to go to the server application for the ASM, the server application will only have to pass around object references, which is much easier than passing around full objects.
  • mirroring arrangement dynamically responds to user demand in that objects that are widely requested are automatically made widely available.
  • the agent may store the ASM file, and may cache content objects. For example, as mentioned above, if an agent is behind a firewall (and no other agent can see it, or download from it) then it need not cache any content objects. It may still have an active agent and retrieve objects from other agents, but would not need to store any.
  • the server side application might pre-generate individually tailored ASM's and store them for users.
  • a preferred way to do prevent the substitution of fake data is to use a hash algorithm to calculate a hash code for each content object. These hash codes are then sent to the nodes as part of the nodes individually tailored COL, an ASM. User nodes compare the hash codes of any content that they receive to the expected hash codes (from the ASM) and can then see if the content was tampered with (on purpose or by accident).
  • server application and client agents may be used with dynamically generated content (CGI scripts, ASP, JSP, JHTML, XHTML, etc.).
  • CGI scripts CGI scripts, ASP, JSP, JHTML, XHTML, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

L'invention concerne un appareil à utiliser conjointement à un fournisseur (92) de contenu de réseau, afin de fournir une écriture miroir dynamique d'objets (94-112) dudit contenu sur ledit réseau, en coopération avec des noeuds de réseau pour une interaction avec l'appareil par la capture d'objets téléchargés (94-112). L'appareil comporte une unité de listage (74) destinée à préparer, à mettre à jour de manière dynamique et à stocker un listage d'au moins un objet dudit contenu et des noeuds activés (76) envoyés à l'objet respectif. L'appareil comporte en outre un extracteur de liste (72), associé à la dite unité de listage pour recevoir des demandes téléchargées envoyées au fournisseur de contenu et pour extraire des détails d'un objet dudit listage, spécifié dans cette demande téléchargée, pour placer les détails extraits dans une réponse à envoyer à un demandeur, et pour envoyer des rapports à l'unité de listage sur demande des noeuds activés.
PCT/IL2001/000498 2000-05-30 2001-05-30 Distribution de contenu poste a poste dynamique sur un reseau WO2001093064A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU64194/01A AU6419401A (en) 2000-05-30 2001-05-30 Dynamic peer-to-peer network content-serving

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
US20733600P 2000-05-30 2000-05-30
US60/207,336 2000-05-30
US20855800P 2000-06-02 2000-06-02
US20849900P 2000-06-02 2000-06-02
US60/208,499 2000-06-02
US60/208,558 2000-06-02
US26644301P 2001-02-06 2001-02-06
US60/266,443 2001-02-06

Publications (1)

Publication Number Publication Date
WO2001093064A1 true WO2001093064A1 (fr) 2001-12-06

Family

ID=27498662

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IL2001/000498 WO2001093064A1 (fr) 2000-05-30 2001-05-30 Distribution de contenu poste a poste dynamique sur un reseau

Country Status (2)

Country Link
AU (1) AU6419401A (fr)
WO (1) WO2001093064A1 (fr)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003015377A1 (fr) * 2001-08-04 2003-02-20 Kontiki, Inc. Procede et appareil d'aide a l'acheminement reparti de contenus dans un reseau informatique
WO2003058923A2 (fr) * 2001-12-31 2003-07-17 Telefonaktiebolaget Lm Ericsson (Publ) Communications d'egal a egal dans un reseau mobile
EP1335525A2 (fr) * 2002-02-01 2003-08-13 Microsoft Corporation Méthode peer-to-peer pour sonder la qualité de service (QOS)
FR2844659A1 (fr) * 2002-09-16 2004-03-19 Trident Media Guard Tmg Procede de limitation de transfert de fichiers informatiques, dispositifs et programmes d'ordinateurs correspondants
WO2004094980A2 (fr) * 2003-04-24 2004-11-04 Koninklijke Philips Electronics N.V. Transfert de contenu de pair a pair
EP1573592A1 (fr) * 2002-11-15 2005-09-14 Bigchampagne, LLC. Controle de stockage et de transfert de fichiers sur un reseau de systemes homologues
FR2870022A1 (fr) * 2004-05-07 2005-11-11 Canon Kk Procede et dispositif de distribution de donnees numeriques notamment pour reseau pair-a-pair
US7194002B2 (en) 2002-02-01 2007-03-20 Microsoft Corporation Peer-to-peer based network performance measurement and analysis system and method for large scale networks
US7450524B2 (en) 2003-06-30 2008-11-11 Kontiki, Inc. Method and apparatus for determining network topology in a peer-to-peer network
EP1337113A3 (fr) * 2002-02-14 2009-08-05 Panasonic Corporation Système de distribution de contenu
EP2237528A1 (fr) * 2009-03-30 2010-10-06 BRITISH TELECOMMUNICATIONS public limited company Méthode de l'inventaire du contenu dans un réseau

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5611069A (en) * 1993-11-05 1997-03-11 Fujitsu Limited Disk array apparatus which predicts errors using mirror disks that can be accessed in parallel
US5790789A (en) * 1996-08-02 1998-08-04 Suarez; Larry Method and architecture for the creation, control and deployment of services within a distributed computer environment

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5611069A (en) * 1993-11-05 1997-03-11 Fujitsu Limited Disk array apparatus which predicts errors using mirror disks that can be accessed in parallel
US5790789A (en) * 1996-08-02 1998-08-04 Suarez; Larry Method and architecture for the creation, control and deployment of services within a distributed computer environment

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003015377A1 (fr) * 2001-08-04 2003-02-20 Kontiki, Inc. Procede et appareil d'aide a l'acheminement reparti de contenus dans un reseau informatique
WO2003015341A2 (fr) * 2001-08-04 2003-02-20 Kontiki, Inc. Procede et appareil facilitant un acheminement de contenu distribue securise
US7765411B2 (en) 2001-08-04 2010-07-27 Kontiki, Inc. Method and apparatus for facilitating secure distributed content delivery
WO2003015341A3 (fr) * 2001-08-04 2004-03-04 Kontiki Inc Procede et appareil facilitant un acheminement de contenu distribue securise
US7398301B2 (en) 2001-08-04 2008-07-08 Kontiki, Inc. Method and apparatus for facilitating distributed delivery of content across a computer network
US7363498B2 (en) 2001-08-04 2008-04-22 Kontiki, Inc. Method and apparatus for facilitating secure distributed content delivery
WO2003058923A2 (fr) * 2001-12-31 2003-07-17 Telefonaktiebolaget Lm Ericsson (Publ) Communications d'egal a egal dans un reseau mobile
WO2003058923A3 (fr) * 2001-12-31 2004-02-12 Ericsson Inc Communications d'egal a egal dans un reseau mobile
US7133368B2 (en) 2002-02-01 2006-11-07 Microsoft Corporation Peer-to-peer method of quality of service (QoS) probing and analysis and infrastructure employing same
EP1335525A3 (fr) * 2002-02-01 2005-07-27 Microsoft Corporation Méthode peer-to-peer pour sonder la qualité de service (QOS)
EP1335525A2 (fr) * 2002-02-01 2003-08-13 Microsoft Corporation Méthode peer-to-peer pour sonder la qualité de service (QOS)
US7698460B2 (en) 2002-02-01 2010-04-13 Microsoft Corporation Peer-to-peer method of quality of service (QoS) probing and analysis and infrastructure employing same
US7194002B2 (en) 2002-02-01 2007-03-20 Microsoft Corporation Peer-to-peer based network performance measurement and analysis system and method for large scale networks
EP1876758A2 (fr) * 2002-02-01 2008-01-09 Microsoft Corporation Procédé de sondage et d'analyse de la qualité de service (QoS) poste à poste et infrastructure l'utilisant
EP1876758A3 (fr) * 2002-02-01 2008-02-06 Microsoft Corporation Procédé de sondage de la qualité de service (QoS) poste à poste
EP1337113A3 (fr) * 2002-02-14 2009-08-05 Panasonic Corporation Système de distribution de contenu
FR2844659A1 (fr) * 2002-09-16 2004-03-19 Trident Media Guard Tmg Procede de limitation de transfert de fichiers informatiques, dispositifs et programmes d'ordinateurs correspondants
EP1573592A4 (fr) * 2002-11-15 2008-06-11 Bigchampagne Llc Controle de stockage et de transfert de fichiers sur un reseau de systemes homologues
EP1573592A1 (fr) * 2002-11-15 2005-09-14 Bigchampagne, LLC. Controle de stockage et de transfert de fichiers sur un reseau de systemes homologues
WO2004094980A2 (fr) * 2003-04-24 2004-11-04 Koninklijke Philips Electronics N.V. Transfert de contenu de pair a pair
WO2004094980A3 (fr) * 2003-04-24 2004-11-25 Koninkl Philips Electronics Nv Transfert de contenu de pair a pair
US7574515B2 (en) 2003-04-24 2009-08-11 Koninklijke Philips Electronics N.V. Peer to peer transfer of content
US7450524B2 (en) 2003-06-30 2008-11-11 Kontiki, Inc. Method and apparatus for determining network topology in a peer-to-peer network
FR2870022A1 (fr) * 2004-05-07 2005-11-11 Canon Kk Procede et dispositif de distribution de donnees numeriques notamment pour reseau pair-a-pair
US8463936B2 (en) 2004-05-07 2013-06-11 Canon Kabushiki Kaisha Method and device for distributing digital data in particular for a peer-to-peer network
EP2237528A1 (fr) * 2009-03-30 2010-10-06 BRITISH TELECOMMUNICATIONS public limited company Méthode de l'inventaire du contenu dans un réseau
WO2010112846A1 (fr) * 2009-03-30 2010-10-07 British Telecommunications Public Limited Company Procede pour lister un contenu dans un reseau

Also Published As

Publication number Publication date
AU6419401A (en) 2001-12-11

Similar Documents

Publication Publication Date Title
US10785347B1 (en) System providing faster and more efficient data communication
EP1493094B1 (fr) Procede et systeme de distribution hierarchisee dans un reseau de diffusion de contenu
US8806008B2 (en) HTML delivery from edge-of-network servers in a content delivery network (CDN)
US8463936B2 (en) Method and device for distributing digital data in particular for a peer-to-peer network
US7254636B1 (en) Method and apparatus for transparent distributed network-attached storage with web cache communication protocol/anycast and file handle redundancy
US6415323B1 (en) Proximity-based redirection system for robust and scalable service-node location in an internetwork
EP1570365B1 (fr) Accelerateur de transactions pour systemes de communication client-serveur
US6205481B1 (en) Protocol for distributing fresh content among networked cache servers
US8914429B2 (en) Method for creating global distributed namespace
NZ501380A (en) A method and system for distributed caching, prefetching and replication
CA2430416A1 (fr) Procede et systeme permettant de deceler la proximite d'un client au moyen de plusieurs reacheminements http
JP2008544690A (ja) 経路情報を使用するマルチキャスト・ダウンロード
WO2001093064A1 (fr) Distribution de contenu poste a poste dynamique sur un reseau
Alimi et al. A survey of in-network storage systems
Chandhok Web distribution systems: Caching and replication
Oh-ishi et al. The deployment of cache servers in p2p networks for improved performance in content-delivery
Sheng et al. Secure and reliable decentralized peer-to-peer web cache
Alfa et al. A hybrid web caching design model for internet-content delivery
Yang Internet Engineering Task Force (IETF) R. Alimi, Ed. Request for Comments: 6392 Google Category: Informational A. Rahman, Ed.
Guo et al. Peer-to-Peer Assisted Streaming Proxy
Klimek P2P proxy/cache A hybrid P2P/CDN networking approach eliminating the problems of P2P through caching/relaying trackerless BitTorrent traffic

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: COMMUNICATION UNDER RULE 69 EPC (EPO FORM 1205A OF 16.05.2003)

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP