Bandwidth adjusting method and device
Patent Information
- Application Number
- CN202380076844.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2022-11-22
- Filing Date
- 2023-11-20
- Publication Date
- 2025-06-17
- Estimated Expiration
- 2043-11-20
AI Technical Summary
When the existing optical transport network (OTN) transmits service signals, it is difficult to quickly adjust the bandwidth when the OSU rate increases. The existing solution of adjusting one byte every 125us does not support rapid bandwidth adjustment.
By introducing the first indication and the second indication into the data unit frame, the bandwidth change position of the data unit frame is determined according to the bandwidth adjustment position, and mapped to different service containers of the OTN frame, thereby realizing bandwidth adjustment.
The bandwidth adjustment rate is improved, and it can be adjusted from the first bandwidth to the second bandwidth in one operation, avoiding FIFO overflow or read empty anomalies, and improving the cache management efficiency of network nodes.
Smart Images

Figure CN120167112A_ABST
Abstract
Description
Bandwidth adjustment method and device
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority to the Chinese patent application filed with the Intellectual Property Office of the People's Republic of China on November 22, 2022, with application number 202211469162.0 and invention name "A Bandwidth Adjustment Method and Device", the entire contents of which are incorporated by reference into this application. Technical Field
[0003] The present application relates to the field of optical communication technology, and in particular to a bandwidth adjustment method and device. Background Art
[0004] Due to its high bandwidth, large capacity, high reliability, and low latency, the Optical Transport Network (OTN) has become a mainstream technology for transport networks. OTN is widely used in backbone, metro core, and aggregation networks, and is currently expanding into access networks. OTN currently offers high-bandwidth transmission capabilities, such as n*1.25Gbps and n*5Gbps, as well as lower-bandwidth transmission capabilities, such as using optical service units (OSUs). Service signals are mapped into OSUs, which are then mapped into the payload area of flexible optical data units (ODUflex) for transmission.
[0005] In some scenarios, the OSU rate may increase due to business needs. Currently, the bandwidth is adjusted by one byte every 125 μs, which does not support rapid bandwidth adjustment.
[0006] Summary of the Invention
[0007] The embodiments of the present application provide a bandwidth adjustment method and apparatus for increasing the bandwidth adjustment rate.
[0008] In a first aspect, an embodiment of the present application provides a bandwidth adjustment method, which is applied to a first network node. The bandwidth adjustment method includes: obtaining service data. Mapping the service data to multiple data unit frames, wherein the payload areas of the multiple data unit frames are used to carry the service data. When it is determined that the bandwidth of the service data needs to be adjusted, setting a first indication carried in a first data unit frame of the multiple data unit frames to a set value. When the first indication is a set value, it indicates a bandwidth adjustment position of the service data in the multiple data unit frames. Based on the bandwidth adjustment position, a first position at which the bandwidth of the multiple data unit frames on the first network node changes from a first bandwidth to a second bandwidth is determined. Mapping the portion of the multiple data unit frames located before the first position to a first service container of an optical transport network (OTN) frame, and mapping the portion of the multiple data unit frames located after the first position to a second service container of the OTN frame. Sending the OTN frame.
[0009] In an embodiment of the present application, the size of the service container is adjusted following the bandwidth (or rate) of the OSU. When the source node determines that the bandwidth of the service data needs to be adjusted, it updates the value of the first indication in the data unit frame to indicate the bandwidth adjustment position, and then can determine the actual starting position of the bandwidth change based on the bandwidth adjustment position, and map the data before the actual starting position to the service container before adjustment, and the data after the actual starting position to the service container before adjustment. Compared with the existing method of adjusting one byte every 125us, the present application only needs one time to achieve adjustment from the first bandwidth to the second bandwidth, thereby improving the bandwidth adjustment rate.
[0010] In one possible design, the overhead area of the first data unit frame also carries a second indication. The second indication is used to indicate the number of network nodes passed by the multiple data unit frames. The passed network nodes are network nodes for which the mapping of the multiple data unit frames to OTN frames is completed at the service layer.
[0011] In one possible design, the first position at which the bandwidth of the multiple data unit frames on the first network node is transformed from the first bandwidth to the second bandwidth is determined according to the bandwidth adjustment position, including: adjusting the value of the second indication in the first data unit frame to accumulate 1, and determining the first position according to the bandwidth adjustment position and the adjusted value of the second indication.
[0012] In the above design, the actual adjustment position of the bandwidth is determined according to the second indication, so that the FIFO waterline for caching OSUs of the current node can be adjusted to prevent abnormalities caused by FIFO overflow or FIFO empty reading.
[0013] In a possible design, the first position satisfies: W=y+HA*n;
[0014] Wherein, W represents the first position, y represents the bandwidth adjustment position, HA represents the second indication, and n is a preset value.
[0015] In one possible design, n is related to the bandwidth difference between the first bandwidth and the second bandwidth. n can be the number of time slots corresponding to the bandwidth difference.
[0016] In one possible design, mapping a portion of the multiple data unit frames located before a first position to a first service container of an OTN frame, and mapping a portion of the multiple data unit frames located after the first position to a second service container of the OTN frame includes:
[0017] A demarcation point between a first service container and a second service container in the OTN frame is determined based on the first position, the first bandwidth, and the second bandwidth. Based on the demarcation point, a portion of the multiple data unit frames located before the first position is mapped to the first service container of the OTN frame, and a portion of the multiple data unit frames located after the first position is mapped to the second service container of the OTN frame.
[0018] In one possible design, the demarcation point satisfies:
[0019] in
[0020] or,
[0021] in
[0022] Wherein, Y represents the demarcation point, y represents the bandwidth adjustment position, X represents the mapping position of the first indication in the first data unit frame to the OTN frame, x represents the position of the first indication in the multiple data unit frames, W represents the first position, P represents the size of the first service container or the size of the second service container, and C m (M) represents the number of data blocks in the service container of the OTN frame mapped to the multiple data unit frames before bandwidth adjustment, and celling() represents rounding up.
[0023] The above design provides an effective way to map the possible actual bandwidth adjustment location to the actual OTN location.
[0024] In one possible design, the overhead area of the OTN frame includes an overhead area corresponding to each time slot in the payload area of the OTN frame. The overhead area of the last time slot included in the first service container carries mapping overhead of the multiple data unit frames mapped to the first service container.
[0025] In one possible design, mapping a portion of the multiple data unit frames located before the first position to a first service container of an OTN frame, and mapping a portion of the multiple data unit frames located after the first position to a second service container of the OTN frame includes:
[0026] Mapping the portion of the multiple data unit frames located before the first position to M time slots of the OTN frame, and mapping the portion of the multiple data unit frames located after the first position to M+N or MN time slots of the OTN frame. The first service container consists of the M time slots, and the first bandwidth corresponds to the bandwidth of the M time slots. The second service container consists of the M+N time slots or the MN time slots, and the second bandwidth corresponds to the bandwidth of the M+N time slots or the MN time slots.
[0027] In one possible design, the data unit frame is an optical service unit OSU, and / or the OTN frame is an optical data unit ODU frame.
[0028] In one possible design, the first service container includes M time slots, and the first bandwidth corresponds to the bandwidth of the M time slots. The second service container consists of M+N time slots or MN time slots, and the second bandwidth corresponds to the bandwidth of the M+N time slots or the MN time slots. The overhead area of the OTN frame includes an overhead area corresponding to each time slot in the payload area of the OTN frame, and the overhead area corresponding to the N time slots is used to carry interaction information required for bandwidth adjustment.
[0029] In one possible design, the interaction information includes one or more of the following: adjustment protocol RP, branch time slot connectivity check TSCC, branch port number TPID, control information CTRL, and branch time slot group status TSGS.
[0030] In a possible design, the first network node is a source node on a transmission path of the service data.
[0031] In a second aspect, an embodiment of the present application provides another bandwidth adjustment method. It is applied to a second network node. The method includes: receiving an optical transport network (OTN) frame, wherein the OTN frame is used to carry multiple data unit frames, and the payload area of the multiple data unit frames carries service data. Demapping a first data unit frame from a first service container of the OTN frame, wherein the first indication carried by the first data unit frame is a set value, and the first indication is a set value, indicating a bandwidth adjustment position of the service data in the multiple data unit frames. Determine the first position at which the bandwidth of the multiple data unit frames is converted from the first bandwidth to the second bandwidth based on the bandwidth adjustment position. Continue to demap the portion of the multiple data unit frames located before the first position from the first service container of the OTN frame, and demap the portion of the multiple data unit frames located after the first position from the second service container of the OTN frame.
[0032] In one possible design, the overhead area of the first data unit frame also carries a second indication, which is used to indicate the number of network nodes passed by the multiple data unit frames, where the passed network nodes are network nodes that need to complete mapping of the multiple data unit frames to OTN frames at the service layer.
[0033] In one possible design, determining, according to the bandwidth adjustment position, a first position at which the bandwidths of the plurality of data unit frames are transformed from a first bandwidth to a second bandwidth includes:
[0034] The first position is determined according to the bandwidth adjustment position and a value of the second indication.
[0035] In a possible design, the first position satisfies: W=y+HA*n;
[0036] Wherein, W represents the first position, y represents the bandwidth adjustment position, HA represents the second indication, and n is a preset value.
[0037] In one possible design, continuing to demap a portion of the multiple data unit frames located before a first position from a first service container of the OTN frame, and demapping a portion of the multiple data unit frames located after the first position from a second service container of the OTN frame includes:
[0038] Determine a demarcation point between a first service container and a second service container in the OTN frame according to the first position, the first bandwidth, and the second bandwidth;
[0039] Continue to demap the portion of the multiple data unit frames located before the first position from the first service container of the OTN frame according to the demarcation point, and demap the portion of the multiple data unit frames located after the first position from the second service container of the OTN frame.
[0040] In one possible design, the demarcation point satisfies:
[0041] in
[0042] or,
[0043] in
[0044] Wherein, Y represents the demarcation point, y represents the bandwidth adjustment position, X represents the mapping position of the first indication in the first data unit frame to the OTN frame, x represents the position of the first indication in multiple data unit frames, W represents the first position, P represents the size of the first service container or the size of the second service container, and C m (M) represents the number of data blocks in the service container of the OTN frame mapped to the OSU data unit frame before bandwidth adjustment, and celling() represents rounding up.
[0045] In one possible design, the overhead area of the OTN frame includes an overhead area corresponding to each time slot in the payload area of the OTN frame, and the overhead area of the last time slot included in the first service container carries the mapping overhead of the multiple data unit frames mapped to the first service container.
[0046] In one possible design, the data unit frame is an optical service unit OSU frame, and / or the OTN frame is an optical data unit ODU.
[0047] In one possible design, the first service container consists of M time slots, the first bandwidth corresponds to the bandwidth of the M time slots, the second service container consists of M+N time slots or MN time slots, and the second bandwidth corresponds to the bandwidth of the M+N time slots or the MN time slots.
[0048] In one possible design, the overhead area of the OTN frame includes an overhead area corresponding to each time slot in the payload area of the OTN frame. The overhead areas corresponding to the N time slots are used to carry interaction information required for bandwidth adjustment.
[0049] In one possible design, the interaction information includes one or more of the following: adjustment protocol RP, branch time slot connectivity check TSCC, branch port number TPID, control information CTRL, and branch time slot group status TSGS.
[0050] In one possible design, the first network node is a sink node or an intermediate node on a transmission path of the service data.
[0051] In a third aspect, embodiments of the present application provide a bandwidth adjustment device, applied to a network node. The device includes a processor and an optical transceiver. The processor is configured to execute the method described in the first aspect or any design of the first aspect, or the method described in the second aspect or any design of the second aspect, and to transmit and receive optical transport network (OTN) frames via the optical transceiver.
[0052] In a fourth aspect, embodiments of the present application provide a bandwidth adjustment device, applied to a network node. The device includes a processor and a memory. The memory is configured to store program code. The processor is configured to read and execute the program code stored in the memory to implement the method described in the first aspect or any design of the first aspect, or the method described in the second aspect or any design of the second aspect.
[0053] In a fifth aspect, embodiments of the present application further provide a computer storage medium. The storage medium stores a software program that, when read and executed by one or more processors, can implement the method provided by any one of the designs of the first or second aspects, or the method provided by the second aspect or any one of the designs of the second aspect.
[0054] In a sixth aspect, an embodiment of the present application provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute any method provided by the design of the first aspect or enables the computer to execute any method provided by the design of the second aspect.
[0055] In a seventh aspect, an embodiment of the present application provides a chip, the chip including a processor. The processor is configured to execute any one of the methods provided in the first aspect, or execute any one of the methods provided in the second aspect.
[0056] In one possible design, the chip further includes a communication interface coupled to the processor.
[0057] In one possible design, the chip is connected to a memory and is used to read and execute a software program stored in the memory to implement the method provided by any one of the designs of the first aspect, or to implement the method provided by any one of the designs of the second aspect.
[0058] Based on the implementations provided in the above aspects, this application can also be further combined to provide more implementations. BRIEF DESCRIPTION OF THE DRAWINGS
[0059] FIG1 is a schematic diagram of a network architecture;
[0060] FIG2 is a schematic diagram of the hardware structure of a network device;
[0061] FIG3 is a schematic diagram of TS distribution using GMP mapping;
[0062] FIG4 is a schematic flow chart of a bandwidth adjustment method provided in an embodiment of the present application;
[0063] FIG5 is a schematic diagram of a possible OSU structure provided in an embodiment of the present application;
[0064] FIG6 is a schematic diagram of a service container change according to an embodiment of the present application;
[0065] FIG7 is a schematic structural diagram of an RCOH provided in an embodiment of the present application;
[0066] FIG8 is a schematic diagram of the distribution of the ODU0 overhead area provided in an embodiment of the present application;
[0067] FIG9 is a schematic diagram of an overhead area of the last time slot of a first service container provided by an embodiment of the present application;
[0068] FIG10 is a schematic diagram of time slot overhead areas corresponding to even multiframes and odd multiframes provided in an embodiment of the present application;
[0069] FIG11 is a schematic flow chart of a bandwidth adjustment method provided in an embodiment of the present application;
[0070] FIG12 is a schematic diagram of a transmission path of service data provided in an embodiment of the present application;
[0071] FIG13 is a schematic flow chart of a bandwidth adjustment method for a bandwidth increase scenario provided by an embodiment of the present application;
[0072] FIG14 is a schematic diagram of an end-to-end bandwidth adjustment process according to an embodiment of the present application;
[0073] FIG15 is a schematic structural diagram of a possible bandwidth adjustment device according to an embodiment of the present application;
[0074] FIG16 is a schematic structural diagram of another possible bandwidth adjustment device according to an embodiment of the present application. DETAILED DESCRIPTION
[0075] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.
[0076] In the description of this application, unless otherwise specified, "plurality" means two or more than two. Furthermore, " / " indicates that the objects associated with each other are in an "or" relationship. For example, A / B can mean A or B. "And / or" in this application is merely a description of the association relationship between associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: A exists alone, A and B exist simultaneously, or B exists alone. A and B can be singular or plural. Furthermore, to facilitate the clear description of the technical solutions of the embodiments of this application, the embodiments of this application use terms such as "first" and "second" to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that terms such as "first" and "second" do not limit the quantity or order of execution, and that terms such as "first" and "second" do not necessarily define differences. It should also be noted that, unless otherwise specified, the specific description of certain technical features in one embodiment can also be used to explain the corresponding technical features mentioned in other embodiments.
[0077] The network architecture and service scenarios described in the embodiments of this application are intended to more clearly illustrate the technical solutions of the embodiments of this application and do not constitute a limitation on the technical solutions provided in the embodiments of this application. Persons skilled in the art will appreciate that, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided in the embodiments of this application are equally applicable to similar technical problems.
[0078] The technical solutions provided in the embodiments of the present application are applicable to optical networks, such as OTN. An OTN is usually composed of multiple OTN devices connected by optical fibers, and can be formed into different topologies such as linear, ring, and mesh according to specific needs.
[0079] Figure 1 is a schematic diagram of a network architecture. The OTN shown in Figure 1 includes two OTN networks (OTN network 1 and OTN network 2). Each OTN network includes a certain number of network devices (also referred to as OTN devices). Links between network devices within an OTN network are intra-domain links, and links between network devices between OTN networks are inter-domain links. Depending on actual needs, a network device may have one or more functions. Generally speaking, network devices are divided into optical layer devices, electrical layer devices, and optoelectronic hybrid devices. Optical layer devices refer to devices capable of processing optical layer signals, such as optical amplifiers (OAs). Electrical layer devices refer to devices capable of processing electrical layer signals, such as devices capable of processing ODU signals. Optoelectronic hybrid devices refer to devices capable of processing both optical and electrical layer signals. It should be noted that, depending on specific integration requirements, a single network device can integrate multiple different functions. The technical solutions provided in this application are applicable to network devices of varying forms and levels of integration. As shown in Figure 1, the OTN network can also connect to client devices, such as the first client device connected to network device 1 and the second client device connected to network device 3 in Figure 1. The number of client devices connected to the OTN network is not specifically limited in the embodiments of the present application. The client device can be a user device or a server, such as a second client device being a cloud server. FIG1 takes an example of an OTN network connected to a single server for providing business services to users. For example, the server connected to network device 7 in FIG1. The network devices in the OTN network are used to transmit business data of client devices. For example, the network device can receive business data of the client device, and then map the business data into an OSU frame, and further map the OSU frame into an OTN frame, and send it to other network devices, etc. For example, the business data can be data of a constant bit rate (CBR) business, data of a packet or group (PKT) type business, and data of a synchronous transport module (STM-N) business. It should be noted that in the embodiments of the present application, the network device can also be referred to as a network node.
[0080] In some embodiments, different OTN networks may be managed by different network management devices. In FIG1 , it is taken as an example that network management device 1 manages OTN network 1 and network management device 2 manages OTN network 2.
[0081] Figure 2 is a schematic diagram of the hardware structure of a network device. Specifically, a network device includes a power supply, fans, auxiliary boards, and may also include tributary boards, circuit boards, cross-connect boards, and system control and communication boards. Circuit boards may also include optical layer processing boards. It should be noted that the specific types and number of boards included in each device may vary depending on specific needs. For example, a network device serving as a core node may not have any tributary boards. A network device serving as an edge node may have multiple tributary boards. Power supplies are used to power network devices and may include primary and backup power supplies. Fans are used to dissipate heat. Auxiliary boards provide auxiliary functions such as external alarms and external clock access. Tributary boards, cross-connect boards, and circuit boards primarily process OTN electrical layer signals (hereinafter referred to as OTN frames). Tributary boards are used to receive and transmit various customer services, such as synchronous digital hierarchy (SDH) services, packet services, Ethernet services, and fronthaul services. Furthermore, tributary boards can be divided into client-side optical modules and signal processors. The client-side optical module can be an optical transceiver, used to receive and / or transmit client signals. The signal processor is used to map and demap client signals into OTN frames. The cross-connect board is used to exchange OTN frames, completing the exchange of one or more types of OTN frames. The line board primarily processes line-side OTN frames. Specifically, the line board can be divided into a line-side optical module and a signal processor. The line-side optical module can be a line-side optical transceiver, used to receive and / or transmit OTN frames. The signal processor is used to multiplex and demultiplex, or map and demap, line-side OTN frames. System control and communication boards are used to implement system control and communication. Specifically, the backplane can collect information from different boards or send control commands to corresponding boards. Unless otherwise specified, there can be one or more specific components (e.g., tributary boards), and this application does not impose any restrictions. It should be noted that the embodiments of this application do not limit the types of boards included in the device, the specific functional design, or the number of boards.
[0082] The following first describes the technical concepts involved in the embodiments of this application.
[0083] 1) Network node, which can be referred to as a node or a network device, such as an OTN device.
[0084] 2) A data unit frame, consisting of an integer number of bytes or bits. A data unit frame may also be referred to as an optical service unit (OSU) frame, a flexible optical service unit (OSUflex), an optical service data unit frame, an optical service unit, a payload code block, a payload block, a switching unit, or a switching code block, or a first OTN frame, but this application does not specifically limit this. A data unit frame may also be another frame type, and the rate of the data unit frame is lower than the rate of the mapped OTN frame. Figure 3 shows a possible structural diagram of a data unit frame. As shown in Figure 3, the data unit frame includes an overhead area and a payload area. The overhead may include, but is not limited to, at least one of the following: a service frame header indicator, a trail trace identifier (TTI), X-bit interleaved parity (BIP-X), a backward error indication (BEI), a backward defect indication (BDI), a status indicator (STAT), a timestamp, a sequence identifier, and mapping overhead. The payload area is used to carry service data. For example, the data unit frame can be 8 bytes (B) or an integer multiple of 16B, such as 16B, 32B, 64B, 128B, 196B, 256B or 512B, etc., which is not limited in this embodiment of the present application.
[0085] 3) OTN frame: Used to carry various service data and enable management and monitoring of service data. An OTN frame can be an optical data unit (ODU) k, ODUCn, or ODUflex, an optical transport unit (OTU) k, OTUCn, an optical payload unit (OPU), or a flexible OTN (FlexO) frame. An OTN frame can also be an ODU multiframe, an OTU multiframe, or an OPU multiframe. OTN frames can also have other frame structures suitable for optical networks.
[0086] 4) Generic Mapping Procedure (GMP) is a general mapping procedure for OTN. Specifically, it generates the value of the number of customer entities Cm and clock information in each service frame period, then calculates the distribution pattern of customer data in the payload area using the "sigma-delta" algorithm, and maps the Cm number of customer data to the position corresponding to the distribution pattern.
[0087] The data unit frame may be mapped to the OTN frame using a GMP mapping method, wherein the data unit frame occupies several time slots (tributary slots or time slots, TS) in the OTN frame.
[0088] As an example, Figure 3 shows a TS distribution diagram using GMP mapping. In Figure 3, GMP OH represents the overhead area. In Figure 3, a service container consisting of one or more TSs is used to transport OSUs. In Figure 3, the OTN frame is ODU0. ODU0 consists of 119 10M time slots. The ODU0 payload area is divided into 119 10M time slots. The time slot interleaving granularity is 16 bytes. Each block in Figure 3 is 16 bytes, and each time slot in each ODU frame consists of eight 16-byte blocks. 32 ODU0s constitute a multiframe. The size of an OSU is an integer multiple of 16 bytes. When mapping OSUs into the service container, they can be placed sequentially from top to bottom, and from left to right within each row. Once the corresponding time slots in a row are filled, a similar operation is performed on the corresponding time slots in the next row. As shown in Figure 3, for example, if the service container occupies three time slots, using TS#1, TS#2, and TS#k as examples, the mapping granularity is 16 bytes. The mapping granularity can be called a data block, that is, the size of a data block is 16 bytes. After the first row is filled in the order of TS#1, TS#2, TS#k, TS#1, TS#2, TS#k, the OSU bit stream is then placed in the second row in the same order.
[0089] 5) The asynchronous mapping procedure (AMP) is an OTN mapping procedure. AMP determines the value of the positive justification opportunity (PJO) or negative justification opportunity (NJO) based on the client-side signal rate. This determines whether the justification byte contains padding or client signals, ensuring that the server-layer signal rate matches the client-layer signal rate.
[0090] Because packet traffic often fluctuates irregularly, the bandwidth of the OSU is adjusted to accommodate varying traffic flows during different time periods. Adjusting the OSU bandwidth involves adjusting the bandwidth occupied by the OTN frame carrying the OSU, specifically adjusting the timeslots within the OTN frame. A service container is a space that carries the OSU and consists of multiple timeslots within the OTN frame.
[0091] The current lossless bandwidth adjustment scheme (based on the G.HAO protocol) uses periodic delay indication, which makes it impossible to achieve rapid bandwidth adjustment. GMP uses a method of adjusting one byte every 125us, but this method has a slow adjustment rate.
[0092] The present application provides a bandwidth adjustment method and apparatus. During the bandwidth adjustment process, the size of the service container is adjusted synchronously with changes in the rate (or bandwidth) of the data unit frame. The present application uses an OSU frame as an example for explanation. For ease of description, the OSU frame will be referred to as OSU. The following example uses the change in the OSU bandwidth from a first bandwidth to a second bandwidth as an example. For example, in a bandwidth increase scenario, the first bandwidth is smaller than the second bandwidth. In a bandwidth decrease scenario, the first bandwidth is larger than the second bandwidth.
[0093] For example, in a bandwidth-increasing scenario, the first bandwidth corresponds to a bandwidth of M time slots. The second bandwidth corresponds to a bandwidth of M+N time slots. In a bandwidth-reducing scenario, the first bandwidth corresponds to a bandwidth of M time slots, and the second bandwidth corresponds to a bandwidth of MN time slots. Both M and N are positive integers.
[0094] For ease of description, in the embodiments of the present application, the service container corresponding to the OSU carrying the first bandwidth is referred to as the first service container, and the service container corresponding to the OSU carrying the second bandwidth is referred to as the second service container. In some scenarios, the size of the service container is adjusted synchronously with the bandwidth adjustment. For example, the first service container consists of M time slots. In the scenario where the bandwidth increases, the second service container consists of M+N time slots. In the scenario where the bandwidth decreases, the second service container consists of MN time slots. The first service container can also be understood as an optical service tributary unit.M (OSTU.M), where M represents the number of time slots. The second service container can be understood as OSTU.M+N or OSTU.MN.
[0095] In other scenarios, the service container size can be increased before the bandwidth increases, and then reduced after the bandwidth decreases. That is, the first and second service containers can be understood as OSTU.M+N or OSTU.MN.
[0096] In the embodiment of the present application, during the bandwidth adjustment process, a first indication is added to the OSU to inform each network node of the bandwidth adjustment position of the OSU. This first indication is used to indicate the bandwidth adjustment position of the OSU. The first indication may also be called a rate change indication, a bandwidth change indication, or a bandwidth adjustment indication (BWR_IND), or other names may be used, and this embodiment of the application does not specifically limit this.
[0097] The mapping process based on the first indication of each network node on the transmission path is first described below.
[0098] FIG4 is a flow chart of a bandwidth adjustment method according to an embodiment of the present application. The bandwidth adjustment method is applicable to a source node, which may also be referred to as a head node.
[0099] 401, get business data.
[0100] 402. Map the service data to multiple OSUs, wherein the payload areas of the multiple OSUs are used to carry the service data.
[0101] The frame overhead in the multiple OSUs includes a first indication. When the bandwidth of service data needs to be adjusted, the OSU bandwidth needs to be adjusted, which can also be understood as the OSU rate needs to be adjusted. When the OSU bandwidth needs to be adjusted, or before the OSU rate changes, the first indication carried by a first OSU in the multiple OSUs is set to a set value. When the first indication is the set value, it indicates the bandwidth adjustment position of the service data in the multiple OSUs, or indicates the rate adjustment position of the multiple OSUs.
[0102] In one example, the setting bit of the first indication changes from 0 to 1, indicating that the bandwidth needs to be adjusted. The other bits of the first indication indicate the bandwidth adjustment position.
[0103] In another example, when the value of the first indicator changes from 0 to 1, it indicates that the bandwidth needs to be adjusted. The distance between the bit position where the first indicator is located and the bandwidth adjustment position is the set distance. The determination of this set distance is related to the structure of the OSU. For example, different set distances are configured for different OSU structures. Therefore, the bandwidth adjustment position can be determined based on the position of the first indicator among multiple OSUs and the OSU structure.
[0104] Based on this, 403 can be executed after 402 is executed.
[0105] 403. When it is determined that the bandwidth of the service data needs to be adjusted, the first indication carried in the first OSU of the multiple OSUs is set to a set value. When the first indication is the set value, it indicates the bandwidth adjustment position of the service data in the multiple OSUs.
[0106] It should be noted that the position of the first indication in the multiple OSUs is before the bandwidth adjustment position.
[0107] The size of an OSU can be a multiple of 16 bytes. As an example, see FIG5 , which shows a possible OSU structure diagram provided by an embodiment of the present application. FIG5 illustrates an OSU with four rows and 960 bytes. The OSU includes an overhead area and a payload area. The overhead area of the OSU includes a first indicator. For example, the first indicator can be categorized as resize control overhead (RCOH). The RCOH is located in the overhead area of the OSU. For example, the upper 4 bits of the 8th byte column in rows 1 to 3. The distance between the position of the RCOH in one OSU and the starting position of the next OSU is 120 16-byte periods. For example, the first indicator in the overhead area of an OSU can indicate the start of bandwidth adjustment at the next OSU. The specific size of the OSU and the location of the resize overhead are not specifically restricted; the location of the resize overhead can be different in OSUs of different sizes. The distance between the location x of the first indicator and the bandwidth adjustment location y indicated by the first indicator can be different for different OSU sizes.
[0108] 404 : Determine, based on the bandwidth adjustment position, a first position where the bandwidths of the plurality of OSUs on the first network node are transformed from a first bandwidth to a second bandwidth.
[0109] 405 : Map the portion of the multiple OSUs located before the first position to a first service container of the OTN frame, and map the portion of the multiple OSUs located after the first position to a second service container of the OTN frame.
[0110] 406. Send the OTN frame.
[0111] Exemplarily, mapping the portion of the multiple OSUs located before the first position to the first service container of the OTN frame, and mapping the portion of the multiple OSUs located after the first position to the second service container of the OTN frame can be implemented as follows:
[0112] Mapping a portion of the multiple OSUs located before the first position to M time slots of the OTN frame, and mapping a portion of the multiple OSUs located after the first position to M+N or MN time slots of the OTN frame;
[0113] The first service container includes at least the M time slots, the first bandwidth corresponds to the bandwidth of the M time slots, the second service container consists of the M+N time slots or the MN time slots, and the second bandwidth corresponds to the bandwidth of the M+N time slots or the MN time slots.
[0114] In one possible implementation, in a bandwidth increase scenario, that is, when the first bandwidth is less than the second bandwidth, before adjusting the bandwidth (or rate) of the OSU, each network node can be instructed to increase the size of the service container, that is, to increase the size of the service container from M time slots to M+N time slots. Then, starting from the source node, each network node gradually adjusts the bandwidth of the OSU in a path-by-path order. In this case, upon receiving the first instruction, the bandwidth of the service container is the bandwidth after the increase. Furthermore, after determining the first position, the portion of the multiple OSUs located before the first position is mapped to the resized service container of the OTN frame (occupying M+N time slots), and the portion of the multiple OSUs located after the first position is mapped to the resized service container of the OTN frame (occupying M+N time slots).
[0115] In one example, in a bandwidth reduction scenario where the first bandwidth is greater than the second bandwidth, each network node can gradually reduce the bandwidth of the OSU, starting from the source node and following the path order, and then instruct each network node to increase the size of the service container. In this case, upon receiving the first instruction, the bandwidth of the service container remains at the first bandwidth. Subsequently, the source node can instruct each network node to reduce the size of the service container. Therefore, after determining the first position, the portion of the multiple OSUs located before the first position is mapped to M time slots of the OTN frame, and the portion of the multiple OSUs located after the first position is mapped to M time slots of the OTN frame. Then, after a specific instruction, starting from the source node, the OSUs received after the specific instruction are mapped to M time slots of the OTN frame.
[0116] In another possible implementation, the bandwidth of the first service container is the first bandwidth, and the bandwidth of the second service container is the second bandwidth. In this implementation, the size of the service container is adjusted synchronously with the adjustment of the bandwidth (transmission rate) of the OSU.
[0117] As an example, consider an OTN frame as an ODU frame. See Figure 6 for a schematic diagram of service container changes provided in an embodiment of the present application. Take, for example, an ODU0 containing 119 10M time slots. Thirty-two ODU0 frames constitute a multiframe, whose payload area is divided into 119 10M time slots. The time slot interleaving granularity is 16 bytes, with each block in Figure 6 being 16 bytes; each time slot contains 256 16-byte blocks.
[0118] The first service container OSTU.M consists of M time slots. The size of the first service container OSTU.M is determined by P M Indicates that the first service container OSTU.M consists of M*256 16-byte containers. The second service container OSTU.M+N consists of M+N time slots. The size of the second service container OSTU.M+N is determined by P M+N The second service container OSTU.M+N consists of (M+N)*256 16-byte packets. The first service container occupies TS#1, TS#2, and TS#k. The second service container occupies TS#1, TS#2, TS#k, TS#i, TS#j, and TS#119. The dotted pattern portion in Figure 6 corresponds to the first service container. When the OSU is mapped in the first service container, the rate of the OSU is R M , indicating M 10M bit rates. The slash pattern portion in FIG6 corresponds to the second service container. When the OSU is mapped in the second service container, the rate of the OSU is R M+N , indicating M+N 10M bit rates.
[0119] Take GMP mapping as an example. Before the bandwidth changes, GMP is based on C m (M) information is uniformly mapped to the first service container using the sigma-delta algorithm. The size of the first service container is the first Y-1 16 bytes of OSTU.M. m (M) represents the number of 16 bytes required to map OSU to OSTU.M. Y represents the mapping position corresponding to the first position in the service container, that is, the boundary between the first service container and the second service container in the OTN frame.
[0120] After the bandwidth changes, GMP based on C m (M+N) information is uniformly mapped to the second service container using the sigma-delta algorithm. When the bandwidth changes, the size of the second service container is the last Z 16 bytes of OSTU.M+N. m (M+N) indicates the number of 16 bytes that need to be mapped from OSU to OSTU.M+N.
[0121] In one possible implementation, when the bandwidth is increased, each network node on the transmission path needs to complete the bandwidth increase one by one in the order from the source node to the destination node. Therefore, the more upstream network nodes there are, the greater the delay in completing the bandwidth increase at the node. The embodiment of the present application indicates the number of upstream network nodes of each network node through a second indication before the bandwidth adjustment. The second indication can also be called hop count accumulation (HOPACC) or other names, which are not specifically limited in the embodiment of the present application. The second indication is used to indicate the number of network nodes passed through by the OSU transmission, where the passed network nodes are the network nodes that complete the mapping to the OTN frame at the service layer for the multiple data unit frames. For example, the second indication is carried in the overhead area of the first OSU. For example, the second indication is carried in the RCOH of the first OSU. See Figure 7, which is a structural diagram of the RCOH located in the OSU frame provided in an embodiment of the present application. In some scenarios, HOPACC may also not be transmitted.
[0122] Before each network node performs mapping at the service layer, it first increases the value of the second indication HOPACC by 1. The purpose of increasing HOPACC by 1 is to adjust the waterline of the FIFO (First Input First Output) device that caches OSU data of the current network node. Generally, the more time slots are occupied, the higher the waterline is set. In order to ensure that the bit stream is transmitted without interruption, a first-in-first-out queue (FIFO) device needs to be deployed in the network node to cache the OSU. For example, the FIFO device can use a cache. Before each network node performs mapping, when determining the first position where the OSU rate actually changes, it delays n data block sizes relative to the position where the input bit stream changes. Taking Figure 6 as an example, the size of the data block is 16 bytes. The data of the n 16-byte OSUs thus delayed are cached in the FIFO device to adjust the FIFO waterline of the current network node.
[0123] In this embodiment, when determining the first position according to the first indication, the value of the second indication may be first added by 1, and then the first position may be determined according to the bandwidth adjustment position indicated by the first indication and the adjusted value of the second indication.
[0124] For example, the first position satisfies the condition shown in the following formula (1): W=y+HA*n Formula (1).
[0125] Where W represents the first position, y represents the wide adjustment position indicated by the first indication, HA represents the value of the second indication, and n is a preset value. Exemplarily, n is related to the bandwidth difference between the first bandwidth and the second bandwidth. For example, n can be equal to the difference between the number of time slots corresponding to the second bandwidth and the number of time slots corresponding to the first bandwidth. In some scenarios, n can also be equal to 0.
[0126] In some scenarios, when there is no need to transmit the HOPACC, it can be understood that the bandwidth adjustment position indicated by the first indication is used as the first position, that is, W=y.
[0127] The following describes how to determine the demarcation point between the first service container and the second service container. The demarcation point can also be understood as the mapping location of the OSU rate change position (i.e., the first position) to the OTN frame. For example, the demarcation point between the first and second service containers in the OTN frame can be determined based on the first position, the first bandwidth, and the second bandwidth. Consequently, based on the demarcation point, the portion of the multiple OSUs located before the first position is mapped to the first service container of the OTN frame, and the portion of the multiple OSUs located after the first position is mapped to the second service container of the OTN frame.
[0128] For example, the demarcation point satisfies the conditions shown in the following formula (2) or formula (3).
[0129] in
[0130] in
[0131] Wherein, Y represents the demarcation point, X represents the mapping position of the first indication in the first OSU to the OTN frame, x represents the position of the first indication in the first OSU, W represents the first position, P represents the size of the first service container or the size of the second service container, and C m (M) represents the number of data blocks mapped from the OSU to the service container of the OTN frame before bandwidth adjustment, and celling() represents rounding up.
[0132] Combining formula (1), formula (2) and formula (3) can be transformed into formula (4) and formula (5).
[0133] in
[0134] in
[0135] As an example, following the example of FIG6 above, P can be equal to P M or P M+N .P M =M*256,P M+N =(M+N)*256.
[0136] After the location of the demarcation point is determined, if the bandwidth changes, the size of the second service container OSTU.M+N in the OTN frame is expressed as Z, and Z satisfies the condition shown in the following formula (6).
[0137] floor() represents rounding down, and M+N represents the number of time slots occupied by the second service container in the bandwidth increase scenario.
[0138] For example, when the bandwidth changes, the second service container OSTU.M+N in the OTN frame is within the bold black box, that is, the size of the second service container OSTU.M+N in the OTN frame is Z data blocks.
[0139] The embodiments of the present application are applicable to both GMP mapping and asynchronous AMP mapping. For example, the above formulas (2) to (5) are applicable to GMP mapping. When AMP mapping is used, the principle of determining the demarcation point is similar to the principle of determining the demarcation point when GMP mapping is used. When AMP is used, when the demarcation point can be determined, the number of fixed padding data blocks required to be inserted when the OSU is mapped to the service container can be counted based on yx or y+HOPACC*nx. Therefore, appropriate modifications can be made to the above formulas (2) to (5).
[0140] In some possible scenarios, some overhead information is transmitted through the OTN frame. The overhead area of the OTN frame includes an overhead area corresponding to each time slot in the payload area of the OTN frame.
[0141] As an example, let's take ODU0 as an OTN frame. 32 ODU0s constitute a multiframe. The payload area of ODU0 is divided into 119 10M time slots, and the time slot interleaving granularity is 16 bytes. Figure 8 shows a schematic diagram of the ODU0 overhead area distribution provided by an embodiment of the present application. In Figure 8, each time slot of ODU0 includes 256 data blocks. The size of each data block is 16 bytes. For example, each time slot is allocated a 12-bit overhead area in ODU0, such as the high 4 bits or low 4 bits of the 15th column of the 1st to 3rd rows of the ODU0 overhead area. For another example, the high 4 bits or low 4 bits of the 16th column of the 1st to 3rd rows of the ODU0 overhead area can be located, as shown in Figure 8. TSOH represents the time slot overhead area. TSOH1-TSOH119 correspond to the overhead areas of TS#1-TS#119, respectively.
[0142] Exemplarily, the 15th column of the ODU0 overhead area may further include a payload structure identifier (PSI), and the 16th column may further include a reserved bit (RES).
[0143] In some embodiments, the overhead information may include mapping overhead of the OSU to the OTN frame, such as the C transmitted when GMP mapping is used. m Incremental information of changes. When mapping an OSU to the first service container OSTU.M, the mapping overhead of the OSU mapped to the first service container can be carried in the overhead area of the last time slot included in the first service container. Referring to Figure 9, a schematic diagram of the overhead area of the last time slot of the first service container is provided for an embodiment of the present application. CRC-4 in Figure 9 represents a cyclic redundancy check-4. In some embodiments, the multiple mapping overheads mapped to the first service container can also carry the overhead areas of other time slots included in the first service container. C1-C6 represent a 6-bit OSU number count. II represents an increase indication, and DI represents a decrease indication.
[0144] In some embodiments, during bandwidth adjustment, the overhead area may include interactive protocol information required for the bandwidth adjustment process. When bandwidth increases, the overhead area corresponding to the time slot to be added may carry the interactive protocol information. When bandwidth decreases, the overhead area corresponding to the time slot to be deleted may carry the interactive protocol information. For example, a first service container includes at least M time slots, a first bandwidth corresponds to the bandwidth of the at least M time slots, a second service container consists of M+N time slots or MN time slots, and the second bandwidth corresponds to the bandwidth of the M+N time slots or the MN time slots. The overhead area of the OTN frame and the overhead area corresponding to the N time slots of the second service container are used to carry the interactive protocol information required for bandwidth adjustment.
[0145] Exemplarily, the interaction protocol information includes at least one of the following:
[0146] resize protocol (RP), tributary slot connectivity check (TSCC), tributary port ID (TPID), control information (CTRL), or tributary slot group status (TSGS).
[0147] Next, using the ODU0 timeslot overhead area shown in Figure 8 as an example, 32 ODU0 frames constitute a multiframe. For example, the upper 5 bits of RP, TSCC, and TPID can be carried in the timeslot overhead area of the even-numbered frames of the multiframe. The lower 5 bits of CTRL, TSGS, and TPID can be carried in the timeslot overhead area of the odd-numbered frames of the multiframe, as shown in Figure 10. Figure 10 shows a schematic diagram of the timeslot overhead areas corresponding to the even and odd multiframes provided in an embodiment of the present application. In some scenarios, two multiframes (i.e., 64 ODU0 frames) complete the transmission of interactive protocol information.
[0148] The demapping process of each network node on the transmission path is described as follows.
[0149] Figure 11 is a flow chart of a bandwidth adjustment method provided in an embodiment of the present application. This bandwidth adjustment method is applicable to intermediate nodes or sink nodes. The number of intermediate nodes in the service data transmission path can be one or more. In some scenarios, the service data transmission path may not include intermediate nodes.
[0150] 1101. Receive the high-order optical transport network (OTN) frame, where the OTN frame is used to carry multiple data unit frames.
[0151] 1102. Demap a first OSU from a first service container of the OTN frame. The payload area of the first OSU is used to carry service data. The overhead area of the first OSU carries a first indication as a set value, which is used to indicate a bandwidth adjustment position of the service data in multiple OSUs.
[0152] 1103 : Determine, according to the bandwidth adjustment position, a first position where the bandwidths of the plurality of OSUs are transformed from a first bandwidth to a second bandwidth.
[0153] The method for determining the first position is as described above and will not be repeated here.
[0154] 1104 : Continue to demap the portion of the multiple OSUs located before the first position from the first service container of the OTN frame, and demap the portion of the multiple OSUs located after the first position from the second service container of the OTN frame.
[0155] In some embodiments, the determination of the starting position of the second service container, or the demarcation point between the first service container and the second service container, is as previously described and will not be further described here. Based on this, step 1104 can be specifically implemented as follows: the demarcation point between the first service container and the second service container in the OTN frame is determined based on the first position, the first bandwidth, and the second bandwidth. Based on the demarcation point, the portion of the multiple OSUs located before the first position in the first service container of the OTN frame can then be demapped, while the portion of the multiple OSUs located after the first position can be demapped from the second service container of the OTN frame.
[0156] In some embodiments, when the network node executing the bandwidth adjustment method is a sink node, the sink node may demap service data from multiple OSUs after executing step 1104 .
[0157] In other embodiments, when the network node executing the bandwidth adjustment method is an intermediate node, after executing step 1104, the intermediate node further performs a mapping process, re-determines the first position based on the bandwidth adjustment position, maps the portion of the multiple OSUs located before the first position to the first service container of the OTN frame, and maps the portion of the multiple OSUs located after the first position to the second service container of the OTN frame. The OTN frame is then transmitted. The process of mapping OSUs to OTN performed by the intermediate node is similar to the process performed by the head node, for example, see steps 404-405.
[0158] The bandwidth adjustment method process provided in an embodiment of the present application is described in detail below with reference to Figures 12, 13, and 14. Figure 12 is a schematic diagram of a transmission path for service data provided in an embodiment of the present application. The service path includes a source node NE1, an intermediate node NE2, and a destination node NE3. The service path may include or exclude intermediate nodes. Only one intermediate node is used as an example in Figure 12. Figure 13 is a schematic diagram of a bandwidth adjustment method process for a bandwidth increase scenario provided in an embodiment of the present application, and Figure 14 is a schematic diagram of an end-to-end bandwidth adjustment process provided in an embodiment of the present application. The specific bandwidth adjustment steps can be implemented by a processor, chip, chip system, or module with processing function on a network node.
[0159] The processing of NE1 of the source node includes A0 processing and A1 processing. In some embodiments, A0 processing may include steps 1301-1302.
[0160] 1301. NE1 maps the received service data to multiple OSUs.
[0161] NE1 can receive a bandwidth adjustment instruction sent by a network management device or a customer device, and determine that the rate of the OSU is adjusted from the first bandwidth to the second bandwidth. M The rate corresponding to the second bandwidth is R M+N .
[0162] Before the rate of the OSU is about to change, NE1 sets the first indicator in the OSU to be mapped to a set value. Here, the first indicator is called BWR_IND. The position of BWR_IND in the OSU is x. BWR_IND is the set value and is used to indicate the bandwidth adjustment position y.
[0163] For easy distinction, the OSU with the first indication set to the set value among multiple OSUs is called the first OSU. Optionally, a second indication is added to the first OSU. Here, the first indication is called HOPACC as an example, HOPACC = 0. HOPACC records the number of network nodes passed by the OSU.
[0164] Before the bandwidth adjustment position y in the multiple OSUs, the bandwidth is the first bandwidth, and starting from the bandwidth adjustment position y, the bandwidth becomes the second bandwidth.
[0165] 1302, NE1 adjusts the bandwidth (or bit rate) of the OSU at the bandwidth adjustment position y. For example, the OSU rate at the start position of the next OSU frame after BWR_IND will be increased from R M Adjust to R M+N For example, BWR_IND is carried in the OSU#i frame. Before and after the OSU#i frame, the OSU rate is R M , the OSU bandwidth is the first bandwidth; after the OSU#i frame, the OSU rate is R M+N , the OSU bandwidth is the second bandwidth.
[0166] The A1 process includes steps 1303 to 1304. The A1 process is used to map the OSU to the output OTN frame. Here, the OTN frame is taken as an example as an ODU frame.
[0167] 1303. Determine the first position 1 according to the first indication, that is, the actual bandwidth change position of the OSU bit stream. The method for determining the first position 1 is as described above and will not be repeated here.
[0168] Specifically, NE1 adds 1 to the value of HOPACC, and the value of HOPACC is 1, and reinserts it into the first OSU. For example, if the value of HOPACC is represented as HA, the actual bandwidth change position is y+HA*n=y+1*n.
[0169] In some scenarios, when the OSU does not include the second indication, there is no need to perform the operation of accumulating 1. Then the first position 1 is the bandwidth adjustment position indicated by the first indication.
[0170] 1304. Generate a mapping position Y1 corresponding to the actual bandwidth change position of the OSU. The mapping position Y1 is determined as described above and will not be described again here.
[0171] 1305. Based on the mapping position Y1 as a dividing point, the part of the multiple OSUs located before the first position 1 is mapped to the first service container (OSTU.M) of the ODU frame, and the part of the multiple OSUs located after the first position 1 is mapped to the second service container (OSTU.M+N) of the ODU frame.
[0172] 1306. Send the ODU frame to NE2.
[0173] The processing of the intermediate node NE2 includes B1 processing and B2 processing. The B1 processing includes demapping the OSU from the ODU frame. The B2 processing includes mapping the demapped OSU into the ODU frame.
[0174] Illustratively, B1 includes steps 1307 - 1310 .
[0175] 1307 : Demap a first OSU from the first service container of the received ODU frame.
[0176] NE2 detects BWR_IND from the OSU carried by the received ODU frame. BWR_IND changes from 0 to 1. NE2 determines based on BWR_IND that the OSU rate is about to change at position y. For example, BWR_IND is detected from the first OSU.
[0177] Optionally, a value of HOPACC is obtained from the first OSU, where the value of HOPACC is 1.
[0178] 1308. Determine the first position 1 based on the position of BWR_IND in the multiple OSUs and the value of HOPACC. The first position 1 determined by NE2 during the demapping process is the first position 1 during mapping of NE1, that is, the first position is y+HA*n=y+1*n.
[0179] In some scenarios, when the OSU does not include the second indication, the first position 1 is the bandwidth adjustment position y indicated by the first indication.
[0180] 1309 , generate a demapping position Y1 corresponding to the first position 1.
[0181] 1310. Continue to demap the portion of the multiple OSUs located before the first position 1 from the first service container (OSTU.M) of the ODU frame according to the demapping position Y1, and demap the portion of the multiple OSUs located after the first position 1 from the second service container (OSTU.M+N) of the ODU frame.
[0182] Exemplarily, different demapping is performed based on the demapping position Y1 as a dividing point. Before the OSU rate change position, the OSU before the rate change is demapped from the first service container (OSTU.M); after the OSU rate change position, the OSU after the rate change is demapped from the second service container (OSTU.M+N).
[0183] Exemplarily, the B2 process includes steps 1311 to 1314. The B2 process is used to implement mapping of the OSU to the output ODU frame.
[0184] 1311. Determine a first position 2 according to the first indication, i.e., the actual change position of the bandwidth of the OSU. The method for determining the first position 2 is as described above and will not be repeated here.
[0185] Specifically, NE1 adds 1 to the value of HOPACC, updates the value of HOPACC to 2, and reinserts it into the first OSU. The actual bandwidth change position is y+HA*n=y+2*n.
[0186] 1312. Generate a mapping position Y2 corresponding to the actual bandwidth change position of the OSU. The mapping position Y2 is determined as described above and will not be described again here.
[0187] In some scenarios, when the OSU does not include the second indication, there is no need to perform the operation of accumulating 1. The first position 2 is the bandwidth adjustment position y indicated by the first indication, and the mapping position Y2 is the same as the mapping position Y1.
[0188] 1313. Based on the mapping position Y2 as a dividing point, the portion of the multiple OSUs located before the first position 2 is mapped to the first service container (OSTU.M) of the ODU frame, and the portion of the multiple OSUs located after the first position 2 is mapped to the second service container (OSTU.M+N) of the ODU frame.
[0189] 1314. Send the ODU frame to NE3.
[0190] The processing of the sink node NE3 includes C1 processing and C0 processing. The C1 processing includes demapping the OSU from the ODU frame. The C0 processing includes demapping the service data from the OSU.
[0191] Illustratively, C1 includes steps 1315 - 1318 .
[0192] 1315 : Demap a first OSU from the first service container of the received ODU frame.
[0193] NE3 detects BWR_IND from the OSU carried in the received ODU frame. BWR_IND changes from 0 to 1, indicating that the OSU rate is about to change at position y. For example, BWR_IND is detected from the first OSU.
[0194] Optionally, a value of HOPACC is obtained from the first OSU, where the value of HOPACC is HA=2.
[0195] 1316. Determine first position 2 based on the position of BWR_IND in the multiple OSUs and the value of HOPACC. The first position 2 determined by NE2 during the demapping process is the first position 2 during mapping of NE1, that is, the first position 2 is y+HA*n=y+2*n.
[0196] 1317 , generate a demapped position Y2 corresponding to the first position 2.
[0197] In some scenarios, when the OSU does not include the second indication, the first position 2 is the bandwidth adjustment position y indicated by the first indication, and the mapping position Y2 is the same as the mapping position Y1.
[0198] 1318. Continue to demap the portion of the multiple OSUs located before the first position 2 from the first service container (OSTU.M) of the ODU frame according to the demapping position Y2, and demap the portion of the multiple OSUs located after the first position 2 from the second service container (OSTU.M+N) of the ODU frame.
[0199] Exemplarily, different demapping is performed based on the demapping position Y2 as a dividing point. Before the OSU rate change position, the OSU before the rate change is demapped from the first service container (OSTU.M); after the OSU rate change position, the OSU after the rate change is demapped from the second service container (OSTU.M+N).
[0200] The C0 process includes step 1319: demapping the service data from the OSU.
[0201] An embodiment of the present application also provides a system, which includes a source node and a destination node, and may also include an intermediate node.
[0202] The present application also provides a bandwidth adjustment device. The method, device, and system are based on the same inventive concept. Since the method, device, and system solve similar problems, the embodiments of the device and method can refer to each other, and any repetitions will be omitted. The device can be used in OTN equipment. Specifically, the device can be a processor, chip, chip system, or a module in a processor in the OTN equipment. The device can be implemented by the tributary board and / or circuit board in Figure 2. Figure 15 is a schematic diagram of the structure of a possible bandwidth adjustment device in the present application. As shown in Figure 15, the device includes a processing unit 1501, a receiving unit 1502, and a sending unit 1503. The processing unit 1501 is used in the bandwidth adjustment method described in any of the above embodiments, such as performing mapping or demapping operations. For example, it performs steps 402-405. Another example is the operations of steps 1102-1104. The receiving unit 1502 is used to perform the receiving operation of the network node in any of the above embodiments, such as receiving OTN frames or receiving service data. The sending unit 1503 is used to perform the sending operation of the network node in any of the above embodiments, such as sending OTN frames. Optionally, the above three units may also execute other relevant optional steps executed by the network device mentioned in any of the above embodiments, which will not be repeated here.
[0203] The division of units in the embodiments of the present application is illustrative and is only a logical functional division. In actual implementation, other division methods may be used. In addition, the functional units in the various embodiments of the present application can be integrated into a processor, or can exist physically separately, or two or more units can be integrated into a single unit. The above-mentioned integrated units can be implemented in the form of hardware or software functional units.
[0204] FIG16 is a schematic diagram of the structure of another possible bandwidth adjustment device according to an embodiment of the present application. As shown in FIG16 , device 1600 includes a communication interface 1610 and a processor 1620 . Device 1600 can be applied to OTN equipment. Device 1600 can also include a memory 1630 .
[0205] The processing unit 1501, receiving unit 1502, and sending unit 1503 shown in Figure 15 can all be implemented by the processor 1620. For example, the processor 1620 can be the signal processor in the circuit board and / or the signal processor in the tributary board shown in Figure 2. The processor 1620 sends and receives OTN frames or service data through the communication interface 1610 to implement the method performed by the network node (source node, intermediate node, or sink node) in Figure 4, Figure 11, Figure 13, or Figure 14. During implementation, each step of the processing flow can be completed by hardware integrated logic circuits or software instructions in the processor 1620 to complete the method performed by the network node in Figure 4, Figure 11, Figure 13, or Figure 14.
[0206] The communication interface 1610 may be a circuit, a bus, a transceiver, or any other device that can be used for information exchange. For example, the other device may be a device connected to the device 1600, such as a customer device or other OTN device.
[0207] Processor 1620 may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. A general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of the present application may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software units in the processor. The program code executed by processor 1620 to implement the above-described methods may be stored in memory 1630. Memory 1630 and processor 1620 are coupled. Coupling in the embodiments of the present application refers to an indirect coupling or communication connection between devices, units, or modules, and may be electrical, mechanical, or other forms, for information exchange between devices, units, or modules. Processor 1620 may operate in conjunction with memory 1630. Memory 1630 may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), or a volatile memory, such as random-access memory (RAM). Memory 1630 is, but is not limited to, any other medium that can be used to carry or store program code in the form of instructions or data structures and that can be accessed by a computer.
[0208] The specific connection medium between the communication interface 1610, processor 1620, and memory 1630 is not limited in the embodiments of the present application. In Figure 16, the embodiment of the present application shows that the memory 1630, processor 1620, and communication interface 1610 are connected via a bus. The bus is represented by a bold line in Figure 16, and the connection method between other components is only for schematic illustration and is not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one bold line is used in Figure 16, but this does not mean that there is only one bus or one type of bus.
[0209] Based on the above embodiments, embodiments of the present application further provide a computer storage medium storing a software program that, when read and executed by one or more processors, can implement the methods provided by any one or more of the above embodiments. The computer storage medium may include various media capable of storing program code, such as a USB flash drive, a mobile hard drive, a read-only memory, and a random access memory.
[0210] Based on the above embodiments, embodiments of the present application further provide a chip. The chip includes a processor configured to implement the functions described in any one or more of the above embodiments, such as receiving, sending, or processing the protocol frames described in the above methods. Optionally, the chip also includes a memory configured to store the necessary program instructions and data for execution by the processor. The chip may be comprised of a single chip or may include a chip and other discrete components.
[0211] One embodiment of the present application provides a computer-readable medium for storing a computer program, wherein the computer program includes instructions for executing the method steps in the method embodiment corresponding to FIG. 4 , FIG. 11 , FIG. 13 or FIG. 14 .
[0212] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, optical storage, etc.) that contain computer-usable program code.
[0213] The present application is described with reference to the flow chart and / or block diagram of the method, device (system), and computer program product according to the embodiment of the present application. It should be understood that each flow process and / or box in the flow chart and / or block diagram and the combination of the flow process and / or box in the flow chart and / or block diagram can be realized by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processing machine or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for realizing the function specified in one flow chart flow or multiple flows and / or one box or multiple boxes of the block diagram.
[0214] Obviously, those skilled in the art may make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include these modifications and variations.
Claims
1. A bandwidth adjustment method, characterized in that: The method comprises: Carrying a first indication in the overhead of the first data unit frame, where the first indication is used to indicate a bandwidth adjustment position of the first data unit frame; Mapping some bytes of the first data unit frame before the bandwidth adjustment position to a first service container of a second data unit frame, and mapping some bytes of the first data unit frame after the bandwidth adjustment position to a second service container of the second data unit frame, where the first service container and the second service container occupy different numbers of time slots in the second data unit frame.
2. The method according to claim 1, wherein The position where the first indication is mapped to the second data unit frame is X, the position where the byte at the bandwidth adjustment position is mapped to the second data unit frame is Y, and Y is related to X.
3. The method according to claim 1 or 2, wherein: The first indication is a bandwidth adjustment indication BWR_IND.
4. The method according to claim 3, wherein The BWR_IND is 1, indicating that the rate of the first data unit frame needs to be adjusted.
5. The method according to any one of claims 1 to 4, characterized in that: The first data unit frame and the second data unit frame are both optical transport network (OTN) frames.
6. The method according to any one of claims 1 to 5, characterized in that: The mapping of the portion of bytes in the first data unit frame located before the bandwidth adjustment position to the first service container of the second data unit frame, and mapping the portion of bytes in the first data unit frame located after the bandwidth adjustment position to the second service container of the second data unit frame, includes: Map some bytes in the first data unit frame before the bandwidth adjustment position to M time slots of the second data unit frame, and map some bytes in the first data unit frame after the bandwidth adjustment position to M+N or MN time slots of the second data unit frame.
7. The method according to any one of claims 1 to 6, wherein: The overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area of the last time slot included in the first service container carries the mapping overhead of the first data unit frame mapped to the first service container.
8. The method according to any one of claims 1 to 7, wherein: The first service container includes M time slots, the second service container includes M+N time slots or MN time slots, the overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area corresponding to the N time slots is used to carry bandwidth adjustment interaction information.
9. The method according to claim 8, wherein The interaction information includes one or more of adjustment protocol RP, tributary time slot connectivity check TSCC, tributary port number TPID, control information CTRL, and tributary time slot group state TSGS.
10. A bandwidth adjustment method, characterized in that: The method comprises: receiving a second data unit frame, and demapping the first data unit frame from the second data unit frame; Demapping a first indication from an overhead of the first data unit frame, where the first indication is used to indicate a bandwidth adjustment position of the first data unit frame; Demap a portion of bytes of the first data unit frame located before the bandwidth adjustment position from a first service container of the second data unit frame, and demap a portion of bytes of the first data unit frame located after the bandwidth adjustment position from a second service container of the second data unit frame, wherein the first service container and the second service container occupy different numbers of time slots in the second data unit frame.
11. The method according to claim 10, wherein The first indication is demapped from position X of the second data unit frame, and the byte at the bandwidth adjustment position is demapped from position Y of the second data unit frame, where Y is related to X.
12. The method according to claim 10 or 11, characterized in that The first indication is a bandwidth adjustment indication BWR_IND.
13. The method according to claim 12, wherein: The BWR_IND is 1, indicating that the rate of the first data unit frame needs to be adjusted.
14. The method according to any one of claims 10 to 13, wherein: The first data unit frame and the second data unit frame are both optical transport network (OTN) frames.
15. The method according to any one of claims 10 to 14, wherein: The demapping of the portion of bytes in the first data unit frame located before the bandwidth adjustment position from the first service container of the second data unit frame, and demapping of the portion of bytes in the first data unit frame located after the bandwidth adjustment position from the second server of the second data unit frame, includes: Demap the portion of bytes in the first data unit frame located before the bandwidth adjustment position from the M time slots of the second data unit frame, and demap the portion of bytes in the first data unit frame located after the bandwidth adjustment position from the M+N or MN time slots of the second data unit frame.
16. The method according to any one of claims 10 to 15, wherein: The overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area of the last time slot included in the first service container carries the mapping overhead of the first data unit frame mapped to the first service container.
17. The method according to any one of claims 10 to 16, wherein: The first service container includes M time slots, the second service container includes M+N time slots or MN time slots, the overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area corresponding to the N time slots is used to carry bandwidth adjustment interaction information.
18. The method according to claim 17, wherein The interaction information includes one or more of adjustment protocol RP, tributary time slot connectivity check TSCC, tributary port number TPID, control information CTRL, and tributary time slot group state TSGS.
19. A bandwidth adjustment device, characterized in that: The device comprises: an overhead generating unit, configured to generate a first indication, and carry the first indication in the overhead of a first data unit frame, where the first indication is used to indicate a bandwidth adjustment position of the first data unit frame; a mapping unit, configured to map a portion of bytes in the first data unit frame that are located before the bandwidth adjustment position to a first service container in a second data unit frame, and map a portion of bytes in the first data unit frame that are located after the bandwidth adjustment position to a second service container in the second data unit frame, where the first service container and the second service container occupy different numbers of time slots in the second data unit frame.
20. The device according to claim 19, wherein The position where the first indication is mapped to the second data unit frame is X, the position where the byte at the bandwidth adjustment position is mapped to the second data unit frame is Y, and Y is related to X.
21. The device according to claim 19 or 20, characterized in that The first indication is a bandwidth adjustment indication BWR_IND.
22. The device according to claim 21, wherein The BWR_IND is 1, indicating that the rate of the first data unit frame needs to be adjusted.
23. The device according to any one of claims 19 to 22, characterized in that: The first data unit frame and the second data unit frame are both optical transport network (OTN) frames.
24. The device according to any one of claims 19 to 23, characterized in that: The mapping unit is configured to: Map some bytes in the first data unit frame before the bandwidth adjustment position to M time slots of the second data unit frame, and map some bytes in the first data unit frame after the bandwidth adjustment position to M+N or MN time slots of the second data unit frame.
25. The device according to any one of claims 19 to 24, characterized in that: The overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area of the last time slot included in the first service container carries the mapping overhead of the first data unit frame mapped to the first service container.
26. The device according to any one of claims 19 to 25, characterized in that: The first service container includes M time slots, the second service container includes M+N time slots or MN time slots, the overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area corresponding to the N time slots is used to carry bandwidth adjustment interaction information.
27. The device according to claim 26, wherein The interaction information includes one or more of adjustment protocol RP, tributary time slot connectivity check TSCC, tributary port number TPID, control information CTRL, and tributary time slot group state TSGS.
28. A bandwidth adjustment device, characterized in that: The device comprises: A receiving unit, configured to receive a second data unit frame; a demapping unit, configured to demap the first data unit frame from the second data unit frame; The demapping unit is configured to demap a first indication from the overhead of the first data unit frame, where the first indication is used to indicate a bandwidth adjustment position of the first data unit frame; The demapping unit is further configured to demap, from a first service container of the second data unit frame, a portion of bytes located before the bandwidth adjustment position in the first data unit frame, and demap, from a second service container of the second data unit frame, a portion of bytes located after the bandwidth adjustment position in the first data unit frame, wherein the first service container and the second service container occupy different numbers of time slots in the second data unit frame.
29. The device according to claim 28, characterized in that The demapping unit is configured to demap the first indication from position X of the second data unit frame, and demap the byte at the bandwidth adjustment position from position Y of the second data unit frame, where Y is related to X.
30. The device according to claim 28 or 29, characterized in that The first indication is a bandwidth adjustment indication BWR_IND.
31. The device according to claim 30, wherein The BWR_IND is 1, indicating that the rate of the first data unit frame needs to be adjusted.
32. The device according to any one of claims 28 to 31, characterized in that The first data unit frame and the second data unit frame are both optical transport network (OTN) frames.
33. The device according to any one of claims 28 to 32, characterized in that The demapping unit is configured to: Demap the portion of bytes in the first data unit frame located before the bandwidth adjustment position from the M time slots of the second data unit frame, and demap the portion of bytes in the first data unit frame located after the bandwidth adjustment position from the M+N or MN time slots of the second data unit frame.
34. The device according to any one of claims 28 to 33, wherein: The overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area of the last time slot included in the first service container carries the mapping overhead of the first data unit frame mapped to the first service container.
35. The device according to any one of claims 28 to 34, characterized in that The first service container includes M time slots, the second service container includes M+N time slots or MN time slots, the overhead area of the second data unit frame includes an overhead area corresponding to each time slot in the payload area of the second data unit frame, and the overhead area corresponding to the N time slots is used to carry bandwidth adjustment interaction information.
36. The device according to claim 35, wherein The interaction information includes one or more of adjustment protocol RP, tributary time slot connectivity check TSCC, tributary port number TPID, control information CTRL, and tributary time slot group state TSGS.
37. A chip, characterized in that: The chip is connected to the memory and is used to read and execute the program code stored in the memory to implement the method according to any one of claims 1 to 9.
38. A chip, characterized in that: The chip is connected to the memory and is used to read and execute the program code stored in the memory to implement the method according to any one of claims 10-18.
Citation Information
Patent Citations
Lossless adjustment method of ODUflex channel bandwidth and optical transport network
CN103973265A
Service processing method and processing device in optical transport network, and electronic equipment
CN112511917A
Dynamic lossless bandwidth adjustment method and device for M-OTN system
CN112752173A
Service bearing method, device and system
CN113395613A
Service protection method and network node
CN114285462A
Cited By
Bandwidth adjusting method and device
CN122001482A