Scheduling method, server, first peer node and computer-readable storage medium
Abstract:
A scheduling method includes: a server receiving a first request of a first peer (P2P) node; the first request containing service content; using position information on different network hierarchies of the first P2P node and 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 position information being position information generated on the basis of a network topology structure; using the at least one candidate P2P node to generate a candidate P2P node information list; P2P node information in the information list representing a transmission distance between the at least one candidate P2P node and the first P2P node; and returning the information list to the first P2P node. Further disclosed at the same time are a server, a first P2P node and a computer-readable storage medium.
Information query
Patent Agency Ranking
0/0