US 11,706,471 B2
Scheduling method, server, first peer node and computer-readable storage medium
Jing Wang, Beijing (CN); and Hui Wang, Beijing (CN)
Assigned to CHINA MOBILE COMMUNICATION CO., LTD RESEARCH INST, Beijing (CN); and CHINA MOBILE COMMUNICATIONS GROUP CO., LTD., Beijing (CN)
Appl. No. 16/324,954
Filed by CHINA MOBILE COMMUNICATION LTD., RESEARCH INSTITUTE, Beijing (CN); and CHINA MOBILE COMMUNICATIONS CORPORATION, Beijing (CN)
PCT Filed Sep. 26, 2017, PCT No. PCT/CN2017/103474
§ 371(c)(1), (2) Date Feb. 12, 2019,
PCT Pub. No. WO2018/068635, PCT Pub. Date Apr. 19, 2018.
Claims priority of application No. 201610895287.8 (CN), filed on Oct. 13, 2016.
Prior Publication US 2021/0289246 A1, Sep. 16, 2021
Int. Cl. H04N 21/262 (2011.01); H04L 67/104 (2022.01); H04N 21/238 (2011.01); H04N 21/63 (2011.01); H04L 67/1061 (2022.01); H04L 67/1021 (2022.01)
CPC H04N 21/26208 (2013.01) [H04L 67/104 (2013.01); H04L 67/1021 (2013.01); H04L 67/1063 (2013.01); H04N 21/238 (2013.01); H04N 21/632 (2013.01)] 16 Claims
OG exemplary drawing
 
1. A scheduling method, applied to a server, the method comprising:
receiving a first request from a first Peer to Peer (P2P) node, the first request comprising a service content;
determining at least one candidate P2P node for the first P2P node using position information of the first P2P node in different network layers and the service content, the at least one candidate P2P node being capable of providing service to the first P2P node and the position information being position information generated based on a network topology structure;
generating a candidate P2P node information list using the at least one candidate P2P node, P2P node information in the information list representing a transmission distance between the at least one candidate P2P node and the first P2P node, wherein the transmission distance is a cost index of data transmission between two network positions, and the cost index comprises: a transmission delay between the two network positions, a link bandwidth, a traffic charge, and a traffic engineering policy; and
returning the information list to the first P2P node, wherein
the position information of the first P2P node in different network layers is represented by network addresses in different network layers, the network addresses are network addresses of the first P2P node in different network layer protocols and comprise: a public network address, a private network address under a Network Address Translation (NAT) device, layer-2 intranet addresses under different devices, and layer-3 intranet addresses under different devices; wherein a transmission distance between the first node and the at least one candidate P2P node in a layer of public network address is longer than a transmission distance between the first node and the at least one candidate P2P node in a layer of private network address under the NAT device, which is longer than a transmission distance between the first node and the at least one candidate P2P node in a layer of layer-2 intranet address, which is longer than a transmission distance between the first node and the at least one candidate P2P node in a layer of layer-3 intranet address; and
said determining the at least one candidate P2P node for the first P2P node using the position information of the first P2P node in different network layers and the service content comprises:
for each network address supported by the first P2P node, determining at least one P2P node capable of providing the service to the first P2P node based on the service content, and
selecting the P2P node of which a transmission distance with the first P2P node is shortest from the determined at least one P2P node as a candidate P2P node corresponding to said each network address.