CN115134303A - Service flow processing method and device, electronic equipment and storage medium - Google Patents
Service flow processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115134303A CN115134303A CN202210814539.5A CN202210814539A CN115134303A CN 115134303 A CN115134303 A CN 115134303A CN 202210814539 A CN202210814539 A CN 202210814539A CN 115134303 A CN115134303 A CN 115134303A
- Authority
- CN
- China
- Prior art keywords
- traffic
- flow
- segment
- service
- routing header
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000005111 flow chemistry technique Methods 0.000 title claims abstract description 18
- 238000012545 processing Methods 0.000 claims abstract description 51
- 230000015654 memory Effects 0.000 claims description 20
- 230000032683 aging Effects 0.000 claims description 14
- 238000013507 mapping Methods 0.000 claims description 12
- 238000001514 detection method Methods 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 7
- 238000012986 modification Methods 0.000 claims description 7
- 230000001172 regenerating effect Effects 0.000 claims description 6
- 230000004044 response Effects 0.000 claims description 5
- 238000009789 rate limiting process Methods 0.000 claims description 3
- 238000004590 computer program Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 9
- 238000004364 calculation method Methods 0.000 abstract description 3
- 239000002699 waste material Substances 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 13
- 238000003672 processing method Methods 0.000 description 9
- 238000007363 ring formation reaction Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 5
- 238000005538 encapsulation Methods 0.000 description 4
- 230000006399 behavior Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000004064 recycling Methods 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000010719 annulation reaction Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000004087 circulation Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000010355 oscillation Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
Abstract
The disclosure provides a service flow processing method and device, electronic equipment and a storage medium, and relates to the technical field of communication. The service flow processing method comprises the following steps: acquiring a segment routing header message corresponding to service flow, and determining a segment identifier contained in the segment routing header message; determining whether a traffic loop phenomenon exists in the traffic based on the segment identifier and the local segment identifier; and if the traffic flow is determined to have the traffic loop phenomenon, performing traffic speed limit processing on the traffic flow. The technical scheme of the embodiment of the disclosure can reduce the complexity and the complexity of manually judging the SRH flow looping, avoid the problem of SRv6 network flow loop caused by manual planning error or controller route calculation error, and reduce the waste of bandwidth resources; and the malicious attack to the network by tampering the SRv6SRH message is effectively prevented, the security protection method aiming at the SRv6TE Policy scene is realized, and the network security is improved.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a service traffic processing method, a service traffic processing apparatus, an electronic device, and a computer-readable storage medium.
Background
With the rapid development of internet Technology, the fifth Generation Mobile Communication Technology (5th Generation Mobile Communication Technology, hereinafter referred to as 5G) is increasingly widely used. SRv6(Segment Routing IPv6, Segment Routing based on IPv6 forwarding plane), is a new generation IP bearer protocol. The network programming is realized by adopting the existing IPv6 forwarding technology and a flexible IPv6 extension header. SRv6, the network protocol type is simplified, the method has good expansibility and programmability, can meet the diversified requirements of more new services, provides high reliability, and has good application prospect in cloud services.
In the related art, a network element device designates a forwarding path of service traffic through a Segment Routing Header (Segment Routing Header) of a Header encapsulation SRv6SRH, but when a misconfiguration or a malicious attack occurs, a flow loop is formed by multiple circulations of the path designated by the SRv6SRH of the Header encapsulation between two or more devices, so that bandwidth resources of a network are exhausted, and a Routing protocol vibrates under a severe condition, or even the security of the whole network is endangered.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a service traffic processing method, a service traffic processing apparatus, an electronic device, and a computer-readable storage medium, so as to avoid a traffic loop problem occurring in a forwarding process of an SRH packet at least to a certain extent, reduce bandwidth exhaustion caused by SRv6SRH unreasonable planning or malicious attack on a network, and improve security of the network.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the embodiments of the present disclosure, a method for processing service traffic is provided, including: acquiring a segment routing header message corresponding to service flow, and determining a segment identifier contained in the segment routing header message; determining whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and a local segment identifier; and if the traffic flow is determined to have a traffic loop phenomenon, performing traffic speed limit processing on the traffic flow.
In some example embodiments of the present disclosure, based on the foregoing scheme, the determining whether a traffic loop phenomenon exists in the traffic flow based on the segment identifier and the local segment identifier includes: comparing the segment identifier with a local segment identifier; if the number of the segment identifiers matched with the local segment identifiers is greater than or equal to a preset number threshold value, determining that a traffic loop phenomenon exists in the service flow; and if the number of the segment identifications matched with the local segment identification is smaller than the number threshold, determining that the traffic flow does not have a flow loop phenomenon.
In some example embodiments of the present disclosure, based on the foregoing, the method further includes: and if the service flow is determined to have no flow loop phenomenon, forwarding the service flow according to the segment identifier.
In some example embodiments of the present disclosure, based on the foregoing scheme, if it is determined that the traffic flow has a traffic loop phenomenon, performing traffic speed limit processing on the traffic flow includes: if the service flow is determined to have a flow loop phenomenon, encapsulating a target field attribute in the segment routing header message; determining the ring forming times of the service flow according to the target field attribute and the segment identifier; and carrying out flow rate limiting processing on the service flow based on the ring forming times.
In some example embodiments of the present disclosure, based on the foregoing solution, the determining, according to the target field attribute and the segment identifier, the looping number of the traffic flow includes: generating an access control list according to the target field attribute and the segment identifier; determining that the segment routing header message forms a loop in response to the segment routing header message matching the access control list; modifying the segment identification value in the target field attribute, and regenerating a new access control list for matching through the segment identification in the segment routing header message and the modified target field attribute; and circularly executing the steps until the section routing head message is not matched with the access control list, and determining the looping times of the service flow according to the modification times of the target field attribute.
In some example embodiments of the present disclosure, based on the foregoing, the method further comprises: acquiring a preset aging period; and if the passage of the segment routing header message matched with the access control list is not detected in the aging period, deleting the access control list.
In some example embodiments of the present disclosure, based on the foregoing scheme, the performing, based on the looping times, a traffic speed limit process on the service traffic includes: acquiring an ingress interface traffic bandwidth corresponding to the segment of routing header message and a preset mapping relation of a speed limit value; determining a target speed limit value according to the speed limit value mapping relation, the incoming interface flow bandwidth and the ring forming times; and carrying out flow rate limit processing on the service flow through the target rate limit value.
According to a second aspect of the embodiments of the present disclosure, there is provided a service traffic processing apparatus, including: a segment identifier determining module, configured to obtain a segment routing header packet corresponding to a service flow, and determine a segment identifier included in the segment routing header packet; a traffic loop detection module, configured to determine whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and the local segment identifier; and the flow loop speed limiting module is used for carrying out flow speed limiting processing on the service flow if the service flow is determined to have a flow loop phenomenon.
In an example embodiment of the present disclosure, the traffic loop detection module may be configured to: comparing the segment identifier with a local segment identifier; if the number of the segment identifiers matched with the local segment identifiers is greater than or equal to a preset number threshold value, determining that a traffic loop phenomenon exists in the service flow; and if the number of the segment identifications matched with the local segment identification is smaller than the number threshold, determining that the traffic flow does not have a flow loop phenomenon.
In an example embodiment of the present disclosure, the service traffic processing apparatus further includes a normal forwarding module, and the normal forwarding module may be configured to: and if the service flow is determined to have no flow loop phenomenon, forwarding the service flow according to the segment identifier.
In an example embodiment of the present disclosure, the traffic loop speed limit module may include: a target field attribute encapsulation unit, configured to encapsulate a target field attribute in the segment routing header packet if it is determined that a traffic loop phenomenon exists in the service traffic; a looping time detecting unit, configured to determine a looping time of the service traffic according to the target field attribute and the segment identifier; and the flow rate limit processing unit is used for carrying out flow rate limit processing on the service flow based on the ring formation times.
In an example embodiment of the present disclosure, the looping number detecting unit may be configured to: generating an access control list according to the target field attribute and the segment identifier; determining that the segment routing header message forms a loop in response to the segment routing header message matching the access control list; modifying the segment identification value in the target field attribute, and regenerating a new access control list for matching through the segment identification in the segment routing header message and the modified target field attribute; and circularly executing the steps until the section routing head message is not matched with the access control list, and determining the looping times of the service flow according to the modification times of the target field attribute.
In an example embodiment of the present disclosure, the traffic flow processing apparatus may include an access control list aging module, and the access control list aging module may be configured to: acquiring a preset aging period; and if the passage of the segment routing header message matched with the access control list is not detected in the aging period, deleting the access control list.
In an example embodiment of the present disclosure, the flow rate limit processing unit may be configured to: acquiring an ingress interface traffic bandwidth corresponding to the segment routing header message and a preset speed limit value mapping relation; determining a target speed limit value according to the speed limit value mapping relation, the incoming interface flow bandwidth and the ring forming times; and carrying out flow rate limit processing on the service flow through the target rate limit value.
According to a third aspect of an embodiment of the present disclosure, there is provided an electronic apparatus including: a processor; and a memory, wherein the memory stores computer readable instructions, and the computer readable instructions, when executed by the processor, implement the service flow processing method.
According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the traffic flow processing method according to any one of the above.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
the method for processing the service traffic in the exemplary embodiment of the present disclosure may obtain a segment routing header message corresponding to the service traffic, determine a segment identifier included in the segment routing header message, determine whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and a local segment identifier, and perform traffic speed limit processing on the service traffic when it is determined that the traffic loop phenomenon exists in the service traffic. On one hand, the flow loop phenomenon can be detected by comparing the segment identifier contained in the segment routing header message with the local segment identifier, and the complexity of manually judging the SRH flow loop can be effectively reduced; on the other hand, by detecting the flow loop phenomenon of the segment routing header message in the forwarding process and carrying out flow speed limit processing on the service flow with the flow loop phenomenon, the problem of SRv6 network flow loop caused by artificial planning error or controller route calculation error can be avoided, and the waste of bandwidth resources is reduced; on the other hand, by detecting the traffic loop phenomenon and timely performing traffic speed limit processing on the service traffic with the traffic loop phenomenon, malicious attacks on the network can be effectively prevented by tampering the SRv6SRH message, a safety protection method under the SRv6TE Policy scene is realized, and network safety is improved.
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 present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty. In the drawings:
fig. 1 schematically illustrates a flow diagram of a traffic flow processing method according to some embodiments of the present disclosure;
FIG. 2 schematically illustrates a flow diagram for detecting traffic looping phenomena, according to some embodiments of the present disclosure;
FIG. 3 schematically illustrates a flow diagram for determining a number of annulations of traffic flow, in accordance with some embodiments of the present disclosure;
FIG. 4 schematically illustrates a flow diagram of a traffic rate limiting process for traffic flow, in accordance with some embodiments of the present disclosure;
fig. 5 schematically illustrates a schematic diagram of segment routing header packet formation loop traffic, in accordance with some embodiments of the present disclosure;
FIG. 6 schematically illustrates a flow diagram for implementing flow loop detection and flow loop speed limiting, according to some embodiments of the present disclosure;
figure 7 schematically illustrates a composition diagram of a traffic flow processing apparatus, according to some embodiments of the present disclosure;
FIG. 8 schematically illustrates a structural schematic of a computer system of an electronic device, in accordance with some embodiments of the present disclosure;
fig. 9 schematically illustrates a schematic diagram of a computer-readable storage medium, according to some embodiments of the present disclosure.
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the disclosure.
Furthermore, the figures are merely schematic illustrations and are not necessarily drawn to scale. The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
In the related art, an IP RAN (Radio Access Network) Network, a metropolitan area Network, and a data center Network are more used SRv6 to carry user data traffic. SRv6 has two working modes, one is SRv6 BE (Segment Routing IPv6 Best Effort) and the other is SRv6TE Policy (Segment Routing IPv6 Traffic Engineering Policy).
Since SRv6 BE has a weak capacity for path planning, SRv6TE Policy is more applicable to bearer networks and data center networks. SRv6TE Policy is issued by a controller or manually configured to a head node of SRv6 network element, the forwarding plane defines the network element or link through which the service traffic needs to pass by encapsulating an SRH message by the head node of SRv6 network element, and the SRH message head is stripped off at the last hop, SRv6TE Policy, no matter manually configured or issued by the controller, the network element does not have security detection on SID (Segment Identifier) in the SRH, so when the network element receives an SRH message with a recycling SID, the service traffic repeatedly passes through the same network element or link to cause a loop, thereby seriously wasting network link bandwidth, consuming network element chip resources, and causing high priority service damage, and causing protocol oscillation and even network paralysis under serious conditions.
Based on one or more problems in the related art, in the present exemplary embodiment, a traffic processing method is first provided, and the traffic processing method may be performed by a network node, for example, the traffic processing method may be performed by SRv6 network element devices. Fig. 1 schematically illustrates a flow diagram of a traffic flow processing method according to some embodiments of the present disclosure. Referring to fig. 1, the method for processing service traffic may include the following steps:
step S110, obtaining a segment routing header message corresponding to service flow, and determining a segment identifier contained in the segment routing header message;
step S120, determining whether the service flow has a flow loop phenomenon based on the segment identifier and the local segment identifier;
step S130, if the service flow is determined to have the flow loop phenomenon, the flow speed limit processing is carried out on the service flow.
According to the service traffic processing method in the embodiment of the present invention, on one hand, the traffic loop phenomenon can be detected by comparing the segment identifier included in the segment routing header message with the local segment identifier, and the complexity of manually judging the SRH traffic looping can be effectively reduced; on the other hand, by detecting the flow loop phenomenon of the segment routing header message in the forwarding process and carrying out flow speed limit processing on the service flow with the flow loop phenomenon, the problem of SRv6 network flow loop caused by artificial planning error or controller route calculation error can be avoided, and the waste of bandwidth resources is reduced; on the other hand, by detecting the traffic loop phenomenon and timely performing traffic speed limit processing on the service traffic with the traffic loop phenomenon, malicious attacks on the network can be effectively prevented by tampering the SRv6SRH message, a safety protection method under SRv6te policy scene is realized, and network safety is improved.
Next, a traffic flow processing method in the present exemplary embodiment will be further described.
In step S110, a segment routing header packet corresponding to the service traffic is obtained, and a segment identifier included in the segment routing header packet is determined.
In an exemplary embodiment of the present disclosure, the service traffic refers to user data network traffic based on an IPv6 protocol, the Segment Routing header message SRH implements SR (Segment Routing) technology based on an IPv6 forwarding plane, an SRH extension header is newly added to an IPv6 Routing extension header, the extension header specifies an explicit path of IPv6, and stores Segment List (SL) information of IPv 6. The SL is a forwarding path obtained by sequentially arranging the Segments and the network nodes, and when a message is forwarded, the fields of Segments Left and Segment List are used for jointly determining the information of an IPv6 destination address (IPv6 DA), so as to guide the forwarding path and the behavior of the message.
The segment id SID is data identifying a path segment included in the segment routing header packet. SRv6 the core idea is to cut the message forwarding path into different segments, and insert Segment information into the message at the starting point of the path, and the intermediate node only needs to forward according to the Segment information carried in the message, such path Segment is called Segment and identified by Segment identification SID.
In step S120, it is determined whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and the local segment identifier.
In an example embodiment of the present disclosure, the traffic loop phenomenon refers to a phenomenon that when a network element receives an SRH packet with a recycling SID, service traffic is repeatedly forwarded through the same network element or link.
The local segment identifier is a segment identifier corresponding to a routing node in the forwarding process of the service traffic, for example, if a routing node A exists in the networking, the local segment identifier is 1: 1; routing node B, local segment identification 2: 2; the local section identifier of the routing node C is 3: 3; and the segment identifiers included in the SRH of the service traffic are 2::2, 3::3, and 1::1 from SL ═ 0 to SL ═ 2, respectively, which means that the service traffic is accessed from the routing node B, then forwarded to the routing node C through the interface, and then forwarded to the routing node a through the interface. Of course, this is only an illustrative example, and the present exemplary embodiment is not limited thereto.
In step S130, if it is determined that the traffic flow has a traffic loop phenomenon, performing traffic speed limit processing on the traffic flow.
In an example embodiment of the present disclosure, the traffic Rate limiting process refers to a process of limiting a traffic flow with a traffic loop phenomenon, for example, the traffic flow with the traffic loop phenomenon may be limited by means of Committee Access Rate (CAR), and CAR Rate limiting mainly has two functions: the incoming and outgoing flow rate of a port or sub-port (Subintec) is carried out according to a certain standard upper limit; and classifying the flow to divide different QoS priorities. CAR can only work on IP packets and not on non-IP traffic. Of course, the traffic flow with the traffic loop phenomenon may also be limited by other types of traffic rate limiting manners, which is not limited in this example embodiment.
Next, step S110 to step S130 will be described in detail.
In an example embodiment of the present disclosure, after the network element device SRv6 receives the service traffic, the segment routing header message SRH corresponding to the service traffic may be obtained, and all segment identifiers SID between SL ═ 0 and SL ═ n (n is a SL value corresponding to the local segment identifier) of the segment routing header message SRH are analyzed, so as to obtain all segment identifiers included in the segment routing header message SRH.
In an example embodiment of the present disclosure, determining whether a traffic loop phenomenon exists in service traffic based on a segment identifier and a local segment identifier may be implemented by the steps in fig. 2, and as shown in fig. 2, the determining specifically may include:
step S210, comparing the segment identifier with a local segment identifier;
step S220, if the number of the segment identifications matched with the local segment identification is detected to be larger than or equal to a preset number threshold, determining that a flow loop phenomenon exists in the service flow;
step S230, if it is detected that the number of the segment identifiers matched with the local segment identifier is smaller than the number threshold, determining that the traffic flow does not have a traffic loop phenomenon.
The quantity threshold refers to preset data for determining whether the service traffic forms a ring, for example, the quantity threshold may be 2, if a segment identifier in a segment routing header message has 2 or more segment identifiers that are matched with a local segment identifier, it may be considered that a traffic loop phenomenon exists in the service traffic corresponding to the segment routing header message, and of course, if the quantity of the segment identifiers in the segment routing header message that are matched with the local segment identifier is less than 2, it may be considered that the traffic loop phenomenon does not exist in the service traffic corresponding to the segment routing header message; of course, the number threshold may also be set to 3, may also be set to 1, and the like, and the specific number threshold may be set by self-definition according to an actual situation, which is not particularly limited in this example embodiment.
When detecting that the number of segment identifiers matched with the local segment identifiers is greater than or equal to a preset number threshold, it can be considered that the number of times of passing through the current network element will exceed the number of times corresponding to the number threshold in the forwarding process of the segment routing header message or the service flow corresponding to the segment routing header message, so as to form a flow loop, possibly exhausting network loan resources, and needing to perform flow rate limiting processing; on the contrary, when it is detected that the number of the segment identifiers matched with the local segment identifier is smaller than the number threshold, it can be considered that the number of times of the segment routing header packet or the service traffic corresponding to the segment routing header packet passing through the current network element is small in the forwarding process, and the segment routing header packet belongs to a normal traffic forwarding process, and does not belong to a traffic loop phenomenon, and the speed limit processing is not required.
Optionally, the number threshold may not be set, and if all segment identifiers in the segment routing header message do not hit the local segment identifier, the next hop-out interface may be directly checked for forwarding without performing any processing on the segment routing header message; if the segment identifier in the segment routing header message hits the segment identifier of the local network element for more than 1 time, the segment routing header message can be considered to have a loop risk, namely, a traffic loop phenomenon exists.
In an example embodiment of the present disclosure, if it is determined that the traffic does not have a traffic loop phenomenon, the traffic may be forwarded according to the segment identifier.
In an example embodiment of the present disclosure, the performing of the traffic speed limit processing on the service traffic may be implemented through the following steps, which may specifically include:
if the service flow is determined to have a flow loop phenomenon, encapsulating the target field attribute in the segment routing header message; determining the ring forming times of the service flow according to the target field attribute and the segment identifier; and carrying out flow rate limiting processing on the service flow based on the ring forming times.
The target field attribute refers to data used for identifying the segment routing header packet, for example, the target field attribute may be opaque container tlv, and of course, the target field attribute may also be other types of parameters that can be encapsulated in the segment routing header packet and implement the function of identifying the segment routing header packet, which is not particularly limited in this example embodiment.
The ring formation times refer to the times that the segment routing header packet passes through the same network element in the forwarding process, for example, if there is a segment identifier with a value of 3: 2 in the segment routing header packet, the segment routing header packet will pass through the network element device with a local segment identifier of 2:2 for 3 times, and at this time, the ring formation times of the service traffic can be considered to be 3. Of course, this is only an illustrative example, and the present exemplary embodiment is not limited to this.
In an example embodiment of the present disclosure, determining the looping number of the service traffic according to the target field attribute and the segment identifier may be implemented by the steps in fig. 3, and as shown in fig. 3, the determining may specifically include:
step S310, generating an access control list according to the target field attribute and the segment identifier;
step S320, in response to the matching of the segment routing header message and the access control list, determining that the segment routing header message forms a loop; and
step S330, modifying the segment identification value in the target field attribute, and regenerating a new access control list for matching through the segment identification in the segment routing header message and the modified target field attribute;
step S340, performing the above steps in a loop until the segment routing header packet is not matched with the access control list, and determining the looping times of the service traffic according to the modification times of the target field attribute.
The Access Control List (ACL) may define a series of different rules, and the network element device may classify the data packets according to the rules and perform different processing on different types of messages, thereby implementing Control on network Access behavior, limiting network traffic, improving network performance, preventing network attacks, and the like.
Generating an Access Control List (ACL) according to a target field attribute (such as opaque container tlv) and all segment identifiers in a segment routing header message, determining that the segment routing header message forms a loop when the segment routing header message is matched with the access control list, namely the segment routing header message hits the ACL, further modifying a segment identifier value in the target field attribute, and regenerating a new access control list for matching through the segment identifiers in the segment routing header message and the modified target field attribute; the process is continuously executed in an iteration mode until the segment routing header message is not matched with the access control list, the segment routing header message can be considered not to form a loop, and the looping times of the service flow can be determined according to the modification times of the target field attribute.
Further, an aging period may be set, for example, the aging period may be 30 minutes or 1 hour, which is not particularly limited in this exemplary embodiment. If the passage of the segment routing header message matched with the access control list is not detected in the aging period, the access control list can be deleted, the ACL resources of the network element occupied by the useless access control list are reduced, and the processing performance of the network element equipment is improved.
In an example embodiment of the present disclosure, the step in fig. 4 may be implemented to perform traffic rate limiting processing on the service traffic based on the looping times, and as shown in fig. 4, the processing may specifically include:
step S410, acquiring the ingress interface traffic bandwidth corresponding to the segment routing header message and a preset mapping relation of a speed limit value;
step S420, determining a target speed limit value according to the mapping relation of the speed limit value, the flow bandwidth of the input interface and the ring forming times;
and step S430, carrying out flow rate limit processing on the service flow through the target rate limit value.
The bandwidth of the ingress interface traffic refers to the bandwidth occupation condition corresponding to the interface where the segment routing header message firstly enters the network element device.
The mapping relation of the speed limit values refers to preset speed limit values corresponding to different incoming interface flow bandwidths and different ring formation times.
For example, the mapping relationship of the speed limit value may be that when the ratio of the traffic bandwidth of the ingress interface to the total bandwidth is less than 10%, if the number of looping is n (n)<2), the issued speed limit is the ingress interface traffic bandwidth (which may be represented by bandwith) of the segment routing header packet, that is, the issued speed limit is bandwith (1/2) 6+n ) If the looping time is 3 times, the issued speed limit value may be bandwith (1/1024); when the ratio of the flow bandwidth of the incoming interface to the total bandwidth is more than 10% and less than 60%, if the ring formation frequency is n (n)<2), the issued speed limit value is the ingress interface traffic bandwidth of the segment routing header message, i.e. the issued speed limit value is bandwith (2/5) × (1/2) 6+n ) If the looping time is 3 times, the issued speed limit value may be bandwith (1/4096); when the ratio of the flow bandwidth of the incoming interface to the total bandwidth is more than 60% and less than 90%, if the ring formation frequency is n (n)<2), the issued speed limit value is the ingress interface traffic bandwidth (which may be represented by bandwith) of the segment routing header packet, that is, the issued speed limit value is bandwith (1/10) × (1/2) 6+n ) If the looping time is 3 times, the issued speed limit value may be bandwith (1/16376); when the ratio of the incoming interface flow bandwidth to the total bandwidth exceeds 90 percent or the service flow corresponding to the routing header message repeatedly passes through the same network element and is larger than or equal toAnd at 4 times, the issued speed limit value is 0, namely the service flow corresponding to the routing header message of the section is discarded.
Fig. 5 schematically illustrates a schematic diagram of segment routing header packet formation loop traffic, in accordance with some embodiments of the present disclosure.
Referring to FIG. 5, assume that routing node A510, routing node B520, and routing node C530 are present in the network and that the respective local segment identifiers are 1::1, 2::2, and 3::3, respectively. For the segment routing header message 540 corresponding to the service traffic, the segment identifiers corresponding to SL ═ 0 to SL ═ 4 are 2::2, 3::3, 2::2, 1::1, 2::2, at this time, the number of the segment identifiers 2::2 matching with the local segment identifier 2::2 of the routing node B520 in the segment routing header message 540 is 3, which may indicate that the segment routing header message 540 may pass through the routing node B520 for 3 times to form a loop, and it is detected that the service traffic has a traffic loop phenomenon.
Fig. 6 schematically illustrates a flow diagram for implementing flow loop detection and flow loop speed limiting, according to some embodiments of the present disclosure.
Referring to fig. 6, in step S610, the SRH loop detection module receives an SRH message;
step S620, the SRH-PA module analyzes all segment identifiers between SL ═ 0 and SL ═ n (n is an SL value corresponding to the local segment identifier) of the SRH packet;
step S630, the SRH-CM module receives the segment identifier analyzed by the SRH-PA module, matches the segment identifier with the local segment identifier, judges whether the segment identifier in the SRH message contains the local segment identifier, if the comparison shows that 2 or more segment identifiers exist in the SRH message are matched with the local segment identifier of the network element, the SRH message is considered to have loop risk, and step S640 is executed, otherwise step S670 is executed;
step S640, the SRH-PE module encapsulates a target field attribute in the SRH packet, for example, the target field attribute may be opaque container tlv, and is used to mark the service traffic corresponding to the SRH packet;
step S650, the SRH-ACL module generates an ACL rule according to the segment identification and the target field attribute of the SRH message, and counts the times of the SRH message passing through the current network element, namely the ring forming times of the SRH message through ACL rule matching;
step S660, the SRH-QoS module carries out flow rate limiting processing on the service flow according to the ring formation times counted by the SRH-ACL module and the acquired inlet interface flow bandwidth;
step S670, the SRH message is forwarded.
It should be noted that although the various steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that these steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken into multiple step executions, etc.
In addition, in the present exemplary embodiment, a traffic flow processing apparatus is also provided. Referring to fig. 7, the traffic processing apparatus 700 includes: the segment identifier determining module 710 is configured to obtain a segment routing header packet corresponding to a service flow, and determine a segment identifier included in the segment routing header packet; the traffic loop detection module 720 is configured to determine whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and the local segment identifier; the traffic loop speed limit module 730 is configured to perform traffic speed limit processing on the traffic flow if it is determined that the traffic flow has a traffic loop phenomenon.
In an example embodiment of the present disclosure, the traffic loop detection module 720 may be configured to:
comparing the segment identifier with a local segment identifier;
if the number of the segment identifiers matched with the local segment identifiers is greater than or equal to a preset number threshold value, determining that a traffic loop phenomenon exists in the service flow;
and if the number of the segment identifications matched with the local segment identification is smaller than the number threshold, determining that the traffic flow does not have a flow loop phenomenon.
In an example embodiment of the present disclosure, the traffic flow processing apparatus 700 further includes a normal forwarding module, and the normal forwarding module may be configured to:
and if the service flow is determined to have no flow loop phenomenon, forwarding the service flow according to the segment identifier.
In an example embodiment of the present disclosure, the traffic loop speed limit module 730 may include:
a target field attribute encapsulation unit, configured to encapsulate a target field attribute in the segment routing header packet if it is determined that a traffic loop phenomenon exists in the service traffic;
a looping time detecting unit, configured to determine a looping time of the service traffic according to the target field attribute and the segment identifier;
and the flow rate limit processing unit is used for carrying out flow rate limit processing on the service flow based on the ring formation times.
In an example embodiment of the present disclosure, the looping number detecting unit may be configured to:
generating an access control list according to the target field attribute and the segment identifier;
determining that the segment routing header message forms a loop in response to the segment routing header message matching the access control list; and
modifying the segment identification value in the target field attribute, and regenerating a new access control list for matching through the segment identification in the segment routing header message and the modified target field attribute;
and circularly executing the steps until the segment routing head message is not matched with the access control list, and determining the looping times of the service flow according to the modification times of the target field attribute.
In an example embodiment of the present disclosure, the traffic flow processing apparatus 700 may include an access control list aging module, which may be configured to:
acquiring a preset aging period;
and if the passage of the segment routing header message matched with the access control list is not detected in the aging period, deleting the access control list.
In an example embodiment of the present disclosure, the flow rate limit processing unit may be configured to:
acquiring an ingress interface traffic bandwidth corresponding to the segment routing header message and a preset speed limit value mapping relation;
determining a target speed limit value according to the mapping relation of the speed limit value, the flow bandwidth of the inlet interface and the ring forming times;
and carrying out flow rate limit processing on the service flow through the target rate limit value.
The specific details of each module of the service traffic processing apparatus have been described in detail in the corresponding service traffic processing method, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the traffic handling means are mentioned, this division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the service traffic processing method is also provided.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 800 according to such an embodiment of the disclosure is described below with reference to fig. 8. The electronic device 800 shown in fig. 8 is only an example and should not bring any limitations to the functionality and scope of use of the embodiments of the present disclosure.
As shown in fig. 8, fig. 8 is a block diagram of an electronic device 801 shown within a computing and communications environment, the electronic device 801 may be used to implement the communications network systems and methods disclosed herein. In some embodiments, the electronic device 801 may be an element in a communication network infrastructure, for example, the electronic device 801 may be a base station (e.g., NodeB, enhanced NodeB, eNodeB), next generation base station (sometimes referred to as gdb or gNB)), Home Subscriber Server (HSS), Gateway (GW) (e.g., Packet Gateway (PGW) or Serving Gateway (SGW)) or various other nodes or functions within an Evolved Packet Core (EPC) network.
In other embodiments, the electronic device 801 may be a device that connects to the network infrastructure over a wireless interface, for example, the electronic device 801 may be a cell phone, smart phone, or other such device that may be categorized as a User Equipment (UE).
In some embodiments, the electronic device 801 may also be a Machine Type Communications (MTC) device (also referred to as a Machine-to-Machine (M2M) device) or other such device that may be categorized as a UE (although not providing direct service to the user).
In some embodiments, the electronic device 801 may also be a Mobile Device (MD), a term used to denote a device connected to a mobile network, whether or not the device itself is designed or capable of mobility. A particular device may use all of the components shown or only a subset of these components and the degree of integration between devices may vary. Moreover, an apparatus may include multiple instances of a component, e.g., multiple processors, multiple memories, multiple transmitters, multiple receivers, etc.
The memory 803 may include any type of non-transitory system memory readable by the processor 802, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous DRAM (SDRAM), read-only memory (ROM), or a combination thereof. In particular embodiments, memory 803 may include more than one type of memory, such as ROM used at power-on and DRAM used to store programs and data used in executing programs. The bus 805 may be one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, or a video bus.
The electronic device 801 may also include one or more network interfaces 804, and the one or more network interfaces 804 may include at least one of a wired network interface and a wireless network interface. As shown in fig. 8, network interface 804 may include a wired network interface to a network 809, or may include a wireless access network interface 810 to connect to other devices via wireless links. When the electronic device 801 is a network infrastructure, the radio access network interface 810 may be omitted for nodes or functions that function as elements of a Core Network (CN) rather than elements located at the radio edge (e.g., an eNB). When the electronic device 801 is an infrastructure located at the wireless edge of a network, both wired network interfaces and wireless network interfaces may be included. When the electronic device 801 is a wirelessly connected device (e.g., user equipment, UE), the wireless access network interface 810 may be present and may be supplemented by other wireless interfaces such as a Wi-Fi network interface. The network interface 804 enables the electronic device 801 to communicate with remote entities, such as entities connected to a network 809.
An optional video adapter 807 and I/O interface 808 (shown in phantom) provide interfaces to couple the electronic device 801 to external input and output devices. Examples of input and output devices include a display 811 coupled to a video adapter 807 and one or more I/O devices 812 (e.g., a touch screen) coupled to an I/O interface 808. Other devices may be coupled to the electronic device 801 and more or fewer interfaces may be used. A serial interface, such as a Universal Serial Bus (USB) (not shown), may be used to interface to external devices. Those skilled in the art will appreciate that in embodiments where the electronic device 801 is part of a data center, the I/O interface 808 and the video adapter 807 can be virtualized and provided through the network interface 804.
In some embodiments, the electronic device 801 may be a standalone device, while in other embodiments, the electronic device 801 may be located within a data center. A data center is understood in the art as a collection of computing resources (typically in the form of servers) that can serve as a collective computing and storage resource. Within a data center, multiple servers may be connected together to provide a pool of computing resources on which virtualized entities may be instantiated. Data centers may be interconnected to form a network comprising computing and storage resource pools that are interconnected by connection resources. The connection resources may be physical connections such as ethernet or optical communication links, and may also include wireless communication channels. If two different data centers are connected by a plurality of different communication channels, the links may be grouped together using any of a number of techniques including forming a Link Aggregation Group (LAG). It should be understood that any or all of the computing, storage, and connection resources (as well as other resources within the network) may be partitioned between different subnets, in some cases in resource slices. If resources of a data center or other collection of nodes that span multiple connections are sliced, different network slices may be created.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the present disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the "exemplary methods" section above of this specification, when the program product is run on the terminal device.
Referring to fig. 9, a program product 900 for implementing the above-described traffic processing method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (10)
1. A method for processing service traffic is characterized by comprising the following steps:
acquiring a segment routing header message corresponding to service flow, and determining a segment identifier contained in the segment routing header message;
determining whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and a local segment identifier;
and if the traffic flow is determined to have a traffic loop phenomenon, performing traffic speed limit processing on the traffic flow.
2. The method of claim 1, wherein the determining whether the traffic flow has a traffic loop phenomenon based on the segment identifier and the local segment identifier comprises:
comparing the segment identifier with a local segment identifier;
if the number of the segment identifiers matched with the local segment identifiers is larger than or equal to a preset number threshold value, determining that a traffic loop phenomenon exists in the service flow;
and if the number of the segment identifications matched with the local segment identification is smaller than the number threshold, determining that the traffic flow does not have a flow loop phenomenon.
3. The traffic flow processing method according to claim 1 or 2, characterized in that the method further comprises:
and if the service flow is determined to have no flow loop phenomenon, forwarding the service flow according to the segment identifier.
4. The method according to claim 1, wherein if it is determined that the traffic flow has a traffic loop phenomenon, performing traffic speed limit processing on the traffic flow includes:
if the service flow is determined to have a flow loop phenomenon, encapsulating a target field attribute in the segment routing header message;
determining the looping times of the service flow according to the target field attribute and the segment identifier;
and carrying out flow rate limiting processing on the service flow based on the ring forming times.
5. The method of claim 4, wherein the determining the looping number of the service traffic according to the target field attribute and the segment identifier comprises:
generating an access control list according to the target field attribute and the segment identifier;
determining that the segment routing header message forms a loop in response to the segment routing header message matching the access control list; and
modifying the segment identification value in the target field attribute, and regenerating a new access control list for matching through the segment identification in the segment routing header message and the modified target field attribute;
and circularly executing the steps until the segment routing head message is not matched with the access control list, and determining the looping times of the service flow according to the modification times of the target field attribute.
6. The traffic flow processing method according to claim 5, wherein the method further comprises:
acquiring a preset aging period;
and if the section routing header message matched with the access control list does not pass through the aging period, deleting the access control list.
7. The method of claim 4, wherein the performing the traffic rate limiting process on the traffic flow based on the looping times includes:
acquiring an ingress interface traffic bandwidth corresponding to the segment routing header message and a preset speed limit value mapping relation;
determining a target speed limit value according to the speed limit value mapping relation, the incoming interface flow bandwidth and the ring forming times;
and carrying out flow rate limit processing on the service flow through the target rate limit value.
8. A traffic processing apparatus, comprising:
a segment identifier determining module, configured to obtain a segment routing header packet corresponding to a service flow, and determine a segment identifier included in the segment routing header packet;
a traffic loop detection module, configured to determine whether a traffic loop phenomenon exists in the service traffic based on the segment identifier and the local segment identifier;
and the flow loop speed limiting module is used for carrying out flow speed limiting processing on the service flow if the service flow is determined to have a flow loop phenomenon.
9. An electronic device, comprising:
a processor; and
memory having stored thereon computer readable instructions which, when executed by the processor, implement the traffic flow processing method according to any of claims 1 to 7.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out a traffic flow processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210814539.5A CN115134303A (en) | 2022-07-11 | 2022-07-11 | Service flow processing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210814539.5A CN115134303A (en) | 2022-07-11 | 2022-07-11 | Service flow processing method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115134303A true CN115134303A (en) | 2022-09-30 |
Family
ID=83383901
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210814539.5A Pending CN115134303A (en) | 2022-07-11 | 2022-07-11 | Service flow processing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115134303A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160021000A1 (en) * | 2014-07-17 | 2016-01-21 | Cisco Technology, Inc. | Segment routing using a remote forwarding adjacency identifier |
| CN111314219A (en) * | 2020-02-24 | 2020-06-19 | 盛科网络（苏州）有限公司 | Efficient forwarding method and device for IPv6 segmented routing |
| CN111431800A (en) * | 2020-03-20 | 2020-07-17 | 新华三技术有限公司合肥分公司 | Method, device and equipment for establishing path and machine-readable storage medium |
| US10764175B1 (en) * | 2019-03-19 | 2020-09-01 | Cisco Technology, Inc. | Validating resource isolation between network slices in a mobile network |
| CN112350934A (en) * | 2019-08-07 | 2021-02-09 | 中国电信股份有限公司 | Data transmission method, network node and data transmission system |
| CN114531398A (en) * | 2020-10-30 | 2022-05-24 | 华为技术有限公司 | Message forwarding method and related device |
| CN114679405A (en) * | 2022-04-12 | 2022-06-28 | 烽火通信科技股份有限公司 | SRv6 message forwarding method, storage medium, electronic equipment and device |
-
2022
- 2022-07-11 CN CN202210814539.5A patent/CN115134303A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160021000A1 (en) * | 2014-07-17 | 2016-01-21 | Cisco Technology, Inc. | Segment routing using a remote forwarding adjacency identifier |
| US10764175B1 (en) * | 2019-03-19 | 2020-09-01 | Cisco Technology, Inc. | Validating resource isolation between network slices in a mobile network |
| CN112350934A (en) * | 2019-08-07 | 2021-02-09 | 中国电信股份有限公司 | Data transmission method, network node and data transmission system |
| CN111314219A (en) * | 2020-02-24 | 2020-06-19 | 盛科网络（苏州）有限公司 | Efficient forwarding method and device for IPv6 segmented routing |
| CN111431800A (en) * | 2020-03-20 | 2020-07-17 | 新华三技术有限公司合肥分公司 | Method, device and equipment for establishing path and machine-readable storage medium |
| CN114531398A (en) * | 2020-10-30 | 2022-05-24 | 华为技术有限公司 | Message forwarding method and related device |
| CN114679405A (en) * | 2022-04-12 | 2022-06-28 | 烽火通信科技股份有限公司 | SRv6 message forwarding method, storage medium, electronic equipment and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111758279B (en) | Tracking QoS violation events | |
| US11909652B2 (en) | Method, device and storage medium for quality of service (QoS) flow management of time sensitive data for transmission of ethernet packet filter sets | |
| EP3767890B1 (en) | Method and apparatus for monitoring service quality | |
| US20210219185A1 (en) | Slice information processing method and apparatus | |
| US20230224218A1 (en) | Control apparatus in communication system and control method therefor | |
| CN110831033B (en) | Service quality monitoring method, equipment and system | |
| US11463346B2 (en) | Data processing method, device, and system | |
| US20220256390A1 (en) | Quality of service information notification method, device, and system | |
| CN114189905A (en) | Message processing method and related equipment | |
| CN110519786B (en) | Business service quality monitoring method, device and system | |
| US11165716B2 (en) | Data flow processing method and device | |
| US20230070712A1 (en) | Communication method, apparatus, and system | |
| US20210385723A1 (en) | Policy Management Method and Apparatus | |
| US20180219785A1 (en) | Service Packet Processing Method, Apparatus, and System | |
| WO2017067007A1 (en) | Method, device and system for controlling quality of service | |
| US11212230B2 (en) | Quality of service control method, device, and system | |
| CN115134303A (en) | Service flow processing method and device, electronic equipment and storage medium | |
| US20220116305A1 (en) | Message sending and receiving methods and apparatuses, and communication system | |
| CN113726657A (en) | Message forwarding method, device, system, equipment and storage medium | |
| CN108293024B (en) | Service data transmission method and device | |
| WO2024021573A1 (en) | Network slice-based communication method, electronic device, and storage medium | |
| RU2772710C2 (en) | Method for processing request and corresponding object | |
| WO2023280107A1 (en) | Data transmission quality detection method, and related device | |
| CN115550271A (en) | Time-sensitive network data processing method, device, equipment and storage medium | |
| CN116033493A (en) | Data volume distribution method, equipment and storage medium for user plane function |
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 |