Method for sending message in heterogeneous rate link networking, and electronic device

Abstract

Provided in the embodiments of the present application are a method for sending a message in heterogeneous rate link networking, and an electronic device. The method comprises: determining a mapping relationship between the number of upstream egress time slots and the number of downstream egress time slots of a first message; when the mapping relationship is X-to-1, adding extension information to the first message, wherein the extension information is used for determining an egress queue of the first message; when the mapping relationship is 1-to-Y, on the basis of the extension information carried in the first message or a local policy, determining the egress queue of the first message, wherein X and Y are integers greater than 1; and adding the first message to an egress queue of the downstream egress time slots.

Description

Message sending method and electronic device under heterogeneous rate link networking

[0001] Cross-reference

[0002] The present application claims priority from the Chinese patent application No. 202410830516.2 filed on June 25, 2024, and entitled "Message sending method and electronic device under heterogeneous rate link networking", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] The present application relates to the technical field of network communication, and in particular to a message sending method and electronic device under heterogeneous rate link networking. BACKGROUND

[0004] In the deterministic time slot mapping scheduling mechanism, a port supports a physical cycle template, and each cycle template can be described by {time slot length T, time slot number N}. In the related art, a one-to-one mapping relationship is established between the cycle template of the upstream node outlet and the cycle template of the downstream node outlet, the time slot tag of the message is replaced with a new tag in the downstream node based on the time slot mapping relationship, and then the message is entered into a corresponding time slot queue for deterministic cycle scheduling and forwarding.

[0005] For the needs of heterogeneous rate deterministic networking, there are two control plane strategies in the related art. One strategy is to configure the cycle templates of each port to have equal time slot numbers and unequal time slot lengths, at this time the time slot mapping relationship is still one-to-one, and the forwarding plane scheduling mechanism can reuse the existing scheme process. However, due to differences in chip implementation or other reasons, the control plane may need to configure the cycle templates of each port to have equal time slot lengths and unequal time slot numbers, at this time the control plane may form a many-to-one (small rate to large rate) or one-to-many (large rate to small rate) mapping relationship when establishing the mapping relationship.

[0006] When the time slot mapping relationship is sent to the forwarding plane, the forwarding node needs to perform deterministic scheduling based on the many-to-one or one-to-many time slot mapping relationship. However, at present, there is no forwarding plane scheduling method suitable for this scenario, so it is not possible to accurately determine the outlet queue of the message, which can easily cause large end-to-end jitter. SUMMARY

[0007] The purpose of the embodiments of the present application is to provide a message sending method and electronic device under heterogeneous rate link networking.

[0008] In a first aspect, an embodiment of the present application provides a message sending method under a heterogeneous rate link network, comprising: determining a mapping relationship between a number of upstream egress time slots and a number of downstream egress time slots of a first message; in a case where the mapping relationship is X to 1, adding extension information in the first message, the extension information being used to determine an egress queue of the first message; in a case where the mapping relationship is 1 to Y, determining the egress queue of the first message based on the extension information carried by the first message or a local policy; wherein X and Y are integers greater than 1; and entering the first message into the egress queue of the downstream egress time slot.

[0009] In a second aspect, an embodiment of the present application provides an electronic device, comprising at least one processor; and a memory storing computer executable instructions, the executable instructions being executed to perform the steps of the method according to the first aspect when executed by the at least one processor.

[0010] In a third aspect, an embodiment of the present application provides a computer readable storage medium, the computer readable medium storing at least one computer program, the computer program being executed by a processor to implement the steps of the method according to the first aspect.

[0011] In a fourth aspect, an embodiment of the present application provides a computer program product, the computer program product comprising a computer program, the computer program being executed by a processor to implement the steps of the method according to the first aspect. BRIEF DESCRIPTION OF DRAWINGS

[0012] In order to more clearly illustrate the technical solutions of the embodiments of the present application or the prior art, the drawings needed in the embodiments or the prior art description will be briefly introduced as follows. Obviously, the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can also be obtained without creative labor.

[0013] FIG. 1 shows a flowchart of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0014] FIG. 2 shows a structure diagram of extension information of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0015] FIG. 3 shows a local policy diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0016] FIG. 4 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0017] Figure 5 shows a flow diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0018] Figure 6 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0019] Figure 7 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0020] Figure 8 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0021] Figure 9 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0022] Figure 10 shows a specific application diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0023] Figure 11 shows an extension information structure diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application;

[0024] Figure 12 is a hardware structure diagram of an electronic device for executing a message sending method under a heterogeneous rate link network according to an embodiment of the present application. DETAILED DESCRIPTION

[0025] In order to make the person skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, not all. Based on the embodiments in the present application, all other embodiments obtained by a person skilled in the art without creative labor should fall within the scope of protection of the present application.

[0026] Figure 1 shows a flow diagram of a message sending method under a heterogeneous rate link network according to an embodiment of the present application, which can be executed by an electronic device, such as an information processing network (IPN) device, a packet transport network (PTN) device, etc. In other words, the method can be executed by software or hardware installed in the electronic device. As shown in Figure 1, the method can include the following steps.

[0027] S102: Determine the mapping relationship between the number of upstream egress time slots and the number of downstream egress time slots of the first message.

[0028] In this embodiment, the forwarding node can determine the mapping relationship between the number of upstream egress time slots of the first message and the number of downstream egress time slots of the forwarding node based on the time slot mapping relationship table issued by the control plane.

[0029] The mapping relationship can be X to 1 (i.e., many to one) or one to Y (i.e., one to many), and X and Y are integers greater than 1. For example, the upstream A egress time slot and the downstream B egress time slot form a mapping relationship of {10, 11} -> 1, i.e., a mapping relationship of 2 to 1; for another example, the upstream B egress time slot -> the downstream C egress time slot forms a mapping relationship of 2 -> {4, 5}, i.e., a mapping relationship of 1 to 2, where {10, 11} and {4, 5} can be referred to as merged time slots or combined time slots.

[0030] In the case where the mapping relationship is X to 1, the first message is added with extension information for determining the egress queue of the first message; in the case where the mapping relationship is one to Y, the egress queue of the first message is determined based on the extension information carried by the first message or a local policy.

[0031] In one embodiment, the extension information is encapsulated in the first message by a stack data structure, so that in the first message processing flow, the last encapsulated extension information will be unpacked first and used for the forwarding flow of the first message.

[0032] In order to encapsulate the above-mentioned extension information, the reserved array position in the In-situ Operations Administration and Maintenance (IOAM) scheme can be used, and the stack top and stack bottom positions are maintained by two fields (stack top and stack bottom), respectively. The stack top can be used to push and pop the extension information, and the stack bottom can be used to judge whether the extension information is empty. As shown in FIG. 2, the specific encapsulation format of the extension information is not limited in the embodiments of the present application.

[0033] It can be understood that in the case where the above-mentioned mapping relationship is X to 1, the messages of multiple (i.e., X) time slot queues upstream can enter one time slot queue downstream, and the deterministic forwarding of the first message can be realized. In this embodiment, the extension information can be added in the first message for the subsequent forwarding process, and in the case where the mapping relationship is one to Y, the egress queue of the first message is determined to realize the deterministic forwarding of the first message.

[0034] In the case that the mapping relationship is one pair of Y, the message of the upstream one time slot queue cannot determine which one time slot queue (i.e. Y) of the downstream the message enters, the embodiment can determine the exit queue of the first message based on the extended information carried by the first message, or based on a local strategy (or local dispersion strategy), and can realize the deterministic forwarding of the first message.

[0035] In one embodiment, the local strategy includes at least one of the following: local strategy one: determining the exit queue according to whether the queue is full, for example, if the previous queue is full (for example, reaches the maximum cache configuration), then the next queue is selected; local strategy two: determining the exit queue according to the current load level of the queue, for example, preferentially selecting the queue with the smallest load level, etc. As shown in FIG. 3, the upstream A exit time slot -> downstream B exit time slot forms a mapping relationship of 3->{0, 1}, i.e. a mapping relationship of 1 to 2, and the load level of the queue 1 of the B node is lower than the load level of the queue 0 (or the cache depth is smaller than the cache depth of the queue 0), so the current first message enters the queue 1.

[0036] S106: entering the first message into the exit queue of the downstream exit time slot.

[0037] The message sending method under the heterogeneous rate link networking provided by the embodiment of the application adds extended information in the message for the many-to-one time slot mapping relationship, the extended information is used for subsequent determination of the exit queue of the message, and then the deterministic forwarding of the message is realized, the problem of large end-to-end jitter is avoided, and the performance of the communication system is improved; for the one-to-many time slot mapping relationship, the message is forwarded according to the extended information carried by the message or according to the local strategy, the deterministic forwarding of the message is realized, the problem of large end-to-end jitter is avoided, and the performance of the communication system is improved.

[0038] The message sending method under the heterogeneous rate link networking provided by the embodiment of the application can determine which exit queue the message enters at the current node based on the many-to-one or one-to-many time slot mapping relationship issued by the control plane, in combination with the extended information or the local strategy, so that the messages with the same time slot at the exit of the source node finally enter the same time slot at the exit of the destination node, thereby achieving the deterministic forwarding of the service message.

[0039] The embodiment of the application can be applied to routers or switches and corresponding configuration units. The schemes, standards and drafts of related technologies mainly consider the deterministic scheduling mechanism of the forwarding plane based on the one-to-one time slot mapping relationship under the same rate networking. The embodiment of the application mainly considers the heterogeneous rate link situation that may be involved in the actual networking scenario, and proposes a related scheme, which is a forward-looking technology and has great commercial value.

[0040] The extended information mentioned in various embodiments of the present application can include at least one of the following: the number L of the upstream egress time slot; the ratio X of the number of upstream egress time slots to the number of downstream egress time slots; the position I of each upstream egress time slot in the merged time slot, and L, X and I are non-negative integers.

[0041] In one embodiment, I is obtained after the remainder operation on L and X, and I ranges from 0 to X-1.

[0042] This embodiment can extend the information carried by the first packet, and maintain the time slot mapping relationship of many-to-one (assuming X-to-one) at the downstream node in the case of small rate of the upstream port to large rate of the downstream port. If X>1, when the packet is sent from the downstream node, in addition to carrying the upstream egress time slot number L, the packet can also carry the two upstream information {X, I} in the packet extension.

[0043] This embodiment can encapsulate X in the first packet, and if the upstream node is A, it is denoted as Xa, if the upstream node is B, it is denoted as Xb, and so on.

[0044] This embodiment can carry the position I of the upstream egress time slot in the merged time slot in the first packet, and the calculation method can be I=L% X, and I ranges from 0 to (X-1), wherein "%" represents the remainder operation. If the upstream node is A, it is denoted as Ia, and the egress time slot number is denoted as La, and so on.

[0045] As shown in FIG. 4, the mapping relationship formed by the upstream A node to the downstream B node is {10, 11} -> 1, and when the packet is sent from the queue of time slot 1 of the B node, the packet carrying the time slot label La=10 needs to be extended and encapsulated with {Xa=2, Ia=10%2=0}, and the packet carrying the time slot label La=11 needs to be extended and encapsulated with {Xa=2, Ia=11%2=1}.

[0046] Further, when the packet reaches the C node, since the upstream B node to the downstream C node is also a many-to-one mapping relationship, when the packet is sent from the C node, it also needs to encapsulate the above two information, that is, the packet will carry two layers of extended information at this time: {Xb, Ib}, {Xa, Ia}. For the case of continuous many-to-one mapping relationship, it is similar.

[0047] For the case of large rate of the upstream port to small rate of the downstream port, the downstream node maintains a one-to-many (assuming one-to-Y) time slot mapping relationship, and for the case of Y>1, the downstream node needs to disperse the packets belonging to the same time slot from the upstream into multiple egress queues. First, the egress merged time slot is found according to the time slot number L, which is denoted as {P0, P1..., P Y-1}, wherein the time slot position is 0~(Y-1), and each time slot corresponds to an egress queue.

[0048] The queue into which the packet enters can be indicated by the extension information carried above. Assuming that the extension information stack is not empty, the top extension information is first popped out and recorded as {X, I}. At this time, the determination of the exit queue of the first packet based on the extension information carried by the first packet includes the following steps.

[0049] Step 1: Determine the size relationship between X and Y.

[0050] Step 2-1: If X = Y, it is determined that the first packet carrying I corresponds to the queue of the Ith time slot of the downstream exit time slot, that is, the first packet carrying I enters the P queue in {P0, P1..., P Y-1}。 I Step 2-1: If X = Y, it is determined that the first packet carrying I corresponds to the queue of the Ith time slot of the downstream exit time slot, that is, the first packet carrying I enters the P queue in {P0, P1..., P

[0051] Step 2-2: If X < Y, continue to search for the extension information carried by the first packet, and determine the exit queue of the first packet based on the search result; wherein the first packet carries one or more extension information, and multiple extension information is encapsulated in the first packet through a stack data structure.

[0052] In one embodiment, the determination of the exit queue of the first packet based on the search result includes: if the search result is empty, it is determined that the range of the exit queue of the first packet carrying I corresponds to the downstream exit time slot is P I*Y / X ~ P (I+1)*Y / X-1 , wherein the exit queue of the downstream exit time slot is {P0, P1,..., P Y-1}; or if the extension information {X`, I`} is found, the two extension information {X`, I`} and {X, I} are merged to obtain new extension information, and the step of determining the size relationship between X and Y is jumped to step 1, and the meanings of X` and I` can be referred to the explanations of X and I above, and {X`, I`} and {X, I} are used to distinguish two different extension information.

[0053] In one embodiment, the merging of the two extension information to obtain new extension information includes: obtaining new extension information based on the following formula.

[0054] Wherein, the continuously searched extension information is {X`, I`}.

[0055] Step 2-3: If X > Y, a new {X, I} and an exit time slot number y of the first packet are calculated based on the extension information, and the new {X, I} is re-encapsulated into the first packet.

[0056] In one embodiment, the calculating the new {X, I} and the exit time slot number y of the first packet based on the extended information comprises: calculating the new {X, I} and the exit time slot number y of the first packet based on the following formula.

[0057] wherein " / " represents the integer operation, and ①, ②, ③ represent the order relationship of the three sub-formulas in the formula 2.

[0058] Taking X=10, I range: 0~9, Y=2 (the de-queue numbers are 5 and 6 respectively) as an example, according to the formula 2, the new X=X / Y=5; the de-queue number: y=I / X=I / 5, then I range 0~4 enters the queue 5 corresponding to the time slot position number 0, and I range 5~9 enters the queue 6 corresponding to the time slot position number 1; the new I=I-y*X=I-y*5, then I range 0~4 remains unchanged, and I range 5~9 is new I=I-5.

[0059] The above processing flow is suitable for some symmetric networking scenarios, and for the one-to-many mapping relationship between the source node and the downstream node, the de-queue range of the current packet is as follows. Y-1

[0060] If {X, I} is empty, then the optional de-queue range of the packet is: I->P0~P Y-1 .

[0061] If {X, I} is not empty, then the optional de-queue range of the packet carrying the I label is: I->P I*Y / X ~P (I+1)*Y / X-1 formula 3

[0062] At this time, due to the lack of further indication information, the packet needs to use some predetermined local strategy to determine which de-queue the packet enters, and there are many possible strategies, for example, local strategy one can select the next queue if the front queue is full (for example, reaches the maximum cache configuration); local strategy two can select the queue with lighter load (the same load level is selected according to the number) according to the current load level of the queue. FIG. 3 is a case where the source node A is one-to-many to the node B, at this time, the stack information is empty at the node B, and the de-queue of the packet is determined according to the local strategy two.

[0063] Considering the above two cases comprehensively, if the downstream node maintains a one-to-many (assuming one-to-Y) mapping relationship, and the de-queue is P0~P Y-1 , then the total packet processing flow at the downstream node is as follows. If the node maintains a one-to-one (a special case of one-to-many) mapping relationship, then it is processed according to the existing forwarding plane flow. As shown in FIG. 5, at least the following steps are included.​

[0064] Step 1: The downstream node receives the message, which carries the time slot label L of the upstream, looks up the time slot mapping table, determines the one-to-one mapping relationship of Y, and judges whether Y is equal to 1.

[0065] Step 2: If it is a one-to-one mapping relationship, that is, Y = 1, the message is processed according to the existing forwarding process, and step 11 is transferred; if Y is greater than 1, step 3 is executed.

[0066] Step 3: Look up the top information and judge whether it is empty.

[0067] Step 4: If the top information is empty, the message is entered and exited according to the above local strategy, and step 11 is transferred.

[0068] Step 5: If the top information is not empty, pop the top information as {X, I}, and judge the size relationship between X and Y, and jump to step 6, 7 or 10 based on the judgment result.

[0069] Step 6: If X = Y, the message is entered into the time slot P I Corresponding queue, step 11 is transferred.

[0070] Step 7: If X < Y, continue to look up the top information, and judge whether the top information of the continued lookup is empty, and jump to step 8 or 9 based on the judgment result.

[0071] Step 8: If the top information is empty, determine the queue range corresponding to the Ith message according to formula 3, enter and exit the queue according to the above local strategy, and jump to step 11.

[0072] Step 9: If the top information is not empty, pop the top information as {X`, I`}, then calculate the new {X, I} according to formula 1, and jump to the step of judging the size relationship between X and Y in step 5.

[0073] Step 10: If X > Y, calculate the new {X, I} and the time slot position number y and the exit queue Py of the message according to formula 2, enter and exit the queue, repackage the new {X, I} into the message, and jump to step 11.

[0074] Step 11: The message is scheduled by the exit queue, and the process ends.

[0075] The message sending method under the heterogeneous rate link networking provided by the embodiment of the application at least includes the following contents: 1. For the many-to-one time slot mapping relationship, the message encapsulation is extended to carry the time slot position indication information; 2. The content of the extended information, the carrying mode of the extended information and the organization form of the extended information are given; 3. For the one-to-many time slot mapping relationship, the message forwarding is carried out according to the message carrying the extended information, and the forwarding flow is given; 4. For the one-to-many time slot mapping relationship lacking the extended information, the supplementary local strategy is proposed.

[0076] To make the message sending method under the heterogeneous rate link networking provided by the embodiment of the application clear, the following will be described in combination with several specific embodiments.

[0077] Embodiment one

[0078] The embodiment illustrates a message forwarding flow when the many-to-one and one-to-many mapping relationships exist in the symmetrical networking, as shown in FIG. 6, the mapping relationship of A node to B node exit is 2-to-1, the mapping relationship of B node to C node exit is 4-to-1, the mapping relationship of C node to D node exit is 1-to-4, and the mapping relationship of D node to E node exit is 1-to-2. The specific time slot mapping relationship is shown above each node.

[0079] When the B node processes the message carrying the label La of the A node, the time slot mapping relationship table is searched, it is found that the mapping relationship is 2-to-1, and when the message is sent out, the {Xa=2, Ia} information is encapsulated into the message, wherein Ia is the position of the label La in the merged time slot, for the merged time slot {4, 5}, when La=4, Ia=0, when La=5, Ia=1, and so on.

[0080] When the C node processes the message carrying the label Lb of the B node, the time slot mapping relationship table is searched, it is found that the mapping relationship is 4-to-1, and when the message is sent out, the {Xb=4, Ib} information is encapsulated into the message, wherein Ib is the position of the label Lb in the merged time slot, for the merged time slot {0, 1, 2, 3}, when Lb=0, Ib=0, when Lb=1, Ib=1, when Lb=2, Ib=2, and when Lb=3, Ib=3.

[0081] When the D node processes the message carrying the label Lc of the C node, the time slot mapping relationship table is searched, it is found that the mapping relationship is 1-to-4, and the extended indication information carried by the message is obtained {Xb=4, Ib}, since Xb=4, the message is enqueued according to Ib, for the message mapping relationship of Lc=1, it is 1->{8, 9, 10, 11}, when Ib=0, the message is enqueued in queue 8, when Ib=1, the message is enqueued in queue 9, and so on.

[0082] When the E-node processes the packet with label Ld carried by the D-node, the time slot mapping relation table is looked up, and it is found that it is a 1-to-2 mapping relation. Then the extended indication information carried by the packet is looked up, and {Xa=2, Ia} is obtained. Since Xa=2, the packet is enqueued according to Ia. The mapping relation of the packet with Ld=9 is 9->{6, 7}, and thus the packet is enqueued into queue 6 when Ia=0 and enqueued into queue 7 when Ia=1. The processing procedure of the packet carrying other label values is similar and thus is not described herein.

[0083] Embodiment Two

[0084] This embodiment illustrates a packet forwarding procedure in a symmetric network with one-to-many and many-to-one mapping relations. As shown in FIG. 7, there is a 1-to-4 mapping relation at the A-node to B-node egress, a 1-to-2 mapping relation at the B-node to C-node egress, a 2-to-1 mapping relation at the C-node to D-node egress, and a 4-to-1 mapping relation at the D-node to E-node egress. The specific time slot mapping relations are shown above each node, and it is assumed that the current buffers of each dequeue queue are empty.

[0085] When the B-node processes the packet with label La carried by the A-node, the time slot mapping relation table is looked up, and it is found that it is a 1-to-4 mapping relation. Then the top extended information is tried to be looked up, and it is found that the information is empty. Thus, it is assumed that the local strategy one is used to determine the dequeue queue of the packet. The mapping relation of the packet with a=1 is 1->{4, 5, 6, 7}, and thus the packet is enqueued into queue 4 since the current queue 4 is empty.

[0086] When the C-node processes the packet with label Lb carried by the B-node, the time slot mapping relation table is looked up, and it is found that it is a 1-to-2 mapping relation. Then the top extended information is tried to be looked up, and it is found that the information is empty. Thus, it is assumed that the local strategy two is used to determine the dequeue queue of the packet. The mapping relation of the packet with Lb=4 is 4->{2, 3}, and thus the packet is enqueued into queue 2 since the current queues 2 and 3 are empty.

[0087] The processing procedures of the D-node processing the packet with label Lc carried by the C-node and the E-node receiving the packet with label Ld carried by the D-node are not described herein.

[0088] Embodiment Three

[0089] This embodiment illustrates a packet processing procedure in an asymmetric network with many-to-one and one-to-many mapping relations. There is a 4-to-1 mapping relation at the A-node to B-node egress, a 2-to-1 mapping relation at the B-node to C-node egress, and a 1-to-8 mapping relation at the C-node to D-node egress, as shown in FIG. 8.

[0090] When the B node processes the message carrying the label La from the A node, the time slot mapping relationship table is looked up, and it is found that the mapping relationship is 4 to 1. When the message is sent out, the information {Xa=4, Ia} is encapsulated into the message, wherein Ia is the position of the label La in the merged time slot. For the merged time slot {4, 5, 6, 7}, when La=4, Ia=0; when La=5, Ia=1; when La=6, Ia=2; and when La=7, Ia=3.

[0091] When the C node processes the message carrying the label Lb from the B node, the time slot mapping relationship table is looked up, and it is found that the mapping relationship is 2 to 1. When the message is sent out, the information {Xb=2, Ib} is encapsulated into the message, wherein Ib is the position of the label Lb in the merged time slot. For the merged time slot {2, 3}, when Lb=2, Ib=0; and when Lb=3, Ib=1.

[0092] When the D node processes the message carrying the label Lc from the C node, the time slot mapping relationship table is looked up, and it is found that the mapping relationship is 1 to 8. The extended indication information carried by the message is looked up, and {Xb=2, Ib} is obtained. Since Xb<8, the extended indication information at the top of the stack is looked up, and {Xa=4, Ia} is obtained. The value of I of the message is updated according to Formula 1, that is, Ib=Ib*Xb+Ia, Xb=Xb*Xa=8. For example, for the message carrying Ia=1 and Ib=1, the new Ib=4+1=5.

[0093] Since Xb=8 at this time, the message is enqueued according to the new Ib. The mapping relationship of the message carrying Lc=0 is 0->{8, 9, 10, 11, 12, 13, 14, 15}. When Ib=5, the message is enqueued to queue 12. The new Ib values of other messages and the enqueuing process are the same.

[0094] Embodiment Four

[0095] This embodiment illustrates a message processing process in the case of asymmetric networking with multiple-to-one and one-to-many mapping relationships. The mapping relationship from the A node to the B node exit is 10 to 1, the mapping relationship from the B node to the C node exit is 1 to 2, and the mapping relationship from the C node to the D node exit is 1 to 5, as shown in FIG. 9.

[0096] When the B node processes the message carrying the label La from the A node, the time slot mapping relationship table is looked up, and it is found that the mapping relationship is 10 to 1. When the message is sent out, the information {Xa=10, Ia} is encapsulated into the message, wherein Ia is the position of the label La in the merged time slot. For the merged time slot {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, when La=0, Ia=0; when La=1, Ia=1; when La=2, Ia=2; when La=3, Ia=3; and so on.

[0097] When the C node processes the message carrying label Lb, the time slot mapping relation table is looked up, and it is found that it is a 1-to-2 mapping relation. The extended indication information carried by the message is looked up to obtain {Xb=10, Ib}. Since Xb>2, the queue and the new Xb and Ib values are calculated according to formula 2. If Ib is within the range of 0 to 4, y=0; if Ib is within the range of 5 to 9, y=1. If Lb=1, according to the mapping relation 1->{2, 3}, the message with 0≤Ib≤4 is entered into queue 2, and the message with 5≤Ib≤9 is entered into queue 3.

[0098] Xb=Xb / 2=5, for example, I=I-(I / X)*X. The Ib value of the message with 0≤Ib≤4 remains unchanged, and the Ib value of the message with 5≤Ib≤9 is reduced by 5. The new {Xb=5, Ib} is re-encapsulated into the message.

[0099] When the D node processes the message carrying label Lc, the time slot mapping relation table is looked up, and it is found that it is a 1-to-5 mapping relation. The extended indication information carried by the message is looked up to obtain {Xb=5, Ib}. Since Xb=5, the message is directly entered into the corresponding queue according to the Ib value. For example, for the message with Lc=2, the time slot mapping relation is 2->{5, 6, 7, 8, 9}. When Ib=0, the message is entered into queue 5; when Ib=1, the message is entered into queue 6; and so on.

[0100] Embodiment Five

[0101] This embodiment illustrates a message processing flow in the case of asymmetric networking with multiple-to-one and one-to-many mapping relations. There is a 2-to-1 mapping relation at the A node to B node exit, a 1-to-4 mapping relation at the B node to C node exit, and a 2-to-1 mapping relation at the C node to D node exit, as shown in FIG. 10. It is assumed that the queues are currently empty.

[0102] When the B node processes the message carrying label La, the time slot mapping relation table is looked up, and it is found that it is a 2-to-1 mapping relation. When the message is sent out, {Xa=2, Ia} information is encapsulated into the message. Ia is the position of the label La in the merged time slot. For the merged time slot {10, 11}, when La=10, Ia=0; and when La=11, Ia=1.

[0103] When the C-node processes the message carrying label Lb, the time slot mapping table is looked up, and it is found that it is a 1-to-4 mapping relationship. The extended indication information carried by the message is looked up, and it is found that {Xa=2, Ia} is obtained. Since Xa<4, the extended indication information carried by the stack is looked up, and it is found that the stack is empty. For Lb=0, the time slot mapping relationship is 0->{4, 5, 6, 7}. At this time, Ia corresponding out time slot range is determined according to formula 3. Wherein Ia=0 corresponds to the out time slot range {4, 5}, and Ia=1 corresponds to the out time slot range {6, 7}. At this time, the local dispersion strategy is used to determine the out queue of the message. Since the current queue 4 is empty, the message carrying Ia=0 enters the out queue 4, and the message carrying Ia=1 enters the out queue 6.

[0104] The processing flow of the D-node when receiving the message of the C-node has been described above, and will not be repeated here.

[0105] Embodiment six

[0106] This embodiment illustrates the encapsulation format of the extended information, which is extended based on IPv6 Hop-by-Hop options header. The Option is carried under the Hop-by-hop header, and the type and encapsulation format of the option are defined by option-type. In order to indicate the extended information, the top and bottom positions of the stack are indicated by a fixed field in the Option header, and the length of the total Option is indicated by length. The slot position information (Slot position indication) and the number of sub-slots in the merged time slot (Sub-slot number) are inserted into the Option Data in an incremental manner, as shown in FIG. 11.

[0107] FIG. 12 shows a hardware structure schematic diagram of an electronic device provided by an embodiment of the present application. Referring to the figure, at the hardware level, the electronic device includes a processor, and can also include an internal bus, a network interface, and a memory. The memory can include a memory such as a random-access memory (RAM), and can also include a non-volatile memory such as at least one disk memory. Of course, the electronic device can also include other hardware required by other services.

[0108] The processor, the network interface and the memory can be connected with each other through an internal bus, which can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus or the like. The bus can be divided into an address bus, a data bus, a control bus and the like. For the convenience of representation, only one bidirectional arrow is used in the figure, but it does not mean that there is only one bus or only one type of bus.

[0109] The memory is configured to store a program. Specifically, the program can include program code including computer operation instructions. The memory can include an internal memory and a non-volatile memory, and provide instructions and data for the processor.

[0110] The processor reads the corresponding computer program from the non-volatile memory into the internal memory and then runs, and forms the device for positioning a target user at a logical level. The processor executes the program stored in the memory, and specifically is configured to execute the method disclosed in the embodiments shown in FIGS. 1-11 and realize the functions and beneficial effects of each method described in the foregoing method embodiments, which will not be described herein again.

[0111] The method disclosed in the embodiments of the present application shown in FIG. 1-11 can be applied to a processor or implemented by the processor. The processor can be an integrated circuit chip having a processing capability of signals. In the implementation process, each step of the method can be completed by integrated logic circuits of hardware in the processor or instructions in the form of software. The processor can be a general processor, including a central processing unit (CPU), a network processor (NP), etc.; or a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. Each method, step and logic block diagram disclosed in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware code processor for execution, or a combination of hardware and software modules in the code processor for execution. The software module can be located in a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register or other mature storage medium in the art. The storage medium is located in a memory, and the processor reads information in the memory and combines the hardware to complete the steps of the method.

[0112] The electronic device can also perform any of the embodiments described in the foregoing method embodiments and achieve the functions and advantages of any of the embodiments described in the foregoing method embodiments, which will not be repeated here.

[0113] Of course, in addition to the software implementation, the electronic device of the present application does not exclude other implementation manners, such as logic devices or a combination of software and hardware, etc. That is, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or a logic device.

[0114] The embodiments of the present application also propose a computer readable storage medium, which stores at least one computer program, and the computer program is executed by a processor to implement the method disclosed in the embodiments shown in FIG. 1-11, and achieve the functions and advantages of each method described in the foregoing embodiments, which will not be repeated here.

[0115] The computer readable storage medium can include, but is not limited to, a magnetic storage device (e.g., hard disk, floppy disk, or magnetic tape), an optical storage device (e.g., compact disk (CD), digital versatile disk (DVD), etc.), a smart card, and a flash memory device (e.g., EPROM, card, stick, or key drive).

[0116] The embodiments of the present application further provide a computer program product, which comprises a computer program stored in a non-transitory computer readable storage medium, and the computer program comprises program instructions, and when the program instructions are executed by a computer, the following processes are implemented: the method disclosed in the embodiments shown in FIGS. 1-11, and the functions and beneficial effects of each method described in the foregoing method embodiments, which are not repeated here.

[0117] In summary, the above only describes the preferred embodiments of the present application, and is not used to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

[0118] The system, device, module or unit disclosed in the above embodiments can be specifically implemented by a computer chip or entity, or by a product with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0119] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can be implemented by any method or technology to store information. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible by a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0120] It should also be noted that the terms "comprising", "containing", or any other variant thereof are intended to cover non-exclusive inclusions, so that a process, method, article or apparatus that includes a list of elements does not only include those elements, but also includes other elements not explicitly listed, or inherent to such a process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0121] Each of the embodiments in the specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other. Each embodiment focuses on the difference from other embodiments. In particular, for system embodiments, since they are basically similar to method embodiments, the description is relatively simple, and the relevant parts can be referred to the part of the method embodiment.

Claims

1. A method for sending packets in a heterogeneous rate link network, comprising: Determine the mapping relationship between the number of upstream exit time slots and the number of downstream exit time slots for the first message; When the mapping relationship is X to 1, extended information is added to the first message, and the extended information is used to determine the egress queue of the first message; when the mapping relationship is a pair of Y, the egress queue of the first message is determined based on the extended information or local policy carried by the first message; wherein, X and Y are integers greater than 1. The first message is added to the export queue of the downstream export time slot.

2. The method according to claim 1, wherein, The extended information includes at least one of the following: the upstream exit time slot number L; the ratio X of the number of upstream exit time slots to the number of downstream exit time slots; the position I of each upstream exit time slot in the merged time slot, where L, X, and I are non-negative integers; And / or, The local strategy includes at least one of the following: determining the exit queue based on whether the queue is full; determining the exit queue based on the current load level of the queue.

3. The method according to claim 2, wherein, I is obtained by taking the remainder of L and X, and the value of I ranges from 0 to X-1.

4. The method according to claim 2 or 3, wherein, The step of determining the egress queue of the first message based on the extended information carried in the first message includes: Determine the relationship between X and Y; If X = Y, then determine the queue of the I-th time slot corresponding to the first message carrying I in the downstream exit time slot; or, If X < Y, then continue searching for the extended information carried in the first message, and determine the exit queue of the first message based on the search result; wherein, the first message carries one or more of the extended information, and multiple pieces of the extended information are encapsulated in the first message using a stack data structure; or, If X > Y, then calculate the new {X, I} and the exit timeslot number y of the first message based on the extended information, and re-encapsulate the new {X, I} into the first message.

5. The method according to claim 4, wherein, The step of determining the exit queue of the first message based on the search results includes: If the search result is empty, then the range of the exit queue of the downstream exit time slot corresponding to the first message carrying I is determined to be P. I*Y / X ~P (I+1)*Y / X-1 Wherein, the exit queue of the downstream exit time slot is {P0, P1, ..., P...} Y-1 };or, If the extended information is found, the two extended information pieces are merged to obtain new extended information, and the process jumps to the step of determining the size relationship between X and Y.

6. The method according to claim 5, wherein, The step of merging the two sets of extended information to obtain new extended information includes obtaining new extended information based on the following formula; The extended information found further is {X`, I`}.

7. The method according to claim 4, wherein, The calculation of the new {X, I} and the egress timeslot number y of the first message based on the extended information includes: calculating the new {X, I} and the egress timeslot number y of the first message based on the following formulas: X = X / Y ① y = I / X ② I = Iy*X ③ Here, " / " represents the rounding operation.

8. The method according to any one of claims 1 to 3, wherein, The extended information is encapsulated in the first message using a stack data structure.

9. An electronic device, comprising: At least one processor; as well as A memory storing computer-executable instructions, which, when executed, use the at least one processor to perform the message transmission method under heterogeneous rate link networking as described in any one of claims 1-8.

10. A computer-readable medium storing at least one computer program that, when executed by a processor, implements the message transmission method under heterogeneous rate link networking as described in any one of claims 1-8.

Images