CN114143378B - Network optimization method, device, gateway equipment and storage medium - Google Patents
Network optimization method, device, gateway equipment and storage medium Download PDFInfo
- Publication number
- CN114143378B CN114143378B CN202111406606.1A CN202111406606A CN114143378B CN 114143378 B CN114143378 B CN 114143378B CN 202111406606 A CN202111406606 A CN 202111406606A CN 114143378 B CN114143378 B CN 114143378B
- Authority
- CN
- China
- Prior art keywords
- message
- queue
- messages
- port
- same
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/26—Route discovery packet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present specification provides a network optimization method, apparatus, gateway device and storage medium, where the method is applied to a gateway device, the gateway device has an ingress port and an egress port, and the ingress port and the egress port have queues for storing messages, and the method includes the steps of: receiving a message entering an inlet port, wherein the message carries a queue identifier and a scheduling period identifier, each scheduling period identifier represents one period of sending the message of a queue of the outlet port, storing the message of the same queue identifier into the same queue of the inlet port, sending the message in the same queue to the outlet port, storing the message of the same scheduling period identifier into the same section of storage space of one of the queues of the outlet port, and sending a plurality of messages in each section of storage space to a target device in the same period of sending the message of the queue of the outlet port. By the method disclosed by the application, the problem that the time interval of the message changes after the message is forwarded by a plurality of network nodes is solved.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a network optimization method, a device, a gateway device, and a storage medium.
Background
In the field of network communications, when a message is sent from a local end to a remote end, it is necessary to pass through a plurality of intermediate network nodes, and since these intermediate network nodes adopt a Best-Effort forwarding policy, it is uncertain when these intermediate network nodes send the message; when multiple messages are sent out locally at the same time interval, the time interval at which the messages are received by the remote end is different, and because it is uncertain when the intermediate network nodes send out the messages, the fluctuation of the time interval is large, which cannot be predicted.
Disclosure of Invention
In order to overcome the problem of network jitter in the related art, the present specification provides a method and apparatus for optimizing a network.
According to a first aspect of embodiments of the present specification, there is provided a method applied to a gateway device, the gateway device having an ingress port and an egress port, the ingress port and the egress port having queues storing messages, the method comprising the steps of:
receiving a message entering the inlet port, wherein the message carries a queue identifier and a scheduling period identifier; wherein, each said scheduling period identifies a period of sending a message that characterizes a queue of said egress port;
storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port;
storing the messages identified in the same scheduling period into the same section of storage space of one queue of the output port;
and transmitting a plurality of messages in each section of storage space to the target equipment in the same message transmitting period of the queues of the output ports.
According to a second aspect of embodiments of the present specification, there is provided a network optimization apparatus, the apparatus being applied to a gateway device, the gateway device having an ingress port and an egress port, the ingress port and the egress port having queues storing messages, the apparatus comprising:
message receiving module: receiving a message entering the inlet port, wherein the message carries a queue identifier and a scheduling period identifier; wherein, each said scheduling period identifies a period of sending a message that characterizes a queue of said egress port;
storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port;
message outgoing module: storing the messages identified in the same scheduling period into the same section of storage space of one queue of the output port;
and transmitting a plurality of messages in each section of storage space to the target equipment in the same message transmitting period of the queues of the output ports.
According to a third aspect of embodiments of the present specification, there is provided a gateway device, the device comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to perform the method of the first aspect described above.
A memory for storing processor-executable instructions;
a fourth aspect of the present application provides a computer storage medium storing a computer program which, when executed by a processor, implements the method of the first aspect described above.
Based on the technical scheme, in the embodiment of the application, the message carries a queue identifier and a scheduling period identifier; each scheduling period identifies a period of sending a message that characterizes a queue of the port;
storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port; storing the messages identified in the same scheduling period into the same section of storage space of one queue of the output port; transmitting a plurality of messages in each section of storage space to target equipment in the same message transmitting period of a queue of an output port, so that a plurality of messages which are originally transmitted by a plurality of network nodes and have time interval changes are transmitted in the same period; finally, the time intervals of the messages become consistent, and the network becomes stable; meeting the requirements of deterministic networks.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the specification and together with the description, serve to explain the principles of the specification.
FIG. 1 is a flow chart of a method illustrated in the present specification according to an exemplary embodiment.
Fig. 2 is a network architecture diagram of one method illustrated in this specification according to an exemplary embodiment.
Fig. 3 is a block diagram of a network optimization device according to an exemplary embodiment of the present description.
Fig. 4 is a hardware configuration diagram of a gateway device in which the network device according to the embodiment of the present disclosure is located.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the present specification. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present description as detailed in the accompanying claims.
The terminology used in the description presented herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the description. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in this specification to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.
With the development of science and technology, new services such as "telemedicine", "industrial remote control", "remote traffic" and the like are generated in life and work, and all the services need deterministic networks to be unfolded; the deterministic network is a network capable of guaranteeing deterministic bandwidth, time delay, jitter and packet loss rate indexes of the service; deterministic network technology is a new QoS (Quality of Service ) guarantee technology.
Fig. 2 is a network architecture diagram of an embodiment of the present application, where network entities involved include a user device 232, a user device 234, an ingress gateway 212, an egress gateway 214, an SDN (Software Defined Network ) controller, and an intermediate network device 221, an intermediate network device 222, an intermediate network device 223, an intermediate network device 224, an intermediate network device 225, and an intermediate network device 226, where the SDN controller and the intermediate network device constitute a network 200.
Taking the example that the user equipment 232 sends the message to the user equipment 234, the message sent by the user equipment 232 is sent to the ingress gateway 212 first, and then is sent to the network 200 through the ingress gateway 212; the message sequentially passes through the intermediate network device 221, the intermediate network device 222, the intermediate network device 225, and the intermediate network device 226, finally enters the egress gateway 214, and finally is sent to the user device 234 by the egress gateway 214.
Because the intermediate network equipment adopts a Best-effect forwarding strategy, and the Best-effect forwarding strategy is the greatest possibility of forwarding all messages, the time delay and the reliability are not guaranteed; i.e. the intermediate network device cannot determine when the message can be forwarded or not. Taking the example of 3 messages sent by the ue 232 at 1 ms intervals, the intervals of these messages may become 10 ms and 100 ms when they reach the ue 234.
To implement deterministic networks, the prior art uses a queuing forwarding mechanism that is periodic based on segment routing CSQF (Cyclic Specific Queuing and Forwarding). In the related art, all intermediate network devices need to analyze SID labels at the top of a stack to obtain a port and specific forwarding time period information forwarded by a current node packet, and then forward a message at a specific port and time period according to the obtained port information and time period information, so that the problem that the sequence of the message after the message is transmitted and the time interval is changed is solved. However, although the CSQF mechanism solves the problem of network jitter under the network span, each intermediate network device needs to support to analyze the SID tag at the top of the stack to obtain the port and specific forwarding time period information of the current node packet, and forward the message at a specific port and time period according to the obtained port information and time period information.
Because the current intermediate network device adopts the traditional three-layer message forwarding mode, the chip of the current intermediate network device does not support CSQF to read SID labels to obtain the port and specific time slot information forwarded by the current node packet, and forwards the message at a specific port and time slot according to the obtained port information and time slot information. To support the CSQF technology, a plurality of intermediate network devices need to be replaced, so that the existing resources are fully utilized, and the cost is saved.
Next, embodiments of the present specification will be described in detail.
The network optimization method of the embodiment of the application is applied to gateway equipment, the gateway equipment is provided with an input port and an output port, and the input port and the output port are provided with queues for storing messages, and the method can comprise the following steps:
as shown in fig. 1, fig. 1 is a flowchart illustrating a method of optimizing a network according to an exemplary embodiment of the present disclosure, including the steps of:
in step 102, a message is received that enters the ingress port.
The message carries a queue identifier and a scheduling period identifier, and the scheduling period identifier characterizes a period of sending the message of the queue of the output port.
The ingress port may receive messages for multiple traffic flows at the same time. For example, taking the network architecture diagram of fig. 2 as an example, the user device 232 initiates one service flow for transmitting a video signal and one service flow for transmitting a temperature sensor signal at the same time, when the messages of the two service flows are continuously transmitted to the egress gateway 214 through the network 200, the ingress port of the egress gateway 214 receives the messages of the two service flows at the same time.
And in step 104, storing the messages identified by the same queue to the same queue of the ingress port.
The port of the gateway device has multiple queues and thus multiple queue identifications.
In step 106, the messages in the same queue are sent to the egress port.
Because the storage space of the queue is limited, the storage space of the queue is divided into a plurality of fragments for scheduling in order to effectively utilize the limited storage space.
In step 108, the messages identified in the same scheduling period are stored in the same section of storage space of one of the queues of the egress port.
When the storage space of the queue is divided into a plurality of segments for scheduling, each segment of storage space can be in one-to-one correspondence with one scheduling period, so that the messages identified by the same scheduling period can be stored in the same segment of storage space.
In step 110, a plurality of messages in each section of storage space are sent to the target device in the same period of sending messages in the queue of the output port.
Because each section of storage space corresponds to the scheduling period one by one, the messages in the storage space corresponding to the scheduling period are sent out, and the messages with the same scheduling period identification can be sent out in each scheduling period.
To demarcate the communication channel used by the deterministic traffic stream, in some embodiments, the queue identification characterizes the message as the highest priority that the message is sent. For example, assume that there are three queues for each ingress port and egress port; the queues of each port are respectively identified as a Q1 queue, a Q2 queue and a Q3 queue; if the Q1 queue is reserved as a queue used by a deterministic flow network in the original planning, only messages carrying the Q1 mark can be stored in the Q1 queue, and messages carrying the Q2 or Q3 mark cannot be stored in the Q1 queue; when the Q2 and Q3 queues are blocked due to too many messages, the Q1 queue reserves enough resources in advance, so that the message carrying the Q1 mark can be sent out in a certain time without blocking and waiting for a long time; therefore, when the identifier carried by the message is Q1, the message is a message of deterministic service flow, and the message carrying Q1 has higher priority to be sent out.
In order to enable the scheme of the application to be applied to the scene that the deterministic traffic flow quantity exceeds the number of queues, in some embodiments, the messages identified in the same scheduling period are messages of the same traffic flow; for example, assume that in fig. 2, the user equipment 232 sends out a service flow message of a pressure signal and a service flow message of a temperature signal at the same time, where the two service flow messages are required to meet the requirements of deterministic service flows, that is, when the two service flow messages are sent in the network, bandwidth, time delay, network jitter and packet loss rate are required to be kept stable within a certain range; if the queue identification marks the service of the deterministic service flow, the number of the queues is small, and when hundreds of deterministic service flows exist, the queue identification marks the deterministic service flow and cannot meet the requirement.
To more fully utilize the limited queue resources, in some embodiments, one of the queues is in a state of sending messages and the remaining queues are in a state of receiving messages at any time. Because the message passes through a plurality of intermediate network devices, a certain time is often required to wait for receiving the message, and meanwhile, the speed of sending the message by the chip scheduling is very high.
Since a part of the queues are fixed to receive messages, and another part of the queues are fixed to transmit messages, the storage space of all the messages is not fully utilized, and in order to fully utilize the storage space of the messages, in some embodiments, the queues periodically and alternately receive the messages and transmit the states of the messages. It is understood that the duration of the alternating period can be set by those skilled in the art according to the performance of the hardware, and will not be described herein.
For application to existing SRv6 (Segment Routing over IPv6, IPv6 forwarding plane based segment routing) technology, in some embodiments the message is a SRv6 protocol encapsulated based message, and the queue identification and scheduling period identification are carried in the SID field of the message.
To further explain the network optimization method of the present application, the following is explained in connection with one specific embodiment.
Taking the network structure diagram shown in fig. 2 as an example, in this embodiment, the network device 232 needs to establish a plurality of connections of deterministic traffic flows with the network device 234, so that a link meeting the deterministic network requirements is scheduled by the SDN controller, and how to schedule is well known to those skilled in the art and will not be described herein.
Specifically, as shown in fig. 2, the SDN controller selects a link that sequentially passes through the ingress gateway 212, the intermediate network device 221, the intermediate network device 222, the intermediate network device 225, the intermediate network device 226, and the egress gateway 214. And finally sent by the egress gateway 214 to the user device 234, where the user device 234 is the target device. The link selected by the SDN controller meets the requirements of a deterministic network, namely, the bandwidth, the time delay, the network jitter and the packet loss rate are kept stable within a certain range. For example, the overall bandwidth of the link is above 100Gbps, the delay is kept at about 10 ms, the network jitter is kept at about 1 ms, the packet loss rate is kept at 0.001%, etc., the link data listed here are merely examples, and the actual link data should be based on meeting the requirements of a specific deterministic network.
Upon selection of the link, a queue identification is added by ingress gateway 212 to the message sent by device 232. In this embodiment, the ingress gateway 212 and the egress gateway 214 are devices supporting a gateway of CSQF technology, and more specifically, in this embodiment, the ingress gateway 212 and the egress gateway 214 are devices supporting a SRv protocol in CSQF technology; other techniques may be selected as desired by those skilled in the art, such as MPLS (Multiprotocol Label Switching ); as long as the addition of queue identification in the extension header of the message can be satisfied.
In order to support deterministic networks, in the embodiment of the present application, the queue identifier characterizes that the priority of the message is highest in the case that the message is a deterministic traffic flow. When the message sent by the user equipment 232 has both a message of a deterministic traffic flow and a message of a non-deterministic traffic flow, the message of the deterministic traffic flow carries an identifier of a queue reserved for the deterministic traffic flow determined in the planning of the link, and the message of the non-deterministic traffic flow carries an identifier of a queue reserved for the non-deterministic traffic flow determined in the planning of the selected link; assuming that queues Q1 and Q2 are reserved as queues for deterministic traffic flows in the planning of the links, and queue Q3 is a queue for non-deterministic traffic flows; the queue carried by the message of the deterministic traffic stream is identified as Q1 or Q2, and the queue carried by the message of the non-deterministic traffic stream is identified as Q3.
Assuming that in this embodiment, the ue 232 sends messages of 4 deterministic traffic flows to the ue 234, when these messages are transmitted to the ingress gateway, the ingress gateway adds a queue identifier Q1 in the SID field of the message; these messages pass through the links selected by the SDN controller, and pass through the ingress gateway 212, the intermediate network device 221, the intermediate network device 222, the intermediate network device 225, the intermediate network device 226, and the egress gateway 214 in sequence.
Meanwhile, in order to ensure that the number of service flows is larger than that of queues, the embodiment uses the message identified by the same scheduling period as the message mode of the same service flow. For example, suppose that the ue 232 sends out 4 messages of deterministic traffic flows simultaneously, where the queue identifiers of the four messages are Q1, and the scheduling period identifiers are C1, C2, C3, and C4, respectively. Therefore, when the egress gateway 214 receives the messages of 4 deterministic traffic flows, different scheduling period identifiers are allocated to the messages of different deterministic traffic flows according to the characteristic that the messages carry different information because of different traffic flows; for example, according to the information of the source IP address, the destination IP address, the protocol number, the source port, the destination port, etc. of the message, different scheduling period identifiers are allocated to the messages of different deterministic traffic flows. A person skilled in the art can allocate different scheduling period identifiers for the messages of different deterministic traffic flows by using other information of the messages according to the need, as long as the information can be used for distinguishing traffic flows, and the details are not repeated here.
For example, the egress gateway 214 allocates a scheduling period identifier for a packet according to a source IP address and a source port number of the packet, and regards the packet with the same source IP address and source port number as a packet of the same service flow, and regards the packet with different source IP address or source port number as a packet of a different service flow; the dispatching cycle identifiers allocated to the messages of the same service flow are the same, and the dispatching cycle identifiers allocated to the messages of different service flows are different. By the method, the scheduling period identifier C1 is distributed to the message of the 1 st deterministic service flow, the scheduling period identifier C2 is distributed to the message of the 2 nd deterministic service flow, the scheduling period identifier C3 is distributed to the message of the 3 rd deterministic service flow, and the scheduling period identifier C4 is distributed to the message of the 4 th deterministic service flow; it should be noted that, the schedule period identifier is not fixed, so long as the schedule period identifiers allocated to the messages of the same service flow are the same at the same time, and the schedule period identifiers allocated to different service flows are different. In order to be compatible with the existing network device, the embodiment does not change the intermediate network device as much as possible, and adopts a mode of distributing the scheduling period identifier to the message by the exit gateway 214; indeed, it will also be readily apparent to those skilled in the art that if compatibility issues are not considered, scheduling period identification may also be added by ingress gateway 212; for example, the ingress gateway 212 may allocate a scheduling period identifier to the packet according to the information of the source IP address, the destination IP address, the protocol number, the source port, the destination port, etc. of the packet; the ingress gateway 212 may also allocate a scheduling period identifier to the packet according to which port of the ingress gateway receives the packet; the present disclosure is merely exemplary, and those skilled in the art will readily recognize that the ingress gateway 212 may also allocate the scheduling period identifier according to other information capable of differentiating traffic flows, which is not described herein. The ingress gateway 212 adds the scheduling period identifier to the SID field of the message, so long as the egress gateway 214 assigns messages of different traffic flows to different scheduling periods before sending the message according to the scheduling period identifier, which should not be limiting.
The egress gateway 214 has an ingress port and an egress port, assuming that there are ingress port a and ingress port B and egress port C, and that there are three queues for ingress port and egress port, respectively, queue Q1, queue Q2 and queue Q3.
Because the message passes through a plurality of intermediate network devices, a certain time is needed to wait when the message is received, and meanwhile, the speed of sending the message by the chip scheduling is very high. For example, when the queue Q1 is in a state of transmitting a message, the queues Q2 and Q3 are in a state of receiving a message.
Meanwhile, in order to balance the load of each queue, in order to enable the messages in each queue to be sent out faster, the residence time of the messages in the storage space of each queue is shorter, in this embodiment, the storage space of each queue is divided into a plurality of periodic storage spaces, and the state of each queue periodically receives messages and sends messages alternately.
The egress gateway 214 receives a message from an ingress port, the message carrying a queue identifier and a scheduling period identifier. The queue identifiers of the messages of the four deterministic service flows are Q1, and the scheduling period identifiers are C1, C2, C3 and C4 respectively.
The egress gateway 214 stores the messages with the same queue identity in the same queue of the ingress port and sends the messages of the same queue to the egress port. And storing the messages identified by the same scheduling period into the same section of storage space of one queue of the output port. For example, assuming that the ingress port a receives N messages carrying Q1 identifiers, the N messages are stored in the queue Q1 of the ingress port a; and sending the N messages to a queue Q1 of an output port C, wherein the queue Q1 of the output port C is divided into a plurality of sections of storage spaces according to a scheduling period, and the divided storage spaces are respectively identified as C1, C2 and C3 to CN on the assumption of the total N sections of storage spaces. The ingress gateway 214 stores the message allocated to the scheduling period identifier C1 into the storage space identified as C1 according to the scheduling period identifier allocated to the message in the above step; storing the message distributed to the scheduling period identifier C2 into a storage space identified as C2; storing the message distributed to the scheduling period identifier C3 into a storage space identified as C3; and storing the message distributed to the scheduling period identifier C4 into a storage space identified as C4.
The egress gateway 214 sends several messages in each section of storage space to the target device in the same period of sending messages in the outgoing port's queue. For example, the egress gateway 214 constantly polls, loops from the C1 cycle to the CN, and whenever loops to the C1 cycle, the egress gateway 214 sends a message identifying the memory space of C1 to the user device 234. In a specific implementation process, in order to improve the sending efficiency, a period without a message in the storage space can be skipped, and the next period can be directly entered.
It should be noted that, the network optimization method in this embodiment is applied to a deterministic network, but those skilled in the art apply the network optimization method to a non-deterministic network, so that the delay can be reduced and the jitter of the network can be reduced.
Corresponding to the embodiments of the aforementioned method, the present specification also provides embodiments of the apparatus and the terminal to which it is applied.
As shown in fig. 3, fig. 3 is a block diagram of a network optimization device 300 according to one embodiment of the present disclosure, the device includes:
the network optimization apparatus 300 is applied to a gateway device, where the gateway device has an ingress port and an egress port, and queues storing messages exist in the ingress port and the egress port, and the network optimization apparatus 300 includes:
a message receiving module 310, configured to receive a message entering the ingress port, where the message carries a queue identifier and a scheduling period identifier; wherein, each scheduling period marks a period for sending a message of a queue representing a port; and storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port.
A message output module 320, configured to store the messages identified in the same scheduling period into the same section of storage space of one of the queues of the output port; and transmitting a plurality of messages in each section of storage space to the target equipment in the same message transmitting period of the queues of the output ports.
Specific details of the implementation process of the functions and roles of each module in the device are shown in the implementation process of the corresponding steps in the method, and are not repeated here.
The embodiments of the network optimization device of the present specification may be applied to gateway devices, such as routers, switches, and the like. The apparatus embodiments may be implemented by software, or may be implemented by hardware or a combination of hardware and software. Taking software implementation as an example, the device in a logic sense is formed by reading corresponding computer program instructions in the nonvolatile memory into the memory through a processor of the file processing where the device is located. In terms of hardware, as shown in fig. 4, a hardware structure diagram of a gateway device where the network optimization apparatus according to the embodiment of the present invention is located is shown in fig. 4, and the gateway device where the apparatus 431 is located in the embodiment of the present invention may further include other hardware according to the actual function of the gateway device, except for the processor 410, the memory 430, the network interface 420, and the nonvolatile memory 440 shown in fig. 4, which will not be described again.
For the device embodiments, reference is made to the description of the method embodiments for the relevant points, since they essentially correspond to the method embodiments. The apparatus embodiments described above are merely illustrative, wherein the modules illustrated as separate components may or may not be physically separate, and the components shown as modules may or may not be physical, i.e., may be located in one place, or may be distributed over a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purposes of the present description. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Accordingly, the present embodiment also provides a computer storage medium having stored thereon a computer program which, when executed by a processor, implements the fault diagnosis method in any of the above embodiments.
The present application may take the form of a computer program product embodied on one or more storage media (including, but not limited to, magnetic disk storage, CD-ROM, optical storage, etc.) having program code embodied therein. Computer-usable storage media include both permanent and non-permanent, removable and non-removable media, and information storage may be implemented by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to: phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, may be used to store information that may be accessed by the computing device.
The foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
Other embodiments of the present description will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This specification is intended to cover any variations, uses, or adaptations of the specification following, in general, the principles of the specification and including such departures from the present disclosure as come within known or customary practice within the art to which the specification pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the specification being indicated by the following claims.
It is to be understood that the present description is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present description is limited only by the appended claims.
The foregoing description of the preferred embodiments is provided for the purpose of illustration only, and is not intended to limit the scope of the disclosure, since any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the disclosure are intended to be included within the scope of the disclosure.
Claims (9)
1. A network optimization method applied to a gateway device, wherein the gateway device has an ingress port and an egress port, and the ingress port and the egress port have queues for storing messages, the method comprising the steps of:
receiving a message entering the inlet port, wherein the message carries a queue identifier and a scheduling period identifier;
wherein, each said scheduling period identifies a period of sending a message that characterizes a queue of said egress port;
storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port;
storing the messages identified in the same scheduling period into the same section of storage space of one queue of the output port;
and transmitting a plurality of messages in each section of storage space to the target equipment in the same message transmitting period of the queues of the output ports.
2. The method of claim 1, wherein the queue identity characterizes that the message is the highest priority to be sent if the message is a deterministic traffic flow.
3. The method of claim 1, wherein at any time one of the queues is in a state of transmitting messages and the remaining queues are in a state of receiving messages.
4. The method of claim 1, wherein the queue periodically alternates the status of received messages and sent messages.
5. The method of claim 1, wherein the messages identified by the same scheduling period are messages of the same traffic flow.
6. The method of claim 1, wherein the message is a message encapsulated based on a SRv protocol, and wherein the queue identification and scheduling period identification are carried in a SID field of the message.
7. A network optimization apparatus, the apparatus being applied to a gateway device, the gateway device having an ingress port and an egress port, the ingress port and the egress port having queues for storing messages, the apparatus comprising:
message receiving module: receiving a message entering the inlet port, wherein the message carries a queue identifier and a scheduling period identifier; wherein, each said scheduling period identifies a period of sending a message that characterizes a queue of said egress port;
storing the messages identified by the same queue into the same queue of the input port, and transmitting the messages in the same queue to the output port;
message outgoing module: storing the messages identified in the same scheduling period into the same section of storage space of one queue of the output port;
and transmitting a plurality of messages in each section of storage space to the target equipment in the same message transmitting period of the queues of the output ports.
8. A gateway device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to perform the method of any of claims 1-6.
9. A storage medium having stored thereon a computer program, which when executed by a processor, implements the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111406606.1A CN114143378B (en) | 2021-11-24 | 2021-11-24 | Network optimization method, device, gateway equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111406606.1A CN114143378B (en) | 2021-11-24 | 2021-11-24 | Network optimization method, device, gateway equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114143378A CN114143378A (en) | 2022-03-04 |
| CN114143378B true CN114143378B (en) | 2023-07-25 |
Family
ID=80392180
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111406606.1A Active CN114143378B (en) | 2021-11-24 | 2021-11-24 | Network optimization method, device, gateway equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114143378B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115242728B (en) * | 2022-06-27 | 2023-07-21 | 新华三技术有限公司 | Message transmission method and device |
| CN115037708B (en) * | 2022-08-10 | 2022-11-18 | 深圳星云智联科技有限公司 | Message processing method, system, device and computer readable storage medium |
| WO2024036476A1 (en) * | 2022-08-16 | 2024-02-22 | 新华三技术有限公司 | Packet forwarding method and apparatus |
| CN117768409A (en) * | 2022-09-16 | 2024-03-26 | 中兴通讯股份有限公司 | Message scheduling method, network device, storage medium and computer program product |
| CN117768386A (en) * | 2022-09-16 | 2024-03-26 | 中兴通讯股份有限公司 | Message processing method, message transmission method, communication device, system, medium and product |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104618265A (en) * | 2014-12-30 | 2015-05-13 | 华为技术有限公司 | Message forwarding method and device |
| CN109768927A (en) * | 2019-01-31 | 2019-05-17 | 新华三技术有限公司 | A kind of HQoS implementation method and device |
| CN113542157A (en) * | 2020-04-13 | 2021-10-22 | 华为技术有限公司 | Method for controlling door state in time-sensitive network and related equipment |
| CN113678414A (en) * | 2019-03-29 | 2021-11-19 | 华为技术有限公司 | Switching device, control device and corresponding method for enhanced schedulability and throughput over a TSN network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6959002B2 (en) * | 2001-05-01 | 2005-10-25 | Integrated Device Technology, Inc. | Traffic manager for network switch port |
| WO2017059550A1 (en) * | 2015-10-07 | 2017-04-13 | Szymanski Ted H | A reduced-complexity integrated guaranteed-rate optical packet switch |
-
2021
- 2021-11-24 CN CN202111406606.1A patent/CN114143378B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104618265A (en) * | 2014-12-30 | 2015-05-13 | 华为技术有限公司 | Message forwarding method and device |
| CN109768927A (en) * | 2019-01-31 | 2019-05-17 | 新华三技术有限公司 | A kind of HQoS implementation method and device |
| CN113678414A (en) * | 2019-03-29 | 2021-11-19 | 华为技术有限公司 | Switching device, control device and corresponding method for enhanced schedulability and throughput over a TSN network |
| CN113542157A (en) * | 2020-04-13 | 2021-10-22 | 华为技术有限公司 | Method for controlling door state in time-sensitive network and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114143378A (en) | 2022-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114143378B (en) | Network optimization method, device, gateway equipment and storage medium | |
| CN113382442B (en) | Message transmission method, device, network node and storage medium | |
| KR101843239B1 (en) | System and method for providing a software defined protocol stack | |
| US7061862B2 (en) | Inter-network relay system and method | |
| CN102461089B (en) | For the method and apparatus using label to carry out strategy execution | |
| US7028204B2 (en) | Method and apparatus for ethernet prioritized device clock synchronization | |
| US20110019572A1 (en) | Method and apparatus for shared shaping | |
| EP3817307A1 (en) | Message processing method and device | |
| US20110182179A1 (en) | Policing virtual connections | |
| CN106453138B (en) | Message processing method and device | |
| CA2825830C (en) | Method for improving the quality of data transmission in a packet-based communication network | |
| Lin et al. | DTE-SDN: A dynamic traffic engineering engine for delay-sensitive transfer | |
| US20220150159A1 (en) | Control device, switch device and methods | |
| JPWO2016194089A1 (en) | Communication network, communication network management method and management system | |
| CN102106116A (en) | Technique for communicating between a plurality of nodes | |
| JPWO2004086697A1 (en) | Node device having multiple links and method of assigning user bandwidth to multiple links | |
| US20090262748A1 (en) | Relaying apparatus and packet relaying apparatus | |
| EP4250669A1 (en) | Packet forwarding method, electronic device, and storage medium | |
| Zeghid et al. | Modified optical burst switching (OBS) based edge node architecture using real-time scheduling techniques | |
| US20120127858A1 (en) | Method and apparatus for providing per-subscriber-aware-flow qos | |
| JP2002359634A (en) | Method and device for designing communication path and program | |
| EP4336795A1 (en) | Message transmission method and network device | |
| CN112787953B (en) | Deterministic traffic flow transmission method and device, electronic equipment and storage medium | |
| CN111600793B (en) | Message forwarding method and device | |
| Demir et al. | Multi-Topology Routing based traffic optimization for IEEE 802.1 Time Sensitive Networking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |