WO2018068635A1 - 调度方法、服务器、第一对等节点及计算机可读存储介质 - Google Patents

调度方法、服务器、第一对等节点及计算机可读存储介质 Download PDF

Info

Publication number
WO2018068635A1
WO2018068635A1 PCT/CN2017/103474 CN2017103474W WO2018068635A1 WO 2018068635 A1 WO2018068635 A1 WO 2018068635A1 CN 2017103474 W CN2017103474 W CN 2017103474W WO 2018068635 A1 WO2018068635 A1 WO 2018068635A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
candidate
network address
information
network
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2017/103474
Other languages
English (en)
French (fr)
Inventor
王静
王慧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
Research Institute of China Mobile Communication Co Ltd
Original Assignee
Research Institute of China Mobile Communication Co Ltd
China Mobile Communications Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Research Institute of China Mobile Communication Co Ltd, China Mobile Communications Corp filed Critical Research Institute of China Mobile Communication Co Ltd
Priority to US16/324,954 priority Critical patent/US11706471B2/en
Publication of WO2018068635A1 publication Critical patent/WO2018068635A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/239—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests
    • H04N21/2393—Interfacing the upstream path of the transmission network, e.g. prioritizing client content requests involving handling client requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1021—Server selection for load balancing based on client or server locations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • 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/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1076—Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/632—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices

Definitions

  • the present invention relates to a Content Delivery Network (CDN), and more particularly to a scheduling method, a server, a first peer to peer (P2P, Peer to Peer) node, and a computer readable storage medium.
  • CDN Content Delivery Network
  • the peer-to-peer connection content distribution network (P2P CDN, Peer to Peer CDN) technology is a new CDN technology that utilizes user equipment as a CDN content service edge node to serve other users.
  • the core idea of the P2PCDN is to use the user resources to implement the content distribution service between the user devices by using the user terminal devices that are equal to each other, that is, the different user devices serve as different P2P nodes to provide video service requests for other user devices.
  • Video content distribution service which is different from the client/server (C/S) transport model of the traditional CDN that serves the video service request of the user equipment by the content service edge node server.
  • the scheduling server (node tracker server) of the P2P CDN system retrieves the neighboring area where the user A is located when the user A requests to acquire a certain content (for example, the same broadband remote access server) (BRAS, Broadband Remote Access Server)
  • BRAS Broadband Remote Access Server
  • the scheduling server will estimate the distance between the P2P nodes according to the degree of approximation of the IP address of the protocol (IP, Internet Protocol) between different P2P node networks.
  • IP Internet Protocol
  • an embodiment of the present invention provides a scheduling method, a server, a first P2P node, and a computer readable storage medium.
  • the embodiment of the invention provides a scheduling method, which is applied to a server, and the method includes:
  • the first request includes a service content
  • the location information is location information generated based on a network topology
  • the at least one candidate P2P node Generating, by the at least one candidate P2P node, a candidate P2P node information list; the P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node;
  • At least one candidate P2P node is determined for the first P2P node by using at least one network address supported by the first P2P node and the service content.
  • the determining, by the first P2P node, the at least one candidate P2P node by using the at least one network address and the service content supported by the first P2P node including:
  • the method further includes:
  • Each network address of the first P2P node and the network address of the corresponding candidate P2P node are network addresses of the same network level.
  • the method when the information list is generated, the method further includes:
  • the network address of the candidate P2P node corresponding to each network address supported by the first P2P node is performed according to a sorting manner from the near-to-far transmission distance of the first P2P node. Sort.
  • the method before the receiving the first request of the first P2P node, the method further includes:
  • the location information of the first P2P node is obtained from the network topology information management device.
  • the embodiment of the invention further provides a scheduling method, which is applied to a first P2P node, and the method includes:
  • the server Receiving, by the server, the list information returned by the server; the P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node;
  • the second P2P node is capable of providing a service for the first P2P node
  • the service content is obtained from the second P2P node for presentation.
  • the list information includes a network address of a candidate P2P node corresponding to each network address supported by the first P2P node; each network address of the first P2P node and a network address of the corresponding candidate P2P node Network address at the same network level;
  • the selecting, according to the list information, the second P2P node from the list information includes:
  • the network address of the second P2P node is used to communicate with the second P2P node to acquire the service content.
  • a network address of a candidate P2P node corresponding to each network address supported by the first P2P node is sorted by a transmission distance between the candidate P2P node and the first P2P node. Sorting from near to far;
  • the second P2P node is selected according to a sorting manner of network addresses of candidate P2P nodes corresponding to each network address supported by the first P2P node in the information list.
  • the method further includes:
  • the embodiment of the invention further provides a server, including:
  • a first receiving unit configured to receive a first request of the first P2P node; the first request includes a service content;
  • a determining unit configured to determine, by using the location information of the first P2P node at different network levels, the service content, to determine at least one candidate P2P node for the first P2P node; One less candidate P2P node can provide service for the first P2P node; the location information is location information generated based on a network topology;
  • a generating unit configured to generate a candidate P2P node information list by using the at least one candidate P2P node; and P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node ;
  • the first sending unit is configured to return the information list to the first P2P node.
  • the determining unit is configured to: determine, by using the at least one network address supported by the first P2P node, the service content, at least one candidate P2P node for the first P2P node.
  • the determining unit is configured to:
  • the generating unit is configured to:
  • Each network address of the first P2P node and the network address of the corresponding candidate P2P node are network addresses of the same network level.
  • the generating unit is further configured to, in the information list, each of the first P2P nodes supported according to a sorting manner from a near distance to a first P2P node.
  • the network addresses of the candidate P2P nodes corresponding to the network address are sorted.
  • the server further includes:
  • the first obtaining unit is configured to acquire the location information of the first P2P node from the network topology information management device after the first P2P node is online.
  • the embodiment of the invention further provides a first P2P node, including:
  • a second sending unit configured to send a first request to the server; the first request includes service content; the first request is used to request, to the server, candidate P2P node list information that can provide the service content;
  • a second receiving unit configured to receive the list information returned by the server; and the P2P node information in the information list represents a transmission distance between the at least one candidate P2P node and the first P2P node;
  • a selecting unit configured to select a second P2P node from the list information according to the list information; and the second P2P node is configured to provide a service for the first P2P node;
  • the second obtaining unit is configured to acquire the service content from the second P2P node for presentation.
  • the list information includes a network address of a candidate P2P node corresponding to each network address supported by the first P2P node; each network address of the first P2P node and a network address of the corresponding candidate P2P node Network address at the same network level;
  • the selecting unit is configured to: select the second P2P node according to a network address of a candidate P2P node corresponding to each network address;
  • the network address of the second P2P node is used to communicate with the second P2P node to acquire the service content.
  • the selecting unit is further configured to: when the service content needs to be acquired from the at least two candidate P2P nodes, obtain the network addresses of the at least two candidate P2P nodes from the information list;
  • the second obtaining unit is configured to communicate with the at least two P2P nodes based on the acquired network address to obtain the service content.
  • the embodiment of the invention further provides a computer readable storage medium, on which a computer program is stored, and when the computer program is executed by the processor, the steps of any method on the server side are implemented. Or the step of the method of any one of the foregoing first P2P nodes is implemented.
  • the server receives the first request of the first P2P node; the first request includes the service content; and the first P2P node is used by Position information of the different network levels, the service content, determining at least one candidate P2P node for the first P2P node; the at least one candidate P2P node capable of providing service for the first P2P node; the location information is based on Location information generated by the network topology; generating, by using the at least one candidate P2P node, a candidate P2P node information list; and the P2P node information in the information list characterizing the at least one candidate P2P node and the first P2P node a transmission distance between the two P2P nodes; and the first P2P node selects a second P2P node from the list information according to the list information; the second P2P node is capable of The first P2P node provides
  • FIG. 1 is a schematic diagram of a P2P CDN system architecture in the related art
  • FIG. 2 is a schematic flowchart of a scheduling method on a server side according to an embodiment of the present invention
  • FIG. 3 is a schematic flowchart of a scheduling method on a first P2P node side according to an embodiment of the present invention
  • FIG. 4 is a schematic flowchart of a method for scheduling a P2P node according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of a network topology structure and a routing path according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a server according to an embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a first P2P node according to an embodiment of the present invention.
  • Figure 1 is a schematic diagram of the P2P CDN system architecture. As can be seen from Figure 1, in the P2P CDN system, it mainly includes the policy center and the Tracker server. among them,
  • the policy center provides configuration functions for various policies involved in the P2P CDN system, including content pre-push policy management and tracker scheduling policy management.
  • the Tracker server implements the global control and scheduling function of the P2P CDN system and is a unified portal server for terminal users to access.
  • the Tracker server maintains the IP address and port number information of all downloaders of the file.
  • the Tracker server periodically performs content pre-pushing, and returns when a certain user equipment requests to acquire a certain video content. A list of P2P nodes that provide distribution services for this content.
  • the business process of the user acquiring the video content service in the P2P CDN system in the related art includes:
  • Step A The user X selects a video program A to be watched through a video player on a device such as a personal computer (PC, Personal Computer) or a set top box; at the same time, the P2P node X registers with the Tracker server to notify the server that the user has gone online;
  • a device such as a personal computer (PC, Personal Computer) or a set top box
  • Step B User P's P2P node X (at this time, as a receiver of the video service) requests the Tracker server for a list of other P2P nodes (video service providers) that can provide the current content A distribution service;
  • Step C After receiving the request of the P2P node X, the Tracker server (scheduling center) integrates the P2P node information collected by itself (whether there is storage content A, service capability, etc.), and the distance information between the P2P node and the P2P node X. Returning to P2P node X a list of information of several candidate P2P nodes that can serve it, for each P2P node in the list, the information includes the IP address (required) and port (optional) information of the P2P node Wait.
  • Step D The P2P node X connects to other P2P nodes according to the P2P node list information. Obtaining data fragments of the video content, obtaining a video content service, and playing the video content for the user after obtaining the video content.
  • step C in order to generate a list of information, the Tracker server needs to determine as accurately as possible which P2P nodes are closest to the P2P node X.
  • the closest distance refers to the minimum delay of data transmission when other P2P nodes perform content distribution services to the P2P node X, and the delay includes: the transmission duration of other network devices through which the transmitted data passes, and the network devices. The length of time required to transfer data.
  • the P2P operator first estimates the distance of the P2P node according to the approximate degree of the network address of different P2P nodes, and then verifies the test data by transmitting the test data between the P2P nodes. And monitor the actual size of the distance (delay size).
  • the network operator will be in a specific area (such as a local area of a certain city area) due to the limitation of the number of network IP addresses. All gateway devices in the metropolitan area network or a certain BRAS device are assigned private IP addresses. These gateway devices share a small number of public IP addresses through Network Address Translation (NAT).
  • NAT Network Address Translation
  • the P2P operator speculates that the distance between different nodes is not accurate. This is because when NAT is used to assign different IP addresses to each area, it is not a regular split address, so the address is The degree of approximation does not necessarily represent the distance between the addresses; it takes a long time to transmit the test data, and increases the overhead of the network transmission data; the actual size of the monitoring distance (delay size) and other methods only data It can be carried out after the transmission starts, and the efficiency is low.
  • the server receives the first request of the first P2P node; the first request includes service content; utilizing location information of the first P2P node at different network levels, the a service content, determining, by the first P2P node, at least one candidate P2P node; the at least one candidate P2P node being capable of providing service to the first P2P node; the location information being location information generated based on a network topology; Generating, by the at least one candidate P2P node, a candidate P2P node information list; the P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node; a P2P node returns the information list; and the first P2P node selects a second P2P node from the list information according to the list information; the second P2P node is capable of providing a service for the first P2P node;
  • the service content is obtained from the
  • the embodiment of the present invention further provides a scheduling method, which is applied to a server, and specifically, may be a Tracker server. As shown in FIG. 2, the method includes the following steps:
  • Step 201 Receive a first request of the first P2P node.
  • the first request includes service content.
  • the service content may be multimedia content, such as video content.
  • the method may further include:
  • the location information of the first P2P node is obtained from the network topology information management device.
  • the network topology information management device may be an existing network routing device in the network, such as a router, a Layer 2 switch, or a NAT device, or may be newly added to obtain network topology information. device.
  • Step 202 Determine, by using the location information of the first P2P node in different network areas, the service content, to determine at least one candidate P2P node for the first P2P node;
  • the at least one candidate P2P node can provide a service for the first P2P node;
  • the location information is location information generated based on a network topology.
  • the server has previously collected each P2P node information, including stored content, service capability, etc., according to which the server determines a candidate P2P node for the first P2P node.
  • a carrier When a carrier conducts a P2P service, it can set up a network that is connected to the same optical line terminal (OLT, Optical Line Terminal) or the same NAT device and assigned a private network address according to the network topology and network configuration capabilities that the carrier has.
  • the device routes through the local address (private network address) under the device.
  • the data between each other can be transited through the route of the device, and each other can also access each other through the private network address, so as to achieve the purpose of minimizing the transmission delay when accessing each other through the private network address.
  • the location information of the first P2P node at different network levels may be characterized by network addresses of different network levels.
  • the network address is the network address of the first P2P node in different network layer protocols.
  • the network address may include a public network address, a private network address under the NAT device, a Layer 2 intranet address under different devices, and three layers. Web address, etc. According to different network addresses, location information of the first P2P node at different network levels may be known.
  • this step may include:
  • At least one candidate P2P node is determined for the first P2P node by using at least one network address supported by the first P2P node and the service content.
  • the server determines, based on the service content, at least one at least one P2P node capable of serving the first P2P node;
  • the server selects, from the determined at least one P2P node, a P2P node that is closest to the first P2P node transmission distance (route jump distance) as a candidate P2P node corresponding to the network address.
  • the transmission distance refers to an indicator of the cost of transmitting data between two network locations. In practical applications, the indicator should consider the transmission delay and link bandwidth between network locations. Factors such as traffic costs and traffic engineering strategies.
  • Step 203 Generate a candidate P2P node information list by using the at least one candidate P2P node.
  • the P2P node information in the information list characterizes a transmission distance between the at least one candidate P2P node and the first P2P node.
  • the server is for each network address supported by the first P2P node, Filling in the information list of the candidate P2P node corresponding to the network address;
  • Each network address of the first P2P node and the network address of the corresponding candidate P2P node are network addresses of the same network level.
  • the server selects each network address supported by the first P2P node according to a sorting manner from the first to the far distance of the first P2P node.
  • the network addresses of the corresponding candidate P2P nodes are sorted, so that the first P2P node selects a corresponding candidate P2P node according to the sorting manner.
  • the P2P node information in the generated candidate P2P node information list in the embodiment of the present invention represents the transmission distance between the at least one candidate P2P node and the first P2P node, and the information represented by the information
  • the manner may be explicit or implied; accordingly, the information of the provided transmission distance may be explicit or specific, or may be relative or ambiguous.
  • the manner in which the information is represented, the manner of providing relative or fuzzy transmission distance information including but not limited to: determining which candidate P2P node and the first P2P node are in accordance with the sequence of the plurality of P2P nodes in the P2P node information table.
  • the transmission distance between them is relatively closer or further; or, the candidate P2P nodes in the P2P node information list have been filtered through a predetermined screening criterion involving the transmission distance, so that a certain P2P node is listed in the P2P node.
  • This objective situation in the information list itself indicates that the P2P node meets the predetermined distance in the transmission distance.
  • the filtering criteria of the transmission distance the P2P node is available for candidates.
  • Step 204 Return the information list to the first P2P node.
  • the embodiment of the present invention further provides a scheduling method, which is applied to a first P2P node.
  • the method includes the following steps:
  • Step 301 Send a first request to the server.
  • the first request includes service content; the first request is for requesting, from the server, candidate P2P node list information capable of providing the service content.
  • Step 302 Receive the list information returned by the server.
  • the P2P node information in the information list represents a transmission distance (route jump distance) between at least one candidate P2P node and the first P2P node.
  • the transmission distance refers to an indicator of the cost of transmitting data between two network locations.
  • the indicator should consider factors such as transmission delay, link bandwidth, traffic cost, and traffic engineering strategy between network locations.
  • Step 303 Select a second P2P node from the list information according to the list information.
  • the second P2P node is capable of serving the first P2P node, and may be a candidate P2P node that is the closest to the first P2P node.
  • the second P2P node may also be one of a plurality of candidate P2P nodes with a relatively short transmission distance.
  • the user accessing the Internet access device under the same OLT or through the same NAT device and having the private network address can be set locally through the device according to the network topology and the network configuration capability.
  • the address (private network address) is used for routing.
  • the data between each other can be transited through the route of the device, and each other can also access each other through the private network address, so as to achieve the purpose of minimizing the transmission delay when accessing each other through the private network address.
  • the transmission distance between the candidate P2P node and the first P2P node can be characterized by network addresses of different network levels.
  • the network addresses are network addresses of the first P2P node in different network layer protocols. These network addresses can include public network addresses, private network addresses under NAT devices, Layer 2 intranet addresses under different devices, and Layer 3 intranet addresses. According to different network addresses, location information of the first P2P node at different network levels may be known.
  • the list information includes a network address of a candidate P2P node corresponding to each network address supported by the first P2P node; each network address of the first P2P node and a corresponding candidate The network address of the P2P node is a network address of the same network level;
  • the first P2P selects the second P2P node according to a network address of a candidate P2P node corresponding to each network address;
  • the network address of the second P2P node is used to communicate with the second P2P node to perform step 304, that is, acquiring the service content.
  • the network address of the candidate P2P node corresponding to each network address supported by the first P2P node is sorted by the candidate P2P node and the first P2P node.
  • the first P2P node selects the second P2P node according to a sorting manner of network addresses of candidate P2P nodes corresponding to each network address supported by the first P2P node in the information list.
  • Step 304 Acquire the service content from the second P2P node for presentation.
  • the first P2P node may obtain a network address of the at least two candidate P2P nodes from the information list;
  • the server receives the first request of the first P2P node;
  • the first request includes service content; determining, by using the location information of the first P2P node at different network levels, the service content, at least one candidate P2P node for the first P2P node; the at least one candidate P2P node Providing a service for the first P2P node; the location information is location information generated based on a network topology; generating, by using the at least one candidate P2P node, a candidate P2P node information list; and a P2P node in the information list Information characterizing a transmission distance between the at least one candidate P2P node and the first P2P node; returning the information list to the first P2P node; and the first P2P node is from the list according to the list information Selecting a second P2P node in the information; the second P2P node is capable of providing service for the first P2P node; acquiring the service
  • this application embodiment describes in detail the process of P2P node scheduling.
  • the method for scheduling P2P nodes in this application embodiment, as shown in FIG. 4, includes the following steps:
  • Step 401 The user X selects a video program A that is desired to be viewed through a video player on a device such as a PC or a set-top box; at the same time, the P2P node X registers with the Tracker server, and informs the Tracker server that the server itself has gone online;
  • Step 402 After registration, the Tracker server obtains, according to the address information of the P2P node X, the network address of different network layers supported by the P2P node X and the area where each address is located, from the network topology information management device.
  • the network addresses are the network addresses of the first P2P nodes in different network layer protocols, and the network addresses may include a public network address, a private network address under the NAT device, a Layer 2 intranet address under different devices, and three Intranet address, etc.
  • Step 403 User P's P2P node X (at this time, as a receiver of the video service) requests the Tracker server to provide other P2P nodes (video service providers) that can provide the current content A distribution service. List
  • Step 404 After receiving the request of the P2P node X, the Track server (scheduling center) synthesizes the collected P2P node information (whether there is storage content A, service capability, etc.) for different network addresses supported by the P2P node X.
  • P2P node and P2P node X transmit distance information, calculate a P2P node that can serve P2P node X in each network address space, and select a P2P node that is closest to the P2P node X transmission distance as the P2P node corresponding to the network address. And filling in the network address of the selected P2P node into the information list, so that in the information list, the network address of the P2P node for different network addresses supported by the P2P node X is included.
  • the network address supported by the P2P node X includes the public network address, the private network address under the NAT device, the Layer 2 intranet address under different devices, and the Layer 3 intranet address.
  • For the private network address of the NAT device select the P2P node with the closest transmission distance as the P2P node corresponding to the public network address, and fill in the network address (private network address) of the selected P2P node to the information list;
  • the P2P node with the closest transmission distance is selected as the P2P node corresponding to the public network address, and the network address (the second layer intranet address) of the selected P2P node is filled in the information list;
  • the P2P node with the closest transmission distance is selected as the P2P node corresponding to the public network address, and the network address (the three-layer intranet address) of the selected P2P node is filled in the information list.
  • the closest transmission distance can be considered as the routing distance closest, the routing distance is the shortest, and the data transmission delay is the smallest.
  • the transmission distance refers to an indicator of the cost of transmitting data between two network locations.
  • the indicator should consider factors such as transmission delay, link bandwidth, traffic cost, and traffic engineering strategy between network locations.
  • the transmission distances of the various types of addresses are from far to near (that is, the order of the candidate P2P nodes): the public network address, the private network address under the NAT device, the second layer internal network address, and the third layer. Intranet address.
  • each P2P node in the list in addition to the network address of the P2P node, there may be port information (optional) or the like.
  • Step 405 Return, to the P2P node X, a list of information of a plurality of candidate P2P nodes for which the service can be served;
  • Step 406 The P2P node connects to other P2P nodes according to the P2P node list information, requests to obtain the data fragment of the video content, obtains the video content service, and plays the video content for the user after acquiring the video content.
  • the P2P node X when communicating with each P2P node as a service node, the P2P node X communicates with a network address that characterizes the closest transmission distance.
  • the P2P node X can also communicate concurrently with different P2P nodes to obtain video content.
  • different network addresses and respective routes can be used respectively, thereby optimizing transmission routing, reducing the burden on the network device, and shortening the transmission delay.
  • the user can obtain video content through the routing path 1, and the network address used for communication in the process is a public network address.
  • the user can also obtain the video content through the routing path 2.
  • the address used for communication is the private network address under the NAT device, and the user can also obtain the video content through the routing path 3.
  • the address used for communication is under the OLT device.
  • the Layer 2 intranet address allows the user to select different routing paths to obtain video content according to needs (network signal strength, routing path length, connection establishment, etc.).
  • the Track server does not support according to the P2P node.
  • the distance between the same network address (public network address, private network address under the NAT device, Layer 3 and Layer 2 intranet addresses under different devices, etc.), and the transmission distance with other P2P nodes is calculated in each spatial distance.
  • the routing scheduling mechanism is optimized to select the optimal route for transmitting video data between P2P nodes, so as to implement scheduling management for each P2P node according to different address distance spaces that may belong to each P2P node.
  • the network address with the closest transmission distance is used to communicate between different P2P nodes, and different network addresses and respective routes are used to shorten the transmission delay.
  • the content transmission path between the local P2P node and the peer P2P node can be determined according to the network topology structure and the location of the peer P2P node, thereby improving the accuracy of determining the routing distance, thereby Flexible implementation of multiple routing transmission paths for the same P2P node, optimized transmission routing, and reduced network equipment burden.
  • the optimal P2P transmission path is selected, the transmission delay is shortened, the user experience is improved, and the network transmission bandwidth is saved.
  • the embodiment of the present invention provides a server, specifically a Tracker server. As shown in FIG. 6, the server includes:
  • the first receiving unit 61 is configured to receive a first request of the first P2P node; the first request includes a service content;
  • the determining unit 62 is configured to determine, by using the location information of the first P2P node at different network levels, the service content, at least one candidate P2P node for the first P2P node; Said at least one candidate P2P node capable of providing service to said first P2P node; said location information being location information generated based on a network topology;
  • a generating unit 63 configured to generate a candidate P2P node information list by using the at least one candidate P2P node; and P2P node information in the information list characterizing transmission between the at least one candidate P2P node and the first P2P node distance;
  • the first sending unit 64 is configured to return the information list to the first P2P node.
  • the service content may be multimedia content, such as video content.
  • the server may further include:
  • the first obtaining unit is configured to acquire the location information of the first P2P node from the network topology information management device after the first P2P node is online.
  • the network topology information management device may be an existing network routing device in the network, such as a router, a Layer 2 switch, or a NAT device, or may be newly added to obtain network topology information. device.
  • the server has previously collected each P2P node information, including stored content, service capability, etc., according to which the determining unit 62 determines a candidate P2P node for the first P2P node.
  • the user's Internet access device under the same OLT or through the same NAT device and assigned a private network address can be set to the local address under the device according to the network topology and network configuration capabilities of the operator. Private network address) to route.
  • the data between each other can be transited through the route of the device, and each other can also access each other through the private network address, so as to achieve the purpose of minimizing the transmission delay when accessing each other through the private network address.
  • the location information of the first P2P node at different network levels may be characterized by network addresses of different network levels.
  • the network address is the network address of the first P2P node in different network layer protocols.
  • the network address may include a public network address, a private network address under the NAT device, a Layer 2 intranet address under different devices, and three layers. Web address, etc. According to different network addresses, you can know the above Location information of a P2P node at different network levels.
  • the determining unit 62 is specifically configured to:
  • At least one candidate P2P node is determined for the first P2P node by using at least one network address supported by the first P2P node and the service content.
  • the determining unit 62 determines at least one at least one P2P node capable of serving the first P2P node based on the service content;
  • the determining unit 62 selects, from the determined at least one P2P node, a P2P node that is closest to the first P2P node transmission distance routing jump distance as a candidate P2P node corresponding to the network address;
  • the generating unit 63 is specifically configured to:
  • Each network address of the first P2P node and the network address of the corresponding candidate P2P node are network addresses of the same network level.
  • the transmission distance refers to an indicator of the cost of transmitting data between two network locations.
  • the indicator should consider factors such as transmission delay, link bandwidth, traffic cost, and traffic engineering strategy between network locations.
  • the generating unit 63 is further configured to, in the information list, each of the first P2P nodes supported according to a sorting manner from a near distance to a first P2P node.
  • the network addresses of the candidate P2P nodes corresponding to the network addresses are sorted, so that the first P2P node selects the corresponding candidate P2P nodes according to the sorting manner.
  • the P2P node information in the generated candidate P2P node information list in the embodiment of the present invention represents the transmission distance between the at least one candidate P2P node and the first P2P node, and the information represented by the information
  • the manner may be explicit or implied, and accordingly, the information of the transmission distance provided may be explicit or specific, or may be relative or modular.
  • the manner in which the information is represented, the manner of providing relative or fuzzy transmission distance information including but not limited to: determining which candidate P2P node and the first P2P node are in accordance with the sequence of the plurality of P2P nodes in the P2P node information table.
  • the transmission distance between them is relatively closer or further; or, the candidate P2P nodes in the P2P node information list have been filtered through a predetermined screening criterion involving the transmission distance, so that a certain P2P node is listed in the P2P node.
  • This objective situation in the information list itself represents the information that the P2P node meets the predetermined screening criteria involving the transmission distance in the transmission distance, and the P2P node is available for candidates.
  • the first receiving unit 61, the first sending unit 64, and the first obtaining unit may be implemented by a communication chip in a server; the determining unit 62 and the generating unit 63 may be processed by a server.
  • a server Such as a central processing unit (CPU), a microprocessor (MCU, Micro Control Unit), a digital signal processor (DSP, Digital Signal Processor) or a programmable logic array (FPGA, Field-Programmable Gate Array), etc. achieve.
  • CPU central processing unit
  • MCU Micro Control Unit
  • DSP Digital Signal Processor
  • FPGA Field-Programmable Gate Array
  • the embodiment of the present invention further provides a first P2P node.
  • the node includes:
  • a second sending unit 71 configured to send a first request to the server; the first request includes service content; the first request is configured to request, to the server, candidate P2P node list information that can provide the service content;
  • the second receiving unit 72 is configured to receive the list information returned by the server; the P2P node information in the information list represents a transmission distance between the at least one candidate P2P node and the first P2P node (route jump) distance);
  • the selecting unit 73 is configured to select a second P2P node from the list information according to the list information; the second P2P node is configured to provide a service for the first P2P node;
  • the second obtaining unit 74 is configured to acquire the service content from the second P2P node for presentation.
  • the transmission distance refers to an indicator of the cost of transmitting data between two network locations.
  • the indicator should consider factors such as transmission delay, link bandwidth, traffic cost, and traffic engineering strategy between network locations.
  • the user's Internet access device under the same OLT or through the same NAT device and assigned a private network address can be set to the local address under the device according to the network topology and network configuration capabilities of the operator. Private network address) to route.
  • the data between each other can be transited through the route of the device, and each other can also access each other through the private network address, so as to achieve the purpose of minimizing the transmission delay when accessing each other through the private network address.
  • the transmission distance between the candidate P2P node and the first P2P node can be characterized by network addresses of different network levels.
  • the network address is the network address of the first P2P node in different network layer protocols.
  • the network address may include a public network address, a private network address under the NAT device, a Layer 2 intranet address under different devices, and three layers. Web address, etc. According to different network addresses, location information of the first P2P node at different network levels may be known.
  • the list information includes a network address of a candidate P2P node corresponding to each network address supported by the first P2P node; each network address of the first P2P node and a corresponding candidate The network address of the P2P node is a network address of the same network level;
  • the selecting unit 73 is specifically configured to: select the second P2P node according to a network address of a candidate P2P node corresponding to each network address;
  • the second obtaining unit 74 communicates with the second P2P node by using a network address of the second P2P node to acquire the service content.
  • the second node may be a candidate P2P node that is the closest to the first P2P node, and the second P2P node may also be one of multiple candidate P2P nodes with a relatively short transmission distance, and does not necessarily have to be Transfer the nearest P2P node.
  • the first P2P node supports The sorting manner of the network addresses of the candidate P2P nodes corresponding to each network address is a sorting manner in which the transmission distance between the candidate P2P node and the first P2P node is from near to far;
  • the selecting unit 73 selects the second P2P node according to a sorting manner of network addresses of candidate P2P nodes corresponding to each network address supported by the first P2P node in the information list.
  • the selecting unit 73 is further configured to: when the service content needs to be acquired from the at least two candidate P2P nodes, obtain the network address of the at least two candidate P2P nodes from the information list;
  • the second obtaining unit 74 is configured to communicate with the at least two P2P nodes based on the acquired network address to obtain the service content.
  • the second sending unit 71, the second receiving unit 72, and the second obtaining unit 74 may be implemented by a communication chip in the first P2P node, and the selecting unit 73 may be a processor such as a CPU in the first P2P node. , MCU, DSP or FPGA implementation.
  • the server receives the first request of the first P2P node; the first request includes the service content; and the location information of the first P2P node at different network levels, the service content, Determining, by the first P2P node, at least one candidate P2P node; the at least one candidate P2P node being capable of providing service to the first P2P node; the location information being location information generated based on a network topology; using the at least one a candidate P2P node, generating a candidate P2P node information list; the P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node; returning to the first P2P node Determining a list of information; and the first P2P node selects a second P2P node from the list information according to the list information; the second P2P node is capable of providing services for the first P2P node;
  • the P2P node selects a second P2
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • an embodiment of the present invention further provides a computer readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the server side is implemented.
  • a computer program is stored, and when the computer program is executed by a processor, the server side is implemented.
  • the embodiment of the present invention further provides a computer readable storage medium, on which a computer program is stored, and when the computer program is executed by the processor, the steps of any method on the first P2P node side are implemented.
  • the computer readable storage medium may be a magnetic random access memory (FRAM), a read only memory (ROM), a programmable read only memory (PROM, Programmable Read). -Only Memory), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Flash Memory (Flash) Memory, magnetic surface memory, optical disk, or CD-ROM (Compact Disc Read-Only Memory).
  • FRAM magnetic random access memory
  • ROM read only memory
  • PROM programmable read only memory
  • PROM programmable Read Only memory
  • EPROM Erasable Programmable Read-Only Memory
  • EEPROM Electrically Erasable Programmable Read-Only Memory
  • Flash Flash Memory
  • magnetic surface memory magnetic surface memory
  • optical disk or CD-ROM (Compact Disc Read-Only Memory).
  • the server receives the first request of the first P2P node; the first request includes the service content; and the location information of the first P2P node at different network levels, the service content, Determining, by the first P2P node, at least one candidate P2P node; the at least one candidate P2P node being capable of providing service to the first P2P node; the location information being location information generated based on a network topology; using the at least one a candidate P2P node, generating a candidate P2P node information list; the P2P node information in the information list characterizing a transmission distance between the at least one candidate P2P node and the first P2P node; returning to the first P2P node Determining a list of information; and the first P2P node selects a second P2P node from the list information according to the list information; the second P2P node is capable of providing services for the first P2P node;
  • the P2P node selects a second P2

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Databases & Information Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明公开了一种调度方法，包括：服务器接收第一对等(P2P)节点的第一请求；所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表。本发明同时还公开了一种服务器、第一P2P节点及计算机可读存储介质。

Description

调度方法、服务器、第一对等节点及计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为201610895287.8、申请日为2016年10月13日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本发明涉及内容分发网络(CDN，Content Delivery Network)，尤其涉及一种调度方法、服务器、第一对等(P2P，Peer to Peer)节点和计算机可读存储介质。
背景技术
对等连接内容分发网络(P2P CDN，Peer to Peer CDN)技术是利用用户设备作为CDN内容服务边缘节点为其他用户服务的新型CDN技术。P2PCDN的核心思想是利用用户资源，通过彼此身份对等的用户终端设备来实现用户设备彼此之间的内容分发服务，即由不同用户设备作为不同的P2P节点来为其他用户设备的视频服务请求提供视频内容分发服务，这不同于传统CDN的由内容服务边缘节点服务器为用户设备的视频服务请求提供服务的客户端/服务器(C/S)传输模型。
在P2P CDN技术的内容分发流程中，为了缩短一个P2P节点向另一个P2P节点服务时的传输时延，应尽可能选择最短的内容分发传输路径(路由)。举个例子来说，P2P CDN系统的调度服务器(节点追踪(Tracker)服务器)收到用户A请求获取某一内容时，检索到在用户A所处的邻近区域(例如，同一宽带远程接入服务器(BRAS，Broadband Remote Access Server) 设备下)中当前正好有其他P2P节点(可能不止一个)可以为其提供内容分发服务时，应优选这些P2P节点为用户A提供服务。
调度服务器会根据不同P2P节点网络之间互联的协议(IP，Internet Protocol)IP地址的近似程度来推测P2P节点之间的距离远近，然而这种推测不同节点的距离远近的方法是不精确的。
发明内容
为解决现有存在的技术问题，本发明实施例提供一种调度方法、服务器、第一P2P节点及计算机可读存储介质。
本发明实施例的技术方案是这样实现的：
本发明实施例提供了一种调度方法，应用于服务器，所述方法包括：
接收第一P2P节点的第一请求；所述第一请求包含服务内容；
利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；
利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
向所述第一P2P节点返回所述信息列表。
上述方案中，所述利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点，包括：
利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
上述方案中，所述利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点，包括：
针对所述第一P2P节点所支持的每个网络地址，基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
从确定的至少一个P2P节点选择与第一P2P节点传输距离最近的P2P节点作为对应网络地址的候选P2P节点；
相应地，生成信息列表时，所述方法还包括：
针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的候选P2P节点的网络地址填写至所述信息列表中；其中，
第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
上述方案中，生成所述信息列表时，所述方法还包括：
在所述信息列表中，按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序。
上述方案中，所述接收第一P2P节点的第一请求之前，所述方法还包括：
获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
本发明实施例还提供了一种调度方法，应用于第一P2P节点，所述方法包括：
向服务器发送第一请求；所述第一请求包含服务内容；所述第一请求用于向所述服务器请求能提供所述服务内容的候选P2P节点列表信息；
接收所述服务器返回的所述列表信息；所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；
从所述第二P2P节点获取所述服务内容，以进行呈现。
上述方案中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
相应地，所述根据所述列表信息，从所述列表信息中选择第二P2P节点，包括：
根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
相应地，利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，获取所述服务内容。
上述方案中，在所述信息列表中，所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式为候选P2P节点与所述第一P2P节点的传输距离从近至远的排序方式；
相应地，根据所述信息列表中第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式，选择所述第二P2P节点。
上述方案中，所述方法还包括：
当需要从至少两个候选P2P节点获取所述服务内容时，从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
本发明实施例又提供了一种服务器，包括：
第一接收单元，配置为接收第一P2P节点的第一请求；所述第一请求包含服务内容；
确定单元，配置为利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至 少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；
生成单元，配置为利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
第一发送单元，配置为向所述第一P2P节点返回所述信息列表。
上述方案中，所述确定单元，配置为：利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
上述方案中，所述确定单元，配置为：
针对所述第一P2P节点所支持的每个网络地址，基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
从确定的至少一个P2P节点选择与第一P2P节点传输距离最近的P2P节点作为对应网络地址的候选P2P节点；
所述生成单元，配置为：
针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的候选P2P节点的网络地址填写至所述信息列表中；其中，
第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
上述方案中，所述生成单元，还配置为在所述信息列表中，按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序。
上述方案中，所述服务器还包括：
第一获取单元，配置为获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
本发明实施例还提供了一种第一P2P节点，包括：
第二发送单元，配置为向服务器发送第一请求；所述第一请求包含服务内容；所述第一请求用于向所述服务器请求能提供所述服务内容的候选P2P节点列表信息；
第二接收单元，配置为接收所述服务器返回的所述列表信息；所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
选择单元，配置为根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；
第二获取单元，配置为从所述第二P2P节点获取所述服务内容，以进行呈现。
上述方案中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
所述选择单元，配置为：根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
相应地，利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，获取所述服务内容。
上述方案中，所述选择单元，还配置为当需要从至少两个候选P2P节点获取所述服务内容时，从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
所述第二获取单元，配置为基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
本发明实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现上述服务器侧任一方法的步骤， 或者实现上述第一P2P节点侧任一项方法的步骤。
本发明实施例提供的调度方法、服务器、第一P2P节点及计算机可读存储介质，服务器接收第一P2P节点的第一请求；所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表；而第一P2P节点根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；从所述第二P2P节点获取所述服务内容，以进行呈现，利用所述第一P2P节点在不同网络区域的位置信息来为第一P2P节点调度候选P2P节点，如此，能提高P2P节点之间传输距离(路由跳转距离)的确定精度，从而能有效地减小传输时延。
附图说明
在附图(其不一定是按比例绘制的)中，相似的附图标记可在不同的视图中描述相似的部件。附图以示例而非限制的方式大体示出了本文中所讨论的各个实施例。
图1为相关技术中P2P CDN系统架构示意图；
图2为本发明实施例服务器侧的调度方法流程示意图；
图3为本发明实施例第一P2P节点侧的调度方法流程示意图；
图4为本发明实施例P2P节点调度的方法流程示意图；
图5为本发明实施例网络拓扑结构及路由路径示意图；
图6为本发明实施例服务器结构示意图；
图7为本发明实施例第一P2P节点结构示意图。
具体实施方式
下面结合附图及实施例对本发明再作进一步详细的描述。
图1为P2P CDN系统架构示意图。从图1可以看出，在P2P CDN系统中，主要包括策略中心及Tracker服务器。其中，
策略中心提供对P2P CDN系统中涉及到的各项策略的配置功能，包括内容预推送策略管理、Tracker调度策略管理等。
Tracker服务器实现P2P CDN系统的全局控制与调度功能，是终端用户访问的统一入口服务器。Tracker服务器维护文件所有下载者的IP地址和端口号信息，在机顶盒终端P2P节点启动后且处于空闲状态时Tracker服务器定期进行内容预推送，以及在某一用户设备请求获取某个视频内容时返回可提供该内容的分发服务的P2P节点列表。
相关技术中P2P CDN系统中用户获取视频内容服务的业务流程包括：
步骤A：用户X通过个人电脑(PC，Personal Computer)或机顶盒等设备上的视频播放器选择期望观看某一个视频节目A；同时，P2P节点X注册到Tracker服务器上，告知服务器自身已上线；
步骤B：用户X的P2P节点X(此时作为视频服务的接收方)向Tracker服务器请求可提供当前内容A分发服务的其他P2P节点(视频服务提供方)列表；
步骤C：Tracker服务器(调度中心)收到P2P节点X的请求后，综合自身采集的P2P节点信息(是否有存储内容A、服务能力等)，以及这些P2P节点与P2P节点X的距离远近信息，向P2P节点X返回可为其提供服务的若干个候选P2P节点的信息列表，对于列表中的每个P2P节点，其信息中包括有该P2P节点的IP地址(必需)和端口(可选)信息等。
步骤D：P2P节点X根据P2P节点列表信息，连接到其他P2P节点请 求获取该视频内容的数据分片，获得视频内容服务，并在获取到视频内容后为用户播放视频内容。
从上面的描述中可以看出，在步骤C中，为了生成信息列表，Tracker服务器需要尽可能准确地判断出哪些P2P节点与P2P节点X的距离最近。这里，所述距离最近是指其他P2P节点向P2P节点X进行内容分发服务时数据传输的时延最小，而这一时延包含：发送的数据所经过的其他网络设备的传输时长，以及这些网络设备中转数据所需的时长。
一般来说，在不掌握网络拓扑结构的情况下，P2P运营方会先根据不同P2P节点网络地址的近似程度来推测P2P节点的距离远近，然后再通过P2P节点之间传输测试数据的方式来验证和监测距离的实际大小(时延大小)。然而，网络运营商在为用户上网设备(家庭网关及其下连的PC、机顶盒等设备)分配IP地址时，由于网络IP地址数量的限制，会在特定区域内(如某一城市区域的本地城域网中或某一BRAS设备下)所有网关设备都分配私网IP地址，这些网关设备通过网络地址转换(NAT，Network Address Translation)技术对外共享少数公网IP地址。
这样，采用上述方案时，P2P运营方推测不同节点的距离远近的方法并不精确，这是因为：通过NAT技术为各个区域分配不同IP地址使用时，并不是有规律的切分地址，因此地址的近似程度并不一定就代表地址之间的距离远近；而通过传输测试数据的方式验证需要较长时间，且增加网络传输数据的开销；监测距离的实际大小(延时大小)等方法只有数据传输开始后才可以进行，效率较低。
另外，采用上述方案时，当用户上网设备运行P2P应用，且互相作为P2P节点提供服务时，彼此之间仅可以使用公网IP地址通信，因此即使两个设备在同一个光线路终端(OLT，Optical Line Terminal)或BRAS设备下时，也需要路由绕至OLT或BRAS设备迂回后才能彼此通信，增加了传输 路由距离(传输成本)和延时。
基于此，在本发明的各种实施例中：服务器接收第一P2P节点的第一请求；所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表；而第一P2P节点根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；从所述第二P2P节点获取所述服务内容，以进行呈现。
本发明实施例还提供一种调度方法，应用于服务器，具体来说，可以是Tracker服务器。如图2所示，该方法包括以下步骤：
步骤201：接收第一P2P节点的第一请求；
这里，所述第一请求包含服务内容。
其中，所述服务内容可以是多媒体内容，比如视频内容等。
在一实施例中，执行本步骤之前，该方法还可以包括：
获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
其中，实际应用时，所述网络拓扑信息管理设备可以是网络中已有的网络路由设备，比如：路由器、二层交换机、或NAT设备等，也可以是新增的、能够获得网络拓扑信息的设备。
步骤202：利用所述第一P2P节点在不同网络区域的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；
这里，所述至少一个候选P2P节点能为所述第一P2P节点提供服务； 所述位置信息为基于网络拓扑结构而生成的位置信息。
其中，所述服务器预先已采集各P2P节点信息，包含存储的内容，服务能力等，据此，所述服务器为所述第一P2P节点确定候选P2P节点。
运营商开展P2P业务时，可以根据运营商掌握的网络拓扑结构和网络配置能力，设置在同一个光线路终端(OLT，Optical Line Terminal)下或经同一NAT设备且分配了私网地址的用户上网设备经由该设备下的本地地址(私网地址)来进行路由。此时，彼此之间的数据可以通过该设备的路由中转，彼此之间也可以通过私网地址互相访问，以达到通过私网地址互相访问时传输时延最小的目的。
因此实际应用时，所述第一P2P节点在不同网络层级的位置信息可以用不同网络层级的网络地址来表征。
这些网络地址是所述第一P2P节点在不同网络层级协议中的网络地址，这些网络地址可以包含公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址等。根据不同的网络地址，可以获知所述第一P2P节点在不同网络层级的位置信息。
基于此，本步骤的具体实现可以包括：
利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
更具体地，针对所述第一P2P节点所支持的每个网络地址，所述服务器基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
所述服务器从确定的至少一个P2P节点选择与第一P2P节点传输距离(路由跳转距离)最近的P2P节点作为对应网络地址的候选P2P节点。
其中，所述传输距离是指：两个网络位置之间传输数据的代价的指标。实际应用时，该指标应该综合考虑网络位置之间的传输时延、链路带宽、 流量费用以及流量工程策略等因素。
步骤203：利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；
这里，所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离。
当采用不同网络层级的网络地址来表征所述第一P2P节点在不同网络层级的位置信息时，生成所述信息列表时，所述服务器针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的候选P2P节点的网络地址填写至所述信息列表中；其中，
第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
这里，实际应用时，在所述信息列表中，所述服务器按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序，以便所述第一P2P节点根据排序方式来选择对应的候选P2P节点。
这里，实际应用时，本发明实施例所述生成候选P2P节点信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离，所指的信息表征的方式可以是明示的，也可以是暗示的；相应地，所提供的传输距离的信息可以是明确或具体的，也可以是相对或模糊的。其中暗示的信息表征方式，提供相对或模糊的传输距离信息的方式，包括但不限于：依据多个P2P节点在P2P节点信息表中的前后顺序来确定哪个候选P2P节点与所述第一P2P节点之间的传输距离相对更近或更远；或者，P2P节点信息列表中的候选P2P节点，已经经由预定的涉及传输距离的筛选标准进行过筛选，从而某一P2P节点被列于所述P2P节点信息列表中这一客观情况本身就表征出了该P2P节点在传输距离上符合预定的涉 及传输距离的筛选标准这一信息，该P2P节点可供候选。
步骤204：向所述第一P2P节点返回所述信息列表。
相应地，本发明实施例还提供了一种调度方法，应用于第一P2P节点。如图3所示，该方法包括以下步骤：
步骤301：向服务器发送第一请求；
这里，所述第一请求包含服务内容；所述第一请求用于向所述服务器请求能提供所述服务内容的候选P2P节点列表信息。
步骤302：接收所述服务器返回的所述列表信息；
这里，所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离(路由跳转距离)。
其中，所述传输距离是指：两个网络位置之间传输数据的代价的指标。实际应用时，该指标应该综合考虑网络位置之间的传输时延、链路带宽、流量费用以及流量工程策略等因素。
步骤303：根据所述列表信息，从所述列表信息中选择第二P2P节点；
这里，所述第二P2P节点为能为所述第一P2P节点提供服务，可以是与所述第一P2P节点传输距离最近的候选P2P节点。当然，第二P2P节点也可以是传输距离较近的多个候选P2P节点之一。
其中，运营商开展P2P业务时，可以根据运营商掌握的网络拓扑结构和网络配置能力，设置在同一个OLT下或经同一NAT设备且分配了私网地址的用户上网设备经由该设备下的本地地址(私网地址)来进行路由。此时，彼此之间的数据可以通过该设备的路由中转，彼此之间也可以通过私网地址互相访问，以达到通过私网地址互相访问时传输时延最小的目的。
因此实际应用时，候选P2P节点与所述第一P2P节点之间的传输距离可以用不同网络层级的网络地址来表征。
这些网络地址是所述第一P2P节点在不同网络层级协议中的网络地址， 这些网络地址可以包含公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址等。根据不同的网络地址，可以获知所述第一P2P节点在不同网络层级的位置信息。
基于此，在一实施例中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
所述第一P2P根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
相应地，利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，以执行步骤304，即获取所述服务内容。
另外，实际应用时，在所述信息列表中，所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式为候选P2P节点与所述第一P2P节点的传输距离从近至远的排序方式；
相应地，所述第一P2P节点根据所述信息列表中第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式，选择所述第二P2P节点。
步骤304：从所述第二P2P节点获取所述服务内容，以进行呈现。
实际应用时，当需要从至少两个候选P2P节点获取所述服务内容时，所述第一P2P节点可以从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
这样，可以达到优化传输路由、减小网络设备负担、缩短传输时延的目的。
本发明实施例提供的调度方法，服务器接收第一P2P节点的第一请求； 所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表；而第一P2P节点根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；从所述第二P2P节点获取所述服务内容，以进行呈现，利用所述第一P2P节点在不同网络区域的位置信息来为第一P2P节点调度候选P2P节点，如此，能提高P2P节点之间传输距离(路由跳转距离)的确定精度，从而能有效地减小传输时延。
在上述实施例的基础上，本应用实施例详细描述P2P节点调度的过程。
本应用实施例P2P节点调度的方法，如图4所示，包括以下步骤：
步骤401：用户X通过PC或机顶盒等设备上的视频播放器选择期望观看某一个视频节目A；同时，P2P节点X注册到Tracker服务器上，告知Tracker服务器自身已上线；
步骤402：注册后，Tracker服务器将根据P2P节点X的地址信息，从网络拓扑信息管理设备获取P2P节点X所支持的不同网络层级的网络地址以及各个地址所处的区域；
这里，这些网络地址是所述第一P2P节点在不同网络层级协议中的网络地址，这些网络地址可以包含公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址等。
步骤403：用户X的P2P节点X(此时作为视频服务的接收方)向Tracker服务器请求可提供当前内容A分发服务的其他P2P节点(视频服务提供方) 列表；
步骤404：Track服务器(调度中心)收到P2P节点X的请求后，针对P2P节点X所支持的不同的网络地址，综合其采集的P2P节点信息(是否有存储内容A、服务能力等)，这些P2P节点与P2P节点X的传输距离远近信息，计算在各网络地址空间内可为P2P节点X服务的P2P节点，从中选择与P2P节点X传输距离最邻近的P2P节点作为该网络地址对应的P2P节点，并将选择的P2P节点的网络地址填写到信息列表中，从而在信息列表中，包含针对P2P节点X所支持的不同网络地址的P2P节点的网络地址。
举个例子来说，假设P2P节点X所支持的网络地址包括公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址。
那么，针对公网地址，选择传输距离最邻近的P2P节点作为公网地址对应的P2P节点，并将选择的P2P节点的网络地址(公网地址)填写到信息列表；
针对NAT设备下的私网地址，选择传输距离最邻近的P2P节点作为公网地址对应的P2P节点，并将选择的P2P节点的网络地址(私网地址)填写到信息列表；
针对二层内网地址，选择传输距离最邻近的P2P节点作为公网地址对应的P2P节点，并将选择的P2P节点的网络地址(二层内网地址)填写到信息列表；
针对三层内网地址，选择传输距离最邻近的P2P节点作为公网地址对应的P2P节点，并将选择的P2P节点的网络地址(三层内网地址)填写到信息列表。
从上面的描述中可以看出，所述传输距离最邻近可以认为是路由距离最邻近，路由距离最短、数据传输时延最小。
其中，所述传输距离是指：两个网络位置之间传输数据的代价的指标。 实际应用时，该指标应该综合考虑网络位置之间的传输时延、链路带宽、流量费用以及流量工程策略等因素。
另外，在信息列表中，各类地址的传输距离从远到近排序(即各候选P2P节点的排序方式)为：公网地址、NAT设备下的私网地址、二层内网地址、三层内网地址。
这里，对于列表中的每个P2P节点，除了有该P2P节点的网络地址外，还可以有端口信息(可选)等。
步骤405：向P2P节点X返回可为其提供服务的若干个候选P2P节点的信息列表；
步骤406：P2P节点根据P2P节点列表信息，连接到其他P2P节点请求获取该视频内容的数据分片，获得视频内容服务，并在获取到视频内容后为用户播放视频内容。
其中，与各作为服务节点的P2P节点通信时，将P2P节点X采用与表征最近传输距离的网络地址来通信。
另外，P2P节点X还可以与不同P2P节点并发通信，以获得视频内容，此时，可以分别使用不同的网络地址和各自的路由，进而优化传输路由、减小网络设备负担，缩短传输时延。
当采用本发明实施例的方案时，在图5所示的网络拓扑结构下，通过Tracker服务器的调度后，用户可以通过路由路径1获得视频内容，该过程中通信使用的网络地址为公网地址，用户还可以通过路由路径2获得视频内容，该过程中通信使用的地址为NAT设备下的私网地址，用户也可以通过路由路径3获得视频内容，该过程中通信使用的地址为OLT设备下的二层内网地址，用户可以根据需要(网络信号强度、路由路径长短、连接建立情况等)选择不同的路由路径获取视频内容。
综上所述，在本发明实施例中，Track服务器根据P2P节点所支持的不 同的网络地址的距离空间(公网地址、NAT设备下的私网地址、不同设备下的三层、二层内网地址等)，在各个空间距离中计算与其他各P2P节点的传输距离，据此优化路由调度机制，为P2P节点之间传输视频数据选择最佳路由，以实现对各P2P节点按照各自所可能归属的不同地址距离空间加以调度管理。
具体来说，P2P调度过程中，针对网络拓扑结构，将各个P2P节点根据其在不同网络层级的位置(公网地址、NAT设备下的私网地址、不同设备下的三层、二层内网地址等)，来规划不同的传输距离，并据此测算不同P2P节点之间的传输距离，并用以指导P2P的调度机制。
P2P节点之间获取内容数据时，采用传输距离最近的网络地址来在不同P2P节点之间通信，使用不同的网络地址和各自的路由，以缩短传输时延。
采用本发明实施例的方案后，能够根据网络拓扑结构、对端P2P节点所处的位置来确定本端P2P节点与对端P2P节点之间的内容传输路径，提高了路由距离的确定精度，从而灵活地实现了为同一P2P节点提供多种路由传输路径，优化了传输路由、减小网络设备负担。
另外，根据两个P2P节点在网络拓扑中的空间位置，或者说不同空间距离的远近，选择最佳的P2P传输路径，缩短传输时延，提升用户体验，并节省网络传输带宽。
为实现本发明实施例的方法，本发明实施例提供一种服务器，具体来说是Tracker服务器，如图6所示，该服务器包括：
第一接收单元61，配置为接收第一P2P节点的第一请求；所述第一请求包含服务内容；
确定单元62，配置为利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所 述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；
生成单元63，配置为利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
第一发送单元64，配置为向所述第一P2P节点返回所述信息列表。
其中，所述服务内容可以是多媒体内容，比如视频内容等。
在一实施例中，该服务器还可以包括：
第一获取单元，配置为获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
其中，实际应用时，所述网络拓扑信息管理设备可以是网络中已有的网络路由设备，比如：路由器、二层交换机、或NAT设备等，也可以是新增的、能够获得网络拓扑信息的设备。
服务器预先已采集各P2P节点信息，包含存储的内容，服务能力等，据此，所述确定单元62为所述第一P2P节点确定候选P2P节点。
运营商开展P2P业务时，可以根据运营商掌握的网络拓扑结构和网络配置能力，设置在同一个OLT下或经同一NAT设备且分配了私网地址的用户上网设备经由该设备下的本地地址(私网地址)来进行路由。此时，彼此之间的数据可以通过该设备的路由中转，彼此之间也可以通过私网地址互相访问，以达到通过私网地址互相访问时传输时延最小的目的。
因此实际应用时，所述第一P2P节点在不同网络层级的位置信息可以用不同网络层级的网络地址来表征。
这些网络地址是所述第一P2P节点在不同网络层级协议中的网络地址，这些网络地址可以包含公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址等。根据不同的网络地址，可以获知所述第 一P2P节点在不同网络层级的位置信息。
基于此，所述确定单元62，具体配置为：
利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
更具体地，针对所述第一P2P节点所支持的每个网络地址，所述确定单元62基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
所述确定单元62从确定的至少一个P2P节点选择与第一P2P节点传输距离路由跳转距离)最近的P2P节点作为对应网络地址的候选P2P节点；
相应地，所述生成单元63，具体配置为：
针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的候选P2P节点的网络地址填写至所述信息列表中；其中，
第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
这里，所述传输距离是指：两个网络位置之间传输数据的代价的指标。实际应用时，该指标应该综合考虑网络位置之间的传输时延、链路带宽、流量费用以及流量工程策略等因素。
实际应用时，所述生成单元63，还配置为在所述信息列表中，按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序，以便所述第一P2P节点根据排序方式来选择对应的候选P2P节点。
这里，实际应用时，本发明实施例所述生成候选P2P节点信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离，所指的信息表征的方式可以是明示的，也可以是暗示的，相应地，所提供的传输距离的信息可以是明确或具体的，也可以是相对或模 糊的。其中暗示的信息表征方式，提供相对或模糊的传输距离信息的方式，包括但不限于：依据多个P2P节点在P2P节点信息表中的前后顺序来确定哪个候选P2P节点与所述第一P2P节点之间的传输距离相对更近或更远；或者，P2P节点信息列表中的候选P2P节点，已经经由预定的涉及传输距离的筛选标准进行过筛选，从而某一P2P节点被列于所述P2P节点信息列表中这一客观情况本身就表征出了该P2P节点在传输距离上符合预定的涉及传输距离的筛选标准这一信息，该P2P节点可供候选。
需要说明的是：实际应用时，所述第一接收单元61、第一发送单元64、以及第一获取单元可由服务器中的通信芯片实现；所述确定单元62及生成单元63可由服务器中的处理器比如中央处理器(CPU，Central Processing Unit)、微处理器(MCU，Micro Control Unit)、数字信号处理器(DSP，Digital Signal Processor)或可编程逻辑阵列(FPGA，Field－Programmable Gate Array)等实现。
为实现本发明实施例的方法，本发明实施例还提供了一种第一P2P节点，如图7所示，该节点包括：
第二发送单元71，配置为向服务器发送第一请求；所述第一请求包含服务内容；所述第一请求配置为向所述服务器请求能提供所述服务内容的候选P2P节点列表信息；
第二接收单元72，配置为接收所述服务器返回的所述列表信息；所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离(路由跳转距离)；
选择单元73，配置为根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；
第二获取单元74，配置为从所述第二P2P节点获取所述服务内容，以进行呈现。
其中，所述传输距离是指：两个网络位置之间传输数据的代价的指标。实际应用时，该指标应该综合考虑网络位置之间的传输时延、链路带宽、流量费用以及流量工程策略等因素。
运营商开展P2P业务时，可以根据运营商掌握的网络拓扑结构和网络配置能力，设置在同一个OLT下或经同一NAT设备且分配了私网地址的用户上网设备经由该设备下的本地地址(私网地址)来进行路由。此时，彼此之间的数据可以通过该设备的路由中转，彼此之间也可以通过私网地址互相访问，以达到通过私网地址互相访问时传输时延最小的目的。
因此实际应用时，候选P2P节点与所述第一P2P节点之间的传输距离可以用不同网络层级的网络地址来表征。
这些网络地址是所述第一P2P节点在不同网络层级协议中的网络地址，这些网络地址可以包含公网地址、NAT设备下的私网地址、不同设备下的二层内网地址、三层内网地址等。根据不同的网络地址，可以获知所述第一P2P节点在不同网络层级的位置信息。
基于此，在一实施例中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
所述选择单元73，具体配置为：根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
相应地，所述第二获取单元74利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，获取所述服务内容。
实际应用时，所述第二节点可以是与所述第一P2P节点传输距离最近的候选P2P节点，第二P2P节点也可以是传输距离较近的多个候选P2P节点之一，不一定必须是传输距离最近的P2P节点。
另外，实际应用时，在所述信息列表中，所述第一P2P节点所支持的 每个网络地址所对应的候选P2P节点的网络地址的排序方式为候选P2P节点与所述第一P2P节点的传输距离从近至远的排序方式；
相应地，所述选择单元73根据所述信息列表中第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式，选择所述第二P2P节点。
实际应用时，所述选择单元73，还配置为当需要从至少两个候选P2P节点获取所述服务内容时，从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
所述第二获取单元74，配置为基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
实际应用时，所述第二发送单元71、第二接收单元72及第二获取单元74可由第一P2P节点中的通信芯片实现，所述选择单元73可由第一P2P节点中的处理器比如CPU、MCU、DSP或FPGA等实现。
本发明实施例提供的方案，服务器接收第一P2P节点的第一请求；所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表；而第一P2P节点根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；从所述第二P2P节点获取所述服务内容，以进行呈现，利用所述第一P2P节点在不同网络区域的位置信息来为第一P2P节点调度候选P2P节点，如此，能提高P2P节点之间传输距离(路由跳转距离)的确 定精度，从而能有效地减小传输时延。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用硬件实施例、软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
基于此，本发明实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现上述服务器侧任一方 法的步骤。
当然，本发明实施例还提供了一种计算机可读存储介质，其其上存储有计算机程序，所述计算机程序被处理器执行时实现上述第一P2P节点侧任一方法的步骤。
这里，实际应用时，所述计算机可读存储介质可以是磁性随机存取存储器(FRAM，ferromagnetic random access memory)、只读存储器(ROM，Read Only Memory)、可编程只读存储器(PROM，Programmable Read-Only Memory)、可擦除可编程只读存储器(EPROM，Erasable Programmable Read-Only Memory)、电可擦除可编程只读存储器(EEPROM，Electrically Erasable Programmable Read-Only Memory)、快闪存储器(Flash Memory)、磁表面存储器、光盘、或只读光盘(CD-ROM，Compact Disc Read-Only Memory)等存储器。
以上所述，仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围。
工业实用性
本发明实施例提供的方案，服务器接收第一P2P节点的第一请求；所述第一请求包含服务内容；利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；向所述第一P2P节点返回所述信息列表；而第一P2P节点根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；从所述第二P2P节点获取所述服务内容，以进行呈现，利 用所述第一P2P节点在不同网络区域的位置信息来为第一P2P节点调度候选P2P节点，如此，能提高P2P节点之间传输距离(路由跳转距离)的确定精度，从而能有效地减小传输时延。

Claims (18)

  1. 一种调度方法，应用于服务器，所述方法包括：
    接收第一对等P2P节点的第一请求；所述第一请求包含服务内容；
    利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；
    利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
    向所述第一P2P节点返回所述信息列表。
  2. 根据权利要求1所述的方法，其中，所述利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点，包括：
    利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
  3. 根据权利要求2所述的方法，其中，所述利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点，包括：
    针对所述第一P2P节点所支持的每个网络地址，基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
    从确定的至少一个P2P节点选择与第一P2P节点传输距离最近的P2P节点作为对应网络地址的候选P2P节点；
    相应地，生成信息列表时，所述方法还包括：
    针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的 候选P2P节点的网络地址填写至所述信息列表中；其中，
    第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
  4. 根据权利要求3所述的方法，其中，生成所述信息列表时，所述方法还包括：
    在所述信息列表中，按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序。
  5. 根据权利要求1至4任一项所述的方法，其中，所述接收第一P2P节点的第一请求之前，所述方法还包括：
    获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
  6. 一种调度方法，应用于第一P2P节点，所述方法包括：
    向服务器发送第一请求；所述第一请求包含服务内容；所述第一请求用于向所述服务器请求能提供所述服务内容的候选P2P节点列表信息；
    接收所述服务器返回的所述列表信息；所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
    根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；
    从所述第二P2P节点获取所述服务内容，以进行呈现。
  7. 根据权利要求6所述的方法，其中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
    相应地，所述根据所述列表信息，从所述列表信息中选择第二P2P节 点，包括：
    根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
    相应地，利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，获取所述服务内容。
  8. 根据权利要求7所述的方法，其中，在所述信息列表中，所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式为候选P2P节点与所述第一P2P节点的传输距离从近至远的排序方式；
    相应地，根据所述信息列表中第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址的排序方式，选择所述第二P2P节点。
  9. 根据权利要求6至8任一项所述的方法，其中，所述方法还包括：
    当需要从至少两个候选P2P节点获取所述服务内容时，从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
    基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
  10. 一种服务器，所述服务器包括：
    第一接收单元，配置为接收第一P2P节点的第一请求；所述第一请求包含服务内容；
    确定单元，配置为利用所述第一P2P节点在不同网络层级的位置信息、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点；所述至少一个候选P2P节点能为所述第一P2P节点提供服务；所述位置信息为基于网络拓扑结构而生成的位置信息；
    生成单元，配置为利用所述至少一个候选P2P节点，生成候选P2P节点信息列表；所述信息列表中的P2P节点信息表征所述至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
    第一发送单元，配置为向所述第一P2P节点返回所述信息列表。
  11. 根据权利要求10所述的服务器，其中，所述确定单元，配置为：利用所述第一P2P节点所支持的至少一个网络地址、所述服务内容，为所述第一P2P节点确定至少一个候选P2P节点。
  12. 根据权利要求11所述的服务器，其中，所述确定单元，配置为：
    针对所述第一P2P节点所支持的每个网络地址，基于所述服务内容，确定至少一个能为所述第一P2P节点提供服务的至少一个P2P节点；
    从确定的至少一个P2P节点选择与第一P2P节点传输距离最近的P2P节点作为对应网络地址的候选P2P节点；
    所述生成单元，配置为：
    针对所述第一P2P节点所支持的每个网络地址，将与网络地址对应的候选P2P节点的网络地址填写至所述信息列表中；其中，
    第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址。
  13. 根据权利要求12所述的服务器，其中，所述生成单元，还配置为在所述信息列表中，按照与所述第一P2P节点的传输距离从近至远的排序方式，将所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址进行排序。
  14. 根据权利要求10至13任一项所述的服务器，其中，所述服务器还包括：
    第一获取单元，配置为获知所述第一P2P节点上线后，从网络拓扑信息管理设备处获取所述第一P2P节点的位置信息。
  15. 一种第一P2P节点，所述节点包括：
    第二发送单元，配置为向服务器发送第一请求；所述第一请求包含服务内容；所述第一请求用于向所述服务器请求能提供所述服务内容的候选 P2P节点列表信息；
    第二接收单元，配置为接收所述服务器返回的所述列表信息；所述信息列表中的P2P节点信息表征至少一个候选P2P节点与所述第一P2P节点之间的传输距离；
    选择单元，配置为根据所述列表信息，从所述列表信息中选择第二P2P节点；所述第二P2P节点为能为所述第一P2P节点提供服务；
    第二获取单元，配置为从所述第二P2P节点获取所述服务内容，以进行呈现。
  16. 根据权利要求15所述的节点，其中，所述列表信息包含所述第一P2P节点所支持的每个网络地址所对应的候选P2P节点的网络地址；第一P2P节点的每个网络地址与对应的候选P2P节点的网络地址为同一网络层级的网络地址；
    所述选择单元，配置为：根据每个网络地址所对应的候选P2P节点的网络地址，选择所述第二P2P节点；
    相应地，利用所述第二P2P节点的网络地址与所述第二P2P节点进行通信，获取所述服务内容。
  17. 根据权利要求15或16所述的节点，其中，所述选择单元，还配置为当需要从至少两个候选P2P节点获取所述服务内容时，从所述信息列表中获得所述至少两个候选P2P节点的网络地址；
    所述第二获取单元，配置为基于获取的网络地址，与所述至少两个P2P节点进行通信，以获取所述服务内容。
  18. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1至5任一项所述方法的步骤，或者实现权利要求6至9任一项所述方法的步骤。
PCT/CN2017/103474 2016-10-13 2017-09-26 调度方法、服务器、第一对等节点及计算机可读存储介质 Ceased WO2018068635A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/324,954 US11706471B2 (en) 2016-10-13 2017-09-26 Scheduling method, server, first peer node and computer-readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610895287.8A CN107948677B (zh) 2016-10-13 2016-10-13 一种调度方法、服务器及第一对等节点
CN201610895287.8 2016-10-13

Publications (1)

Publication Number Publication Date
WO2018068635A1 true WO2018068635A1 (zh) 2018-04-19

Family

ID=61905161

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/103474 Ceased WO2018068635A1 (zh) 2016-10-13 2017-09-26 调度方法、服务器、第一对等节点及计算机可读存储介质

Country Status (3)

Country Link
US (1) US11706471B2 (zh)
CN (1) CN107948677B (zh)
WO (1) WO2018068635A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285788A (zh) * 2020-09-18 2022-04-05 华为技术有限公司 一种设备连接方法、装置和设备

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108667935A (zh) * 2018-05-11 2018-10-16 深圳市网心科技有限公司 网络业务方法、服务器、网络系统和存储介质
CN110768852A (zh) * 2018-07-25 2020-02-07 贵州白山云科技股份有限公司 一种云网络节点的测试方法及装置
CN111385341A (zh) * 2018-12-29 2020-07-07 华为终端有限公司 一种通信方法及相关设备
CN115244912B (zh) * 2020-06-12 2024-11-26 深圳市欢太科技有限公司 文件分发方法、装置、电子设备和计算机可读存储介质
US11886394B2 (en) * 2020-08-25 2024-01-30 Red Hat, Inc. Composable query language gateway routing protocol
US12267149B2 (en) * 2021-12-21 2025-04-01 Dish Network Technologies India Private Limited Methods, devices, and systems for distributing content in community of over-the-air broadcast content receivers

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101414975A (zh) * 2008-11-28 2009-04-22 中兴通讯股份有限公司 基于对等网络的服务节点选择方法及装置、索引实体
CN101651708A (zh) * 2009-07-07 2010-02-17 北京大学 P2p流媒体网络的拓扑构建方法
US20120215850A1 (en) * 2009-10-30 2012-08-23 Nec Europe Ltd. Method and system for supporting the selection of communication peers in an overlay network
CN104507066A (zh) * 2014-12-26 2015-04-08 电子科技大学 P2p系统节点发现方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8065418B1 (en) * 2004-02-02 2011-11-22 Apple Inc. NAT traversal for media conferencing
US8996723B2 (en) * 2007-06-04 2015-03-31 Microsoft Technology Licensing, Llc ISP-aware peer-to-peer content exchange
EP2086206A1 (en) * 2008-01-31 2009-08-05 Alcatel Lucent System for operating a peer-to-peer network taking into account access network subscriber information
US8655838B2 (en) * 2008-02-20 2014-02-18 At&T Intellectual Property I, L.P. Selection of peers to cluster within a peer-to-peer network
CN101964741B (zh) * 2009-07-25 2013-01-30 华为技术有限公司 一种节点列表发送方法和设备
CN104009857A (zh) * 2013-02-25 2014-08-27 四零四科技股份有限公司 基于设备位置的网络组态配置系统及其配置方法
US9294563B2 (en) * 2013-02-27 2016-03-22 Omnivision Technologies, Inc. Apparatus and method for level-based self-adjusting peer-to-peer media streaming
CN105099926B (zh) * 2015-06-30 2019-03-15 新华三技术有限公司 一种路由开销确定方法及设备
CN109039703A (zh) * 2018-06-27 2018-12-18 中国科学院信息工程研究所 一种复杂网络模拟环境下业务场景网络快速构建的方法及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101414975A (zh) * 2008-11-28 2009-04-22 中兴通讯股份有限公司 基于对等网络的服务节点选择方法及装置、索引实体
CN101651708A (zh) * 2009-07-07 2010-02-17 北京大学 P2p流媒体网络的拓扑构建方法
US20120215850A1 (en) * 2009-10-30 2012-08-23 Nec Europe Ltd. Method and system for supporting the selection of communication peers in an overlay network
CN104507066A (zh) * 2014-12-26 2015-04-08 电子科技大学 P2p系统节点发现方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285788A (zh) * 2020-09-18 2022-04-05 华为技术有限公司 一种设备连接方法、装置和设备
CN114285788B (zh) * 2020-09-18 2023-06-20 华为技术有限公司 一种设备连接方法、装置和设备

Also Published As

Publication number Publication date
CN107948677A (zh) 2018-04-20
US20210289246A1 (en) 2021-09-16
CN107948677B (zh) 2020-02-14
US11706471B2 (en) 2023-07-18

Similar Documents

Publication Publication Date Title
WO2018068635A1 (zh) 调度方法、服务器、第一对等节点及计算机可读存储介质
CN109565472B (zh) 虚拟网络中基于切片/服务的路由方法和设备
CN111181849B (zh) 回源路径确定方法、确定装置、计算机设备和存储介质
CN104168341B (zh) Ip地址的定位方法和cdn调度方法以及装置
KR101409991B1 (ko) Ｐ2ｐ 통신 환경에서의 데이터 전송 방법 및 장치
JP6820320B2 (ja) リアルタイムユーザ監視データを用いてリアルタイムトラフィック誘導を行うための方法および装置
CN101924690B (zh) 一种数据路由方法及设备
CN105704034B (zh) 接入网络的方法和中央服务器
CN114501161B (zh) 音视频系统、接入方法、路由转发方法及可读存储介质
EP2332056A1 (en) Geolocation assisted data forwarding storage
CN105024844A (zh) 一种计算跨域路由的方法、服务器以及系统
KR101445047B1 (ko) 토폴로지 서버의 지원으로 통신 아키텍처에 분산된 노드의 네트워크에 대한 기밀 또는 보호 액세스
RU2009149102A (ru) Способ, устройство и система управления мобильностью и эффективного поиска информации в сети связи
WO2012109852A1 (zh) 节点排序与选取方法、装置及系统
CN105491173A (zh) 一种dns解析方法、服务器及网络系统
CN112866413A (zh) 数据传输方法、装置、电子设备和计算机可读存储介质
US8352635B2 (en) Geolocation assisted data forwarding storage
CN103973596A (zh) 一种p2p网络节点筛选方法
US10230618B2 (en) Path acquisition method, path computation element, path computation client and system
US20100135168A1 (en) Method for automatically determining a group of pairs located close to another pair in a communication network and associated server, analysis device and communication device
JP4763834B2 (ja) オーバレイネットワークのノード間ネットワーク性能を測定する方法、装置、およびシステム
WO2018121741A1 (zh) 一种流数据的跨域传输方法和装置
CN105656978A (zh) 一种资源共享方法及装置
JP2013529013A (ja) ネットワーク内部のデータ通信を制御するための方法およびシステム
CN101729362A (zh) 实现结构化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: 17859701

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

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

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 26.07.2019) 2ND TIME.

122 Ep: pct application non-entry in european phase

Ref document number: 17859701

Country of ref document: EP

Kind code of ref document: A1