US 12,438,804 B2
Method, apparatus, medium and electronic device for network access
Yiyuan Tao, Beijing (CN); Haidong Gao, Beijing (CN); Kai Zhang, Beijing (CN); and Jian Wang, Beijing (CN)
Assigned to Beijing Youzhuju Network Technology Co., Ltd., Beijing (CN)
Filed by Beijing Youzhuju Network Technology Co., Ltd., Beijing (CN)
Filed on Jun. 14, 2024, as Appl. No. 18/744,502.
Application 18/744,502 is a continuation of application No. PCT/CN2022/134354, filed on Nov. 25, 2022.
Claims priority of application No. 202111544129.5 (CN), filed on Dec. 16, 2021.
Prior Publication US 2024/0340233 A1, Oct. 10, 2024
Int. Cl. H04L 45/121 (2022.01); H04L 45/28 (2022.01)
CPC H04L 45/121 (2013.01) [H04L 45/28 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for network access, applied to a content delivery network, wherein the method comprises:
determining candidate nodes currently accessible to a client in response to that a predetermined routing condition is triggered;
determining response time consumption corresponding to the candidate nodes by determining a response time indicative of a duration from sending data from the client to receiving a first byte by the client from each of the candidate nodes;
measuring network response rates of the candidate nodes, and determining an optimal node among the candidate nodes based on the response time consumption and the network response rates, wherein a smaller response time corresponds to a faster network response rate; and
connecting the client to the optimal node for network communication;
wherein in response to a target routing mode being a first routing mode, the determining the optimal node among the candidate nodes comprises:
measuring the network response rates of all the candidate nodes simultaneously,
obtaining a routing weight corresponding to each candidate node, the routing weight characterizing a priority corresponding to the candidate node, wherein a smaller routing weight represents a higher priority corresponding to the candidate node,
determining a sum of the response time consumption and the routing weight corresponding to the candidate node as a routing score of the candidate node, wherein a lower routing score represents a better network experience corresponding to the candidate node, and
determining a candidate node with the lowest routing score as the optimal node.