Network equipment layout method, device, equipment and storage medium
By determining the transmission path of network traffic and scheduling, the problem of low network transmission quality is solved, and efficient and high-quality network transmission is achieved.
Patent Information
- Application Number
- CN202211719807.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-12-30
- Publication Date
- 2025-03-04
- Estimated Expiration
- 2042-12-30
AI Technical Summary
The current network transmission quality is not high, especially in real-time communication scenarios, it is difficult to ensure high-quality transmission of the network.
By determining the initial terminal and receiving terminal for transmitting network traffic, the transmission path is determined based on the shortest path routing algorithm, and when there are duplicate nodes in the path, traffic scheduling and path optimization are used to use the ASAP scheduling function and neighbor generation algorithm.
It achieves the acceleration of network traffic transmission rate and improves network traffic transmission quality, ensuring low jitter and high certainty of network transmission.
Smart Images

Figure CN116016317B_ABST
Abstract
Description
Background Art
[0002] With the rapid development of society, the number of network devices in the current society is increasing, and users' requirements for network quality are becoming higher and higher. Although Ethernet has developed into a standard open communication mechanism for various fields, it lacks the ability of real-time communication, which has also led to the formation of the IEEE 802.1 Time-Sensitive Networking Task Group, which defines various sub-standards for regulating real-time communication achieved through Ethernet. At present, the determinism and stability of the data plane are generally guaranteed by technology families such as IEEE802.1Qbv and IEEE 802.1AS-Rev. IEEE 802.1Qbv uses time-triggered communication, which ensures temporary isolation of TT traffic and non-critical traffic. This communication can accurately transmit frames by controlling the opening and closing time of the gate, reducing the delay caused by congestion to the nanosecond level, while ensuring low jitter of the network. Although the use of IEEE 802.1Qbv can indeed ensure real-time guarantees, it cannot ensure complete determinism. How to ensure high-quality transmission of the network is an urgent problem to be solved. Summary of the invention
[0003] The present disclosure provides a network equipment layout method, apparatus, device and storage medium, which at least to a certain extent overcome the problem of low quality of current network transmission.
[0004] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.
[0005] According to one aspect of the present disclosure, a network device layout method is provided, including:
[0006] Determine a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0007] Determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0008] A first shortest path for transmitting first network traffic is determined based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0009] In one embodiment of the present disclosure, the method further includes:
[0010] Determine a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0011] Determine, based on the second initial terminal and the second receiving terminal, a forwarding node located between the second initial terminal and the second receiving terminal for forwarding the second network traffic;
[0012] A second shortest path for transmitting the second network traffic is determined based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal, and the forwarding node.
[0013] In one embodiment of the present disclosure, the method further includes:
[0014] When there are duplicate forwarding nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
[0015] In one embodiment of the present disclosure, the method further includes:
[0016] In the case that the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time, generating a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic based on a neighbor generation algorithm;
[0017] When there are duplicate forwarding nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the first target traffic cycle and traffic cutoff time, and the second target traffic cycle and traffic cutoff time of the second network traffic to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
[0018] In one embodiment of the present disclosure, the method further includes:
[0019] In the case that the transmission time of the first network traffic or the second network traffic exceeds the traffic cut-off time, the above steps are repeated until the preset condition is met.
[0020] In one embodiment of the present disclosure, the preset condition includes: the number of repetitions meets the preset number of times or there is no first network traffic or the transmission time of the second network traffic exceeds the traffic cut-off time.
[0021] According to another aspect of the present disclosure, a network device layout apparatus is provided, comprising:
[0022] A first determining module, used to determine a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0023] A second determination module, configured to determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the second receiving terminal for forwarding the first network traffic;
[0024] The third determination module is used to determine a first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node.
[0025] In one embodiment of the present disclosure, the device further includes:
[0026] A fourth determination module, used to determine a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0027] A fifth determination module, configured to determine, based on the second initial terminal and the second receiving terminal, a forwarding node located between the second initial terminal and the second receiving terminal for forwarding the second network traffic;
[0028] The sixth determination module is used to determine a second shortest path for transmitting the second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal and the forwarding node.
[0029] In one embodiment of the present disclosure, the device further includes:
[0030] The seventh determination module is used to determine the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, so as to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
[0031] In one embodiment of the present disclosure, the device further includes:
[0032] A generating module, configured to generate, based on a neighbor generation algorithm, a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic when the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time;
[0033] The eighth determination module is used to determine the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the first target traffic cycle and the traffic cutoff time, and the second target traffic cycle and the traffic cutoff time of the second network traffic when there are duplicate nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, so as to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
[0034] In one embodiment of the present disclosure, the device further includes:
[0035] The iteration module is used to repeat the above steps when the transmission time of the first network flow or the second network flow exceeds the flow cut-off time until the preset condition is met.
[0036] According to another aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-mentioned network device layout method by executing the executable instructions.
[0037] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the above-mentioned network device layout method is implemented.
[0038] The network equipment layout method, apparatus, device and storage medium provided by the embodiments of the present disclosure determine the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determine the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determine the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node. Since the shortest path for network traffic transmission is determined, the network traffic transmission rate can be accelerated and the quality of network traffic transmission can be improved.
[0039] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS
[0040] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.
[0041] Figure 1 A flow chart of a network device layout method according to an embodiment of the present disclosure is shown;
[0042] Figure 2 A flow chart of another network device layout method according to an embodiment of the present disclosure is shown;
[0043] Figure 3 A flow chart of another network device layout method according to an embodiment of the present disclosure is shown;
[0044] Figure 4 A flow chart of another network device layout method in an embodiment of the present disclosure is shown;
[0045] Figure 5 A flow chart of another network device layout method in an embodiment of the present disclosure is shown;
[0046] Figure 6 A schematic diagram of a network device layout device in an embodiment of the present disclosure is shown;
[0047] Figure 7 A structural block diagram of an electronic device in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION
[0048] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0049] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.
[0050] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.
[0051] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.
[0052] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".
[0053] In order to solve the above problems, the embodiments of the present disclosure provide a network device layout method, apparatus, device and storage medium.
[0054] The following describes a network device layout method provided by an embodiment of the present disclosure.
[0055] Figure 1 A flow chart of a network device layout method in an embodiment of the present disclosure is shown.
[0056] like Figure 1 As shown, the method may include:
[0057] S110, determining a first initial terminal and a first receiving terminal for transmitting first network traffic.
[0058] In some embodiments, the first initial terminal is the first node that transmits the first network traffic, and the first receiving terminal may be the last node that transmits the first network traffic.
[0059] In some embodiments, both the first initial terminal and the first receiving terminal may be terminal devices or servers having communication transmission functions.
[0060] The terminal device can be various electronic devices, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, wearable devices, augmented reality devices, virtual reality devices, etc.
[0061] Optionally, the server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. The terminal can be a smart phone, tablet computer, laptop computer, desktop computer, smart speaker, smart watch, etc., but is not limited to this. The terminal and the server can be directly or indirectly connected via wired or wireless communication, which is not limited in this application.
[0062] In one embodiment, the terminal device and the server may transmit information via a wireless network or a wired network.
[0063] Optionally, the wireless network or wired network described above uses standard communication technology and / or protocol. The network is typically the Internet, but may also be any network, including but not limited to a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a dedicated network or any combination of a virtual private network). In some embodiments, technologies and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), etc. are used to represent data exchanged over the network. In addition, conventional network device layout technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPsec) and the like may be used to layout all or some links of network devices. In other embodiments, customized and / or dedicated data communication technologies may also be used to replace or supplement the above-mentioned data communication technologies.
[0064] In some embodiments, the first originating terminal and the first receiving terminal may be determined based on user input.
[0065] In some embodiments, the first initial terminal and the first receiving terminal may be any terminal of a transmission network that transmits network traffic.
[0066] S120: Determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding first network traffic.
[0067] In some embodiments, the forwarding node may include any terminal directly or indirectly connected to the first receiving terminal and the first initial terminal.
[0068] In some embodiments, the user may input terminal devices corresponding to all nodes in the transmission network into the network device layout device in advance, and then the network device layout device may determine the forwarding node based on all the above terminals, the first initial terminal and the first receiving terminal.
[0069] In some embodiments, the forwarding node may also be a terminal device or a server.
[0070] S130, determining a first shortest path for transmitting first network traffic based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0071] In one embodiment, the first initial terminal, the first receiving terminal and the forwarding node can all be input into the shortest path routing algorithm, and then the shortest path routing algorithm determines the first shortest path. The shortest path routing algorithm is a common algorithm in the related art and will not be described in detail here.
[0072] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node. Since the shortest path for network traffic transmission is determined, the network traffic transmission rate can be accelerated and the quality of network traffic transmission can be improved.
[0073] Figure 2 A flow chart of another network device layout method in an embodiment of the present disclosure is shown.
[0074] like Figure 2 As shown, the method may include:
[0075] S210, determining a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0076] S220, determining, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0077] S230, determining a first shortest path for transmitting first network traffic based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0078] S240, determining a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0079] S250, determining a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic based on the second initial terminal and the second receiving terminal;
[0080] S260: Determine a second shortest path for transmitting second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal, and the forwarding node.
[0081] In one embodiment, the method for determining the second shortest path is the same as the method for determining the first shortest path described above, and will not be described in detail herein.
[0082] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node. Since the shortest path for network traffic transmission is determined, the network traffic transmission rate can be accelerated and the quality of network traffic transmission can be improved.
[0083] Figure 3 A flow chart of another network device layout method in an embodiment of the present disclosure is shown.
[0084] like Figure 3 As shown, the method may include:
[0085] S310, determining a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0086] S320, determining, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0087] S330 , determining a first shortest path for transmitting first network traffic based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0088] S340, determining a second initial terminal and a second receiving terminal for transmitting the second network traffic;
[0089] S350, determining a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic based on the second initial terminal and the second receiving terminal;
[0090] S360: Determine a second shortest path for transmitting second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal, and the forwarding node.
[0091] S370, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
[0092] In some embodiments, when the same forwarding node exists in the first shortest path and the second shortest path, when the forwarding node faces the first network traffic and the second network traffic at the same time, any one of the network traffic will be selected for forwarding priority. In this case, the delayed forwarded network traffic may exceed the traffic cutoff time.
[0093] In some embodiments, the traffic period of the first network traffic and the traffic period of the second network traffic may be scheduled based on the ASAP scheduling function to avoid the possibility of network congestion as much as possible. The traffic period may include the time of traffic transmission.
[0094] In some embodiments, determining the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic may include: inputting the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic into the ASAP scheduling function to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
[0095] In some embodiments, the ASAP scheduling function is a commonly used function in the related art and will not be described in detail here.
[0096] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. When there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled, so that the transmission rate of multiple network traffic can be accelerated and the quality of network traffic transmission is improved.
[0097] Figure 4 A flow chart of another network device layout method in an embodiment of the present disclosure is shown.
[0098] like Figure 4 As shown, the method may include:
[0099] S410, determining a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0100] S420, determining, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0101] S430: Determine a first shortest path for transmitting first network traffic based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0102] S440, determining a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0103] S450, determining a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic based on the second initial terminal and the second receiving terminal;
[0104] S460: Determine a second shortest path for transmitting second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal, and the forwarding node.
[0105] S470, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, determine to schedule the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic, and obtain a first target traffic cycle of the first network traffic and a second target traffic cycle of the second network traffic;
[0106] S480, in the case where the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time, generate a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic based on a neighbor generation algorithm.
[0107] In some embodiments, the traffic cut-off time of the first network traffic and the traffic cut-off time of the second network traffic may be obtained, wherein the traffic cut-off time may include the time when the network traffic is transmitted from the initial terminal to the receiving terminal.
[0108] In some embodiments, generating the shortest path based on a neighbor generation algorithm is a common method in related technologies and will not be described in detail here.
[0109] S490, when there are duplicate nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the first target traffic cycle and the traffic cutoff time, and the second target traffic cycle and the traffic cutoff time of the second network traffic to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
[0110] In some embodiments, the method for scheduling the first network traffic and the second network traffic based on the ASAP scheduling function has been described in detail in the above embodiments and will not be repeated here.
[0111] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. In the case where there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled. In the case where the transmission time of the first network traffic and the second network traffic exceeds the traffic deadline in the scheduling result, a new shortest path can be generated based on the neighbor generation algorithm, and scheduling can be performed based on the new shortest path, which can further optimize the layout of the network equipment and speed up the transmission rate of the network traffic.
[0112] Figure 5 A flow chart of another network device layout method in an embodiment of the present disclosure is shown.
[0113] like Figure 5 As shown, the method may include:
[0114] S510, determining a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0115] S520, determining, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0116] S530: Determine a first shortest path for transmitting first network traffic based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0117] S540, determining a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0118] S550, determining a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic based on the second initial terminal and the second receiving terminal;
[0119] S560: Determine a second shortest path for transmitting the second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal, and the forwarding node.
[0120] S570, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, determine to schedule the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic, and obtain a first target traffic cycle of the first network traffic and a second target traffic cycle of the second network traffic;
[0121] S580: In the event that the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time, generate a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic based on a neighbor generation algorithm.
[0122] S590, when there are duplicate nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the first target traffic cycle and the traffic cutoff time, and the second target traffic cycle and the traffic cutoff time of the second network traffic to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
[0123] S5100: In the case where the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time, repeat the above steps until the preset condition is met.
[0124] In some embodiments, repeating the above steps may include repeating S580 and S590.
[0125] In some embodiments, the preset conditions include: the number of repetitions meets the preset number of times or there is no first network traffic or the second network traffic transmission time exceeds the traffic cut-off time.
[0126] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. In the case where there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled. In the case where the transmission time of the first network traffic and the second network traffic exceeds the traffic deadline in the scheduling result, a new shortest path can be generated based on the neighbor generation algorithm, and scheduling can be performed based on the new shortest path, which can further optimize the layout of the network equipment and speed up the transmission rate of the network traffic.
[0127] Based on the same inventive concept, the embodiments of the present disclosure also provide a network device layout device, which is applied to the server, such as the following embodiments. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.
[0128] Figure 6 A schematic diagram of a network device layout device in an embodiment of the present disclosure is shown. Figure 6 As shown, the device 600 includes:
[0129] A first determination module 610, configured to determine a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0130] A second determination module 620, configured to determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the second receiving terminal for forwarding the first network traffic;
[0131] The third determination module 630 is used to determine a first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal, and the forwarding node.
[0132] The network equipment layout device provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node. Since the shortest path for network traffic transmission is determined, the network traffic transmission rate can be accelerated and the quality of network traffic transmission is improved.
[0133] In one embodiment of the present disclosure, the apparatus 600 further includes:
[0134] A fourth determination module, used to determine a second initial terminal and a second receiving terminal for transmitting second network traffic;
[0135] A fifth determination module, configured to determine, based on the second initial terminal and the second receiving terminal, a forwarding node located between the second initial terminal and the second receiving terminal for forwarding the second network traffic;
[0136] The sixth determination module is used to determine a second shortest path for transmitting the second network traffic based on the shortest path routing algorithm, the second initial terminal, the second receiving terminal and the forwarding node.
[0137] The network equipment layout device provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node. Since the shortest path for network traffic transmission is determined, the network traffic transmission rate can be accelerated and the quality of network traffic transmission can be improved.
[0138] In one embodiment of the present disclosure, the device further includes:
[0139] The seventh determination module is used to determine the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, so as to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
[0140] The network equipment layout device provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. When there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled, so that the transmission rate of multiple network traffic can be accelerated and the quality of network traffic transmission is improved.
[0141] In one embodiment of the present disclosure, the device further includes:
[0142] A generating module, configured to generate, based on a neighbor generation algorithm, a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic when the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time;
[0143] The eighth determination module is used to determine the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the first target traffic cycle and the traffic cutoff time, and the second target traffic cycle and the traffic cutoff time of the second network traffic when there are duplicate nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, so as to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
[0144] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. In the case where there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled. In the case where the transmission time of the first network traffic and the second network traffic exceeds the traffic deadline in the scheduling result, a new shortest path can be generated based on the neighbor generation algorithm, and scheduling can be performed based on the new shortest path, which can further optimize the layout of the network equipment and speed up the transmission rate of the network traffic.
[0145] In one embodiment of the present disclosure, the device further includes:
[0146] The iteration module is used to repeat the above steps when the transmission time of the first network flow or the second network flow exceeds the flow cut-off time until the preset condition is met.
[0147] The network device layout method provided by the embodiment of the present disclosure determines the first initial terminal and the first receiving terminal for transmitting the first network traffic, and then determines the forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic based on the determined first initial terminal and the first receiving terminal, and then determines the first shortest path for transmitting the first network traffic based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and then determines the second shortest path for transmitting the second network traffic. In the case where there are repeated forwarding nodes in the first shortest path and the second shortest path, the first network traffic and the second network traffic are scheduled. In the case where the transmission time of the first network traffic and the second network traffic exceeds the traffic deadline in the scheduling result, a new shortest path can be generated based on the neighbor generation algorithm, and scheduling can be performed based on the new shortest path, which can further optimize the layout of the network equipment and speed up the transmission rate of the network traffic.
[0148] Those skilled in the art will appreciate that various aspects of the present disclosure may be implemented as systems, methods or program products. Therefore, various aspects of the present disclosure may be specifically implemented in the following forms, namely: complete hardware implementation, complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as "circuits", "modules" or "systems".
[0149] Refer to the following Figure 7 An electronic device 700 according to this embodiment of the present disclosure is described. Figure 7 The electronic device 700 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.
[0150] like Figure 7 As shown, the electronic device 700 is in the form of a general computing device. The components of the electronic device 700 may include but are not limited to: at least one processing unit 710, at least one storage unit 720, and a bus 730 connecting different system components (including the storage unit 720 and the processing unit 710).
[0151] The storage unit stores program codes, which can be executed by the processing unit 710, so that the processing unit 710 performs the steps of various exemplary embodiments of the present disclosure described in the above “Exemplary Method” section of this specification. For example, the processing unit 710 can perform the following steps of the above method embodiment:
[0152] Determine a first initial terminal and a first receiving terminal for transmitting first network traffic;
[0153] Determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding the first network traffic;
[0154] A first shortest path for transmitting first network traffic is determined based on a shortest path routing algorithm, a first initial terminal, a first receiving terminal, and a forwarding node.
[0155] The storage unit 720 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 7201 and / or a cache storage unit 7202 , and may further include a read-only storage unit (ROM) 7203 .
[0156] The storage unit 720 may also include a program / utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.
[0157] Bus 730 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
[0158] The electronic device 700 may also communicate with one or more external devices 740 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 700, and / or communicate with any device that enables the electronic device 700 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 750. Furthermore, the electronic device 700 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 760. As shown, the network adapter 760 communicates with other modules of the electronic device 700 via a bus 730. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0159] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0160] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. A program product capable of implementing the above method of the present disclosure is stored thereon. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary implementations of the present disclosure described in the above “Exemplary Method” section of this specification.
[0161] More specific examples of computer-readable storage media in the present disclosure may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0162] In the present disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0163] Alternatively, the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0164] In a specific implementation, the program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet).
[0165] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.
[0166] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.
[0167] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0168] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.
Claims
1. A network device layout method, characterized in that: include: Determine a first initial terminal and a first receiving terminal for transmitting first network traffic; Determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding first network traffic; Determine a first shortest path for transmitting the first network traffic based on a shortest path routing algorithm, the first initial terminal, the first receiving terminal, and a forwarding node; Determine a second initial terminal and a second receiving terminal for transmitting second network traffic; Determine, based on the second initial terminal and the second receiving terminal, a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic; Determine a second shortest path for transmitting the second network traffic based on a shortest path routing algorithm, the second initial terminal, the second receiving terminal, and a forwarding node; In the case that there are duplicate forwarding nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
2. The network device layout method according to claim 1, characterized in that: The method further comprises: In the case that the transmission time of the first network traffic or the second network traffic exceeds the traffic cutoff time, generating a third shortest path for transmitting the first network traffic and a fourth shortest path for transmitting the second network traffic based on a neighbor generation algorithm; In the case that there are duplicate forwarding nodes between the forwarding nodes passed by the third shortest path and the forwarding nodes passed by the fourth shortest path, the traffic cycles of the first network traffic and the second network traffic are scheduled based on the ASAP scheduling function, the first target traffic cycle and traffic cutoff time, and the second target traffic cycle and traffic cutoff time of the second network traffic to obtain the third target traffic cycle of the first network traffic and the fourth target traffic cycle of the second network traffic.
3. The network device layout method according to claim 2, characterized in that: The method further comprises: In the case that the transmission time of the first network traffic or the second network traffic exceeds the traffic cut-off time, the above steps are repeated until the preset condition is met.
4. The network equipment layout method according to claim 3, characterized in that: The preset conditions include: the number of repetitions meets the preset number of times or there is no first network traffic or the transmission time of the second network traffic exceeds the traffic cut-off time.
5. A network equipment layout device, characterized in that: include: A first determining module, used to determine a first initial terminal and a first receiving terminal for transmitting first network traffic; A second determination module, configured to determine, based on the first initial terminal and the first receiving terminal, a forwarding node located between the first initial terminal and the first receiving terminal for forwarding first network traffic; A third determination module, configured to determine a first shortest path for transmitting the first network traffic based on a shortest path routing algorithm, the first initial terminal, the first receiving terminal, and a forwarding node; A fourth determination module, used to determine a second initial terminal and a second receiving terminal for transmitting second network traffic; a fifth determining module, configured to determine, based on the second initial terminal and the second receiving terminal, a forwarding node located between the second initial terminal and the second receiving terminal for forwarding second network traffic; a sixth determination module, configured to determine a second shortest path for transmitting the second network traffic based on a shortest path routing algorithm, the second initial terminal, the second receiving terminal, and a forwarding node; The seventh determination module is used to determine the scheduling of the traffic cycles of the first network traffic and the second network traffic based on the ASAP scheduling function, the traffic cycle and traffic cutoff time of the first network traffic, and the traffic cycle and traffic cutoff time of the second network traffic, when there are duplicate nodes between the forwarding nodes passed by the first shortest path and the forwarding nodes passed by the second shortest path, so as to obtain the first target traffic cycle of the first network traffic and the second target traffic cycle of the second network traffic.
6. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the network device layout method according to any one of claims 1 to 4 by executing the executable instructions.
7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the network device layout method described in any one of claims 1 to 4 is implemented.
Citation Information
Patent Citations
Communication scheduling based on priority and resource utilization
CN103250456A
Method for operating a communication system for transmitting time-critical data, and communication device
CN113260934A