WO2010111887A1 - 数据节点装置、对端信息获取方法和系统 - Google Patents
数据节点装置、对端信息获取方法和系统 Download PDFInfo
- Publication number
- WO2010111887A1 WO2010111887A1 PCT/CN2010/000335 CN2010000335W WO2010111887A1 WO 2010111887 A1 WO2010111887 A1 WO 2010111887A1 CN 2010000335 W CN2010000335 W CN 2010000335W WO 2010111887 A1 WO2010111887 A1 WO 2010111887A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- peer
- data node
- peer list
- list
- unit
- Prior art date
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
- 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/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/1072—Discovery involving ranked list compilation of candidate peers
-
- 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/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/50—Service provisioning or reconfiguring
Definitions
- the present invention generally relates to computer networks, and more particularly to data node devices for use in peer-to-peer (P2P) data exchange that can be used to reduce P2P cross-domain traffic,
- P2P peer-to-peer
- a peer information acquisition method and a system for providing and acquiring peer information A peer information acquisition method and a system for providing and acquiring peer information. Background technique
- the P2P system is a distributed data sharing system that provides services such as file sharing, streaming media, and voice over Internet Protocol (VoIP).
- VoIP voice over Internet Protocol
- the traffic of the P2P system is huge. It has been reported that P2P traffic accounts for as much as 70% of Internet traffic worldwide. Most existing P2P implementations do not consider the topology of the network. The peering decision is made independently of the network topology and traffic conditions.
- the index server responds to a request from a data node application unit that makes a query, it usually randomly selects a subset from the existing metadata set to return. This random answer often leads to serious cross-domain traffic problems.
- Figure 1 shows a block diagram of a system 5 for providing and obtaining peer information in accordance with the prior art.
- the data node application unit 61 in the data node 60 needs to exchange a certain data file with a peer (not shown) in the P2P system to which it belongs, its peer information request unit 612 is directed to the P2P system.
- the index server 50 issues a peer list request.
- the peer information management unit 52 in the index server 50 searches the peer information storage unit 51 to find all the peers that can exchange the data file with the data node application unit 61, and from these A plurality of peers randomly selected in the peer end are included in the peer list and returned to the data node application unit 61 as a response.
- the peer information requesting unit 612 in the data node application unit 61 supplies the peer list response to the data exchange unit 611 after receiving the peer list response.
- the data exchange unit 611 thus exchanges data with the peers listed in the peer list.
- the peer end in the peer list returned by the index server 50 may include a data node application unit located on a data node in another different network domain, for example.
- ISP Internet Service Provider
- P4P Provider Portal for Applications
- SIGCOMM'2008 pp. 351-362 (Document 1).
- Network architecture P4P (full name: Proactive network Provider Participation for P2P 7 is the network provider actively participates in P2P). This architecture allows network providers to provide more information to applications and reduce redundant cross-ISP traffic.
- P4P can provide many information such as static network policy, P4P distance and network capability reflecting the network status to the client making the query.
- P4P distance interface At the heart of this new architecture is the P4P distance interface, through which the ISP can provide application overhead information on the current internal and external links to the application.
- the P4P architecture introduces an information server as an interface between the network operator and the application.
- Fig. 2 shows a block diagram of another system 5a for providing and acquiring peer information according to the prior art described in Document 1.
- the system 5a differs from the system 5 shown in Fig. 1 in that it also includes an information server 70.
- Information server 70 provides network information, including distance, delay, traffic conditions, and the like. Other entities in the network (index servers, data nodes) can query information such as the distance between two nodes and network traffic through the service interface they provide.
- the index server 50a shown in the figure is different from the index server 50 shown in FIG. 1 in that it includes a location information requesting unit 53 in addition to the peer information storage unit 51 and the peer information management unit 52a.
- the peer information management unit 52a in the index server 50 first searches the peer information storage unit 51 to find all applicable data node applications, similarly to the peer information management unit 52.
- Unit 61 exchanges the opposite end of the data.
- the peer information management unit 52a does not randomly select a plurality of peers from the peers, but indicates the location information requesting unit 53 to the information service.
- the server 70 requests information about the location (P4P distance) of the data node where all the peers are located with respect to the data node 60, and according to the location information received by the location information requesting unit 53 from the information server, the slave data node application unit 61.
- the peer end of the exchange data selects the peer whose data node is located close to the data node 60, and the peers whose positions are close are included in the peer list, and are returned to the data node 60 as a response.
- the indexing server can reply to the client with a peer list that includes peers mostly from the same domain (e.g., the same ISP).
- the present invention provides a data node apparatus for reducing cross-domain traffic used in P2P data exchange and a peer information acquisition method thereof, and a related system.
- an apparatus for acting as a data node in a P2P data exchange comprising: a data node application unit, the data node application unit issues a peer list request and performs data exchange with the peer; and list processing a unit, the list processing unit intercepts an original peer list provided by the index server in response to the peer list request, sends a peer location request to the information server, and receives the peer provided by the information server in response to the peer location request Location information, processing the original peer list based on the peer location information to derive a processed peer list, and providing the processed peer list to the data node application unit.
- a method for obtaining peer information at a data node for P2P data exchange comprising: issuing a peer list request to an index server; intercepting the index server in response to the pair The original peer list provided by the end list request; sending a peer location request to the information server; receiving peer location information provided by the information server in response to the peer location request; based on the peer location information Processing the original peer list to derive a processed peer list; and providing the processed peer list to the data fUl/U ⁇ U1U / UUU 335 node application unit.
- a system for providing and obtaining peer information in a P2P data exchange comprising: one or more index servers, each of which provides an original peer list in response to a peer list request; An information server requesting peer location information at a peer location; and means as described above.
- existing P2P cross-domain traffic can be reduced without modifying the existing index server and the data node application unit, and as long as a list processing unit is deployed in the data node, multiple different processes can be simultaneously processed. P2P system related messages. In addition, you can guarantee a shorter download time by re-requesting the peer list. DRAWINGS
- FIG. 1 shows a block diagram of a system according to the prior art.
- FIG. 2 shows a block diagram of another system in accordance with the prior art.
- Fig. 3 shows a block diagram of a system including means as a data node in accordance with a first embodiment of the present invention.
- FIG. 4 is a flow chart showing a method for the data node shown in FIG. 3 to acquire peer information.
- Fig. 5 shows a block diagram of a system including means as a data node in accordance with a second embodiment of the present invention.
- FIG. 6 is a flow chart showing a method for the data node shown in FIG. 5 to acquire the peer information. detailed description
- a P2P system may include an index server, an information server, and a plurality of data node application units that perform data exchange, and the data node application units are opposite each other.
- Indexing Server is the metadata of all the files exchanged in the P2P system and the data nodes of all the data node applications that exchange these files.
- the entity may also be called a Signaling Node, Tracker, appTracker or Super Node.
- a P2P system may include one or more index servers, and different P2P systems typically have their own index servers.
- Information Server Also known as iTracker, it is an entity that provides network information including distance, delay, traffic status, and so on. Other entities in the network (index servers, data nodes) can query information such as the distance between two data nodes and network traffic through the service interface they provide. Multiple P2P systems can share an information server.
- the information server can be provided by an ISP.
- a data node An entity that stores all or part of an actual data item.
- a data node can be any variety of information processing devices capable of storing data and communicating with other network nodes over a network, such as a personal computer (PC), a mobile phone, a personal digital assistant (PDA), and the like.
- a data node can house one or more data node application units that belong to one or more P2P systems, respectively.
- a BitTorrent application unit, eMule application unit, etc. can be installed on a PC.
- a data node may sometimes also be referred to as a data node device or as a device for a data node.
- Data node application unit It is a unit for data exchange and peer information query in a P2P system. It includes a data exchange unit and a peer information request unit.
- the peer information requesting unit requests information about the peer of the file being exchanged (downloaded/uploaded) to the index server in the P2P system to which the data node application unit belongs.
- the data exchange unit establishes a connection with the peers in the peer list and downloads/uploads the file data with the peers.
- a data node application unit can also be referred to as a data node application. Also, in interaction with the index server and the information server, the data node application unit may also be referred to as a client application unit or a client application.
- Each data node application unit in a P2P system is opposite to each other.
- each data node where these data node application units located at opposite ends can be said to be opposite each other.
- Metadata This information describes the properties of the actual data, such as where the actual data item is located and its size.
- Network domain A collection of network nodes that are in the same area in terms of network topology.
- the same "network domain” can refer to the same ISP, the same LAN, and so on. If two data nodes belong to the same network domain, it can be said that the data node application units respectively accommodated by the two data nodes belong to the same network domain.
- the “location” here does not necessarily refer to the physical location. More precisely, “location” here refers to the location of the data node in terms of network topology.
- location here refers to the location of the peer end of a data node application unit relative to the data node application unit is equivalent to the location of the data node hosting the peers relative to the data node housing the data node application unit.
- the relative position between data nodes can be expressed by the network distance between them.
- Network Distance Reflects the distance between data nodes in terms of network topology. It may be a P4P distance reflecting the network status and preferences in terms of traffic as previously described. Similarly, in the present invention, the network distance between the peer end of a certain data node application unit and the data node application unit is equivalent to the data node accommodating the peer end and the data node accommodating the data node application unit. Network distance.
- Fig. 3 shows a block diagram of a device 20 as a data node (hereinafter referred to as data node 20) and its system 1 constructed with one or more index servers 10 and information servers 30 in accordance with a first embodiment of the present invention.
- the system 1 includes one or more index servers 10-1, 10-2, ..., 10-N (collectively referred to as index servers 10), data nodes 20, and information servers 30, where N is greater than or An integer equal to 1.
- the index server 10 is an entity that stores and indexes peer information, and each of them may include a peer information storage unit and a peer information management unit as shown in FIG. 1.
- the peer information storage unit of each index server 10 stores information of data nodes in which all data node application units in the P2P system to which the index server 10 belongs, such as including contact information, metadata of owned files, and the like.
- the data nodes are indexed by files exchanged by these data nodes (or data node application units housed by these data nodes).
- the peer information management unit is responsible for communicating with all data node application units.
- the information server 30 is an entity that provides network information including distance, delay, traffic conditions, and the like.
- the index server and the data node application unit can query information such as the distance between the two data nodes and the network traffic through the service interface provided by the index server and the data node.
- the internal configuration of the information server 30 is not shown in FIG.
- the data node 20 includes one or more data node application units 21-1, 21-2, ..., 21-N (collectively referred to as data node application units 21) belonging to one or more P2P systems, respectively, and a list processing unit 22 .
- the data node application unit 21-1 and the index server 10-1 and the information server 30 and other one or more data node application units (not shown) which may be respectively located on other one or more data nodes may constitute the first P2P system.
- the data node application unit 21-2 and the index server 10-2 and the information server 30 and other one or more data node application units (not shown) which may be respectively located on other one or more data nodes may constitute the second P2P
- the data node application unit 21-N and the index server 10-N and the information server 30 and other one or more data node application units (not shown) that may be respectively located on other one or more data nodes may Form the Nth P2P system, and so on.
- a BitTorrent application unit and a BitTorrent index server and a shared information server on a plurality of data nodes may constitute a BitTorrent P2P system
- the eMule application unit and the eMule index server and the shared information server on the plurality of data nodes may constitute an eMule.
- P2P system may include N P2P systems each include one index server and all P2P systems share one information server.
- each P2P system can include multiple index servers.
- each P2P system can have its own information server.
- different P2P systems can also share one or more index servers.
- Each data node application unit 21 may include a data exchange unit and a peer information request unit.
- the data node application unit 21-1 includes a data exchange unit 211-1 and a peer information request unit 212-1;
- the data node application unit 21-2 includes a data exchange unit 211-2 and a peer information request unit 212-2;
- the data node application unit 21-N includes a data exchange unit 211-N and a peer information request unit 212-N, and the like.
- the list processing unit 22 includes a response message intercepting unit 221, a response message construction unit 223, and one or more application message processing units 222-1, 222- 2., 222-N (collectively referred to as application message processing unit 222).
- Each application message processing unit 222 processes messages associated with the P2P system to which the corresponding data node application unit 21 belongs, such as a BitTorrent message, an eMule message, and the like.
- the data node application unit 21-1 wants to exchange data with other data node application units in the P2P system to which it belongs, first, in the data node application unit 21-1
- the peer information requesting unit 212-1 issues a peer list request to the corresponding index server 10-1 to request to obtain a list listing the data nodes in the P2P system to which the data node application unit 21-1 belongs.
- the application unit exchanges the data node application unit (SP, peer) of the required data file.
- the peer information management unit in the index server 10-1 searches the peer information storage unit for the data node application unit capable of exchanging the data, and randomly from the data node application units.
- a plurality of data node application units are selected and the randomly selected data node application unit is included as a peer in the peer list to be returned. Because it is randomly selected, the peer list may include such peers: the data nodes where the peers are located are far away from the data node 20 where the data node application unit 21-1 is located, for example, from different network domains, In other words, these peers are far away from the data node application unit 21-1, for example from different network domains.
- each index server 10 includes the original peer list in the peer list response message and returns the response message to the data node that sent the peer list request.
- the data node 20 of the present invention includes the list processing unit 22.
- the list processing unit 22 can be added to the kernel space of the operating system of the data node 20 in the form of a plug-in module.
- the invention is not limited thereto.
- the list processing unit 22 can be implemented in other software, hardware, firmware, or a combination thereof.
- the list processing unit 22 intercepts the peer list response message transmitted from one of the index servers 10 and which is to be received by the data node application unit 21. Specifically, in the list processing unit 22 The response message intercepting unit 221 can intercept the peer list response message. In one implementation, the response message intercepting unit 221 can intercept all messages sent by the indexing server by adding a hook to the operating system of the data node 20. In an implementation manner, the response message intercepting unit 221 can directly intercept the shoulders from the TCP/IP protocol stack of the operating system.
- the response message intercepting unit 221 classifies the intercepted peer list response message to determine which P2P system message the peer list response message belongs to, gp, and the data node application unit 21-1, 21-2, ... Which one of ..., 21-N is associated, and delivers the peer list response message to the corresponding application message processing unit 222 based on the classification result.
- the response message intercepting unit 221 receives the request.
- the identification information contained in the peer list response message can be determined to be for the data node application unit 21-1.
- the response message intercepting unit 221 delivers the peer list response message to the application message processing unit 222-1 associated with the data node application unit 21-1.
- the response message intercepting unit 221 can identify that the message is a BitTorrent response message based on the identification information contained in the received message, so that the message can be delivered to the BitTorrent application.
- the message associated application message processing unit 222-1 is a BitTorrent application.
- the application message processing unit 222-1 After receiving the peer list response message delivered from the response message intercepting unit 221, the application message processing unit 222-1 extracts the original peer list included therein. Then, the application message processing unit 222-1 issues a peer location request to the information server 30 to request to obtain an information server 30 response regarding the location of the data node where the peer included in the original peer list is located with respect to the data node 20 At the peer location request from the application message processing unit 222-1, the peer location information is returned to the application message processing unit 222-1. In one example, the peer location information includes information on the network distance (e.g., P4P distance) between the data node where the peer listed in the original peer list is located and the data node 20.
- P4P distance the network distance
- the application message processing unit 222-1 processes the peer end in the original peer list based on the peer location information returned from the information server 30.
- the processing includes pressing this The descending order of the network distance between the data node where the peer is located and the data node 20 sorts the peers.
- the processing further includes deleting, after the peers are sorted, the peers whose data nodes are located far from the data node 20 as needed from the list.
- the peer list thus processed includes only the peer whose data node is located closer to the data node 20, for example, the data node where the data node and the data node 20 belong to the opposite end of the same network domain.
- the application message processing unit 222-1 delivers the thus obtained processed peer list to the response message construction unit 223.
- the response message construction unit 223 collects the processed peer list delivered from the application message processing unit, and provides the peer list response message including the processed peer list to the corresponding data node application unit. In this example, after receiving the processed peer list delivered from the application message processing unit 222-1, the response message construction unit 223 supplies it to the data in the form of a peer list response message for the corresponding P2P system. Node application unit 21-1. For example, if the data node application unit 21-1 is a BitTorrent application, the response message construction unit 223 includes the processed peer list included in the BitTorrent response message to the data node application unit 21-1.
- the peer information requesting unit 212-1 in the data node application unit 21-1 After receiving the peer list response message including the processed peer list, the peer information requesting unit 212-1 in the data node application unit 21-1 extracts the peer list therein and provides it to the data exchange unit. 211-1.
- the data exchange unit 211-1 can thus exchange data with the peers listed in the peer list.
- the data node application unit that wants to exchange data with the peer end obtains a peer list including the peers close to the location, instead of the list of randomly selected peers. Therefore, according to the present invention, it is possible to reduce the existing P2P cross-domain traffic without modifying the existing index server and the data node application unit, and, as long as a list processing unit provided, for example, in the form of a plug-in, is deployed in the data node Messages related to multiple different P2P systems can be processed simultaneously.
- step S101 the peer information requesting unit of one of the data node application units 21 issues a peer list request to the corresponding index server 10.
- step S102 the original peer list is intercepted.
- the step may include: the response message intercepting unit 221 intercepts one of the index servers 10 and sends the peer list response message in response to the peer list request, and determines the peer list response message and the data node application unit 21 Which one of them is associated, and then the peer list response message is delivered to the corresponding application message processing unit 222.
- This step may further include the application message processing unit 222 receiving the peer list response message delivered from the response message intercepting unit 221 extracting the original peer list included in the peer list response message, thereby implementing the original peer list. Intercept.
- step S103 one of the application message processing units 222 issues a peer location request to the information server 30 to request information about the location of the data node in which the peer included in the original peer list is located relative to the data node 20.
- step S104 the application message processing unit that issued the peer location request receives the peer location information returned from the information server 30.
- step S105 the application message processing unit performs processing including, for example, sorting and deleting the partial peers, on the opposite end in the original peer list based on the peer location information, and delivers the processed peer list to the response.
- step S106 after receiving the processed peer list delivered from one of the application message processing units 222, the response message constructing unit 223 provides the peer list response message including the processed peer list to the corresponding Data node application unit. The process then ends.
- Fig. 5 is a block diagram showing a device 20a as a data node (hereinafter referred to as a data node 20a) and its system la constituted with one or more index servers 10 and information servers 30 according to a second embodiment of the present invention.
- a data node 20a a data node
- FIG. 5 the same components as those in the first embodiment shown in FIG. 3 will be denoted by the same reference numerals, and detailed description of these components will be omitted.
- the data node 20a is different from the data node 20 shown in FIG. 3 in that the list processing unit 22a includes a response message intercepting unit 221, an application message processing unit 222, and a response message constructing unit 223.
- 222-N - corresponding one or more re-request units 224-1, 224-2, ..., 224-N (collectively referred to as re-request unit 224), and cache unit 225.
- the re-request unit 224 can construct a peer list request for use in the corresponding P2P system to request more peer information from the corresponding index server 10.
- the cache unit 225 can be used to cache the processed peer list obtained in the process of obtaining the peer list. Note that in the present embodiment, a case where a plurality of application message processing units 222 share one cache unit 225 is shown. In this case, each application message processing unit 222 can access a corresponding one of the cache units 225. Of course, other implementations are contemplated by those skilled in the art. For example, each application message processing unit 222 can have its own cache unit.
- the processing performed by the application message processing unit of the embodiment on the original peer list includes, in addition to sorting the original peer list by distance and deleting some of the remote ends as needed, including
- the peer list thus obtained is combined with the peer list (if any) already cached in the corresponding area of the cache unit 225.
- the application message processing unit determines whether the peer in the peer list thus processed is sufficient, for example, whether the number reaches a certain threshold. If the number of peers is too small, the data node application unit will not have enough data sources for data exchange, and the time for downloading data may be extended.
- the application message processing unit of the embodiment temporarily stores the currently processed peer list in the corresponding area of the buffer unit 225, and indicates correspondingly, in the case that the number of peers is too small.
- the re-request unit issues one or more additional peer list requests to the corresponding index server 10.
- the peer information management unit of the corresponding index server 10 searches the peer information storage unit again, and randomly selects the data file required to exchange the corresponding data node application unit. The peer, thereby providing the data node 20a with one or more additional peer list response messages including the original peer list.
- the application message processing unit extracts one or more additional original peer lists and performs the above-mentioned processing including sorting, deleting, and combining, and the above determination, and repeats the re-request if necessary until the number of peers is sufficient .
- the application message processing unit 222-1 is still taken as an example for description. Specifically, in one implementation, the application message processing unit 222-1 processes the original peer list in the peer list response message delivered from the response message intercepting unit 221 after extracting it.
- the processing herein includes sorting the peers in the original peer list and deleting the remote ends (eg, not in the same network domain) as needed, and the peer list including the remaining peers and the cache unit 225 The peer list (if any) in the corresponding area is combined.
- the application message processing unit 222-1 first checks whether the previously cached peer list already exists in the corresponding area of the cache unit 225.
- the corresponding area of the cache unit 225 should be empty. In this case, there is no need to combine, and the peer list that has been sorted and deleted by some of the peers is the processed peer list.
- the peer list is already cached in the corresponding area in the cache unit 225, it indicates that the currently processed original peer list is returned by the index server 10-1 in response to the additional peer list request sent by the re-request unit.
- the original peer list and then the application message processing unit 222-1 combines the above-mentioned sorted and possibly deleted partial peer list with the peer list in the cache unit 225 to derive a processed peer list.
- the application message processing unit 222-1 determines if the peer in the processed peer list is sufficient, e.g., if the number reaches a predetermined threshold.
- the application message processing unit 222-1 supplies the processed peer list to the corresponding data node application unit 21-1 via the response message construction unit 223. Prior to or after this, the application message processing unit 222-1 may empty the corresponding area in the cache unit 225.
- the application message processing unit 222-1 caches the processed peer list in the corresponding area in a manner such as to overwrite any peer list previously cached in the corresponding area of the cache unit 225. And instructing the corresponding re-request unit 224-1 to issue an additional peer list request to the index server 10-1.
- the index server 10-1 will return a peer list response message including the randomly selected peer list in response to the peer list request.
- the list processing unit 22a then repeats the above process until the number of peers in the processed peer list is sufficient.
- the application message processing unit 222 may first list the original peer list and the cached peer list (if any). The words are combined, and then all the peers in the combined peer list are sorted by network distance, and some relatively distant peers are deleted as needed to obtain a processed peer list. In this case, in addition to caching the peer list itself, information for accommodating the network distance of the data node of each peer to the data node can also be cached. Other embodiments can be envisioned by those skilled in the art.
- the index server in the case where the number of peers is insufficient, can be requested again to return a plurality of randomly selected peers, thereby ensuring sufficient peers and thus ensuring a short download time.
- step S201 the peer information requesting unit of one of the data node application units issues a peer list request to the corresponding index server 10.
- the original peer list is intercepted.
- the original peer list may be the original peer list returned by one of the index servers 10 in response to the initial peer list request sent by the peer information request unit of the corresponding data node application unit, or may be The original peer list returned by one of the index servers 10 in response to an additional peer list request issued by the corresponding re-request unit.
- the response message intercepting unit 221 can intercept the peer list response message including the original peer list and deliver the peer list response message to the corresponding application message processing unit 222. Then, the corresponding application message processing unit 222 extracts the original peer list included in the peer list response message.
- step S203 the application message processing unit 222 that extracts the original peer list issues a peer location request to the information server 30 to request to obtain a location about the peer included in the original peer list relative to the corresponding data node application unit. (ie, the location of the data nodes where these peers are located relative to the present data node 20).
- step S204 the application message processing unit that issues the peer location request receives the peer location information returned from the information server 30.
- step S205 the application message processing unit processes the original peer list based on the peer location information, for example, including sorting, deleting, and a combination with the cached peer list (if any).
- step S206 the application message processing unit determines whether the peer in the processed peer list is sufficient, for example, whether the number reaches a predetermined threshold.
- step S206 If the peer is not sufficient ("NO" in step S206), the application message processing unit caches the processed peer list in the corresponding area in the cache unit (step S207), and instructs the corresponding re-request unit to index The server issues an additional peer list request (step S208). Data node 20 then repeats steps S202 through S206 until the number of peers in the processed peer list is sufficient.
- step S206 determines whether the opposite end is sufficient (YES in step S206). If it is determined in step S206 that the opposite end is sufficient (YES in step S206), then in step S209, the application message processing unit clears the corresponding area in the buffer unit 225, and will process it in step S210. The peer list is provided to the corresponding data node application unit via the response message construction unit. The process then ends.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2011541075A JP5259835B2 (ja) | 2009-04-01 | 2010-03-19 | データノード装置、ピア情報取得方法およびシステム |
US13/124,770 US20110307564A1 (en) | 2009-04-01 | 2010-03-19 | Data node apparatus, peer information acquisition method and system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200910132675.0 | 2009-04-01 | ||
CN200910132675A CN101854374A (zh) | 2009-04-01 | 2009-04-01 | 数据节点装置、对端信息获取方法和系统 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010111887A1 true WO2010111887A1 (zh) | 2010-10-07 |
Family
ID=42805639
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2010/000335 WO2010111887A1 (zh) | 2009-04-01 | 2010-03-19 | 数据节点装置、对端信息获取方法和系统 |
Country Status (4)
Country | Link |
---|---|
US (1) | US20110307564A1 (zh) |
JP (1) | JP5259835B2 (zh) |
CN (1) | CN101854374A (zh) |
WO (1) | WO2010111887A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010277314A (ja) * | 2009-05-28 | 2010-12-09 | Kddi Corp | P2p配信方法およびシステム |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9235519B2 (en) * | 2012-07-30 | 2016-01-12 | Futurewei Technologies, Inc. | Method for peer to peer cache forwarding |
US11386233B2 (en) | 2019-04-30 | 2022-07-12 | JFrog, Ltd. | Data bundle generation and deployment |
US11340894B2 (en) | 2019-04-30 | 2022-05-24 | JFrog, Ltd. | Data file partition and replication |
US11886390B2 (en) | 2019-04-30 | 2024-01-30 | JFrog Ltd. | Data file partition and replication |
WO2021014326A2 (en) | 2019-07-19 | 2021-01-28 | JFrog Ltd. | Software release verification |
US10999314B2 (en) | 2019-07-19 | 2021-05-04 | JFrog Ltd. | Software release tracking and logging |
US11695829B2 (en) * | 2020-01-09 | 2023-07-04 | JFrog Ltd. | Peer-to-peer (P2P) downloading |
US11860680B2 (en) | 2020-11-24 | 2024-01-02 | JFrog Ltd. | Software pipeline and release validation |
US12061889B2 (en) | 2021-10-29 | 2024-08-13 | JFrog Ltd. | Software release distribution across a hierarchical network |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020178261A1 (en) * | 2001-05-25 | 2002-11-28 | Chang Frederic Robert | Method of improving the reliability of peer-to-peer network downloads |
CN1816053A (zh) * | 2006-03-10 | 2006-08-09 | 清华大学 | 基于会话初始化协议的流媒体直播p2p网络方法 |
CN101005606A (zh) * | 2006-12-31 | 2007-07-25 | 华为技术有限公司 | 一种减少媒体播放延时的方法和装置 |
CN101552719A (zh) * | 2008-04-01 | 2009-10-07 | 华为技术有限公司 | 路由选择方法和装置 |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060212542A1 (en) * | 2005-03-15 | 2006-09-21 | 1000 Oaks Hu Lian Technology Development Co., Ltd. | Method and computer-readable medium for file downloading in a peer-to-peer network |
EP1821487B1 (en) * | 2006-02-21 | 2010-04-07 | Microsoft Corporation | Topology management in peer-to-peer content distribution clouds |
ATE551816T1 (de) * | 2006-09-28 | 2012-04-15 | Rayv Inc | System und verfahren zum peer-to-peer-medien- streaming |
CN101018172A (zh) * | 2007-02-09 | 2007-08-15 | 浪潮电子信息产业股份有限公司 | 一种优化城域网内p2p传输的方法 |
US20090100128A1 (en) * | 2007-10-15 | 2009-04-16 | General Electric Company | Accelerating peer-to-peer content distribution |
US9106668B2 (en) * | 2008-06-24 | 2015-08-11 | Azureus Software, Inc. | Distributed peer location in peer-to-peer file transfers |
CN101394423B (zh) * | 2008-09-27 | 2012-07-18 | 中兴通讯股份有限公司 | 一种媒体定位、搜索方法和系统 |
-
2009
- 2009-04-01 CN CN200910132675A patent/CN101854374A/zh active Pending
-
2010
- 2010-03-19 WO PCT/CN2010/000335 patent/WO2010111887A1/zh active Application Filing
- 2010-03-19 US US13/124,770 patent/US20110307564A1/en not_active Abandoned
- 2010-03-19 JP JP2011541075A patent/JP5259835B2/ja not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020178261A1 (en) * | 2001-05-25 | 2002-11-28 | Chang Frederic Robert | Method of improving the reliability of peer-to-peer network downloads |
CN1816053A (zh) * | 2006-03-10 | 2006-08-09 | 清华大学 | 基于会话初始化协议的流媒体直播p2p网络方法 |
CN101005606A (zh) * | 2006-12-31 | 2007-07-25 | 华为技术有限公司 | 一种减少媒体播放延时的方法和装置 |
CN101552719A (zh) * | 2008-04-01 | 2009-10-07 | 华为技术有限公司 | 路由选择方法和装置 |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010277314A (ja) * | 2009-05-28 | 2010-12-09 | Kddi Corp | P2p配信方法およびシステム |
Also Published As
Publication number | Publication date |
---|---|
JP5259835B2 (ja) | 2013-08-07 |
US20110307564A1 (en) | 2011-12-15 |
JP2012512471A (ja) | 2012-05-31 |
CN101854374A (zh) | 2010-10-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2010111887A1 (zh) | 数据节点装置、对端信息获取方法和系统 | |
US10681167B2 (en) | Distributed computing resources in an information centric network | |
EP2420035B1 (en) | Method and apparatus for reducing traffic in a communications network | |
US10880390B2 (en) | Method and apparatus for reducing network resource transmission size using delta compression | |
US7782866B1 (en) | Virtual peer in a peer-to-peer network | |
JP4938074B2 (ja) | リソースの位置情報の要求方法、当該方法のためのユーザノードおよびサーバ | |
EP1593254B1 (en) | Methods and apparatus for traffic management in peer-to.peer networks | |
JP5050095B2 (ja) | P2pコンテンツ共有のための方法、システム、及びノード | |
US8032583B2 (en) | Apparatus and method for providing peer-to-peer proxy services in peer-to-peer communications | |
US20080080392A1 (en) | Virtual peer for a content sharing system | |
KR101215993B1 (ko) | 피어―투―피어 라이브 스트리밍을 위한 콘텐츠 분산 네트워크 | |
US20090299937A1 (en) | Method and system for detecting and managing peer-to-peer traffic over a data network | |
WO2008025297A1 (fr) | Procédé de téléchargement de fichiers selon la technique p2p (pair à pair) et système de téléchargement p2p | |
US20140136644A1 (en) | Data storage management in communications | |
WO2012152771A2 (en) | Content server of a service provider's cdn | |
US7680130B2 (en) | Method for finding resource and service in network and relay node apparatus | |
Abdallah et al. | Ftree-CDN: Hybrid CDN and P2P architecture for efficient content distribution | |
US20080288447A1 (en) | Methods and apparatus for improving peer efficiency | |
JP2010182301A (ja) | 自己組織型分散オーバーレイ・ネットワークにおいてオブジェクトへの参照を分散させる方法、コンピュータプログラム、及びノード、並びに自己組織型分散オーバーレイ・ネットワーク | |
Moon et al. | A point-based inventive system to prevent free-riding on p2p network environments | |
KR101006539B1 (ko) | 파일 병렬 다운로드에서의 최대 빈도 블록 우선 선택 방법,이를 이용한 파일 병렬 다운로드 방법 및 이를 구현하기 위한 프로그램을 기록한 기록매체 | |
KR101073659B1 (ko) | 네트워크 혼잡 감소를 위하여 파일을 투명하게 내려받기 위한 방법 | |
Dubouilh et al. | Performance of WebRTC in the context of a decentralised storage solution | |
Oberender et al. | P2P Replication Revisited: Mobile Infrastructures | |
US20110035509A1 (en) | System and Method for High Speed transfer of Files over a Network |
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: 10757990 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13124770 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2011541075 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 10757990 Country of ref document: EP Kind code of ref document: A1 |