Optical communication method, device and system

Abstract

An optical communication method, device and system are applied to a point-to-multipoint communication system comprising a root node and m leaf nodes, the root node transmits service data to at least one of the m leaf nodes through a downlink data frame, the downlink data frame comprises n time slots, m is an integer greater than or equal to 2, n is an integer greater than or equal to m, and n is an integer greater than or equal to 1. The method comprises the steps that a root node maps first service data to a first time slot of a downlink data frame according to a preset first corresponding relation, n time slots comprise the first time slot, and m leaf nodes comprise a first leaf node; the first corresponding relation indicates that the first leaf node receives the first service data from the root node through the first time slot; and the root node sends the downlink data frame. The technical scheme of the invention can be applied to the technical field of optical communication, and when service data transmission is carried out between a root node and a plurality of leaves in an OTN network, bandwidth can be allocated to leaf nodes more flexibly, bandwidth waste can be reduced, and communication cost can be saved.

Description

Technical Field

[0001] This application relates to the field of optical communication technologies, and more particularly, to an optical communication method, apparatus, and system. Background Art

[0002] An optical transport network (OTN) is a wavelength division multiplexing transport network interconnected based on optical fibers. Between two service optical ports (or a pair of service optical ports), interconnection is performed based on a wavelength of a certain width (for example, a spectral width of 50 GHz). A single optical fiber can achieve peer-to-peer rate interconnection of multiple pairs of service optical ports.

[0003] With the continuous improvement of the rate of optical modules, the rate of a single module has increased from the initial 2.5 gigabits per second (Gbps) to 400 Gbps and even higher. In the current OTN network, the service traffic presents a tree-shaped aggregation form, and the bandwidths of multiple leaf nodes are aggregated to a root node. Generally speaking, the bandwidth of a single leaf node is not large (for example, 10 Gbps). However, when multiple leaf nodes are aggregated to the root node, it will cause a sharp increase in the bandwidth of the root node. By performing point-to-multipoint optical port interconnection between a large-bandwidth optical port of the root node and small-bandwidth optical ports of multiple leaf nodes, the number of single boards and optical modules required by the root node can be reduced, thereby achieving power consumption and cost savings. In the current technology, multiple low-speed subcarriers are supported in the high-speed optical module of the root node, and the root node is interconnected with the low-speed optical modules of multiple leaf nodes through different subcarriers.

[0004] However, there are physical limitations in the division of subcarriers in the current high-speed optical module, resulting in a large bandwidth granularity for each subcarrier (for example, 25 Gbps). If the bandwidth required for the leaf node to actually transmit service data is less than the bandwidth of a single subcarrier, it will cause bandwidth waste. Summary of the Invention

[0005] This application provides an optical communication method, apparatus, and system, which can more flexibly allocate bandwidth to leaf nodes when transmitting service data between the root node and multiple leaves in an OTN network, can reduce bandwidth waste, and save communication costs.

[0006] In a first aspect, an optical communication method is provided, which is applied to a root node in a point-to-multipoint communication system. This method can be executed by the root node or by components of the root node (such as a chip or a chip system, etc.), and this application does not limit this. The point-to-multipoint communication system further includes m leaf nodes. The root node transmits service data to at least one of the m leaf nodes through a downlink data frame. The downlink data frame includes n time slots, where m is an integer greater than or equal to 2, and n is an integer greater than or equal to m. The method includes: mapping first service data to a first time slot of the downlink data frame according to a preset first correspondence relationship. The n time slots include the first time slot, and the m leaf nodes include a first leaf node; wherein, the first correspondence relationship indicates that the first leaf node receives the first service data from the root node through the first time slot; and sending the downlink data frame.

[0007] In some implementation manners, the m leaf nodes are in one-to-one correspondence with m of the n time slots; or, one of the m leaf nodes corresponds to one or more of the n time slots. The above "a leaf node corresponds to one or more time slots" can be understood as that the leaf node receives downlink service data from the root node through one or more time slots.

[0008] In some implementation manners, the first correspondence relationship can be pre-negotiated between the root node and the leaf node, or can also be pre-configured.

[0009] It should be noted that the first time slot can be one time slot, or can also include multiple time slots.

[0010] In the above technical solution, the downlink data frame is divided into multiple time slots, and the multiple time slots are respectively allocated to fixed leaf nodes. When the root node sends service data to the leaf node, the bandwidth can be flexibly adjusted, thereby reducing bandwidth waste. In addition, in the current PON network, the root node generally specifies the service data sent to a specific leaf node through a service label. Among them, the service label is, for example, the XGEM port identifier (Port-ID) in a 10-Gigabit passive optical network (XG-PON) encapsulation method (XGEM) frame. However, if an error occurs in the service label during the transmission process, the leaf node cannot determine whether the relevant service data is transmitted to itself. Therefore, in the above technical solution, the leaf node can receive service data through the time slot fixedly allocated to it. In this way, even if some fields of the data frame are lost during the transmission process, it does not affect the leaf node to receive the remaining part, which helps to improve the transmission efficiency of the service data.

[0011] In combination with the first aspect, in some implementations of the first aspect, the root node obtains service data from at least one of the m leaf nodes through an uplink data frame. The uplink data frame includes q time slots, where q is an integer greater than or equal to m. The method further includes: receiving the uplink data frame; obtaining second service data from the second time slot of the uplink data frame according to a preset second correspondence. The m leaf nodes include a second leaf node, and the q time slots include a second time slot; wherein, the second correspondence indicates that the root node receives the second service data from the second leaf node through the second time slot.

[0012] In some implementations, the second leaf node and the first leaf node may be the same leaf node. The second time slot may be one time slot, or may also include multiple time slots.

[0013] In the above technical solution, the uplink data frame is divided into multiple time slots, and the multiple time slots are respectively assigned to fixed leaf nodes. When the leaf nodes send service data to the root node, the bandwidth can be flexibly adjusted, thereby reducing bandwidth waste. In addition, the leaf nodes can send service data to the root node through the time slots fixedly allocated to themselves. In this way, even if some fields of the data frame are lost during transmission, the root node can determine which leaf node the service data specifically comes from, which helps to improve the transmission efficiency of the service data.

[0014] In combination with the first aspect, in some implementations of the first aspect, q is equal to n.

[0015] In some implementations, q, n, and m are all equal.

[0016] In the above technical solution, symmetric time slot division is performed on the uplink data frame and the downlink data frame, that is, the uplink and downlink data frames include the same time slots, which is convenient for the leaf nodes and the root node to manage the data frames.

[0017] In combination with the first aspect, in some implementations of the first aspect, the m leaf nodes further include a third leaf node and a fourth leaf node. There is a preset third correspondence between the third time slot of the data frame and the third leaf node, and there is a preset fourth correspondence between the fourth time slot of the data frame and the fourth leaf node. The check information carried by the third time slot and the fourth time slot is different; wherein, the data frame is a downlink data frame or an uplink data frame. The uplink data frame is used for the m leaf nodes to transmit service data to the root node. The third correspondence indicates that the third leaf node and the root node transmit service data through the third time slot, and the fourth correspondence indicates that the fourth leaf node and the root node transmit service data through the fourth time slot.

[0018] Exemplarily, the check information may be forward error correction (FEC) information, or may also be other information for detecting and / or correcting data transmission errors.

[0019] In the above technical solution, each time slot can carry a check information, which is used to check and correct the service data carried in the time slot, and helps to reduce the bit error rate of each time slot. When a certain time slot does not carry service data, there is no need to carry the check information, and the root node and the leaf node do not need to perform encoding and decoding operations on the check information, which helps to save power consumption.

[0020] Combined with the first aspect, in some implementation manners of the first aspect, the data frame includes multiple regions, each region includes an overhead region and a payload region, each of the multiple regions corresponds to a time slot, the data frame is a downlink data frame or an uplink data frame, and the uplink data frame is used for m leaf nodes to transmit service data to the root node.

[0021] Combined with the first aspect, in some implementation manners of the first aspect, the data frame includes an overhead region and a payload region, the payload region includes multiple regions, each of the multiple regions corresponds to a time slot, the data frame is a downlink data frame or an uplink data frame, and the uplink data frame is used for m leaf nodes to transmit service data to the root node.

[0022] Combined with the first aspect, in some implementation manners of the first aspect, the tail of the downlink data frame further includes a check field, and the check field is used to detect or correct transmission errors of the downlink data frame.

[0023] Exemplarily, the check field can carry check information such as FEC information.

[0024] Combined with the first aspect, in some implementation manners of the first aspect, the service data includes data of at least one of the following services: OTN service, Ethernet service, packet service, fronthaul service, synchronous digital hierarchy (SDH) service.

[0025] Combined with the first aspect, in some implementation manners of the first aspect, the first time slot includes N sub-time slots, and mapping the first service data to the first time slot of the downlink data frame includes: mapping the first service data to at least one of the N sub-time slots; where N is an integer greater than or equal to 2.

[0026] In the above technical solution, dividing the time slot into multiple sub-time slots can more flexibly carry OTN pipes with different rates.

[0027] Second aspect, a optical communication method is provided, which is applied to a first leaf node in a point-to-multipoint communication system. This method can be executed by the leaf node or by components of the leaf node (such as a chip or a chip system, etc.), and this application does not limit this. The point-to-multipoint communication system includes a root node and m leaf nodes, and the m leaf nodes include the first leaf node. The root node transmits service data to at least one of the m leaf nodes through a downlink data frame. The downlink data frame includes n time slots. m is an integer greater than or equal to 2, and n is an integer greater than or equal to m. This method includes: receiving the downlink data frame; obtaining first service data from a first time slot of the downlink data frame according to a preset first correspondence relationship. The n time slots include the first time slot; wherein, the first correspondence relationship indicates that the first leaf node receives the first service data from the root node through the first time slot.

[0028] In combination with the second aspect, in some implementation manners of the second aspect, the root node obtains service data from at least one of the m leaf nodes through an uplink data frame. The uplink data frame includes q time slots. q is an integer greater than or equal to m. This method further includes: mapping second service data to a second time slot of the uplink data frame according to a preset second correspondence relationship. The q time slots include the second time slot; wherein, the second correspondence relationship indicates that the root node receives the second service data from the first leaf node through the second time slot; sending the uplink data frame.

[0029] In combination with the second aspect, in some implementation manners of the second aspect, q is equal to n.

[0030] In combination with the second aspect, in some implementation manners of the second aspect, the m leaf nodes further include a third leaf node and a fourth leaf node. There is a preset third correspondence relationship between a third time slot of the data frame and the third leaf node, and there is a preset fourth correspondence relationship between a fourth time slot of the data frame and the fourth leaf node. The check information carried by the third time slot and the fourth time slot is different; wherein, the data frame is a downlink data frame or an uplink data frame. The uplink data frame is used for the m leaf nodes to transmit service data to the root node. The third correspondence relationship indicates that the third leaf node and the root node transmit service data through the third time slot, and the fourth correspondence relationship indicates that the fourth leaf node and the root node transmit service data through the fourth time slot.

[0031] In combination with the second aspect, in some implementation manners of the second aspect, the data frame includes multiple regions, and each region includes an overhead region and a payload region. Each region in the multiple regions corresponds to a time slot. The data frame is a downlink data frame or an uplink data frame. The uplink data frame is used for the m leaf nodes to transmit service data to the root node.

[0032] In combination with the second aspect, in some implementations of the second aspect, the data frame includes an overhead area and a payload area. The payload area includes multiple regions, and each region in the multiple regions corresponds to a time slot. The data frame is a downlink data frame or an uplink data frame, and the uplink data frame is used for m leaf nodes to transmit service data to the root node.

[0033] In combination with the second aspect, in some implementations of the second aspect, the tail of the downlink data frame further includes a check field, and the check field is used to detect or correct transmission errors of the downlink data frame.

[0034] In combination with the second aspect, in some implementations of the second aspect, the service data includes data of any one of the following services: optical transport network (OTN) service, Ethernet service, packet service, fronthaul service, SDH service.

[0035] In a third aspect, an embodiment of the present application provides an optical communication device. The device is used to execute the method provided in the first aspect above, or is used to execute the method provided in the second aspect above. Specifically, the device may include units and / or modules for executing the method provided in the first aspect or any one of the above implementations of the first aspect. Alternatively, the device may include units and / or modules for executing the method provided in the second aspect or any one of the above implementations of the second aspect, such as a processing module and a transceiver module.

[0036] In one implementation, the optical communication device may include units and / or modules for executing the method provided in the first aspect or any one of the above implementations of the first aspect, and is the root node. The transceiver module may be a transceiver, or an input / output interface. The processing module may be at least one processor. Optionally, the transceiver may be a transceiver circuit. Optionally, the input / output interface may be an input / output circuit.

[0037] Alternatively, the optical communication device is a chip, a chip system, or a circuit in the root node. The transceiver module may be an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or a related circuit, etc. on the chip, the chip system, or the circuit. The processing module may be at least one processor, a processing circuit, or a logic circuit, etc.

[0038] In another implementation, the optical communication device may include units and / or modules for executing the method provided in the second aspect or any one of the above implementations of the second aspect, and is a leaf node. The transceiver module may be a transceiver, or an input / output interface. The processing module may be at least one processor. Optionally, the transceiver may be a transceiver circuit. Optionally, the input / output interface may be an input / output circuit.

[0039] Alternatively, the optical communication device is a chip, a chip system, or a circuit in the leaf node. The transceiver module may be an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or a related circuit, etc. on the chip, the chip system, or the circuit. The processing module may be at least one processor, a processing circuit, or a logic circuit, etc.

[0040] In a fourth aspect, an embodiment of the present application provides a processor for executing the methods provided in the above aspects.

[0041] For operations such as sending and obtaining / receiving performed by the processor, if there is no special description, or if it does not conflict with its actual role or internal logic in the relevant description, it can be understood as operations such as outputting, receiving, and inputting by the processor, or it can also be understood as sending and receiving operations performed by the radio frequency circuit and the antenna. The present application does not make any limitations in this regard.

[0042] In a fifth aspect, an embodiment of the present application provides an optical communication system. The system may include a root node and at least one leaf node. The root node may execute the method provided in any one of the implementation manners in the above first aspect, and at least one root node may execute the method provided in any one of the implementation manners in the above second aspect.

[0043] In a sixth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium stores program code for a device to execute. The program code includes the method provided in any one of the implementation manners in the above first aspect or second aspect.

[0044] In a seventh aspect, an embodiment of the present application provides a computer program product containing instructions. When the computer program product runs on a computer, it causes the computer to execute the method provided in any one of the implementation manners in the above first aspect or second aspect.

[0045] In an eighth aspect, an embodiment of the present application provides a chip. The chip includes a processor and a communication interface. The processor reads instructions stored on a memory through the communication interface and executes the method provided in any one of the implementation manners in the above first aspect or second aspect.

[0046] Optionally, as an implementation manner, the chip further includes a memory. A computer program or instructions are stored in the memory. The processor is used to execute the computer program or instructions stored on the memory. When the computer program or instructions are executed, the processor is used to execute the method provided in any one of the implementation manners in the above first aspect or second aspect.

[0047] For the beneficial effects brought by the above second aspect to the eighth aspect, reference may specifically be made to the description of the beneficial effects in the first aspect or the second aspect, and details are not described herein again. Description of the Drawings

[0048] Figure 1 Shows a schematic diagram of an optical communication system involved in an embodiment of the present application.

[0049] Figure 2 Is a schematic diagram of the hardware structure of an OTN device provided by an embodiment of the present application.

[0050] Figure 3 Shows a schematic diagram of a data frame provided by an embodiment of the present application.

[0051] Figure 4 Shows another schematic diagram of a data frame provided by an embodiment of the present application.

[0052] Figure 5 Shows yet another schematic diagram of a data frame provided by an embodiment of the present application.

[0053] Figure 6 Shows a schematic diagram of a downlink data frame provided by an embodiment of the present application.

[0054] Figure 7 Shows a schematic flowchart of an optical communication method provided by an embodiment of the present application.

[0055] Figure 8 Is a schematic block diagram of an optical communication device provided by an embodiment of the present application.

[0056] Figure 9 Is another schematic block diagram of an optical communication device provided by an embodiment of the present application. Detailed implementation manners

[0057] Next, the technical solutions in the present application will be described in conjunction with the accompanying drawings.

[0058] The embodiments of the present application are applicable to point-to-multipoint (PTPM or P2MP) networks or systems. As Figure 1 shown, this network or system includes a root node and multiple leaf nodes, and there is a two-way communication capability between the root node and any leaf node. The root node can be connected to the leaf nodes through various physical connection methods or networking methods. For example, the root node can be connected to each leaf node through multiple local ports, or it can be connected to a splitting device through one local port, and then the splitting device is connected to multiple leaf nodes. More specifically, the tree structure of the PTMP system can be a first-level tree structure, as shown in Figure 1 (a) of, the root node is connected to different leaf nodes through a first-level splitting device. Or, the tree structure of the PTMP system can also be a multi-level tree structure, as shown in Figure 1 (b) of, the root node is connected to different leaf nodes through a multi-level splitting device.

[0059] The PTMP system of this application can be applied to an OTN system, a PON system, or a metropolitan area system. In the OTN system or the PON system, both the root node and the leaf node are OTN devices. In the metropolitan area system, the root node corresponds to an aggregation node (AGG), and the leaf node corresponds to an access node (ACC).

[0060] It should be understood that the number of leaf nodes is greater than or equal to the number of root nodes. For example, in the PON scenario, generally one root node corresponds to multiple leaf nodes, and in the metropolitan area scenario, generally two root nodes (aggregation nodes) correspond to multiple leaf nodes (access nodes).

[0061] In actual implementation, the hardware structure of the OTN device can be as Figure 2 shown. For example, the OTN device 200 includes a tributary board 201, a cross-connect board 202, a line board 203, an optical layer processing single board (not shown in the figure), and a system control and communication single board 204.

[0062] The tributary board 201, the cross-connect board 202, and the line board 203 are used to process the electrical layer signals of the OTN. Among them, the tributary board 201 is used to implement the reception and transmission of various client services, such as SDH services, packet services, Ethernet services, and fronthaul services, etc. Further, the tributary board 201 can be divided into a client-side optical transceiver module and a signal processor. Among them, the client-side optical transceiver module can also be called an optical transceiver, which is used to receive and / or transmit service data. The signal processor is used to implement the mapping and demapping processing of service data to data frames. The cross-connect board 202 is used to implement the exchange of data frames and complete the exchange of one or more types of data frames. The line board 203 mainly implements the processing of line-side data frames. Specifically, the line board 203 can be divided into a line-side optical module and a signal processor. Among them, the line-side optical module can be called an optical transceiver, which is used to receive and / or transmit data frames. The signal processor is used to implement the multiplexing and demultiplexing, or mapping and demapping processing of the line-side data frames. The system control and communication single board 204 is used to implement system control. Specifically, it can collect information from different single boards or send control instructions to the corresponding single boards. It should be noted that unless otherwise specified, the specific components (such as signal processors) can be one or more, and this application does not make any restrictions. It should also be noted that this application does not make any restrictions on the type of single boards included in the device, the functional design, and the number of single boards. It should be noted that in specific implementations, the above two single boards may also be designed as one single board. In addition, the OTN device may also include a power supply for backup, a fan for heat dissipation, etc.

[0063] As described above, in the current OTN network, in the high-speed optical module for transmitting and receiving data frames between the root node and multiple leaf nodes, there are physical limitations in the division of subcarriers, and the bandwidth granularity of each subcarrier is relatively large. If the bandwidth required by the leaf node during actual service transmission is less than the bandwidth of one subcarrier, there may be bandwidth waste.

[0064] To solve the above problems, embodiments of the present application provide an optical communication method, apparatus, and system, which divide the uplink and downlink transmission cycles into multiple transmission cycles, and each cycle includes multiple time slots. Each time slot in the multiple time slots is used for the root node to transmit service data with a fixed leaf node. It should be noted that in the present application, the downlink refers to the communication from the root node to the leaf node direction; the uplink refers to the communication from the leaf node to the root node direction.

[0065] Figure 3 Shows a schematic diagram of an uplink data frame provided by an embodiment of the present application. As Figure 3 shown, the uplink data frame includes p time slots, and the length of each time slot is a microseconds (μs), that is, the length of the uplink data frame is p×a μs. Each time slot includes an uplink delimiter field, an uplink overhead field, a payload area, and a check field. Among them, the payload area is used to carry service data, the uplink delimiter field may include a guard time and a preamble, and the check field is used to detect or correct transmission errors in this time slot.

[0066] In some implementation manners, Figure 3 If the uplink data frame shown is applied to the communication between one root node and m leaf nodes, each of the m time slots in the p time slots can be fixedly allocated to the m leaf nodes, where m is less than or equal to p. For example, the first time slot in the p time slots is allocated to leaf node 1, the second time slot in the p time slots is allocated to leaf node 2, and so on. If leaf node 1 has service data to report to the root node in the current transmission cycle, then leaf node 1 maps the service data to be reported in the first time slot of the uplink data frame and sends it; if leaf node 2 has no service data to report to the root node in the current transmission cycle, then the second time slot of the uplink data frame is idle, that is, it does not carry any data.

[0067] In other implementation manners, Figure 3 If the uplink data frame shown is applied to the communication between one root node and m leaf nodes, the p time slots can be respectively allocated to the m leaf nodes. For example, one or more of the p time slots are fixedly allocated to one of the m leaf nodes.

[0068] It should be noted that the time slot in the present application can also be referred to as a burst time.

[0069] Figure 4 It shows a schematic diagram of a downlink data frame provided by an embodiment of the present application. As Figure 4 shown, the uplink data frame includes n time slots, each time slot having a length of b μs, that is, the length of the downlink data frame is n×b μs. Each time slot includes a downlink delimiter field, a downlink overhead field, a payload area, and a check field. Among them, the payload area is used to carry service data. The downlink delimiter field may include padding, and the check field is used to detect or correct transmission errors in this time slot.

[0070] In some implementation manners, Figure 4 if the shown downlink data frame is applied to the communication between a root node and m leaf nodes, then each of the m time slots among the n time slots can be fixedly allocated to the m leaf nodes, where m is less than or equal to n. For example, the first time slot among the n time slots is allocated to leaf node 1, the second time slot among the n time slots is allocated to leaf node 2, and so on. If there is service data to be transmitted to leaf node 1 in the current transmission period, the root node maps the service data to be transmitted to leaf node 1 in the first time slot of the downlink data frame and sends it; if there is no service data to be transmitted to leaf node 1 in the current transmission period, the second time slot of the downlink data frame is idle, that is, it does not carry any data.

[0071] In some other implementation manners, Figure 3 if the shown downlink data frame is applied to the communication between a root node and m leaf nodes, then the n time slots can be respectively allocated to the m leaf nodes. For example, one or more of the n time slots are fixedly allocated to one of the m leaf nodes.

[0072] In some implementation manners, when a certain time slot in the uplink data frame or the downlink data frame does not carry service data, the encoding and decoding functions of the check field in this time slot can be turned off, that is, the root node and the leaf nodes do not need to perform encoding and decoding operations on the check information either.

[0073] It should be noted that in actual implementation, n and p may be the same or different, and a and b may be the same or different.

[0074] In some implementations, the uplink data frame and / or downlink data frame provided by the embodiments of the present application can also be used to carry OTN signals. Exemplarily, the root node and / or leaf node can map service data into an OTN pipeline, and then map the OTN pipeline into the payload area of the relevant time slot, and then send the OTN signal through the uplink data frame or downlink data frame. Among them, if the service data is the data sent by the root node to a certain leaf node, the above-mentioned relevant time slot is the time slot in the downlink data frame for transmitting service data to the leaf node; if the service data is the data sent by a certain leaf node to the root node, the above-mentioned relevant time slot is the time slot in the uplink data frame for the leaf node to report its service data.

[0075] More specifically, the M-byte interleaving method can be used to define N sub-time slots in a time slot of the uplink / downlink data frame. The rate supported by each sub-time slot can be 1.25 Gbps, or it can also be 2.5 Gbps, or it can also be other rates. As Figure 5 shown, the service data can be mapped into an Optical Data Unit k (ODUk) frame, and then the ODUk frame can be mapped into one or more of the N sub-time slots. After adding sub-time slot overhead (OH) to the N sub-time slots, it is mapped into the payload area of a time slot of the data frame.

[0076] In some implementations, the structure of the downlink data frame can also be as Figure 6 shown, that is, the data frame includes an overhead area and a payload area. The overhead area can include n areas, for example, payload area 1, payload area 2... payload area n. Among them, each of the n areas corresponds to a time slot. For example, payload area 1 is used to carry the service data that needs to be sent in time slot 1, payload area 2 is used to carry the service data that needs to be sent in time slot 2, and so on.

[0077] Based on the above solution, when transmitting service data between the root node and multiple leaves in the OTN network, the bandwidth can be allocated to the leaf nodes more flexibly, which can reduce bandwidth waste and save communication costs.

[0078] Figure 7 shows a schematic flowchart of an optical communication method provided by the present application. As Figure 7 shown, this method can be executed by the root node and the first leaf node. Among them, the root node can be the Figure 1 shown root node or its components (such as a chip or a chip system, etc.), and the first leaf node can be the Figure 1Any of the leaf nodes shown or its components (such as chips or chip systems, etc.). Exemplarily, in the PTMP system where the root node and the first leaf node are located, there may be m leaf nodes including the first leaf node. Specifically, the method may include some or all of the steps from S701 to S706.

[0079] S701, the root node maps the first service data to the first time slot of the downlink data frame according to a preset first correspondence.

[0080] Among them, the downlink data frame may include the downlink data frame in the above embodiments. The first correspondence indicates that the first leaf node receives the first service data from the root node through the first time slot, that is, the first correspondence may be a relationship in which the first time slot is fixedly allocated to the first leaf node to transmit downlink service data.

[0081] S702, the root node sends the downlink data frame.

[0082] It should be noted that the root node may send the downlink data frame to each of the m leaf nodes, for example, send the downlink data frame to the m leaf nodes by broadcasting.

[0083] S703, the first leaf node obtains the first service data from the first time slot of the downlink data frame according to the first correspondence.

[0084] Exemplarily, the first leaf node may determine the first time slot according to the first correspondence, and then demap the first service data from the first time slot of the downlink data frame.

[0085] In some implementation manners, the m leaf nodes further include a third leaf node, there is a preset third correspondence between the third time slot of the downlink data frame and the third leaf node, and the check information carried by the first time slot and the third time slot is different; among them, the third correspondence indicates that the third leaf node receives the service data from the root node through the third time slot.

[0086] S704, the first leaf node maps the second service data to the second time slot of the uplink data frame according to a preset second correspondence.

[0087] Among them, the uplink data frame may include the uplink data frame in the above embodiments. The second correspondence indicates that the first leaf node sends the second service data to the root node through the second time slot, that is, the second correspondence may be a relationship in which the second time slot is fixedly allocated to the first leaf node to transmit uplink service data.

[0088] S705, the first leaf node sends the uplink data frame to the root node.

[0089] S706, the root node obtains the second service data from the second time slot of the uplink data frame according to the second correspondence relationship.

[0090] Exemplarily, the root node can determine the second time slot according to the second correspondence relationship, and then demap the second service data from the second time slot of the uplink data frame.

[0091] It can be understood that the root node can demap and obtain the uplink service data reported by each of the m leaf nodes from the time slots allocated to the m leaf nodes respectively.

[0092] In some implementation manners, the m leaf nodes further include a fourth leaf node. There is a preset fourth correspondence relationship between the fourth time slot of the uplink data frame and the fourth leaf node, and the check information carried by the second time slot and the fourth time slot is different; wherein, the fourth correspondence relationship indicates that the fourth leaf node sends service data to the root node through the fourth time slot.

[0093] In actual implementation, S701 to S703 can be executed between the root node and the leaf nodes, or S704 to S706 can be executed, or all of them can also be executed.

[0094] In some implementation manners, the data frame includes multiple regions, each region includes an overhead region and a payload region, each of the multiple regions corresponds to a time slot, and the data frame is a downlink data frame or an uplink data frame. For example, as Figure 3 、 Figure 4 shown.

[0095] In some implementation manners, the data frame includes an overhead region and a payload region, the payload region includes multiple regions, each of the multiple regions corresponds to a time slot, and the data frame is a downlink data frame or an uplink data frame. For example, as Figure 5 shown.

[0096] The optical communication method provided by the embodiments of the present application helps to flexibly allocate bandwidth in the PTMP network, thereby reducing bandwidth waste. In addition, between the leaf nodes and the root node, it is not necessary to rely on a service label similar to the XGEM Port-ID to indicate the source of the service data, but to transmit the service data through fixed time slots. Even if some fields of the data frame are lost during the transmission process, it does not affect the leaf data to receive the remaining part, which helps to improve the transmission efficiency of the service data.

[0097] The above combines Figures 1 to 7 to illustrate the optical communication method provided by the embodiments of the present application. In each embodiment of the present application, if there is no special description and logical conflict, the terms and / or descriptions between the embodiments are consistent and can be mutually referred to, and the technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0098] The following will Figure 8 and Figure 9 describe in detail the optical communication device provided in the embodiments of the present application. It should be understood that the description of the device embodiments corresponds to the description of the method embodiments. Therefore, for the content not described in detail, reference can be made to the above method embodiments. For the sake of brevity, some content will not be elaborated again.

[0099] Figure 8 FIG. is a schematic block diagram of an optical communication device 1000 provided in an embodiment of the present application. The device 1000 includes a transceiver module 1001, and the transceiver module 1001 can be used to implement corresponding transceiver functions. The transceiver module 1001 can also be referred to as a transceiver unit.

[0100] The device 1000 further includes a processing module 1002 (or referred to as a processing unit), and the processing module 1002 can be used to implement corresponding processing functions.

[0101] Optionally, the device 1000 further includes a storage unit, and the storage unit can be used to store instructions and / or data. The processing module 1002 can read the instructions and / or data in the storage unit so that the device can implement the actions of the relevant devices in the foregoing method embodiments.

[0102] The device 1000 can be used to perform the actions executed by the root node or leaf node (such as the first leaf node) in the foregoing method embodiments. At this time, the device 1000 can be a component of the root node or leaf node. The transceiver module 1001 is used to perform the transceiver-related operations of the root node or leaf node in the foregoing method embodiments, and the processing module 1002 is used to perform the processing-related operations of the root node or leaf node in the foregoing method embodiments.

[0103] It should be understood that the specific processes for each module to execute the above corresponding steps have been described in detail in the foregoing method embodiments. For the sake of brevity, they will not be elaborated here.

[0104] It should also be understood that the device 1000 is embodied in the form of functional units here. The term "module" or "unit" here can refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor or a group of processors, etc.) for executing one or more software or firmware programs, and a memory, a combined logic circuit and / or other suitable components that support the described functions. In an alternative example, those skilled in the art can understand that the device 1000 can specifically be the root node or leaf node in the above embodiments, and can be used to execute the respective processes and / or steps corresponding to the communication device in the above method embodiments. To avoid repetition, they will not be elaborated here.

[0105] The apparatus 1000 of each of the above solutions has the function of implementing the corresponding steps performed by the optical communication apparatus (such as a root node or a leaf node) in the above method. This function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the transceiver module can be replaced by a transceiver (for example, the transmitting module in the transceiver module can be replaced by a transmitter, and the receiving module in the transceiver module can be replaced by a receiver), and other modules, such as the processing module, etc., can be replaced by a processor to respectively perform the transceiver operations and related processing operations in each method embodiment.

[0106] In addition, the above transceiver module 1001 can also be a transceiver circuit (for example, it can include a transmitting circuit, or can also include a receiving circuit), and the processing module 1002 can be a processing circuit.

[0107] It should be noted that Figure 8 the apparatus in can be the optical communication apparatus (such as a root node or a leaf node) in the foregoing embodiments, or can be a chip or a chip system, for example: a system on chip (SoC). Among them, the transceiver module can be an input / output circuit, a communication interface; the processing module is a processor or a microprocessor or an integrated circuit integrated on the chip. It is not limited here.

[0108] Figure 9 Another schematic diagram of the optical communication apparatus provided by the embodiment of the present application is shown. As Figure 9 shown, the apparatus includes a processor 1101 and an optical transceiver 1102. This apparatus 1100 can be applied to both the root node and the leaf node.

[0109] When applied to the root node, the processor 1101 is used to implement Figure 7 the processing actions performed by the root node in, such as S601 and / or S606, and the transceiver 1102 is used to implement Figure 7 the transceiver actions performed by the root node in, such as S602 and / or S605. When applied to the leaf node, the processor 1101 is used to implement Figure 7 the processing actions performed by the leaf node in, such as S603 and / or S604, and the optical transceiver 1102 is used to implement Figure 7 the transceiver actions performed by the leaf node in, such as S602 and / or S605. In the implementation process, each step of the processing flow can be completed by the integrated logic circuit of the hardware in the processor 1101 or by instructions in the form of software.

[0110] In the embodiments of the present application, the processor 1101 may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware and software units in the processor.

[0111] In addition, the device 1100 may include one or more processors 1101.

[0112] Optionally, the device 1100 may further include a memory 1103, wherein the program code executed by the processor 1101 for implementing the above method may be stored in the memory 1103. The memory 1103 included in the device 1100 may be one or more.

[0113] Specifically, the memory 1103 may be coupled to the processor 1101. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, and may be electrical, mechanical, or other forms, for information interaction between devices, units, or modules. Alternatively, the processor 1101 may cooperate with the memory 1103. The memory 1103 is any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. It should be noted that Figure 9 The above-mentioned device can also be used to execute the method steps involved in the variations of the embodiments shown in the foregoing drawings, which will not be elaborated here.

[0114] It should be understood that the processor mentioned in the embodiments of the present application may be a central processing unit (CPU), and may also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0115] It should also be understood that the memory mentioned in the embodiments of the present application may be a volatile memory and / or a non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM). For example, the RAM can be used as an external cache. By way of example and not limitation, the RAM may include the following various forms: static random access memory (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM).

[0116] It should be noted that when the processor is a general-purpose processor, a DSP, an ASIC, an FPGA, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, the memory (storage module) may be integrated in the processor.

[0117] The embodiments of the present application also provide a computer-readable storage medium, on which computer instructions for implementing the methods executed by the optical communication device (such as a root node or a leaf node) in the above method embodiments are stored.

[0118] For example, when the computer program is executed by a computer, the computer can implement the methods executed by the optical communication device (such as a root node or a leaf node) in the above method embodiments.

[0119] The embodiments of the present application also provide a computer program product, including instructions that, when executed by a computer, implement the methods executed by the communication device (such as a root node or a leaf node) in the above method embodiments.

[0120] The explanations and beneficial effects of the relevant content in any of the above-mentioned devices can refer to the corresponding method embodiments provided above, and will not be repeated here.

[0121] In the description of the embodiments of the present application, unless otherwise specified, " / " means "or". For example, A / B may mean A or B; herein, "and / or" is a relationship describing associated objects, indicating that there can be three relationships. For example, A and / or B may mean: A exists alone, A and B exist simultaneously, and B exists alone. In the present application, "at least one" means one or more, and "a plurality" means two or more. "At least one (item)" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural item(s). For example, at least one (item) of a, b, or c may mean: a, b, c, a - b, a - c, b - c, or a - b - c, where a, b, and c may be single or multiple.

[0122] In the embodiments of the present application, prefix words such as "first" and "second" are only used to distinguish different described objects, and have no restrictive effect on the position, order, priority, quantity, content, etc. of the described objects. In the embodiments of the present application, the use of ordinal numbers and other prefix words for distinguishing described objects does not constitute a limitation on the described objects. For the statement of the described objects, refer to the description in the claims or the context of the embodiments. It should not be construed as an unnecessary limitation due to the use of such prefix words.

[0123] Those of ordinary skill in the art can realize that the units and steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. A professional technician can use different methods for each specific application to implement the described functions; such implementation should not be considered to exceed the protection scope of the present application.

[0124] In several embodiments provided by the present application, it should be understood that the disclosed device and method can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed coupling or direct coupling or communication connection to each other can be through some interfaces. The indirect coupling or communication connection of the devices or units can be in an electrical, mechanical, or other form.

[0125] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. For example, the computer can be a personal computer, a server, or a network device, etc. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that the computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid state disk (SSD), etc.). For example, the foregoing available media can include, but are not limited to: USB flash drive, removable hard disk, ROM, RAM, magnetic disk, or optical disc, etc., various media that can store program code.

[0126] As described above, the above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application, and all should be covered by the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims. Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the above-described systems, devices, and units can refer to the corresponding processes in the foregoing method embodiments, and will not be repeated herein.

Claims

1. An optical communication method, characterized in that, Applied to the root node in a point-to-multipoint communication system, the point-to-multipoint communication system further includes m leaf nodes, and the root node transmits service data to at least one of the m leaf nodes through a downlink data frame. The downlink data frame includes n time slots, m is an integer greater than or equal to 2, and n is an integer greater than or equal to m. The method includes: Mapping first service data to a first time slot of the downlink data frame according to a preset first correspondence. The n time slots include the first time slot, and the m leaf nodes include a first leaf node; Wherein, the first correspondence indicates that the first leaf node receives the first service data from the root node through the first time slot; Sending the downlink data frame.

2. The method according to claim 1, characterized in that, The root node obtains service data from at least one of the m leaf nodes through an uplink data frame. The uplink data frame includes q time slots, and q is an integer greater than or equal to m. The method further includes: Receiving the uplink data frame; Obtaining second service data from a second time slot of the uplink data frame according to a preset second correspondence. The m leaf nodes include a second leaf node, and the q time slots include the second time slot; Wherein, the second correspondence indicates that the root node receives the second service data from the second leaf node through the second time slot.

3. The method according to claim 2, wherein q is equal to n.

4. The method according to any one of claims 1 to 3, characterized in that, The m leaf nodes further include a third leaf node and a fourth leaf node. There is a preset third correspondence between the third time slot of the data frame and the third leaf node, and there is a preset fourth correspondence between the fourth time slot of the data frame and the fourth leaf node. The check information carried in the third time slot and the fourth time slot is different; Wherein, the data frame is the downlink data frame or the uplink data frame. The uplink data frame is used for the m leaf nodes to transmit service data to the root node. The third correspondence indicates that the third leaf node and the root node transmit service data through the third time slot, and the fourth correspondence indicates that the fourth leaf node and the root node transmit service data through the fourth time slot.

5. The method according to any one of claims 1 to 4, characterized in that, The data frame includes multiple regions, each region in the multiple regions corresponds to a time slot, and each region includes an overhead region and a payload region. The data frame is the downlink data frame or the uplink data frame, and the uplink data frame is used for the m leaf nodes to transmit service data to the root node.

6. The method according to any one of claims 1 to 4, characterized in that The data frame includes an overhead region and a payload region. The payload region includes multiple regions, each region in the multiple regions corresponds to a time slot. The data frame is the downlink data frame or the uplink data frame, and the uplink data frame is used for the m leaf nodes to transmit service data to the root node.

7. The method according to any one of claims 1 to 6, characterized in that The tail of the downlink data frame further includes a check field, and the check field is used to detect or correct transmission errors of the downlink data frame.

8. The method according to any one of claims 1 to 7, characterized in that The service data includes data of at least one of the following services: optical transport network (OTN) service, Ethernet service, packet service, fronthaul service, synchronous digital hierarchy (SDH) service.

9. An optical communication method, characterized in that, The first leaf node applied to a point-to-multipoint communication system, the point-to-multipoint communication system includes a root node and m leaf nodes, the m leaf nodes include the first leaf node, the root node transmits service data to at least one of the m leaf nodes through a downlink data frame, the downlink data frame includes n time slots, m is an integer greater than or equal to 2, n is an integer greater than or equal to m, the method includes: Receiving the downlink data frame; Obtaining first service data from a first time slot of the downlink data frame according to a preset first correspondence, the n time slots include the first time slot; Wherein, the first correspondence indicates that the first leaf node receives the first service data from the root node through the first time slot.

10. The method according to claim 9, wherein The root node obtains service data from at least one of the m leaf nodes through an uplink data frame, the uplink data frame includes q time slots, q is an integer greater than or equal to m, the method further includes: Mapping second service data to a second time slot of the uplink data frame according to a preset second correspondence, the q time slots include the second time slot; Wherein, the second correspondence indicates that the root node receives the second service data from the first leaf node through the second time slot; Sending the uplink data frame.

11. The method according to claim 10, wherein q is equal to n.

12. The method according to any one of claims 9 to 11, characterized in that, The m leaf nodes further include a third leaf node and a fourth leaf node, there is a preset third correspondence between a third time slot of the data frame and the third leaf node, there is a preset fourth correspondence between a fourth time slot of the data frame and the fourth leaf node, and the check information carried by the third time slot and the fourth time slot is different; Wherein, the data frame is the downlink data frame or the uplink data frame, the uplink data frame is used for the m leaf nodes to transmit service data to the root node, the third correspondence indicates that the third leaf node and the root node transmit service data through the third time slot, and the fourth correspondence indicates that the fourth leaf node and the root node transmit service data through the fourth time slot.

13. The method according to any one of claims 9 to 12, characterized in that, The data frame includes multiple regions, each region in the multiple regions corresponds to a time slot, each region includes an overhead region and a payload region, the data frame is the downlink data frame or the uplink data frame, and the uplink data frame is used for the m leaf nodes to transmit service data to the root node.

14. The method according to any one of claims 9 to 12, characterized in that The data frame includes an overhead region and a payload region, the payload region includes multiple regions, each region in the multiple regions corresponds to a time slot, the data frame is the downlink data frame or the uplink data frame, and the uplink data frame is used for the m leaf nodes to transmit service data to the root node.

15. The method according to any one of claims 9 to 14, characterized in that, The tail of the downlink data frame further includes a check field, and the check field is used to detect or correct the transmission error of the downlink data frame.

16. The method according to any one of claims 9 to 15, characterized in that, The service data includes data of at least one of the following services: optical transport network (OTN) service, Ethernet service, packet service, fronthaul service, synchronous digital hierarchy (SDH) service.

17. An optical communication device, characterized in that, Including: A module for performing the method according to any one of claims 1 to 8, or a module for performing the method according to any one of claims 9 to 16.

18. An optical communication device, characterized in that, Comprising at least one processor, the at least one processor being coupled to at least one memory, the at least one processor being configured to execute a computer program or instructions stored in the at least one memory to cause the apparatus to perform the method according to any one of claims 1 to 8, or the method according to any one of claims 9 to 16.

19. A communication system, characterized in that, Comprising a root node and at least one leaf node; wherein the root node is configured to perform the method according to any one of claims 1 to 8, the at least one leaf node is configured to perform the method according to any one of claims 9 to 16.

20. A chip, characterized in that, The chip comprises a processor and a communication interface, the communication interface being configured to receive a data frame and transmit it to the processor or send the data frame to another communication device other than the communication device comprising the chip, the processor being configured to perform the method according to any one of claims 1 to 8, or the method according to any one of claims 9 to 16.

Images