CN118174821A

CN118174821A - Service processing method and device and electronic equipment

Info

Publication number: CN118174821A
Application number: CN202211582514.3A
Authority: CN
Inventors: 张源斌; 苑岩
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-12-09
Filing date: 2022-12-09
Publication date: 2024-06-11
Also published as: WO2024119837A1

Abstract

The embodiment of the application provides a service processing method, a device and electronic equipment, wherein the method comprises the following steps: carrying out service container frame header detection processing on the service container; performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits.

Description

Service processing method and device and electronic equipment

Technical Field

The present application relates to the field of communications technologies, and in particular, to a service processing method, an apparatus, and an electronic device.

Background

The optical service unit (Optical Service Unit, OSU) is a service container in the optical transport network for carrying small particle services, and the low-speed customer service can be carried efficiently by the OSU.

In the mapping multiplexing process from the OSU to the optical payload unit (Optical Payload Unit, OPU), due to the deviation in rate between the OSU and the time slots used to carry the OSU in the service layer, the padding needs to be inserted for rate adaptation in the mapping process, and the OSU needs to be recovered by removing the padding in the demapping process.

Because the OSU service container is of a fixed-length frame structure, the sudden change of the frame length can cause the frame failure of the service container, so that when the service container is required to be recovered from the OPU, the frame length of the service container cannot be changed due to the incorrect identification of the data and filling of the service container, otherwise, the frame failure of the service container can be caused, and the data loss is further caused. How to ensure that the service container recovered from the OPU remains of a fixed length is a technical problem that needs to be solved in the related art.

Disclosure of Invention

The embodiment of the application aims to provide a service processing method, a device and electronic equipment, which can solve the problems that a service container recovered from an OPU cannot keep a fixed length, the service container fails to frame, and data is lost.

In order to solve the above technical problems, embodiments of the present application are achieved by the following aspects.

In a first aspect, an embodiment of the present application provides a service processing method, including: carrying out service container frame header detection processing on the service container; performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits.

In a second aspect, an embodiment of the present application provides a service processing apparatus, including: the frame header detection module is used for carrying out service container frame header detection processing on the service container; and the operation module is used for performing a first operation on the business container according to the expected position and the detected actual position of the business container frame head, wherein the expected position is a position separated from the last business container frame head by one business container length, and the first operation comprises adding or deleting a fixed number of bits.

In a third aspect, an embodiment of the present application provides an electronic device, including: a memory, a processor, and computer-executable instructions stored on the memory and executable on the processor, which when executed by the processor, perform the steps of performing the method of the first aspect.

In a fourth aspect, embodiments of the present application provide a computer-readable storage medium storing computer-executable instructions which, when executed by a processor, implement the steps of the method of the first aspect.

According to the embodiment of the application, the business container frame header detection processing is carried out on the business container; performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits. In the embodiment of the application, under the condition that the frame head of the service container is not detected at the expected position, the fixed length of the service container is kept by adding or deleting the fixed number of bits, so that the frame failure of the service container is avoided, and the data loss is avoided.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.

Fig. 1 shows a schematic flow chart of a service processing method according to an embodiment of the present application;

FIG. 2 is a schematic diagram of an OSU frame structure provided by an embodiment of the present application;

fig. 3 is a schematic diagram of a slot structure provided by an embodiment of the present application;

FIG. 4 is a diagram illustrating an OSU data flow at a receiving side according to an embodiment of the present application;

FIG. 5 is a schematic diagram of an output OSU data flow according to an embodiment of the present application;

Fig. 6 is a schematic diagram of an OSU data flow at the receiving side according to the second embodiment of the present application;

FIG. 7 is a schematic diagram of a second output OSU data flow in accordance with an embodiment of the present application;

fig. 8 is a schematic diagram of an OSU data flow at the receiving side according to the second embodiment of the present application;

FIG. 9 is a schematic diagram of an OSU data flow after a first process in accordance with an embodiment of the present application;

FIG. 10 is a schematic diagram of a three-output OSU data flow in accordance with an embodiment;

fig. 11 shows a schematic structural diagram of a service processing device according to an embodiment of the present application;

fig. 12 is a schematic hardware structure of an electronic device for executing the service processing method according to the embodiment of the present application.

Detailed Description

In order to make the technical solution of the present application better understood by those skilled in the art, the technical solution of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, shall fall within the scope of the application.

Fig. 1 is a schematic flow chart of a service processing method according to an embodiment of the present application, where the method may be performed by an electronic device, for example, a terminal device or a server device. In other words, the method may be performed by software or hardware installed at a terminal device or a server device. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like. As shown, the method may include the following steps.

Step S102: and carrying out service container frame header detection processing on the service container.

Optionally, the service container frame header detection processing for the service container includes the following steps: 1) Determining an offset range; wherein the offset range includes: M-N-th L-bit block to m+n+1-th L-bit block from the start of counting; the counting starting point is an L bit block where the frame head of the last service container is located; n is a predefined value, N being used to determine the offset range; 2) And detecting the frame header of the service container in the offset range.

In this embodiment, the service container may have a length of M L-bit blocks, where M is a positive integer. As shown in fig. 2, the traffic container (i.e., OSU frame) includes an overhead area and a payload area. The overhead area includes a frame header overhead, i.e., an overhead of the frame header indication signal in fig. 2, and the overhead of the payload area may be 12 16 byte blocks.

Step S104: performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits.

In one example, the actual position is a position of an M1 st L-bit block from the count start point, and the performing a first operation on the service container according to the expected position and the detected actual position of the service container frame header includes: adding M+1-M1L bit blocks to the service container, and taking the actual position as a counting starting point, wherein M1 is less than or equal to M, and M-M1 is less than or equal to N.

In one example, the actual position is a position of an M2 nd L-bit block from the count start point, and the performing a first operation on the service container according to the expected position and the detected actual position of the service container frame header includes: and deleting M2-M-1L bit blocks of the service container, and taking the actual position as a counting starting point, wherein M2 is more than M+1, and M2 is less than or equal to M+N.

N in various embodiments of the present application may be determined by at least one of: burst error length, traffic container rate. When the service container speed is low (for example, lower than a certain threshold value), setting a smaller value for the value of N, thereby ensuring time delay; when the service container rate is high (for example, higher than a certain threshold value), the value of N is set to be a relatively large value, so that the burst error resistance is ensured.

This embodiment is generally applicable in scenarios where no traffic container frame header is detected at the desired location, in other embodiments: and if the frame head of the service container is detected at the expected position, taking the expected position as a next counting starting point. It will be appreciated that if the traffic container frame header is detected at the desired location, it indicates that the length of the traffic container is a fixed length, without adding or deleting bits.

Optionally, the method provided by the various embodiments of the present application further includes the following steps: and if the service container frame header is not detected within the offset range, taking the expected position as a next counting starting point, and inserting the service container frame header in an L bit block of the expected position.

Optionally, before the first operation is performed on the service container according to the expected position and the detected actual position of the frame header of the service container, the method further includes: if a service container header is detected and a next service container header is detected after an interval of one service container length, a service container lock state is entered.

Optionally, the method further comprises: and if the frame head of the service container is not detected at the expected position for K times continuously, entering a service container unlocking state, wherein K is a positive integer greater than 1.

The business processing method provided by the embodiment of the application carries out business container frame header detection processing on the business container; performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits. In the embodiment of the application, under the condition that the frame head of the service container is not detected at the expected position, the fixed length of the service container is kept by adding or deleting the fixed number of bits, so that the frame failure of the service container is avoided, and the data loss is avoided.

In order to describe the service processing method provided in the embodiment of the present application in detail, a specific embodiment will be described below, where the service container is an OSU.

This embodiment maps small granule traffic into OSU and multiplexes OSU mapping into OPU, where the payload area of OPU is divided into a fixed number of time slots, each time slot including an indication overhead and a payload area, the indication overhead being used to indicate the data type carried in the payload area of the time slot, said data type including OSU data and padding, as shown in fig. 3, where the length of the OSU frame is M x L, L being the size of the payload area of the time slot. In the example shown in fig. 2, m=12, l=16.

On the receiving side, the number and position of timeslots carrying OSU are acquired, from the corresponding timeslots, first the timeslots filled with bearers are deleted according to the indication overhead, and then OSU frames are demapped according to the following rules:

Detecting a frame header indication signal of the OSU, and if the frame header indication signal of the OSU is detected and a next frame header indication signal of the OSU is detected after m×l is fixed in length, entering an OSU frame locking state.

In the OSU frame locking state, taking an L-bit block containing an OSU frame header indication signal as a counting start point, wherein the counting start point is used for calculating a frame header expected position of the OSU frame, and a position separated from the counting start point by M L-bit blocks is the expected position, and starting from the (M-N) -th L-bit block, detecting whether a frame header indication signal of the OSU frame is contained in a corresponding position of a subsequent L-bit block or not:

(1) If an OSU frame header indication signal is detected at the position corresponding to the M1 st L bit block and no OSU frame header indication signal is detected at the position corresponding to the (m+1) th L bit block at the expected position, taking the M1 st L bit block as a new counting starting point, and supplementing sequences with (m+1-M1) x L fixed formats to the last OSU frame, wherein M1 is less than or equal to M, M-M1 is less than or equal to N, N is a preset value, and the values depend on parameters such as burst error length, OSU rate and the like.

(2) If an OSU frame header indication signal is detected at a position corresponding to the (m+1) th L-bit block at the desired position, the (m+1) th L-bit block is used as a new count start point.

(3) If the OSU frame header indication signal is not detected at the (m+1) th L-bit block corresponding position at the desired position, detecting whether the frame header indication signal of the OSU frame is contained at the consecutive N L-bit block corresponding positions subsequent to the (m+1) th L-bit block.

If an OSU frame header indication signal is detected at a position corresponding to the M2 nd L bit block, taking the M2 nd L bit block as a new counting start point, deleting (M2-M-1) L data of the last OSU frame, wherein M2 is less than or equal to (m+n), N is a preset value, and when the OSU rate is low, the value of N is set to be a smaller value depending on parameters such as burst error length and OSU rate, so that time delay is ensured, and when the OSU rate is high, the value of N is set to be a relatively larger value, so that burst error resistance is ensured.

If no frame header indication signal of the OSU frame is detected at the corresponding position of the N consecutive L bit blocks after the (m+1) th L bit block, the m+1 th L bit block is used as a new counting starting point, and the frame header indication signal of the OSU frame is inserted at the corresponding position of the L bit block.

If the OSU frame head indication signal is not detected at the corresponding position of the L bit block at the expected position for a fixed number K continuously, the OSU frame unlocking state is entered.

According to the business processing method provided by the embodiment of the application, through presetting an offset, positioning processing of an OSU frame header is performed in an offset range based on a desired position, for the case that the OSU frame header is not positioned at the desired position, the position of an indication signal of the OSU frame header which is actually positioned is used as a new counting starting point, and according to comparison between the actual position of the OSU frame header and the desired position, a first operation is performed on the OSU frame, wherein the first operation comprises adding a fixed number of fixed sequences, deleting a fixed number of L bit blocks of the OSU frame, ensuring that the OSU frame is of a fixed length, and the frame header of the OSU appears every other fixed number of byte blocks, so that the OSU frame length is not changed due to the influence of errors, and a large amount of data is lost.

The service processing method provided by the embodiment of the application is described in detail below with reference to the accompanying drawings.

Example 1

In this embodiment, the source node and the destination node perform the delivery of the OSU service through the OPU0, and this embodiment includes the following steps:

Step 1: at the source node, the OPU0 payload area is divided into 119 slots, each slot being 130 bits in length, with the first 2 bits being the indication overhead and the last 128 bits being the payload area, as shown in fig. 3. When the indication overhead is 01, OSU data loaded in the time slot payload area is represented, and when the indication overhead is 10, padding is represented; the OSU frame is 192 bytes long, i.e. 12 16 byte blocks, and the frame header of the OSU indicates that the overhead is located in the first 4 bytes of the first 16 byte block, as shown in fig. 2.

Step 2: mapping the OSU into the timeslot corresponding to OPU0, since the OSU rate is lower than the timeslot rate carrying it, the padding needs to be inserted for rate adaptation, if the timeslot payload area carries OSU data, the indication overhead is set to 01, if the timeslot payload area carries padding, the indication overhead is set to 10, as shown in fig. 3.

Step 3: it is assumed that during transmission the indication overhead of a slot changes from 01 to 10 due to error effects, i.e. OSU data is misplaced to padding, resulting in a loss of 116 byte block for a certain OSU frame.

Step 4: on the receiving side, the slot carrying the OSU is determined and the OSU data stream is output from the slot payload area indicating an overhead of 01, as shown in fig. 4.

Step 5: the receiving side searches an OSU frame head indicating signal from the OSU data stream, and enters an OSU frame locking state when two continuous OSU frame head indicating signals are found and are separated by 12 16 byte blocks.

Step 6: in the OSU frame locking state, an offset n=2 is set, the current 16-byte block is taken as a counting start point, whether the first 4 bytes of the current 16-byte block are OSU frame header indication signals is detected from the 10 th (i.e. M-n=10) 16-byte block, the first 4 bytes of the current 16-byte block are OSU frame header indication signals detected from the 12 th (i.e. m1=12) 16-byte block, and since the current 16-byte block is 12=12, i.e. the last OSU frame only comprises 11 16-byte blocks, the current 16-byte block is incomplete, and a fixed sequence of 12+1-12 (i.e. m+1-M1) =1 needs to be supplemented to the last OSU frame, so that the length of the current 16-byte block is kept as shown in fig. 5.

Step 7: the next round of searching is continued with the 16 th byte block (i.e., m1=12) in step 6 as a starting point.

Example two

Step 1: at a source node, an OPU0 payload area is divided into 119 time slots, the length of each time slot is 130 bits, wherein the first 2 bits are indication overhead, the last 128 bits are payload areas, when the indication overhead is 01, OSU data loaded in the time slot payload areas are represented, and when the indication overhead is 10, filling is represented in the time slot payload areas; the OSU frame is 192 bytes long, i.e. 12 16 byte blocks, and the frame header of the OSU indicates that the overhead is located in the first 4 bytes of the first 16 byte block, as shown in fig. 2.

Step 3: it is assumed that during transmission, due to error code influence, the indication overhead of two time slots is changed from 10 to 01, i.e. the OSU data is filled and misplaced, resulting in that a certain OSU frame is increased by 216 byte blocks.

Step 4: on the receiving side, the slot carrying the OSU is determined and the OSU data stream is output from the slot payload area indicating an overhead of 01, as shown in fig. 6.

Step 6: in the OSU frame locking state, an offset n=4 is set, the current 16-byte block is taken as a counting start point, whether the first 4 bytes of the current 16-byte block are OSU frame header indication signals is detected from the 8 th (i.e. M-n=8) 16-byte block, the first 4 bytes of the current 16-byte block are OSU frame header indication signals is not detected in the 13 th (i.e. m+1=13) 16-byte block, the next 4 16-byte blocks are detected after the 13 th 16-byte block, the first 4 bytes of the current 16-byte block are OSU frame header indication signals are detected in the 15 th (i.e. m2=15) byte block due to the newly added 2 bytes, and the last 2 16-byte blocks are deleted due to the 14 length of the last OSU frame, so that the length of the OSU frame is kept as 12 16-byte blocks, as shown in fig. 7.

Step 7: the next round of searching is continued with the 15 th (i.e., m2=15) 16-byte block in step 6 as a starting point.

Example III

Step 3: it is assumed that during transmission, the indication overhead of a time slot is changed from 10 to 01 due to the influence of error codes, namely, OSU data is formed by filling errors; meanwhile, the frame header indication signal of one OSU frame is polluted, so that 116 byte block is added to one OSU frame, and the next OSU frame header is polluted and cannot be identified correctly.

Step 4: on the receiving side, the slot carrying the OSU is determined and the OSU data stream is output from the slot payload area indicating an overhead of 01, as shown in fig. 8.

Step 6: in the OSU frame locking state, an offset n=2 is set, the current 16-byte block is taken as a counting start point, whether the first 4 bytes of the current 16-byte block are OSU frame header indication signals is detected from the 10 th (i.e. M-n=10) 16-byte block, the first 4 bytes of the current 16-byte block are OSU frame header indication signals when the current 13 (i.e. m+1=13) 16-byte block is not detected, the next 2 consecutive 16-byte blocks of the current 13-byte block are detected, the next OSU frame header indication signals are polluted because 1 byte block is newly added, the previous 4 bytes of the current 16-byte block are not detected as OSU frame header indication signals when the current 2-byte block is not detected, the current 13 (i.e. m+1=13) 16-byte block is taken as a new start point, the OSU frame header indication signals are inserted into the first 4 bytes of the current 16-byte block, as shown in fig. 9, and the next round of searching is continued.

Step 7: on the basis of setting a new starting point in step 6, starting from the 10 th 16-byte block, detecting whether the first 4 bytes are OSU frame header indication signals, detecting that the first 4 bytes are OSU frame header indication signals in the 13 th (i.e. m+1=13) 16-byte block, detecting that the 13 th 16-byte block is followed by 2 consecutive 16-byte blocks, detecting that the first 4 bytes are OSU frame header indication signals in the 14 th (i.e. m2=14) byte block because the newly added 16-byte block is not deleted in step 6, deleting the last 1 16-byte block because the length of the last OSU frame is 13, and keeping the length of the OSU frame to be 12 16-byte blocks as shown in fig. 10.

Step 8: the next round of searching is continued with the 14 th (i.e., m2=14) 16-byte block in step 7 as a starting point.

Fig. 11 shows a schematic structural diagram of a service processing apparatus according to an embodiment of the present application, where the apparatus 1100 may include: a frame header detection module 1102 and an operation module 1104.

In one possible implementation, the frame header detection module 1102 is configured to perform a service container frame header detection process on a service container. An operation module 1104 is configured to perform a first operation on the service container according to a desired position and an actual position of the detected service container frame header, where the desired position is a position separated from a previous service container frame header by a service container length, and the first operation includes adding or deleting a fixed number of bits.

In the embodiment of the application, the business container frame header detection processing is carried out on the business container; performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits. In the embodiment of the application, under the condition that the frame head of the service container is not detected at the expected position, the fixed length of the service container is kept by adding or deleting the fixed number of bits, so that the frame failure of the service container is avoided, and the data loss is avoided.

Optionally, as an embodiment, the frame header detection module 1102 is configured to: determining an offset range; wherein the offset range includes: M-N-th L-bit block to m+n+1-th L-bit block from the start of counting; the counting starting point is an L bit block where the frame head of the last service container is located; n is a predefined value, N being used to determine the offset range; and detecting the frame header of the service container in the offset range.

Optionally, as an embodiment, the actual position is a position of an M1 st L-bit block from the counting start point, and the operation module 1104 is configured to add m+1-M1L-bit blocks to the service container, and use the actual position as the counting start point, where M1 is equal to or less than M, and M-M1 is equal to or less than N.

Optionally, as an embodiment, the actual position is a position of an M2 nd L-bit block from the counting start point, and the operation module 1104 is configured to delete the M2-M-1L-bit blocks of the service container, and take the actual position as the counting start point, where M2 > m+1, and M2 is less than or equal to m+n.

The apparatus 1100 provided in the embodiment of the present application may perform the methods described in the foregoing method embodiments, and implement the functions and beneficial effects of the methods described in the foregoing method embodiments, which are not described herein again.

Fig. 12 is a schematic diagram of a hardware structure of an electronic device provided by an embodiment of the present application, and referring to the figure, at a hardware level, the electronic device includes a processor, and optionally includes an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.

The processor, network interface, and memory may be interconnected by an internal bus, which may be an industry standard architecture (Industry Standard Architecture, ISA) bus, a peripheral component interconnect standard (PERIPHERAL COMPONENT INTERCONNECT, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in the figure, but not only one bus or one type of bus.

And the memory is used for storing programs. In particular, the program may include program code including computer-operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.

The processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs to form a device for locating the target user on a logic level. A processor executing the program stored in the memory, and specifically configured to execute: the embodiments of fig. 1-10 disclose the method and implement the functions and advantages of the methods described in the foregoing method embodiments, which are not described in detail herein.

The methods disclosed above in the embodiments of the present application shown in fig. 1-10 may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but may also be a digital signal Processor (DIGITAL SIGNAL Processor, DSP), application SPECIFIC INTEGRATED Circuit (ASIC), field-Programmable gate array (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic device, discrete gate or transistor logic device, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.

The electronic device may also execute the methods described in the foregoing method embodiments, and implement the functions and beneficial effects of the methods described in the foregoing method embodiments, which are not described herein.

Of course, other implementations, such as a logic device or a combination of hardware and software, are not excluded from the electronic device of the present application, that is, the execution subject of the following processing flows is not limited to each logic unit, but may be hardware or a logic device.

The embodiment of the present application further proposes a computer readable storage medium storing one or more programs that, when executed by an electronic device including a plurality of application programs, cause the electronic device to execute the method disclosed in the embodiment shown in fig. 1 to 10 and implement the functions and advantages of each method described in the foregoing method embodiment, which are not described herein again.

The computer readable storage medium includes Read-Only Memory (ROM), random access Memory (Random Access Memory RAM), magnetic disk or optical disk, etc.

Further, embodiments of the present application also provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, implement the following flow: the embodiments of fig. 1-10 disclose the method and implement the functions and advantages of the methods described in the foregoing method embodiments, which are not described in detail herein.

In summary, the foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.

The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.

Claims

1. A business processing method, comprising:

Carrying out service container frame header detection processing on the service container;

performing a first operation on the service container based on a desired position and the detected actual position of the service container frame header, the desired position being a position separated from the previous service container frame header by a service container length, the first operation comprising adding or deleting a fixed number of bits.

2. The method of claim 1, the performing service container frame header detection processing on the service container comprises:

Determining an offset range; wherein the offset range includes: M-N-th L-bit block to m+n+1-th L-bit block from the start of counting; the counting starting point is an L bit block where the frame head of the last service container is located; n is a predefined value, N being used to determine the offset range;

And detecting the frame header of the service container in the offset range.

3. The method of claim 1, the traffic container being M L-bit blocks in length, the traffic container comprising an overhead region and a payload region, the overhead region comprising a frame header overhead, M being a positive integer.

4. The method of claim 2, the actual position being a position of an M1 st L-bit block from the count start, the first operating on the traffic container based on the expected position and the detected actual position of the traffic container frame header comprising:

Adding M+1-M1L bit blocks to the service container, and taking the actual position as a counting starting point, wherein M1 is less than or equal to M, and M-M1 is less than or equal to N.

5. The method of claim 2, the actual position being a position of an M2 nd L-bit block from the count start, the first operating on the traffic container according to the expected position and the detected actual position of the traffic container frame header comprising:

and deleting M2-M-1L bit blocks of the service container, and taking the actual position as a counting starting point, wherein M2 is more than M+1, and M2 is less than or equal to M+N.

6. The method of claim 4 or 5, N being determined by at least one of: burst error length, traffic container rate.

7. The method of any one of claims 1 to 6, further comprising:

and if the frame head of the service container is detected at the expected position, taking the expected position as a counting starting point.

8. The method of any one of claims 2 to 6, further comprising:

and if the service container frame header is not detected within the offset range, taking the expected position as a counting starting point, and inserting the service container frame header into an L bit block of the expected position.

9. The method of claim 1, the method further comprising, prior to the first operation of the traffic container based on the desired location and the detected actual location of the traffic container header:

If a service container header is detected and a next service container header is detected after an interval of one service container length, a service container lock state is entered.

10. The method of claim 1, the method further comprising:

And if the frame head of the service container is not detected at the expected position for K times continuously, entering a service container unlocking state, wherein K is a positive integer greater than 1.

11. A traffic processing apparatus comprising:

the frame header detection module is used for carrying out service container frame header detection processing on the service container;

And the operation module is used for performing a first operation on the business container according to the expected position and the detected actual position of the business container frame head, wherein the expected position is a position separated from the last business container frame head by one business container length, and the first operation comprises adding or deleting a fixed number of bits.

12. The apparatus of claim 11, the frame header detection module to:

And detecting the frame header of the service container in the offset range.

13. The apparatus of claim 12, the actual position being a position of an M1 st L-bit block from the count start point, the operation module being configured to add m+1-M1L-bit blocks to the service container, the actual position being taken as the count start point, wherein M1 is less than or equal to M, and M-M1 is less than or equal to N.

14. The apparatus of claim 12, wherein the actual position is a position of an M2 nd L-bit block from the counting start point, and the operation module is configured to delete an M2-M-1L-bit block of the service container, and take the actual position as the counting start point, where M2 > m+1, and M2 is less than or equal to m+n.

15. An electronic device, comprising:

a processor; and

A memory arranged to store computer executable instructions which, when executed, use the processor to perform the steps of the business processing method of any of claims 1-10.

16. A computer readable medium storing one or more programs, which when executed by an electronic device comprising a plurality of application programs, cause the electronic device to perform the steps of the business processing method of any of claims 1-10.