CN112751931B

CN112751931B - Network connection method and device, electronic device, and medium

Info

Publication number: CN112751931B
Application number: CN202011610838.4A
Authority: CN
Inventors: 李可; 罗涛; 李思; 王伟
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2020-12-29
Filing date: 2020-12-29
Publication date: 2022-10-14
Anticipated expiration: 2040-12-29
Also published as: CN112751931A

Abstract

The disclosure provides a network connection method and a network connection device, belongs to the technical field of communication, and can be used in finance or other fields. The network connection method comprises the following steps: receiving a network connection request; acquiring M IP addresses corresponding to the websites to be accessed based on the network connection request; according to the historical connection power of each IP address, sequencing the M IP addresses to obtain an IP address sequence, wherein the higher the historical connection power, the higher the sequencing of the IP addresses is; dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence; and according to the sequence of each racing connection group in the address group sequence, preferably using N IP addresses in the racing connection group which is ranked at the top in parallel to initiate a connection attempt until any one IP address is successfully connected or all M IP addresses are failed to be connected. The present disclosure also provides an electronic device, and a computer-readable storage medium.

Description

Network connection method and device, electronic device, and medium

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a network connection method and apparatus, an electronic device, and a medium.

Background

Under the wave of development of digital economy, the effectiveness and stability of network connection are of great importance. When a network connection is made, for example, a website provides multiple IP addresses to the outside, the client will usually try to establish the connection again through different IP addresses according to a certain time interval. Therefore, one IP address is often required to be started after the connection is failed, and the system connection waiting or overtime time is long in the weak network environment, so that the user experience is poor.

Disclosure of Invention

In view of the above, embodiments of the present disclosure provide a network connection method, a network connection apparatus, an electronic device, and a medium, which can race for connection using a plurality of IP addresses according to a historical connection power.

One aspect of the disclosed embodiments provides a network connection method. The network connection method comprises the following steps: receiving a network connection request; acquiring M IP addresses corresponding to the websites to be accessed based on the network connection request, wherein M is an integer greater than or equal to 2; connecting into power according to the history of each IP address in the M IP addresses, and sequencing the M IP addresses to obtain an IP address sequence; the historical IP addresses in the M IP addresses are connected to be higher in power, and the IP addresses are ranked more front; dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence, wherein N is an integer greater than or equal to 2 and is less than or equal to M; and preferably using N IP addresses in the racing connection group with the highest sequence to initiate a connection attempt in parallel according to the sequence of each racing connection group in the address group sequence until any one IP address is successfully connected or all the M IP addresses are failed to be connected.

According to an embodiment of the present disclosure, before the sorting the M IP addresses according to the historical connection success rates of the M IP addresses, the method further includes: and acquiring the historical connection power of each IP address in the M IP addresses, wherein the historical connection power of one IP address comprises the historical connection success times and the connection success time of the IP address or the historical connection failure times and the connection failure time.

According to an embodiment of the present disclosure, the sorting the M IP addresses according to the historical connection success rates of the M IP addresses includes at least one of: the higher the historical connection success frequency is, the more the IP addresses are ranked in the front; when the historical connection success times are the same, the closer the IP address sequence of the latest connection success time to the current time is; the higher the historical connection failure times, the later the IP address sequencing is; or the historical connection failure times are the same, the IP addresses which are closer to the current time at the latest connection failure time are ranked more backwards.

According to an embodiment of the present disclosure, the connection attempt initiated by N IP addresses in parallel in the racing connection group includes: initiating a connection attempt by a first IP address within the racing connection group; and initiating a connection attempt by the second IP address in response to a predetermined time after the initiation of the connection attempt by the first IP address and the network not yet being successfully connected; the first IP address and the second IP address are two IP addresses which are arranged in the racing connection group and are adjacent to each other before and after the ranking.

According to the embodiment of the present disclosure, the preferentially using N IP addresses in the racing connection group with the top rank in parallel to initiate a connection attempt according to the precedence order of each racing connection group in the address group sequence includes: after the N IP addresses in the first racing connection group are failed to be connected, the N IP addresses in the second racing connection group are used for initiating connection attempts in parallel; the first racing connection group and the second racing connection group are two racing connection groups which are immediately adjacent to each other in sequence in the address group sequence.

According to an embodiment of the present disclosure, the method further comprises: and selecting the IP address which is successfully connected firstly for subsequent data communication.

According to the embodiment of the disclosure, the method further comprises updating the historical connection power of each IP address in the M IP addresses according to the connection success or failure condition of the M IP addresses in the current network connection process.

According to the embodiment of the disclosure, the M IP addresses are divided into two types, namely an address in an IPv4 format and an address in an IPv6 format; wherein the sorting the M IP addresses to obtain the IP address sequence further comprises: and alternately sequencing the IPv6 format address and the IPv4 format address in the M IP addresses, wherein the IPv6 format address is earlier than the IPv4 format address in the alternate sequencing. Wherein N =2.

In another aspect of the disclosed embodiments, a network connection device is provided. The device comprises a request receiving module, a first obtaining module, a sorting module, a group dividing module and a racing connection module. The request receiving module is used for receiving a network connection request. The first obtaining module is used for obtaining M IP addresses corresponding to the websites to be accessed based on the network connection request, wherein M is an integer larger than or equal to 2. The sorting module is used for connecting into power according to the history of each IP address in the M IP addresses and sorting the M IP addresses to obtain an IP address sequence; and the historical connected IP addresses with higher power in the M IP addresses are ranked more front. The group division module is used for dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence, wherein N is an integer greater than or equal to 2, and N is less than or equal to M. The racing connection module is used for preferably using N IP addresses in the racing connection group with the front ranking according to the sequence of each racing connection group in the address group sequence to initiate a connection attempt in parallel until any one IP address is successfully connected or all the M IP addresses are failed to be connected.

According to an embodiment of the present disclosure, the apparatus further includes a second obtaining module. The second obtaining module is configured to obtain the historical connection power of each IP address in the M IP addresses, where the historical connection power of one IP address includes historical connection success times and connection success time of the IP address, or historical connection failure times and connection failure time of the IP address.

According to an embodiment of the present disclosure, the apparatus further comprises a communication control module. The communication control module is used for selecting the IP address which is successfully connected firstly to carry out subsequent data communication.

According to an embodiment of the present disclosure, the apparatus further comprises a connection record update module. The connection record updating module is used for updating the historical connection power of each IP address in the M IP addresses according to the successful or failed connection condition of the M IP addresses in the network connection process.

Another aspect of the disclosed embodiments provides an electronic device. The electronic device includes one or more memories, and one or more processors. The memory stores executable instructions. The processor executes the executable instructions to implement the method as described above.

Another aspect of the embodiments of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.

Another aspect of embodiments of the present disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.

One or more of the above-described embodiments may have the following advantages or benefits: the historical connection power of the IP addresses is comprehensively considered when the IP addresses are in racing connection, the IP addresses with high historical connection power are preferentially used for carrying out racing connection, and the priority of trying to connect by using the IP addresses is reduced for the IP addresses with high historical racing failure rate, so that the connection power can be increased in a weak network environment, and a user is helped to quickly select the optimal connection address.

Drawings

The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:

fig. 1 schematically illustrates an application scenario of a network connection method and apparatus according to an embodiment of the present disclosure;

fig. 2 schematically illustrates a flow chart of a network connection method according to an embodiment of the present disclosure;

FIG. 3 schematically shows a schematic diagram of a sequence of IP addresses according to an embodiment of the present disclosure;

FIG. 4 schematically illustrates a schematic diagram of an IP address racing connection within a racing connection group, according to one embodiment of the disclosure;

FIG. 5 schematically illustrates an IP address racing connection within a racing connection group, according to another embodiment of the disclosure;

FIG. 6 is a flowchart illustrating a network connection method applied to IPv6 and IPv4 racing connections according to an embodiment of the disclosure;

fig. 7 is a schematic diagram illustrating a network request transmission flow in the method flow shown in fig. 6;

FIG. 8 schematically illustrates a block diagram of a network connection device according to an embodiment of the disclosure; and

fig. 9 schematically shows a block diagram of an electronic device adapted to implement a network connection method according to an embodiment of the present disclosure.

Detailed Description

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B, and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B, and C" would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). Where a convention analogous to "at least one of A, B, or C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B, or C" would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.).

Embodiments of the present disclosure provide a network connection method, apparatus, electronic device, and medium that integrate historical connection of IP addresses into power for multiple IP racing connections.

The network connection method according to an embodiment of the present disclosure includes first receiving a network connection request. And then acquiring M IP addresses corresponding to the website to be accessed based on the network connection request, wherein M is an integer greater than or equal to 2. And then, according to the historical connection power of each IP address in the M IP addresses, sequencing the M IP addresses to obtain an IP address sequence, wherein the higher the historical connection power in the M IP addresses is, the higher the sequencing of the IP addresses is. And then dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence, wherein N is an integer greater than or equal to 2, and N is less than or equal to M. And then, according to the sequence of each racing connection group in the address group sequence, preferably using N IP addresses in the racing connection group which is ranked at the top to initiate a connection attempt in parallel until any IP address is successfully connected or M IP addresses are failed to be connected.

In this way, the historical connection power of the IP addresses is comprehensively considered when the IP addresses are used for racing connection, the IP addresses with high historical connection power are preferentially used for racing connection, and the priority of connection trying by using the IP addresses is reduced for the IP addresses with high historical racing failure rate, so that the connection power can be increased in a weak network environment, and a user is helped to quickly select the optimal connection address.

It should be noted that the network connection method and apparatus determined in the embodiments of the present disclosure may be used in the financial field, and may also be used in any field other than the financial field, which is not limited in the present disclosure.

Fig. 1 schematically illustrates an application scenario 100 of a network connection method and apparatus according to an embodiment of the present disclosure.

As shown in fig. 1, an application scenario 100 according to this embodiment may include a terminal device 101, a network 102, and a server (cluster) 103. Network 102 is used to provide communication links between terminal devices 101 and servers (clusters) 103. Network 102 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

A user may use terminal device 101 to interact with server (cluster) 103 over network 102 to receive or send messages or the like. Various messaging client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) may be installed on terminal device 101.

The server (cluster) 103 may be a server that provides various services, such as a background management server (for example only) that provides support for websites browsed by users using the terminal devices 101.

In one embodiment, a website may have multiple images. For example, the servers (clusters) 103 may be distributed in different places, with multiple IP addresses assigned corresponding to the same domain name. Therefore, the server in any place is broken, and the other server can be accessed, so that the access of the website is not influenced, and the backup function is realized.

In another embodiment, as the current IPv4 (Internet Protocol Version 4, version 4 of the Internet communication Protocol) address is exhausted, it is already necessary to switch to IPv6 (Internet Protocol Version 6, version 6 of the Internet communication Protocol), and at the stage of transition from IPv4 to IPv6, some network stations may support both IPv4 connection and IPv6 connection, and provide both IPv4 format addresses and IPv6 format addresses to the outside.

When a user accesses a website managed and supported by the server (cluster) 103 through the terminal device 1, the terminal device 1 may execute the network connection method of the embodiment of the present disclosure, sort and group a plurality of IP addresses corresponding to the accessed website according to the historical connection power, and perform racing connection among the plurality of IP addresses in the group, thereby increasing the connection power of the website and increasing the speed of establishing network connection.

The network connection method provided by the embodiment of the present disclosure may be generally performed by the terminal device 101. Accordingly, the network connection device provided by the embodiment of the present disclosure may be generally disposed in the terminal device 101.

It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.

Fig. 2 schematically shows a flow chart of a network connection method according to an embodiment of the present disclosure.

As shown in fig. 2, the network connection method according to the embodiment may include operations S210 to S250.

In operation S210, a network connection request is received. The user may initiate a connection request via a client in the terminal device 1. For example, a user inputs information of a website to be accessed at a search interface of a browser. The terminal device 1 receives the network connection request, wherein the request may include, for example, a domain name (e.g., www.xxx.com) of the visited website.

In operation S220, M IP addresses corresponding to a website to be accessed are obtained based on the network connection request, where M is an integer greater than or equal to 2. For example, in one embodiment, the client may upload the domain name in the network connection request to the domain name resolution server. After performing DNS (Domain Name System) resolution, the Domain Name server obtains an IP address list corresponding to the website Domain Name, and then returns the IP address list to the client. In another embodiment, for example, when the client is not connected for the first time and an IP list corresponding to the domain name is cached in the operating system of the terminal device 101, the IP address list corresponding to the website domain name may be directly obtained from the cache.

In operation S230, the M IP addresses are sorted according to the historical connection power of each IP address in the M IP addresses, so as to obtain an IP address sequence. And the IP addresses with higher power are connected in the M IP addresses in a historical mode, and the IP addresses are ranked more front.

Fig. 3 schematically shows a schematic diagram of a sequence of IP addresses according to an embodiment of the present disclosure.

Referring to fig. 3, a plurality of IP addresses (illustrated in fig. 3 as IP1, IP2, IP3, IP4, IP5, IP6, \8230; where the numbers are used only to distinguish different IP addresses, without a sequential meaning) are returned, for example, by a DNS nameresolution server in operation S220. The IP addresses are connected into a power sequence according to respective histories, wherein the IP addresses with higher power are connected in the history and the power sequence is higher.

According to an embodiment of the present disclosure, a historical connection success rate of each of M IP addresses (e.g., IP1, IP2, IP3, IP4, IP5, IP6, \ 8230;) may be obtained before operation S230, where the historical connection power of one IP address includes historical connection success times and connection success times or historical connection failure times and connection failure times of the IP address.

Thus, when ordering the plurality of IP addresses (e.g., IP1, IP2, IP3, IP4, IP5, IP6, etc.), it may be performed according to any one of the following logics, or a combination of logics: the higher the historical connection success frequency, the higher the ranking of the IP addresses; or when the historical connection success times are the same, the IP addresses which are closer to the current time at the latest connection success time are ranked more forward; or, the higher the historical connection failure times, the later the IP address ranking; or when the historical connection failure times are the same, the IP addresses which are closer to the current time at the latest connection failure time are ranked more backwards.

Next, in operation S240, every N IP addresses in the IP address sequence are divided into a racing connection group, so as to obtain an address group sequence, where N is an integer greater than or equal to 2, and N is less than or equal to M.

Referring to fig. 3, when N =2, IP1 to IP6 may be divided into three racing connection groups, where IP1 and IP2 belong to one racing connection group, IP3 and IP4 belong to one racing connection group, and IP5 and IP6 belong to one racing connection group.

When N =3, IP1 to IP6 may be divided into two racing connection groups, where IP1, IP2, and IP3 belong to one racing connection group, and IP4, IP5, and IP6 belong to the other racing connection group.

In other embodiments, N may take the value of 4 or even other values. The specific value of N may be selected and determined according to practical applications, which is not limited in this disclosure.

Then, in operation S250, according to the sequence of each racing connection group in the address group sequence, the N IP addresses in the racing connection group ranked at the top are preferentially used to initiate a connection attempt in parallel until any one IP address is successfully connected or M IP addresses are all failed to be connected.

For example, when the first racing connection group and the second racing connection group are two immediately preceding and succeeding in sequence in the address group sequence, after the connection of all the N IP addresses in the first racing connection group fails, the N IP addresses in the second racing connection group are used to initiate a connection attempt in parallel.

With continued reference to fig. 3, as previously described, when N =2, IP 1-IP 6 may be divided into three racing connection groups. Then IP3 and IP4 will initiate connection attempts in parallel when both IP1 and IP2 fail to connect. The situation is similar when N =3. Therefore, when the network connection is established, the connection can be accelerated, and the historical connection is ensured to be connected into the IP address with high power to try racing connection preferentially.

According to the embodiment of the present disclosure, in operation S250, if the race connection is successful, that is, after any one of the M IP addresses is successfully connected, the IP address which is successfully connected first is selected for subsequent data communication. Once connection is initiated, whether the network is successfully connected or not is no longer controlled by the operation of the electronic device, so that a situation that a plurality of IP addresses are successfully connected exists, and at the moment, the IP address which is successfully connected first is selected for subsequent data transmission. The IP address which is successfully connected firstly is also the IP address which consumes the shortest time for connection, the strongest and most stable network signal of the IP address is shown in the connection process, and the timeliness and the stability of network communication can be improved by establishing connection by using the IP address to carry out subsequent communication.

According to the embodiment of the present disclosure, after operation S250, the historical connection power of each IP address in the M IP addresses may also be updated according to the condition that the connection of the M IP addresses in the current network connection process is successful or failed. The updated historical connection power can be used as the basis for sorting the IP addresses in the next network connection.

In one embodiment, the N IP addresses within the racing connection group initiating connection attempts in parallel may be, for example, the N addresses initiating connection attempts simultaneously.

Or, in another embodiment, in order to reduce the additional CPU, memory and network overhead caused by concurrent multiple connections, a connection attempt may be initiated by an IP address ranked earlier in the N addresses, and when the IP address is not successfully connected within a predetermined time after the connection is initiated by the address, a connection attempt may be initiated by an IP address subsequent to the IP address. For example, for any two IP addresses in a race connection set that are immediately adjacent in sequence (e.g., named first IP address and second IP address, respectively), a connection attempt is initiated by the first IP address, and then in response to a predetermined time after the connection attempt is initiated by the first IP address and the network has not yet been successfully connected, a connection attempt is initiated by the second IP address.

Fig. 4 and 5 respectively illustrate diagrams of connection attempts made by N IP addresses in a racing connection group with a delay when N =2 and N =3 are provided, wherein a predetermined time for initiating a request with a delay is 300ms, and when a connection failure is set within 3s after a connection request is initiated, the connection fails.

Reference is first made to fig. 4. Fig. 4 schematically illustrates a schematic diagram of an IP address racing connection within a racing connection group, where N =2, according to an embodiment of the disclosure.

In connection with fig. 3, in fig. 4 IP1 and IP2 belong to one racing connection group. In the racing connection group, firstly, IP1 initiates connection, and after 300ms, if IP1 is not successfully connected, IP2 initiates connection racing.

And then, the IP1 and the IP2 which address is successfully connected first take the address as the address for sending the network request data subsequently.

After the connection requests are initiated by the IP1 and the IP2, the connection is successful, or the connection is failed if the connection is not successful within 3s from the time when the connection is initiated. Whether the connection is successful or failed, the corresponding connection record can be added for the later IP address sequencing basis.

If IP1 fails to connect, IP2 also fails to connect (i.e., fails to connect) within the originating connection request 3 s. All IP addresses within the racing connection set fail to connect. At this time, the racing connection needs to be started in the next racing connection group (including IP3 and IP 4), and the racing connection process is similar to the illustration of IP1 and IP2 in fig. 4, and is not described again.

Reference is next made to fig. 5. Figure 5 schematically illustrates a schematic diagram of IP address racing connections within a racing connection group, where N =3, according to another embodiment of the disclosure.

Referring to fig. 3, in fig. 5, IP1, IP2, and IP3 belong to one racing connection group. In the racing connection group, IP1 initiates connection; then after 300ms, if the IP1 is not connected successfully, the IP2 initiates a connection attempt to perform connection racing; if IP1 and IP2 still have no connection success after 300ms, then IP3 initiates a connection attempt to compete for connection.

And then IP1, IP2 and IP3 which address is successfully connected first takes the address as the address for subsequently sending the network request data.

After IP1, IP2, and IP3 initiate a connection request, the connection is either successful or unsuccessful within 3s from the time when the connection is initiated, and the connection fails. Whether the connection is successful or failed, the corresponding connection record can be added for the subsequent IP address sorting basis.

If IP1, IP2 and IP3 all fail to connect, all the IP addresses in the racing connection group fail to connect. At this time, the racing connection needs to be started in the next racing connection group (including IP4, IP5, and IP 6), and the racing connection process is similar to the schematic of IP1, IP2, and IP3 in fig. 5, and will not be described again.

According to an embodiment of the present disclosure, the M IP addresses acquired in operation S220 are classified into two types, an IPv4 format address and an IPv6 format address. Therefore, when the M IP addresses are sequenced in operation S230 to obtain an IP address sequence, the IPv6 format addresses and the IPv4 format addresses in the M IP addresses may also be sequenced alternately, where the IPv6 format addresses are earlier than the IPv4 format addresses in the alternating sequencing. For example, the IPv6 format address and the IPv4 format address may be connected according to the history to be power-sorted into two columns, and then the two columns are alternately interleaved and combined into an address sequence, wherein the IPv6 is arranged before the IPv4 in the process of interleaving alternately.

At the transition stage from IPv4 to IPv6, the connectivity or reliability problem occurs in IPv6 in a certain proportion due to the fact that infrastructure is still imperfect at the initial stage of IPv6 construction. According to the embodiment of the disclosure, in an IPv4 and IPv6 dual-stack network environment, a client can simultaneously obtain IPv4 and IPv6 addresses corresponding to a domain name during a website access process, and sequentially and concurrently initiate network connections according to an IPv6 and IPv4 alternating sequence and with a time delay of, for example, a hundred millisecond order, until a certain IP address is successfully established, the IP address can be subsequently selected to send an actual transaction request. Therefore, the connection is established by preferentially selecting the IPv6 address format in the normal IPv6 network environment in a sequential trial mode. Moreover, through a concurrent trial mode, the method ensures that the connection can be rapidly degraded to the IPv4 in an IPv6 network abnormal scene, reduces the invalid waiting time of the user, and improves the user experience.

Meanwhile, when the IPv6 and the IPv4 addresses are sequenced, the IPv6 is arranged in front alternately, historical connection power of the IP addresses is considered comprehensively, the historical connection power of the IP addresses is preferentially used for carrying out racing connection on the IP addresses with high power, and the priority of trying to connect by using the IP addresses is reduced for the IP addresses with high historical racing failure rate, so that the preferential use of the IPv6 is guaranteed, the connection power can be increased under the weak network environment, and a user is helped to select the optimal connection address quickly.

According to the embodiment of the present disclosure, in the IP address sequence in which the IPv6 format address and the IPv4 format address are alternately ordered, N =2 may be set when the racing connection group is divided in operation S240, so that, when each racing connection group is an IPv6 format address and an IPv4 format address, a connection attempt may be initiated in parallel by the method of the embodiment of the present disclosure, and connection racing is performed. Fig. 6 and 7 illustrate an application example of alternately ordering IPv6 and IPv4 for contention connection. It is understood that this example is illustrative only and does not constitute any limitation on the embodiments of the present disclosure.

Fig. 6 schematically shows a flowchart of a network connection method applied to IPv6 and IPv4 racing connection according to an embodiment of the present disclosure.

As shown in fig. 6, the process can be divided into three phases of DNS resolution 601, address ordering 602, and connection bidding 603.

In DNS resolution 601: and simultaneously acquiring an AAAA record (IPv 6) and an A record resolution (IPv 4) address from the DNS server. Among them, AAAA record is a DNS record that resolves a domain name to an address in IPv6 format, and a record is a DNS record that resolves a domain name to an address in IPv4 format.

In address ordering 602: and connecting DNS analysis results with history to form power, alternately sequencing according to the sequence of IPv6 and IPv4, and ensuring that the sequence of IPv6 format is in the front. So that the connection can be established using IPV6 preferentially.

At the connection race 603: on the basis of serially and sequentially trying to establish connection with the server (cluster) 103 by using the IPv6 address, an asynchronous thread is newly added, connection with the server 103 is tried in parallel by using the IP address in the IPv4 format, and according to the successful connection condition and the connection time consumption, the IP address which successfully establishes the connection firstly is selected to send a subsequent actual transaction request.

To reduce the resource consumption of additional clients and servers for synchronously initiating IPv4 and IPv6 connections, after the IPv6 format address attempts to establish a connection for a period of time without success (e.g., extending for 300 ms), a thread for racing an IPv4 format IP address connection is started (see the foregoing illustration in fig. 4). And selecting an IP for subsequent connection according to the successful connection condition and the connection speed of IPv6 and IPv4 addresses in a racing connection group, and closing racing failed connection.

Therefore, under the IPv4/IPv6 dual-stack normal network environment, the connection can be established by preferentially using the IPv6 address, and the development trend of gradually migrating to the IPv6 address is met. In addition, the problem of poor user experience caused by unstable network environment and long time consumption for degrading the IPv4 in the early stage of IPv6 construction can be effectively solved, the degradation can be rapidly carried out in the IPv6 abnormal network environment, the network connection is established by using the IPv4 address, the user waiting time is reduced, and the user experience is improved.

Fig. 7 is a schematic diagram illustrating a network request transmission flow in the method flow illustrated in fig. 6.

As shown in fig. 7, according to the embodiment of the present disclosure, an original flow (i.e., a manner of sequentially trying to connect IP by IP) of a network library may be modified, and operations S701 to S709 are added.

In operation S701, a connection is newly established.

In operation S702, a candidate IP address (DNS resolution and ranking) is obtained: according to AAAA record (IPv 6) and A record analysis (IPv 4) addresses in the LocalDNS range of an operator, adjusting the sequence of IP addresses to be IPv6 and IPv4 alternately ordered and used by IPv6 preferentially; and sequentially using the sorted IP addresses as candidate IPs for the subsequent attempt to establish the connection.

In operation S703, it is determined whether the acquired candidate IP address satisfies a race condition: the racing condition can comprise that (1) the operator returns two types of IP addresses, wherein the first IP address is in an IPv6 format, and the second IP address is in an IPv4 format; (2) the IPv4 and IPv6 addresses in each racing connection group do not fail in the application use process. If the race condition is satisfied, operation S704 is continuously performed. If the competition conditions are not met, returning to the original flow of the network library.

In operation S704, a promoter thread 1 (IPv 6): an attempt is made to establish a connection using the IPv6 address format.

In operation S705, it is determined whether the sub-thread 1 can successfully establish a connection within a prescribed time (e.g., 300 ms). If the connection can be established through the IPv6 address, returning to the original flow of the network library and sending the network request data by using the connection;

in operation S706, if the sub-thread 1 is not successfully connected within the prescribed time, the sub-thread 2 (IPv 4): a parallel attempt is made to establish a connection using the IPv4 address format.

In operation S707, when the race is not completed, the network thread is blocked and the execution result of the sub-thread is waited for. If no blocking occurs, the connection is continuously waited for.

In operation S708, it is determined whether the race is ended: and if at least one of the two sub-threads is successfully connected or both of the two sub-threads fail, finishing the racing.

In operation S709, a connection racing winner is selected: selecting the IP address which successfully establishes the connection firstly, and subsequently sending network request data by the user; if the connection is not successfully established between the IPv4 address and the IPv6 address in one racing connection group, reselecting the IPv6 address and the IPv4 address in the next racing connection group, and re-executing the flows of the operation S701 to the operation S709 until the connection is successfully established or all the candidate IP addresses fail to throw out the connection abnormity.

Therefore, according to the historical successful connection condition, the IP address with high success rate is preferentially selected to try to establish the connection, and the frequent concurrent increase of CPU, memory and network overhead caused by multiple racing connections is reduced. And in an IPv4/IPv6 dual-stack but IPv6 abnormal network environment, the degradation can be rapidly carried out, the network connection is established by using the IPv4 address, the waiting time of a user is reduced, and the user experience is improved.

Fig. 8 schematically illustrates a block diagram of a network connection device 800 according to an embodiment of the disclosure.

As shown in fig. 8, the network connection apparatus 800 according to the embodiment of the present disclosure may include a request receiving module 810, a first obtaining module 820, an ordering module 830, a group dividing module 840, and a racing connection module 850. According to other embodiments of the present disclosure, the network connection apparatus 800 may further include a second obtaining module 860, and/or a communication control module 870, and/or a connection record updating module 880. The network connection apparatus 800 may be used to implement the network connection method described with reference to fig. 2 to 7.

Specifically, the request receiving module 810 is configured to receive a network connection request.

The first obtaining module 820 is configured to obtain M IP addresses corresponding to a website to be accessed based on the network connection request, where M is an integer greater than or equal to 2.

The sorting module 830 is configured to sort the M IP addresses according to the historical connection power of each IP address in the M IP addresses to obtain an IP address sequence; and the IP addresses with higher power are sorted in the M IP addresses in advance.

The group dividing module 840 is configured to divide each N IP addresses in the IP address sequence into a racing connection group, so as to obtain an address group sequence, where N is an integer greater than or equal to 2, and N is not greater than M.

The racing connection module 850 is configured to preferentially use the N IP addresses in the racing connection group ranked in the top in parallel to initiate a connection attempt according to the sequence of each racing connection group in the address group sequence until any one IP address is successfully connected or M IP addresses are all unsuccessfully connected.

The second obtaining module 860 is configured to obtain a historical connection success rate of each IP address in the M IP addresses before the M IP addresses are sorted, where the historical connection power of one IP address includes a historical connection success number and a connection success time of the IP address, or a historical connection failure number and a connection failure time of the IP address.

The communication control module 870 is configured to select the IP address with the first successful connection for subsequent data communication after any one of the IP addresses is successfully connected.

The connection record updating module 880 is configured to update the historical connection power of each IP address in the M IP addresses according to the connection success or failure condition of the M IP addresses in the network connection process.

Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.

For example, any of the request receiving module 810, the first obtaining module 820, the sorting module 830, the group dividing module 840, the racing connection module 850, the second obtaining module 860, the communication control module 870, and the connection record updating module 880 may be combined into one module to be implemented, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the request receiving module 810, the first obtaining module 820, the ordering module 830, the group dividing module 840, the racing connection module 850, the second obtaining module 860, the communication control module 870, and the connection record updating module 880 may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or as hardware or firmware in any other reasonable manner of integrating or packaging circuits, or as any one of three implementations of software, hardware, and firmware, or as a suitable combination of any of them. Alternatively, at least one of the request receiving module 810, the first obtaining module 820, the ranking module 830, the group partitioning module 840, the racing connection module 850, the second obtaining module 860, the communication control module 870, and the connection record updating module 880 may be implemented at least in part as a computer program module that, when executed, may perform corresponding functions.

Fig. 9 schematically shows a block diagram of an electronic device 900 adapted to implement a network connection method according to an embodiment of the present disclosure. The electronic device 900 shown in fig. 9 is only an example and should not bring any limitations to the functionality and scope of use of the embodiments of the present disclosure.

As shown in fig. 9, an electronic apparatus 900 according to an embodiment of the present disclosure includes a processor 901 which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 902 or a program loaded from a storage portion 908 into a Random Access Memory (RAM) 903. Processor 901 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 901 may also include on-board memory for caching purposes. The processor 901 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.

In the RAM 903, various programs and data necessary for the operation of the electronic apparatus 900 are stored. The processor 901, the ROM 902, and the RAM 903 are connected to each other through a bus 904. The processor 901 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 902 and/or the RAM 903. Note that the programs may also be stored in one or more memories other than the ROM 902 and the RAM 903. The processor 901 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.

Electronic device 900 may also include input/output (I/O) interface 905, input/output (I/O) interface 905 also connected to bus 904, according to an embodiment of the present disclosure. The electronic device 900 may also include one or more of the following components connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.

According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 909, and/or installed from the removable medium 911. The computer program, when executed by the processor 901, performs the above-described functions defined in the system of the embodiment of the present disclosure. The above described systems, devices, apparatuses, modules, units, etc. may be implemented by computer program modules according to embodiments of the present disclosure.

The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement a method according to an embodiment of the disclosure.

According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 902 and/or the RAM 903 described above and/or one or more memories other than the ROM 902 and the RAM 903.

Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method provided by the embodiments of the present disclosure, when the computer program product is run on an electronic device, the program code being adapted to cause the electronic device to carry out the image recognition method provided by the embodiments of the present disclosure.

The computer program, when executed by the processor 901, performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure. The above described systems, devices, modules, units, etc. may be implemented by computer program modules according to embodiments of the present disclosure.

In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, and the like. In another embodiment, the computer program may also be transmitted in the form of a signal over a network medium, distributed, and downloaded and installed via the communication section 909 and/or installed from the removable medium 911. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The embodiments of the present disclosure are described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the disclosure, and these alternatives and modifications are intended to fall within the scope of the disclosure.

Claims

1. A network connection method, comprising:

receiving a network connection request;

acquiring M IP addresses corresponding to the websites to be accessed based on the network connection request, wherein M is an integer greater than or equal to 2;

connecting power according to the history of each IP address in the M IP addresses, and sequencing the M IP addresses to obtain an IP address sequence; the historical connected IP addresses with higher power in the M IP addresses are ranked more forward;

dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence, wherein N is an integer greater than or equal to 2 and is less than or equal to M; and

and according to the sequence of each racing connection group in the address group sequence, preferably using N IP addresses in the racing connection group with the highest sequence to initiate a connection attempt in parallel until any one IP address is successfully connected or all the M IP addresses are failed to be connected.

2. The method of claim 1, wherein prior to said sorting the M IP addresses according to their historical connection success rates, the method further comprises:

and acquiring the historical connection power of each IP address in the M IP addresses, wherein the historical connection power of one IP address comprises the historical connection success times and connection success time or the historical connection failure times and connection failure time of the IP address.

3. The method of claim 2, wherein the sorting the M IP addresses according to their historical connection success rates comprises at least one of:

the higher the historical connection success frequency, the higher the ranking of the IP addresses;

when the historical connection success times are the same, the closer the IP address sequence of the latest connection success time to the current time is;

the higher the historical connection failure times, the later the IP address sequencing is; or

When the historical connection failure times are the same, the IP addresses which are closer to the current time at the latest connection failure time are ranked more backwards.

4. The method of claim 1, wherein initiating connection attempts in parallel by N IP addresses within the racing connection group comprises:

within the group of racing connections,

initiating a connection attempt by the first IP address; and

initiating a connection attempt by a second IP address in response to a predetermined time after the initiation of the connection attempt by the first IP address and the network not yet being successfully connected;

the first IP address and the second IP address are two IP addresses which are arranged in the racing connection group and are adjacent to each other before and after the ranking.

5. The method of claim 4, wherein the prioritizing the N IP addresses in the racing connection groups that are ranked first in the precedence order of the respective racing connection groups in the address group sequence to initiate connection attempts in parallel comprises:

after the N IP addresses in the first racing connection group are failed to be connected, the N IP addresses in the second racing connection group are used for initiating connection attempts in parallel;

the first racing connection group and the second racing connection group are two racing connection groups which are immediately adjacent to each other in sequence in the address group sequence.

6. The method of claim 1, wherein the method further comprises:

and selecting the IP address which is successfully connected firstly for subsequent data communication.

7. The method of claim 1, wherein the method further comprises:

and updating the historical connection power of each IP address in the M IP addresses according to the successful or failed connection condition of the M IP addresses in the network connection process.

8. The method according to any one of claims 1 to 7, wherein the M IP addresses are classified into two types, an IPv4 format address and an IPv6 format address; wherein the sorting the M IP addresses to obtain the IP address sequence further comprises:

alternately sequencing the addresses in the IPv6 format and the addresses in the IPv4 format in the M IP addresses, wherein the addresses in the IPv6 format are earlier than the addresses in the IPv4 format in the alternate sequencing; wherein N =2.

9. A network connection device comprising:

a request receiving module for receiving a network connection request;

a first obtaining module, configured to obtain, based on the network connection request, M IP addresses of a website to be accessed, where the M IP addresses correspond to M network systems, and M is an integer greater than or equal to 2;

the sorting module is used for connecting power according to the history of each IP address in the M IP addresses and sorting the M IP addresses to obtain an IP address sequence; the historical IP addresses in the M IP addresses are connected to be higher in power, and the IP addresses are ranked more front;

the group division module is used for dividing every N IP addresses in the IP address sequence into a racing connection group to obtain an address group sequence, wherein N is an integer greater than or equal to 2, and N is less than or equal to M; and

and the racing connection module is used for preferentially using N IP addresses in the racing connection group with the top sequence to initiate a connection attempt in parallel according to the sequence of each racing connection group in the address group sequence until any one IP address is successfully connected or all the M IP addresses are failed to be connected.

10. An electronic device, comprising:

one or more memories storing executable instructions; and

one or more processors executing the executable instructions to implement the method of any one of claims 1-8.

11. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method according to any one of claims 1 to 8.