CN115022248B - HQoS service access method and device - Google Patents
HQoS service access method and device Download PDFInfo
- Publication number
- CN115022248B CN115022248B CN202210599890.7A CN202210599890A CN115022248B CN 115022248 B CN115022248 B CN 115022248B CN 202210599890 A CN202210599890 A CN 202210599890A CN 115022248 B CN115022248 B CN 115022248B
- Authority
- CN
- China
- Prior art keywords
- flow
- eth
- hqos
- member port
- aggregation object
- 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
- 238000000034 method Methods 0.000 title claims abstract description 19
- 238000004220 aggregation Methods 0.000 claims abstract description 49
- 238000010586 diagram Methods 0.000 description 7
- 239000012634 fragment Substances 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000005484 gravity Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 102100033189 Diablo IAP-binding mitochondrial protein Human genes 0.000 description 1
- 101710101225 Diablo IAP-binding mitochondrial protein Proteins 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000012528 membrane Substances 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000000275 quality assurance Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/22—Alternate routing
-
- 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/24—Multipath
- H04L45/245—Link aggregation, e.g. trunking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to a HQoS business access method, which comprises the following steps: creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface; and acquiring a corresponding Hash value according to the message characteristics of the HQoS traffic and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS traffic according to the Hash value. To solve the problem that HQoS service can not bind bandwidth and has no physical link protection.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for accessing an HQoS service.
Background
At present, HQoS realizes multiple scheduling based on a multi-level queue, so that the flows of different users and different services can be finely distinguished, and the fine service quality assurance is provided.
In the related art, the HQoS multi-level scheduling model can only access to the common ethernet port, because the forwarding target of the service in the HQoS multi-level scheduling model is a virtual queue (VOQ), and the VOQ belongs to a single ethernet port, and the traffic entering the VOQ is finally forwarded from the bonded ethernet port. Under the HQoS hierarchical model, there are generally a plurality of users or user groups, and the HQoS is accessed to a common Ethernet port, so that the traffic of the users and the user groups can only be output from the port, the HQoS service of multiple users depends on the output bandwidth of the port, and the HQoS service of the users can be interrupted when the port fails.
Disclosure of Invention
The application mainly aims to provide a method and a device for accessing HQoS service, which are used for solving the problems that the HQoS service cannot bind bandwidth and does not have physical link protection.
In one aspect, an embodiment of the present application provides a method for accessing an HQoS service, which is characterized by comprising the steps of:
creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
and acquiring a corresponding Hash value according to the message characteristics of the HQoS traffic and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS traffic according to the Hash value.
In some embodiments, the binding the Flow-Aggregation object with the Eth-Trunk interface includes the steps of:
distributing continuous virtual forwarding queues for members in the Flow-Aggregation object;
and establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
In some embodiments, the enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS traffic according to the Hash value includes the steps of:
and hashing the member port number in an array, and taking the member port corresponding to the Hash value as an array subscript as the member port to be determined by the Flow-Aggregation object according to the Hash value.
In some embodiments, when there is a down member port, the down member port number in the array is replaced by other valid member port numbers in turn.
In some embodiments, the method further comprises the step of:
periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth.
In a second aspect, an embodiment of the present application provides an apparatus for accessing an HQoS service, which is characterized in that the apparatus includes:
an interface binding module for creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
and the Flow forwarding module is used for acquiring a corresponding Hash value according to the message characteristics of the HQoS service Flow and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS service Flow according to the Hash value.
In some embodiments, the interface binding module is further to:
distributing continuous virtual forwarding queues for members in the Flow-Aggregation object;
and establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
In some embodiments, the traffic forwarding module is further configured to:
the member port numbers are hashed in an array, and the member port corresponding to the Hash value serving as an array subscript is used as the member port to be determined by the Flow-Aggregation object according to the Hash value
In some embodiments, the traffic forwarding module is further configured to:
when the down member port exists, the down member port number in the array is replaced by other effective member port numbers in turn.
In some embodiments, further comprising:
a speed limit adjustment module for:
periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth. The embodiment of the application provides a method and a device for accessing an HQoS service, which are used for realizing the access of the HQoS service to an Eth-Trunk interface by designing a Flow-Aggregation object middle layer, and can achieve the purpose of increasing the bandwidth of a link by binding a plurality of Ethernet physical links together to form a logic link, and can effectively improve the reliability of the link between devices by adopting a mechanism of a backup link while achieving the purpose of increasing the bandwidth, thereby solving the problems that the HQoS service cannot bind the bandwidth and does not have physical link protection.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of an access method of an HQoS service according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a Flow-Agg object assignment Voq according to an embodiment of the application;
FIG. 3 is a schematic diagram of binding a Flow-Agg and an Eth-Trunk according to an embodiment of the present application;
fig. 4 is a schematic diagram of a Flow-Agg selecting a Trunk member port according to a hash according to an embodiment of the present application;
fig. 5 is a schematic diagram of a Trunk module calculating a hash value according to an embodiment of the present application;
fig. 6 is a diagram of HQoS scheduling and speed limiting according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an apparatus for accessing an HQoS service according to an embodiment of the present application.
The achievement of the objects, functional features and advantages of the present application will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The flow diagrams depicted in the figures are merely illustrative and not necessarily all of the elements and operations/steps are included or performed in the order described. For example, some operations/steps may be further divided, combined, or partially combined, so that the order of actual execution may be changed according to actual situations.
As shown in fig. 1, the method for accessing the HQoS service provided by the embodiment of the application includes the following steps:
s100, creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
s200, obtaining a corresponding Hash value according to the message characteristics of the HQoS traffic and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS traffic according to the Hash value.
It should be noted that, the message characteristics refer to content fragments in the message, such as five-tuple (sip\dip\sport\dport\protocol), but are not limited to these, and common message fragments, such as smac, dmac, etc., and theoretically any message fragment can be used as the message characteristics.
It can be understood that the hash value is calculated from the message characteristic field through a hash algorithm. The Hash algorithm is unique to the result calculated for the same set of input data. It is desirable to calculate different hash values for different input data, but this depends on the hash algorithm itself. For example, the sip has 4 bytes, and let us assume that we use the last byte of the sip as the hash value, i.e., the hash calculated by the sip 1.2.3.4 is 4 and the hash calculated by the sip 1.2.3.5 is 5.
The embodiment of the application realizes that the HQoS service is accessed to the Eth-Trunk interface (Ethernet link Aggregation interface) by designing a Flow-Aggregation (hereinafter referred to as Flow-Agg) object intermediate layer, and can achieve the purpose of increasing the link bandwidth by binding a plurality of Ethernet physical links together to form a logic link.
In some embodiments, S100 comprises the steps of:
s110, allocating continuous virtual forwarding queues for members in the Flow-Aggregation object;
and S120, establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
As shown in fig. 2, in a specific embodiment, when base_ voq (starting virtual forwarding queue) is allocated for 20 Flow-Agg objects, base_ voq allocated to Flow-Agg1 is 1, base_ voq allocated to Flow-Agg2 is 17, and base_ voq allocated to Flow-Agg20 is 305.
As shown in fig. 2 and 3, the binding process of the Flow-Agg object and the Eth-Trunk interface includes the steps of:
s1.1, distributing a plurality of members for a Flow-Agg object, wherein the number of the members is the same as the number of Eth-Trunk member ports;
step S1.2, each member in the Flow-Agg object is allocated with 8 continuous voq (virtual forwarding queues) and respectively corresponds to 8 priorities of HQoS service;
the start voq of each member of the Flow-Agg object is calculated according to a first formula: start of nth member voq =base_ voq + (N-1) x8;
step S1.4, when the voq of the member in the Flow-Agg object is bound to the member port of the Eth-Trunk, 8 consecutive voq allocated to the first member are bound to the first Ethernet port in the Eth-Trunk, 8 consecutive voq allocated to the second member are bound to the second Ethernet port in the consecutive voq to Eth-Trunk, and so on until the last Ethernet port in the last member is bound to the last Ethernet port in the 8 consecutive voq to Eth-Trunk; traffic enters voq and exits the ethernet port corresponding to voq.
As shown in fig. 2, in a specific embodiment, assuming that the Eth-Trunk has two Member ports, port1 and port2, two members, member1 and Member2, are allocated for Flow-Agg1, base_ voq allocated for Flow-Agg1 is 1, and 8 consecutive voq are allocated for Member1 as 1, 2, 3, 4, 5, 6, 7, 8, respectively, corresponding to 8 priorities of QoS traffic. The start voq assigned to membrane 2 is 9=1+ (2-1) x8.
As shown in fig. 3, in one particular embodiment, assuming that the Eth-Trunk contains two member ports, port1 and port2, 20 Flow-Agg objects are created that are all bound to the Eth-Trunk. Each Flow-Agg object may represent a user in the HQoS application. Wherein, voq [1-8] is allocated to the Member1 of the Flow-Agg1, and voq [9-17] is allocated to the Member 2. voq [1-8] and voq [9-17] are bound to port1 and port2, respectively. Traffic entering voq [1-8] eventually exits port1 and traffic entering voq [9-17] eventually exits port2.
In some embodiments, S200 comprises the steps of:
s210, the member port numbers are hashed in an array, and the member port corresponding to the Hash value serving as an array subscript is used as the member port to be determined by the Flow-Aggregation object according to the Hash value.
It can be understood that after the hash value is calculated by using the message characteristic as the input data of the hash algorithm, the hash value is used as the array index to obtain the array element of the corresponding index. After the Flow-Agg obtains the key value, a set of virtual queues (voq) can be obtained from the key value, voq is bound to the destination port, and thus the traffic outlet can be determined.
In order to ensure the uniformity of the hash, the members of the Trunk group with N members are preferably numbered from 0 to N-1, the numbers are uniformly placed in the array, the hash value corresponds to an array index, and the array element corresponding to the index is taken as a key to be transmitted to the Flow-Agg. This allows each member to appear in the array with substantially the same probability. For example, there are 2 member ports, numbered 0 and 1, respectively, evenly placed in the array. Then the first element in the array is 0, i.e., a [0] =0, the second element is 1, i.e., a [1] =1, and so on, a [2] =0, a [3] =1, a [4] =0. If the calculated hash value is 4, the array element a [4] =0 corresponding to the subscript 4 is transferred to the Flow-Agg as a key value.
In a specific embodiment, when calculating the hash value, firstly, an array containing 256 elements is allocated, all member port IDs of the Eth-Trunk are numbered from 0 to N-1, and N is the number of the member ports; and uniformly hashes the numbers into an array. The position of the array subscript 0 stores number 0, the position of subscript 1 stores number 1, the position of subscript N-1 stores number N-1, the position of subscript N stores number 0, and so on. The calculated hash value is in the range of 0-255, the hash value is used as an array subscript to read the number of the trunk member, the number range is 0 to N-1, and the value is used as a new key to be transmitted to the Flow-Agg.
In some embodiments, S200 comprises the steps of:
and S220, when the down member port exists, the down member port number in the array is replaced by other effective member port numbers in sequence.
In this embodiment, if a member port of the Eth-Trunk fails, the position of the member stored in the array is sequentially replaced by the number of the other member port in the Eth-Trunk. Therefore, the port fault time fast switching can be realized, and the Flow-Agg object does not need to be additionally regulated.
In one particular embodiment, as shown in FIG. 5, assume that the Eth-Trunk contains 4 member ports numbered 0, 1, 2, 3, respectively, with the numbers 0, 1, 2, 3 being uniformly hashed into an array. The calculated hash value is in the range of 0-255, the number of the trunk member is read according to the hash as an array subscript, and the number range is 0, 1, 2 and 3. If the third member port fails, the failed port corresponds to number 2, and the positions storing number 2 in the array will be replaced by numbers 0, 1 and 3 in sequence. The calculation of the hash value according to step 3.2 will not contain number 2, i.e. the failed port is skipped.
As shown in fig. 4, in some embodiments, when the Flow-Aggregation object determines that a member port in the Eth-Trunk interface is used as a forwarding port of the HQoS traffic according to the Hash value, the Hash value is first obtained according to the message characteristics of the traffic, where the Hash value corresponds to one member of the Flow-Agg. A hash value of 0 corresponds to a first member of the Flow-Agg, a hash value of 1 corresponds to a second member of the Flow-Agg, and so on; when the traffic enters voq corresponding to the member, according to the binding relation between voq and a member port of the Eth-Trunk, the traffic enters voq and finally exits from the member port bound by voq after HQoS scheduling.
As shown in fig. 3, in one particular embodiment, assuming that Flow-Agg1 obtains a hash value of 0, flow-Agg1 will select the first Member1. The flow enters voq [1-8] according to the QoS priority, and finally exits from voq [1-8] bound Eth-Trunk member port1 after HQoS scheduling.
In some embodiments, the method further comprises the step of:
s300, periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and S310, dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth.
It is understood that the HQoS is an entity that may be composed of many services, and the node may be understood as a service.
As shown in fig. 6 and 7, the method periodically obtains the instantaneous bandwidth of each speed limiting node (speed limiting service) in the inside of the HQoS under each member port of the Eth-trunk, calculates the residual bandwidth of each node, and dynamically adjusts the speed limiting value, and includes the following steps:
and S3.1, setting an initial speed limit value V0 of the HQoS speed limit node under each port of the Trunk group according to the configured initial weight.
And S3.2, acquiring the instantaneous speed V' of the HQoS speed limiting node under each port of the Trunk group.
And step S3.3, calculating the residual bandwidth value VL, VL=V0-V' of the HQoS speed limiting node under each port of the Trunk group.
And S3.4, sequencing the VL from small to large, sequentially checking the residual bandwidths VL, and if the proportion of the VL to the initial bandwidth V0 is smaller than a set threshold value, performing bandwidth adjustment, wherein the threshold value is set to be 1-50%, and the configuration is realized.
Step S3.5, bandwidth adjustment is firstly attempted to evenly output bandwidth from the node with the maximum VL to the speed-limiting node with insufficient VL proportion in step 4.3, the evenly output bandwidth value is set to be Vp, vp can be calculated according to the threshold value multiplied by V0 of the node in step 4.4, the obtained result is subtracted by the residual bandwidth of the node, and the bandwidth adjustment needs to meet the condition: and subtracting the leveling value from the residual bandwidth of the speed-limiting node, wherein the residual bandwidth of the node occupies the specific gravity of the node V0 to be larger than a set threshold value, otherwise, continuing to attempt to level out the bandwidth from the node with the VL number of times, and the like until all the nodes traverse or finish adjusting the bandwidth.
And step S3.6, if the bandwidth is adjusted, updating the residual bandwidth VL after the bandwidth adjustment, wherein the bandwidth value Vp is subtracted when the residual bandwidth of the node which homogenizes the bandwidth value is updated, and the bandwidth value Vp is increased when the VL' of the node which increases the bandwidth value is updated.
Step S3.7, checking the residual bandwidth of each node in sequence in the step S3.4, and if the bandwidth value is adjusted in the period of the node to be checked: adjusting the bandwidth to other nodes or vice versa, the remaining bandwidth check of the node is no longer performed in the present period.
In this embodiment, considering that there may be an accuracy error in the speed limit of the HQoS service on the Eth-Trunk, a method for dynamically adjusting the HQoS speed limit value according to the traffic size is provided.
As shown in fig. 6, in one particular embodiment, assume that the user's traffic is coming out of Eth-Trunk, which contains two ports, port1 and port2. Assuming that the bandwidth purchased by the user is 100M, each user has three services VOIP, IPTV, PC, the VOIP priority is highest, and the 40M is configured to guarantee the bandwidth. At this time, the cir of the user FQ8 should be 40M, assuming that the initial weight is 1:1, and 40M bandwidths are allocated to FQ8 under port1 and port2 according to 1:1, so that FQ8 under port1 and port2 are both configured with speed limit 20M, and the sum is 40M bandwidth. Assume that the instantaneous rate vj=19m of FQ8 for port 1. The instantaneous rate V' of FQ8 of Port 2=10m, the initial limit is 20M, at which point the residual bandwidth VL of FQ8 of Port1 is 20M-19 m=1m, and the residual bandwidth VL of FQ8 of Port2 is 20M-10 m=10m.
Continuing to assume that the threshold is set to 20%. At this time, the residual bandwidth specific gravity of FQ8 of port1 is 1M/20m×100% =5% <20%, and bandwidth adjustment is required. Bandwidth adjustment requires that 3M bandwidth be leveled to FQ8 of port1, 3M being equal to 20% (threshold) times the initial limit value 20M minus the remaining bandwidth 1M. Checking that the FQ8 residual bandwidth of port2 is 10M, subtracting 3M and then 7M, and that the initial bandwidth of FQ8 of port2 is 20M,7M/20M x 100% = 35% >20%, judging that bandwidth adjustment can be performed.
The residual bandwidth of FQ8 of port1 after adjustment needs to be updated to VL 4 m=1m+3m, and the residual bandwidth of FQ8 of port2 after adjustment needs to be updated to VL 7 m=10m-3M.
Checking of port2 FQ8 continues because port2 FQ8 is subject to excess bandwidth adjustment and no adjustment is performed during this period.
As shown in fig. 7, the embodiment of the present application further provides an apparatus for accessing an HQoS service, which includes:
an interface binding module for creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
and the Flow forwarding module is used for acquiring a corresponding Hash value according to the message characteristics of the HQoS service Flow and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS service Flow according to the Hash value.
In some embodiments, the interface binding module is further to:
distributing continuous virtual forwarding queues for members in the Flow-Aggregation object;
and establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
In some embodiments, the Flow forwarding module is further configured to Hash the member port number in an array, and use a member port corresponding to the Hash value as an array subscript as a member port to be determined by the Flow-Aggregation object according to the Hash value
In some embodiments, the traffic forwarding module is further configured to, when there is a down member port, sequentially replace the down member port number in the array with other valid member port numbers.
In some embodiments, further comprising:
a speed limit adjustment module for:
periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer-readable storage media, which may include computer-readable storage media (or non-transitory media) and communication media (or transitory media).
The foregoing is merely a specific implementation of the embodiment of the present application, but the protection scope of the embodiment of the present application is not limited thereto, and any person skilled in the art may easily think of various equivalent modifications or substitutions within the technical scope of the embodiment of the present application, and these modifications or substitutions should be covered in the protection scope of the embodiment of the present application. Therefore, the protection scope of the embodiments of the present application shall be subject to the protection scope of the claims.
Claims (8)
1. The HQoS business access method is characterized by comprising the following steps:
creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
acquiring a corresponding Hash value according to message characteristics of the HQoS traffic and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS traffic according to the Hash value;
the binding the Flow-Aggregation object with the Eth-Trunk interface comprises the following steps:
distributing a plurality of members for the Flow-Aggregation object, wherein the number of the members is the same as the number of the Eth-Trunk member ports;
allocating a continuous virtual forwarding queue for each member in the Flow-Aggregation object, wherein the virtual forwarding queue corresponds to the priority of the HQoS service Flow;
and establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
2. The HQoS service access method of claim 1, wherein said enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS service traffic according to the Hash value includes the steps of:
and hashing the member port number in an array, and taking the member port corresponding to the Hash value as an array subscript as the member port to be determined by the Flow-Aggregation object according to the Hash value.
3. The HQoS service access method of claim 2, wherein,
when the down member port exists, the down member port number in the array is replaced by other effective member port numbers in turn.
4. A HQoS service access method according to any one of claims 1 to 3, further comprising the step of:
periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth.
5. An HQoS service access device, comprising:
an interface binding module for creating a Flow-Aggregation object and binding the Flow-Aggregation object with an Eth-Trunk interface;
the Flow forwarding module is used for acquiring a corresponding Hash value according to the message characteristics of the HQoS service Flow and enabling the Flow-Aggregation object to determine a member port in the Eth-Trunk interface as a forwarding port of the HQoS service Flow according to the Hash value;
the interface binding module is further configured to:
distributing a plurality of members for the Flow-Aggregation object, wherein the number of the members is the same as the number of the Eth-Trunk member ports;
allocating a continuous virtual forwarding queue for each member in the Flow-Aggregation object, wherein the virtual forwarding queue corresponds to the priority of the HQoS service Flow;
and establishing a corresponding relation between the virtual forwarding queue and the member port of the Eth-Trunk interface, so that members in the Flow-Aggregation object are bound with the member port of the Eth-Trunk interface in a one-to-one correspondence manner.
6. The HQoS service access apparatus of claim 5, wherein said traffic forwarding module is further configured to:
and hashing the member port number in an array, and taking the member port corresponding to the Hash value as an array subscript as the member port to be determined by the Flow-Aggregation object according to the Hash value.
7. The HQoS service access apparatus of claim 6, wherein said traffic forwarding module is further configured to:
when the down member port exists, the down member port number in the array is replaced by other effective member port numbers in turn.
8. The HQoS service access apparatus of any one of claims 5 to 7, further comprising:
a speed limit adjustment module for:
periodically acquiring the instantaneous bandwidth of each node in the HQoS of a member port in the Eth-Trunk interface and calculating the residual bandwidth of each node;
and dynamically adjusting a speed limit value according to the instantaneous bandwidth and the residual bandwidth.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210599890.7A CN115022248B (en) | 2022-05-25 | 2022-05-25 | HQoS service access method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210599890.7A CN115022248B (en) | 2022-05-25 | 2022-05-25 | HQoS service access method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115022248A CN115022248A (en) | 2022-09-06 |
| CN115022248B true CN115022248B (en) | 2023-11-03 |
Family
ID=83070486
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210599890.7A Active CN115022248B (en) | 2022-05-25 | 2022-05-25 | HQoS service access method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115022248B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7936770B1 (en) * | 2005-03-08 | 2011-05-03 | Enterasys Networks, Inc. | Method and apparatus of virtual class of service and logical queue representation through network traffic distribution over multiple port interfaces |
| CN104852869A (en) * | 2014-02-14 | 2015-08-19 | 杭州华三通信技术有限公司 | Port aggregation method and device |
| WO2016101469A1 (en) * | 2014-12-25 | 2016-06-30 | 中兴通讯股份有限公司 | Method and apparatus for tunnel bandwidth reservation based on binding interface |
| CN109120494A (en) * | 2018-08-28 | 2019-01-01 | 无锡华云数据技术服务有限公司 | The method of physical machine is accessed in cloud computing system |
| CN113746675A (en) * | 2021-08-31 | 2021-12-03 | 烽火通信科技股份有限公司 | Method and system for realizing flexible Ethernet service scene by using HQoS (high quality QoS) |
| CN113965465A (en) * | 2020-06-29 | 2022-01-21 | 中兴通讯股份有限公司 | Bandwidth control method, device, equipment and storage medium |
-
2022
- 2022-05-25 CN CN202210599890.7A patent/CN115022248B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7936770B1 (en) * | 2005-03-08 | 2011-05-03 | Enterasys Networks, Inc. | Method and apparatus of virtual class of service and logical queue representation through network traffic distribution over multiple port interfaces |
| CN104852869A (en) * | 2014-02-14 | 2015-08-19 | 杭州华三通信技术有限公司 | Port aggregation method and device |
| WO2016101469A1 (en) * | 2014-12-25 | 2016-06-30 | 中兴通讯股份有限公司 | Method and apparatus for tunnel bandwidth reservation based on binding interface |
| CN109120494A (en) * | 2018-08-28 | 2019-01-01 | 无锡华云数据技术服务有限公司 | The method of physical machine is accessed in cloud computing system |
| CN113965465A (en) * | 2020-06-29 | 2022-01-21 | 中兴通讯股份有限公司 | Bandwidth control method, device, equipment and storage medium |
| CN113746675A (en) * | 2021-08-31 | 2021-12-03 | 烽火通信科技股份有限公司 | Method and system for realizing flexible Ethernet service scene by using HQoS (high quality QoS) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115022248A (en) | 2022-09-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11985060B2 (en) | Dragonfly routing with incomplete group connectivity | |
| US8254249B2 (en) | Session resilience prioritization queuing mechanism to minimize and eliminate packet loss | |
| US9270601B2 (en) | Path resolution for hierarchical load distribution | |
| US11824764B1 (en) | Auto load balancing | |
| RU2643666C2 (en) | Method and device to control virtual output queue authorization and also computer storage media | |
| US20080170499A1 (en) | Priority Service Protection | |
| CN111181873B (en) | Data transmission method, data transmission device, storage medium and electronic equipment | |
| CN110505158B (en) | Network bandwidth control method and device, electronic equipment and storage medium | |
| WO2021098730A1 (en) | Switching network congestion management method and apparatus, device, and storage medium | |
| WO2015149451A1 (en) | Network sharing method, apparatus and system, and computer storage medium | |
| CN113542145A (en) | Method for sharing Ethernet link aggregation group load and network equipment | |
| JP2017038226A (en) | Switch device and switch device control method | |
| JP2011254422A (en) | Communication control device and shaping device | |
| CN115022248B (en) | HQoS service access method and device | |
| CN109905331B (en) | Queue scheduling method and device, communication equipment and storage medium | |
| CN117459462A (en) | Network load balancing method and device | |
| CN113765796B (en) | Flow forwarding control method and device | |
| CN114401235B (en) | Method, system, medium, equipment and application for processing heavy load in queue management | |
| CN113890855A (en) | Message forwarding method, system, equipment and medium | |
| CN113973342A (en) | Flow control method and device, electronic equipment and storage medium | |
| CN106982169B (en) | Message forwarding method and device | |
| CN117938750B (en) | Method, device, equipment, storage medium and product for processing scheduling route information | |
| US20090154483A1 (en) | A 3-level queuing scheduler supporting flexible configuration and etherchannel | |
| CN114745342B (en) | Time-sharing multitasking scheduler and apparatus | |
| G∤ ąbowski et al. | Simulation studies of communication systems with mutual overflows and threshold mechanisms |
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 |