WO2024001220A1 - Procédé de découpage en tranches, procédé de traitement de service, noeud de communication et support de stockage - Google Patents

Procédé de découpage en tranches, procédé de traitement de service, noeud de communication et support de stockage Download PDF

Info

Publication number
WO2024001220A1
WO2024001220A1 PCT/CN2023/076668 CN2023076668W WO2024001220A1 WO 2024001220 A1 WO2024001220 A1 WO 2024001220A1 CN 2023076668 W CN2023076668 W CN 2023076668W WO 2024001220 A1 WO2024001220 A1 WO 2024001220A1
Authority
WO
WIPO (PCT)
Prior art keywords
slice
frame
block
service data
frame slice
Prior art date
Application number
PCT/CN2023/076668
Other languages
English (en)
Chinese (zh)
Inventor
陈捷
陈毓锋
方勇
沈剑峰
刘爱华
刘峰
杨剑
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024001220A1 publication Critical patent/WO2024001220A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/09—Mapping addresses
    • H04L61/25—Mapping addresses of the same type
    • H04L61/2503—Translation of Internet protocol [IP] addresses
    • H04L61/2592—Translation of Internet protocol [IP] addresses using tunnelling or encapsulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation

Definitions

  • This application relates to the field of communication technology, for example, to a slicing method, a business processing method, a communication node and a storage medium.
  • the bearer network for comprehensive services will cover tens of millions of industries. Various services have hugely different network requirements.
  • the network requires end-to-end slicing to ensure differentiated bearer of services. Many new industries also need to be isolated through network slicing.
  • Slicing Packet Network (SPN)/Metro Transport Network (MTN)/Flexible Ethernet (FlexE) as the service layer realizes end-to-end service rigid pipelines and is based on fine-grained Technology performs slotted slicing to refine the fine-grained slot bandwidth to a minimum granularity of 10Mb/s.
  • SPN Slicing Packet Network
  • MTN Metro Transport Network
  • FlexE Fexible Ethernet
  • This application provides a slicing method, business processing method, communication node and storage medium.
  • the embodiment of this application provides a slicing method, including:
  • the target frame slice includes: a first frame slice and a second frame slice; the first frame slice is a slice with a fixed length and a fixed frame structure, and the The second frame slice is a slice with a fixed length but no fixed frame structure.
  • the embodiment of this application also provides a business processing method, including:
  • the target frame slice includes: a first frame slice and a second frame slice;
  • the first frame slice is a frame slice with a fixed length and a fixed frame structure Slice
  • the second frame slice is a slice with a fixed length but no fixed frame structure.
  • Embodiments of the present application also provide a communication node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • a communication node including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the program, the above-mentioned slicing method or service is implemented. Approach.
  • Embodiments of the present application also provide a computer-readable storage medium.
  • a computer program is stored on the computer-readable storage medium.
  • the computer program is executed by a processor, the above-mentioned slicing method or business processing method is implemented.
  • Figure 1 is a flow chart of a slicing method provided by an embodiment
  • Figure 2 is a schematic diagram of the frame structure of a target frame slice provided by an embodiment
  • Figure 3 is a schematic diagram of the frame structure of another target frame slice provided by an embodiment
  • Figure 4 is a schematic diagram of the frame structure of a first frame slice provided by an embodiment
  • Figure 5 is a schematic diagram of a 64B/66B coding block format that complies with IEEE 802.3 provided by an embodiment
  • Figure 6 is a schematic diagram of the frame structure of a sub-slice frame provided by an embodiment
  • Figure 7 is a schematic diagram of the frame structure of the slice overhead of a target frame slice provided by an embodiment
  • Figure 8 is a schematic diagram of a service layer of a target frame slice provided by an embodiment
  • Figure 9 is a schematic diagram of a target frame slice that does not include slice overhead provided by an embodiment
  • Figure 10 is a schematic diagram of the frame structure of another type of sub-slicing frame provided by an embodiment
  • Figure 11 is a schematic structural diagram of sub-slice frame overhead of a sub-slice frame provided by an embodiment
  • Figure 12 is a schematic diagram of a frame structure of a target frame slice including slice overhead provided by an embodiment
  • Figure 13 is a schematic structural diagram of slice overhead of another target frame slice provided by an embodiment
  • Figure 14 is a schematic diagram of the frame structure of a second frame slice provided by an embodiment
  • Figure 15 is a schematic structural diagram of a target frame slice in which the first frame slice and the second frame slice have an interleaved distribution structure provided by an embodiment
  • Figure 16 is a flow chart of a business processing method provided by an embodiment
  • Figure 17 is a schematic principle diagram of a business processing method provided by an embodiment
  • Figure 18 is a schematic structural diagram of a slicing device according to an embodiment
  • Figure 19 is a schematic structural diagram of a business processing device provided by an embodiment
  • Figure 20 is a schematic diagram of the hardware structure of a communication node provided by an embodiment.
  • VPN Virtual Private Network
  • Flexible Ethernet technology provides a universal mechanism to transmit a series of services with different media access control (Media Access Control, MAC) rates, which can be services with a relatively large single MAC rate, or It can be a collection of multiple services with relatively small MAC rates, and is no longer limited to services with a single MAC rate.
  • Media Access Control Media Access Control
  • the customer service granularity supported by the FlexE standard is N ⁇ 5Gb/s (N ⁇ 1), that is, the minimum customer service granularity carried is 5Gb/s, and hard isolation and rigid pipes for services smaller than 5Gb/s are not supported.
  • SPN and MTN use FlexE as the service layer to implement end-to-end business rigid pipelines. Fine-grained technology further slices SPN/MTN path layer channels or 10GE Ethernet interfaces into time slots, and refines the fine-grained time slot bandwidth to a minimum granularity of 10Mb/s for carrying packet services.
  • this service carrying method regardless of whether there is a requirement for hard isolation, needs to be encapsulated and mapped into a fine-grained frame structure for transmission, which has the problems of multiple encapsulation levels and low bandwidth utilization.
  • Figure 1 is a flow chart of a slicing method provided by an embodiment. As shown in Figure 1, the method provided by this embodiment includes step 110 and step 120.
  • step 110 the physical layer to be sliced is obtained.
  • the physical layer to be sliced can be understood as the physical layer waiting to be sliced, such as the physical control sublayer (PCS) of Ethernet.
  • the function of the physical control sublayer is to provide communication nodes (or terminal devices) with ) provides a data path for transmitting data.
  • the data path can be a physical medium or multiple physical media connected.
  • the physical layer to be sliced may comply with a preset specification, such as the PCS layer 64B/66B specification of IEEE 802.3.
  • the physical layer to be sliced is sliced to obtain a target frame slice;
  • the target frame slice includes: a first frame slice and a second frame slice;
  • the first frame slice is a slice with a fixed length and a fixed frame structure, and
  • the second frame slice is a slice with a fixed length and a fixed frame structure. to have a fixed Slices of length but no fixed frame structure.
  • the target frame slice can be understood as a frame slice with a fixed length formed by slicing the physical layer to be sliced.
  • the target frame slice includes a slice with a fixed frame structure and a slice without a fixed frame structure, and can be flexibly based on business needs. Settings, therefore, the target frame slice can also be considered as a fixed-length frame structure with flexible slicing capabilities, that is, Flexible Frame Slice (FFS).
  • FFS Flexible Frame Slice
  • FFS may be used to represent the target frame slice.
  • FIG. 2 is a schematic diagram of the frame structure of a target frame slice provided by an embodiment.
  • the target frame slice FFS includes: a first frame slice and a second frame slice.
  • the first frame slice refers to a slice with a fixed length and a fixed frame structure, which can be considered as a Constant Frame Slice (CFS) that implements a rigid hard pipeline.
  • CFS can be used to represent the first frame slice.
  • the first frame slice CFS can be further divided into multiple time slots to carry different services, thereby providing rigid hard pipes and hard isolation for customer services, which can meet the business requirements of low latency, low jitter and hard isolation.
  • the second frame slice refers to a slice with a fixed length but no fixed frame structure.
  • it can be a Packet Stream Slice (PSS) that implements a flexible packet pipeline.
  • PSS can be used to represent the second frame slice.
  • the second frame slice PSS does not need to re-encapsulate service data, and can directly carry packet services, simplifying the service encapsulation process, improving bandwidth utilization, and making up for the problems of multiple encapsulation levels and low bandwidth utilization in the method of carrying packet services based on fine-grained technology. , which can meet elastic, flexible and high utilization business needs.
  • FIG. 3 is a schematic diagram of the frame structure of another target frame slice provided by an embodiment.
  • the target frame slice FFS may also include: slice overhead OH_FFS.
  • both the first frame slice and the second frame slice can be composed of 64/66B coding blocks of the PCS layer, and the PCS layer can comply with preset specifications, such as IEEE 802.3.
  • the length of the first frame slice is N1 coding blocks
  • the length of the second frame slice is N2 coding blocks
  • the length of the target frame slice is N1+N2 coding blocks.
  • the bandwidth allocation ratio of the first frame slice and the second frame slice in the physical layer can be flexibly adjusted according to business needs, and this embodiment does not set a limit on this.
  • the slicing method of the target frame slice obtained by slicing the physical layer to be sliced can adopt any slicing method, and the target frame slice obtained by slicing can have a certain distribution structure.
  • the slicing method and the distribution structure of the target frame slice are not limited here.
  • the physical layer to be sliced is sliced into a first frame slice with a fixed length and a fixed frame structure and a second frame slice with a fixed length but no fixed frame structure, thereby realizing the slicing and hardening of rigid hard pipes and elastic grouping pipes. Isolation can meet different business needs and make up for the problems of multiple encapsulation levels and low bandwidth utilization in the method of carrying packet services based on fine-grained technology.
  • the distribution structure of the target frame slice includes: a region-based sequential distribution structure, or an interleaved distribution structure.
  • the region-based sequential distribution structure means that the first frame slice and the second frame slice of the target frame slice are sequentially distributed in two different regions in the physical layer.
  • the physical layer is divided into a first area and a second area, the first frame slices are distributed in the first area, and the second frame slices are distributed in the second area.
  • the interleaved distribution structure refers to the sub-slice interleaved distribution of the first frame slice and the second frame slice.
  • the first frame slice can include i sub-slicing frames (SSF), denoted as SSF 1 to SSF i.
  • SSF sub-slicing frames
  • the second frame slice is equally divided into sub-slices with the same number of sub-slicing frames as the first frame slice. ; That is, Sub-PSS 1 ⁇ Sub-PSS i.
  • a sub-slice is inserted sequentially to form SSF 1, Sub-PSS 1, SSF 2, Sub-PSS 2,..., SSF i , the interleaved distribution structure of Sub-PSS i.
  • the first frame slice is composed of multiple sub-slice frames with the same frame structure and the same length.
  • the first frame slice CFS is composed of multiple consecutive sub-slice frames SSF, and each sub-slice frame SSF has the same frame structure and the same length.
  • the frame structure of the first frame slice includes: a single frame structure or a multi-frame structure.
  • the frame structure of the sub-slice frame SSF contained in the first frame slice with a single frame structure is exactly the same, that is, it includes the same sub-slice frame overhead OH_SSF and time slot; the first frame slice with a multi-frame structure
  • the frame structures of the included sub-slice frames SSF are different, for example, they may include different time slots.
  • slicing the physical layer to be sliced to obtain the target frame slice also includes:
  • the idle block is a 64B/66B coding block that complies with preset specifications
  • the data transmission rate of the first frame slice is adjusted by adjusting the number of free blocks.
  • one or more idle Idle blocks may be inserted between two adjacent sub-slice frames.
  • the block type of the Idle block may be 0x1E.
  • the number of idle blocks can be added or deleted, and the data transmission rate of the first frame slice can be adjusted by adjusting the number of idle blocks.
  • the sub-slice frame adopts a first data code block format;
  • the first data code block format includes: a start block, at least one data block and a termination block;
  • start block, data block and termination block are all 64B/66B encoding blocks that comply with the preset specifications.
  • the sub-slice frame SSF adopts the first data code block format composed of multiple coding blocks.
  • the coding block includes a start block (Start Block, S block), at least one data block (Data Block, D block) and a termination block (Terminate Block, T block).
  • the S block, the D block and the T block can all be 64B/66B coding blocks that comply with the preset specification, and the preset specification can be the PCS layer 64B/66B specification of IEEE 802.3.
  • Figure 5 is a schematic diagram of a 64B/66B coding block format that complies with IEEE 802.3 provided by an embodiment.
  • the first two bits of the 66B block are the sync header, which is used to distinguish the control block and the data block.
  • 10 represents the control block and 01 represents the data block.
  • the S block and T block belong to the control block, and the D block is the data block.
  • the first byte after the synchronization header (that is, sync is 10) indicates the block type Block Type.
  • the block type of the first block (i.e., S block) of the sub-slice frame SSF is 0x78
  • the block type of the last block (i.e., T block) of the SSF frame is 0xFF.
  • the sub-slice frame includes but is not limited to: sub-slice frame overhead and payload; the payload includes: multiple time slots of the same size arranged based on a preset arrangement.
  • the sub-slice frame includes but is not limited to: sub-slice frame overhead OH_SSF and payload.
  • the payload includes: multiple time slots of the same size arranged based on a preset arrangement. Each time slot serves as a basic physical channel and is used to carry the mapping of services.
  • FIG. 6 is a schematic diagram of the frame structure of a sub-slice frame according to an embodiment.
  • the payload of the sub-slice frame SSF is divided into m time slots. Each time slot has the same size of Sizeofslot(bit). Each time slot is arranged sequentially in the payload area of the SSF based on a preset arrangement.
  • the D block and T block of the sub-slice frame SSF are used to carry the payload and sub-slice frame overhead. Different types of services are mapped to the data areas of the D block and T block through corresponding mapping methods. Part of the data area can also be used for overhead.
  • the preset arrangement includes: sequential arrangement or intermittent arrangement.
  • the sequential arrangement means that the slot numbers slot 1 to slot m corresponding to the m slots are arranged sequentially in the payload, such as slot 1, slot 2, slot 3, slot 4,..., slot m- 1, slot m.
  • the interleaved arrangement means that the slot numbers slot 1 to slot m corresponding to m time slots are interleaved in the middle of the payload, such as slot 1, slot 3, slot 2, slot 4,..., slot m-2, slot m.
  • the size of the time slot is an integer multiple of the size of the service data packet
  • the service data packet is a 66-bit service data encoding block or a compressed 65-bit service data encoding block.
  • the size of the time slot may be equal to an integer multiple of the service data message (that is, n times, n is a positive integer) to facilitate service mapping.
  • it also includes:
  • Different time slot channels are used to carry different service data packets.
  • one or more time slots may constitute time slot channels with different bandwidths to carry end-to-end services, and different time slot channels carry different services.
  • slicing the data frame to obtain target frame slices includes:
  • the occupied bytes of the sub-slice frame overhead include at least one of the following:
  • the sub-slice frame overhead OH_SSF can be extended to use the first preset bytes of the S block (such as D1 to D7 bytes), or use part of the data area of the D block (for example, use the first D block to store the overhead ), or the data area in the T block. If more bits are needed for overhead, one or more of the D1 to D7 bytes of the S block, the data area of the D block, and the data area of the T block can be used at the same time. The data area of the D block and the data area of the T block belong to the payload. Therefore, the occupied bytes of the sub-slice frame overhead can be set through the configuration information, so that the sub-slice frame overhead OH_SSF is extended to the payload.
  • the first frame feature information of the first frame slice is used as the frame header of the target frame slice.
  • the target frame slice if the target frame slice includes: a first frame slice and a second frame slice, but does not include the slice overhead, that is, if the target frame slice has a simplified structure, the target frame slice can divide the first frame slice into the first frame slice.
  • a frame of characteristic information serves as the frame header.
  • the second frame slice adopts the second data code block format and directly carries the service data message formed by 64B/66B encoding
  • the second data code block format includes: a service data message sequence composed of a start block, at least one data block and a termination block, and idle blocks between the service data messages;
  • start block, the data block, the termination block and the idle block are all 64B/66B coding blocks that comply with preset specifications.
  • the target frame slice further includes: slice overhead.
  • the data code block format adopted by the slice overhead includes:
  • the third data code block format, or the fourth data code block format are the third data code block format, or the fourth data code block format.
  • the third data code block format includes: a start block and a stop block;
  • the fourth data code block format includes: a start block, a data block and a termination block.
  • the slicing overhead can adopt the fourth data code block format (that is, the data code block format of fixed-length S block + D block + T block).
  • the data code blocks all comply with the PCS layer 64/66B encoding of IEEE 802.3 specification.
  • FIG. 7 is a schematic diagram of the frame structure of the slice overhead of a target frame slice provided by an embodiment. As shown in Figure 7, the slicing overhead can also be simplified into the third data code block format (that is, the data code block format of S block + T block).
  • the slice overhead when the data code block format of the slice overhead is the first data code block format, the slice overhead serves as the frame header of the target frame slice.
  • the service layer of the target frame slice includes at least one of the following:
  • the slicing channel layer of the sliced packet network SPN the channel layer of the metropolitan transport network MTN, flexible Ethernet FlexE, Ethernet physical layer and optical transmission network OTN.
  • FIG. 8 is a schematic diagram of a service layer of a target frame slice provided by an embodiment.
  • the service layer of the target frame slicing can be the Slicing Channel Layer (SCL) of the Slicing Packet Network (SPN) or the channel layer of the Metro Transport Network (MTN).
  • SCL Slicing Channel Layer
  • SPN Slicing Packet Network
  • MTN Metro Transport Network
  • Path Layer Flexible Ethernet FlexE
  • Ethernet port physical layer ((Pyhsical, PHY), such as IEEE 802.3PHY or Optical Transport Network (OTN)).
  • the following is an exemplary description of obtaining target frame slices based on the slicing method through different embodiments.
  • FIG. 9 is a schematic diagram of a target frame slicing that does not include slicing overhead provided by an embodiment.
  • the length of the target frame slice FFS is 19800 66B coding blocks.
  • the length of the first frame slice CFS is 3960 66B coding blocks
  • the length of the second frame slice PSS is 15840 66B encoding blocks.
  • the first frame slice CFS includes 20 sub-slice frames SSF
  • each sub-slice frame SSF includes: 197 66B coding blocks composed of 1 S block, 195 D blocks and 1 T7 block.
  • Figure 10 is a schematic diagram of the frame structure of another type of sub-slicing frame provided by an embodiment.
  • the first 7 bytes of the first D block are the sub-slice frame overhead OH_SSF, and the other D block data areas and the data area of the T7 block belong to the payload.
  • the payload is divided into 24 time slots, and the length of each time slot is 65 bytes (65 ⁇ 8bit). Therefore, the first frame slice CFS contains a total of 480 (20 ⁇ 24) time slots.
  • FIG. 11 is a schematic structural diagram of sub-slice frame overhead of a sub-slice frame according to an embodiment.
  • the first frame slice CFS in this embodiment is a slice with a multiframe number of 20.
  • the sub-slice frame overhead OH_SSF of the sub-slice frame SSF of the first frame slice CFS has 7 bytes.
  • the fields of the sub-slice frame overhead OH_SSF are as follows: Multiframe indicator MFI (6 bits), indicating that the sub-slice frame SSF is located in the first
  • the sequence number of the frame slice CFS multiframe increases from 0 and circulates.
  • the MFI value corresponding to the first frame slice CFS with a multiframe number of 20 is 0 to 19.
  • OH Information represents the overhead information defined as needed, such as indicating the relationship between time slots and customer services, etc.
  • FIG. 12 is a schematic diagram of a frame structure of a target frame slice including slice overhead provided by an embodiment.
  • the length of the target frame slice FFS is 7920 66B blocks
  • the length of the first frame slice CFS is 3960 66B blocks
  • the length of the second frame slice PSS is 3958 66B block
  • the length of the slice overhead OH_FFS is 2 66B blocks
  • the first frame slice CFS is a multiframe composed of 20 sub-slice frames SSF, each sub-slice frame The SSF length is 197 66B blocks, and there is 1 idle block between adjacent sub-slice frames.
  • FIG. 13 is a schematic structural diagram of slice overhead of another target frame slice provided by an embodiment.
  • the slice overhead OH_FFS of the target frame slice is composed of S block and T block.
  • the overhead content occupies 7 data bytes of the T block.
  • FSF_MFI FFS multiframe indication, for The target frame slice of the multiframe structure. This indication indicates the multiframe sequence number of the target frame slice, increasing from 0 and cyclically, ranging from 0 to 255.
  • Num_SSF (8bits): The number of sub-slice frame SSF. Indicates the number of sub-slice frames contained in the target frame slice. Num_SSF can be configured through the network management.
  • GCC channel 32bits: used for the transmission of management information, etc.
  • RES(1bits) reserved, all 0.
  • FIG. 14 is a schematic diagram of the frame structure of a second frame slice provided by an embodiment.
  • the second frame slice PSS includes: multiple groups, each group adopts the second data code block format, and the second data code block format includes: a start block S block, at least one data block D block and a termination block.
  • FIG. 15 is a schematic structural diagram of a target frame slice in which the first frame slice and the second frame slice have an interleaved distribution structure according to an embodiment.
  • the length of the target frame slice FFS is 3960 66B blocks, of which the length of the first frame slice CFS is 1980 66B blocks, and the length of the second frame slice PSS for 1980 66B blocks.
  • the first frame slice CFS is a multiframe composed of 10 sub-slice frames SSF.
  • the length of each sub-slice frame SSF is 197 66B blocks.
  • the frame structure of the sub-slice frame SSF of the first frame slice is the same as the above-mentioned Embodiment 1.
  • the second frame slice PSS is equally divided into 10 PSS sub-slices that are the same as the number of SSF frames (10) contained in the first frame slice CFS, recorded as sub-PSS 1 ⁇ sub-PSS 10.
  • a PSS sub-slice is interleaved after each SSF frame, forming an interleaved structure of SSF 1, sub-PSS 1, SSF 2, sub-PSS 2,...SSF 10, sub-PSS10.
  • the first frame slice CFS is a multiframe composed of 10 SSF frames, containing a total of 240 time slots.
  • Rateofslot is the rate of the time slot;
  • RateofPSS is the channel rate of the second frame slice PSS;
  • Rateofserver is the rate of the service layer;
  • SizeofFFS is the length of the target frame slice FFS.
  • Figure 16 is a flow chart of a business processing method provided by an embodiment. As shown in Figure 16, the method provided by this embodiment includes step 210, step 220 and step 230.
  • step 210 business data is obtained.
  • the type of service data may be Ethernet service, ordinary Ethernet service or Fixed rate time division multiplexing (Time Division Multiplexing, TDM) service, there is no limit on the service data here.
  • TDM Time Division Multiplexing
  • step 220 the service data is encoded to form a service data code stream.
  • the service data is encoded to obtain a service data message, and the service data code stream is formed from multiple service data messages.
  • the service data code stream is formed from multiple service data messages. For example, after Ethernet business client A and client B are encoded by IEEE 802.3 PCS, a 64B/66B block code stream is formed.
  • step 230 map the service data code stream to at least one target frame slice;
  • the target frame slice includes: a first frame slice and a second frame slice;
  • the first frame slice has a fixed length and a fixed frame
  • the second frame slice is a slice with a fixed length but no fixed frame structure.
  • the target frame slice includes: a first frame slice and a second frame slice.
  • the service data code stream can be mapped to the first frame slice or the second frame of at least one target frame slice according to different customer business requirements. Slicing.
  • the first frame slice is a slice with a fixed length and fixed frame structure, which can provide rigid hard pipes and hard isolation for customer services. Therefore, the first frame slice can be used to carry Ethernet services or TDM services that require rigid hard pipes.
  • the second frame slice is a slice with a fixed length but no fixed frame structure. The second frame slice can be used to carry ordinary Ethernet services that do not require rigid hard pipes.
  • the service data code stream is carried by the target frame slice having a first frame slice with a fixed length and a fixed frame structure and a second frame slice having a fixed length but no fixed frame structure, which can meet the low latency of rigid hard pipe services. , low jitter and hard isolation transmission requirements, as well as elastic, flexible and high utilization transmission requirements for packet pipe services.
  • mapping the service data code stream to a frame slice of at least one target frame slice includes:
  • the service data code stream is mapped to the second frame slice of the target frame slice based on a second preset mapping method.
  • the target frame slice includes: a first frame slice and a second frame slice, because the structures of the first frame slice and the second frame slice are different.
  • the first frame slice can be further divided into multiple time slots for carrying service data messages in the service data code stream, while the second frame slice has no fixed frame structure; therefore, the service data code stream is mapped to the first frame slice
  • the preset mapping method used in the preset time slot or the second frame slice is also different.
  • the first preset mapping method includes: direct mapping method or compressed mapping method
  • the direct mapping method is to directly map each service data message in the service data code stream to the corresponding preset time slot of the first frame slice of the target frame slice;
  • the compression mapping method is to compress and transcode each service data message of the service data code stream and then map it to the corresponding preset time slot of the first frame slice of the target frame slice;
  • the service data message is a 66-bit service data encoding block.
  • the service data message in the service data code stream is a 66-bit service data encoding block
  • the service data message in the service data code stream is mapped to the preset time slot of the first frame slice of the target frame slice.
  • the first mapping method adopted may include: direct mapping method and compression mapping method.
  • the direct mapping method can be used to directly map the 66-bit service data encoding block to the corresponding preset time slot of the first frame slice of the target frame slice.
  • the compression mapping method can be used to first compress and transcode the 66-bit service data encoding block into 65 bits.
  • the service data coding block is mapped to the corresponding preset time slot of the first frame slice of the target frame slice.
  • the method further includes:
  • the service data message carried in the time slot of the first frame slice is forwarded to the preset time slot corresponding to the first frame slice of the next communication node.
  • the time slot cross-configuration table can be understood as a configuration table including the cross-relationship of inbound time slots and/or outbound time slots of service data packets, and is used to indicate the forwarding path of the service data packets.
  • Configure time slots in the table via time slot interleaving The cross relationship is completed to forward the service data message carried in the time slot of the current target frame slice to the corresponding time slot of the first frame slice of the next communication node.
  • the second preset mapping method includes: a complete data packet mapping method or a data packet splicing mapping method
  • the complete data message mapping method includes: mapping at least one complete service data message in the service data code stream to the second frame slice of the target frame slice; filling the said complete data message based on idle data blocks.
  • the remaining space of the second frame slice, the remaining space is the space in the second frame slice that cannot map a complete service data message;
  • the data message splicing and mapping methods include:
  • the second target frame slice is an adjacent target of the first target frame slice Frame slice
  • the first partial data block is determined based on the remaining space of the second frame slice of the first target frame slice.
  • the second mapping method used to map the service data packet in the service data code stream to the second frame slice of the target frame slice may include: a complete data packet mapping method or a data packet splicing mapping method. .
  • the complete data message mapping method can be understood as the second frame slice is all complete business data messages (S block + D block + T block). If the remaining space of the second frame slice is not enough to accommodate the next complete business data message, the remaining space is filled with free data blocks.
  • the advantage of this method is that it has good compatibility and can penetrate the SPN/MTN path channel. The disadvantage is that there is a certain amount of bandwidth waste.
  • the data packet splicing mapping method can be understood as allowing the service data packet (S block + D block + T block) to span the second frame slice of two adjacent target frame slices.
  • the remaining space of the second frame slice is not enough to accommodate a complete customer service message, the remaining space only stores the first part of the data block of the customer service message (that is, the end of the second frame slice is a D block or S block) , and then put the remaining data code blocks of the customer service (i.e., the second part of the data block) into the starting position of the second frame slice of the next target frame slice (i.e., the starting position of the second frame slice is located in the D block or T block).
  • the advantage of this method is high bandwidth utilization, but the disadvantage is that it cannot penetrate the SPN/MTN path channel.
  • the next communication node to which the service data code stream is forwarded is the target communication node; the target communication node is the receiver of the service data code stream. or corresponding communication node.
  • the applicable scenario for mapping the service data message in the service data code stream to the second frame slice of the target frame slice based on the message splicing mapping method may be the next frame to which the service data code stream is forwarded.
  • the communication node is the target communication node (that is, the communication node corresponding to the receiver of the service data code stream). After receiving the service data code stream, the target communication node decodes the service data code stream, but will not encapsulate it and forward it to the next communication node. It can also be considered as an application scenario where there is only one hop for termination, such as a 10GE Ethernet interface.
  • FIG. 17 is a schematic diagram of a principle of a business processing method provided by an embodiment.
  • the service data of customer service A, customer service B, customer service C and customer service D from the Ethernet MAC are respectively encoded by 64B/66B to form service data code stream A, service data code stream B, Business data code stream C and business data code stream D; map business data code stream A to the first time slot slot 1 and the second time slot slot of the first frame slice CFS, map business data code stream B to In the mth time slot slot m of the first frame slice CFS; map the service data code stream C and the service data code stream D to the second frame slice PSS.
  • the service data messages in the service data code stream A, the service data code stream B, the service data code stream C and the service data code stream D can be 66-bit service data that conforms to the PCS layer 64B/66B specification of IEEE 802.3 Coding block, or it can be a 65-bit service data coding block.
  • FIG. 18 is a schematic structural diagram of a slicing device according to an embodiment. picture. As shown in Figure 18, the slicing device includes:
  • the acquisition module 310 is configured to acquire the physical layer to be sliced
  • the slicing module 320 is configured to slice the physical layer to be sliced to obtain a target frame slice; the target frame slice includes: a first frame slice and a second frame slice; the first frame slice has a fixed length and a fixed frame The second frame slice is a slice with a fixed length but no fixed frame structure.
  • the distribution structure of the target frame slice includes: a region-based sequential distribution structure, or an interleaved distribution structure.
  • the first frame slice is composed of multiple sub-slice frames with the same frame structure and the same length.
  • the frame structure of the first frame slice includes: a single frame structure or a multi-frame structure.
  • the slicing module 320 includes:
  • An insertion unit configured to insert at least one idle block between two adjacent sub-slice frames; the idle block is a 64B/66B coding block that complies with preset specifications;
  • An adjustment unit configured to adjust the data transmission rate of the first frame slice by adjusting the number of free blocks.
  • the sub-slice frame adopts a first data code block format;
  • the first data code block format includes: a start block, at least one data block and a termination block;
  • start block, the data block and the termination block are all 64B/66B coding blocks that comply with preset specifications.
  • the sub-slice frame includes but is not limited to: sub-slice frame overhead and payload; the payload includes: multiple time slots of the same size arranged based on a preset arrangement.
  • the preset arrangement includes: a sequential arrangement or an intermittent arrangement.
  • the size of the time slot is an integer multiple of the size of the service data packet
  • the service data packet is a 66-bit service data encoding block or a compressed 65-bit service data encoding block.
  • it also includes:
  • a channel forming module is configured to form a time slot channel based on at least one of the time slots; different time slot channels are used to carry different service data messages.
  • the slicing module 320 is configured to configure the occupied bytes of the sub-slicing frame overhead
  • the occupied bytes of the sub-slice frame overhead include at least one of the following:
  • the bytes in the start block, the data area in the data block and the data area in the end block are The bytes in the start block, the data area in the data block and the data area in the end block.
  • the first frame feature information of the first frame slice is used as the frame header of the target frame slice.
  • the second frame slice adopts the second data code block format and directly carries the service data message formed by 64B/66B encoding
  • the second data code block format includes: a service data message sequence composed of a start block, at least one data block and a termination block, and idle blocks between the service data messages;
  • start block, the data block, the termination block and the idle block are all 64B/66B coding blocks that comply with preset specifications.
  • the target frame slice further includes: slice overhead.
  • the data code block format adopted by the slice overhead includes:
  • the third data code block format, or the fourth data code block format are the third data code block format, or the fourth data code block format.
  • the third data code block format includes: a start block and a stop block;
  • the fourth data code block format includes: a start block, a data block and a termination block.
  • the slice overhead when the data code block format of the slice overhead is the first data code block format, the slice overhead serves as the frame header of the target frame slice.
  • the service layer of the target frame slice includes at least one of the following:
  • the slicing channel layer of the sliced packet network SPN the channel layer of the metropolitan area transport network MTN, flexible Ethernet FlexE, Ethernet Network physical layer and optical transmission network OTN.
  • the slicing device proposed in this embodiment and the slicing method proposed in the above embodiment belong to the same concept.
  • Technical details not described in detail in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the slicing method. .
  • FIG. 19 is a schematic structural diagram of a service processing device provided by an embodiment. As shown in Figure 19, the service processing device includes:
  • the acquisition module 410 is configured to obtain business data
  • the encoding module 420 is configured to encode the service data to form a service data code stream
  • Mapping module 430 is configured to map the service data code stream to at least one target frame slice; the target frame slice includes: a first frame slice and a second frame slice; the first frame slice has a fixed length and a fixed length. A slice of a frame structure, the second frame slice is a slice with a fixed length but without a fixed frame structure.
  • mapping module 430 includes:
  • a first mapping unit configured to map the service data code stream to a preset time slot of the first frame slice of the target frame slice based on a first preset mapping method
  • the second mapping unit is configured to map the service data code stream to the second frame slice of the target frame slice based on a second preset mapping method.
  • the first preset mapping method includes: direct mapping method or compressed mapping method
  • the direct mapping method is to directly map each service data message in the service data code stream to the corresponding preset time slot of the first frame slice of the target frame slice;
  • the compression mapping method is to compress and transcode each service data message of the service data code stream and then map it to the corresponding preset time slot of the first frame slice of the target frame slice.
  • the service data message is a 66-bit service data encoding block.
  • the device further includes:
  • a forwarding module configured to, after mapping the service data code stream to the first frame slice of at least one target frame slice, carry the time slot of the first frame slice based on a time slot cross configuration table.
  • the service data message is forwarded to the preset time slot corresponding to the first frame slice of the next communication node.
  • the second preset mapping method includes: a complete data packet mapping method or a data packet splicing mapping method
  • the complete data message mapping method includes: mapping at least one complete service data message in the service data code stream to the second frame slice of the target frame slice; filling the said complete data message based on idle data blocks.
  • the remaining space of the second frame slice, the remaining space is the space in the second frame slice that cannot map a complete service data message;
  • the data message splicing and mapping methods include:
  • the second target frame slice is an adjacent target of the first target frame slice Frame slice
  • the first partial data block is determined based on the remaining space of the second frame slice of the first target frame slice.
  • the next communication node to which the service data code stream is forwarded is the target communication node; the target communication node is the receiver of the service data code stream. or corresponding communication node.
  • the business processing device proposed in this embodiment and the business processing method proposed in the above embodiment belong to the same concept.
  • Technical details not described in detail in this embodiment can be found in any of the above embodiments, and this embodiment has the same features as the business processing method. beneficial effects.
  • FIG. 20 is a schematic diagram of the hardware structure of a communication node provided by an embodiment.
  • the communication node provided by the present application may include a first terminal, a second terminal
  • the terminal and the third terminal, the communication node include a memory 520, a processor 510, and a computer program stored in the memory and executable on the processor.
  • the processor 510 executes the program, it implements the above-mentioned slicing method or business processing method.
  • the communication node may also include a memory 520; the processor 510 in the communication node may be one or more, one processor 510 is taken as an example in Figure 20; the memory 520 is used to store one or more programs; the one or more A program is executed by the one or more processors 510, so that the one or more processors 510 implement the slicing method or the business processing method as described in the embodiment of this application.
  • the communication node also includes: communication device 530, input device 540 and output device 550.
  • the processor 510, memory 520, communication device 530, input device 540 and output device 550 in the communication node can be connected through a bus or other means.
  • connection through a bus is taken as an example.
  • the input device 540 may be used to receive input numeric or character information and generate key signal input related to user settings and function control of the communication node.
  • the output device 550 may include a display device such as a display screen.
  • Communication device 530 may include a receiver and a transmitter.
  • the communication device 530 is configured to perform information transceiver communication according to the control of the processor 510 .
  • the memory 520 can be configured to store software programs, computer-executable programs and modules, such as program instructions/modules corresponding to the slicing method or business processing method described in the embodiments of the present application (for example, in the slicing device) the acquisition module 310 and the slicing module 320; or the acquisition module 410, the encoding module 420 and the mapping module 430 in the business processing device).
  • the memory 520 may include a stored program area and a stored data area, where the stored program area may store an operating system and an application program required for at least one function; the stored data area may store data created according to the use of the communication node, etc.
  • memory 520 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • memory 520 may further include memory located remotely relative to processor 510, and these remote memories may be connected to communication nodes through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • Embodiments of the present application also provide a storage medium that stores a computer program.
  • the computer program is executed by a processor, any one of the slicing methods or business processing methods described in the embodiments of the present application is implemented.
  • the slicing method includes:
  • the target frame slice includes: a first frame slice and a second frame slice; the first frame slice is a slice with a fixed length and a fixed frame structure, and the The second frame slice is a slice with a fixed length but no fixed frame structure.
  • the business processing method includes: obtaining the encoded attribute data of the point cloud;
  • the service data code stream is mapped to at least one target frame slice;
  • the target frame slice includes: a first frame slice and a second frame slice;
  • the first frame slice is a slice with a fixed length and a fixed frame structure, so
  • the second frame slice is a slice with a fixed length but no fixed frame structure.
  • the computer storage medium in the embodiment of the present application may be any combination of one or more computer-readable media.
  • the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium.
  • the computer-readable storage medium may be, for example, but is not limited to: an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination thereof.
  • Computer-readable storage media include: electrical connections having one or more conductors, portable computer disks, hard drives, random access memory (RAM), read-only memory (Read Only Memory, ROM), Erasable programmable read-only memory (Erasable Programmable Read Only Memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination of the above.
  • RAM random access memory
  • ROM read-only memory
  • EPROM Erasable programmable Read Only Memory
  • flash memory optical fiber
  • portable CD-ROM optical storage device
  • magnetic storage device or any suitable combination of the above.
  • a computer-readable storage medium may be any tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device.
  • a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave carrying computer-readable program code therein. Such propagated data signals may take many forms, including but not limited to: electromagnetic signals, optical signals, or any suitable combination of the above.
  • a computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device .
  • Program code embodied on a computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, radio frequency (Radio Frequency, RF), etc., or any suitable combination of the above.
  • any appropriate medium including but not limited to: wireless, wire, optical cable, radio frequency (Radio Frequency, RF), etc., or any suitable combination of the above.
  • Computer program code for performing operations of the present application may be written in one or more programming languages, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional A procedural programming language, such as the "C" language or similar programming language.
  • the program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
  • the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (such as an Internet service provider through the Internet). connect).
  • LAN local area network
  • WAN wide area network
  • Internet service provider such as an Internet service provider through the Internet. connect
  • user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.
  • the various embodiments of the present application may be implemented in hardware or special purpose circuitry, software, logic, or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor, or other computing device, although the application is not limited thereto.
  • Embodiments of the present application may be implemented by a data processor of the mobile device executing computer program instructions, for example in a processor entity, or by hardware, or by a combination of software and hardware.
  • Computer program instructions may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or written in any combination of one or more programming languages source code or object code.
  • ISA Instruction Set Architecture
  • Any block diagram of a logic flow in the figures of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions.
  • Computer programs can be stored on memory.
  • the memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to Read-Only Memory (ROM), Random Access Memory (RAM), optical Memory devices and systems (Digital Video Disc (DVD) or Compact Disk (CD)), etc.
  • Computer-readable media may include non-transitory storage media.
  • the data processor may be any device suitable for the local technical environment Types, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable logic devices (Field-Programmable Gate Array) , FPGA) and processors based on multi-core processor architecture.
  • DSP Digital Signal Processing
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • processors based on multi-core processor architecture.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente demande concerne un procédé de découpage en tranches, un procédé de traitement de service, un noeud de communication et un support de stockage. Le procédé de découpage en tranches consiste à : acquérir une couche physique devant être découpée en tranches (110) ; et découper en tranches la couche physique devant être découpée en tranches afin d'obtenir des tranches de trames cibles, les tranches de trames cibles comprenant une première tranche de trames et une seconde tranche de trames, la première tranche de trames étant une tranche de longueur fixe présentant une structure de trames fixes, et la seconde tranche de trames étant une tranche de longueur fixe mais dépourvue de structure de trames fixes (120).
PCT/CN2023/076668 2022-06-28 2023-02-17 Procédé de découpage en tranches, procédé de traitement de service, noeud de communication et support de stockage WO2024001220A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210751788.4 2022-06-28
CN202210751788.4A CN117354159A (zh) 2022-06-28 2022-06-28 切片方法、业务处理方法、通信节点及存储介质

Publications (1)

Publication Number Publication Date
WO2024001220A1 true WO2024001220A1 (fr) 2024-01-04

Family

ID=89354477

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/076668 WO2024001220A1 (fr) 2022-06-28 2023-02-17 Procédé de découpage en tranches, procédé de traitement de service, noeud de communication et support de stockage

Country Status (2)

Country Link
CN (1) CN117354159A (fr)
WO (1) WO2024001220A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113259694A (zh) * 2021-04-22 2021-08-13 北京金山云网络技术有限公司 数据切片方法、装置和电子设备
CN113595965A (zh) * 2020-04-30 2021-11-02 中兴通讯股份有限公司 业务数据处理、交换、提取方法及设备、计算机可读介质
CN113972997A (zh) * 2020-07-25 2022-01-25 华为技术有限公司 一种传输数据的方法和设备
WO2022016831A1 (fr) * 2020-07-21 2022-01-27 烽火通信科技股份有限公司 Procédé et dispositif de traitement de service à faible vitesse flexe
CN114363232A (zh) * 2020-09-30 2022-04-15 华为技术有限公司 一种切片帧的发送方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113595965A (zh) * 2020-04-30 2021-11-02 中兴通讯股份有限公司 业务数据处理、交换、提取方法及设备、计算机可读介质
WO2022016831A1 (fr) * 2020-07-21 2022-01-27 烽火通信科技股份有限公司 Procédé et dispositif de traitement de service à faible vitesse flexe
CN113972997A (zh) * 2020-07-25 2022-01-25 华为技术有限公司 一种传输数据的方法和设备
CN114363232A (zh) * 2020-09-30 2022-04-15 华为技术有限公司 一种切片帧的发送方法及装置
CN113259694A (zh) * 2021-04-22 2021-08-13 北京金山云网络技术有限公司 数据切片方法、装置和电子设备

Also Published As

Publication number Publication date
CN117354159A (zh) 2024-01-05

Similar Documents

Publication Publication Date Title
US11252098B2 (en) Data transmission method, transmitter, and receiver
US10462471B2 (en) Data processing method, communications device, and communications system
US20220416895A1 (en) Data transmission method and apparatus, terminal device and storage medium
US20230164624A1 (en) Service data processing, exchange and extraction methods, devices, and computer-readable medium
WO2019071870A1 (fr) Procédé de transmission de données dans un réseau optique, et dispositif de réseau optique
US11381338B2 (en) Data transmission method, communications device, and storage medium
WO2016202296A1 (fr) Procédé et appareil de transport de données, et procédé et appareil d'analyse syntaxique de données
WO2019029419A1 (fr) Procédé et dispositif de transmission de fréquence de service
US11412508B2 (en) Data transmission method and device
KR102309444B1 (ko) 데이터 캡슐화, 전송 방법, 장치 및 컴퓨터 저장 매체
WO2024001220A1 (fr) Procédé de découpage en tranches, procédé de traitement de service, noeud de communication et support de stockage
EP3813281A1 (fr) Procédé de réception de flux de blocs de code, procédé d'envoi de flux de blocs de code et appareil de communication
WO2023035776A1 (fr) Procédé de communication, appareil correspondant et support de stockage
JP7167345B2 (ja) データ伝送方法、通信機器、および記憶媒体
WO2019011003A1 (fr) Procédé et dispositif permettant de traiter un canal une topologie optique dans un réseau optique
WO2024032297A1 (fr) Procédé de traitement de service, dispositif réseau et support de stockage
WO2024032269A1 (fr) Procédé de communication, appareil associé et support de stockage lisible par ordinateur
WO2024051586A1 (fr) Procédé de traitement de trame de données dans un réseau de transport optique, appareil et système
WO2023231429A1 (fr) Procédé de transmission de données, dispositif d'extrémité source, dispositif d'extrémité collecteur et support de stockage
EP3823189A1 (fr) Procédé de réception d'un flux de blocs de code, procédé d'émission d'un flux de blocs de code et dispositif de communication
JP2020528251A (ja) ビット・ブロック・ストリームを処理する方法及び装置、ビット・ブロック・ストリームのレート・マッチングのための方法及び装置、並びにビット・ブロック・ストリームを切り替える方法及び装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23829413

Country of ref document: EP

Kind code of ref document: A1