CN114268577B

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

Info

Publication number: CN114268577B
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: 2023-07-21
Anticipated expiration: 2040-09-16
Also published as: CN114268577A

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 service connection request is used for requesting to establish network connection with a target service node in a deterministic international interconnection protocol (DIP) network; determining a path set from the corresponding user node to the target service node for each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the 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 network connection.

Background

With the rapid development of network technology, in order to guarantee the time delay certainty of services, deterministic networks are developed more and more rapidly, for example, deterministic international interconnection protocol (DIP, deterministic Internet Protocol) networks, which can realize end-to-end time delay certainty and provide deterministic service guarantee capability for services carried in a network area. The DIP network architecture may be composed of a sender, an ingress gateway, a router supporting DIP capabilities, an egress gateway, and a receiver. In general, DIP networks can guarantee low-delay transmission from a transmitting end to a receiving end to a certain extent, but when there are multiple transmitting ends, delay consistency of multiple users under the same service cannot be guaranteed.

Disclosure of Invention

In view of this, the embodiments of the present invention desire 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, the method 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 for each user node in the plurality of user nodes to obtain a plurality of path sets;

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

and 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 method further comprises:

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

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 second service nodes meeting preset conditions with the geographic positions of the user nodes from the plurality of first service nodes to obtain a plurality of second service nodes;

the target service node is determined based on the plurality of second service nodes.

Furthermore, 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 includes:

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, any one service node in the plurality of second service nodes is used as the target service node.

Furthermore, in accordance with at least one embodiment of the present invention, the determining a set of paths of the respective user node to the target serving node comprises:

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

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 met;

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 paths from the corresponding user node to the corresponding second service node according to each user node in the plurality of user nodes to obtain a plurality of paths;

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

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 the time delay requirement of the corresponding user node on the DIP network and the first period of a corresponding second service node scheduling queue; obtaining a second period of the DIP network scheduling queue;

determining a second path constraint condition by using the time delay requirement, the first period and the second period; the second path constraint condition represents constraint conditions met by the hop count corresponding to the path from the corresponding user node to the target service node;

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

Furthermore, 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 paths with the same hop count are not contained in the path sets, selecting a first path with the smallest hop count from the corresponding path set aiming at each path set of the 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 other paths 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 a network connection establishment apparatus, including:

an acquisition unit 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 of the plurality of user nodes, a path set from the corresponding user node to the target service node, to obtain a plurality of 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 path sets; based on the paths with the same hop count, establishing network connection between each user node and the target service node

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 invention, the first processing unit is specifically configured to:

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

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

the communication interface 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 processor, configured to determine, for each of the plurality of user nodes, a path set from the corresponding user node to the target service node, 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 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 for storing a computer program capable of running on the processor,

wherein the processor is configured to execute the steps of any of the methods described above when the computer program is run.

At least one embodiment of the present 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 the network connection acquire 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 for each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the 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 set from the plurality of user nodes to the same target service node is determined to obtain a plurality of path sets, paths with the same hop count are selected from the plurality of path sets, and the paths with the same hop count are utilized to ensure the delay consistency of the plurality of users under the same service.

Drawings

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

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

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

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

FIG. 5 is a schematic diagram of 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 the implementation of the core algorithm of OSPF in accordance with an embodiment of the present invention;

FIG. 7 is a schematic flow chart of 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 schematic flow chart of 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 schematic diagram of an implementation flow 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 according to an embodiment of the present invention;

fig. 11 is a schematic diagram of the composition structure of a network connection establishment apparatus according to an embodiment of the present invention;

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

Detailed Description

Prior to introducing the technical solution of the embodiment of the present invention, a description will be given of related technology.

In the related art, applications such as augmented Reality (AR, augmented Reality)/Virtual Reality (VR), and accurate industrial control, etc., put strict and clear demands on the upper bound, lower bound, or upper and lower bound (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 reliability and low latency communication (URLLC, ultra-reliable and Low Latency Communications), when a switch action command is issued, the communication content between the master terminal and the slave terminal involves electrical vector comparison and communication transmission channel path parameter verification, and the network is required to provide the capability of "20ms deterministic latency and jitter not higher than 600us" as early as the uncertainty index.

In the related art, a network capable of guaranteeing delay certainty of a service includes: time sensitive networks (TSN, time-Sensitive Networking), detNet, DIP. The following describes the three networks in detail:

the TSN can ensure the certainty of time delay, jitter, packet loss rate and the like, and provides extremely good network bearing service. The IEEE established AVB working group in 2015 aims to make a new Ethernet network architecture transmission protocol set suitable for real-time audio and 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 of 2-layer deterministic network technology. AVB working group developed in 2012 as TSN working group, TSN being an extension to IEEE 802.1 ethernet, 56 being a set of compatibility extension standards developed by the time sensitive network task group of IEEE 802.1 on the basis of existing ethernet standards. The TSN expands the demand range of the original AVB task group, and the established TSN standard not only meets the real-time audio and video demands, but also meets the time-sensitive demands of other service traffic transmission fields such as industrial control, automobile control and the like, thereby being a network technology with great development prospect and meeting the time-sensitive service transmission demands.

DetNet, with the development of the service, the network deterministic service highly sensitive to network indexes such as delay, packet loss, jitter and the like is not limited to the two-layer network, but also extends to the three-layer network. Such as mobile network forwarding, mid-transmission, backhaul, power systems, automated building systems, internet of vehicles, blockchain, network slicing, mine systems, etc., and interworking between subsystems of different regions of the same system. Deterministic networks (detnets) integrate the technical mechanism and architecture of TSNs on L2, providing a deterministic network technology solution on L3 (L2 compatible).

DIP, huacheng and China mobile cooperation provides a message scheduling and end-to-end delay guarantee mechanism based on inheritance of IP statistical multiplexing advantages, three-layer large-network end-to-end delay certainty and large-scale expandability are realized, and full-level and differentiated quality of service (QoS, quality of Service) capability is provided.

Fig. 1 is a schematic architecture diagram of a DIP network in the related art, as shown in fig. 1, the DIP network includes: the overall flow is as follows: step 1, all network devices (without terminal devices) need 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 deterministic service, wherein the flow model of the user message needs to meet the constraint of resource reservation; step 4, the entry gateway needs to carry out flow shaping on the user message, marks an initial period label on the message and formally enters a DIP period forwarding flow; the data packet carries a periodic tag and is sent to downstream equipment, and after the data packet arrives at the DIP router, the router replaces the periodic tag in the data packet and sends the data packet to a corresponding queue to wait for forwarding according to a periodic mapping relation table maintained locally; each DIP router and egress gateway (E-GW) maintains a certain number of DIP queues and periodically gate-schedules these queues.

The DIP network can ensure low time delay and deterministic forwarding of the network to a certain extent, but cannot ensure service consistency of multiple users under the same service, which can lead to experience difference and 'unfairness' of the multiple users under the same service, namely, when different users perform the same service, due to different geographic positions, different time delay and jitter can be caused due to different network topologies, so that services with the same time delay and jitter guarantee should be obtained originally, and the services have differences and unfairness. For example, fig. 2 is a schematic diagram of a DIP network in the related art providing the same service to multiple users, as shown in fig. 2, where a user Client a and a user Client B apply for the same service at the same time, the time delay of the user Client a is 20ms, the time delay of the user Client B is 30ms, and assuming that the service requirement is within 50ms, it can be seen that both a and B meet the time delay requirement, but the time delay of B is always greater than a, which is unfair to B. In particular to business, such as cloud gaming, a and B are in the same pair, for B are naturally inferior because of network problems. In the current game industry, many users can consume the network service quality independently, and theoretically, the A and the B should keep the service consistency under the condition that the time delay is satisfied. In the future, for industrial internet and remote AR/VR conferences, a scene of multiparty cooperation is also emerging, and the requirement for service consistency is becoming larger. If only one kind of service flow exists in the DIP network, the delay consistency of the two links can be ensured by adjusting the periods of different paths, namely the service consistency is ensured, however, the DIP is oriented to a large-range network, a plurality of kinds of service flows generally exist in the network, and the time delay, the jitter and the like required by each service flow are possibly different, so the service consistency cannot be ensured by adjusting the periods. Namely, DIP can only solve the deterministic forwarding after stream aggregation, and can not adjust the queue conversion period through 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 acquired; 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 for each user node in the plurality of user nodes to obtain a plurality of path sets; counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the 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.

The embodiment of the invention provides a method for establishing network connection, as shown in fig. 3, comprising the following steps:

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 for each user node in the plurality of user nodes to obtain a plurality of path sets;

Step 303: counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the 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 senders in the DIP network architecture. The geographical locations of the plurality of user nodes may be the same or different. The network topologies relied by the plurality of user nodes can be the same or different, for example, the network topology relied by the user node A can be a network topology suitable for VIP users, and the network topology relied by the user node B can be a network topology suitable for common users; the network topology may refer to a distribution condition 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 same service may be provided to the plurality of user nodes by using the target service node, so that network connection between each user node and the target service node may be subsequently established by selecting paths with the same hop count, so as to ensure delay consistency of the plurality of user nodes in the same service. The delay consistency may be that a plurality of user nodes establish connection with a target service node at the same time, and perform a service request, etc.

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. Wherein, the hop count may refer to the user node reaching the target service node through several network devices. In order to ensure the delay consistency of each user node under the same service, paths with the same hop count can be selected from path sets corresponding to a plurality of user nodes respectively, and network connection from the plurality of user nodes to a target service node can be established based on the paths with the same hop count. In the process of selecting the paths with the same hop count from the path sets corresponding to the user nodes, if the paths with the same hop count are selected from the path set corresponding to a certain user node, the path with the smallest network load may be selected from the paths with the same hop count as the path with the same hop count corresponding to the user node, or a path with the same hop count may be randomly selected from the paths with the same hop count as the path with the same hop count corresponding to the user node. For example, assuming that a plurality of user nodes are represented by node 1, node 2, and node 3, a set of paths corresponding to node 1 is represented by set 1, a set of paths corresponding to node 2 is represented by set 2, a set of paths corresponding to node 3 is represented by set 3, and when a path having a hop count equal to 3 is selected from sets 1, 2, and 3, if 2 paths having a hop count equal to 3 are selected from sets 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 node 1, or one path is randomly selected from the 2 paths as a path having a hop count equal to 3 corresponding to node 1. The path selection cases for the set 2 and the set 3 are the same as the set 1, and are not described here again.

Here, in step 304, during actual application, in the DIP network, in order to achieve delay consistency of multiple user nodes under the same service, network connection between each user node and the target service node may be established by using paths with the same hop count; wherein, the delay consistency may mean that the delays of the target service node providing the same service to a 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 can be provided, and the geographic positions of the plurality of service nodes can be different, the target service node providing the same service to the plurality of user nodes can be determined based on the service types requested by the plurality of user nodes and the geographic positions of the plurality of user nodes.

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

Here, the identifier of the service 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 corresponding relationship between the service identifier and the service type.

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

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

Service identification	Service type
		1	Video service
2	Live broadcast service
		3	Browser business

TABLE 1

For example, assume that a user node is represented by Client A, client B, client C; the first service node corresponding to the Client A is a service node 1, a service node 2 and a service node 3, and the second service node which meets the preset condition with the geographic position of the Client A is a service node 2; the first service node corresponding to the Client B is a service node 1, a service node 3 and a service node 4, and the second service node of which the geographic position meets the preset condition with the Client B is a service node 3; the first service node corresponding to the Client C is the service node 1, the service node 3 and the service node 5, and the second service node of which the geographic position with the Client C meets the preset condition is the service node 3.

How the target service node is determined based on the plurality of second service nodes is described in detail below.

In the first case, the target service node is determined in the case where the plurality of second service nodes are the same service node.

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

For the first case, in practical application, when the service node of each user node is determined to be the same service node based on the service type requested by each user node and the geographic position of each user node, the service node can be used as a target service node, and network connection between each user node and the target service node can be established subsequently, so that the delay consistency of a plurality of user nodes under the same service is met.

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

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

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

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

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

step 401: and acquiring the service type and the geographic position of each user node request.

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 Server1; the service node corresponding to the Client B is represented by a Server2; the service node corresponding to the Client C is denoted by Server 3. Wherein, the Server1, the Server2 and the Server3 provide the same service to three user nodes.

Step 403: when the service nodes corresponding to the user nodes are not the same service node, determining paths from the corresponding user nodes to the corresponding service nodes according to each user node in the plurality of 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 paths from Client a to Server1 are: client A-edge gateway 1-router 2-router 3-Server1; the path from Client B to Server2 is: client B-edge gateway B-router 4-router 5-Server2; the path from Client C to Server2 is: client C-edge gateway 1-router 6-router 7-Server1.

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

Here, the hop count=1+1+1+1=4 corresponding to the path from Client a to Server 1; hop count=1+1+1=3 corresponding to the path from Client B to Server 2; the hop count=1+1+1=3 for the path of Client C to Server 3. Since 3<4, server1 is the target service 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 delay consistency of the plurality of user nodes under the same service, and the fairness of each user node is realized.

How to determine the set of paths from the corresponding user node to the target service node is described in detail below.

In the first case, in the case that the 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 the case that the plurality of second service nodes are not the same service node, a set of paths from the respective user node to the target service node is determined.

Aiming at the first situation, when the service node of each user node is determined to be the same service node based on the service type requested by each user node and the geographic position of the service node, in actual application, considering that paths from the corresponding user node to the target service node can be multiple, the hop count corresponding to each path can be the same or different, and as not all paths can meet the delay consistency, multiple paths meeting the own delay requirement from the corresponding user node to the target service node can be determined to obtain multiple paths; and selecting a path meeting the 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 a set of paths of the respective user node to the target serving node comprises:

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

Here, the set of paths of the respective user node to the target service node may be determined by an additionally conditional SPF algorithm (CSPF, constrained Shortest Path First) C algorithm, using the first path constraint. The CSPF algorithm, i.e., based on SPF, can add path constraints to the desired path. For example, find the shortest path that satisfies the bandwidth >10Mpbs with a latency less than 100 ms.

Here, in practical application, the set of paths from the corresponding user node to the target service node may also be determined by using open shortest path first (OSPF, open Shortest Path First)). The OSPF algorithm can find the shortest distance between two designated nodes from the network. The implementation of the OSPF algorithm can be described as: two adjacent routers become a neighbor relation through a form of a message, the neighbors mutually send link state information to form an adjacent relation, then each router calculates a route according to a shortest path algorithm, and the route is placed in an OSPF routing table, and the OSPF routing is compared with other routes and then added into the global routing table. FIG. 6 is a schematic diagram of an implementation process of an OSPF algorithm, and as shown in FIG. 6, an implementation process of a core algorithm of the OSPF includes: dijkstra's shortest paths, the shortest paths being generated in ascending order of length. I.e. after each time ordering the path lengths of all visible points, a shortest path is selected, which 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 node of each user node is not the same service node based on the service type requested by each user node and the geographical location where each user node is located, it is necessary to determine one service node from a plurality of service nodes as a target service node. In addition, considering that the paths from the corresponding user node to the target service node can be multiple, the hop count corresponding to each path can be the same or different, and as not all paths can meet the delay consistency, multiple paths from the corresponding user node to the target service node can be determined to meet the own delay requirement, and multiple paths are obtained; and selecting a path meeting the 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 scheduling queues of other network devices, such as a gateway, a router, etc., except for the user node and the service node in the DIP network; the queue may refer to a pair of queues formed by the service connection request sent by the sending end.

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

step 701: and acquiring the service type and the geographic position of each user node request.

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 corresponding to the user nodes are the same service node or not; executing step 704 when it is determined that the service nodes corresponding to the user nodes are the same service node;

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

the first path constraint condition represents constraint conditions met by hops corresponding to paths from the corresponding user nodes to the target service node;

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 one example, as shown in fig. 8, a process is described for determining a set of paths from a respective user node to a target serving node, comprising:

step 801: and acquiring the service type and the geographic position of each user node request.

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 corresponding to the user nodes are different service nodes or not; when determining that the service nodes 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 characterizes a constraint condition that a hop count corresponding to a path from the corresponding user node to the target service node is satisfied;

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

How to select paths with the same hop count from the plurality of path sets is described in detail below.

In the first case, when the plurality of path sets include paths having the same number of hops, the paths having the same number of hops are determined.

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

In the first case, in actual application, when paths with the same hop count can be selected from the plurality of path sets, paths with the same hop count are directly selected from the plurality of path sets.

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

judging whether paths with the same hop count are contained in the path sets or not;

and when the paths with the same hop count are determined to be contained in the path sets, selecting the paths with the same hop count from the path sets.

Aiming at the second situation, in actual application, when paths with the same hop count cannot be selected from a plurality of path sets, in order to meet the delay consistency of a plurality of user nodes under the same service, a path with the smallest hop count can be selected from each path set in the plurality of path sets, so as to obtain a plurality of paths; and setting virtual nodes in other paths except the path with the largest hop count in the paths so as to ensure that the hop counts of the paths are the same.

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

For example, assume that a user node is represented by Client A, client B, 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, the set 2 comprises a path 3 and a path 4, and the corresponding hop counts are 5 and 6 respectively; the path set corresponding to the Client C is represented by a set 3, and 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 paths with the same hop count are not included in the set 1, the set 2 and the set 3, 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; and based on path 5, 6-3=3 virtual nodes are set in path 1, 6-5=1 virtual nodes are set in path 3, and path 1 provided with 3 virtual nodes, path 3 provided with 1 virtual node, and path 5 are taken as paths with the same hop count.

In an example, as shown in fig. 9, a process of accessing a DIP network by a plurality of user nodes is described, including:

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, comprising: a user node, comprising: client a, client B, and other user nodes (not shown), 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; wherein, the business requirement module.

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

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

Here, the network management node may determine the 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 for 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 the path set from the Client A to the Client N of the user node to the target service node respectively.

Step 904: counting the hop count corresponding to each path in each path set; selecting paths with the same hop count from the 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 use a depth traversal algorithm to count the number of hops corresponding to each path in each path set; and the path selection module of the network management node selects paths with the same hop count from the plurality of path sets. And taking the paths with the same hop count as optimal paths.

Here, the resource link establishment module of the network management node is used for resource reservation notification, and establishes DIP network connection between each user node and the target service node, so as to transmit service connection requests between each user node and the target service node.

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

In the first case, if there is no path with the same hop count in the plurality of path sets, a 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 the single party meets or fails, the DIP connection is directly established (considering informing the user), and the service request is started.

In the third case, the foot delay requirement cannot be met, and the inquiry about whether the inquiry B is willing/adopts a prompting mode can be selected, and the connection is established after agreement and consistency processing are not performed.

And in the fourth case, if both A and B do not meet the hop count requirement, after soliciting the user's consent, directly establishing connection and not performing consistency processing.

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 set from the plurality of user nodes to the same target service node is determined to obtain a plurality of path sets, paths with the same hop count are selected from the plurality of path sets, and the paths with the same hop count are utilized to ensure the delay consistency of the plurality of users under the same service.

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

An acquisition unit 111 that acquires service connection requests respectively transmitted 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 112, configured to determine, for each of the plurality of user nodes, a path set from the corresponding user node to the target service node, to obtain a plurality of path sets;

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

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 acquiring unit 111 may be implemented by a communication interface in the network connection establishment device; the first processing unit 112, the second processing unit 113 may be implemented by a processor in the network connection establishment means.

It should be noted that: the network connection establishment device provided in the above embodiment is only exemplified by the division of the program modules, and in practical application, the process allocation may be performed by different program modules according to needs, that is, the internal structure of the device is divided into different program modules to complete all or part of the processes described above. In addition, the device for establishing network connection provided in the above embodiment and the method embodiment for establishing network connection belong to the same concept, and specific implementation processes thereof are detailed in the method embodiment and are not described herein again.

The embodiment of the invention also provides a network device, as shown in fig. 12, including:

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

and the processor 122 is connected with the communication interface 121 and is used for executing the method provided by one or more technical schemes on the intelligent equipment 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.

Of course, in actual practice, the various components in the network device are coupled together by bus system 124. It is understood that bus system 124 is used to enable connected communications between these components. The bus system 124 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration the various buses are labeled as bus system 124 in fig. 12.

The memory 123 in the present embodiment 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 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 with signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in the processor 122 or by instructions in the form of software. The processor 122 described above may be a general purpose processor, a digital data processor (DSP, digital Signal Processor), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The processor 122 may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The 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 embodied in 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 memory 123. The processor 122 reads information from the memory 123 and, in combination with its hardware, performs the steps of the method described above.

In an exemplary embodiment, the network device 120 may be implemented by one or more application specific integrated circuits (ASICs, application Specific Integrated Circuit), DSPs, programmable logic devices (PLDs, programmable Logic Device), complex programmable logic devices (CPLDs, complex Programmable Logic Device), field-programmable gate arrays (FPGAs, field-Programmable Gate Array), general purpose processors, controllers, microcontrollers (MCUs, micro Controller Unit), microprocessors (microprocessors), or other electronic components for performing the aforementioned methods.

It is to be appreciated that the memory (memory 123) of embodiments of the present application can be either volatile memory or nonvolatile memory, and can include both volatile and nonvolatile memory. Wherein the nonvolatile Memory may be Read Only Memory (ROM), programmable Read Only Memory (PROM, programmable Read-Only Memory), erasable programmable Read Only Memory (EPROM, erasable Programmable Read-Only Memory), electrically erasable programmable Read Only Memory (EEPROM, electrically Erasable Programmable Read-Only Memory), magnetic random access Memory (FRAM, ferromagnetic random access Memory), flash Memory (Flash Memory), magnetic surface Memory, optical disk, or compact disk Read Only Memory (CD-ROM, compact Disc Read-Only Memory); the magnetic surface memory may be a disk memory or a tape memory. The volatile memory may be random access memory (RAM, random Access Memory), which acts as external cache memory. By way of example, and not limitation, many forms of RAM are available, such as static random access memory (SRAM, static Random Access Memory), synchronous static random access memory (SSRAM, synchronous Static Random Access Memory), dynamic random access memory (DRAM, dynamic Random Access Memory), synchronous dynamic random access memory (SDRAM, synchronous Dynamic Random Access Memory), double data rate synchronous dynamic random access memory (ddr SDRAM, double Data Rate Synchronous Dynamic Random Access Memory), enhanced synchronous dynamic random access memory (ESDRAM, enhanced Synchronous Dynamic Random Access Memory), synchronous link dynamic random access memory (SLDRAM, syncLink Dynamic Random Access Memory), direct memory bus random access memory (DRRAM, direct Rambus Random Access Memory). The memory described in the embodiments of the present application is intended to comprise, without being limited to, these and any other suitable types of memory.

In an exemplary embodiment, the present invention also provides a storage medium, i.e. a computer storage medium, in particular a computer readable storage medium, for example comprising a memory 123 storing a computer program executable by the processor 122 of the network device 120 for performing the steps of the aforementioned method. The computer readable storage medium may be FRAM, ROM, PROM, EPROM, EEPROM, flash Memory, magnetic surface Memory, optical disk, or CD-ROM.

It should be noted that: "first," "second," etc. are used to distinguish similar objects and not necessarily to describe a particular order or sequence.

In addition, the embodiments of the present invention may be arbitrarily combined without any collision.

The foregoing description is only of the preferred embodiments 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 according to claim 1, wherein the method further comprises:

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

4. A method according to claim 3, wherein said determining a set of paths of the respective user node to the target serving node comprises:

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

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

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

8. A network connection establishment apparatus, 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 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 of claims 1 to 7 when the computer program is run.

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