WO2021104168A1 - Resource allocation method, apparatus, and device - Google Patents

Abstract

Disclosed are a resource allocation method, apparatus and device. The method comprises: acquiring k groups of resource numbers of m services, each group of resource numbers corresponding to a resource allocation unit N, each group of resource numbers comprising a coefficient a corresponding to each service, the coefficient a representing the number of resource allocation units comprised in a service, the resource allocation units N representing the number of resources comprised in a resource allocation unit, k≥1, N≥1, and k and N both being positive integers; according to the k groups of resource numbers, determining the resources corresponding to the m services among L resources. The present method divides the resource numbers of m services into k groups of resource numbers, and allocates resources according to the resource allocation unit corresponding to each group of resource numbers in the k groups of resource numbers. Since the resource allocation unit indicates the smallest unit of allocated resources in a group of resource numbers, resource allocation at a smaller resource granularity is achieved, and the flexibility and expansibility of resource allocation is improved.

Description

Method, device and equipment for resource allocation Technical field

This application relates to the field of flexible Ethernet communication transmission, and in particular to a resource allocation method, device and equipment.

Background technique

Early native Ethernet was born in a local area network, using Carrier Sense Multiple Access with Collision Detection (CSMA/CD) technology to interconnect multiple points. At that time, the local area network was generally a bus-type network topology. With the development of Ethernet, ordinary Ethernet has followed the frame format of native Ethernet and formulated the IEEE 802.3 Ethernet standard, which is widely used in parks, enterprises and data centers. Ordinary Ethernet adopts full-duplex mode and no longer requires CSMA/CD technology. The network speed has increased by 10 times, and the development of 10 megabits per second (Million bits per second, Mbps), 100 Mbps (Fast Ethernet, FE), 1Gbps (Gigabit Ethernet, GE), 10Gbps (10GE), 100Gbps (100GE) and other Ethernet.

With the diversification of network traffic, in recent years, Ethernets of different speeds have been developed, such as 40Gbps and 25Gbps Ethernet. With the widespread application of Ethernet in local area networks, operators and equipment manufacturers hope to introduce this kind of network technology with good economy, interoperability and ease of use into the telecommunication network, so carrier-grade Ethernet was born. Carrier Ethernet is the introduction of transport network functions on the basis of ordinary Ethernet, with high reliability, end-to-end quality of service (Quality of Service, QoS) guarantee capabilities, complete OAM (Operation, Administration, Maintenance, operation, management, Maintenance (short for maintenance) mechanism and manageability.

With the advent of the 5G era, a variety of new services (such as cloud services, Internet of Vehicles, etc.) continue to emerge, putting new demands on Ethernet technology and creating flexible Ethernet technology. Flexible Ethernet (Flexible Ethernet, FlexE) is a lightweight enhanced Ethernet technology that supports port binding, channelization technology, and can build end-to-end links. Flexible Ethernet supports greater bandwidth through port binding, such as binding 8 100Gbps ports to achieve 800Gbps bandwidth. Through the channelization technology, the flexible allocation of bandwidth is realized, and diversified service rate access is supported, without being restricted by the stepped rate system formulated by the IEEE802.3 standard. By building an end-to-end link, it provides stronger QoS capabilities for multi-service bearers and enhances user experience.

In order to realize flexible Ethernet, the Optical Internetworking Forum (OIF) has formulated the FlexE standard to realize flexible bandwidth allocation. FlexE forms a flexible Ethernet group (FlexE group) by binding multiple physical layers (Physical Layer, PHY) to obtain a larger bandwidth; and realizes flexible bandwidth allocation by dividing the interface into time slots and reallocating it. FlexE divides the 100Gbps interface into 20 time slots, each of which is 5Gbps, so FlexE can support N×5Gbps services through time slot allocation.

However, in reality, the service rate is diverse. For example, the E1 service rate in the Plesiochronous Digital Hierarchy (PDH) network is 2.048Mbps, and the Synchronous Digital Hierarchy (SDH) STM-1 (Synchronous Transport Module) level 1, synchronous transmission module level 1) The service rate is 155Mbps, the STM-4 service rate is 622Mbps, and the optical channel Data Unit (ODU) 0 rate of the optical transport network (Optical Transport Network, OTN) is 1.25Gbps , ODU1 rate is 2.5Gbps.

In the FlexE standard, the time slot particles divided by FlexE are 5Gbps, and the allocated bandwidth must be based on a fixed 5Gbps as the basic unit for resource transmission and allocation. Therefore, for small-particle time slots, the scale of FlexE's time slot configuration table Limited, the transmission resources are inflexible and not scalable.

Summary of the invention

This application provides a simpler and flexible resource allocation method to realize multiplexing or demultiplexing of multiple services, and defines a flexible frame format to support real-time multiplexing or demultiplexing of multiple services.

The core idea of the technical solution of the present application is that each service has a certain value for bandwidth resource requirements. When the value is converted into a hexadecimal representation, m services can be divided into k groups for resource allocation, where each The resource allocation unit of group allocation represents the granularity of resources, and the sender can allocate resources in sequence according to the granularity of the resources, and then uniquely determined m service reuse schemes can be obtained. The receiving end can also allocate according to the resource granularity according to the required resource value, and obtain the same m service demultiplexing scheme.

This resource allocation method is simple and straightforward, does not require any calculation, and can give the current resource's business based on the number of resources in real time. The sending end can multiplex multiple services in real time according to the number of resources required by the service. In order to demultiplex in real time, the receiving end needs to obtain service parameters in advance, including the number of services, service numbers, and resources required by each service. number. Therefore, a flexible frame format is defined, and the service parameters are transmitted before the service data, and the number of services, the number of the services, the number of resources required by the service, and the total number of resources can be dynamically adjusted.

In addition, in order to be compatible with the existing standard FlexE, the present invention provides a solution for intercommunication between a new interface and a FlexE interface.

Specifically, the technical solutions disclosed in the embodiments of the present application include the following:

In the first aspect, an embodiment of the present application discloses a resource allocation method, which can be applied to a sending end device or a receiving end device. Specifically, the method includes: obtaining the number of k sets of resources for m services, The number of resources in each group corresponds to a resource allocation unit N, and the number of resources in each group includes a coefficient a corresponding to each service. The coefficient a represents the number of resource allocation units included in a service, and the resource allocation unit N represents a resource allocation. The number of resources included in the unit, k≥1, N≥1, and k and N are all positive integers; the resources corresponding to the m services are determined from the number of resources of the k groups, and L is a positive integer And L≥1.

The method provided in this aspect divides the number of resources of m services into k groups of resource numbers, and allocates resources according to the resource allocation unit corresponding to each group of resource numbers in the k groups of resource numbers. Since the resource allocation unit indicates a group The smallest unit of resource allocation in the number of resources, so the resource allocation of smaller resource granularity is realized, and the flexibility and expandability of resource allocation are improved.

In addition, the allocation of service resources according to the number of k groups of resources can avoid the limitation of sending resource configuration tables, and there is no need to send redundant resource configuration tables, which saves transmission overhead.

Wherein, in this application, the resource granularity is expressed by the resource allocation unit N in this technical solution, that is, when the resource allocation unit N is smaller, the corresponding resource granularity is smaller.

Optionally, with reference to the first aspect, in a possible implementation of the first aspect, the obtaining the number of k sets of resources for m services includes: obtaining the number of m resources corresponding to the m services, each The number of resources is expressed in a first base, me1; the number of resources in each of the resource numbers expressed in the first base is expressed in a second binary to obtain the number of k groups of resources, and the first binary includes binary, octal, Decimal and hexadecimal.

Further, the first binary system is a decimal system, and the second binary system is a binary system.

Furthermore, one resource number C1 in the k sets of resource numbers can be expressed as:

C1=(a _1,1 ,a _1,2 ,…,a _1,k )=a _1,1 ×α ⁰ +a _1,2 ×α ¹ +…+a _1,k ×α ^k-1 ,

Among them, C1 is the number of resources of the first service S1, a _1,1 ,a _1,2 ,...,a _1,n are coefficients, and the base is α ⁰ ,α ¹ ,...,α ^k-1 , The resource allocation unit N is α ⁰ , α ¹ ,..., α ^k-1 , the coefficient a has a value range of [0, α-1], and the number of resources C1 of the first service is as follows: One group allocates a _i,1 ×α ⁰ resources, and the corresponding resource allocation unit N is α ⁰ ; the second group allocates a _i,2 ×α ¹ resource, and the corresponding resource allocation unit N is α ¹ , the k-th group The number of allocated resources is a _i,k ×α ^k-1 resources for allocation, and the corresponding resource allocation unit N is α ^k-1 .

For example, in binary, the value of the coefficient a is 0 or 1. In binary, the value of the coefficient a ranges from 0 to 9.

This implementation mode can extend the binary-based resource allocation method to any hexadecimal system, thereby realizing resource allocation of multiple services for multiplexing or demultiplexing, so as to increase the flexibility of resource allocation and reduce the jitter of service allocation Sex.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, determining the resources corresponding to the m services among the L resources according to the number of the k sets of resources includes: The number of group resources determines the resources corresponding to the m services among the L resources in the order of the first group to the k-th group, and the number of resources allocated to each group is the sum of the coefficient a of the m services and the The product of the resource allocation unit N corresponding to each group. In this implementation, resources are allocated in the order of group numbers, which improves the efficiency of resource allocation.

Optionally, the method further includes: performing resource allocation on the number of the k groups of resources in an order of any permutation and combination from the first group to the k-th group.

Optionally, with reference to the first aspect, in yet another possible implementation of the first aspect, the number of the k groups of resources is determined in the order of the first group to the kth group, and the number of the L resources The resources corresponding to the m services include: in the order of the first group to the k-th group, if the allocated resources of any one of the first group to the k-th group include two or more services, then For the group containing the two or more services, the resources corresponding to each service are allocated according to the order of service numbers or the order of interleaving the service numbers. In this implementation, when a set of resource numbers correspond to two or more services, the resources corresponding to the services are interleaved and allocated, thereby reducing the jitter of service allocation.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, determining the resources corresponding to the m services among the L resources according to the number of the k sets of resources includes: acquiring the first sequence , The first sequence is used to indicate the positional relationship between resource allocation units N of the number of k sets of resources; according to the number of k sets of resources and the first sequence, the m number of resources are determined Resources corresponding to the business. In this implementation, the first sequence is used to indicate the resource allocation status of each service, so that the number of resources of each service can be allocated more flexibly, and the jitter of service allocation is also reduced.

Wherein, the first sequence is used to indicate that the position order of the resource allocation unit N corresponding to the resources of the first group to the k-th group in the number of resources of the k groups is arbitrary.

Further, in the first group to the k-th group number of resources, the group number of the first resource corresponding to the resource allocation unit N is ^20, the second group number of resources corresponding to the resource allocation unit N is ^21, the third group number of resources The corresponding resource allocation unit N is 2 ² , and the resource allocation unit N corresponding to the number of resources in the k-th group is 2 ^k-1 .

Wherein, optionally, the first sequence includes k first units, and different first units correspond to different numbers of group resources. For example, the first first unit corresponds to the number of resources in the first group, the second first unit corresponds to the number of resources in the second group, and the kth first unit corresponds to the number of resources in the kth group. Then the first sequence can indicate the first group The positional relationship between the number of resources to the k-th group. And the first sequence indicates that the order between the k first units can be arbitrary.

In addition, optionally, the first sequence includes z second units, different second units correspond to different group resource numbers, at least one second unit corresponds to at least two group resource numbers, z<k, z is positive Integer and z≥2.

For example, z=2, k=4, the first sequence contains two of the second units, and each of the second units corresponds to two sets of resource numbers, for example, one second unit corresponds to the first set of resource numbers and the second set of resources. The number of group resources, and the other second unit corresponds to the number of resources in the third group and the number of resources in the fourth group. In this implementation manner, all resources of m services are divided into two units, and then each unit is further grouped, for example, each unit is divided into two groups, thereby realizing resource allocation with smaller resource granularity.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, the first sequence includes p third units, and a group resource number corresponds to N different The third unit.

Further, p=2 ^k -1, in the 2 ^k -1 third units, each third unit corresponds to a group number i, i is any one of 1 to k, and the i-th group of resources The number corresponds to 2 ^i-1 third units in the first sequence. For example, k=4, the first sequence contains 15 third units in total, and these 15 third units contain 2 ^i-1 = 8 4, i=4; 2 ^i-1 = 4 3, i =3; 2 ^i-1 = 2 2, i=2 and 2 ^i-1 = 1 1, i=1. In addition, this embodiment does not limit the order of the group numbers i corresponding to the 15 third units.

Wherein, a group resource number corresponds to N different third units in the first sequence, for example, i=4, the fourth group resource number corresponds to N different third units of resource allocation units in the first sequence, The N=2 ^4-1 =8, that is, the number of resources in the fourth group occupies 8 third units among the 15 third units indicated in the first sequence, and the other 7 third units are from 1 to 1 Group 3 is occupied.

Further, in another possible implementation, the resource allocation unit N corresponding to the number of resources in the i-th group is 2 ^i-1 , and the resource allocation unit N corresponding to the number of resources in the i+1-th group is 2 ^i+1-1 , Wherein, the ^2i-1 resources include the first resource of the i-th group, and the ^2i+1- th resources include the first resource of the i+1th group and the second resource of the i+1th group ; The first sequence is used to indicate that the first resource of the i-th group is located between the first resource of the i+1th group and the second resource of the i+1th group among the L resources.

For example, i=3, the resource allocation unit N corresponding to the number of resources in the third group is 4, and one resource allocation unit in the third group includes the first resource, the second resource, the third resource, and the fourth resource of the third group. , If the four resources of the third group correspond to the first service and the second service, the first sequence indicates: allocate the first resource of the third group and the second resource of the third group to the The first service; the third resource of the third group and the fourth resource of the third group are allocated to the second service; or, the first resource of the third group and the third resource of the third group Allocating to the first service; allocating the second resource of the third group and the fourth resource of the third group to the second service. In this implementation manner, among the four resources, the two resources of the first service and the two resources of the second service are interleaved and allocated, so that the jitter of service resource allocation can be effectively reduced.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, the first sequence includes 2 ^k -1 units, and each unit corresponds to a group number i, where i is from 1 to k The first sequence is used to indicate the group number i corresponding to each of the units, and the m number of resources are determined according to the number of k groups of resources and the first sequence The resources corresponding to the services include: determining the resources corresponding to the m services according to the number of the k groups of resources and the group number i corresponding to each unit indicated by the first sequence.

Wherein, the first sequence is a palindrome arrangement of bits, the group number i is any one of the 1st to the kth bits, and the sequence number composed of ^{2 k -1 units is} A sequence number of 2 ^k-1 is the first center, and the bit sequence corresponding to the left sequence number of the first center and the bit sequence corresponding to the right sequence number are symmetrical about the first center; The left serial number of the center, with the serial number 2 ^k-2 as the second center, the bit sequence corresponding to the left serial number of the second center and the bit sequence corresponding to the right serial number are related to the second center Symmetrical; in the k-1 center with a sequence number of 2 ^k-(k-1) , the bit sequence corresponding to the left sequence number of the k-1 center is related to the bit sequence corresponding to the right sequence number The k-1th center is symmetrical.

In this implementation, the generated first sequence is a palindrome arrangement of bits, so that each bit is symmetrical about the center bit, and the resource allocation units of each group are split and arranged in order to reduce the jitter of service resources.

Optionally, with reference to the first aspect, in yet another possible implementation of the first aspect, the acquiring the first sequence includes: starting from all 0s to all bit values for each group of resource numbers, the bit value represented by binary 1 Listed in sequence, a total of 2 ^k count units; each time a count unit is generated, compare the bit value changes of the current count unit and the previous count unit to determine the bit that undergoes a transition. The transition refers to the same bit The bit value on the bit changes from 0 in the previous count unit to 1 in the current count unit; ^{all the transitioned bits corresponding to the determined 2 k} -1 count units are sorted to generate The first sequence. Wherein, the 2 ^k -1 counting units are all counting units remaining except for the first counting unit whose bit value is all 0.

Optionally, with reference to the first aspect, in yet another possible implementation of the first aspect, the acquiring the first sequence includes: using k resource allocation units of the k sets of resource numbers as k services, and using The preset algorithm establishes the correspondence between the k services and the total number of resources composed of the k services, and generates the first sequence according to the correspondence; wherein, the preset algorithm is: l×B modQ , L is a constant, the value of l ranges from 1 to Q; B is the number of resources required by any of the first to kth services represented by k services, Q is a parameter, and Q≥Max{B1 , B2, B3,..., Bk}, B1 represents the number of resources required by the first business, B2 represents the number of resources required by the second business, Bk represents the number of resources required by the k-th business, and Q≥B1 to Bk The maximum value in; mod represents the remainder operation, l×B modQ represents the remainder obtained by dividing l×B by Q.

Wherein, the first sequence is a bit sequence. The preset algorithm is the Sigma/Delta algorithm.

It should be noted that in the various embodiments of the present application, the lowercase "l" and the uppercase "L" have different meanings. The lowercase "l" is a constant, with a value range of 1 to Q, Q≥1 and positive Integer. The uppercase "L" represents the total number of transmission resources per unit time in a link channel, and L is greater than or equal to the total number of resources for m services.

In this implementation, the bit sequence is generated by the Sigma/Delta algorithm, and the resources required by m services can be allocated alternately, thereby reducing the jitter of service resources.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, the acquiring the first sequence includes: generating the bit sequence by interleaving bits, and the interleaving bits The bit method includes: inserting the first bit in the sequence number 2 ^{k-1 in the bit sequence composed of 2 k} -1 bits; taking the first bit as the center, and inserting the first bit in the first bit sequence. Insert a second bit to the left and right of each bit position; insert a third bit to the left and right of each second bit with each second bit as the center; until each The k-1th bit is the center, and a kth bit is inserted to the left and right of each k-1th bit.

商为a，余数为b，判断在满足所有商a为奇数的情况下的j值中，j取最小值；将计数器输出的所有计数单位的比特位进行排序生成所述比特位序列。 Optionally, with reference to the first aspect, in yet another possible implementation of the first aspect, the acquiring the first sequence includes: the bit values of all binary representations of the first device start from all 0s to the The bit values are all 1s listed in sequence, a total of 2 ^k counting units, the numbers are 0, 1, 2, ..., 2 ^k -1, wherein the number is represented by w; the first device counts once every time the counter Output a bit, the bit satisfies kj, where j is an exponential power of 2, 0≤j<k, and satisfies the first relationship:

The quotient is a, and the remainder is b. It is judged that j takes the minimum value among all j values when the quotient a is an odd number; the bits of all counting units output by the counter are sorted to generate the bit sequence.

Optionally, with reference to the first aspect, in yet another possible implementation of the first aspect, the method further includes: using an overhead frame to send service parameters, where the service parameters include: the number of services m, and m service numbers And the number of m resources.

Optionally, in combination with the first aspect, in yet another possible implementation of the first aspect, using the number of overhead frames to send the number of services m and the number of m resources includes: sending 32 flexible Ethernet FlexE overhead frames to Transmit the service parameters; wherein the 1st to 20th FlexE overhead frames are used to carry the m service numbers, the 21st to 27th FlexE overhead frames are used to carry the m resource numbers, and the 28th to the 28th FlexE overhead frames are used to carry the m service numbers. 32 FlexE overhead frames are used to carry reserved resources; and the version identifier VER field in each FlexE overhead frame is configured with a first identifier, and the first identifier is used to indicate the service carried in the FlexE overhead frame The number or the number of resources are currently used business parameters. In this implementation manner, the VER field is used to indicate the currently transmitted service parameters, thereby avoiding the transmission of redundant time slot resource configuration tables and saving transmission overhead.

Among them, each business corresponds to a required number of resources and a business number.

Further, in a possible implementation, the bit value corresponding to the first identifier is 1.

Optionally, in conjunction with the first aspect, in yet another possible implementation of the first aspect, sending the service parameter using an overhead frame includes: sending 2m+2 overhead frames to transmit the service parameter; where The 2m+2 overhead frames include the first overhead frame, the second overhead frame, the third overhead frame to the 2m+2 overhead frame, and the first overhead frame includes the sum of m resources, and The second overhead frame includes the number of services m, the m overhead frames in the 3rd to m+2th overhead frames include m service numbers, and the m+3th to 2m+2th overhead frames The m overhead frames include the number of m resources, and the version identifier VER field in each overhead frame is configured with a first identifier, and the first identifier is used to indicate the service number or the service number carried in the overhead frame. The number of resources is the currently used service parameter.

In this implementation, the FlexE interface is extended, and is no longer restricted by the original 100Gbps interface that can only support up to 20 service resource allocation restrictions; the expanded FlexE interface can define resource granularity according to business needs to determine the total number of resources. And the number of resources required by each business, thereby realizing flexible bandwidth allocation for multiple services.

Optionally, with reference to the first aspect, in another possible implementation of the first aspect, the overhead frame includes one control code block and Y data code blocks, Y≥2 and Y is a positive integer, and the control The code blocks are used to locate and transmit the number m of services, and the Y data code blocks are used to transmit the m resource numbers and the m service numbers.

Further, the Y data code blocks include at least one first code block, wherein one of the first code blocks is used to carry the number of m resources, or, in the at least one first code block, The m first code blocks are used to carry the m resource numbers.

A new frame format is defined in this implementation, and the frame format can change with the change of multiplexing services, so the services that can be carried are more flexible and have stronger flexibility. In addition, the m service parameters corresponding to the m services can be transmitted to the receiving end with only one transmission, which improves the transmission efficiency.

In the second aspect, an embodiment of the present application also provides a resource allocation device, which is used to implement the foregoing first aspect and the resource allocation method in various implementation manners of the first aspect. Wherein, the device includes at least one functional unit or module, and further, the at least one functional unit includes an acquisition unit, a processing unit, a sending unit, and the like.

Wherein, the obtaining unit is used to obtain the number of k groups of resources for m services, each group of resource numbers corresponds to a resource allocation unit N, and each group of resource numbers includes a coefficient a corresponding to each service, and the coefficient a represents a service The number of resource allocation units included, the resource allocation unit N represents the number of resources included in one resource allocation unit, k≥1, N≥1, and k and N are all positive integers; the processing unit is used for The resources corresponding to the m services are determined among the L resources according to the number of the k sets of resources.

In a third aspect, an embodiment of the present application also provides a network device, including a processor, a memory, and a communication interface, the processor is coupled to the memory, and further, the communication interface is used to obtain m services The number of k groups of resources, each group of resources corresponds to a resource allocation unit N, each group of resources includes a coefficient a corresponding to each service, and the coefficient a represents the number of resource allocation units included in a service, and the resource allocation unit N represents the number of resources included in a resource allocation unit, k≥1, N≥1, and k and N are all positive integers; the processor is configured to determine the number of resources among the L resources according to the number of k groups of resources. Resources corresponding to the m services.

Optionally, with reference to the third aspect, in a possible implementation of the third aspect, the communication interface is specifically configured to obtain the number of m resources corresponding to the m services, and each number of resources is in accordance with The first hexadecimal representation, m≥1; the k groups of resource numbers are obtained after each resource number expressed in the first hexadecimal system is expressed in a binary system, and the second binary system includes binary, octal, decimal, and hexadecimal. Base.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the processor is specifically configured to: The resources corresponding to the m services are determined from the L resources, where the number of resources allocated in each group is the product of the sum of the coefficient a of the m services and the resource allocation unit N corresponding to each group.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the processor is specifically configured to follow the order of the first group to the kth group, and if the first group to the kth group The allocated resources of any group in the kth group include two or more services, and each group including the two or more services is allocated in the order of service numbers or in the order of interleaving of service numbers. Resources corresponding to the business.

Optionally, with reference to the third aspect, in yet another possible implementation of the third aspect, the processor is specifically configured to obtain a first sequence, and the first sequence is used to indicate the number of the k groups of resources The location relationship between the resource allocation units N; according to the number of the k sets of resources and the first sequence, the resources corresponding to the m services are determined among the L resources.

Wherein, the first sequence includes k first units, and different first units correspond to different group resource numbers.

Optionally, in a possible implementation, the first sequence includes z second units, different second units correspond to different group resource numbers, at least one second unit corresponds to at least two group resource numbers, z <k, z is a positive integer and z≥2.

Optionally, in another possible implementation, the first sequence includes p third units, and a group resource number corresponds to N different third units in the first sequence.

Further, p=2 ^k -1, in the 2 ^k -1 third units, each third unit corresponds to a group number i, i is any one of 1 to k, and the i-th group of resources The number corresponds to 2 ^i-1 third units in the first sequence.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, i is any one of 1 to k, the resource allocation unit N corresponding to the number of resources in the i-th group is 2 ^i-1 , The resource allocation unit N corresponding to the number of resources in the i+1 group is 2 ^i+1-1 , where the 2 ^i-1 resources include the first resource of the i-th group, and the 2 ^i+1-1 resource It includes the first resource of the (i+1)th group and the second resource of the (i+1)th group; the first sequence is used to indicate that the first resource of the ith group is located in the (i+1)th resource among the L resources. Between the first resource of the group and the second resource of the i+1th group.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the first sequence includes 2 ^k -1 units, and each unit corresponds to a group number i, where i is from 1 to k The first sequence is used to indicate the group number i corresponding to each of the units, and the processor is specifically used to indicate the number of resources in the k groups and the number of each unit indicated by the first sequence. The corresponding group number i determines the resources corresponding to the m services.

Wherein, the first sequence is a palindrome arrangement of bits, the group number i is any one of the 1st to the kth bits, and the sequence number composed of ^{2 k -1 units is} A sequence number of 2 ^k-1 is the first center, and the bit sequence corresponding to the left sequence number of the first center and the bit sequence corresponding to the right sequence number are symmetrical about the first center; The left serial number of the center, with the serial number 2 ^k-2 as the second center, the bit sequence corresponding to the left serial number of the second center and the bit sequence corresponding to the right serial number are related to the second center Symmetrical; in the k-1 center with a sequence number of 2 ^k-(k-1) , the bit sequence corresponding to the left sequence number of the k-1 center is related to the bit sequence corresponding to the right sequence number The k-1th center is symmetrical.

Optionally, with reference to the third aspect, in yet another possible implementation of the third aspect, the processor is specifically configured to start with the bit value of each group of resource numbers expressed in binary from all 0s to all 1s. Listed in order, a total of 2 ^k count units; each time a count unit is generated, compare the bit value changes of the current count unit and the previous count unit to determine the bit that undergoes a transition. The transition refers to the same bit. The value of the above bit changes from 0 in the previous count unit to 1 in the current count unit; ^{all the transitioned bits corresponding to the determined 2 k} -1 count units are sorted to generate all The first sequence. Wherein, the 2 ^k -1 counting units are all counting units remaining except for the first counting unit whose bit value is all 0.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the processor is specifically configured to use the k resource allocation units of the k sets of resource numbers as k services, and use the preset Suppose an algorithm establishes the correspondence between the k services and the total number of resources composed of the k services, and generates the first sequence according to the correspondence; wherein, the preset algorithm is: l×BmodQ, l is a constant, the value of l ranges from 1 to Q; B is the number of resources required by any one of the first to kth services represented by k services, the value of B ranges from B1 to Bk, and Q≥ Max{B1, B2, B3,..., Bk}; mod represents the remainder operation, l×B modQ represents the remainder obtained by dividing l×B by Q.

Optionally, with reference to the third aspect, in yet another possible implementation of the third aspect, the processor is specifically configured to generate the bit sequence by interleaving bits, and the interleaving bits The method includes: inserting the first bit in the sequence number 2 ^{k-1 in the bit sequence composed of 2 k} -1 bits; taking the first bit as the center, and inserting the first bit in the first bit sequence. Insert a second bit to the left and right of each bit; insert a third bit to the left and right of each second bit with each second bit as the center; until each The k-1th bit is the center, and a kth bit is inserted to the left and right of each k-1th bit.

商为a，余数为b，判断在满足所有商a为奇数的情况下的j值中，j取最小值；将计数器输出的所有计数单位的比特位进行排序生成所述比特位序列。 Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the processor is specifically configured to start from all 0s to the bit values of all binary representations by the first device. The values of all 1s are listed in sequence, a total of 2 ^k counting units, and the serial numbers are 0, 1, 2, ..., 2 ^k -1, where the number is represented by w; the first device outputs the output every time the counter counts. A bit, the bit satisfies kj, where j is an exponential power of 2, 0dj<k, and satisfies the first relationship:

The quotient is a, and the remainder is b. It is judged that j takes the minimum value among all j values when the quotient a is an odd number; the bits of all counting units output by the counter are sorted to generate the bit sequence.

Optionally, in conjunction with the third aspect, in another possible implementation of the third aspect, the communication interface is further used to send service parameters using overhead frames, and the service parameters include: the number of services m and m Service number and the number of m resources.

Optionally, in conjunction with the third aspect, in another possible implementation of the third aspect, the communication interface is specifically configured to send the service parameters through 32 flexible Ethernet FlexE overhead frames; among them, the first to The 20th FlexE overhead frame is used to carry the m service numbers corresponding to the m services, the 21st to 27th FlexE overhead frames are used to carry the m resource numbers, and the 28th to 32nd FlexE overhead frames are used Resources are reserved for the bearer; and a first identifier is configured on the version identifier VER field in each FlexE overhead frame, and the first identifier is used to indicate that the service number or the number of resources carried in the FlexE overhead frame is the current Business parameters used.

Further, in a possible implementation, the bit corresponding to the first identifier is 1.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the communication interface is specifically configured to send 2m+2 overhead frames to transmit the service parameters; wherein, the 2m+ The two overhead frames include the first overhead frame, the second overhead frame, the third overhead frame to the 2m+2 overhead frame, the first overhead frame includes the sum of m resources, and the second overhead The frame includes the number of services m, the m overhead frames in the 3rd to m+2th overhead frames include m service numbers, and the m overheads in the m+3th to 2m+2th overhead frames The frame includes the number of m resources, and a first identifier is configured on the version identifier VER field in each overhead frame, and the first identifier is used to indicate that the service number or the number of resources carried in the overhead frame is The business parameters currently in use.

Optionally, with reference to the third aspect, in another possible implementation of the third aspect, the overhead frame includes one control code block and Y data code blocks, Y≥2 and Y is a positive integer, and the control The code blocks are used to locate and transmit the number m of services, and the Y data code blocks are used to transmit the m resource numbers and the m service numbers.

Further, the Y data code blocks include at least one first code block, wherein one first code block is used to carry the m number of resources, or the m number of the at least one first code block One code block is used to carry the number of m resources.

In a fourth aspect, the embodiments of the present application also provide a network system, which includes a sending-end device and a receiving-end device. The sending-end device and the receiving-end device may be those described in the foregoing various implementations of the third aspect. The network device is configured to implement the foregoing first aspect and the methods described in various implementation manners of the first aspect.

In the fifth aspect, the embodiments of the present application also provide a computer storage medium, the computer storage medium stores instructions, and when the instructions are run on a computer, they can implement part or all of the resource allocation methods provided in the present application. step.

In addition, this application also provides a computer program product. The computer program product includes one or more computer instructions, such as resource allocation instructions. When the instructions are run on a computer, some or all of the steps in the embodiments of the resource allocation method provided in this application can be implemented.

In a sixth aspect, the embodiments of the present application also provide an overhead frame, the overhead frame includes a version identifier VER field, and a first identifier is configured in the VER field, and the first identifier is used to indicate where the overhead frame is located. The service number or resource number carried is the service parameter currently used. Optionally, the bit value carried by the first identifier is "1".

Further, when the bit value carried by the first identifier is "1", the overhead frame is also used to carry the service number of a service, or the number of resources required by the service.

Wherein, the overhead frame is a flexible Ethernet FlexE overhead frame.

Further, the service parameters are sent through 32 FlexE overhead frames; among them, the 1st to 20th FlexE overhead frames are used to carry m service numbers corresponding to the m services, and the 21st to 27th FlexE overhead frames are used for Carrying the number of m resources, the 28th to 32nd FlexE overhead frames are used to carry reserved resources.

Optionally, with reference to the sixth aspect, in yet another possible implementation of the sixth aspect, the number of services m and the number of m resources are sent through 2m+2 overhead frames; wherein, the 2m+ The content carried in the two overhead frames includes: the number of services m, the sum of the number of resources required by the m services P, the service number, and the number of the m resources; and the version in each overhead frame The identifier VER field is configured with a first identifier, and the first identifier is used to indicate that the service number or the number of resources carried in the overhead frame is a currently used service parameter.

Optionally, in another possible implementation, the service parameters may also be transmitted by sending 2m+2 overhead frames. Specifically, the 2m+2 overhead frames include the first overhead frame and the second overhead frame. The overhead frame, the third overhead frame to the 2m+2th overhead frame, the first overhead frame includes the sum of the number of resources of m resources, the second overhead frame includes the number of services m, and the first overhead frame includes the number m of services. The m overhead frames in the 3 to m+2th overhead frames include m service numbers, the m overhead frames in the m+3 to 2m+2th overhead frames include the m resource numbers, and each The version identifier VER field in each overhead frame is configured with a first identifier, and the first identifier is used to indicate that the service number or the number of resources carried in the overhead frame is a currently used service parameter.

In the seventh aspect, the embodiments of the present application also provide another overhead frame. The overhead frame includes a control code block and Y data code blocks, Y ≥ 2 and a positive integer, and the control code block is used to locate and transmit data. The number of services is m, and the Y data code blocks are used to transmit the number of m resources and the number of m services.

Further, the Y data code blocks include at least one first code block, wherein one first code block is used to carry the m number of resources, or the m number of the at least one first code block One code block is used to carry the number of m resources.

The resource allocation method and device provided in this embodiment divide the resource number of m services into k groups of resource numbers, and perform resource allocation according to the resource allocation unit corresponding to each group of resource numbers in the k groups of resource numbers. The unit indicates the smallest unit of resource allocation in a group of resource numbers, so resource allocation with smaller resource granularity is realized, and the flexibility and scalability of resource allocation are improved.

In addition, when the granularity of resource allocation is small, through the same rules on both the sender and the receiver, the sender only needs to send the multiplexing scheme of the service allocation instead of sending the redundant resource configuration table to the receiver, thereby reducing This reduces the resource overhead of sending a long resource configuration table.

Description of the drawings

FIG. 1 is a schematic structural diagram of a FlexE provided by an embodiment of the application;

FIG. 2 is a schematic diagram of a FlexE time slot configuration table provided by an embodiment of the application;

FIG. 3 is an architecture diagram of a network system including a sending end 10 and a receiving end 20 according to an embodiment of the application;

FIG. 4 is a flowchart of a resource allocation method provided by an embodiment of the application;

FIG. 5 is a schematic diagram of allocating service resources according to a sequential method according to an embodiment of the application; FIG.

FIG. 6 is a schematic diagram of allocating service resources according to an interleaving method according to an embodiment of the application;

FIG. 7a is a schematic diagram of grouping binary resource numbers according to an embodiment of this application;

FIG. 7b is a schematic diagram of allocating service resources according to a segmentation method according to an embodiment of the application;

FIG. 7c is another schematic diagram of allocating service resources according to the segmentation method according to an embodiment of the application;

FIG. 7d is another schematic diagram of allocating service resources according to the segmentation method provided by an embodiment of the application; FIG.

FIG. 8 is a schematic diagram of a service resource provided by an embodiment of this application;

FIG. 9a is a schematic diagram of grouping resource numbers according to an embodiment of the application;

FIG. 9b is a schematic diagram of service resource allocation provided by an embodiment of this application;

FIG. 10a is a schematic diagram of a bit sequence provided by an embodiment of this application;

FIG. 10b is a schematic diagram of determining hopping bit positions according to an embodiment of the application;

FIG. 10c is a schematic diagram of a bit palindrome arrangement provided by an embodiment of the application;

FIG. 10d is a schematic diagram of a corresponding relationship between each bit and a service provided by an embodiment of this application;

FIG. 10e is a schematic diagram of implementing service resource allocation by using a palindrome arrangement of bits according to an embodiment of the application; FIG.

FIG. 11 is a schematic diagram of a palindrome arrangement for generating bits according to an embodiment of the application;

FIG. 12 is a schematic diagram of another palindrome arrangement for generating bits according to an embodiment of the application;

FIG. 13a is a schematic diagram of bit allocation using the Sigma/Delta algorithm according to an embodiment of the application;

FIG. 13b is a schematic diagram of generating a bit sequence by using the Sigma/Delta algorithm according to an embodiment of the application;

FIG. 13c is a schematic diagram of realizing service resource allocation by using a bit sequence according to an embodiment of the application; FIG.

FIG. 14a is a schematic structural diagram of a FlexE overhead code block provided by an embodiment of this application;

FIG. 14b is a schematic diagram of transmitting service parameters using FlexE overhead code blocks according to an embodiment of the application;

14c is another schematic diagram of transmitting service parameters using FlexE overhead code blocks according to an embodiment of the application;

FIG. 15a is a schematic structural diagram of an overhead frame provided by an embodiment of this application;

15b is a schematic structural diagram of a control code block in an overhead frame provided by an embodiment of this application;

FIG. 15c is a schematic structural diagram of a first code block provided by an embodiment of this application;

FIG. 16 is a schematic structural diagram of a resource allocation device provided by an embodiment of this application;

FIG. 17 is a schematic structural diagram of a network system provided by an embodiment of this application.

Detailed ways

Before describing the technical solutions of the embodiments of the present application, first introduce the terms and related background involved in the present application.

Ethernet (Ethernet) is a baseband local area network specification, and it is the most common communication protocol standard used by existing local area networks today. Flexible Ethernet (Flexible Ethernet, FlexE) is an interface technology that implements service isolation and bearer and network fragmentation. It has developed rapidly in the past two years and has been widely accepted by major standards organizations. Ubiquitous Ethernet (X-Ethernet, XE) is a technology system based on the bit block (Bit Block) exchange of the Ethernet physical layer. It has the characteristics of deterministic and ultra-low latency. The encoding type used by XE can be: 64B/66B encoding type, etc.

Among them, for FlexE, the FlexE standard protocol defined by the Optical Internetworking Forum (Optical Internetworking Forum, OIF) standardization organization is based on a physical link group composed of several 50/100/200/400G Ethernet physical interfaces, and each interface supports one Or multiple FlexE instances, each instance introduces a fixed periodic frame structure. The time slot is divided based on a time division multiplexing mechanism (Testing Data Management, TDM), and one or more time slots are used to support an Ethernet service flow or a flexible Ethernet client (FlexE Client) signal. For the 100Gbps FlexE instance, a fixed periodic frame structure includes 20 time slots, and each time slot has 8184 (1023×8=8184) transmission windows of 66 bits. Since the bandwidth of one time slot is 5Gbps, each 66-bit transmission window is equivalent to 0.61Mbps (5Gbps/8184=0.61Mbps) bandwidth resources.

In the flexible Ethernet, OIF formulated the FlexE standard, and realized the decoupling of the rate between the Media Access Control (MAC) layer and the Physical Layer (PHY) layer by introducing FlexE Shim, that is, the MAC layer The rate does not need to correspond to the rate of the PHY layer one-to-one.

As shown in Figure 1, the FlexE standard defines FlexE client (Client), FlexE cushion (Shim) and FlexE group (Group). FlexE Client is a MAC layer service, and its service rate can be 10Gbps, 40Gbps or m×25Gbps. FlexE Group binds multiple PHYs into a group to support larger bandwidth. For example, two 100Gbps PHYs can be bound into 200Gbps ports. The FlexE Shim layer maps or demaps FlexE Client signals to FlexE Group, which includes multiplexing and demultiplexing processes. Among them, the FlexE multiplexing process refers to the sending direction, which is mapped from the FlexE Client to the FlexE Group; the demultiplexing process refers to the receiving direction, and the FlexE Client is demapped from the FlexE Group.

FlexE divides time slots to support lower service rates; and allocates time slots to achieve flexible bandwidth allocation. For 100Gbps PHY, FlexE divides it into 20 time slots, each of which is 5Gbps. Therefore, FlexE can support services at a minimum rate of 5Gbps. According to the actual service rate, FlexE uses the FlexE configuration table (Calendar) to allocate time slots on demand, such as 15Gbps services. FlexE Calendar can allocate 3 time slots for it, and each time slot is 15Gbps bandwidth. FlexE Calendar allocates bandwidth by determining the business to which each time slot belongs.

As shown in Figure 2, in the FlexE standard, Calendar is divided into configuration table A and configuration table B. Among them, configuration table A and configuration table B are mutual backups. The configuration table A has a total of 20 entries, corresponding to 20 time slots, and each entry indicates the specific client ID to which the current time slot belongs. For example, the client ID is used to configure time slot 0 of table A (English: Client ID for calendar A slot 0). For another example, the second entry in configuration table A is filled with client ID 0x1111, and the second table The entry corresponds to slot 1 (slot 1), indicating that slot 1 is occupied by client ID 0x1111. Different time slots in the configuration table A may have the same client ID, which means that these time slots are allocated to the same client. Similarly, the configuration table B is similar to the configuration table A, and also has 20 entries, and each entry indicates the specific client to which the current time slot belongs.

Through the above-mentioned time slot division and time slot allocation, FlexE breaks the stepped rate system established by the IEEE 802.3 standard, realizes the flexible allocation of bandwidth, and supports arbitrary N×5Gbps services. At the same time, Huawei went a step further by privately implementing FlexE with 1Gbps granules to support N×1Gbps services.

Although the existing FlexE allocation mechanism realizes a service with a time slot granularity of 5 Gbps or a smaller granularity of 1 Gbps, the divided time slot granularity still does not meet the requirements for small granular services and non-integer time slot granular services. The service support for these smaller time slot particles is not flexible enough. In order to efficiently support smaller granular services and non-integer time slot granular services, the granularity of the divided time slots must be smaller, which leads to an increase in the number of divided time slots under the same interface. The increase in the number of time slots will increase the cost of time slot maintenance and management. Therefore, for small-particle time slots, the time slot configuration table of FlexE is not scalable. In addition, the time slot configuration of FlexE is transmitted through FlexE multiframes, and it is impossible to dynamically allocate bandwidth in real time.

The technical scenarios of the embodiments of the present application and the equipment included in the technical scenarios are introduced below.

The technical scenarios applied by the technical solutions of the various embodiments of the present application include, but are not limited to, Ethernet, flexible Ethernet, and optical transport network (Optical Transport Network, OTN), and these networks include at least two network devices. The product form of the network equipment may include typical core routers, edge routers, OTN transmission equipment, etc., as well as specific scenarios-oriented IP radio access network (Radio Access Network, RAN) box-type or frame-type transmission equipment, packet transmission network (Packet Transport Network, PTN) box-type or frame-type transmission equipment, etc.

The technical solution of the present application can be applied between the interfaces of any two network devices, for example, multiple services are input from one device interface and output from another device interface. Further, the interface of the network device may be a FlexE interface, an OTN interface, an Ethernet interface, etc., or may also be a pipe divided by these interfaces.

As shown in FIG. 3, a network system includes a sending end 10 and a receiving end 20, and the sending end 10 and the receiving end 20 are connected through a communication interface. The sending end 10 is used to multiplex multiple services and send the multiplexed data to the receiving end 20. After receiving the multiplexed data from the transmitting end 10, the receiving end 20 demultiplexes the data, thereby recovering the original multiplexed service data.

Wherein, the multiplexing of multiple services means that multiple services data share a transmission pipe for transmission, in which each service occupies resources in the transmission pipe according to its own service bandwidth requirements. The demultiplexing of multiple services is the inverse process of multiplexing multiple services, and it refers to recovering the original multiple service data from the transmission pipeline.

Specifically, on the side of the sending end 10, the service parameters are first obtained, and the service parameters include: the number of services, the service number, and the number of resources required for each service. For example, the number of known services is m, m≥1, and each service corresponds to a number. The corresponding service numbers of m services are S1, S2, ..., Sm, and each service requires a certain amount of resources (can be Called the number of resources) bearer; the number of resources corresponding to the m services with service numbers S1, S2, ..., Sm are C1, C2, ..., Cm, respectively. Then, the sending end 10 determines a multiplexing scheme according to the number of resources required by each service; finally, the sending end 10 multiplexes m services according to the multiplexing scheme, and sends the multiplexed data to the receiving end 20.

On the receiving end 20 side, the receiving end 20 first obtains the service parameters, and then determines the demultiplexing scheme according to the service parameters, and finally performs the demultiplexing operation on the multiplexed data stream sent by the sending end 10 according to the demultiplexing scheme, and recovers m-way business. The receiving end 20 determines the demultiplexing scheme in the same manner and process as the transmitting end 10, so as to ensure that the demultiplexing scheme of the receiving end 20 and the multiplexing scheme of the transmitting end 10 are consistent.

It should be noted that for both the sender and the receiver, it is necessary to know which service the resource in the transmission pipeline belongs to, so that the multiple services can be multiplexed or demultiplexed smoothly, and the multiplexing or demultiplexing can be guaranteed. In the process of use, the result of determining which service each resource belongs to in the transmission pipeline is consistent with the equipment at both ends. In order to ensure that the results determined by the equipment at both ends in the multiplexing or demultiplexing process are consistent, certain rules or methods need to be adopted To allocate resources, the preset rules or allocation methods will be specifically described in the following embodiments.

Example one

In this embodiment, the sending end 10 is taken as an example to describe the multiplexing operation of the sending end 10 in detail. Specifically, the main core method flow of the sending end is shown in FIG. 4, this embodiment provides a resource allocation method, and each step of the method can be executed by the sending end 10. Specifically, the method includes:

101: Obtain the number of k groups of resources for m services, each group of resources corresponds to a resource allocation unit N, and each group of resources includes the coefficient a corresponding to each service, k≥1, N≥1 and k, N are all positive Integer.

Wherein, the coefficient a represents the number of resource allocation units included in a service, and the resource allocation unit N represents the number of resources included in one resource allocation unit. The number of resources, or the number of resources for short, refers to the resources required to transmit a certain service. For example, an Ethernet service requires 10 Mbps bandwidth. If 1 Mbps bandwidth is used as the basic unit of resources, the service requires 10 such resources. That is, the number of resources is 10.

Step 101 includes: obtaining the number of m resources corresponding to the m services, each of the resource numbers is expressed in a first base, m≥1; and each resource number expressed in the first base is passed The number of resources in the k groups is obtained after the first binary representation, and the second binary includes binary, octal, decimal, hexadecimal, and so on.

For example, the sender obtains the number of 3 resources corresponding to 3 services (m=3), the number of resources is represented by "C", and the service is represented by the service number "S", then the services S1, S2, and S3 The corresponding resource numbers are C1, C2, and C3. And each resource number C is represented by the first base, such as decimal. In an example, the resource numbers C1, C2, and C3 corresponding to the services S1, S2, and S3 are respectively, C1=10, C2=4, C3=6, and the total number of resources is C1+C2+C3=20.

After converting each of C1, C2, and C3 represented by decimal numbers into binary numbers, k groups of resource numbers are obtained,

C1＝10＝0×2 ⁰ +1×2 ¹ +0×2 ² +1×2 ³ , the binary representation is 0101;

C2=4=0×2 ⁰ +0×2 ¹ +1×2 ² +0×2 ³ , the binary representation is 0010;

C3=6=0×2 ⁰ +1×2 ¹ +1×2 ² +0×2 ³ , the binary representation is 0110.

Obtain 4 sets of resource numbers according to the 3 resource numbers in the binary representation, k=4,

Among them, the four sets of resource numbers obtained in step 101 are: the first set of resources {0,0,0}, the second set of resources {2,0,2}, and the second set of resources {0,4, 4}, the number of resources in the second group {8,0,0}. The resource allocation unit N corresponding to the number of resources in the first group is 1, the resource allocation unit N corresponding to the number of resources in the second group is 2, the resource allocation unit N corresponding to the number of resources in the third group is 4, and the resource corresponding to the fourth group of resources The allocation unit N is 8. For binary, the coefficient a is 0 or 1.

It can be seen from the above relationship that for business S1, 2 and 8 resources need to be allocated in the second and fourth groups; for business S2, 4 resources need to be allocated in the third group; for business S3, in Groups 2 and 3 need to allocate 2 and 4 resources.

102: Determine resources corresponding to the m services from the L resources according to the number of k sets of resources.

Among them, L resources refer to the total number of transmission resources per unit time in a link channel. And L is greater than or equal to the sum of the resource numbers of m services, that is, L≥(C1+C2+C3+...+Cm). Further, if L is greater than the sum of the number of resources of m services, it indicates that there are vacant resources; further, if these vacant resources are used as resources required by a service, it can be understood that L resources are equal to m+1 services The total number of resources.

The sender configures the number of resources required by m services in L transmission resources to form a multiplexing scheme for m services, and then multiplexes the m services according to the multiplexing scheme, and sends the multiplexed service to the receiving end Data flow.

For example, in the L resources, the number of resources allocated in each group is the product of the sum of the coefficient a of m services and the resource allocation unit N corresponding to each group. L is the total number of resources. In this example, L=20, that is, the 20 resources required for 3 services are allocated to L resources through 4 groups of resources. Further, the number of resources in the first group is 0. No resource allocation; the number of resources in the second group is 4 (4=(1+0+1)×2), corresponding to services S1 and S3, each service is allocated 2 resources; the number of resources in the third group is 8 (8=(0+1+1)×4), corresponding to services S2 and S3, each service is allocated 4 resources; the number of resources in the fourth group is 8 (8=(1+0+0)×8) , Corresponding to service S1, and 8 resources need to be allocated for service S1. As shown in Table 1,

Table 1

A first specific implementation manner is to obtain a first sequence, where the first sequence is used to indicate the position relationship between the resource allocation units N of the number of resources of the k groups.

Specifically, the first sequence includes k first units, and different first units correspond to different numbers of group resources. For example, the number of k groups of resources is k first units, where the first first unit corresponds to the number of resources in the first group, the second first unit corresponds to the number of resources in the second group, and so on, the kth first unit Corresponding to the number of resources in the k-th group, the first sequence can indicate the positional relationship between the number of resources in the first group to the k-th group. Further, the order between the k first units indicated by the first sequence may be arbitrary.

In an example, the k first units are allocated resources corresponding to m services among the L resources in the order of 1 to k. For example, as shown in FIG. 5, k=4, the first sequence indicates that the order of the four first units is 1, 2, 3, and 4. Since the first group has no resources, it is not shown in Figure 5. Starting from the second group, according to the order of the service numbers from S1 to S3, the service allocation of 20 resources are arranged in sequence, and the sending end will assign the first to second, thirteenth Time slot resources No. 20 are allocated to service S1, No. 3 to No. 4, No. 9 to No. 12 time slot resources are allocated to Service S3, and No. 5 to No. 8 time slot resources are allocated to Service S2. Finally, the service numbers corresponding to time slot 1 to time slot 20 are as follows: S1, S1, S3, S3, S2, S2, S2, S2, S3, S3, S3, S3, S1, S1, S1, S1 , S1, S1, S1, S1.

Generally speaking, for the multiplexing scheme of m services, the corresponding service numbers of m services are S1, S2, ..., Sm, and the corresponding resource numbers are C1, C2, ..., Cm, and Ci is C1 to Any one of Cm, when Ci is expressed in binary, can be written as: Ci=(a _i,1 ,a _i,2 ,...,a _i,k )=a _i,1 ×2 ⁰ +a _i,2 × 2 ¹ +…+a _i,k ×2 ^k-1 ,

Where k is the number of resource groups, a _i,j are coefficients, and in binary, a _i,j ∈{0,1}, the base corresponding to the _{coefficients a i,j} ^{is 2 j-1} , i=1, 2 ,..., m, j = 1, 2,..., k.

Using the binary representation of the number of resources Ci, resource allocation can be completed in k groups according to the base, and the resource unit allocated for each group is twice that of the previous group. The resource allocation unit N of the first group is 1, the resource allocation unit N of the second group is 2, and the resource allocation unit N of the third group is 4, so the allocation is continued, the resource allocation unit N of the jth group is 2 ^j-1 , And finally the resource allocation unit N of the ^{k-th group is 2 k-1} resources. Then the transmission can determine the resource allocation for the service Si in the i-th group according to the coefficient a. For example, when the coefficient a _i,j of the number of resources Ci is "1", it means that resources need to be allocated to the service Si in the jth group; when the coefficient a _i,j is "0", it means that it does not need to be in the jth group. Allocate resources to the business Si.

In addition, the method also includes:

103: Generate a multiplexing plan for m services according to the resources corresponding to the m services, and multiplex the current resources according to the multiplexing plan.

The sending end multiplexes the current 20 time slot resources according to the corresponding relationship of the 20 time slot resources corresponding to the 3 services of S1, S2, and S3, and sends the multiplexed data to the receiving end. Specifically, the process of multiplexing and sending the multiplexed data at the transmitting end can be implemented in a variety of ways, which is not limited in this embodiment.

The method provided in this embodiment divides the number of resources of m services into k groups of resource numbers, and allocates resources according to the resource allocation unit corresponding to each group of resource numbers in the k groups of resource numbers. Because the resource allocation unit indicates a resource allocation unit. The smallest unit of resource allocation in the number of group resources, so resource allocation with smaller resource granularity is realized, and the flexibility and scalability of resource allocation are improved.

Optionally, in the foregoing step 102, when the resources corresponding to the m services are determined among the L resources, if the allocated resources of any group from the first to the kth group include two or more services , For a group containing two or more services, the resources corresponding to each service can be allocated in the order of interleaving, which is also referred to as "interleaving".

In a second specific implementation manner, the first sequence indicates that the group order of the four first units is 1, 2, 3, and 4. In addition, in the above table 1, the number of resources in the second group corresponds to services S1 and S3, and the resource allocation unit N is 2, then service S1 and service S3 can be interleaved and allocated in one allocation, that is, S1 and S3 are taken as a whole Assign business. Referring to Figure 6, among the 4 resources in the second group, the first resource (slot 1) and the third resource (slot 3) are allocated to service S1, and the second resource (slot 2) and the fourth resource are allocated to service S1. (Time slot 4) is allocated to service S2. Similarly, in the resource allocation of the third group, the services that need to be allocated are S2 and S3, and the 8 resources of the third group are allocated in the order of S2 and S3 interleaving and polling. Therefore, the obtained multiplexing scheme is shown in Figure 6. The sender allocates the 1, 3, 13-20 time slot resources to the service S1, and the 5, 7, 9 and 11th time slot resources to the service S2. , Allocate the resources of the second, fourth, sixth, eighth, tenth, and twelfth time slots to service S3. According to the multiplexing scheme, the sending end can multiplex 3 services.

Wherein, optionally, the sequence formed by the group numbers of the second to fourth groups may be referred to as the first sequence, and the first sequence indicates the positional relationship between the number of k groups of resources, and the number of resources in each group can be regarded as One first unit, that is, the number of k groups of resources corresponds to k first units.

A third specific implementation manner is that the first sequence includes z second units, different second units correspond to different group resource numbers, and at least one second unit corresponds to at least two group resource numbers, z<k , Z is a positive integer and z≥2. The first sequence indicates that the order of the z second units is 1, 2, 3,... Z. The k groups of resource numbers can be divided into at least two second units, and each second unit can be further divided into two or more resource numbers.

For example, when k=4, there are 4 sets of resource numbers, z=2, the first sequence includes two second units, and each second unit corresponds to two sets of resource numbers in k groups. For example, one second unit corresponds to the number of resources in the first and second groups in the k groups, and another second unit corresponds to the number of resources in the third and fourth groups in the k groups; then, for each second unit The two groups are sorted by position.

Or, when the coefficient a corresponding to a set of resource numbers is not the binary bit value "1" or "0", the coefficient a can be segmented, for example, the coefficient a can be divided into two or two segments according to the binary rule Above, the number of characters (or number of bits) contained in each paragraph is the same. Between two adjacent paragraphs is called inter-paragraph. Two or more characters in a paragraph are called intra-paragraph. This method is called "division". Paragraph method".

Specifically, when the number of resources required by each service is expressed in binary, the coefficient a determines whether the service needs to allocate resources, and the basis determines the number of resources allocated each time. For example, for any business Si, the required number of resources Ci can be expressed in binary as:

Ci=(a _i,1 ,a _i,2 ,…,a _i,k )=a _i,1 ×2 ⁰ +a _i,2 ×2 ¹ +…+a _i,k ×2 ^k-1 ,

Among them, k is the number of resource groups, a _i,j are coefficients, a _i,j ∈{0,1}, the basis corresponding to the _{coefficients a i,j} ^{is 2 j-1} , i=1, 2, ..., m, j=1, 2, ..., k.

Assuming k=p×d, the binary sequence of the resource number Ci can be divided into p segments, and each segment contains d resource allocation units, then the resource number Ci can be expressed as:

Ci=((a _i,1 ,a _i,2 ,…,a _i,d ),(a _i,d+1 ,a _i,d+2 ,…,a _i,2d ),... .(a _i,(p-1)d+1 ,a _i,(p-1)d+2 ,…,a _i,pd ))=(a _i,1 ×2 ⁰ +…+a _i,d ×2 ^d-1 )+(a _i,d+1 ×2 ^d +…+a _i,2d ×2 ^2d-1 )+(a _i,(p-1)d+1 ×2 ^{(p-1) d} +…+a _i,pd ×2 ^pd-1 )=(a _i,1 ×2 ⁰ +…+a _i,d ×2 ^d-1 )+(a _i,d+1 +…+a _{i, 2d} ×2 ^d-1 )×2 ^d +…+(a _i,(p-1)d+1 +…+a _i,pd ×2 ^d-1 )×2 ^(p-1)d .

Therefore, the service Si can allocate resources according to the p segments, and in each segment, the resources can be allocated according to the sequential method, or the polling interleaving method, or the sequential method and the polling interleaving method. The d resource allocation units in each segment can also be allocated according to the sequential method, or the polling interleaving method, or the sequential method and the polling interleaving method.

The following takes the number of services m=3 in the above embodiment as an example for description. Among them, the service numbers of the three services are S1, S2, and S3, and the corresponding resource numbers are C1, C2, and C3, and C1=10. , C2=4, C3=6, and the total number of resources is 20. The binary corresponding to each resource number is segmented into two segments, each segment contains 2 bits, that is, p=2, d=2.

C1=10=((0,1),(0,1))=(0×1+1×2 ¹ )+(0×1+1×2 ¹ )×2 ² ;

C2=4=((0,0),(1,0))=(0×1+0×2 ¹ )+(1×1+0×2 ¹ )×2 ² ;

C3=6=((0,1),(1,0))=(0×1+1×2 ¹ )+(1×1+0×2 ¹ )×2 ² .

After segmentation, the 3 services include two sets of resource numbers, that is, two second units, z=2,

The number of resources corresponding to the first second unit is 4, the resource allocation unit N is 1, and the coefficient is 4 (4=2+0+2); the number of resources corresponding to the second second unit is 16, and the corresponding resource allocation The unit N is 4, and the coefficient is 4 (4=2+1+1).

As shown in Figure 7a, in order to avoid that the first resource of the service is 0 and the corresponding coefficient a is “0”, the characters “0” and “1” in each segment of the binary representation of the services S1, S2, and S3 "The order of exchange, that is, the order from high to low within the paragraph is: C1=((1,0),(1,0)), C2=((0,0),(0,1)), C3=((1,0), (0,1)). Then, the coefficients of the three services corresponding to the first group are {10,00,10}, and the coefficients of the three services corresponding to the first group are {10,01,01}. According to the order of the groups, the first group is allocated 4 resources, and the second group is allocated 16 resources.

For the resources of each group, services can be allocated according to the sequential method or the interleaving method. specifically,

One way to allocate between groups is, as shown in Figure 7b, for the 4 resources of the first group of resources, corresponding to services S1 and S3, the resource allocation unit in the group is 2, and the 4 resources corresponding to the sequence method are respectively These are S1, S1, S3, and S3. For the 16 resources of the second group, divided into 4 groups according to the interleaving method. The 4 resources corresponding to each group are S2, S3, S1, and S1. The team allocates resources and repeats 4 times. The service multiplexing schemes corresponding to time slot resources 1 to 20 established according to this allocation method are: S1, S1, S3, S3, S2, S3, S1, S1, S2, S3, S1, S1, S2, S3, S1, S1, S2, S3, S1, S1.

Another way to allocate between groups is, as shown in Fig. 7c, both within and between segments are allocated according to the polling interleaving method. The four resources of the number of resources in the first group are allocated according to the way of interleaving services S1 and S3 to obtain four resources, namely S1, S3, S1, and S3. Then it forms a multiplexing scheme with the 16 resources of the second group, and the allocation method of the second group can also be allocated in the order of S2, S3, S1, and S1 interleaving.

In addition, another method of allocation between groups can also be that the number of resources in the first and second groups are allocated in a sequential manner, and the resulting resource reuse scheme is shown in Figure 7d. The number of resources in the first group is as follows Resources are allocated in the order of S1, S1, S3, and S3, the number of resources in the second group is allocated in the order of S2, S3, S1, and S1, and the resource allocation unit in the second group is 4.

It should be noted that this embodiment does not limit the various specific allocation methods among the foregoing groups. And in the process of segmentation or grouping, each large group of resources can be divided once or more than once, until the number of resources of each group is a binary resource allocation unit after division. The number of segmentation or grouping is not limited.

This embodiment proposes a segmented resource allocation method. When allocating services, the bits of the number of resources are segmented, and the resource allocation of the services is realized through the intra-segment and the inter-segment, and through the sub-segmentation within the segment, the result is Recursive resource allocation method. This can effectively reduce the jitter of service resource allocation.

In addition, when the polling and interleaving method is used for resources within and between segments, the resources occupied by each service are relatively more uniform and the jitter is lower.

Further, it is understandable that this embodiment divides the resource number bit sequence into segments, and the resource allocation of the service is realized by resource allocation within and between segments. If the length of the divided segment is large, the bit sequence in the segment can be further divided to form a recursive segmentation method, which can be called a recursive resource allocation method. Further, the further division and the allocation of resources after the division are the same as the allocation methods shown in FIG. 7a to FIG. 7d, and will not be repeated here.

Example two

In this embodiment, when m=1, that is, there is only one service S1, and the number of resources required by S1 is C1, for example, C1=10. The resource allocation process for this service in this embodiment includes:

101: Acquire the number of k groups of resources of the service S1. Specifically, after converting the decimal resource number C1 into binary, 4 sets of resource numbers are obtained, k=4.

C1=10=0×2 ⁰ +1×2 ¹ +0×2 ² +1×2 ³ , and the binary representation is 0101.

Among them, the first and third groups have no resource allocation, the number of resources in the second group is 2, the corresponding coefficient a is 1, and the resource allocation unit N is 2; the number of resources in the fourth group is 8, and the corresponding coefficient a is 1. The resource allocation unit N is 8.

102: Determine the resource corresponding to the service S1 among the L resources according to the number of resources in the second group and the number of resources in the fourth group.

As shown in Figure 8, L=10, among the 10 time slot resources, time slots 1 and 2 are allocated two resources of the second group of service S1, and time slots 3 to 10 are allocated 8 resources of the fourth group of service S1. Resources, thereby completing the business allocation of C1=10 resources.

Example three

The foregoing embodiments all perform conversion and resource allocation for each decimal (first system) resource number according to the binary (first binary) rule. The resource allocation method in this application can also be extended to any system, such as octal, decimal, hexadecimal, etc. In this embodiment, the decimal system is used as an example in the binary system.

For example, m=3, the number of resources corresponding to services S1, S2, and S3 are C1=10, C2=4, and C3=6, respectively, which are expressed in decimal:

C1＝10＝0×10 ⁰ +1×10 ¹ , expressed as 0,1 in decimal system;

C2=4=4×10 ⁰ +0×10 ¹ , expressed as 4,0 in decimal system;

C3=6=6×10 ⁰ +0×10 ¹ , expressed as 6,0 in decimal notation.

Then get the two sets of resource numbers corresponding to 3 services, k=2,

The number of resources in the first group is 10, the resource allocation unit N is 1, and the coefficient is 10 (10=0+4+6), the number of resources in the second group is 10, the resource allocation unit N is 10, and the coefficient is 1 (1=1 +0+0). Among them, the number of resources in the first group includes services S2 and S3, and the number of resources that need to be allocated for service S2 is 4, and the number of resources that needs to be allocated for S3 is 6. In the number of resources in the second group, only service S1 is included, and the number of resources to be allocated for S2 is 10.

Further, the number of resources required by the two services in the first group can be regrouped, that is, the coefficient a=4 corresponding to service S2 and the coefficient a=6 corresponding to service S3 are divided into groups and allocated. For example, to convert 4 and 6 of the coefficient a into binary representation,

4＝0×2 ⁰ +0×2 ¹ +1×2 ² , the binary representation is 0,0,1;

6=0×2 ⁰ +1×2 ¹ +1×2 ² , the binary representation is 0,1,1.

The redistribution coefficients 4 and 6 can be divided into 3 groups. As shown in Figure 9a, the number of resources in the first group is 0, the number of resources in the second group is 2, and the number of resources in the third group is 8. In the second group, only business S3 is included, and the resource allocation unit corresponding to this business S3 is 2. In the third group, business S2 and S3 are included, and the resource allocation unit corresponding to each business is 4; there are two allocation methods . One is to allocate in the order of service numbers S2 and S3, and the corresponding resource allocation units are S2, S2, S3, and S3. The other is interleaved allocation according to service numbers S2 and S3, and the corresponding resource allocation units are S2, S3, S2, and S3.

As shown in Fig. 9b, the number of resources of the first group is 10 according to the allocation method of the second group and the third group to obtain the multiplexing scheme of the services S1, S2, and S3. Finally, determine the resource allocation plan corresponding to the three services: S3, S3, S2, S3, S2, S3, S2, S3, S2, S3, S1, S1, S1, S1, S1, S1, S1, S1, S1 , S1.

In this embodiment, when the coefficient a in the number of resources in each group is greater than or equal to 2, the smaller groups can be further divided into binary groups, so as to allocate smaller resource allocation units to achieve cross-distribution of services within each group, thereby Improve the flexibility of business allocation, and at the same time can effectively reduce the jitter of business resource allocation.

In summary, this embodiment proposes a resource allocation method based on arbitrary mechanism rules. For any service Si, the number of resources corresponding to it is Ci, and Ci can be expressed as:

Ci=(a _i,1 ,a _i,2 ,…,a _i,k )=a _i,1 ×α ⁰ +a _i,2 ×α ¹ +…+a _i,n ×α ^k-1 ,

Where k is the number of resource groups, a _{i, j} are coefficients, a _{i, j} ∈ {0,1}, the base corresponding to the _{coefficients a i, j} ^{is α j-1} , i=1, 2, ..., m , J = 1, 2, ..., k. For business Si, it can be divided into k groups to complete resource allocation. The number of resources in each group is a _i,j ×α ^j-1 , where the coefficient a _i,j can be the number of resource allocation units included in a business, and the base α ^{j- 1} is the resource allocation unit N. For example, the number of service resources Ci=45, if hexadecimal notation is used, it can be expressed as: Ci=45=0x2D=13+2×16.

The number of resources corresponding to the business Si is 45, which can be divided into 2 groups to complete the resource allocation. The number of resources in the first group is 13, and the number of resources in the second group is 32. The 32 resources in the second group can be further divided into two groups Allocation, such as dividing into the 1st group and the 2nd group, the resource allocation unit corresponding to each group is 16.

This embodiment extends the binary-based resource allocation method to any hexadecimal system, thereby realizing resource allocation of multiple services for multiplexing or demultiplexing processes, so as to increase the flexibility of resource allocation and reduce the jitter of service allocation.

Example four

This embodiment is directed to various different implementations of step 102 in the above embodiment 1. Specifically, the above step 102 includes: acquiring a first sequence, the first sequence being used to indicate the resource allocation unit of the number of k groups of resources The positional relationship between N; according to the number of k sets of resources and the first sequence, the resources corresponding to the m services are determined among the L resources.

Among them, the resource allocation unit N corresponding to the number of resources in the i group is 2 ^i-1 , the resource allocation unit N corresponding to the number of resources in the i+1 group is 2 ^i+1-1 , and i is any one of 1 to k Value, wherein the ^2i-1 resources include the first resource of the i-th group, and the ^2i+1-1th resources include the first resource of the i+1th group and the first resource of the i+1th group. Two resources; the first sequence is used to indicate that the first resource of the i-th group is located in the L resources among the first resource of the i+1th group and the second resource of the i+1th group between.

For example, i=2, the resource allocation unit corresponding to the second group is 2 ^2-1 = 2, the second group includes the first resource and the second resource; the resource allocation unit corresponding to the third group is 2 ^3-1 =4, the third group includes the first, second, third and fourth resources; then the first sequence is used to indicate that the first resource of the second group is located in the first resource of the third group and the second resource of the third group It can also indicate that the second resource of the second group is located between the third resource of the third group and the fourth resource of the third group. In this way, resource interleaving between resource allocation units of different groups is realized.

Further, one resource allocation unit of the third group includes the first resource, the second resource, the third resource, and the fourth resource of the third group. If the four resources of the third group correspond to the first service S1 and the second service Service S2, the first sequence indicates that the first resource of the third group and the second resource of the third group are allocated to the first service S1; the third resource of the third group and the fourth resource of the third group are allocated to the first service S1; The second service S2 is S1, S1, S2, and S2. Or, the first sequence indicates that the first resource of the third group and the third resource of the third group are allocated to the first service S1, and the second resource of the third group and the fourth resource of the third group are allocated to the second service S2 is S1, S2, S1, S2.

In this embodiment, a first sequence is obtained according to the number of resource groups k. The first sequence includes p third units. A group resource number corresponds to N different third units in the first sequence, and p is a positive integer and p ≥2, N is the resource allocation unit.

Optionally, in the binary rule, p=2 ^k -1 third units, each third unit corresponds to a group number i, i is any one of 1 to k, and the first sequence is used to indicate each The group number i corresponding to the unit, and the number of resources in the ^{i-th group corresponds to 2 i-1} third units in the first sequence. For example, i=4, the number of resources in the fourth group corresponds to N (N=8) third units of resource allocation units, that is, 8 4s are included.

In summary, for the binary rule, the ^{group numbers of the 2 k} -1 third units include 2 ^k-1-i ki, where i=0,1,2,...,k-1. For example, when k=4, the first sequence consists of 15 units, each of the third units corresponds to a group number from 1 to 4, and these 15 third units include 2 ^4-1 = 8 group numbers 4 (i=0), 2 ^4-1-1 = 4 group numbers 3 (i=1), 2 ^4-1-2 = 2 group numbers 2 (i=2) and 2 ^4-1-3 =1 Group number 1 (i=3). Then the sending end allocates resource group numbers of m services among the L resources according to the group number of each third unit in the first sequence and the correspondence between each group number and the service.

It should be understood that the first sequence indication described in this embodiment is not limited to a sequence of binary rules, and may also indicate the positional relationship of third units in other systems. In this embodiment, a sequence represented by a binary rule is taken as an example for description.

The following describes the generation process of the first sequence in this embodiment, and various implementations of allocating resource numbers of m services according to the instructions of the first sequence.

In the first implementation manner, the acquiring the first sequence includes:

Step 1: For each group of resource numbers, the bit values represented in binary are listed in sequence from all 0s to all 1s, a total of 2 ^k count units.

Step 2: Each time a counting unit is generated, compare the bit value change of the current counting unit and the previous counting unit to determine the bit that has jumped. The jumped change means that the bit value on the same bit changes from the The 0 of the previous count unit becomes 1 at the current count unit.

Step 3: Sorting all the hopping bits corresponding to the determined 2 ^k -1 count units to generate the first sequence, and the first sequence is a palindrome arrangement of bits. The 2 ^k -1 count units are all count units remaining except the first count unit whose bit value is all 0.

For example, the sender obtains 3 resource numbers corresponding to 3 services (m=3), and the resource numbers corresponding to service numbers S1, S2, and S3 are C1, C2, and C3, respectively. And each resource number C is represented by the first base, such as decimal. In an example, the resource numbers C1, C2, and C3 corresponding to the services S1, S2, and S3 are respectively, C1=9, C2=7, C3=4, and the total number of resources is C1+C2+C3=20.

After converting each of C1, C2 and C3 represented by the decimal system into binary numbers, k groups of resource numbers are obtained.

C1=9=1×2 ⁰ +0×2 ¹ +0×2 ² +1×2 ³ , the binary representation is 1001;

C2=7=1×2 ⁰ +1×2 ¹ +1×2 ² +0×2 ³ , the binary representation is 1110;

C3=4=0×2 ⁰ +0×2 ¹ +1×2 ² +0×2 ³ , the binary representation is 0010.

In this embodiment, the number of resource groups k is the same as the number of bits after binary conversion. In this embodiment, each resource number can be represented by 4 bits, and the number of bits is 4, that is, k=4.

Optionally, the number of bits may also be referred to as bit width. Specifically, the bit width k can be determined in the following two ways:

Manner 1: According to the bit width of the total number of transmission resources as the bit width of the counter, the total number of transmission resources is the sum of the number of resources required by each service. For example, in the above three services S1, S2, and S3, and the number of resources is C1, C2, and C3, respectively. Among them, C1=9, C2=7, C3=4, and the total number of resources is 20. The total number of resources 20 is represented by binary as 00101, there are 5 bits in total, then the bit width k=5, and the order from left to right is: the first bit, the second bit, the third bit, and the third bit. 4 bits and 5th bits.

Manner 2: The bit width of the number of resources required by the first service is used as the bit width of the counter, where the number of resources required by the first service is the largest number of resources required among all services . For example, in the above three services S1, S2, and S3, the largest number of resources is C1. C1 is represented by binary as 1001, there are 4 bits in total, that is, k=4, and the order from left to right is: the first bit, the second bit, the third bit, and the fourth bit.

Since the value of the bit width determined in the second method is smaller than that in the first method, the calculation is simple, so the embodiment of the present application uses the bit width determined in the second method to establish the correspondence relationship.

In the above-mentioned "Step 1", the order is from low to high according to the bit order, or it can also be from high to low according to the bit order. In this embodiment, the bit order is sorted from low to high. As shown in Fig. 10a, k=4, which contains 2 ⁴ =16 count units in total. The number of the count unit is represented by w, and the value range of w is from 0. To 15. Each counting unit corresponds to a bit sequence, for example, the sequence number 0 corresponds to the bit sequence 0000, the sequence number 1 corresponds to the bit sequence 0001, and so on, the sequence number 15 corresponds to the bit sequence 1111. In this embodiment, a total of 16 bit sequences are included.

In the above-mentioned "step 2", the bit value changes of the bit sequence of the next counting unit and the previous counting unit are compared one by one, and the bits that have jumped are screened out. The bits that have jumped refer to the same bit. The bit whose value of the upper bit changes from 0 to 1, defines a jump: when the bit value of a bit changes from 0 to 1, it is defined as a jump; in addition, the bit is the 1st to the kth bit One of the bits.

According to the binary counting rule, the k-th bit has 2 ^k-1 transitions, the k-1 bit has 2k-2 transitions,..., the second bit has two transitions, the first There is one bit transition.

Specifically, starting from the bit sequence of the first counting unit, the bit sequence of the next counting unit is compared, that is, the bit sequence of the bit sequence 0000 of the sequence number 0 and the bit sequence of the bit sequence 0001 of the sequence number 1 are compared, and it can be seen that only the bit sequence of the first counting unit is changed. The 4-bit bit changes from 0 to 1, so the bit that jumps from the first counting unit to the second counting unit is the "4th bit", and the jump bit corresponding to the bit sequence 0001 is recorded as "4".

In addition, if the bit changes from 1 to 0, it does not belong to the "jumping" situation defined in this application.

^{In the above-mentioned "Step 3", all the bits corresponding to the transitions corresponding to the 2 k} -1 counting units except the one counting unit with the bit value of all 0s are arranged in order. Each time the counter counts, after the comparison A bit sequence of a count unit and the previous count unit, and record each bit that changes, that is, the position of the output transition bit, and the final output sequence is a palindrome arrangement of the bits.

For example, as shown in Fig. 10b, for the bit sequence 1000 of sequence number 8, when determining the bit that has hopped, compare the bit sequence 0111 of the previous sequence number 7 with the bit sequence of the current bit sequence 1000 that sent hops. It can be seen that, Only the first bit changes from 0 to 1, so the jump bit corresponding to the bit sequence 1000 is recorded as "1". In the same way, a total of 15 bits that have jumped from sequence number 0 to sequence number 15 are determined, and the palindrome arrangement of the bits is obtained. In this embodiment, as shown in Figure 10c, the palindrome arrangement of the bits is: 4 3 4 2 4 3 4 1 4 3 4 2 4 3 4.

The correspondence between each service and its time slot is determined according to the palindrome arrangement of the bits and the service corresponding to each bit. Among them, the service number corresponding to each bit can be based on the number of resources represented in binary, as shown in Figure 10d, all bits in C1, C2, and C3 with a bit value of "1" are the services that need to be allocated resources, and the bit value Bits that are "0" do not need to be allocated services.

It can be obtained that the corresponding relationship between each bit position and each service, the bit sequence 1001 of the resource number C1 (1001 in the order of the bit position from high to low) is on the 4th bit and the 1st bit The service S1 needs to be allocated, and no resources are allocated on the 3rd and 2nd bits. The bit sequence 1110 of the number of resources C2 (0111 in the order of the bits from high to low) needs to be allocated service S2 on the first to third bits, and no resources are allocated on the fourth bit. The bit sequence 0010 of the resource number C3 (0100 in the order of bits from high to low) needs to be allocated service S3 on the 3rd bit, and no resources are allocated on the remaining bits, the 4th, the 2nd and the 1st bit. .

According to the palindrome arrangement of the bits shown in FIG. 10c and the correspondence between each service and the bit in FIG. 10d, the correspondence between the services S1, S2, and S3 and the time slot resources is obtained. As shown in Figure 10e, the bit corresponding to the sequence number 1 of the palindrome arrangement is "4", the fourth bit, and the service that needs to be transmitted on the fourth bit is S1, and corresponds to a time slot. The service configured in slot 1 is S1 (that is, slot 1 is used to transmit service S1).

In the same way, the bit corresponding to the sequence number 2 of the palindrome arrangement of the bit is "3", then according to the corresponding relationship shown in FIG. 10d, the services that need to be configured on the third bit are S2 and S3, each service corresponds to a time slot, then time slot 2 is used to transmit service S2, and time slot 3 is used to transmit service S3. Similarly, there is only S2 for the service that needs to be transmitted for the second bit, so the time slot 6 and time slot 17 corresponding to the second bit are used to transmit the service S2; for the service that needs to be transmitted for the first bit, there are S1 and S2. Therefore, two time slot resources need to be occupied on each second bit to transmit services S1 and S2. For example, if the time slot indicated by the first bit includes time slot 15 and time slot 16, then time slot 15 is used to transmit services S1, time slot 16 is used to transmit service S2.

Finally, the sender allocates a certain resource for each service among the 20 resources, obtains a multiplexing scheme for all services, and completes the allocation of time slot resources.

In the implementation method provided in this embodiment, a counter is used to establish a palindrome arrangement of bits, and then a correspondence relationship between each service and the resource where each service is located is established according to the palindrome arrangement of bits, so as to complete each of the L resources. Business resource allocation.

In addition, it should be noted that in the above-mentioned “step 1” of this embodiment, when generating the bit sequence, the bit sequence is sorted from low to high. In addition, the bit sequence can also be sorted from high to low. That is, the kth bit, the k-1th bit, ..., the 2nd bit, the 1st bit. Then the rest of the process is the same as "Step 2" and "Step 3" of this embodiment, and will not be repeated here.

In summary, this embodiment generates a palindrome in which the first sequence is a bit position, and the palindrome of the bit position consists of 2 ^k -1 group numbers i, where the group number i is the 1st to the kth bit Any one of the bits. Further, in the ^{sequence number composed of 2 k} -1 units, the sequence number is 2 ^k-1 as the first center, and the bit sequence corresponding to the left sequence number of the first center is the same as the right sequence number. The corresponding bit sequence is symmetrical about the first center; the sequence number on the left of the first center, with the sequence number 2 ^k-2 as the second center, the bit sequence corresponding to the sequence number on the left of the second center The bit sequence corresponding to the sequence number on the right is symmetric about the second center; the sequence number is 2 ^k-(k-1) as the k-1 center, and the left sequence number of the k-1 center is The corresponding bit sequence and the bit sequence corresponding to the sequence number on the right are symmetric about the k-1th center.

For example, take the palindrome arrangement of bits shown in Figure 10c: 4 3 4 2 4 3 4 1 4 3 4 2 4 3 4 as an example. The first center is the first bit of sequence number 8, and the sequence 4 3 4 2 4 3 4 to the left of the first bit is symmetrical with the sequence 4 3 4 2 4 3 4 to the right of the first bit. In the left sequence of bits, the second bit of sequence number 4 is the center, that is, the second center. The left sequence 4 3 4 of the second center is symmetrical to the right sequence 4 3 4; it is on the left of the second bit In sequence 4 3 4, the left and right sides are symmetric about the third center (that is, the 3rd bit).

In this embodiment, the first sequence generated is a palindrome arrangement of bits, so that each bit is symmetrical about the center bit, and the resource allocation units of each group are split and arranged in order to reduce the jitter of service resources, and Improve the flexibility of resource allocation.

Optionally, this application may also obtain the first sequence in other ways, specifically,

In the second implementation manner, according to the order of the bits from low to high, the number of resources represented by the first bit to the k-th bit is 1, 2, ..., 2 ^{k-1 respectively} . Taking k bits as k services, the service numbers are respectively S1, S2,..., Sk, then the number of resources required for each service is C1=1, C2=2,..., Ck=2 ^k-1 , The total number of resources P=2 ^k -1. For example, when k=4, Ck=2 ^4-1 =8, and the total number of resources P=2 ⁴ -1=15, which means that the order of the bits is from 1 to 15 and a total of 15 bits.

In the binary rule, since the number of resources required by the business is increased by a multiple of 2, the interleaving and recursive methods can be used to generate a palindrome arrangement of bits. Specifically, the method includes: first determining the intermediate position Bit position, and then insert the bit position on both sides with the bit position in the middle position.

Further, in this embodiment, taking the bit width k equal to 4 as an example, as shown in FIG. 11, the method for generating a palindrome arrangement of bits includes:

In the first step, the sequence number of the first bit is placed in the middle according to the order of the bits from the 1st to the kth bit.

In the second step, the two sequence numbers of the second bit are placed on both sides of the sequence numbers of the first bit.

The third step is to insert at least two sequence numbers of the third bit between each of the sequence numbers of the first bit and the second bit, including the two sequence numbers of the second bit. The two ends of the serial number.

The fourth step, and so on, until at least two sequence numbers of the 4th bit (k=4) are inserted between the sequence numbers of every two bits, and the two ends of the sequence number. Palindrome arrangement.

For example, insert the 4th bit between 3, 2, 3, 1, 3, 2, 3 and at the two ends respectively to obtain the palindrome arrangement of the bits, as shown in Figure 10c: 4 3 4 2 4 3 4 1 4 3 4 2 4 3 4.

Finally, according to the palindrome arrangement of the bits, as shown in Figure 10c, and the service number corresponding to each bit, as shown in Figure 10d, determine the correspondence between each service and its time slot, as shown in Figure 10e As shown, that is, when the number of resources C1, C2, and C3 corresponding to the three services S1, S2, and S3 are C1=9, C2=7, C3=4, and the total number of resources is 20, determine the slave slot 1. The services corresponding to time slot 20 are: S1, S2, S3, S1, S2, S1, S2, S3, S1, S1, S2, S1, S2, S3, S1, S2, S1, S2, S3, S1.

The specific implementation process is similar to the steps in the foregoing embodiment, which is not repeated in this embodiment.

Optionally, in this embodiment, for the palindrome arrangement of the bits shown in FIG. 10c, the positions of two different bits that are not adjacent in the middle may be exchanged. For example, the bit positions of serial numbers 4 and 6 in Figure 10c are interchanged. After the exchange, the bit position of serial number 4 becomes the third bit, and the bit position of serial number 6 becomes the second bit; similarly, you can also change the sequence The bits on numbers 10 and 12 are exchanged, as shown in Figure 12, the palindrome of the bits obtained after the exchange is arranged as: 4 3 4 3 4 2 4 1 4 2 4 3 4 3 4.

In the third implementation manner, this implementation manner uses parity conditions to generate a palindrome arrangement of bits. Specifically, the method includes:

In the first step, the bit width k is determined. The specific determination method is the same as the foregoing embodiment, and will not be described again.

The second step is to sort the ^{2 k bit sequence.} The specific process is the same as the foregoing embodiment, and will not be repeated here.

In an example, take k=4 as an example, that is, 4 bits are included, and there are a total of 16 (2 ⁴ ) bit sequences, which are listed in order from the bit value of all 0 to the bit value of all 1. The bit order is sorted from low to high, as shown in Figure 10a. Among them, the serial number of the 16 bit sequence is represented by w, which are sorted in ascending order: 0, 1, 2, ..., 14, 15.

In the third step, each time the counter counts, a bit position is output, and the bit position satisfies k-j, the bit positions of all counting units output by the counter are recorded, and the palindrome arrangement of the bits is generated by statistics.

Among them, k is the bit width, j is an exponential power of 2, that is, 2 to the power of j, and 0≤j<k. Further, a method for determining j includes:

商为a，余数为b(mod b)的情况下，判断在满足所有a为奇数的情况下的j值中，j取最小值。也即判断a为奇数，b为0时所对应的j值。 In satisfying the first relation:

When the quotient is a and the remainder is b (mod b), it is judged that j takes the minimum value among the j values in the case where all a is an odd number. That is, it is judged that a is an odd number, and the value of j corresponding to b is 0.

In an example, w takes any value, such as w=8. When j=0, a=8 and b=0 are obtained according to the first relational expression, and the quotient b is an even number, which does not satisfy the condition; when j= When 1, a=4 is obtained according to the first relational expression, and the quotient is an even number, and the condition is not satisfied; when j=2, a=2 is obtained according to the first relational expression, and the quotient is an even number, and the condition is not satisfied; When j=3, we get a=1, the quotient is odd, b=0, the remainder is 0, and the condition is met; when j=4, we get a=0, the quotient is an even number, and the condition is not met; so take the value of j above Among 0, 1, 2, 3, and 4, only j=3 satisfies the judgment condition, so it is determined that j=3. The output bit is k-j=4-3=1, so when w=8, the corresponding bit is "1", that is, the first bit.

In another example, such as w=7, when j=0 to 3, the corresponding values of the quotient a and the remainder b. See Table 2 for details,

Table 2

It can be seen from Table 2 above that only when the value of j is 0, 1, and 2, the condition that the quotient a is an odd number is satisfied, and in the range where the three quotients are odd numbers, select the value of j corresponding to 0 for the remainder b, or Select the minimum value of j that satisfies 3 conditions where a is an odd number, that is, j is 0, and the output bit position is k-0=4.

Similarly, according to the above method, determine the corresponding output bits when w takes other values, and finally form a palindrome arrangement of bits. In this embodiment, after comparing the quotient and remainder obtained by the first relational expression according to the bit sequence number shown in Figure 10a, the bit palindrome arrangement is generated as: 4 3 4 2 4 3 4 1 4 3 4 2 4 3 4.

In addition, this embodiment also provides a method for obtaining the first sequence. The method uses the Sigma/Delta algorithm to generate the first sequence, and the first sequence is also called a bit sequence. Specifically, the method for generating the bit sequence includes: taking k resource allocation units N of the number of k groups of resources, or bit width k as k services, and then using a preset algorithm to establish the k services and the The corresponding relationship between the total number of resources composed of k services, and finally the first sequence is generated according to the corresponding relationship. Wherein, the preset algorithm is the Sigma/Delta algorithm.

The specific process includes: starting from the 1st bit to the kth bit, the number of resources represented by 1, 2, ..., 2 ^{k-1 respectively} . Take the bit width k as k services, and the service numbers are respectively S1, S2,..., Sk, then the number of resources required by each service is denoted by B, such as B1, B2,..., Bk, where Bk=2 ^{k -1} , the total number of resources P=2 ^k -1.

For example, when k=4, it includes 4 services, corresponding to 4 bits, and the number of resources B1, B2, B3, and B4 required from the first bit to the fourth bit are 1, 2, 4, respectively. 8; The total number of resources P=2 ⁴ -1=15, which means that there are 15 bits in the order (serial number) from 1 to 15.

Select the parameter Q, and Q≥Max{B1, B2, B3, B4}=Max{1, 2, 4, 8}=8.

The Sigma/Delta algorithm is used to allocate resources for 4 services (4 bits). The Sigma/Delta algorithm can be expressed as: l×B modQ,

Among them, l is a constant, the value of l ranges from 1 to 8; B represents the number of resources required for each business, and the value range of B is from B1 to Bk; Q is the selected parameter, mod represents the remainder operation, l×B modQ, which means that the quotient obtained by dividing l×B by Q takes the remainder.

As shown in Figure 13a, it is a schematic diagram of using the Sigma/Delta algorithm to determine the bit arrangement. Taking B=B1 and Q=8 as an example, l×B1 modQ takes the remainder, the value of l ranges from 1 to 8, and the obtained remainders are 1, 2, 3, 4, 5, 6, 7, 0, respectively. Similarly, when B=B2=2, the value of l ranges from 1 to 8, and the remainders obtained are 2, 4, 6, 0, 2, 4, 6, 0, respectively. When B=B3=4, the value of l ranges from 1 to 8, and the remainders obtained are 4, 0, 4, 0, 4, 0, 4, 0, respectively. When B=B4=8, the value of l ranges from 1 to 8, and the remainders obtained are all 0, because they can be divisible by 8. Mark all positions with a remainder of 0 as bits that need to be allocated resources.

As shown in Figure 13b, according to the value range of l from 1 to 8, when the value of l is 1, the service that needs to be allocated corresponds to the fourth bit; when the value of l is 2, the service that needs to be allocated corresponds to the third bit. And the 4th bit; when the value of l is 3, the service that needs to be allocated corresponds to the 4th bit; when the value of l is 4, the service that needs to be allocated corresponds to the 2nd to 4th bit; the value of l is At 5, the service to be allocated corresponds to the 4th bit; when the value of l is 6, the service to be allocated corresponds to the 3rd and 4th bits; when the value of l is 7, the service to be allocated corresponds to the 4th bit When the value of l is 8, the service to be allocated corresponds to the first to fourth bits, and the final bit sequence is: 4 3 4 4 2 3 4 4 3 4 4 1 2 3 4.

The sequence number corresponding to this bit sequence is from 1 to 15. Then, according to the corresponding relationship between each bit and the service number, such as the corresponding relationship shown in Figure 10d, 20 resources corresponding to 3 services are obtained. The reuse plan. For example, as shown in Figure 13c, when the number of resources C1, C2, and C3 corresponding to the three services S1, S2, and S3 are C1=9, C2=7, C3=4, and the total number of resources is 20, determine The corresponding service multiplexing schemes from time slot 1 to time slot 20 are: S1, S2, S3, S1, S1, S2, S2, S3, S1, S1, S2, S3, S1, S1, S1, S2, S2 , S2, S3, S1.

In this method, the Sigma/Delta algorithm is used to obtain the first sequence, and then resource allocation is performed according to binary bits, and finally the service multiplexing scheme is obtained, which can reduce the jitter of the resource allocation method.

It should be understood that this embodiment only exemplifies four implementation methods for obtaining the first sequence, including three methods for generating a palindrome of bits, and one method for generating a bit sequence, which may also be included in the foregoing Other implementation manners improved on the basis of various implementation manners are not limited in this embodiment.

It should be noted that each method step in each of the above embodiments is mainly aimed at the sending end device, that is, the sending end device generates the first sequence according to the service parameters, and generates the multiplexing plan of the service resources according to the first sequence, and pairs according to the multiplexing plan. The resources corresponding to each business are allocated. Similarly, it can also be applied to the receiving end device, that is, after the receiving end obtains the number of k sets of resources, it determines the demultiplexing scheme in the L resources according to the number of k sets of resources, and finally transmits to the transmitting end according to the demultiplexing scheme. The multiplexed data stream is demultiplexed, and m services are recovered. Since the receiving end and the sending end adopt the same rules, the receiving end can obtain a demultiplexing scheme consistent with the multiplexing scheme of the sending end. Furthermore, the process of determining L resource demultiplexing schemes at the receiving end according to the number of k sets of resources is the same as the process of generating L resource multiplexing schemes at the transmitting end. Refer to the description of the foregoing embodiments. This embodiment does not Go into details again.

The resource allocation method provided in this embodiment can be used in the multiplexing or demultiplexing process of multiple services. The resource allocation method based on the number of k sets of resources can directly determine the resources occupied by the service in the transmission pipeline according to the size of the resource allocation unit required by the service, which is simple and straightforward, does not require any calculation, and is easy to expand.

In addition, when the granularity of resource allocation is small, through the same rules on both the sender and the receiver, the sender only needs to send the multiplexing scheme of the service allocation instead of sending the redundant resource configuration table to the receiver, thereby reducing This reduces the resource overhead of sending a long resource configuration table. In addition, this method also realizes the automatic allocation of resources, and solves the problem of inflexible allocation of resources by FlexE for small-granularity services and non-integer time slot granular services.

In addition, in each of the foregoing embodiments, the method further includes: the sending end uses the overhead frame to send the number m of services and the number of m resources. Wherein, the specific step includes: the sending end sends service parameters, and the service parameters include the number of services m and the number of m resources. The service parameters are carried and transmitted through overhead frames, which specifically include the following implementation modes:

The first implementation method is based on the structure of the FlexE overhead frame in the OIF standard. By changing some fields in the FlexE overhead frame defined in the original standard, the modified FlexE overhead frame carries the Business parameters.

Specifically, in the FlexE standard, a 100Gbps FlexE interface is divided into 20 time slots, and each time slot has a bandwidth of 5Gpbs. The time slot configuration table (Calendar) defined in the FlexE standard contains a total of 20 entries, and each entry corresponds to a time slot resource. The service ID filled in the table entry is used to indicate that each time slot belongs to Which business. And if a service requires multiple time slots, two or more entries in the time slot configuration table correspond to the same service ID.

As shown in Figure 14a, it is a schematic diagram of a FlexE overhead frame and a multi-frame, including a 66-bit frame header, where the field "SH" represents a synchronization header and occupies 2 bits. The FlexE frame header consists of 8 code blocks, which are numbered in sequence from block 1 to block 8. Among them, the 2nd to 33rd bits in block 3 are used to transmit service parameters. Further, the 2nd to 17th bits are used to transmit the service parameters of the time slot configuration table A (English: service parameters for A); the 18th to the 33th bits are used to transmit the service parameters of the time slot configuration table B (English: service parameters for B). Time slot configuration table B and time slot configuration table A are mutual backups.

Table 3 below shows the Chinese interpretation of the content contained in the frame structure shown in FIG. 14a.

table 3

The service parameter is the service ID (English: Service ID for A) of time slot configuration table A, for example, Service 1 ID for A represents the service number (ID) corresponding to service 1 of configuration table A. Similarly, each frame carries a service entry of a time slot, and transmission of 20 service entries requires 20 overhead frames. The remaining 21st to 32nd frames are used to transmit the number of resources corresponding to each service ID.

Specifically, an implementation method is that the sending end sends the service parameters through 32 flexible Ethernet FlexE overhead frames. As shown in Figure 14b, the 1st to 20th FlexE overhead frames are used to carry all the corresponding service numbers in the service parameters, and the 21st to 27th FlexE overhead frames are used to carry the resources in the service parameters For example, "C1 for A" represents the service ID (Service ID) 1 of the time slot configuration table A and the corresponding resource number is C1, and "C2 for A" represents the service ID (Service ID) 2 of the time slot configuration table A. The corresponding resource number is C2, and so on. And each 16-bit code block can carry the resource number indicator information of 3 services, and the indicator information of each resource number occupies 5 bits. For example, the 21st frame carries the resource number of C1, C2, and C3, which occupies 15 bits. The remaining 1 bit is a reserved field (Reserved). In addition, the 28th to 32nd FlexE overhead frames are used to transmit reserved fields, and the reserved fields are used to configure reserved resources.

Wherein, the content configured in the version identifier (Version, VER) field in each FlexE overhead frame is a first identifier, and the first identifier is used to indicate the service number or the service number carried in the FlexE overhead frame. The number of resources is currently used service parameters. For example, the first identifier is represented by the bit value "1". When the VER field indicates the bit value is "1", it means that the FlexE overhead frame transmits the service parameters defined in this embodiment; when the VER field indicates the bit value is "0" When, it means that the FlexE overhead frame transmits the parameters defined by the standard.

In this embodiment, a resource allocation method is used to generate a FlexE time slot configuration table, thereby realizing automatic configuration of time slot resources.

Since the "first implementation method" is only applicable to the time slot configuration table containing 20 time slot resources, it is not applicable to the resource configuration of more services, so on this basis, the second implementation method is designed to transmit more Business parameters of the number of services and resources.

The second implementation mode, see Figure 14c, expands the Calendar field in a FlexE overhead code block to transmit required service parameters, including the number of services m, the sum of the number of resources required by m services P, or The total number of resources, the service number S1, S2,..., Sm of each business, and the number of resources C1, C2,..., Cm required by each business.

For example, for a 100Gbps interface, if the resource granularity is 2Mbps, the total resource number is P=50,000, and each resource number needs to be represented by 16 bits in binary; the maximum number of supported services m=50,000, and the service number is also required 16-bit representation, so when the number of transmitted services and the number of resources are large, the following method can be used to send the service parameters.

As shown in Figure 14c, the sending end sends a first overhead frame, and the first overhead frame includes the total number of resources P; in a specific field, it is expressed as the total number of resources P in the time slot configuration table A, which is in English Rescource number(P) for A.

Send a second overhead frame, the second overhead frame includes the number of services m, specifically, a field of the second overhead frame is expressed as the number of services m in the time slot configuration table A, which is Service number in English (m) for A.

Sending the 3rd to m+2th overhead frames, the m overhead frames in the 3rd to m+2th overhead frames are used to transmit m said service numbers, wherein each of the m overhead frames includes A business number. For example, m=3, which represents the service number (ID) corresponding to service 1 of the third overhead frame transmission.

The m+3 to 2m+2th overhead frames are sent, and m overhead frames in the m+3 to 2m+2th overhead frames are used to transmit the m number of resources, wherein each of the overhead frames The number of resources required to carry a business. For example, the number of resources required to transmit the service ID 1 in the m+3 frame is expressed in a specific field as: Service 1 resource required for A. If each transmission indicates the number of resources for one service, m services require a total of m frames to transmit the number of resources, and the last overhead frame is the 2m+2th overhead frame.

In addition, in each overhead frame, the 12th bit in the first overhead code block of the FlexE overhead code block is used as the version identifier (VER) of the FlexE overhead code block. When the indication of the VER field is "1", it means to use the new Version, which passes the business parameters required by the resource allocation method. Specifically, the original Calendar field in the third overhead code block of the FlexE overhead code block is redefined, and the parameters required by the resource allocation method are transferred through 2m+2 frames.

This embodiment expands the FlexE interface based on the resource allocation method, and is no longer subject to the limitation that the original 100Gbps interface can only support a maximum of 20 service resource allocations; the expanded FlexE interface can define resource granularity according to business needs to determine The total number of resources, as well as the number of resources required by each service, to achieve flexible bandwidth allocation for multiple services. And to ensure that the receiving end can demultiplex the multiplexed data stream.

This embodiment expands the FlexE interface to support more services and more flexible bandwidth allocation.

The above two implementations both use the frame format defined by the standard FlexE. Because the standard FlexE frame format has a fixed period, the number of code blocks corresponding to each frame is fixed, so when multiplexing services are multiplexed, they are bound to be restricted. The size of the FlexE frame format cannot meet the needs of supporting more services and finer resource granularity.

This application provides a third implementation manner. In this implementation manner, a new frame structure is defined for transmitting the service parameters. For example, the first frame, and the service parameters are transmitted to the receiving end at one time by sending the first frame.

Specifically, as shown in FIG. 15a, the sending end uses an overhead frame to send service parameters, where the service parameters include the number of services m and the number of m resources. Wherein, the overhead frame includes a control code block and Y data code blocks, Y≥2 and Y is a positive integer, the control code block is used to locate and transmit the number of services m, and the Y data codes The block is used to transmit the m number of resources.

Optionally, the control code block may be represented by "U", and the type of the control code block U is a combination of 0x4B and 0xE, where 0x4B indicates that the 64B/66B code block is an O code, and 0xE indicates the O code type.

Optionally, each of the Y data code blocks may be represented by "D" (Data).

Further, as shown in FIG. 15b, the control code block U is a 66-bit code block, and the control code block U includes a first indication field and a second indication field, and the first indication field is used to indicate the The total number of resources P; the second indication field is used to indicate the number of services m. Wherein, the length of the first indication field is 16 bits, ranging from the 9th bit to the 24th bit; and the length of the second indication field is 8 bits, ranging from the 25th bit to the 32nd bit.

In addition, the Y data code blocks include at least one first code block, where one first code block may be used to carry the m number of resources, or the m first code blocks may be used to carry the m resources number. Specifically, as shown in FIG. 15c, S0 represents the first code block, and each first code block is used to transmit the number of resources for one service. For example, the first code block S0 carries the number of resources C1 required for service number 1 and service number 1 of time slot configuration table A, and the number of resources C1 required for service number 1 and service number 1 of time slot configuration table B.

Specifically, the indication information contained in the first code block S0 (C1) is: the service number S1 of the time slot configuration table A, the number of resources C1 required, and the service number S1 of the time slot configuration table B , The number of required resources C1. Similarly, the indication information contained in the first code block S0 (C2) is: the service number S2 of the time slot configuration table A, the required resource number C2, and the service number of the time slot configuration table B S2, the number of required resources C2; and so on, the indication information contained in the first code block S0(Cm) is: for the service numbers Sm of the time slot configuration tables A and B and the number of resources required Cm. And it contains a total of m first code blocks, carrying service numbers and resource numbers of m services.

This embodiment defines a new frame format, which can change with the change of multiplexing services, so the services that can be carried are more flexible and have stronger flexibility. In addition, the m service parameters corresponding to the m services can be transmitted to the receiving end with only one transmission, which improves the transmission efficiency.

Refer to FIG. 16, which is a schematic structural diagram of a resource allocation device provided by an embodiment of this application. The device may be the receiving end in any of the foregoing embodiments, or may also be the sending end, and may be used to implement the method steps in each of the foregoing embodiments.

As shown in FIG. 16, the device may include: an acquiring unit 161, a processing unit 162, and a sending unit 163. In addition, the device may also include more or fewer components, such as a storage unit, etc., which is not included in this embodiment. Qualify.

Further, the obtaining unit 161 is configured to obtain the number of k groups of resources for m services, each group of resource numbers corresponds to a resource allocation unit N, and each group of resource numbers includes a coefficient a corresponding to each service, and the coefficient a represents a service The number of resource allocation units included, where the resource allocation unit N represents the number of resources included in a resource allocation unit, k≥1, N≥1, and k and N are all positive integers; the processing unit 162 is configured to The number of the k sets of resources determines the resources corresponding to the m services among the L resources.

Optionally, in a specific implementation manner of this embodiment, the obtaining unit 161 is specifically configured to obtain the number of m resources corresponding to the m services, and each of the resource numbers is expressed in the first base system. , M≥1; and, after each resource number expressed in the first base system is expressed in a second binary system, the number of resources in the k groups is obtained, and the second binary system includes binary, octal, decimal, and hexadecimal, etc. .

Optionally, in another specific implementation manner of this embodiment, the processing unit 162 is specifically configured to arrange the number of the k groups of resources in the order of the first group to the k-th group, among the L resources The resources corresponding to the m services are determined, where the number of resources allocated in each group is the product of the sum of the coefficient a of the m services and the resource allocation unit N corresponding to each group.

Optionally, in another specific implementation manner of this embodiment, the processing unit 162 is specifically configured to follow the order of the first group to the kth group, if the first group to the kth group If any group of allocated resources contains two or more services, the resources corresponding to each service are allocated to the group containing the two or more services in the order of service numbers or in the order of interleaving the service numbers.

Optionally, in another specific implementation manner of this embodiment, the processing unit 162 is specifically configured to obtain a first sequence, and determine among L resources according to the number of k sets of resources and the first sequence Resources corresponding to the m services; the first sequence is used to indicate the positional relationship between the resource allocation units N of the number of resources of the k groups.

Wherein, the first sequence includes k first units, and different first units correspond to different numbers of group resources.

For example, the i-th group of the first group to the k-th group to either group number i set of resources, the first group number of resources corresponding to the resource allocation unit N is ^20, the second group number of resources corresponding to the resource allocation The unit N is 2 ¹ , the resource allocation unit N corresponding to the number of resources in the third group is 2 ² , and the resource allocation unit N corresponding to the number of resources in the ith group is 2 ^i-1 ; the first sequence indicates the resources of the number of resources in the i group the positional relationship between the distribution units is N, ⁰ 2 of the first group, the second group ^21, third ^two groups 2, group i 2 ^i-1 resources.

Optionally, the first sequence includes z second units, different second units correspond to different group resource numbers, at least one second unit corresponds to at least two group resource numbers, z<k, z is a positive integer and z≥2.

Optionally, the first sequence includes p third units, and a group resource number corresponds to N different third units in the first sequence. Where N is the resource allocation unit.

Further, p=2 ^k -1, in the 2 ^k -1 third units, each third unit corresponds to a group number i, i is any one of 1 to k, and the i-th group of resources The number corresponds to 2 ^i-1 third units in the first sequence, and p is a positive integer and p≥2.

In a possible implementation, the resource allocation unit N corresponding to the number of resources in the i group is 2 ^i-1 , and the resource allocation unit N corresponding to the number of resources in the i+1 group is 2 ^i+1-1 , where Said ^2i-1 resources include the first resource of the i-th group, and the ^2i+1-1th resources include the first resource of the i+1th group and the second resource of the i+1th group; The first sequence is used to indicate that the first resource of the i-th group is located between the first resource of the i+1-th group and the second resource of the i+1-th group among the L resources.

For example, i=3, the resource allocation unit N corresponding to the number of resources in the third group is 4, and one resource allocation unit in the third group includes the first resource, the second resource, the third resource, and the third resource in the third group. Four resources. The processing unit 162 is specifically configured to, when the four resources of the third group correspond to the first service and the second service, use the first sequence to indicate that the first resource of the third group and the third group Allocate the second resource of the third group to the first service; allocate the third resource of the third group and the fourth resource of the third group to the second service; or allocate the first resource of the third group And the third resource of the third group are allocated to the first service; the second resource of the third group and the fourth resource of the third group are allocated to the second service.

Optionally, in another specific implementation manner of this embodiment, when k=4, among the number of k groups of resources, the number of resources in the first group and the number of resources in the second group are the number of resources in the first large group. , The number of resources in the third group and the number of resources in the fourth group are the number of resources in the second largest group; the first sequence is used to indicate the positional relationship between the number of resources in the first largest group and the number of resources in the second largest group .

In another possible implementation manner, the first sequence includes 2 ^k -1 units, and each unit corresponds to a group number i, where i is any one of 1 to k; the first sequence is used to indicate The group number i corresponding to each unit, the processing unit 162, is specifically configured to determine the m services according to the number of k groups of resources and the group number i corresponding to each unit indicated by the first sequence Corresponding resources.

Optionally, the first sequence is a palindrome arrangement of bits, and the group number i is any one of the 1st to the kth bits. In the ^{serial number composed of 2 k} -1 units, the serial number is 2 ^k-1 as the first center, and the bit sequence corresponding to the left serial number of the first center and the bit corresponding to the right serial number are The bit sequence is symmetrical about the first center; the sequence number on the left of the first center, with the sequence number 2 ^k-2 as the second center, the bit sequence corresponding to the sequence number on the left of the second center and The bit sequence corresponding to the sequence number on the right is symmetrical about the second center; in the sequence number 2 ^k-(k-1) as the k-1 center, the left sequence number of the k-1 center corresponds to The bit sequence of and the bit sequence corresponding to the sequence number on the right are symmetric about the k-1th center.

Optionally, in another specific implementation manner of this embodiment, the processing unit 162 is specifically configured to list the bit values of each group of resource numbers expressed in binary from all 0s to all 1s in order, totaling 2 ^k count units; each time a count unit is generated, the bit value change of the current count unit and the previous count unit is compared to determine the bit that has jumped. The jumped change means that the bit value on the same bit changes from The 0 of the previous count unit becomes 1 in the current count unit; ^{all of the transitioned bits corresponding to the determined 2 k} -1 count units are sorted to generate the first sequence.

Optionally, in another specific implementation manner of this embodiment, the processing unit 162 is specifically configured to use the k resource allocation units of the k sets of resource numbers as k services, and use a preset algorithm to establish the The corresponding relationship between the k services and the total number of resources composed of the k services, and the first sequence is generated according to the corresponding relationship.

Wherein, the preset algorithm is: l×B modQ, l is a constant, and the value of l ranges from 1 to Q; B is the resource required by any one of the first to kth services represented by k services Number, Q≥Max{B1, B2, B3,..., Bk}; mod represents the remainder operation, l×B modQ represents the remainder obtained by dividing l×B by Q.

In addition, in another specific implementation manner of this embodiment, the sending unit 163 is configured to use an overhead frame to send service parameters, where the service parameters include the number of services m, the number of m services, and the number of m resources.

Further, the sending unit 163 is specifically configured to send the service parameters through 32 flexible Ethernet FlexE overhead frames; wherein the 1st to 20th FlexE overhead frames are used to carry m service numbers corresponding to the m services , The 21st to 27th FlexE overhead frames are used to carry the number of m resources, the 28th to 32nd FlexE overhead frames are used to carry reserved resources; and the version identification VER field in each FlexE overhead frame A first identifier is configured on it, and the first identifier is used to indicate that the service number or the number of resources carried in the FlexE overhead frame is a currently used service parameter.

Optionally, in another possible implementation manner, the sending unit 163 is specifically configured to send 2m+2 overhead frames to transmit the service parameters; wherein, the 2m+2 overhead frames include the first overhead Frame, the second overhead frame, the third overhead frame to the 2m+2 overhead frame, the first overhead frame includes the sum of m resource numbers, and the second overhead frame includes the service number m , M overhead frames in the 3rd to m+2th overhead frames include m service numbers, and m overhead frames in the m+3 to 2m+2th overhead frames include the m resource numbers And a first identifier is configured on the version identifier VER field in each overhead frame, and the first identifier is used to indicate that the service number or the number of resources carried in the overhead frame is the currently used service parameter.

Optionally, in the process in which the sending unit 163 described in this embodiment is used to send service parameters using an overhead frame, another possible implementation manner is that the overhead frame includes one control code block and Y data code blocks. , Y≥2 and Y is a positive integer, the control code block is used to locate and transmit the number of services m, and the Y data code blocks are used to transmit the number of m resources.

Further, the Y data code blocks include at least one first code block, and the at least one first code block includes the m resource numbers. Furthermore, one first code block is used to carry the m resource numbers, or the m first code blocks in the at least one first code block are used to carry the m resource numbers.

In a specific hardware embodiment, as shown in FIG. 17, this embodiment also provides a network system. The network system may be the Ethernet, flexible Ethernet FlexE, and ubiquitous Ethernet in the foregoing embodiment. XE, etc., the network system includes a sending end 10 and a receiving end 20, and further, the sending end 10 includes a memory 1001, a processor 1002, and a communication interface 1003. Optionally, the communication interface 1003 is a FlexE interface for obtaining service parameters. In addition, the sending end 10 may also include more or fewer components, or a combination of some components, or a different component arrangement, which is not limited in this application.

Specifically, the processor 1002 is the control center of the sending end 10, and executes each of the multiplexing process by running or executing software programs and/or unit modules stored in the memory 1001, and calling data stored in the memory 1001. Kind of function.

The processor 1002 can be composed of an integrated circuit (IC), for example, can be composed of a single packaged IC, or can be composed of multiple packaged ICs with the same function or different functions. For example, the processor may only include a combination of a CPU, a digital signal processor (digital signal processor, DSP), and a control chip.

The memory 1001 is used to store program codes for executing the technical solutions of the present application, and is controlled by the processor 1002 to execute. Specifically, the processor 1002 is configured to execute the computer program code stored in the memory 1001 to implement the resource allocation method in the foregoing embodiments.

Further, the memory 1001 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM), or can store information and instructions Other types of dynamic storage devices can also be Electrically Erasable Programmable Read-Only Memory (EEPROM), Compact Disc Read-Only Memory, CD-ROM or other optical disk storage , CD storage (including compressed CDs, laser disks, CDs, digital universal CDs, Blu-ray CDs, etc.), disk storage media or other magnetic storage devices, or can be used to carry or store desired program codes in the form of instructions or data structures and Any other medium that can be accessed by the computer, but not limited to this. The memory can exist independently or integrated with the processor.

In addition, when the memory 1001 is a computer storage medium, the computer storage medium may store a program, and the program may include part or all of the steps of the resource allocation method provided in the embodiment of the present application when the program is executed. Moreover, in the above-mentioned embodiments, all or part of it may be implemented by software, hardware, firmware, or any combination thereof. When implemented by software, it can be implemented in the form of a computer program product in whole or in part.

The computer program product includes one or more computer instructions. When the computer loads and executes the computer program, all or part of the processes or functions described in the foregoing embodiments of the present application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.

The communication interface 1003 may include transceiver chips, or components such as receivers, transmitters, and antennas, for receiving service parameters, such as the number of k sets of resources, and data streams, such as multiplexed data streams. In addition, it is also used to send service parameters and the data code stream. Further, the communication interface 1003 may include communication modules such as a wireless local area network module, a Bluetooth module, a baseband module, and a radio frequency (RF) circuit corresponding to the communication module, which is used for wireless local area network communication. , Bluetooth communication, infrared communication and/or cellular communication system communication. In addition, the communication interface 1003 may also support direct memory access (direct memory access).

In different embodiments of the present application, the various transceiver chips in the communication interface 1003 can appear in the form of integrated circuit chips, and can be selectively combined without including all transceiver modules and corresponding antenna groups. . For example, it may only include a baseband chip, a radio frequency chip, and a corresponding antenna to provide communication functions in a cellular communication system.

Exemplarily, in the embodiment of the resource allocation device shown in FIG. 16 of the present application, the functions to be implemented by the acquiring unit 161 and the sending unit 163 may be implemented by the communication interface 1003 of the sending end 10, or controlled by the processor 1002. The communication interface 1003 is implemented; the functions to be implemented by the processing unit 162 can be implemented by the processor 1002.

For example, the communication interface 1003 is used to obtain the number of k groups of resources for m services, and each group of resources corresponds to a resource allocation unit N, and each group of resources includes a coefficient a corresponding to each service, and the coefficient a represents the number of resources included in a service. The number of resource allocation units, where the resource allocation unit N represents the number of resources included in a resource allocation unit, k≥1, N≥1, and k, and N are all positive integers; the processor 1002 is configured to The number of group resources determines the resources corresponding to the m services among the L resources.

Similarly, in the system shown in FIG. 17, the receiving end 20 includes components such as a memory 2001, a processor 2002, and a communication interface 2003. Specifically, the functions of the components in the memory 2001, the processor 2002, and the communication interface 2003 are the same as the structures and functions of the aforementioned memory 1001, the processor 1002, and the communication interface 1003, which will not be repeated in this embodiment.

The communication interface 2003 is used to receive service parameters and multiplexed data streams from the sending end 10, where the service parameters include the number of k groups of resources, and demultiplex the multiplexed data streams according to the service parameters. Obtain m services corresponding to the number of k groups of resources, for example, service 1, service 2 to service m.

In addition, the memory 1001 or the memory 2001 in this embodiment is used to store a computer program product, and the computer program product includes one or more computer instructions, such as resource allocation instructions. When the computer loads and executes the computer program, the method flow or function according to the above-mentioned embodiment of the present application is generated in whole or in part.

This embodiment provides an overhead frame. The overhead frame includes a control code block and Y data code blocks, Y≥2 and a positive integer, and the control code block is used to locate and transmit the number of services m , The Y data code blocks are used to transmit the m resource numbers. Wherein, the Y data code blocks include at least one first code block, and one or more first code blocks in the at least one first code block are used to carry the m resource numbers. The service parameters corresponding to the m services can be sent at one time through the overhead frame, and the overhead frame can be changed with the change of the multiplexed service, thereby making the carried service more flexible.

Those skilled in the art can clearly understand that the technology in the embodiments of the present invention can be implemented by means of software plus a necessary general hardware platform. Based on this understanding, the technical solutions in the embodiments of the present invention can be embodied in the form of software products, which can be stored in a storage medium, such as ROM/RAM. , Magnetic disks, optical disks, etc., including several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute the methods described in each embodiment or some parts of the embodiment of the present invention.

The same or similar parts in the various embodiments in this specification can be referred to each other. In particular, for an embodiment of a code block generation device, a receiving device, a packet bearing device, and a system, since it is basically similar to the method embodiment, the description is relatively simple, and for the relevant details, please refer to the description in the method embodiment. can.

In addition, in the description of this application, unless otherwise specified, "plurality" means two or more than two. In addition, in order to facilitate a clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, words such as "first" and "second" are used to distinguish the same items or similar items that have substantially the same function and effect. Those skilled in the art can understand that words such as "first" and "second" do not limit the quantity and order of execution, and words such as "first" and "second" do not limit the difference.

The implementation manners of the application described above do not constitute a limitation on the protection scope of the application.

Claims (36)

A resource allocation method, characterized in that the method includes: Acquire the number of k groups of resources for m services, each group of resources corresponds to a resource allocation unit N, and each group of resources includes a coefficient a corresponding to each service, and the coefficient a represents the number of resource allocation units included in a service, The resource allocation unit N represents the number of resources included in one resource allocation unit, k≥1, N≥1 and k, N are all positive integers; The resources corresponding to the m services are determined among the L resources according to the number of the k sets of resources. The method according to claim 1, wherein said obtaining the number of k sets of resources of m services comprises: Acquire the number of m resources corresponding to the m services, each of the number of resources is expressed in the first base, m≥1; The k groups of resource numbers are obtained after each resource number expressed in the first base system is expressed in a second binary system, and the second binary system includes binary, octal, decimal, and hexadecimal. The method according to claim 2, wherein determining the resources corresponding to the m services from the L resources according to the number of the k sets of resources comprises: Determine the resources corresponding to the m services in the L resources according to the number of the k groups of resources in the order from the 1st group to the kth group, where the number of resources allocated to each group is the coefficient a of the m services And the product of the resource allocation unit N corresponding to each group. The method according to claim 3, wherein determining the resources corresponding to the m services from the L resources in the order of the number of the k groups of resources from the first group to the k-th group comprises: According to the sequence from the first group to the k-th group, if the resources allocated by any one of the first group to the k-th group include two or more services, then the pair includes the two or two The above service groups allocate resources corresponding to each service according to the order of service numbers or the order of interweaving of service numbers. The method according to claim 1, wherein the determining the resources corresponding to the m services among the L resources according to the number of the k sets of resources comprises: Acquiring a first sequence, where the first sequence is used to indicate a positional relationship between resource allocation units N of the number of resources of the k groups; According to the number of the k sets of resources and the first sequence, the resources corresponding to the m services are determined among the L resources. The method according to claim 5, wherein the first sequence includes k first units, and different first units correspond to different numbers of group resources. The method according to claim 5, wherein the first sequence includes z second units, different second units correspond to different group resource numbers, and at least one second unit corresponds to at least two group resource numbers, z<k, z is a positive integer and z≥2. The method according to claim 5, wherein the first sequence includes p third units, a group resource number corresponds to N different third units in the first sequence, and p is a positive integer and p≥2. The method according to claim 8, wherein p=2 ^k -1, in the 2 ^k -1 third units, each of the third units corresponds to a group number i, and i is 1 to For any one of k, the number of resources in the ^{i-th group corresponds to 2 i-1} third units in the first sequence. The method according to claim 5, wherein i is any one of 1 to k, the resource allocation unit N corresponding to the number of resources in the ith group is 2 ^i-1 , and the resource corresponding to the number of resources in the i+1 group The allocation unit N is 2 ^i+1-1 , Wherein, the ^2i-1 resources include the first resource of the i-th group, and the ^2i+1- th resources include the first resource of the i+1th group and the second resource of the i+1th group ； The first sequence is used to indicate that the first resource of the ith group is located between the first resource of the (i+1)th group and the second resource of the (i+1)th group among the L resources. The method according to claim 5 or 10, wherein said obtaining the first sequence comprises: For each group of resource numbers, the bit value represented by binary is listed in sequence from all 0s to all 1s, a total of 2 ^k count units; Every time a counting unit is generated, the bit value change of the current counting unit and the previous counting unit is compared to determine the bit that has jumped. The jumped change means that the bit value on the same bit has changed from the previous counting unit. The 0 in the current counting unit becomes 1; Sorting all the bits that have undergone transitions corresponding to the determined 2 ^{k -1 counting units to generate the first sequence.} The method according to claim 5 or 10, wherein said obtaining the first sequence comprises: Taking the k resource allocation units of the k groups of resources as k services, and using a preset algorithm to establish a correspondence between the k services and the total number of resources composed of the k services, Generating the first sequence according to the corresponding relationship; Wherein, the preset algorithm is: l×B mod Q, l is a constant, and the value of l ranges from 1 to Q; B is the number of resources required by any one of the first to kth services represented by k services, Q≥Max{B1, B2, B3,... , Bk}, mod represents the remainder operation, l×B mod Q represents the remainder obtained by dividing l×B by Q. The method according to any one of claims 2-12, wherein the method further comprises: The overhead frame is used to send service parameters, where the service parameters include: the number of services m, the number of m services, and the number of m resources. The method according to claim 13, wherein using an overhead frame to send the service parameter comprises: Sending 32 flexible Ethernet FlexE overhead frames to transmit the service parameters; Among them, the 1st to 20th FlexE overhead frames are used to carry the m service numbers, the 21st to 27th FlexE overhead frames are used to carry the m resource numbers, and the 28th to 32nd FlexE overhead frames are used for Resources are reserved for the bearer; and a first identifier is configured on the version identifier VER field in each FlexE overhead frame, and the first identifier is used to indicate that the service number or the number of resources carried in the FlexE overhead frame is the current Business parameters used. The method according to claim 13, wherein using an overhead frame to send the service parameter comprises: Sending 2m+2 overhead frames to transmit the service parameters; Wherein, the 2m+2 overhead frames include the first overhead frame, the second overhead frame, the third overhead frame to the 2m+2 overhead frame, and the first overhead frame includes the sum of m resources , The second overhead frame includes the number of services m, the m overhead frames in the 3rd to m+2th overhead frames include m service numbers, and the m+3th to 2m+2th overhead frames The m overhead frames in the frame include the number of m resources, and the version identifier VER field in each overhead frame is configured with a first identifier, and the first identifier is used to indicate the number of resources carried in the overhead frame. The service number or resource number is the currently used service parameter. The method according to claim 13, wherein the overhead frame includes one control code block and Y data code blocks, Y is a positive integer and Y≥2, The control code block is used to locate and transmit the number m of services, and the Y data code blocks are used to transmit the m resource numbers and the m service numbers. The method according to claim 16, wherein the Y data code blocks include at least one first code block, wherein one of the first code blocks is used to carry the number of m resources, or The m first code blocks in the at least one first code block are used to carry the m resource numbers. A resource allocation device, characterized in that the device includes: The obtaining unit is used to obtain the number of k groups of resources for m services, each group of resources corresponds to a resource allocation unit N, and each group of resources includes a coefficient a corresponding to each service, and the coefficient a represents the resource allocation included in a service The number of units, the resource allocation unit N represents the number of resources included in a resource allocation unit, k≥1, N≥1 and k, N are all positive integers; The processing unit is configured to determine the resources corresponding to the m services among the L resources according to the number of the k sets of resources. The device of claim 18, wherein: The acquiring unit is specifically configured to acquire the number of m resources corresponding to the m services, each of the resource numbers is expressed in a first base, m≥1; and, each of the number of resources is entered according to the first number. The number of resources represented by the system is expressed in a binary system to obtain the number of resources in the k groups, and the binary system includes binary, octal, decimal, and hexadecimal. The device of claim 19, wherein: The processing unit is specifically configured to determine, among the L resources, the resources corresponding to the m services in the order of the number of the k groups of resources from the 1st group to the kth group, wherein the number of resources allocated for each group It is the product of the sum of the coefficient a of m services and the resource allocation unit N corresponding to each group. The device of claim 20, wherein: The processing unit is specifically configured to follow the sequence of the first group to the k-th group, and if the resources allocated by any one of the first group to the k-th group include two or more services, then The group containing the two or more services allocates resources corresponding to each service according to the order of service numbers or the order of interleaving of service numbers. The device of claim 20, wherein: The processing unit is specifically configured to obtain a first sequence, and determine resources corresponding to the m services among the L resources according to the number of k sets of resources and the first sequence; the first sequence is used to indicate The positional relationship between the resource allocation units N of the number of resources in the k groups. The apparatus according to claim 22, wherein the first sequence includes k first units, and different first units correspond to different numbers of group resources. The apparatus according to claim 22, wherein the first sequence includes z second units, different second units correspond to different group resource numbers, and at least one second unit corresponds to at least two group resource numbers, z<k, z is a positive integer and z≥2. The apparatus according to claim 22, wherein the first sequence includes p third units, a group resource number corresponds to N different third units in the first sequence, and p is a positive integer and p≥2. The device according to claim 25, wherein p=2 ^k -1, among the 2 ^k -1 third units, each of the third units corresponds to a group number i, and i is 1 to For any one of k, the number of resources in the ^{i-th group corresponds to 2 i-1} third units in the first sequence. The device according to claim 22, wherein i is any one of 1 to k, the resource allocation unit N corresponding to the number of resources in the i-th group is 2 ^i-1 , and the resource corresponding to the number of resources in the i+1 group is The allocation unit N is ^2i+1-1 , wherein the ^2i-1 resources include the first resource of the i-th group, and the ^2i+1-1th resource includes the first resource of the i+1th group. Resources and the second resource of the i+1th group; The first sequence is used to indicate that the first resource of the ith group is located between the first resource of the (i+1)th group and the second resource of the (i+1)th group among the L resources. The device according to claim 22 or 27, wherein: The processing unit is specifically configured to list the bit values of each group of resource numbers in binary from all 0s to all 1s, a total of 2 ^k count units; each time a count unit is generated, compare the current count unit with The bit value of the previous count unit changes, and the bit that jumps is determined. The jump refers to that the bit value on the same bit changes from 0 in the previous count unit to 1 in the current count unit. ; Sort all the bits that have undergone transitions corresponding to the determined 2 ^{k -1 count units to generate the first sequence.} The device according to claim 22 or 27, wherein: The processing unit is specifically configured to use the k resource allocation units of the k sets of resources as k services, and use a preset algorithm to establish a correspondence between the k services and the total number of resources composed of the k services Relationship, generating the first sequence according to the corresponding relationship; Wherein, the preset algorithm is: l×B mod Q, l is a constant, and the value of l ranges from 1 to Q; B is the number of resources required by any one of the first to kth services represented by k services, Q≥Max{B1, B2, B3,... , Bk}, mod represents the remainder operation, l×B mod Q represents the remainder obtained by dividing l×B by Q. The device according to any one of claims 18-29, further comprising: The sending unit is configured to send service parameters using overhead frames, where the service parameters include: the number of services m, the number of m services, and the number of m resources. The device of claim 30, wherein: The sending unit is specifically configured to send 32 flexible Ethernet FlexE overhead frames to transmit the service parameters; Among them, the 1st to 20th FlexE overhead frames are used to carry the m service numbers, the 21st to 27th FlexE overhead frames are used to carry the m resource numbers, and the 28th to 32nd FlexE overhead frames are used for Resources are reserved for the bearer; and a first identifier is configured in the version identifier VER field of each FlexE overhead frame, and the first identifier is used to indicate that the service number or the number of resources carried in the FlexE overhead frame is the current Business parameters used. The device of claim 30, wherein: The sending unit is specifically configured to send 2m+2 overhead frames to transmit the service parameters; Wherein, the 2m+2 overhead frames include the first overhead frame, the second overhead frame, the third overhead frame to the 2m+2 overhead frame, and the first overhead frame includes the sum of m resources , The second overhead frame includes the number of services m, the m overhead frames in the 3rd to m+2th overhead frames include m service numbers, and the m+3th to 2m+2th overhead frames The m overhead frames in the frame include the number of m resources, and the version identifier VER field in each overhead frame is configured with a first identifier, and the first identifier is used to indicate the number of resources carried in the overhead frame. The service number or resource number is the currently used service parameter. The device according to claim 30, wherein the overhead frame includes a control code block and Y data code blocks, Y is a positive integer and Y≥2, and the control code block is used to locate and transmit the The number of services is m, and the Y data code blocks are used to transmit the number of m resources and the number of m services. The apparatus according to claim 33, wherein the Y data code blocks comprise at least one first code block, wherein one of the first code blocks is used to carry the number of m resources, or The m first code blocks in the at least one first code block are used to carry the m resource numbers. A network device includes a processor and a memory, the processor is coupled with the memory, and is characterized in that: The memory is used to store instructions; The processor is configured to call the instruction and execute the method according to any one of claims 1 to 17. A computer-readable storage medium, characterized by comprising computer program instructions, When the computer program instructions are executed, the method according to any one of claims 1 to 17 is implemented.

Images