CN114268577A

CN114268577A - Method, device, equipment and storage medium for establishing network connection

Info

Publication number: CN114268577A
Application number: CN202010973723.5A
Authority: CN
Inventors: 刘鹏; 耿亮; 姚惠娟; 杜宗鹏
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Priority date: 2020-09-16
Filing date: 2020-09-16
Publication date: 2022-04-01
Anticipated expiration: 2040-09-16
Also published as: CN114268577B

Abstract

The invention discloses a method, a device, equipment and a storage medium for establishing network connection. Wherein the method comprises the following steps: acquiring service connection requests respectively sent by a plurality of user nodes; the traffic connection request is used for requesting to establish network connection with a target service node in a deterministic international interconnect protocol (DIP) network; determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count.

Description

Method, device, equipment and storage medium for establishing network connection

Technical Field

The present invention relates to the field of wireless technologies, and in particular, to a method, an apparatus, a device, and a storage medium for establishing a network connection.

Background

With the rapid development of network technologies, in order to ensure delay certainty of services, Deterministic networks are developed more and more rapidly, for example, a Deterministic Internet Protocol (DIP) network can implement end-to-end delay certainty and provide capability of ensuring Deterministic services for services carried in a network region. The DIP network architecture can be composed of a sending end, an entrance gateway, a router supporting DIP capability, an exit gateway and a receiving end. Generally, a DIP network can guarantee low-delay transmission from a transmitting end to a receiving end to a certain extent, but when a plurality of transmitting ends exist, the time delay consistency of a plurality of users under the same service cannot be guaranteed.

Disclosure of Invention

In view of this, embodiments of the present invention are to provide a method, an apparatus, a device, and a storage medium for establishing a network connection.

The technical scheme of the embodiment of the invention is realized as follows:

at least one embodiment of the present invention provides a method for establishing a network connection, including:

acquiring service connection requests respectively sent by a plurality of user nodes; the service connection request is used for requesting to establish network connection with a target service node in the DIP network;

determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets;

counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets;

and establishing network connection between each user node and the target service node based on the paths with the same hop count.

Further, in accordance with at least one embodiment of the present invention, the method further comprises:

acquiring the service type and the geographical position requested by each user node in the plurality of user nodes;

for each user node in the plurality of user nodes, determining a plurality of first service nodes corresponding to the corresponding user node based on the service type requested by the corresponding user node;

selecting a second service node which meets the preset condition with the geographical position of each user node from the plurality of first service nodes to obtain a plurality of second service nodes;

determining the target serving node based on the plurality of second serving nodes.

Further in accordance with at least one embodiment of the present invention, the determining the target serving node based on the plurality of second serving nodes comprises:

judging whether the plurality of second service nodes are the same service node or not;

and when the plurality of second service nodes are determined to be the same service node, taking any one of the plurality of second service nodes as the target service node.

Further in accordance with at least one embodiment of the present invention, the determining the set of paths from the respective user node to the target service node comprises:

acquiring the time delay requirement of the corresponding user node on the DIP network; acquiring the period of a scheduling queue of the DIP network;

determining a first path constraint condition by using the time delay requirement and the period; the first path constraint condition represents a constraint condition that the hop count corresponding to the path from the corresponding user node to the target service node is satisfied;

and determining a path set from the corresponding user node to the target service node by using the first path constraint condition.

judging whether the plurality of second service nodes are different service nodes or not;

when the plurality of second service nodes are determined to be different service nodes, determining a path from the corresponding user node to the corresponding second service node aiming at each user node in the plurality of user nodes to obtain a plurality of paths;

determining hop counts corresponding to the paths respectively to obtain at least two hop counts;

and taking the second service node corresponding to the maximum hop count in the at least two hop counts as the target service node.

acquiring a time delay requirement of the corresponding user node on the DIP network and a first period of a corresponding second service node scheduling queue; acquiring a second period of a scheduling queue of the DIP network;

determining a second path constraint condition using the time delay requirement, the first period and the second period; the second path constraint condition represents a constraint condition that the hop number corresponding to the path from the corresponding user node to the target service node meets;

and determining a path set from the corresponding user node to the target service node by using the second path constraint condition.

Further, according to at least one embodiment of the present invention, the selecting paths with the same hop count from the plurality of path sets includes:

when the plurality of path sets do not comprise paths with the same hop count, selecting a first path with the minimum hop count from the corresponding path set aiming at each path set of the plurality of path sets to obtain a plurality of first paths;

determining a second path with the largest hop count in the plurality of first paths; and setting at least one virtual node in a third path of the plurality of first paths based on the second path; the third path is the other path except the second path in the plurality of first paths;

and taking a third path provided with the at least one virtual node and the second path as paths with the same hop count.

At least one embodiment of the present invention provides an apparatus for establishing a network connection, including:

the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring service connection requests respectively sent by a plurality of user nodes; the service connection request is used for requesting to establish network connection with a target service node in the DIP network;

a first processing unit, configured to determine, for each user node in the multiple user nodes, a path set from the corresponding user node to the target service node, so as to obtain multiple path sets;

the second processing unit is used for counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; establishing network connection between each user node and the target service node based on the paths with the same hop count

Furthermore, in accordance with at least one embodiment of the present invention, the first processing unit is further configured to:

Furthermore, according to at least one embodiment of the present invention, the first processing unit is specifically configured to:

Furthermore, according to at least one embodiment of the present invention, the second processing unit is specifically configured to:

At least one embodiment of the present invention provides a network device, including:

a communication interface, configured to obtain service connection requests sent by multiple user nodes respectively; the service connection request is used for requesting to establish network connection with a target service node in the DIP network;

a processor, configured to determine, for each user node in the plurality of user nodes, a path set from the corresponding user node to the target service node, so as to obtain a plurality of path sets; the method is also used for counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count.

At least one embodiment of the invention provides a network device comprising a processor and a memory storing a computer program capable of running on the processor,

wherein the processor is configured to perform the steps of any of the above methods when running the computer program.

At least one embodiment of the invention provides a storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of any of the methods described above.

The method, the device, the equipment and the storage medium for establishing network connection provided by the embodiment of the invention are used for acquiring service connection requests respectively sent by a plurality of user nodes; the service connection request is used for requesting to establish network connection with a target service node in the DIP network; determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count. By adopting the technical scheme of the embodiment of the invention, when a plurality of user nodes in the DIP network initiate service connection requests, the path sets from the user nodes to the same target service node are determined to obtain a plurality of path sets, paths with the same hop count are selected from the path sets, and the paths with the same hop count are utilized to ensure the time delay consistency of the users under the same service.

Drawings

Fig. 1 is a schematic diagram of an architecture of a DIP network in the related art;

fig. 2 is a diagram illustrating a DIP network providing a service to a plurality of users in the related art;

fig. 3 is a schematic flow chart illustrating an implementation of the method for establishing a network connection according to the embodiment of the present invention;

FIG. 4 is a flow chart illustrating an implementation of determining a target service node according to an embodiment of the present invention;

FIG. 5 is a diagram illustrating a path from a user node to a target service node according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a process for implementing the core algorithm of OSPF according to an embodiment of the present invention;

FIG. 7 is a flow chart illustrating an implementation of determining a set of paths from a corresponding user node to a target service node according to an embodiment of the present invention;

FIG. 8 is a flow chart illustrating an implementation of determining a set of paths from a corresponding user node to a target service node according to an embodiment of the present invention;

FIG. 9 is a flow chart illustrating an implementation of multiple user nodes accessing a deterministic network according to an embodiment of the present invention;

FIG. 10 is a schematic diagram of a deterministic network architecture of an embodiment of the present invention;

fig. 11 is a schematic structural diagram of an apparatus for establishing a network connection according to an embodiment of the present invention;

FIG. 12 is a schematic diagram of the structure of a network device according to an embodiment of the present invention;

Detailed Description

Before the technical solution of the embodiment of the present invention is introduced, a description is given of a related art.

In the related art, applications such as Augmented Reality (AR)/Virtual Reality (VR), precise industrial control and the like have provided strict and definite demands for the upper and lower boundaries (i.e., jitter) of network delay, and the "best effort" service capability provided by the conventional network cannot be satisfied. For example, in a typical power differential protection scenario of Ultra-high reliable and Low-Latency communication (URLLC), when a switch action command is issued, communication content between a master terminal and a slave terminal relates to electrical vector comparison and communication transmission channel path parameter verification, and a network is required to provide the capability of providing a deterministic index of "20 ms deterministic Latency with jitter not higher than 600 us".

In the related art, a network capable of ensuring the delay certainty of a service includes: Time-Sensitive Networking (TSN), DetNet, DIP. The following details three networks:

the TSN can guarantee the determinacy of time delay, jitter, packet loss rate and the like, and provide extreme network bearing service. In 2015, the IEEE established AVB working group aims to formulate a new ethernet architecture transmission protocol set suitable for real-time audio/video transmission, solve the problems of time sequence, low delay and traffic shaping existing in the original standard ethernet transmission, and simultaneously keep 100% backward compatibility with the traditional ethernet, which is an earlier exploration on a 2-layer deterministic network technology. The AVB working group developed to TSN working group 2012, TSN is an extension to IEEE 802.1 ethernet, and 56 is a set of compatibility extension standards developed by the time-sensitive network task group of IEEE 802.1 based on the existing ethernet standard. The TSN expands the requirement range of the original AVB task group, and the established TSN standard not only meets the requirement of real-time audio and video, but also meets other fields such as industrial control, automobile control and the like with the time-sensitive requirement of traffic flow transmission, and is a network technology with great development prospect for meeting the time-sensitive service transmission requirement.

With the development of services, the network deterministic service highly sensitive to network indexes such as time delay, packet loss and jitter is not limited to a two-layer network, but also can be expanded to a three-layer network. Such as forward transmission, intermediate transmission and return transmission of a mobile network, an electric power system, an automatic building system, a vehicle networking system, a block chain, a network slice, a mine system and the like, and the subsystems of different regions and different areas of the same system are communicated and cooperated. The deterministic network (DetNet) integrates the technical mechanism and architecture of the TSN at L2, and provides a deterministic network technical solution on L3 (L2 compliant).

DIP, on the basis of inheriting the advantages of IP statistical multiplexing, provides a mechanism based on deterministic message scheduling and end-to-end delay guarantee, realizes end-to-end delay determinacy and large-scale expandability of a three-layer large network, and provides full-grade and differentiated Quality of Service (QoS) capability.

Fig. 1 is a schematic diagram of a DIP network in the related art, and as shown in fig. 1, the DIP network includes: a sending end (Sender), an entrance gateway (I-GW), a Router (Router) supporting DIP capability, an exit gateway (E-GW) and a receiving end (Receiver), the whole flow is as follows: step 1, all network equipment (without terminal equipment) needs to keep microsecond-level periods relatively fixed; step 2, reserving all bandwidth resources along the way for each deterministic service; step 3, starting to transmit the message of the deterministic service, wherein the flow model of the user message needs to meet the constraint of resource reservation; step 4, the entrance gateway needs to carry out flow shaping on the user message, marks an initial period label for the message, and formally enters a DIP period forwarding flow; the data packet carries a period label and is sent to downstream equipment, and after the data packet reaches the DIP router, the router replaces the period label in the data packet according to a locally maintained period mapping relation table and sends the data packet into a corresponding queue to wait for forwarding; each DIP router and egress gateway (E-GW) maintains a specific number of DIP queues and performs periodic gating scheduling on these queues.

The DIP network can guarantee low delay and deterministic forwarding of the network to a certain extent, but cannot guarantee service consistency of multiple users under the same service, which can result in experience difference and unfairness of the multiple users in the same service, that is, when different users perform the same service, different time delays and jitters can be caused due to different geographical positions and different network topologies, so that services with the same time delay and jitter guarantee originally need to be obtained, and the difference and the unfairness exist. For example, fig. 2 is a schematic diagram of a DIP network providing the same service to multiple users in the related art, as shown in fig. 2, a user Client a and a user Client B simultaneously apply for the same service, the delay of the user Client a is 20ms, the delay of the user Client B is 30ms, and it can be seen that both a and B meet the delay requirement, but the delay of B is permanently greater than that of a and is not fair to B, assuming that the service requirement is within 50 ms. In particular in businesses such as cloud games, a and B are in the same game pair, which is naturally at a disadvantage for B because of network problems. In the current game industry, in order to guarantee the independent consumption of network service quality, a plurality of users theoretically maintain the service consistency under the condition that the time delay is met. In the future, industrial internet and remote AR/VR (AR/VR) conferences can emerge a scene of cooperation of multiple parties, and the requirement on service consistency is increased. If only one service flow exists in the DIP network, the period of different paths can be adjusted to ensure that the time delays of two links are consistent, i.e. service consistency, however, DIP is oriented to a large-range network, multiple service flows generally exist in the network, and the time delay, jitter and the like required by each service flow may be different, so that service consistency cannot be ensured by adjusting the period. That is, the DIP can only solve deterministic forwarding after stream aggregation, and cannot adjust a queue conversion period by a certain service requirement.

Based on this, in various embodiments of the present invention, service connection requests respectively sent by a plurality of user nodes are obtained; the service connection request is used for requesting to establish network connection with a target service node in the DIP network; determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count.

The present invention will be described in further detail with reference to the accompanying drawings and examples.

An embodiment of the present invention provides a method for establishing a network connection, as shown in fig. 3, the method includes:

step 301: acquiring service connection requests respectively sent by a plurality of user nodes; the service connection request is used for requesting to establish network connection with a target service node in the DIP network;

step 302: determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets;

step 303: counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets;

step 304: and establishing network connection between each user node and the target service node based on the paths with the same hop count.

Here, in step 301, the plurality of user nodes may refer to a plurality of transmitting ends in a DIP network architecture. The geographical locations of the plurality of user nodes may be the same or different. The network topologies relied on by the plurality of user nodes may be the same or different, for example, the network topology relied on by the user node a may be a network topology suitable for VIP users, and the network topology relied on by the user node B may be a network topology suitable for common users; the network topology may refer to a distribution situation and a connection state of each network device in the DIP network.

Here, in step 302, when the plurality of user nodes request the DIP network to provide the same service, a target service node may be determined for the plurality of user nodes, and the target service node is utilized to provide the same service to the plurality of user nodes, so that a network connection between each user node and the target service node may be established subsequently by selecting a path with the same hop count, so as to ensure the delay consistency of the plurality of user nodes in the same service. The time delay consistency may refer to that a plurality of user nodes establish connection with a target service node at the same time, perform a service request, and the like.

Here, in step 303, for each of the plurality of user nodes, there may be a plurality of paths from the corresponding user node to the target service node, and the hop count corresponding to each path may be the same or different. The hop count may refer to the user node reaching the target service node through several network devices. In order to ensure the time delay consistency of each user node under the same service, paths with the same hop count can be selected from path sets respectively corresponding to a plurality of user nodes, and network connection from the plurality of user nodes to a target service node is established based on the selected paths with the same hop count. In the process of selecting paths with the same hop count from path sets corresponding to a plurality of user nodes, if a plurality of paths with the same hop count are selected from a path set corresponding to a certain user node, a path with the minimum network load may be selected from the paths with the same hop count as a path with the same hop count corresponding to the user node, or a path may be randomly selected from the paths with the same hop count as a path with the same hop count corresponding to the user node. For example, assuming that a plurality of user nodes are represented by a node 1, a node 2, and a node 3, a set of paths corresponding to the node 1 is represented by a set 1, a set of paths corresponding to the node 2 is represented by a set 2, and a set of paths corresponding to the node 3 is represented by a set 3, when a path having a hop count equal to 3 is selected from the

sets

1, 2, and 3, if a path having a hop count equal to 3 is selected from the set 1, a path having the smallest network load among the 2 paths is taken as a path having a hop count equal to 3 corresponding to the node 1, or one path is randomly selected from the 2 paths as a path having a hop count equal to 3 corresponding to the node 1. The path selection conditions for the set 2 and the set 3 are the same as the set 1, and are not described herein again.

Here, in step 304, in an actual application, in the DIP network, in order to implement the time delay consistency of multiple user nodes under the same service, network connections between each user node and the target service node may be established by using paths with the same hop count; the time delay consistency may mean that the time delays of the target service node providing the same service to the plurality of user nodes are the same.

In practical application, considering that a plurality of service nodes providing the same service to a plurality of user nodes may be provided, and the geographic locations of the plurality of service nodes may be different, a target service node providing the same service to the plurality of user nodes may be determined based on the service types requested by the plurality of user nodes and the geographic locations where the plurality of service nodes are located.

Based on this, in an embodiment, the method further comprises:

Here, the service identifier of each user node in the plurality of user nodes may be obtained, and the service type requested by each user node may be determined according to the correspondence between the service identifier and the service type.

Here, the preset condition may mean that a distance between the first serving node and the user node is less than or equal to a distance threshold.

Table 1 shows a correspondence between a service identifier and a service type, and as shown in table 1, if the service identifier is 1, the corresponding service type is a video service; if the service identifier is 2, the corresponding service type is a live broadcast service; and if the service identifier is 3, the corresponding service type is the browser service.

Service identification	Type of service
		1	Video service
2	Live broadcast service
		3	Browser service

TABLE 1

For example, suppose a user node is represented by Client A, Client B, and Client C; the first service nodes corresponding to the Client A are a service node 1, a service node 2 and a service node 3, and the second service node of which the geographical position with the Client A meets the preset condition is a service node 2; the first service nodes corresponding to the Client B are a service node 1, a service node 3 and a service node 4, and the second service node meeting the preset conditions with the geographic position of the Client B is the service node 3; the first service nodes corresponding to the Client C are the service node 1, the service node 3 and the service node 5, and the second service node, the geographical position of which with the Client C meets the preset condition, is the service node 3.

A detailed description of how to determine the target serving node based on the plurality of second serving nodes follows.

In the first case, the target serving node is determined in case that a plurality of second serving nodes are the same serving node.

In a second case, the target serving node is determined in case that the plurality of second serving nodes are not the same serving node.

For the first situation, in practical application, when it is determined that the service node of each user node is the same service node based on the service type requested by each user node and the geographical location of the service node, the service node may be used as a target service node, and subsequently, a network connection between each user node and the target service node may be established, so as to satisfy the time delay consistency of multiple user nodes under the same service.

Based on this, in an embodiment, the determining the target serving node based on the plurality of second serving nodes includes:

For example, suppose a user node is represented by Client A, Client B, and Client C; the first service nodes corresponding to the Client A are a service node 1, a service node 2 and a service node 3, and the second service node of which the geographical position with the Client A meets the preset condition is a service node 2; the first service nodes corresponding to the Client B are a service node 1, a service node 2 and a service node 4, and the second service node of which the geographical position meets the preset condition with the Client B is the service node 2; the first service nodes corresponding to the Client C are the service node 1, the service node 2 and the service node 5, and the second service node, the geographical position of which with the Client C meets the preset condition, is the service node 2. It can be seen that the service nodes corresponding to the Client a, the Client B, and the Client C are all the service node 2, so that the service node 2 is taken as a target service node.

For the second situation, in practical application, when it is determined that the service nodes of each user node are not the same service node based on the service type requested by each user node and the geographical location where the service node is located, one service node may be determined from a plurality of service nodes as a target service node, and subsequently, a network connection between each user node and the target service node may be established, so as to satisfy the time delay consistency of the plurality of user nodes under the same service.

For example, suppose a user node is represented by Client A, Client B, and Client C; the first service nodes corresponding to the Client A are a service node 1, a service node 2 and a service node 3, and the second service node of which the geographical position with the Client A meets the preset condition is a service node 2; the first service nodes corresponding to the Client B are a service node 1, a service node 3 and a service node 4, and the second service node meeting the preset conditions with the geographic position of the Client B is the service node 3; the first service nodes corresponding to the Client C are the service node 1, the service node 3 and the service node 5, and the second service node, the geographical position of which with the Client C meets the preset condition, is the service node 3. It can be seen that the service nodes corresponding to the Client a, the Client B and the Client C are not the same service node, so that the path from the Client a to the service node 2 and the hop count corresponding to the path are determined, and the assumption is 3; the path from the Client B to the service node 3 and the hop count corresponding to the path are assumed to be 4; assuming that the path from the Client C to the service node 3 and the hop count corresponding to the path are 5, the service node 3 is taken as the target service node.

In one example, as shown in FIG. 4, a process for determining a target serving node is described, comprising:

step 401: and acquiring the service type and the geographical position requested by each user node.

Step 402: and determining service nodes corresponding to the user nodes respectively based on the service types and the geographic positions.

Here, as shown in fig. 5, it is assumed that the user node is represented by Client a, Client B, and Client C, and the service node corresponding to the user node Client a is represented by Server 1; the service node corresponding to the user node Client B is represented by a Server 2; the service node corresponding to the user node Client C is denoted by Server 3. The Server1, the Server2 and the Server3 provide the same service for the three user nodes.

Step 403: when the service nodes respectively corresponding to the user nodes are not the same service node, determining a path from the corresponding user node to the corresponding service node aiming at each user node in the user nodes to obtain a plurality of paths;

here, as shown in fig. 5, the service nodes corresponding to the three user nodes are not the same service node, and the path from Client a to Server1 is: client A-edge gateway 1-router 2-router 3-Server 1; the path from Client B to Server2 is: client B-edge gateway B-router 4-router 5-Server 2; the path from Client C to Server2 is: client C-edge gateway 1-router 6-router 7-Server 1.

Step 404: determining hop counts corresponding to the paths respectively to obtain at least two hop counts; and taking the service node corresponding to the maximum hop count of the at least two hop counts as a target service node.

Here, the hop count corresponding to the path from Client a to Server1 is 1+1+1+1 is 4; the hop count corresponding to the path from Client B to Server2 is 1+1+1 is 3; the hop count corresponding to the path from Client C to Server3 is 1+1+1 or 3. Since 3<4, the Server1 is the target serving node.

Here, determining the target service node has the following advantages:

the same target service node is selected by comprehensively considering the position conditions of the plurality of user nodes, and the probability of selecting paths with the same hop count from the path set from the plurality of user nodes to the target service node can be improved subsequently, so that the maximum probability ensures the time delay consistency of the plurality of user nodes under the same service, and the fairness of each user node is realized.

The following describes how to determine the path set from the corresponding user node to the target service node.

In the first case, in the case that a plurality of second service nodes are the same service node, a set of paths from the corresponding user node to the target service node is determined.

In a second case, in a case where the plurality of second service nodes are not the same service node, a set of paths from the corresponding user node to the target service node is determined.

For the first situation, in practical application, when it is determined that the service node of each user node is the same service node based on the service type requested by each user node and the geographical location of the service node, it is considered that there are multiple paths from the corresponding user node to the target service node, and the hop count corresponding to each path may be the same or different, and since not all paths can satisfy the time delay consistency, it is possible to determine multiple paths from the corresponding user node to the target service node that satisfy the self time delay requirement, and obtain multiple paths; and selecting a path meeting the time delay consistency from the paths, and establishing network connection between the corresponding user node and the target service node based on the selected path.

Based on this, in an embodiment, the determining the set of paths from the corresponding user node to the target service node includes:

Here, the period of the scheduling queue of the DIP network may refer to a period of the scheduling queue of other network devices, such as a gateway, a router, and the like, except for the user node and the service node in the DIP network; the queue may refer to a queue formed by service connection requests sent by a sending end.

Here, the First Path constraint condition may be utilized by a SPF algorithm (CSPF, Constrained short Path First) C algorithm with an additional condition to determine a Path set from the corresponding user node to the target service node. The CSPF algorithm, i.e. the path constraints can be increased on the basis of SPF to obtain the desired path. For example, find shortest paths that satisfy a bandwidth >10 mbps with a latency less than 100 ms.

Here, in practical application, the Path set from the corresponding user node to the target service node may also be determined by using Open Shortest Path First (OSPF). The OSPF algorithm can find the shortest distance between two specified nodes from the network. The implementation process of the OSPF algorithm can be described as follows: two adjacent routers become a neighbor relation by sending a message, the neighbors send link state information to each other to form an adjacency relation, then the routes are respectively calculated according to a shortest path algorithm and are placed in an OSPF (open shortest Path first) routing table, and the OSPF routes are preferably added into a global routing table after being compared with other routes. Fig. 6 is a schematic diagram of an implementation process of the OSPF algorithm, and as shown in fig. 6, the implementation process of the core algorithm of the OSPF includes: dijkstra shortest paths, which are generated in order of increasing length. That is, after the path lengths of all visible points are sorted each time, a shortest path is selected, and the path is the shortest path from the corresponding vertex to the source point.

For the second case, in practical application, when it is determined that the service nodes of the user nodes are not the same service node based on the service types requested by the user nodes and the geographic locations of the user nodes, it is necessary to determine one service node from a plurality of service nodes as a target service node. In addition, considering that there are multiple paths from the corresponding user node to the target service node, and the hop count corresponding to each path may be the same or different, since not all paths can satisfy the time delay consistency, multiple paths from the corresponding user node to the target service node can be determined to satisfy the self time delay requirement, and multiple paths are obtained; and selecting a path meeting the time delay consistency from the paths, and establishing network connection between the corresponding user node and the target service node based on the selected path.

Here, the second period may refer to a period of a scheduling queue of other network devices, such as a gateway and a router, in the DIP network except for the user node and the service node; the queue may refer to a queue formed by service connection requests sent by a sending end.

In an example, as shown in fig. 7, a process for determining a set of paths for a respective user node to a target service node is described, comprising:

step 701: and acquiring the service type and the geographical position requested by each user node.

Step 702: and determining service nodes corresponding to the user nodes respectively based on the service types and the geographic positions.

Step 703: judging whether the service nodes respectively corresponding to the user nodes are the same service node or not; when it is determined that the service nodes respectively corresponding to the user nodes are the same service node, executing step 704;

step 704: acquiring the time delay requirement of the corresponding user node on the DIP network; acquiring the period of a scheduling queue of the DIP network; determining a first path constraint condition by using the time delay requirement and the period;

the first path constraint condition represents a constraint condition that the hop count corresponding to the path from the corresponding user node to the target service node is satisfied;

step 705: and determining a path set from the corresponding user node to the target service node by using the first path constraint condition.

In an example, as shown in fig. 8, a process for determining a set of paths for a respective user node to a target service node is described, comprising:

step 801: and acquiring the service type and the geographical position requested by each user node.

Step 802: and determining service nodes corresponding to the user nodes respectively based on the service types and the geographic positions to obtain a plurality of service nodes.

Step 803: judging whether the service nodes respectively corresponding to the user nodes are different service nodes or not; when determining that the service nodes respectively corresponding to the user nodes are different service nodes, executing step 804;

step 804: acquiring the time delay requirement of the corresponding user node on the DIP network, a first period of a service node scheduling queue corresponding to the corresponding user node and a second period of the DIP network scheduling queue; and determining a second path constraint condition by using the time delay requirement, the first period and the second period.

Here, the first path constraint condition represents a constraint condition that a hop count corresponding to a path from the corresponding user node to the target service node satisfies;

step 805: and determining a path set from the corresponding user node to the target service node by using the second path constraint condition.

The following describes how to select paths with the same hop count from the multiple path sets.

In the first case, when a plurality of path sets include paths having the same hop count, the paths having the same hop count are determined.

In the second case, when the plurality of path sets do not include paths having the same hop count, paths having the same hop count are determined.

In the first case, in actual use, when a path with the same hop count can be selected from among a plurality of path sets, a path with the same hop count is directly selected from among the plurality of path sets.

Based on this, in an embodiment, the selecting paths with the same hop count from the multiple path sets includes:

judging whether the plurality of path sets contain paths with the same hop count;

and when determining that the paths with the same hop count are contained in the path sets, selecting the paths with the same hop count from the path sets.

For the second situation, in practical application, when a path with the same hop count cannot be selected from multiple path sets, in order to meet the delay consistency of multiple user nodes under the same service, a path with the minimum hop count may be selected from each path set in the multiple path sets to obtain multiple paths; and setting virtual nodes in other paths except the path with the maximum hop count in the paths so as to ensure that the hop counts of the paths are the same.

For example, suppose a user node is represented by Client A, Client B, and Client C; the path set corresponding to the Client A is represented by a set 1, wherein the set 1 comprises a path 1, a path 2 and a path 3, and the corresponding hop counts are 3, 4 and 5 respectively; the path set corresponding to the Client B is represented by a set 2, wherein the set 2 comprises a path 3 and a path 4, and the corresponding hop counts are 5 and 6 respectively; the set of paths corresponding to the Client C is represented by a set 3, the set 3 includes a path 5, a path 6, and a path 7, and the corresponding hop counts are 6, 7, and 8, respectively. It can be seen that the

sets

1, 2 and 3 do not include paths with the same hop count, so that the path 1 corresponding to the hop count 3 is selected from the set 1, the path 3 corresponding to the hop count 5 is selected from the set 2, and the path 5 corresponding to the hop count 6 is selected from the set 3; based on the path 5, the path 1 is provided with 3 virtual nodes 6-3, the path 3 is provided with 1 virtual node 6-5, and the path 1 provided with 3 virtual nodes, the path 3 provided with 1 virtual node and the path 5 are taken as paths with the same hop count.

In one example, as shown in fig. 9, a process for multiple user nodes to access a DIP network is described, comprising:

step 901: each user node sends a service connection request to the network management node.

Fig. 10 is a schematic diagram of a deterministic network architecture, as shown in fig. 9, the deterministic network comprising: a user node, comprising: client a, Client B, and other user nodes (not shown in the figure), etc.; the target service node is represented by an edge node Server 1; a network management node, comprising: the system comprises a service demand module, a CSPF algorithm module, a path selection module and a link establishment module; the service requirement module.

As shown in fig. 10, the user nodes Client a to Client N send service connection requests to the network management node; the service connection request carries a service type (ID), a delay requirement on a network, and a jitter requirement on the network. The Service type or ID may be carried in an application layer, or may be carried in an IPv6 extension header, or may be carried in a manner that a Service ID replaces an IP address.

Step 902: and the network management node determines a target service node corresponding to each user node.

Here, the network management node may determine a target service node according to the geographical location of each user node and the service type carried in the service connection request.

Step 903: and determining a path set from the corresponding user node to the target service node aiming at each user node in the plurality of user nodes to obtain a plurality of path sets.

Here, the CSPF algorithm module of the network management node takes the delay requirement carried by the service connection request as input, and calculates a set of paths from the user nodes Client a to Client N to the target service node, respectively.

Step 904: counting the hop number corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count.

Here, the CSPF algorithm module of the network management node may adopt a depth traversal algorithm to count the number of hops corresponding to each path in each path set; and a path selection module of the network management node selects paths with the same hop count from the multiple path sets. And taking the path with the same hop count as the optimal path.

Here, the resource link establishing module of the network management node is used for resource reservation announcement, and establishing DIP network connection between each user node and the target service node, so as to transmit a service connection request between each user node and the target service node.

Here, selecting paths with the same hop count from the multiple path sets includes the following cases:

in the first case, if there is no path with the same hop count in the multiple path sets, the path with the smallest difference is selected.

In the second case, if the paths all meet the delay, the delay of the short path is increased/if one party meets or does not meet the delay, the DIP connection is directly established (in consideration of informing the user) and the service request is started.

In the third case, the requirement of sufficient time delay cannot be met, and whether the inquiry B is willing or adopts a prompting mode can be selected, and after agreement, connection is established and consistency processing is not carried out.

In the fourth situation, if the A and the B do not meet the requirement of the hop count, the connection is directly established after the user agreement is solicited, and consistency processing is not carried out.

By adopting the technical scheme of the embodiment of the invention, when a plurality of user nodes in the DIP network initiate service connection requests, the path sets from the user nodes to the same target service node are determined to obtain a plurality of path sets, paths with the same hop count are selected from the path sets, and the paths with the same hop count are utilized to ensure the time delay consistency of the users under the same service.

In order to implement the method for establishing a network connection according to the embodiment of the present invention, an apparatus for establishing a network connection is further provided in the embodiment of the present invention, and fig. 11 is a schematic structural diagram of the apparatus for establishing a network connection according to the embodiment of the present invention; as shown in fig. 11, the apparatus includes:

an obtaining unit 111, configured to obtain service connection requests sent by multiple user nodes respectively; the service connection request is used for requesting to establish network connection with a target service node in the DIP network;

a first processing unit 112, configured to determine, for each user node in the multiple user nodes, a path set from the corresponding user node to the target service node, so as to obtain multiple path sets;

the second processing unit 113 is configured to count the hop count corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; establishing network connection between each user node and the target service node based on the paths with the same hop count

In an embodiment, the first processing unit 112 is further configured to:

In an embodiment, the first processing unit is specifically configured to:

In an embodiment, the first processing unit 112 is specifically configured to:

In an embodiment, the second processing unit 113 is specifically configured to:

In practical application, the obtaining unit 111 may be implemented by a communication interface in a network connection establishing device; the first processing unit 112 and the second processing unit 113 may be implemented by a processor in a network connection establishing apparatus.

It should be noted that: in the network connection establishing apparatus provided in the above embodiment, when establishing a network connection, only the division of each program module is taken as an example, and in practical applications, the above processing distribution may be completed by different program modules according to needs, that is, the internal structure of the apparatus may be divided into different program modules to complete all or part of the above-described processing. In addition, the network connection establishing apparatus and the network connection establishing method provided in the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments and are not described herein again.

An embodiment of the present invention further provides a network device, as shown in fig. 12, including:

a communication interface 121 capable of performing information interaction with other devices;

and the processor 122 is connected with the communication interface 121 and is configured to execute the method provided by one or more technical solutions of the intelligent device side when running the computer program. And the computer program is stored on the first memory 123.

It should be noted that: the specific processing procedures of the processor 122 and the communication interface 121 are detailed in the method embodiment, and are not described herein again.

Of course, in practice, the various components in the network device are coupled together by a bus system 124. It will be appreciated that the bus system 124 is used to enable communications among the components. The bus system 124 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 124 in fig. 12.

The memory 123 in the embodiments of the present application is used to store various types of data to support the operation of the network device. Examples of such data include: any computer program for operating on a network device.

The method disclosed in the above embodiments of the present application may be applied to the processor 122, or implemented by the processor 122. The processor 122 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be implemented by integrated logic circuits of hardware or instructions in the form of software in the processor 122. The Processor 122 may be a general purpose Processor, a Digital data Processor (DSP), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, etc. The processor 122 may implement or perform the methods, steps and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the memory 123, and the processor 122 reads the information in the memory 123 and performs the steps of the foregoing method in combination with its hardware.

In an exemplary embodiment, the network Device 120 may be implemented by one or more Application Specific Integrated Circuits (ASICs), DSPs, Programmable Logic Devices (PLDs), Complex Programmable Logic Devices (CPLDs), Field Programmable Gate Arrays (FPGAs), general purpose processors, controllers, Micro Controllers (MCUs), microprocessors (microprocessors), or other electronic components for performing the aforementioned methods.

It will be appreciated that the memory (memory 123) of embodiments of the present application may be either volatile memory or nonvolatile memory, and may include both volatile and nonvolatile memory. Among them, the nonvolatile Memory may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a magnetic random access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical disk, or a Compact Disc Read-Only Memory (CD-ROM); the magnetic surface storage may be disk storage or tape storage. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Enhanced Synchronous Dynamic Random Access Memory (Enhanced DRAM), Synchronous Dynamic Random Access Memory (SLDRAM), Direct Memory (DRmb Access), and Random Access Memory (DRAM). The memories described in the embodiments of the present application are intended to comprise, without being limited to, these and any other suitable types of memory.

In an exemplary embodiment, the present invention further provides a storage medium, specifically a computer storage medium, for example, a memory 123 storing a computer program, which is executable by the processor 122 of the network device 120 to perform the steps of the foregoing method. The computer readable storage medium may be Memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface Memory, optical disk, or CD-ROM.

It should be noted that: "first," "second," and the like are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.

In addition, the technical solutions described in the embodiments of the present invention may be arbitrarily combined without conflict.

The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.

Claims

1. A method for establishing a network connection, the method comprising:

acquiring service connection requests respectively sent by a plurality of user nodes; the service connection request is used for requesting to establish network connection with a target service node in a deterministic international interconnection protocol DIP network;

2. The method of claim 1, further comprising:

3. The method of claim 2, wherein determining the target serving node based on the plurality of second serving nodes comprises:

4. The method of claim 3, wherein determining the set of paths for the respective user node to the target service node comprises:

5. The method of claim 2, wherein determining the target serving node based on the plurality of second serving nodes comprises:

6. The method of claim 5, wherein determining the set of paths for the respective user node to the target service node comprises:

7. The method according to any one of claims 1 to 6, wherein the selecting paths with the same hop count from the plurality of path sets comprises:

8. An apparatus for establishing a network connection, comprising:

the second processing unit is used for counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the multiple path sets; and establishing network connection between each user node and the target service node based on the paths with the same hop count.

9. A network device, comprising:

10. A network device comprising a processor and a memory for storing a computer program capable of running on the processor,

wherein the processor is adapted to perform the steps of the method of any one of claims 1 to 7 when running the computer program.

11. A storage medium having a computer program stored thereon, the computer program, when being executed by a processor, performing the steps of the method of any one of claims 1 to 7.