[go: up one dir, main page]

WO2008017502A1 - Content distribution network - Google Patents

Content distribution network Download PDF

Info

Publication number
WO2008017502A1
WO2008017502A1 PCT/EP2007/007104 EP2007007104W WO2008017502A1 WO 2008017502 A1 WO2008017502 A1 WO 2008017502A1 EP 2007007104 W EP2007007104 W EP 2007007104W WO 2008017502 A1 WO2008017502 A1 WO 2008017502A1
Authority
WO
WIPO (PCT)
Prior art keywords
digital object
peers
peer
network
distribution
Prior art date
Application number
PCT/EP2007/007104
Other languages
French (fr)
Inventor
Adam Twiss
David Ferguson
Original Assignee
Velocix Limited
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
Priority claimed from GB0616049A external-priority patent/GB2440762B/en
Application filed by Velocix Limited filed Critical Velocix Limited
Publication of WO2008017502A1 publication Critical patent/WO2008017502A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1061Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1072Discovery involving ranked list compilation of candidate peers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1087Peer-to-peer [P2P] networks using cross-functional networking aspects
    • H04L67/1093Some peer nodes performing special functions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • H04L67/568Storing data temporarily at an intermediate stage, e.g. caching

Definitions

  • the present invention relates to the field of peer-to-peer networks. More specifically, the present invention relates to a system for content delivery from a publisher's computer network to the peer-to-peer network.
  • Caches for the intermediate storage of data transferred about the Internet are known in the art.
  • the most common type of cache used in the Internet is a proxy cache.
  • the proxy cache operates at the application level, passing some messages unaltered between a client and a server, changing other ones of the messages and sometimes responding to the messages itself rather than relaying the messages.
  • a web proxy cache sits between web servers and one or more clients and watches requests for HTML pages, music or audio files, video files, image files and data files (collectively known as digital objects) pass through.
  • the web proxy cache saves a copy of the HTML pages, images and files for itself. Subsequently if there is another request for the same object, the web proxy cache will use the copy that was saved instead of asking an origin server to resend the request.
  • web proxy caches are used: i) In order to reduce latency - in this case, the request is satisfied from the proxy cache (which is closer to the client) instead of the origin server. It therefore takes less time for the client to get the object and display the object. This makes web sites seem more responsive to the client, ii) To reduce traffic - Each object is only retrieved once from the server once, the proxy cache reduces the amount of bandwidth used by an Internet Service Provider to the outside world and by the client. This saves money if the client is paying for the traffic and keeps the client's bandwidth requirements lower and more manageable. iii) To increase delivery speed.
  • the proxy caches may be provided by an Internet Service Provider at an access point and can continually store digital objects accessed by the ISP customers.
  • a peer-to-peer (also termed P2P) computer network is a network that relies primarily on the computing power and bandwidth of the participants in the computer network rather than concentrating computing power and bandwidth in a relatively low number of servers.
  • P2P computer networks are typically used for connecting nodes of the computer network via largely ad hoc connections.
  • the P2P computer network is useful for many purposes. Sharing content files containing, for example, audio, video and data is very common. Real time data, such as telephony traffic, is also passed using the P2P network.
  • a peer-to-peer computer network is disclosed in the international patent application No. WO 02/058360 (assigned to XDEGREES, Mountain View, California, United States).
  • This Xdegrees patent application discloses a peer devices register with a resource locator service so that a peer device can be uniquely identified in the P2P peer computer network.
  • the patent application further teaches an addressing scheme which addresses a peer resource in the networking environment based on a the unique identifier of the peer device that is a master publisher of a digital object - termed a the resource in the Xdegree patent application.
  • the resource locator can service a request for the resources by providing a list of locations where the resource is expected to be available or provide access to the resource itself.
  • a pure P2P network does not have the notion of clients or servers, but only equal peer nodes that simultaneously function as both "clients” and “servers” to the other nodes on the network.
  • This model of network arrangement differs from the client-server model in which communication is usually to and from a central server.
  • a typical example for a non P2P file transfer is an FTP server where the client and server programs are quite distinct. In the FTP server clients initiate the download/uploads and the servers react to and satisfy these requests from the clients.
  • Some networks and channels such as Napster, OpenNAP, or IRC @find, use a client-server structure for some tasks (e.g., searching) and a P2P structure for other tasks.
  • Networks such as Gnutella or Freenet use the P2P structure for all purposes, and are sometimes referred to as true P2P networks, although Gnutella is greatly facilitated by directory servers that inform peers of the network addresses of other peers.
  • BitTorrent One of the most popular file distribution programmes used in P2P networks is currently BitTorrent which was created by Bram Cohen. BitTorrent is designed to distribute large amounts of data widely without incurring the corresponding consumption in costly server and bandwidth resources.
  • BitTorrent files contain an "announce” section, which specifies the URL of a tracker, and an "info” section which contains (suggested) names for the files, their lengths, the piece length used, and a SHA-I hash code for each piece, which clients should use to verify the integrity of the data they receive.
  • the tracker is a server that keeps track of which seeds (i.e. a node with the complete file or group of files) and peers (i.e. nodes that do not yet have the complete file or group of files) are in a swarm (the expression for all of the seeds and peers involved in the distribution of a single file or group of files).
  • Nodes report information to the tracker periodically and from time-to-time request and receive information about other nodes to which they can connect.
  • the tracker is not directly involved in the data transfer and is not required to have a copy of the file.
  • Nodes that have finished downloading the file may also choose to act as seeds, i.e. the node provides a complete copy of the file.
  • BitTorrent trackers maintain lists of the nodes currently participating in each torrent.
  • the computer with the initial copy of the file is referred to as the initial seeder.
  • BitTorrent client Using a web browser, users navigate to a site listing the torrent, download the torrent, and open the torrent in a BitTorrent client stored on their local machines. After opening the torrent, the BitTorrent client connects to the tracker, which provides the BitTorrent client with a list of clients currently downloading the file or files. Initially, there may be no other peers in the swarm, in which case the client connects directly to the initial seeder and begins to request pieces.
  • the BitTorrent protocol breaks down files into a number of much smaller pieces, typically a quarter of a megabyte (256 KB) in size. Larger file sizes typically have larger pieces. For example, a 4.37 GB file may have a piece size of 4 MB (4096 KB). The pieces are checked as they are received by the BitTorrent client using a hash algorithm to ensure that they are error free.
  • peers may download pieces in a random order and may prefer to download the pieces that are rarest amongst it peers, to increase the opportunity to exchange data. Exchange of data is only possible if two peers have a different subset of the file. It is known, for example, in the BitTorrent protocol that a peer initially joining the swarm will send to other members of the swarm a BitField message which indicates an initial set of pieces of the digital object which the peer has available for download by other ones of the peers. On receipt of further ones of the pieces, the peer will send a Have message to the other peers to indicate that the further ones of the pieces are available for download.
  • One of the challenges in distributing digital objects about the content distribution network implemented as a peer-to-peer network is to ensure that the digital object is distributed accurately and completely in a timely manner and employing the resources (bandwidth etc) in the optimal manner.
  • the international patent application No. WO 02/089000 (Iinet Limited, Perth, Western Australia) teaches a system which employs caches for caching data during a P2P data transfer between computers in a network of computers.
  • the system taught in the Iinet patent application includes a database for dynamically storing information regarding the availability of data for transfer, a proxy server and a cache manager.
  • the database, the proxy server and the cache manager combine to transfer data selected from the available data to a user in response to a request for the selected data from the user.
  • the use of the caches accelerates the transfer of data.
  • the Iinet patent application merely teaches the provisions of caches at an internet service provider.
  • the teachings of this patent application do not include its use in a content distribution network. There is therefore a need to provide a content distribution network for distributing the digital object in a timely manner.
  • the peer-to-peer network has a plurality of peers with a peer location identifier and a download client for downloading the digital object.
  • a plurality of distributed caches is provided in the peer-to- peer network and at least some of the plurality of peers are connected to at least some of the plurality of distributed caches.
  • the term distributed cache means that the caches are at different locations.
  • a private tracker manages the distribution of the digital object among the plurality of distributed caches and a public tracker for manages the distribution of the digital object between the plurality of peers. _ . . _
  • a content server also connected to the private tracker and to at least one of the plurality of distributed caches is provided.
  • the content server contains a complete copy of the digital object to be distributed.
  • the digital object may be supplied to the content server by a publisher.
  • the peer-to-peer network may have more than one content server which allows the balancing of loads on the network.
  • a method for the distribution of a digital object over a network to at least one of a plurality of peers is also provided.
  • the method comprises
  • the content supplier in this context is either a content server or one of the distributed caches to which the digital object has been already supplied.
  • One advantage of this method is that the announcement of the availability of the digital object is completed prior to the transfer of all of the pieces of the digital object to the content server which substantially speeds up supply of the digital object to the peer-to-peer network.
  • Fig. 1 shows a Peer-to Peer network as known in the art.
  • Fig. 2 shows the request for a download of a digital object.
  • Fig. 3 shows an overview of the network in accordance with the invention.
  • Fig. 4 shows an overview for the distribution of content.
  • Fig. 5 shows a geographical implementation of a content distribution network
  • Fig. 6 shows an overview of a service point of presence.
  • Fig. 7 shows an overview of a data point of presence.
  • FIG. 1 is a block diagram illustrating an environment in which various embodiments of the invention may be practiced.
  • FIG. 1 includes a Peer-to-Peer (P2P) network 100.
  • the P2P network 100 includes a plurality of peers, such as peer 102a, 102b, 102c, 102d, 102e and 102f, hereinafter referred to as peers 102, connected to each other.
  • P2P network 100 may be a Local Area Network (LAN), a Wide Area Network (WAN), a Metropolitan Area Network (MAN), a wireless network and the like.
  • the peers 102 present in the P2P network 100 include stored digital data.
  • the digital data include, but are not limited to, an application file, a video file, a music file and the like.
  • the digital data is shared among the peers 102. It should be understood that the peers 102 may store multiple copies of the digital data.
  • FIG. 2 is a block diagram illustrating a user 202 sending a request for download of a digital object through peer 102a, in accordance with an embodiment of the invention.
  • FIG. 2 includes the peer 102a, a download client 103a running on the peer 102a, the user 202, a server 204 and a tracker server 206.
  • the server 204 includes one or more torrent files, such as torrent file 208a, 208b and 208c, hereinafter referred to as the torrent files 208.
  • the present invention has been described with respect to BitTorrent protocol as an exemplary embodiment. It should be understood by those skilled in the art that present invention is applicable to all P2P protocols.
  • the user 202 makes a request at the peer 102a to download the digital object.
  • the peer 102a communicates with the server 204 and provides information for the digital object to be downloaded to the server 204.
  • the server 204 locates one of the torrent files related to the digital object requested for download by peer 102a, such as, for example, torrent file 208a.
  • torrent files 208 includes information related to the name, size, number of pieces and check sum error for the digital object to be downloaded by peer 102a.
  • the tracker server 206 provides a list of peers 102 present in the P2P network 100 with the pieces of the digital object to be downloaded.
  • the peer 102a thereafter, communicates with the available list of peers 102 for downloading the related digital objects.
  • the peer 102a communicates with peers 102 by sending a bit field of the pieces of the digital object that peer 102a has. After peer 102a receives all the bitfields from peers 102, it sends a message to the peers 102 where it finds relevant data and starts downloading the pieces of the requested digital object.
  • FIG. 3 is a block diagram illustrating peer 102a in communication with a Cache Location Server (CLS) 302, in accordance with an embodiment of the present invention.
  • FIG. 3 includes the peer 102a, the CLS 302, a database 304, an Internet Service Provider Domain Name Server (ISP DNS) 306, a central Domain Name Server (central DNS) 308, a cache DNS 310 and one or more caches, such as, cache 312a, 312b and 312c, hereinafter referred to as caches 312.
  • the peer 102a communicates with the CLS 302.
  • the information sent by the peer 102a to the CLS 302 may also contain the IP address of the peer 102a.
  • the CLS 302 communicates a location string to the peer 102a.
  • the CLS 302 may get the location string from the database 304.
  • the database 304 stores information about the IP address ranges of countries, ISPs, regions, towns, etc for the purpose of generating specific location strings with respect to peers 102.
  • the peer 102a then, using the location string and information from the Torrent File 208, makes communication with the ISP DNS 306.
  • the information sent by peer 102a to ISP DNS 306 may be as following:
  • An example of the information sent by CLS 302 to peer 102a may be as following:
  • bt-1234.bt-bigcorp-bigispnyc.find-cache.com where, 'bt' represents the BitTorrent protocol used by the peer 102a, '1234' representing a specific hash value associated with the digital object to be downloaded by the peer 102a, 'bigcorp' representing the publisher (a fictional "Big Corporation") of the digital object to be downloaded, 'bigispnyc' representing the location string for the peer 102a (the New York point of presence for a fictional "Big ISP").
  • the ISP DNS 306 redirects the request to the central DNS 308 (which is the name server for the domain contained in the communication). Thereafter, the central DNS 308 provides an address of the cache DNS 310 to the ISP DNS 306.
  • the cache DNS 310 receives a DNS request from the ISP DNS 306 for the digital object to be downloaded. Subsequently, the cache DNS 310 allocates one of the caches 312, such as, for example, cache 312a. In various embodiments of the present invention, the cache DNS 310 may allocate one of the caches 312 based on the load, availability and content on each of them.
  • the cache DNS 310 communicates this information to the ISP DNS 306, which in turn communicates the information to the peer 102a.
  • the peer 102a thereafter, makes a communication with the cache 312a for downloading the digital object.
  • the communication between the peer 102a and cache 312a is explained in detail in FIG. 4.
  • FIG. 4 is a block diagram illustrating a system 400 for content distribution in the P2P network 100.
  • the system 400 includes the peer 102a, 102b and 102c, the cache 312a and 312b, a content server 402, a private tracker 404, a public tracker 406, a business logic unit 408, a central database server 410 and a user interface unit 412.
  • the peer 102a sends a request to the cache 312a for downloading the digital object.
  • the cache 312a is connected to the content server 402 and the private tracker 404.
  • the content server 402 includes complete copies of a plurality of stored digital objects in the P2P network 100.
  • the content server 402 is connected to a publisher's computer network 403 through an application programming interface (API) 401.
  • API application programming interface
  • the content server 402 receives the digital objects, which are to be distributed, from the publisher's computer network 403 through the API 401.
  • the publisher wishing to distribute a video file in the P2P network 100 would first upload from the publisher's computer network 403 the video file to the content server 402 through the application programming interface 401. Thereafter, the video file can be subsequently downloaded by the peers 102 from the content server 402.
  • the digital data becomes available for the peers 102 to be downloaded.
  • the peers 102 are able to download those uploaded pieces in parallel. Therefore, the capability of the system 400 to execute parallel uploads and downloads of the digital object from the content server 402 ensures an efficient real time availability of digital objects in the P2P network 100.
  • the cache 312a downloads the digital objects, based on the request from the peer 102a, from the content server 402. 402 or from cache 312b.
  • the private tracker 404 knows which of the digital objects are available on which of the caches 312 and content servers 402 and provides this information to the cache 312a. If the digital object requested by the peer 102a is available on the cache 312a, the peer 102a downloads the digital object from the cache 312a. If the digital object is not available on the cache 312a, the cache 312a downloads the requested digital object from the content server 402 and/or the cache 312b. Thereafter, the cache 312a makes the digital object available to the peer 102a for downloading.
  • the peer 102a may also download the related digital objects from the other peers 102 available in the P2P network 100, such as, for example, peer 102b and peer 102c. 5
  • the download from the cache 312a and from the pears 102b and 102c can take place substantially simultaneously.
  • the cache 312a may upload digital objects from the peers 102 available in the P2P network 100. In such a case, the cache 312a acts as 10 one of the peers 102.
  • the private tracker 404 maintains a track of all the data available on the content server 402 and the caches 312.
  • the public tracker 406 is connected to all of the caches 312 and to all of the peers 102 in the P2P network 100.
  • the public tracker 406 maintains a 15 track of all the data digital objects transferred among the caches 312 and the peers 102.
  • the public tracker 406 maintains a list of all of the peers 102 and the caches 312 which hold copies of the digital objects available in the P2P network 100.
  • the business logic unit 408 is connected to all the caches 312 and the private tracker 404.
  • the 20. business logic unit 408 authenticates peers 102 before allowing the peers 102 to upload any - digital object. Further, the business logic unit 408 is connected to the central database server 410.
  • the business logic unit 408 acts as an interface between the P2P network 100 and the central database server 410.
  • Central database server 410 acquires log reports from the private tracker 404 and caches 312, through the business logic unit 408, for all the data transferred to 25 and from the caches 312 and the content server 402. Using the information from the central database server 410 obtained via the business logic unit 408, such as, the log reports, the user interface unit 412 provides the required information billing purposes and for report generation.
  • FIG. 5 is a block diagram illustrating an exemplary geographical implementation of a cache distribution network 500, in accordance with various embodiments of the present invention.
  • the cache distribution network 500 includes one or more service points of presence, such as, a service point of presence 502a and 502b, hereinafter referred to as the service points of presence (POPs) 502.
  • the cache distribution network 500 further includes one or more data points of presence, such as, data point of presence 504a, 504b, 504c and 504d, hereinafter referred to as data points of presence (POPs) 504.
  • the service POPs 502 are located at remote geographical locations for, such as, for example London, San Jose and so forth. It should be understood by those skilled in art that the number of the service POPs 502 locations are scalable and may be increased with the increase in network traffic.
  • the service POPs 502, such as the service POP 502a and 502b, are connected to each other. The connection between the service POPs 502 enables a real time data and information transfer between all of the service POPs 502,
  • the data POPs 504 are also located in remote geographical locations across the globe, such as, for example, New York, Frankfurt and so forth. It should be understood by those skilled in art that the number of the data POPs 504 locations are scalable and may be increased with the increase in network traffic and digital objects available in the P2P network 100.
  • the data POPs 504, such as the data POP 504a and 504b, are connected with all the available service POPs 502 in the P2P network 100. The connection between the data POPs 504 and service POPs 502 enables a real time data update and information transfer between the data POPs 504 from the service POPs 502,
  • a geographical location may include both, the service POP 502a and the data POP 504a.
  • FIG. 6 is a block diagram illustrating an arrangement 600 of the components of the service POP 502a, in accordance with an embodiment of the present invention.
  • the arrangement 600 for the service POP 502a includes the cache location server 302, the central domain name server 308, the content server 402, the private tracker 404, the business logic unit 408 and the central database server 410. Further, in an embodiment of the present invention, the arrangement 600 for the service POP 502a includes the caches 312, such as, the cache 312a and 312b. Furthermore, in an embodiment of the present invention, the arrangement 600 for the service POP 502a includes the public tracker 406, the business logic unit 408 and the user interface unit 412.
  • the central database server 410 is located in each of the service POPs 502. The central database server 410 of each of the service POPs 502 are connected to each other and act as a central database unit.
  • the components illustrated in the arrangement 600 for the service POP 502a are scalable and may be increased based on the network traffic and the digital objects available in the P2P network 100.
  • FIG. 7 is a block diagram illustrating an arrangement 700 of the components of the data POP 504a, in accordance with an embodiment of the present invention.
  • the arrangement 700 for the data POP 504a includes the caches 312, such as, the cache 312a, 312b, 312c and 312d and the cache DNS 310. Only a single cache DNS 310 is shown in FIG 7 for simplicity. However, the data POP 504a may contain more than one of the single caches DNS 310 .
  • the data POP 504a provides digital objects for the peers 102 in the P2P network 100.
  • the data POPs 504 download data from the service POPs 502.
  • the components illustrated in the arrangement 700 for the data POP 504a are scalable and may be increased based on the network traffic and the digital objects available in the P2R network 100.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The invention relates to a content distribution network for the distribution of a digital object in a peer-to-peer network with a plurality of peers having a peer location identifier and a download client (103a) for downloading the digital object. A plurality of distributed caches (312a, 312b) is present in the peer-to-peer network. At least some of the plurality of peers (102a, 102b, 102c) are connected to at least some of the plurality of distributed caches (312). A publisher's computer network (403) is connected to at least one of the plurality of distributed caches (312) for distributing the digital object to at least one of the plurality of distributed caches (312). A private tracker for managing the distribution of the digital object among the plurality of distributed caches (312a, 312b) and a public tracker for managing the distribution of the digital object between the plurality of peers (102a, 102b, 102c) are present. The invention also includes a method for the distribution of a digital object over a peer-to- peer network to at least one of a plurality of peers (102). The method comprises a first step of placing at least a first piece of the digital object on a content supplier (402,- 312), a second step of transferring at least the first piece of the digital object to a least one of a plurality of distributed caches (312), a third. step of announcing the availability of the digital object to at least one of the plurality of peers (102) and a fourth step of downloading at least the first piece of the digital object to the at least one of the plurality of peers (102).

Description

Figure imgf000002_0001
FIELD OF THE INVENTION
The present invention relates to the field of peer-to-peer networks. More specifically, the present invention relates to a system for content delivery from a publisher's computer network to the peer-to-peer network.
BACKGROUND TO THE INVENTION
Caches for the intermediate storage of data transferred about the Internet are known in the art. The most common type of cache used in the Internet is a proxy cache. The proxy cache operates at the application level, passing some messages unaltered between a client and a server, changing other ones of the messages and sometimes responding to the messages itself rather than relaying the messages. A web proxy cache sits between web servers and one or more clients and watches requests for HTML pages, music or audio files, video files, image files and data files (collectively known as digital objects) pass through. The web proxy cache saves a copy of the HTML pages, images and files for itself. Subsequently if there is another request for the same object, the web proxy cache will use the copy that was saved instead of asking an origin server to resend the request.
There are three main reasons why web proxy caches are used: i) In order to reduce latency - in this case, the request is satisfied from the proxy cache (which is closer to the client) instead of the origin server. It therefore takes less time for the client to get the object and display the object. This makes web sites seem more responsive to the client, ii) To reduce traffic - Each object is only retrieved once from the server once, the proxy cache reduces the amount of bandwidth used by an Internet Service Provider to the outside world and by the client. This saves money if the client is paying for the traffic and keeps the client's bandwidth requirements lower and more manageable. iii) To increase delivery speed. The proxy caches may be provided by an Internet Service Provider at an access point and can continually store digital objects accessed by the ISP customers. For example, CacheLogic, Cambridge, UK, provide solutions which can be used by ISPs and other to reduce their traffic. These solutions are documented briefly in the document "the Impact of P2P and the CacheLogic P2P Management Solution" (available 1 August 2006 at http://www.cachelogic.com/products/resource/Intro_CacheLogic_P2P_Mgmt_Solution_v3.0. pdf)
A peer-to-peer (also termed P2P) computer network is a network that relies primarily on the computing power and bandwidth of the participants in the computer network rather than concentrating computing power and bandwidth in a relatively low number of servers. P2P computer networks are typically used for connecting nodes of the computer network via largely ad hoc connections. The P2P computer network is useful for many purposes. Sharing content files containing, for example, audio, video and data is very common. Real time data, such as telephony traffic, is also passed using the P2P network.
A peer-to-peer computer network is disclosed in the international patent application No. WO 02/058360 (assigned to XDEGREES, Mountain View, California, United States). This Xdegrees patent application discloses a peer devices register with a resource locator service so that a peer device can be uniquely identified in the P2P peer computer network. The patent application further teaches an addressing scheme which addresses a peer resource in the networking environment based on a the unique identifier of the peer device that is a master publisher of a digital object - termed a the resource in the Xdegree patent application. The resource locator can service a request for the resources by providing a list of locations where the resource is expected to be available or provide access to the resource itself.
A pure P2P network does not have the notion of clients or servers, but only equal peer nodes that simultaneously function as both "clients" and "servers" to the other nodes on the network. This model of network arrangement differs from the client-server model in which communication is usually to and from a central server. A typical example for a non P2P file transfer is an FTP server where the client and server programs are quite distinct. In the FTP server clients initiate the download/uploads and the servers react to and satisfy these requests from the clients. Some networks and channels, such as Napster, OpenNAP, or IRC @find, use a client-server structure for some tasks (e.g., searching) and a P2P structure for other tasks. Networks such as Gnutella or Freenet use the P2P structure for all purposes, and are sometimes referred to as true P2P networks, although Gnutella is greatly facilitated by directory servers that inform peers of the network addresses of other peers.
One of the most popular file distribution programmes used in P2P networks is currently BitTorrent which was created by Bram Cohen. BitTorrent is designed to distribute large amounts of data widely without incurring the corresponding consumption in costly server and bandwidth resources. To share a file or group of files through BitTorrent, clients first create a "torrent file". This is a small file which contains meta-information about the files to be shared and about the host computer (the "tracker") that coordinates the file distribution. Torrent files contain an "announce" section, which specifies the URL of a tracker, and an "info" section which contains (suggested) names for the files, their lengths, the piece length used, and a SHA-I hash code for each piece, which clients should use to verify the integrity of the data they receive.
The tracker is a server that keeps track of which seeds (i.e. a node with the complete file or group of files) and peers (i.e. nodes that do not yet have the complete file or group of files) are in a swarm (the expression for all of the seeds and peers involved in the distribution of a single file or group of files). Nodes report information to the tracker periodically and from time-to-time request and receive information about other nodes to which they can connect. The tracker is not directly involved in the data transfer and is not required to have a copy of the file. Nodes that have finished downloading the file may also choose to act as seeds, i.e. the node provides a complete copy of the file. After the torrent file is created, a link to the torrent file is placed on a website or elsewhere, and it is normally registered with the tracker. BitTorrent trackers maintain lists of the nodes currently participating in each torrent. The computer with the initial copy of the file is referred to as the initial seeder.
Using a web browser, users navigate to a site listing the torrent, download the torrent, and open the torrent in a BitTorrent client stored on their local machines. After opening the torrent, the BitTorrent client connects to the tracker, which provides the BitTorrent client with a list of clients currently downloading the file or files. Initially, there may be no other peers in the swarm, in which case the client connects directly to the initial seeder and begins to request pieces. The BitTorrent protocol breaks down files into a number of much smaller pieces, typically a quarter of a megabyte (256 KB) in size. Larger file sizes typically have larger pieces. For example, a 4.37 GB file may have a piece size of 4 MB (4096 KB). The pieces are checked as they are received by the BitTorrent client using a hash algorithm to ensure that they are error free.
As further peers enter the swarm, all of the peers begin sharing pieces with one another, instead of downloading directly from the initial seeder. Clients incorporate mechanisms to optimize their download and upload rates. Peers may download pieces in a random order and may prefer to download the pieces that are rarest amongst it peers, to increase the opportunity to exchange data. Exchange of data is only possible if two peers have a different subset of the file. It is known, for example, in the BitTorrent protocol that a peer initially joining the swarm will send to other members of the swarm a BitField message which indicates an initial set of pieces of the digital object which the peer has available for download by other ones of the peers. On receipt of further ones of the pieces, the peer will send a Have message to the other peers to indicate that the further ones of the pieces are available for download.
One of the challenges in distributing digital objects about the content distribution network implemented as a peer-to-peer network is to ensure that the digital object is distributed accurately and completely in a timely manner and employing the resources (bandwidth etc) in the optimal manner.
The international patent application No. WO 02/089000 (Iinet Limited, Perth, Western Australia) teaches a system which employs caches for caching data during a P2P data transfer between computers in a network of computers. The system taught in the Iinet patent application includes a database for dynamically storing information regarding the availability of data for transfer, a proxy server and a cache manager. The database, the proxy server and the cache manager combine to transfer data selected from the available data to a user in response to a request for the selected data from the user. The use of the caches accelerates the transfer of data. However, the Iinet patent application merely teaches the provisions of caches at an internet service provider. Furthermore, the teachings of this patent application do not include its use in a content distribution network. There is therefore a need to provide a content distribution network for distributing the digital object in a timely manner.
There is furthermore a need to provide a content distribution network for distributing the digital object cost effectively.
There is furthermore a need to provide a content distribution network to cope with large number of downloads in a short period of time.
SUMMARY OF THE INVENTION
These and other objects of the invention are solved by providing a content distribution network for the distribution of a digital object in a peer-to-peer network. The peer-to-peer network has a plurality of peers with a peer location identifier and a download client for downloading the digital object. A plurality of distributed caches is provided in the peer-to- peer network and at least some of the plurality of peers are connected to at least some of the plurality of distributed caches. The term distributed cache means that the caches are at different locations. A private tracker manages the distribution of the digital object among the plurality of distributed caches and a public tracker for manages the distribution of the digital object between the plurality of peers. _ . . _
This allows the efficient distribution of the content through the distributed caches and the peers.
In a preferred embodiment of the invention, a content server also connected to the private tracker and to at least one of the plurality of distributed caches is provided. The content server contains a complete copy of the digital object to be distributed. The digital object may be supplied to the content server by a publisher. The peer-to-peer network may have more than one content server which allows the balancing of loads on the network.
' A method for the distribution of a digital object over a network to at least one of a plurality of peers is also provided. The method comprises
- a first step of placing at least a first piece of the digital object on a content supplier;
- a second step of transferring at least the first piece of the digital object to a least one of a plurality of distributed caches;
- a third step of announcing the availability of the digital object to at least one of the plurality of peers;
- a fourth step of downloading at least the first piece of the digital object to the at least one of the plurality of peers.
The content supplier in this context is either a content server or one of the distributed caches to which the digital object has been already supplied.
One advantage of this method is that the announcement of the availability of the digital object is completed prior to the transfer of all of the pieces of the digital object to the content server which substantially speeds up supply of the digital object to the peer-to-peer network.
DESCRIPTION OF THE DRAWINGS
Fig. 1 shows a Peer-to Peer network as known in the art.
Fig. 2 shows the request for a download of a digital object.
Fig. 3 shows an overview of the network in accordance with the invention.
Fig. 4 shows an overview for the distribution of content. Fig. 5 shows a geographical implementation of a content distribution network
Fig. 6 shows an overview of a service point of presence.
Fig. 7 shows an overview of a data point of presence.
DETAILED DESCRIPTION OF THE INVENTION
FIG. 1 is a block diagram illustrating an environment in which various embodiments of the invention may be practiced. FIG. 1 includes a Peer-to-Peer (P2P) network 100. The P2P network 100 includes a plurality of peers, such as peer 102a, 102b, 102c, 102d, 102e and 102f, hereinafter referred to as peers 102, connected to each other. P2P network 100 may be a Local Area Network (LAN), a Wide Area Network (WAN), a Metropolitan Area Network (MAN), a wireless network and the like. The peers 102 present in the P2P network 100 include stored digital data. Various examples of the digital data include, but are not limited to, an application file, a video file, a music file and the like. In P2P network 100 the digital data is shared among the peers 102. It should be understood that the peers 102 may store multiple copies of the digital data.
FIG. 2 is a block diagram illustrating a user 202 sending a request for download of a digital object through peer 102a, in accordance with an embodiment of the invention. FIG. 2 includes the peer 102a, a download client 103a running on the peer 102a, the user 202, a server 204 and a tracker server 206. In an embodiment of the present invention, the server 204 includes one or more torrent files, such as torrent file 208a, 208b and 208c, hereinafter referred to as the torrent files 208. The present invention has been described with respect to BitTorrent protocol as an exemplary embodiment. It should be understood by those skilled in the art that present invention is applicable to all P2P protocols.
The user 202 makes a request at the peer 102a to download the digital object. The peer 102a communicates with the server 204 and provides information for the digital object to be downloaded to the server 204. Subsequently, the server 204 locates one of the torrent files related to the digital object requested for download by peer 102a, such as, for example, torrent file 208a. In various embodiments of the invention torrent files 208 includes information related to the name, size, number of pieces and check sum error for the digital object to be downloaded by peer 102a.
Subsequently, in various embodiments of the present invention, the tracker server 206 provides a list of peers 102 present in the P2P network 100 with the pieces of the digital object to be downloaded. The peer 102a, thereafter, communicates with the available list of peers 102 for downloading the related digital objects. The peer 102a communicates with peers 102 by sending a bit field of the pieces of the digital object that peer 102a has. After peer 102a receives all the bitfields from peers 102, it sends a message to the peers 102 where it finds relevant data and starts downloading the pieces of the requested digital object.
FIG. 3 is a block diagram illustrating peer 102a in communication with a Cache Location Server (CLS) 302, in accordance with an embodiment of the present invention. FIG. 3 includes the peer 102a, the CLS 302, a database 304, an Internet Service Provider Domain Name Server (ISP DNS) 306, a central Domain Name Server (central DNS) 308, a cache DNS 310 and one or more caches, such as, cache 312a, 312b and 312c, hereinafter referred to as caches 312. The peer 102a communicates with the CLS 302. In an embodiment of the present invention, the information sent by the peer 102a to the CLS 302 may also contain the IP address of the peer 102a. Based on the received information, the CLS 302 communicates a location string to the peer 102a. In an embodiment of the present invention, the CLS 302 may get the location string from the database 304. The database 304 stores information about the IP address ranges of countries, ISPs, regions, towns, etc for the purpose of generating specific location strings with respect to peers 102.
The peer 102a then, using the location string and information from the Torrent File 208, makes communication with the ISP DNS 306.
In various embodiments of the present invention, the information sent by peer 102a to ISP DNS 306 may be as following:
Protocol-TruncatedHash.Protocol-Publisher-LocationString.Find-Cache.com
An example of the information sent by CLS 302 to peer 102a may be as following:
bt-1234.bt-bigcorp-bigispnyc.find-cache.com where, 'bt' represents the BitTorrent protocol used by the peer 102a, '1234' representing a specific hash value associated with the digital object to be downloaded by the peer 102a, 'bigcorp' representing the publisher (a fictional "Big Corporation") of the digital object to be downloaded, 'bigispnyc' representing the location string for the peer 102a (the New York point of presence for a fictional "Big ISP").
Based on this communication, the ISP DNS 306 redirects the request to the central DNS 308 (which is the name server for the domain contained in the communication). Thereafter, the central DNS 308 provides an address of the cache DNS 310 to the ISP DNS 306. The cache DNS 310, thus, receives a DNS request from the ISP DNS 306 for the digital object to be downloaded. Subsequently, the cache DNS 310 allocates one of the caches 312, such as, for example, cache 312a. In various embodiments of the present invention, the cache DNS 310 may allocate one of the caches 312 based on the load, availability and content on each of them. The cache DNS 310 communicates this information to the ISP DNS 306, which in turn communicates the information to the peer 102a. The peer 102a, thereafter, makes a communication with the cache 312a for downloading the digital object. The communication between the peer 102a and cache 312a is explained in detail in FIG. 4.
FIG. 4 is a block diagram illustrating a system 400 for content distribution in the P2P network 100. The system 400 includes the peer 102a, 102b and 102c, the cache 312a and 312b, a content server 402, a private tracker 404, a public tracker 406, a business logic unit 408, a central database server 410 and a user interface unit 412.
The peer 102a sends a request to the cache 312a for downloading the digital object. The cache 312a is connected to the content server 402 and the private tracker 404. In various embodiments of the present invention, the content server 402 includes complete copies of a plurality of stored digital objects in the P2P network 100. In an embodiment of the present invention, the content server 402 is connected to a publisher's computer network 403 through an application programming interface (API) 401. The content server 402 receives the digital objects, which are to be distributed, from the publisher's computer network 403 through the API 401. For example, the publisher wishing to distribute a video file in the P2P network 100 would first upload from the publisher's computer network 403 the video file to the content server 402 through the application programming interface 401. Thereafter, the video file can be subsequently downloaded by the peers 102 from the content server 402.
In an embodiment of the present invention, as soon as the publisher uploads a piece of the digital object on the content server 402 through the API 401, the digital data becomes available for the peers 102 to be downloaded. Thus, as the publisher progresses with the upload of subsequent pieces of the digital object, the peers 102 are able to download those uploaded pieces in parallel. Therefore, the capability of the system 400 to execute parallel uploads and downloads of the digital object from the content server 402 ensures an efficient real time availability of digital objects in the P2P network 100.
The cache 312a downloads the digital objects, based on the request from the peer 102a, from the content server 402. 402 or from cache 312b. The private tracker 404 knows which of the digital objects are available on which of the caches 312 and content servers 402 and provides this information to the cache 312a. If the digital object requested by the peer 102a is available on the cache 312a, the peer 102a downloads the digital object from the cache 312a. If the digital object is not available on the cache 312a, the cache 312a downloads the requested digital object from the content server 402 and/or the cache 312b. Thereafter, the cache 312a makes the digital object available to the peer 102a for downloading. In an embodiment of the present invention, the peer 102a may also download the related digital objects from the other peers 102 available in the P2P network 100, such as, for example, peer 102b and peer 102c. 5 The download from the cache 312a and from the pears 102b and 102c can take place substantially simultaneously.
In another embodiment of the present invention, the cache 312a may upload digital objects from the peers 102 available in the P2P network 100. In such a case, the cache 312a acts as 10 one of the peers 102.
As discussed above, the private tracker 404 maintains a track of all the data available on the content server 402 and the caches 312. The public tracker 406 is connected to all of the caches 312 and to all of the peers 102 in the P2P network 100. The public tracker 406 maintains a 15 track of all the data digital objects transferred among the caches 312 and the peers 102. In particular, the public tracker 406 maintains a list of all of the peers 102 and the caches 312 which hold copies of the digital objects available in the P2P network 100.
The business logic unit 408 is connected to all the caches 312 and the private tracker 404. The 20. business logic unit 408 authenticates peers 102 before allowing the peers 102 to upload any - digital object. Further, the business logic unit 408 is connected to the central database server 410. The business logic unit 408 acts as an interface between the P2P network 100 and the central database server 410. Central database server 410 acquires log reports from the private tracker 404 and caches 312, through the business logic unit 408, for all the data transferred to 25 and from the caches 312 and the content server 402. Using the information from the central database server 410 obtained via the business logic unit 408, such as, the log reports, the user interface unit 412 provides the required information billing purposes and for report generation.
30 In an embodiment of the present invention, the central database server 410 may be connected to the public tracker 406. In another embodiment of the present invention, the public tracker 406 may be connected to the private tracker 404. FIG. 5 is a block diagram illustrating an exemplary geographical implementation of a cache distribution network 500, in accordance with various embodiments of the present invention. The cache distribution network 500 includes one or more service points of presence, such as, a service point of presence 502a and 502b, hereinafter referred to as the service points of presence (POPs) 502. The cache distribution network 500 further includes one or more data points of presence, such as, data point of presence 504a, 504b, 504c and 504d, hereinafter referred to as data points of presence (POPs) 504. The service POPs 502 are located at remote geographical locations for, such as, for example London, San Jose and so forth. It should be understood by those skilled in art that the number of the service POPs 502 locations are scalable and may be increased with the increase in network traffic. The service POPs 502, such as the service POP 502a and 502b, are connected to each other. The connection between the service POPs 502 enables a real time data and information transfer between all of the service POPs 502,
Furthermore, the data POPs 504 are also located in remote geographical locations across the globe, such as, for example, New York, Frankfurt and so forth. It should be understood by those skilled in art that the number of the data POPs 504 locations are scalable and may be increased with the increase in network traffic and digital objects available in the P2P network 100. The data POPs 504, such as the data POP 504a and 504b, are connected with all the available service POPs 502 in the P2P network 100. The connection between the data POPs 504 and service POPs 502 enables a real time data update and information transfer between the data POPs 504 from the service POPs 502,
In an embodiment of the present invention, a geographical location may include both, the service POP 502a and the data POP 504a.
FIG. 6 is a block diagram illustrating an arrangement 600 of the components of the service POP 502a, in accordance with an embodiment of the present invention. The arrangement 600 for the service POP 502a includes the cache location server 302, the central domain name server 308, the content server 402, the private tracker 404, the business logic unit 408 and the central database server 410. Further, in an embodiment of the present invention, the arrangement 600 for the service POP 502a includes the caches 312, such as, the cache 312a and 312b. Furthermore, in an embodiment of the present invention, the arrangement 600 for the service POP 502a includes the public tracker 406, the business logic unit 408 and the user interface unit 412. In various embodiments of the invention, the central database server 410 is located in each of the service POPs 502. The central database server 410 of each of the service POPs 502 are connected to each other and act as a central database unit.
It should be understood by those skilled in the art that the components illustrated in the arrangement 600 for the service POP 502a are scalable and may be increased based on the network traffic and the digital objects available in the P2P network 100.
FIG. 7 is a block diagram illustrating an arrangement 700 of the components of the data POP 504a, in accordance with an embodiment of the present invention. The arrangement 700 for the data POP 504a includes the caches 312, such as, the cache 312a, 312b, 312c and 312d and the cache DNS 310. Only a single cache DNS 310 is shown in FIG 7 for simplicity. However, the data POP 504a may contain more than one of the single caches DNS 310 . The data POP 504a provides digital objects for the peers 102 in the P2P network 100. The data POPs 504 download data from the service POPs 502.
It should be understood by those skilled in the art that the components illustrated in the arrangement 700 for the data POP 504a are scalable and may be increased based on the network traffic and the digital objects available in the P2R network 100.
The invention has been described with respect to various embodiments. It will be understood that the invention is not limited thereto. Numerous charges and modifications are known to the person skilled in the art and the invention is not limited to the details shown and described herein but is intended instead to cover all such charges as are obvious to one of ordinary skill of the art.

Claims

Claims
1. Content distribution network for the distribution of a digital object comprising:
- a plurality of peers (102a, 102b, 102c), at least some of the plurality of peers (102a, 102b, 102c) being connected to at least some of the others of the plurality of peers (102a, 102b, 102c) and having a peer location identifier and a download client (103 a) for downloading the digital object;
- a plurality of distributed caches (312a, 312b), whereby at least some of the plurality of peers (102a, 102b, 102c) are connected to at least some of the plurality of distributed caches (312);
- at least one publisher's computer network (403) connected to at least one of the plurality of distributed caches (312) for distributing the digital object to at least one of the plurality of distributed caches (312);
- a private tracker for managing the distribution of the digital object among the plurality of distributed caches (312a, 312b) ;
- a public tracker for managing the distribution of the digital object between the plurality of peers (102a, 102b, 102c).
2. The content distribution network of claim 1, further comprising at least one first content server (402) and connected to the private tracker and at least one of the plurality of distributed caches (312) for distributing content to the plurality of distributed caches (312).
3. The content distribution network of claim 1 or 2, further comprising a further content server (402) at a location remote from the first content server (402).
4. The content distribution network of any of the above claims further comprising a cache location server (302) connected to at least some of the plurality of peers (102) for providing the at least some of the plurality of peers (102) with a cache location identifier of one or more of the plurality of distributed caches (312a, 312b).
5. The content distribution network of any of the above claims wherein the content server (402) maintains a complete copy of the digital object.
6. A method for the distribution of a digital object over a network to at least one of a plurality of peers (102) comprising:
- a first step of placing at least a first piece of the digital object on a content supplier (402; 312); - a second step of transferring at least the first piece of the digital object to a least one of a plurality of distributed caches (312);
- a third step of announcing the availability of the digital object to at least one of the plurality of peers (102);
- a fourth step of downloading at least the first piece of the digital object to the at least one of the plurality of peers ( 102) .
7. The method of claim 6, wherein the third step of announcing the availability of the digital object is completed prior to the transfer of all of the pieces of the digital object to the content server (402).
8. The method of claim 6 or 7, wherein the at least one of the plurality of peers (102) uploads at least the first piece of the digital object to a further cache (312).
9. The method of any one of claims 6 to 8, wherein the at least one of the plurality of peers (102) provides at least the first piece of the digital object to a further one of the plurality of peers (102).
10. The method of any one of claims 6 to 9 further managing the distribution of the digital object among the plurality of distributed caches (312) by a private tracker.
11. An application programming interface (401) connected to at least one first content server (402), the at least one first content server (402) being connected to a plurality of distributed caches (312) and the plurality of distributed caches (312) being connected to a plurality of peers (102a, 102b, 102c), wherein a digital object for distribution is uploadable to the at least one content server (402) through the application programming interface.
PCT/EP2007/007104 2006-08-11 2007-08-10 Content distribution network WO2008017502A1 (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GB0616049.3. 2006-08-11
GB0616049A GB2440762B (en) 2006-08-11 2006-08-11 Content distribution network
US11/598,130 US20080040420A1 (en) 2006-08-11 2006-11-08 Content distribution network
US11/598,130 2006-11-08

Publications (1)

Publication Number Publication Date
WO2008017502A1 true WO2008017502A1 (en) 2008-02-14

Family

ID=38799354

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/007104 WO2008017502A1 (en) 2006-08-11 2007-08-10 Content distribution network

Country Status (1)

Country Link
WO (1) WO2008017502A1 (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741869A (en) * 2008-11-07 2010-06-16 华为技术有限公司 Method and system for providing content
CN102308549A (en) * 2009-02-06 2012-01-04 瑞典爱立信有限公司 Network aware peer to peer
WO2012152817A1 (en) * 2011-05-12 2012-11-15 Telefonica, S.A. Method and end point for distributing live content stream in a content delivery network
WO2012152751A1 (en) * 2011-05-12 2012-11-15 Telefonica, S.A. A method and a tracker for content delivery through a content delivery network
BE1020639A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A SYSTEM FOR SELECTING AND VIEWING PROGRAM CONTENT USING USER INTERFACES.
BE1020638A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DISTRIBUTED DELAYED STREAMING OF CONTENT.
BE1020636A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DIVIDELY DELAYED STREAMING OF CONTENT.
BE1020637A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DIVIDED UPLOADING OF CONTENT.
US11481142B2 (en) 2017-12-22 2022-10-25 Alibaba Group Holding Limited Method and device for downloading resources

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002058360A2 (en) * 2000-11-22 2002-07-25 Microsoft Corporation Universal naming scheme for peer to peer resources
US20030204602A1 (en) * 2002-04-26 2003-10-30 Hudson Michael D. Mediated multi-source peer content delivery network architecture
GB2412279A (en) * 2004-03-16 2005-09-21 Bbc Technology Holdings Ltd Data distribution system and method
US20060165014A1 (en) * 2005-01-26 2006-07-27 Yasushi Ikeda Peer-to-peer content distribution system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002058360A2 (en) * 2000-11-22 2002-07-25 Microsoft Corporation Universal naming scheme for peer to peer resources
US20030204602A1 (en) * 2002-04-26 2003-10-30 Hudson Michael D. Mediated multi-source peer content delivery network architecture
GB2412279A (en) * 2004-03-16 2005-09-21 Bbc Technology Holdings Ltd Data distribution system and method
US20060165014A1 (en) * 2005-01-26 2006-07-27 Yasushi Ikeda Peer-to-peer content distribution system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
TIN-MAN T KWAN ET AL: "ServerCast: efficient cooperative bulk data distribution scheme for content distribution networks", GLOBAL TELECOMMUNICATIONS CONFERENCE, 2005. GLOBECOM '05. IEEE ST. LOIUS, MO, USA 28 NOV.-2 DEC. 2005, PISCATAWAY, NJ, USA,IEEE, 28 November 2005 (2005-11-28), pages 915 - 919, XP010879599, ISBN: 0-7803-9414-3 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741869A (en) * 2008-11-07 2010-06-16 华为技术有限公司 Method and system for providing content
CN101741869B (en) * 2008-11-07 2013-04-24 华为技术有限公司 Method and system for providing contents
CN102308549A (en) * 2009-02-06 2012-01-04 瑞典爱立信有限公司 Network aware peer to peer
WO2012152817A1 (en) * 2011-05-12 2012-11-15 Telefonica, S.A. Method and end point for distributing live content stream in a content delivery network
WO2012152751A1 (en) * 2011-05-12 2012-11-15 Telefonica, S.A. A method and a tracker for content delivery through a content delivery network
ES2425627R1 (en) * 2011-05-12 2013-11-06 Telefonica Sa METHOD AND TRACKER FOR DISTRIBUTION OF CONTENT THROUGH A NETWORK OF DISTRIBUTION OF CONTENT
ES2429222A1 (en) * 2011-05-12 2013-11-13 Telefónica, S.A. Method and end point for distributing live content stream in a content delivery network
BE1020639A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A SYSTEM FOR SELECTING AND VIEWING PROGRAM CONTENT USING USER INTERFACES.
BE1020638A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DISTRIBUTED DELAYED STREAMING OF CONTENT.
BE1020636A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DIVIDELY DELAYED STREAMING OF CONTENT.
BE1020637A3 (en) * 2012-09-06 2014-02-04 Holybrain Bvba A METHOD FOR DIVIDED UPLOADING OF CONTENT.
US11481142B2 (en) 2017-12-22 2022-10-25 Alibaba Group Holding Limited Method and device for downloading resources

Similar Documents

Publication Publication Date Title
US20080040420A1 (en) Content distribution network
US7995473B2 (en) Content delivery system for digital object
US8200906B2 (en) Cache structure for peer-to-peer distribution of digital objects
JP5050095B2 (en) Method, system, and node for P2P content sharing
WO2008017502A1 (en) Content distribution network
Majeed et al. Multimedia streaming in information-centric networking: A survey and future perspectives
US7908362B2 (en) Method and apparatus for the delivery of digital data
US20100115613A1 (en) Cacheable Mesh Browsers
US20060224687A1 (en) Method and apparatus for offline cooperative file distribution using cache nodes
US8028019B2 (en) Methods and apparatus for data transfer in networks using distributed file location indices
US8321494B2 (en) Method and apparatus for reporting and invoicing of data downloads
US8244867B2 (en) System and method for the location of caches
EP1869862A1 (en) Method and apparatus for cooperative file distribution in the presence of firewalls
CN101510899A (en) Method, system and equipment for implementing content source selection
US9241032B2 (en) Storage performance
JP5716745B2 (en) Data transfer system
IL197008A (en) Method and apparatus for providing improved storage performance
Meng et al. Peer-to-peer file sharing in next generation eXpressive Internet Architecture
Wang et al. NCDN: A Node‐Failure Resilient CDN Solution with Reinforcement Learning Optimization
Pacitti et al. Content Distribution in P2P Systems
WO2008017504A1 (en) Content delivery system for digital object
Chen Dynamic, Scalable, and Efficient Content Replication Techniques
KR20090124646A (en) Web Cache Acceleration System using P2P

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07801603

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07801603

Country of ref document: EP

Kind code of ref document: A1