WO2021057678A1 - 业务处理方法、装置及存储介质 - Google Patents

业务处理方法、装置及存储介质 Download PDF

Info

Publication number
WO2021057678A1
WO2021057678A1 PCT/CN2020/116610 CN2020116610W WO2021057678A1 WO 2021057678 A1 WO2021057678 A1 WO 2021057678A1 CN 2020116610 W CN2020116610 W CN 2020116610W WO 2021057678 A1 WO2021057678 A1 WO 2021057678A1
Authority
WO
WIPO (PCT)
Prior art keywords
transmission
service
services
windows
transmission windows
Prior art date
Application number
PCT/CN2020/116610
Other languages
English (en)
French (fr)
Inventor
钟其文
杨春生
朱志刚
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP20868968.7A priority Critical patent/EP4024752A4/en
Publication of WO2021057678A1 publication Critical patent/WO2021057678A1/zh
Priority to US17/703,472 priority patent/US20220217091A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078Timing of allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/22Traffic shaping
    • H04L47/225Determination of shaping rate, e.g. using a moving window
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/12Arrangements for remote connection or disconnection of substations or of equipment thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/14Monitoring arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/622Queue service order
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/72Admission control; Resource allocation using reservation actions during connection setup
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/827Aggregation of resource allocation or reservation requests
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078Timing of allocation
    • H04L5/0082Timing of allocation at predetermined intervals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/22Arrangements affording multiple use of the transmission path using time-division multiplexing

Definitions

  • This application relates to the field of communication technology, and in particular to a service processing method, device and storage medium.
  • a method of dividing time slots is used to manage bandwidth resources, and then service data is sent based on the divided time slots.
  • a 100G interface can be divided into 20 time slots, and the bandwidth of each time slot is 5G.
  • a corresponding time slot can be allocated to each service data to be transmitted, and then the corresponding service data can be transmitted through the allocated time slot.
  • the service data of one service can correspond to multiple time slots, and one time slot can only be used to carry the service data of one service.
  • the present application provides a service processing method, device, and storage medium, which can be used to solve the problem of bandwidth resource waste in related technologies when small-particle services are carried through divided time slots.
  • the technical solution is as follows:
  • a service processing method comprising: obtaining the number of transmission windows required by each of the n services to be mapped in a unit time period or in a unit data frame, and the number of transmission windows in the unit time period Or a unit data frame contains m transmission windows, the total number of transmission windows required by the n services is not greater than the m, and both the m and the n are integers greater than 1; according to each of the n services The number of transmission windows required for each service, from the m transmission windows, a corresponding transmission window is allocated for each service; according to the transmission window corresponding to each service, the service data of the n services are multiplexed into one data group , Send the multiplexed data.
  • the unit time period or unit data frame can be divided into m transmission windows, and then the corresponding service is transmitted by assigning a corresponding transmission window for each service. In this way, multiple services can be multiplexed.
  • the time period or data frame is used for service transmission, which avoids the waste of bandwidth resources caused by only one type of service can be carried in one time period or one data frame in related technologies.
  • the implementation process of allocating a corresponding transmission window for each service from the m transmission windows may be: according to the n services
  • the number of transmission windows required for each service in the k transmission resources is determined to determine the candidate service identifier corresponding to each transmission resource.
  • the k transmission resources refer to the total transmission in the unit time period or unit data frame.
  • the resources are divided, the candidate service ID refers to the service ID of the service that expects to use the corresponding transmission resource, and the k is not less than the maximum number of transmission windows among the number of transmission windows required by the n services; according to each transmission
  • the candidate service identifier corresponding to the resource allocates a corresponding transmission window for each service.
  • the candidate service identifier corresponding to each transmission resource can be determined, and then according to the candidate service identifier corresponding to each transmission resource, a corresponding transmission window is allocated to each service in parallel.
  • the k is any one of the maximum number of transmission windows, m and 2p.
  • the implementation process of determining the candidate service identifier corresponding to each of the k transmission resources may be: according to each of the n services The number of transmission windows required by each service, and sequentially detecting whether each service in the n services expects to use the first transmission resource, where the first transmission resource is any transmission resource among the k transmission resources; If there is no service expected to use the first transmission resource among the n services, it is determined that the candidate service identifier corresponding to the first transmission resource is empty; if there is any service expected to use the first transmission resource among the n services For the service of the transmission resource, the service identifier of one or more services expected to use the first transmission resource is used as the candidate service identifier of the first transmission resource.
  • the implementation process of assigning a corresponding transmission window for each service may be: according to the sequence of the k transmission resources and the candidate service identifier corresponding to each transmission resource
  • the sequence of the identified services is used to generate a service identification buffer queue; when the total number of transmission windows required by the n services is equal to the m, the m transmission windows are set in the order of the m transmission windows Are sequentially assigned to the services identified by the service identifiers in the service identifier cache queue; when the total number of transmission windows required by the n services is less than the m, according to the order of the m transmission windows, all Among the m transmission windows, a number of transmission windows equal to the total number of transmission windows required by the n services are sequentially allocated to the services identified by each service identifier in the service identifier cache queue.
  • the n services include one or more idle services.
  • the total number of transmission windows required for valid services is less than m, one or more idle services can be constructed, and the total number of constructed idle services and valid services is n, and the total number of required services for these n services
  • the total number of transmission windows is equal to m. In this way, when n services are mapped to m transmission windows, it can be ensured that the effective services of the n services can be evenly distributed to each transmission window.
  • the sequence of the services identified by the candidate service identifiers corresponding to each transmission resource refers to the order in which the service numbers of the respective services are arranged in ascending order, or the candidate corresponding to each transmission resource
  • the order of the services identified by the service identifier refers to the order in which the remainders corresponding to each business are arranged in ascending order, and the remainders corresponding to each business refer to the number of transmission windows required by the corresponding service and the corresponding transmission resources in the order.
  • the remainder obtained by dividing the product of the ranking numbers in the k transmission resources by the k.
  • the implementation process of assigning a corresponding transmission window to each service may be: when the candidate service identifier corresponding to the first transmission resource is determined, according to the first transmission resource A candidate service identifier corresponding to a transmission resource generates a service identifier cache queue; starting from the first transmission window among the currently remaining transmission windows among the m transmission windows, each service identifier in the service identifier cache queue is sequentially The identified service is assigned a corresponding transmission window, and the assigned service identifier is deleted from the cache queue; accordingly, when it is detected that the service identifier cache queue is empty, the second transmission resource is used as the first transmission Resource, re-execute the step of sequentially detecting whether each of the n services is expected to use the first transmission resource according to the number of transmission windows required by each of the n services, and the second The transmission resource is located after and adjacent to the first transmission resource.
  • a service identification cache queue can be generated according to the candidate service identification corresponding to each transmission resource, and then, a corresponding transmission window is allocated to each candidate service identification in the service identification cache queue one by one.
  • a corresponding queue can be generated. After that, the service ID in this queue is allocated with a transmission window. After the allocation is completed , And then determine the candidate service identifier corresponding to the next transmission resource.
  • the implementation process of sequentially detecting whether each of the n services is expected to use the first transmission resource according to the number of transmission windows required by each of the n services may be: Determining the product of the number of transmission windows required by the i-th service and j for the i-th service among the n services, where j is the sequence number of the first transmission resource among the k transmission resources; Determine the remainder obtained by dividing the product by the k; if the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the first transmission resource.
  • the implementation process of sequentially detecting whether each of the n services is expected to use the first transmission resource according to the number of transmission windows required by each of the n services may be: For the i-th service among the n services, determine the product of the number of transmission windows required by the i-th service and k-j+1, where j is the first transmission resource in the k transmissions The order number in the resource; determine the remainder obtained by dividing the product by the k; if the remainder is less than the number of transmission windows required by the i-th service, determine that the i-th service expects to use the The first transmission resource.
  • the implementation process of allocating a corresponding transmission window for each service from the m transmission windows according to the number of transmission windows required by each of the n services may be: according to the n The number of transmission windows C 1 required by the first service in the two services and the m, from the m transmission windows, the C 1 transmission window is allocated to the first service; according to the number of transmission windows in the n services The number of transmission windows C i required by the i service and the m, from the remaining transmission windows in the m transmission windows, the i-th service is allocated C i transmission windows, and the remaining transmission windows refer to The remaining transmission windows except for the transmission windows allocated for the first i-1 services among the m transmission windows, and the i is an integer greater than 1.
  • the aforementioned method in addition to using the aforementioned method to allocate transmission windows for each service in parallel, the aforementioned method can also be used to serially allocate transmission windows for each service in turn.
  • the method further includes: sending service configuration parameters to a receiving device, so that the receiving device demultiplexes the received multiplexed data according to the service configuration parameters to obtain the n services
  • the service configuration parameters include the number of transmission windows required by each of the n services.
  • the sending device can also send service configuration parameters to the receiving device before or at the same time as sending the multiplexed data to the receiving device, so that the receiving device can use the same method as the sending device according to the service configuration parameters.
  • To determine the transmission window corresponding to each service that is, determine which transmission window each service is carried by, so that the receiving device can demultiplex the received service according to the determined transmission window corresponding to each service, thereby restoring Get each business.
  • the sending device does not need to store the mapping relationship between the service and the transmission window, and the sending device and the receiving device do not need to transmit the mapping relationship between the service and the transmission window, and only need to transmit a small amount of service configuration parameters to achieve the correct service. Demultiplexing, high storage and transmission efficiency.
  • a service processing device in a second aspect, is provided, and the service processing device has the function of realizing the behavior of the service processing method in the first aspect.
  • the service processing device includes at least one module, and the at least one module is used to implement the service processing method provided in the above-mentioned first aspect.
  • a service processing device in a third aspect, includes a processor and a memory, and the memory is used to store a program that supports the service processing device to execute the service processing method provided in the first aspect, And storing the data involved in the service processing method provided in the first aspect.
  • the processor is configured to execute a program stored in the memory.
  • the operating device of the storage device may further include a communication bus, and the communication bus is used to establish a connection between the processor and the memory.
  • a computer-readable storage medium stores instructions that, when run on a computer, cause the computer to execute the business processing method described in the first aspect.
  • a computer program product containing instructions which when running on a computer, causes the computer to execute the business processing method described in the first aspect.
  • the sending end can obtain the number of transmission windows required by each of the n services to be mapped in a unit time period or a unit data frame, where the unit time period or unit data frame contains There are m transmission windows. After that, according to the number of transmission windows required by each service, the sender can allocate a corresponding transmission window for each service from the m transmission windows, and multiplex the service data of n services according to the transmission window corresponding to each service. For one channel of data, the multiplexed data is sent.
  • the embodiment of the present application can divide the unit time period or unit data frame into m transmission windows, and then transmit the corresponding service by allocating the corresponding transmission window for each service, so that multiple services can be multiplexed
  • One time period or data frame is used for service transmission, which avoids the waste of bandwidth resources caused by only one type of service can be carried by one time period or one data frame in related technologies.
  • FIG. 1 is a system architecture diagram involved in a service processing method provided by an embodiment of the present application
  • Figure 2 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • Fig. 3 is a flowchart of a service processing method provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of allocating transmission windows for each service according to an embodiment of the present application.
  • FIG. 5 is a schematic diagram of a trigger signal for triggering the determination of the candidate service identifier corresponding to the j-th transmission resource according to an embodiment of the present application
  • Fig. 6 is a schematic diagram of another trigger signal for triggering the determination of the candidate service identifier corresponding to the j-th transmission resource according to an embodiment of the present application;
  • FIG. 7 is another schematic diagram of allocating transmission windows for each service provided by an embodiment of the present application.
  • FIG. 8 is a schematic diagram of another trigger signal for triggering the determination of the candidate service identifier corresponding to the j-th transmission resource according to an embodiment of the present application;
  • FIG. 9 is another schematic diagram of allocating transmission windows for each service provided by an embodiment of the present application.
  • FIG. 10 is another schematic diagram of allocating transmission windows for each service provided by an embodiment of the present application.
  • FIG. 11 is a schematic diagram of the data structure of a FlexE frame provided by an embodiment of the present application.
  • FIG. 12 is a schematic diagram of a time slot of a FlexE frame multiplexing n services according to an embodiment of the present application.
  • FIG. 13 is a schematic diagram of sending n services using Ethernet frames according to an embodiment of the present application.
  • FIG. 14 is a schematic structural diagram of a service processing apparatus provided by an embodiment of the present application.
  • FIG. 1 is a system architecture diagram involved in a service processing method provided by an embodiment of the present application. As shown in FIG. 1, the system includes user equipment 101-103, forwarding equipment 104, forwarding equipment 105, and user equipment 106.
  • the user equipment 101-103 can send service data to the forwarding device 104.
  • the forwarding device 104 After the forwarding device 104 receives the service data sent by the user equipment 101-103, it can allocate multiple transmission windows in a specified time slot to multiple different services through the service processing method provided in this embodiment of the application.
  • the assigned transmission window sends the received service data to the forwarding device 105. That is, multiple services can multiplex a time slot for service data transmission.
  • the forwarding device 104 may also determine the number of transmission windows contained in the designated time slot and the transmission window required by each of the multiple services transmitted in the designated time slot. The quantity is sent to the forwarding device 105.
  • the forwarding device 105 may use the number of transmission windows in the designated time slot sent by the forwarding device 104 and the number of transmission windows required by each of the multiple services transmitted in the designated time slot, using the method provided in the embodiment of the present application.
  • the service processing method determines the transmission window corresponding to each service, that is, determines which service the service data carried by each transmission window belongs to, and then demultiplexes the received service data. Afterwards, the forwarding device 105 may forward the demultiplexed service data to the user equipment 106.
  • the user equipment 101-103 and the user equipment 106 may be a personal computer, a desktop machine, a server, and the like.
  • the forwarding devices 104 and 105 may be network devices with Ethernet interfaces, FlexE interfaces, or OTN interfaces, such as core routers, edge routers, OTN transmission equipment, wireless access network Internet Protocol (Internet Protocol Radio Access Network, IPRAN) box type or Frame type transmission equipment, packet transport network (PTN) box type or frame type transmission equipment, etc.
  • IPRAN Internet Protocol Radio Access Network
  • PTN packet transport network
  • FIG. 1 is only an exemplary architecture diagram.
  • the system may include multiple other user equipments.
  • the system may also include multiple forwarding devices in addition to the forwarding devices 104 and 105, and the embodiment of the present application does not limit the number of devices.
  • Fig. 2 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • the forwarding device in Fig. 1 can be implemented by the network device shown in Fig. 2.
  • the network device includes at least one processor 201, a communication bus 202, a memory 203, and at least one communication interface 204.
  • the processor 201 may be a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more programs used to control the execution of the program of this application. integrated circuit.
  • CPU Central Processing Unit
  • ASIC application-specific integrated circuit
  • the communication bus 202 may include a path for transferring information between the above-mentioned components.
  • the memory 203 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (RAM), or other types that can store information and instructions.
  • the type of dynamic storage device can also be electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), CD-ROM (Compact Disc Read-Only Memory, CD-ROM) or other optical disk storage, optical disc Storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic 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 can be used by Any other medium accessed by the computer, but not limited to this.
  • the memory 203 may exist independently and is connected to the processor 201 through a communication bus 202.
  • the memory 203 may also be integrated with the processor 201.
  • the communication interface 204 uses any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, wireless access network (RAN), wireless local area networks (Wireless Local Area Networks, WLAN), etc.
  • RAN wireless access network
  • WLAN Wireless Local Area Networks
  • the processor 201 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG. 2.
  • the computer device may include multiple processors, such as the processor 201 and the processor 205 shown in FIG. 2.
  • processors can be a single-CPU (single-CPU) processor or a multi-core (multi-CPU) processor.
  • the processor here may refer to one or more devices, circuits, and/or processing cores for processing data (for example, computer program instructions).
  • the memory 203 is used to store the program code for executing the solution of the present application, and the processor 201 controls the execution.
  • the processor 201 is configured to execute the program code 206 stored in the memory 203.
  • the program code 206 may include one or more software modules.
  • the forwarding device shown in FIG. 1 can process the service to be transmitted or the received service through the processor 201 and one or more software modules in the program code 206 in the memory 203.
  • Fig. 3 is a flowchart of a service processing method provided by an embodiment of the present application.
  • the service processing method can be applied to the forwarding device 104 shown in FIG. 1 to send service data.
  • the method includes:
  • Step 301 Obtain the number of transmission windows required for each of the n services to be mapped in a unit time period or a unit data frame.
  • the unit time period or a unit data frame contains m transmission windows and n services
  • the total number of required transmission windows is not greater than m, and both m and n are integers greater than 1.
  • FlexE includes FlexE interfaces with multiple bandwidths such as 50G, 100G, 200G, and 400G.
  • the FlexE interface can be divided into multiple time slots.
  • a 50G FlexE interface may include 10 time slots, and the bandwidth of each time slot is 5G.
  • a 100G FlexE interface may include 20 time slots, and the bandwidth of each time slot is 5G.
  • OTN also includes OTN interfaces with multiple bandwidths, and OTN interfaces can also be divided into multiple time slots.
  • a 100G OTN interface can be divided into 40 time slots, and the bandwidth of each time slot is 2.5G, or a 100G OTN interface can be divided into 80 time slots, and each time slot has a bandwidth of 1.25G.
  • one time slot of the aforementioned interface can be taken as a unit time period, and the time slot can be divided to obtain m transmission windows.
  • the time slots can be divided according to the specified bit length, so as to obtain m transmission windows.
  • one FlexE interface can support one or more FlexE instances, and each FlexE instance introduces a fixed periodic frame structure.
  • a fixed periodic frame structure can be divided into 20 time slots, and each time slot includes 1023*8 66-bit code blocks. Based on this, you can A 66-bit code block is used as a transmission window, so that a time slot can be divided into 1023*8 transmission windows.
  • a periodic frame structure is also introduced, and time slots are divided according to the periodic frame structure. Based on this, the time slots can be divided according to the specified byte length to obtain m transmission windows. For example, one byte is used as a transmission window, or 4 bytes are used as a transmission window.
  • the forwarding device can determine the number of transmission windows required by each service according to the bandwidth required by each of the n services to be transmitted and the bandwidth of each transmission window. Among them, the total bandwidth required by n services is less than the bandwidth of one time slot. Correspondingly, the number of transmission windows required by n services will be less than or equal to the number m of transmission windows included in the time slot.
  • the forwarding device can calculate the ratio of y to x, and round up the calculated ratio to obtain the service required The number of transmission windows.
  • the forwarding device may also divide the unit data frame to obtain multiple transmission windows.
  • the forwarding device may use the Ethernet frame as a unit data frame, and divide the Ethernet frame according to a specified length, so as to obtain m transmission windows.
  • Step 302 According to the number of transmission windows required by each of the n services, a corresponding transmission window is allocated to each service from the m transmission windows.
  • the forwarding device can determine the candidate service identifier corresponding to each transmission resource in the k transmission resources according to the number of transmission windows required by each service.
  • the k transmission resources refer to the unit time period or unit The total transmission resources in the data frame are divided, and the candidate service identifier refers to the service identifier of the service that expects to use the corresponding transmission resource, and k is not less than the maximum number of transmission windows among the number of transmission windows required by n services.
  • a corresponding transmission window is allocated for each service.
  • the total transmission resources in a unit time period or a unit data frame can be divided according to the size of the transmission window.
  • the total number of divided transmission resources will be equal to m, that is, k is equal to m.
  • the total transmission resources in a unit time period or a unit data frame can also be divided according to a granularity larger than the transmission window, so that k will be smaller than m.
  • k when dividing according to the bandwidth of the service corresponding to the largest number of transmission windows in the number of required transmission windows in the n services, k will be equal to the number of maximum transmission windows.
  • the total transmission resources in a unit time period or a unit data frame can also be divided according to a granularity smaller than the transmission window.
  • k will be greater than m. That is, in this embodiment of the present application, k is not less than the maximum number of transmission windows. Among them, k can be equal to any of the maximum number of transmission windows, m and 2p .
  • the forwarding device can allocate a corresponding transmission window for each service through the following different methods.
  • the forwarding device can, according to the number of transmission windows required by each service, sequentially detect whether each service in each of the n services expects to use the first transmission resource, and the first transmission resource is any of the k transmission resources. 1. Transmission resource; if there is no service expecting to use the first transmission resource among the n services, it is determined that the candidate service identifier corresponding to the first transmission resource is empty; if there is a service expecting to use the first transmission resource among the n services, then The service identifiers of one or more services expected to use the first transmission resource are used as candidate service identifiers of the first transmission resource.
  • the forwarding device can generate a service identifier cache queue according to the sequence of the k transmission resources and the sequence of the services identified by the candidate service identifier corresponding to each transmission resource; when the total number of transmission windows required for n services is equal to m , According to the order of m transmission windows, assign m transmission windows to the services identified by each service identifier in the service identifier buffer queue; when the total number of transmission windows required for n services is less than m, the m transmission windows The order of the windows is to sequentially allocate a number of transmission windows equal to the total number of transmission windows required by the n services among the m transmission windows to the services identified by each service identifier in the service identifier cache queue.
  • each service can be arranged in descending order of the number of transmission windows required by each service, or according to the urgency of each service, which is not limited in the embodiment of the present application.
  • the forwarding device can sort the k transmission resources according to the sequence of the k transmission resources, and number them sequentially. For the transmission resource ranked first, the ranking number of the transmission resource is 1, and the ranking number of the second transmission resource is 2, and so on.
  • the forwarding device can start from the first transmission resource among the k transmission resources, and sequentially detect the first service, the second service...whether the nth service expects to use the first transmission resource, and expects Use the service ID of the first transmission resource as the candidate service ID of the first transmission resource. Next, the forwarding device can sequentially detect whether the first service, the second service...the nth service expects to use the second transmission resource among the k transmission resources, and so on.
  • the forwarding device can detect whether the i-th service expects to use the first transmission resource in the following two ways.
  • the forwarding device can determine the product of the number of transmission windows required by the i-th service and j, where j is the sequence number of the first transmission resource among the k transmission resources; determine the product divided by k If the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the first transmission resource. If the remainder is greater than the number of transmission windows required by the first service, it is determined that the i-th service does not expect to use the first transmission resource.
  • the service identifiers corresponding to these 4 services are S1, S2, S3, and S4, respectively, where the number of transmission windows required by S1 is 4, and the number of transmission windows required by S2 Is 3, the number of transmission windows required by S3 is 2, and the number of transmission windows required by S4 is 3.
  • the sequence of the above 4 services is S1, S2, S3, and S4. Assume that k is equal to 12, that is, there are 12 transmission resources.
  • the forwarding device can first calculate the product of the number of transmission windows required by S1 and 1, and the product obtained is 4, and the remainder obtained by dividing the product by k is 4, because the remainder is not less than S1 The number of transmission windows required, so it can be seen that S1 does not expect to use the first transmission resource.
  • the forwarding device uses the same method to detect whether the second service expects to use the first transmission resource, and so on. Through the foregoing method, it can be determined that all services do not expect to use the first transmission resource. At this time, the forwarding device can determine that the candidate service identifier corresponding to the first transmission resource is empty.
  • the forwarding device can then refer to the above method to sequentially detect whether each service expects to use the second transmission resource.
  • the remainder corresponding to each service is not less than the number of transmission windows required by itself, and therefore, it can be determined that the candidate service identifier corresponding to the second transmission resource is also empty.
  • the remainder corresponding to service S1 is 0, which is less than the number of transmission windows required by S1, and the remainders corresponding to other services are greater than the number of transmission windows required by the corresponding service.
  • the candidate service identifier corresponding to the third transmission resource is S1.
  • the candidate service identifiers corresponding to the 4th and 8th transmission resources are S2 and S4, the candidate service identifiers corresponding to the 5th, 7, 10 and 11th transmission resources are empty, and the 6th transmission resource is empty.
  • the corresponding candidate service identifiers are S1 and S3, the candidate service identifier corresponding to the 9th transmission resource is S1, and the candidate service identifier corresponding to the 12th transmission resource is S1, S2, S3, and S4.
  • the forwarding device may generate a service identifier cache queue according to the sequence of the k transmission resources and the sequence of the services identified by each candidate service identifier.
  • the forwarding device may, after determining the candidate service identifier corresponding to each transmission resource, arrange the candidate service identifiers corresponding to each transmission resource according to the sequence of the transmission resources, so as to obtain the service identifier cache queue.
  • the forwarding device may arrange the service identifiers from small to large according to the service numbers of the services they identify.
  • each service identifier can be arranged in descending order of the remainder corresponding to the service identified by it, where the remainder corresponding to the service identified by each service identifier refers to the number of transmission windows required by the corresponding service and the transmission resource The remainder obtained by dividing the product of the sorted numbers by k.
  • the forwarding device may also add the corresponding candidate service identifier to the service identifier cache queue according to the order of the corresponding service after each determination to obtain a candidate service identifier corresponding to a transmission resource. That is, after determining the candidate service identifier corresponding to the first transmission resource, the forwarding device may form an initial service identifier cache queue according to the order of the services corresponding to each candidate service identifier, and then determine the second transmission resource.
  • the candidate service ID corresponding to the resource After the candidate service ID corresponding to the resource, according to the order of the service corresponding to each candidate service ID, starting from the end of the initial service ID cache queue, the candidate service ID corresponding to the second transmission resource is added to the service ID cache queue in turn , And so on, until the candidate service ID corresponding to the k-th transmission resource is added to the service ID cache queue.
  • the forwarding device may need to determine the candidate service identifiers corresponding to all transmission resources one time slot in advance or earlier, so as to ensure that the first transmission window starts in this time slot. That is, each transmission window can be allocated.
  • the forwarding device can pass a number It is a clock pulse signal of j to trigger the operation of determining the candidate service identifier corresponding to the jth transmission resource.
  • the forwarding device may also be triggered by a number of corresponding clock pulse signals with a value of j, which is not limited in the embodiment of the present application.
  • the forwarding device can determine the number of transmission windows required for the i-th service data and the product of k-j+1, where j is the sequence number of the first transmission resource among the k transmission resources; determine the product divided by The remainder obtained by k; if the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the first transmission resource. If the remainder is not less than the number of transmission windows required by the i-th service, it is determined that the i-th service does not expect to use the first transmission resource.
  • the forwarding device can calculate the product of the number of transmission windows required by S1 and 12, and the product obtained is 48. After the product is divided by 12, the remainder is 0, which is less than that required by S1. The number of transmission windows, so it can be known that S1 expects to use the first transmission resource. For the remaining S2-S4, since the remainders corresponding to these three services are less than the number of transmission windows required by the corresponding services, it can be known that all three services expect to use the first transmission resource. At this time, the first transmission resource can be determined.
  • the candidate service identifiers corresponding to the transmission resources include the service identifiers of all services.
  • the forwarding device can refer to the aforementioned method to determine the remainders corresponding to the 4 services in turn, which are 8, 9, 10, and 9. Each of the 4 remainders is not less than the transmission required by the corresponding service. Therefore, it can be determined that no service expects to use the second transmission resource, that is, the candidate service identifier corresponding to the second transmission resource is empty.
  • the forwarding device can refer to the above method to determine the corresponding candidate service ID, and finally determine the candidate service ID corresponding to the 3rd, 6th, 8th, 11th, and 12th transmission resources.
  • the candidate service identifiers corresponding to the fourth and tenth transmission resources are S1
  • the candidate service identifiers corresponding to the fifth and ninth transmission resources are S2 and S4
  • the candidate service identifiers corresponding to the seventh transmission resource are S1 and S3.
  • the forwarding device does not need to determine the candidate service identifiers corresponding to all transmission resources in advance, and can ensure that each transmission window is allocated immediately starting from the first transmission window in this time slot.
  • the forwarding device can use the number shown in FIG. 4 as The clock pulse signal of j triggers the operation of determining the candidate service identifier corresponding to the j-th transmission resource.
  • the forwarding device may also be triggered by the value m-j+1 and the corresponding clock pulse signal, which is not limited in the embodiment of the present application.
  • the forwarding device may also use other methods to detect whether a certain service expects to use a certain transmission resource.
  • the forwarding device can calculate the quotient of the number of transmission windows required by each service and k to obtain the service step size of each service. After that, for the first transmission resource, the forwarding device can calculate the sum of the service step length of each service and the initial cumulative value to obtain the cumulative step length of each service. The service identifier of the service whose cumulative step length is not less than 1 is used as the candidate service identifier of the first transmission resource. After that, for the second transmission resource, the forwarding device can subtract one from the cumulative step size of each service identified by the candidate service identifier of the first transmission resource to obtain the current cumulative step size of the corresponding service.
  • the forwarding device can compare the current cumulative step size of each service with the size of 1, and then determine the candidate service ID corresponding to the second transmission resource, and so on, until the candidate service ID corresponding to all the transmission resources is determined .
  • the total number of transmission windows required by n services may be less than m or equal to m. Based on this, after generating the service identification cache queue, if the total number of transmission windows required for n services is less than m, the forwarding device can sequentially allocate m transmission windows to the service identification cache queue according to the order of the m transmission windows The business identified by each business identifier. If the total number of transmission windows required by n services is less than m, the forwarding device can sequentially allocate the number of transmission windows in m transmission windows equal to the total number of transmission windows required by n services in the order of m transmission windows. The service ID caches the service identified by each service ID in the queue.
  • the forwarding device may start from the first service identifier in the service identifier cache queue, and assign the first transmission window of the m transmission windows to the service identified by the first service identifier in the service identifier cache queue. , Assign the second transmission window to the service identified by the second service identifier in the service identifier cache queue, and so on, assign the jth transmission window to the service identified by the jth service identifier in the service identifier cache queue business. In this way, for each allocated transmission window, the transmission window will correspond to a service, and the sorting number of the transmission window in the m transmission windows is the same as the sorting number of the corresponding service in the service identification buffer queue.
  • the first business identity in the business identity cache queue refers to the business identity located at the head of the queue, the second business identity is located after the first business identity, and so on, the last business identity is the one located there.
  • the service ID of the end of the queue in the service ID cache queue refers to the business identity located at the head of the queue, the second business identity is located after the first business identity, and so on, the last business identity is the one located there.
  • the candidate service identifiers corresponding to the first and second transmission resources are empty, and the candidate service identifier corresponding to the third transmission resource is S1, and the first service identifier in the service identifier cache queue is S1.
  • the candidate service identifiers corresponding to the fourth transmission resource are S2 and S4, and the second service identifier in the service identifier cache queue is S2, and the third service identifier is S4.
  • the candidate service identifier corresponding to the fifth transmission resource is empty, and the candidate service identifiers corresponding to the sixth transmission resource are S1 and S3. Therefore, the fourth service identifier in the service identifier cache queue is S1, and the fifth service identifier is S3.
  • the service identification cache queues finally obtained are: S1, S2, S4, S1, S3, S2, S4, S1, S1, S2, S3, S4.
  • the forwarding device can assign the first transmission window to S1 according to the order of the 12 transmission windows and the order of service identifiers.
  • the second transmission window is allocated to S2
  • the third transmission window is allocated to S4
  • the fourth transmission window is allocated to S1, and so on, until all the 12 service IDs in the service ID cache queue are assigned correspondingly Until the transfer window.
  • the service ID cache queue obtained according to the candidate service ID corresponding to each transmission resource is: S1, S2, S3, S4, S1, S2, S4, S1, S3, S2, S4, S1, then forward
  • the device can sequentially allocate 12 transmission windows to the services identified by each service identifier in the service identifier cache queue according to the above-mentioned cache queue, as shown in the figure.
  • FIG. 9 shows that when k is less than m and k is equal to the maximum number of transmission windows Cmax among the number of required transmission windows for n services, the service identifier cache queue is generated according to the candidate service identifier corresponding to each transmission resource, and then A schematic diagram of allocating transmission windows for each service according to the service identification cache queue.
  • the forwarding device calculates the product of the number of transmission windows required by S1 and 1, and the product obtained is 4. Calculate the remainder obtained after dividing the product by 4, the remainder is 0, and the remainder is less than the number of transmission windows required by it. Therefore, it can be seen that S1 expects to use the first transmission resource.
  • S2-S4 the same method is used to determine that the corresponding remainders are 3, 2, and 3 respectively, which are not less than the number of transmission windows required by the corresponding service.
  • the candidate service identifier corresponding to the first transmission resource is S1.
  • the forwarding device may add S1 to the end of the service identification cache queue. After that, the forwarding device can continue to use the aforementioned method to determine the candidate service identifiers corresponding to the second transmission resource, which are S1, S2, S3, and S4, respectively, and assign the candidate service identifiers corresponding to the second transmission resource according to each service identifier.
  • the sequence of the identified business is added to the end of the business identification cache queue.
  • the candidate service identifiers S1, S2, S4 corresponding to the third transmission resource, and the candidate service identifiers S1, S2, S3, S4 corresponding to the fourth transmission resource are sequentially added to the service identifier cache queue.
  • the service identification cache queues are S1, S1, S2, S3, S4, S1, S2, S4, S1, S2, S3, S4.
  • the forwarding device when determining the candidate service identifier corresponding to each of the k transmission resources in sequence, may also refer to the method introduced in the second method described above, and change The jth transmission resource is regarded as the j+k-1th transmission resource for evaluation. That is, for the j-th transmission resource, the forwarding device can determine the product of the number of transmission windows required by the i-th service and j+k-1. After that, the forwarding device can determine the remainder obtained after dividing the product by k.
  • the i-th service If the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the j-th transmission resource; otherwise, it is determined that the i-th service does not expect to use the j-th transmission resource.
  • the forwarding device determines the candidate service corresponding to each transmission resource according to the maximum number of transmission windows among the number of transmission windows required by n services and the number of transmission windows required by each service. In this way, the forwarding device only needs to determine the candidate service identity corresponding to C max transmission resources to determine a service identity cache queue, that is, the forwarding device only needs to perform C max evaluation operations to obtain a service identity cache The queue further allocates the transmission window according to the service identifier buffer queue. Compared with the determination of candidate service identifiers corresponding to m transmission resources shown in FIGS. 4 and 7, the evaluation operations are performed m times, which reduces the number of evaluation operations.
  • the foregoing is the first method provided by the embodiment of the present application to determine the candidate service identifier corresponding to each transmission resource in the k transmission resources based on the number of transmission windows required by each of the n services, and then determine the candidate service identifier corresponding to each transmission resource according to the number of transmission windows required by each of the n services.
  • the candidate identifier is an implementation manner of assigning a corresponding transmission window to each service.
  • each of the n services sequentially detect whether each of the n services expects to use the first transmission resource, and the first transmission resource is any one of the k transmission resources ; If there is no service expected to use the first transmission resource among the n services, the candidate service identifier corresponding to the first transmission resource is determined to be empty; if there is a service expected to use the first transmission resource among the n services, the service is expected to be used.
  • the service identifiers of one or more services of the first transmission resource are used as candidate service identifiers of the first transmission resource.
  • the service ID cache queue is generated according to the candidate service ID corresponding to the first transmission resource; starting from the first transmission window among the current remaining transmission windows among the m transmission windows , In turn, assign corresponding transmission windows for the services identified by each service identifier in the service identifier cache queue, and delete the assigned service identifiers from the cache queue; when it is detected that the service identifier cache queue is empty, the second transmission
  • the resource is used as the first transmission resource, and the step of sequentially detecting whether each of the n services is expected to use the first transmission resource is performed according to the number of transmission windows required by each of the n services.
  • the second transmission resource is located in the first transmission. After the resource and adjacent to the first transmission resource.
  • the forwarding device can refer to the content introduced in the foregoing implementation manner to determine the candidate service identifier corresponding to the first transmission resource. After obtaining the candidate service identifier corresponding to the first transmission resource, the forwarding device may generate a service identifier cache queue according to the candidate service identifier corresponding to the first transmission resource, and the service identifier cache queue includes only the candidate service corresponding to the first transmission resource Logo.
  • the implementation manner of generating the service identification cache queue according to the candidate service identification corresponding to the first transmission resource can also refer to the implementation manner of generating the service identification cache queue in the foregoing implementation manner, which will not be repeated in this embodiment of the application.
  • the forwarding device can assign corresponding transmission windows to the services identified by each service identifier in the service identifier cache queue according to the related implementation described above. . Among them, each time a corresponding transmission window is allocated for a service identifier, the service identifier can be deleted from the service identifier cache queue.
  • the forwarding device can continue to determine by the above method
  • the candidate service identifier corresponding to the next transmission resource further generates a service identifier cache queue according to the candidate service identifier corresponding to the next transmission resource, and allocates a transmission window according to the service identifier cache queue. And so on, until the last transmission resource is processed.
  • k may be less than m and less than the total number of transmission windows required by n services.
  • the forwarding device can calculate the product of the number of transmission windows required for each service and the sequence number of the transmission resource, which is 1, to obtain n products. After that, the forwarding device can determine The remainder obtained after dividing each of the n products by C max , thereby obtaining n remainders. Select a service whose corresponding remainder is less than the number of transmission windows required by the corresponding service from the n services, and use the service identifier of the selected service as the w 1 candidate service identifier corresponding to the first transmission resource.
  • w 1 After determining the first transmission resource corresponding to a candidate service identifier w 1, w 1 according to the forwarding device may candidate identified by the service identifier of the service order, to generate a buffer queue according to the service identification w 1 candidate service identifier, and According to the sequence of the m transmission windows, the first to w 1 transmission windows are sequentially allocated to the services identified by the 1 to w 1 service identifiers in the service identifier cache queue. Among them, each time a service identifier is allocated, the forwarding device may delete the service identifier from the cache queue.
  • the forwarding device can determine the candidate service identifier corresponding to the second transmission resource. Among them, the forwarding device can calculate the product of the number of transmission windows required for each service and the sequence number 2 of the transmission resource to obtain n products. After that, determine the remainder of each product divided by C max. Select a service with a corresponding remainder less than the number of transmission windows required by the corresponding service from the n services, and use the service ID of the selected service as the candidate service ID corresponding to the second transmission resource.
  • the forwarding device can refer to the method introduced to generate a service identifier cache queue based on the candidate service identifier corresponding to the second transmission resource, and assign the first transmission window of the remaining transmission windows among the m transmission windows to the service identifier cache
  • the first service ID in the queue, the second transmission window is allocated to the second service ID in the service ID cache queue, and so on, until the allocation is completed.
  • the service identifier is deleted from the service cache queue.
  • the forwarding device can refer to the aforementioned method to determine the candidate service identifier of the third transmission resource. And so on, until the C max transmission resource is determined and the m transmission windows are allocated.
  • Fig. 10 is a schematic diagram showing a method for allocating a transmission window for a service according to an embodiment of the application.
  • the forwarding device may first determine the candidate service identifier corresponding to the first transmission resource. Among them, the forwarding device can calculate the product of each service and 1 to obtain 4 products, which are 4, 3, 2, and 3 respectively. Determine the remainder of each product divided by 4, and get 4 remainders: 0, 3, 2, and 3. Among them, only the remainder corresponding to S1 is less than the number of transmission windows required by S1.
  • S1 can be used as the candidate service identifier corresponding to the first transmission resource.
  • the forwarding device can assign the first transmission window among the 12 transmission windows to S1.
  • the forwarding device can determine the candidate identifier corresponding to the second transmission resource.
  • the forwarding device can calculate the product of the number of transmission windows required for each service and 2 to obtain 4 products, which are 8, 6, 4, and 6, respectively. Determine the remainder of each product divided by 4, and get 4 remainders: 0, 2, 0, and 2.
  • the remainders corresponding to all services are less than the number of transmission windows required by the corresponding services. Therefore, it can be determined that the candidate service identifiers corresponding to the second transmission resource are S1, S2, S3, and S4.
  • the service identifier cache queues obtained according to the candidate service identifier corresponding to the second transmission resource are S1, S2, S3, and S4.
  • the forwarding device can start from the second transmission window and sequentially allocate the second transmission window to the fifth transmission window to the services identified by S1, S2, S3, and S4.
  • the forwarding device can next determine the candidate service identifier corresponding to the third transmission resource. At this time, the forwarding device calculates the product of the number of transmission windows required for each service and 3, and obtains 4 products, which are 12, 9, 6, and 9 respectively. Get the remainder of each product divided by 4, which are: 0, 1, 2, and 1. It can be seen that, except that the remainder corresponding to S3 is not less than the number of transmission windows required by S3, the remainder corresponding to the remaining services is less than the number of transmission windows required by the corresponding service.
  • the candidate service identifier corresponding to the third transmission resource can be determined S1, S2, S4, and the service identifier cache queues generated based on these candidate service identifiers are: S1, S2, S4. After that, the forwarding device sequentially allocates the sixth transmission window to the eighth transmission window to the services identified by S1, S2, and S4.
  • the forwarding device can refer to the foregoing implementation to determine the candidate service identifiers corresponding to the fourth transmission resource, which are S1 and S2 respectively. , S3, S4. After that, the forwarding device can refer to the aforementioned method to assign the last four transmission windows to the services identified by S1, S2, S3, and S4 in sequence.
  • the forwarding device determines the candidate service identifiers of C max transmission resources at most, that is, it performs evaluations at most C max times. Moreover, in this implementation manner, after each forwarding device generates a service identifier cache queue according to the candidate service identifier corresponding to a transmission resource, it will wait for the transmission window to be allocated for all services identified by the service identifier in the service identifier cache queue. After that, the next evaluation is performed, so that the length of the service identification cache queue is not too long, which reduces the implementation cost.
  • the forwarding device when determining the candidate service identifier corresponding to the jth transmission resource, may also treat the jth transmission resource as the j+k-1th transmission resource for processing. That is, for the j-th transmission resource, the forwarding device can calculate the product of the number of transmission windows required for each service and j+k-1.
  • all n services can be valid services.
  • the n services may include part of valid services and part of idle services, that is, in this embodiment of the present application, in order to ensure that the transmission windows carrying these valid services can be evenly distributed in Within a unit time period or unit data frame, the forwarding device can construct one or more idle services, and the number of transmission windows required by the one or more idle services is equal to the difference between m and the total number of transmission windows required by all valid services .
  • the forwarding device can mix the constructed idle services with the effective services to obtain n services, so as to allocate corresponding transmission windows for each service through the aforementioned method. Since these services are idle services, in step 303, filling bits can be sent on the transmission window corresponding to these idle services.
  • the above mainly introduces the process in which the forwarding device determines the candidate service identifier corresponding to each transmission resource in parallel, and generates the service identifier cache queue according to the candidate service identifier, and then allocates the transmission window accordingly.
  • the forwarding device determines the candidate service identifier corresponding to each transmission resource in parallel, and generates the service identifier cache queue according to the candidate service identifier, and then allocates the transmission window accordingly.
  • the n-th transmission window service required service number first C 1 and m, m from the first transmission window is assigned a traffic transmission window C 1; n of th
  • the business The number of transmission windows C i and m required for the i service, from the remaining transmission windows in the m transmission windows, the i-th service is allocated with C i transmission windows, and the remaining transmission window refers to the m transmission windows removed as the former i-1
  • the remaining transmission window outside the transmission window allocated by the service, i is an integer greater than 1.
  • the forwarding device can assign a corresponding transmission window to each business in turn according to the order of the business. In this way, for the first business, the forwarding device can select C 1 transmission windows from the m transmission windows. For other subsequent services, the forwarding device can only allocate the required number of transmission windows for the corresponding service from the remaining unallocated transmission windows.
  • the forwarding device can calculate the product between each numbering of the transmission window of a desired number of traffic transmission window C 1 and m in the transmission window, resulting in a product of m.
  • the sort number of each transmission window refers to the position of the corresponding transmission window among the m transmission windows. For example, for the first transmission window among m transmission windows, the sequence number of this transmission window is 1, and for the jth transmission window among m transmission windows, the sequence number of this transmission window is j.
  • the forwarding device can obtain the remainder obtained by dividing each product by m. After that, the forwarding device can select the corresponding transmission window with the remainder less than C 1 from the m transmission windows, and select these transmission windows Assigned to the first business.
  • the forwarding device can calculate the product of the number of transmission windows C 2 required by the second service and the order number of each transmission window in the m transmission windows, thereby obtaining m products. After obtaining m products, the forwarding device can obtain the remainder obtained by dividing each product by mC 1. After that, the forwarding device can select the corresponding transmission window with the remainder less than C 2 from the m transmission windows, and transfer the selected ones. The window is allocated to the second business.
  • the forwarding device can calculate the transmission required for the i-th service The product of the number of windows C i and the sequence number of each of the m transmission windows, thereby obtaining m products. After obtaining m products, the forwarding device can obtain the remainder obtained by dividing each product by m-(C 1 +...+C i-1 ). After that, the forwarding device can select the corresponding remainder from the m transmission windows to be less than The transmission windows of C i allocate these selected transmission windows to the i-th service. Among them, i is not greater than n.
  • the forwarding device can directly allocate the last remaining transmission window to the last service.
  • the forwarding device when h is equal to j, for the j-th transmission window, the forwarding device can first evaluate whether the first service expects to use the transmission window, and if the first service does not expect to use the transmission window, then forward The device can continue to evaluate whether the second service is expected to use the transmission window, and so on, if the transmission window is still not expected to be used by the n-1th service, the forwarding device can directly assign the transmission window to the last service . If it is determined that a certain service expects to use the transmission window, the forwarding device can allocate the transmission window to the service, and no further evaluation is performed for other services after the service. The forwarding device can directly start the evaluation of the next transmission window.
  • the forwarding device can then allocate the second transmission window.
  • the forwarding device still starts evaluation from the first service.
  • the forwarding device can determine the number of times the service is evaluated before that, and add 1 to the number of times to obtain Q i .
  • the forwarding device can calculate the i-th service office the product of the number of the transmission window of Q i and C i required, and acquires the resulting product is divided by the remainder of m- (C 1 + ... + C i -1) after.
  • the forwarding device may refer to the foregoing method to determine whether to allocate the current transmission window to the i-th service by comparing the size between the remainder and C i.
  • the difference from the foregoing implementation is that in this case, it is equivalent to starting the allocation from the last transmission window among the m transmission windows.
  • the above method can just be used to allocate all m transmission windows to n business. If the total number m of transmission windows is greater than the sum of the transmission windows required by the n services, after the transmission windows are allocated for the n services, there will still be a part of the remaining transmission windows.
  • the forwarding device may transmit service configuration parameters in the unit time period or unit data frame through these transmission windows, where the service configuration parameters may include the unit time period
  • the number of transmission windows required by each service in the internal or unit data frame may also include the total number m of transmission windows included in the time slot.
  • Step 303 According to the transmission window corresponding to each service, multiplex the service data of n services into one channel of data, and send the multiplexed data.
  • the forwarding device can multiplex the service data of n services into one data according to the transmission window corresponding to each service, so that the multiplexed service data can be in the designated time slot.
  • n services n services into one data according to the transmission window corresponding to each service, so that the multiplexed service data can be in the designated time slot.
  • m transmission windows Of m transmission windows.
  • a FlexE frame may include 8 rows, and the first 66-bit code block of each row is an overhead area, that is, an overhead area including 8 66-bit code blocks. Except for the overhead area, the rest is the payload area.
  • Each row in the payload area includes 1023*20 66-bit code blocks, so the payload area will include (1023*20)*8 66-bit code blocks.
  • the payload area can be divided into 20 time slots. As shown in Fig. 11, 66-bit code blocks with the same number belong to the same time slot. Thus, one time slot contains 1023*8 66-bit code blocks.
  • the forwarding device may also adopt the Ethernet frame format to carry the multiplexed data of n services.
  • the forwarding device can interleave n services according to the transmission windows corresponding to the n services to form a multiplexed data stream.
  • the forwarding device can generate an encapsulation header to carry parameters such as the number of transmission windows required for each service forming the multiplexed data stream and the total number m of transmission windows in the time slot, and use the multiplexed data stream as the encapsulation payload.
  • the package header the package data is obtained.
  • the forwarding device can use the encapsulated data as an Ethernet frame to generate an Ethernet data stream, and then send it out through one time slot or multiple time slots of the FlexE interface.
  • the forwarding device can use the same method as the upstream forwarding device to determine the corresponding service according to the service configuration parameters in the time slot.
  • the transmission window is to determine which transmission windows are carried by each service, so that the downstream forwarding device can demultiplex the received service according to the determined transmission window corresponding to each service, thereby restoring each service.
  • downstream forwarding device in order to ensure that the downstream forwarding device can correctly demultiplex, in the embodiment of the present application, when the upstream forwarding device sends each service according to the transmission window of each service, it also needs to configure the parameters of the service in the time slot. Transmit to downstream forwarding equipment.
  • each time slot may be fixed, and the services to be mapped contained in each time slot may also be fixed. That is, each time slot includes n services to be mapped, and the number of transmission windows required by each service is fixed.
  • the upstream forwarding device only needs to send the service configuration parameters to the downstream forwarding device once.
  • the services to be mapped contained in each time slot are not fixed. That is, the number of services to be mapped in each time slot is different. Or, the number of services to be mapped in each time slot is the same, but the number of transmission windows required by each service is different. Or, both of the above are different.
  • the upstream forwarding device can transmit the service configuration parameters in the time slot in real time before or at the same time as sending the multiplexed service data in each time slot, so that after the downstream forwarding device receives the service, The received service can be correctly demultiplexed according to the service configuration parameters.
  • the sending end can obtain the number of transmission windows required by each of the n services to be mapped in a unit time period or a unit data frame, where the unit time period or unit data frame contains There are m transmission windows. After that, according to the number of transmission windows required by each service, the sender can allocate a corresponding transmission window for each service from the m transmission windows, and multiplex the service data of n services according to the transmission window corresponding to each service. For one channel of data, the multiplexed data is sent.
  • the embodiment of the present application can divide the unit time period or unit data frame into m transmission windows, and then transmit the corresponding service by allocating the corresponding transmission window for each service, so that multiple services can be multiplexed
  • One time period or data frame is used for service transmission, which avoids the waste of bandwidth resources caused by only one type of service can be carried by one time period or one data frame in related technologies.
  • the upstream forwarding device as the sending end may also send the service configuration parameters in a unit time period or in a unit data frame to the downstream forwarding device as the receiving end.
  • the downstream forwarding device can use the same method as the upstream forwarding device to determine the transmission window corresponding to each service according to the service configuration parameters, that is, determine which transmission window each service is carried. In this way, the downstream forwarding device can determine according to The transmission window corresponding to each service demultiplexes the received service, thereby restoring each service.
  • the upstream forwarding device does not need to store the mapping relationship between the service and the transmission window, and the upstream and downstream forwarding devices do not need to transmit the mapping relationship between the service and the transmission window, and only a small amount of services need to be transmitted.
  • the correct demultiplexing of the service can be realized by configuring the parameters, and the storage and transmission efficiency is high.
  • an embodiment of the present invention provides a service processing apparatus 1400, and the apparatus 1400 includes:
  • the obtaining module 1401 is configured to execute step 301 in the foregoing embodiment
  • the allocation module 1402 is configured to execute step 302 in the foregoing embodiment
  • the sending module 1403 is configured to execute step 303 in the foregoing embodiment.
  • the allocation module 1402 includes:
  • the determining sub-module is used to determine the candidate service identifier corresponding to each of the k transmission resources according to the number of transmission windows required by each of the n services.
  • the k transmission resources refer to the unit time period or unit The total transmission resources in the data frame are divided, and the candidate service identifier refers to the service identifier of the service that expects to use the corresponding transmission resource, and k is not less than the maximum number of transmission windows among the number of transmission windows required by the n services;
  • the allocation sub-module is used to allocate a corresponding transmission window for each service according to the candidate service identifier corresponding to each transmission resource.
  • k is any value of the maximum number of transmission windows, m and 2p.
  • the determining sub-module is specifically used for:
  • each of the n services sequentially detect whether each of the n services expects to use the first transmission resource, where the first transmission resource is any transmission resource among the k transmission resources;
  • the service identifiers of one or more services that expect to use the first transmission resource are used as the candidate service identifiers of the first transmission resource.
  • the allocation sub-module is specifically used for:
  • a service identifier cache queue is generated
  • the m transmission windows are sequentially allocated to the services identified by each service identifier in the service identifier cache queue according to the order of the m transmission windows;
  • the number of transmission windows equal to the total number of transmission windows required by the n services among the m transmission windows are sequentially allocated to the service identification buffer The business identified by each business identifier in the queue.
  • the n services include one or more idle services.
  • the order of the services identified by the candidate service identifiers corresponding to each transmission resource refers to the order in which the service numbers of the respective services are arranged in ascending order, or the candidate service identifiers corresponding to each transmission resource are identified
  • the order of the business refers to the order in which the remainder corresponding to each business is arranged from largest to smallest.
  • the remainder corresponding to each business refers to the number of transmission windows required by the corresponding business and the order of the corresponding transmission resources among the k transmission resources The remainder of the product of the numbers divided by k.
  • the allocation sub-module is specifically used for:
  • the corresponding transmission windows are assigned to the services identified by each service identifier in the service identifier cache queue in turn, and the assigned service identifiers are cached Delete from the queue;
  • the device is also used for:
  • the second transmission resource is used as the first transmission resource, and the re-execution is performed according to the number of transmission windows required by each of the n services, and whether each of the n services is expected to be detected in turn
  • the second transmission resource is located after and adjacent to the first transmission resource.
  • the determining sub-module is specifically used for:
  • the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the first transmission resource.
  • the determining sub-module is specifically used for:
  • the remainder is less than the number of transmission windows required by the i-th service, it is determined that the i-th service expects to use the first transmission resource.
  • the allocation module 1402 is specifically configured to:
  • the i-th service is allocated C i transmission windows, and the remaining transmission windows refer to m In the transmission window, except for the transmission window allocated for the first i-1 services, the remaining transmission window, i is an integer greater than 1.
  • the allocation module 1402 is specifically configured to:
  • the device 1400 is also used for:
  • the service configuration parameters include each of the n services.
  • the sending end can obtain the number of transmission windows required by each of the n services to be mapped in a unit time period or in a unit data frame, wherein, in the unit time period or There are m transmission windows in a unit data frame.
  • the sender can allocate a corresponding transmission window for each service from the m transmission windows, and multiplex the service data of n services according to the transmission window corresponding to each service. For one channel of data, the multiplexed data is sent.
  • the embodiment of the present application can divide the unit time period or unit data frame into m transmission windows, and then transmit the corresponding service by allocating the corresponding transmission window for each service, so that multiple services can be multiplexed
  • One time period or data frame is used for service transmission, which avoids the waste of bandwidth resources caused by only one type of service can be carried by one time period or one data frame in related technologies.
  • the computer may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • 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.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions may be transmitted from a website, computer, server, or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example: floppy disk, hard disk, tape), optical medium (for example: Digital Versatile Disc (DVD)), or semiconductor medium (for example: Solid State Disk (SSD) )Wait.
  • the program can be stored in a computer-readable storage medium.
  • the storage medium mentioned can be a read-only memory, a magnetic disk or an optical disk, etc.

Landscapes

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

Abstract

本申请公开了一种业务处理方法及装置,属于通信技术领域。在本申请中,可以将单位时间周期或单位数据帧划分为m个传输窗口,之后,根据待映射的n个业务所需的传输窗口数,来为每个业务分配对应的传输窗口来传输相应业务,进而根据每个业务对应的传输窗口,将n个业务的业务数据复用为一路数据进行发送。这样,多个业务就可以复用一个时间周期或数据帧来进行业务的传输,避免了一个时间周期或一个数据帧仅能承载一种业务所造成的带宽资源浪费。

Description

业务处理方法、装置及存储介质
本申请要求于2019年9月24日提交的申请号为201910906148.4、申请名称为“业务处理方法、装置及存储介质”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域,特别涉及一种业务处理方法、装置及存储介质。
背景技术
当前,在灵活以太网(flex ethernet,FlexE)和光传送网(optical transport network,OTN)中,均采用划分时隙的方式来管理带宽资源,进而基于划分的时隙来发送业务数据。例如,在FlexE中,可以将100G的接口划分为20个时隙,每个时隙的带宽为5G。在这种情况下,可以根据每个待传输的业务数据所需的带宽,为每个待传输的业务数据分配对应的时隙,进而通过分配的时隙传输对应的业务数据。其中,一个业务的业务数据可以对应多个时隙,而一个时隙只能用于承载一种业务的业务数据。
然而,由于FlexE和OTN中划分的时隙的带宽较大,因此,对于所需带宽为10M或100M等级别的小颗粒业务来说,通过上述划分的时隙来承载该小颗粒业务时,将会造成较大的带宽资源浪费。
发明内容
本申请提供了一种业务处理方法、装置及存储介质,可以用于解决相关技术中通过划分的时隙来承载小颗粒业务时存在的带宽资源浪费的问题。所述技术方案如下:
第一方面,提供了一种业务处理方法,所述方法包括:获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,所述单位时间周期内或单位数据帧包含有m个传输窗口,所述n个业务所需的传输窗口总数不大于所述m,所述m和所述n均为大于1的整数;根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口;根据每个业务对应的传输窗口,将所述n个业务的业务数据复用为一路数据,发送复用后的数据。
在本申请实施例中,可以将单位时间周期或单位数据帧划分为m个传输窗口,之后,通过为每个业务分配对应的传输窗口来传输相应业务,这样,多个业务就可以复用一个时间周期或数据帧来进行业务的传输,避免了相关技术中一个时间周期或一个数据帧仅能承载一种业务所造成的带宽资源浪费。
可选地,根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口的实现过程可以为:根据所述n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,所述k个传输资源是指将所述单位时间周期内或单位数据帧内的总传输资源进行划分得到,所述候选业务标识是指期望使用相应传输资源的业务的业务标识,所述k不小于所述n个业务所需的传输窗口数中的最 大传输窗口数;根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口。
在本申请中,可以确定每个传输资源对应的候选业务标识,进而根据每个传输资源对应的候选业务标识,并行的为每个业务分配对应的传输窗口。
可选地,所述k为所述最大传输窗口数、所述m和2 p中的任一数值。
可选地,根据所述n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识的实现过程可以为:根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源,所述第一传输资源为所述k个传输资源中的任一传输资源;如果所述n个业务中不存在期望使用所述第一传输资源的业务,则确定所述第一传输资源对应的候选业务标识为空;如果所述n个业务中存在期望使用所述第一传输资源的业务,则将期望使用所述第一传输资源的一个或多个业务的业务标识作为所述第一传输资源的候选业务标识。
可选地,根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口的实现过程可以为:根据所述k个传输资源的先后顺序和每个传输资源对应的候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列;当所述n个业务所需的传输窗口总数等于所述m时,按照所述m个传输窗口的先后顺序,将所述m个传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务;当所述n个业务所需的传输窗口总数小于所述m时,按照所述m个传输窗口的先后顺序,将所述m个传输窗口中与所述n个业务所需的传输窗口总数相等数量的传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务。
可选地,当所述n个业务所需的传输窗口总数等于所述m时,所述n个业务中包括一个或多个空闲业务。
也即,在本申请中,如果有效业务所需的传输窗口总数小于m,则可以构造一个或多个空闲业务,构造的空闲业务和有效业务的总数量为n,这n个业务所需的传输窗口总数等于m。这样,在将n个业务映射到m个传输窗口中时,可以保证n个业务中的有效业务可以平均的分配到各个传输窗口。
可选地,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务的业务编号从小到大进行排列后的顺序,或者,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务对应的余数从大到小进行排列后的顺序,所述各个业务对应的余数是指相应业务所需的传输窗口数与相应传输资源在所述k个传输资源中的排序编号的乘积除以所述k所得到的余数。
可选地,根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口的实现过程可以为:当确定出所述第一传输资源对应的候选业务标识时,根据所述第一传输资源对应的候选业务标识,生成业务标识缓存队列;从所述m个传输窗口中当前剩余的传输窗口中的第一个传输窗口开始,依次为所述业务标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口,并将已分配的业务标识从缓存队列中删除;相应地,当检测到所述业务标识缓存队列为空时,将第二传输资源作为所述第一传输资源,重新执行所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源的步骤,所述第二传输资源位于所述第一传输资源之后且与所述第一传输资源相邻。
在本申请中,可以根据每个传输资源对应的候选业务标识生成业务标识缓存队列,之后,逐一为业务标识缓存队列中的各个候选业务标识分配对应的传输窗口。其中,为了缩短业务标识缓存队列的长度,可以在每确定出一个传输资源对应的候选业务标识之后,即生成一个对应的队列,之后,为这个队列中的业务标识分配传输窗口,待分配完之后,再确定下一个传输资源对应的候选业务标识。
可选地,所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源的实现过程可以为:对于所述n个业务中的第i个业务,确定第i个业务所需的传输窗口数与j的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;确定所述乘积除以所述k所得到的余数;如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
可选地,所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源的实现过程可以为:对于所述n个业务中的第i个业务,确定所述第i个业务所需的传输窗口数与k-j+1的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;确定所述乘积除以所述k所得到的余数;如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
可选地,所述根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口的实现过程可以为:根据所述n个业务中第一个业务所需的传输窗口数C 1和所述m,从所述m个传输窗口中为所述第一个业务分配C 1个传输窗口;根据所述n个业务中第i个业务所需的传输窗口数C i和所述m,从所述m个传输窗口中的剩余传输窗口中为所述第i个业务分配C i个传输窗口,所述剩余传输窗口是指所述m个传输窗口中除去为前i-1个业务分配的传输窗口之外剩余的传输窗口,所述i为大于1的整数。
可选地,所述根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口的实现过程可以为:令i=1,j=1,根据第i个业务所需的传输窗口数和所述m,判断第i个业务是否期望使用第h个传输窗口,所述h等于j或所述h等于m-j+1;如果所述第i个业务期望使用所述第h个传输窗口,则将所述第h个传输窗口分配给所述第i个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述j=m为止;如果所述第i个业务不期望使用所述第h个传输窗口,则令所述i=i+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述i=n时,将所述第h个传输窗口分配给所述第n个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤。
在本申请中,除了可以采用前述方法并行的为各个业务分配传输窗口,还可以采用上述方法来串行的依次为每个业务分配传输窗口。
可选地,所述方法还包括:向接收设备发送业务配置参数,以使所述接收设备根据所述业务配置参数对接收到的复用后的数据进行解复用,得到所述n个业务的业务数据,所述业务配置参数包括所述n个业务中每个业务所需的传输窗口数。
在本申请中,发送设备在向接收设备发送复用后的数据之前或同时,还可以向接收设备发送业务配置参数,这样,接收设备就可以根据该业务配置参数,采用与发送设备相同的方法来确定各个业务对应的传输窗口,也即,确定各个业务由哪些传输窗口来承载,这样,该接收设备即可以根据确定的各个业务对应的传输窗口对接收到的业务进行解复用,从而还原 得到各个业务。如此,发送设备中不必存储业务与传输窗口之间的映射关系,发送设备和接收设备之间也不必传输业务与传输窗口之间的映射关系,只需传输少量业务配置参数即可实现业务的正确解复用,存储和传输效率较高。
第二方面,提供了一种业务处理装置,所述业务处理装置具有实现上述第一方面中业务处理方法行为的功能。所述业务处理装置包括至少一个模块,该至少一个模块用于实现上述第一方面所提供的业务处理方法。
第三方面,提供了一种业务处理装置,所述业务处理装置的结构中包括处理器和存储器,所述存储器用于存储支持业务处理装置执行上述第一方面所提供的业务处理方法的程序,以及存储用于实现上述第一方面所提供的业务处理方法所涉及的数据。所述处理器被配置为用于执行所述存储器中存储的程序。所述存储设备的操作装置还可以包括通信总线,该通信总线用于该处理器与存储器之间建立连接。
第四方面,提供了一种计算机可读存储介质,所述计算机可读存储介质中存储有指令,当其在计算机上运行时,使得计算机执行上述第一方面所述的业务处理方法。
第五方面,提供了一种包含指令的计算机程序产品,当其在计算机上运行时,使得计算机执行上述第一方面所述的业务处理方法。
上述第二方面、第三方面、第四方面和第五方面所获得的技术效果与第一方面中对应的技术手段获得的技术效果近似,在这里不再赘述。
本申请提供的技术方案带来的有益效果至少包括:
在本申请实施例中,发送端可以获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,其中,该单位时间周期内或单位数据帧内包含有m个传输窗口。之后,根据每个业务所需的传输窗口数,发送端可以从m个传输窗口中为每个业务分配对应的传输窗口,根据每个业务对应的传输窗口,将n个业务的业务数据复用为一路数据,发送复用后的数据。由此可见,本申请实施例可以将单位时间周期或单位数据帧划分为m个传输窗口,之后,通过为每个业务分配对应的传输窗口来传输相应业务,这样,多个业务就可以复用一个时间周期或数据帧来进行业务的传输,避免了相关技术中一个时间周期或一个数据帧仅能承载一种业务所造成的带宽资源浪费。
附图说明
图1是本申请实施例提供的业务处理方法所涉及的系统架构图;
图2是本申请实施例提供的一种网络设备的结构示意图;
图3是本申请实施例提供的一种业务处理方法的流程图;
图4是本申请实施例提供的一种为每个业务分配传输窗口的示意图;
图5是本申请实施例给出的一种触发确定第j个传输资源对应的候选业务标识的触发信号示意图;
图6是本申请实施例给出的另一种触发确定第j个传输资源对应的候选业务标识的触发 信号示意图;
图7是本申请实施例提供的另一种为每个业务分配传输窗口的示意图;
图8是本申请实施例提供的又一种触发确定第j个传输资源对应的候选业务标识的触发信号示意图;
图9是本申请实施例提供的又一种为每个业务分配传输窗口的示意图;
图10是本申请实施例提供的又一种为每个业务分配传输窗口的示意图;
图11是本申请实施例提供的一种FlexE帧的数据结构示意图;
图12是本申请实施例提供的一种n个业务复用FlexE帧的一个时隙的示意图;
图13是本申请实施例提供的一种采用以太网帧发送n个业务的示意图;
图14是本申请实施例提供的一种业务处理装置的结构示意图。
具体实施方式
为使本申请的目的、技术方案和优点更加清楚,下面将结合附图对本申请实施方式作进一步地详细描述。
在对本申请实施例进行详细的解释说明之前,先对本申请实施例涉及的系统架构进行介绍。
图1是本申请实施例提供的业务处理方法所涉及的系统架构图。如图1中所示,该系统中包括用户设备101-103、转发设备104、转发设备105以及用户设备106。
其中,用户设备101-103可以向转发设备104发送业务数据。转发设备104在接收到用户设备101-103发送的业务数据之后,可以通过本申请实施例提供的业务处理方法将某个指定时隙内的多个传输窗口分配给多个不同业务,之后,在分配的传输窗口将接收到的业务数据发送至转发设备105。也即,多个业务可以复用一个时隙来进行业务数据的传输。需要说明的是,在本申请实施例中,转发设备104还可以将指定时隙内包含的传输窗口的数量和在该指定时隙内传输的多个业务中每个业务所需的传输窗口的数量发送至转发设备105。
转发设备105可以根据转发设备104发送的指定时隙内的传输窗口的数量和在该指定时隙内传输的多个业务中每个业务所需的传输窗口的数量,采用本申请实施例提供的业务处理方法来确定各个业务对应的传输窗口,也即确定各个传输窗口所承载的业务数据属于哪个业务,进而对接收到的业务数据进行解复用。之后,转发设备105可以将解复用的业务数据转发至用户设备106。
其中,用户设备101-103以及用户设备106可以为个人电脑、桌面机、服务器等。转发设备104和105可以为具有以太网接口、FlexE接口或OTN接口的网络设备,例如核心路由器、边沿路由器、OTN传输设备、无线接入网互联网协议(internet protocol radio access network,IPRAN)盒式或框式传输设备、分组传送网(packet transport network,PTN)盒式或框式传输设备等。
可理解的是,图1仅为示例性架构图,在实际应用中,除图1所示的用户设备101-103以及用户设备106之外,该系统中可以包括其他的多个用户设备。当然,该系统中还可以包括除转发设备104和105之外的多个转发设备,本申请实施例不对设备的数量进行限定。
图2是本申请实施例提供的一种网络设备的结构示意图。图1中的转发设备可以通过图 2所示的网络设备来实现。参见图2,该网络设备包括至少一个处理器201,通信总线202,存储器203以及至少一个通信接口204。
处理器201可以是一个通用中央处理器(Central Processing Unit,CPU),微处理器,特定应用集成电路(application-specific integrated circuit,ASIC),或一个或多个用于控制本申请方案程序执行的集成电路。
通信总线202可包括一通路,在上述组件之间传送信息。
存储器203可以是只读存储器(read-only memory,ROM)或可存储静态信息和指令的其它类型的静态存储设备,随机存取存储器(random access memory,RAM))或者可存储信息和指令的其它类型的动态存储设备,也可以是电可擦可编程只读存储器(Electrically Erasable Programmable Read-Only Memory,EEPROM)、只读光盘(Compact Disc Read-Only Memory,CD-ROM)或其它光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其它磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其它介质,但不限于此。存储器203可以是独立存在,通过通信总线202与处理器201相连接。存储器203也可以和处理器201集成在一起。
通信接口204,使用任何收发器一类的装置,用于与其它设备或通信网络通信,如以太网,无线接入网(RAN),无线局域网(Wireless Local Area Networks,WLAN)等。
在具体实现中,作为一种实施例,处理器201可以包括一个或多个CPU,例如图2中所示的CPU0和CPU1。
在具体实现中,作为一种实施例,计算机设备可以包括多个处理器,例如图2中所示的处理器201和处理器205。这些处理器中的每一个可以是一个单核(single-CPU)处理器,也可以是一个多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
其中,存储器203用于存储执行本申请方案的程序代码,并由处理器201来控制执行。处理器201用于执行存储器203中存储的程序代码206。程序代码206中可以包括一个或多个软件模块。图1中所示的转发设备可以通过处理器201以及存储器203中的程序代码206中的一个或多个软件模块,来对待传输的业务或者是接收到的业务进行处理。
接下来对本申请实施例提供的业务处理方法进行详细的解释说明。
图3是本申请实施例提供的一种业务处理方法的流程图。该业务处理方法可以应用于图1所示的转发设备104,以进行业务数据的发送,参见图3,该方法包括:
步骤301:获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,该单位时间周期内或单位数据帧内包含有m个传输窗口,n个业务所需的传输窗口总数不大于m,m和n均为大于1的整数。
当前,FlexE中包括50G、100G、200G、400G等多种带宽的FlexE接口。其中,FlexE接口可以被划分为多个时隙。例如,50G的FlexE接口可以包括10个时隙,每个时隙的带宽为5G。再例如,100G的FlexE接口可以包括20个时隙,每个时隙的带宽为5G。同理,OTN中也包括多种带宽的OTN接口,OTN接口也可以被划分为多个时隙。例如,100G的OTN接口可以被划分为40个时隙,每个时隙的带宽为2.5G,或者,100G的OTN接口可以被划 分为80个时隙,每个时隙的带宽为1.25G。
在本申请实施例中,可以将上述接口的一个时隙作为一个单位时间周期,对该时隙进行划分,得到m个传输窗口。其中,可以按照指定比特长度来对时隙进行划分,从而得到m个传输窗口。例如,在FlexE中,一个FlexE接口可以支持一个或多个FlexE实例,每个FlexE实例引入固定的周期帧结构。对于100G的FlexE接口,当其支持一个FlexE实例时,一个固定的周期帧结构可以被划分为20个时隙,每个时隙内包括1023*8个66比特码块,基于此,可以将一个66比特码块作为一个传输窗口,这样,一个时隙即可以被划分为1023*8个传输窗口。再例如,在OTN中,同样引入了周期性帧结构,按照周期性帧结构来进行时隙划分,基于此,可以按照指定字节长度来对时隙进行划分,得到m个传输窗口。例如,以一个字节作为一个传输窗口,或者以4个字节作为一个传输窗口。
由上述描述可知,一个时隙内包括的m个传输窗口中的每个传输窗口的带宽是一定的。基于此,转发设备可以根据待传输的n个业务中每个业务所需的带宽以及每个传输窗口的带宽,确定每个业务所需的传输窗口数。其中,n个业务所需的总带宽小于一个时隙的带宽。相应地,n个业务所需的传输窗口的数量将小于或等于该时隙内包括的传输窗口的数量m。
例如,假设一个传输窗口的带宽为x,某个待传输业务所需的带宽为y,则转发设备可以计算y与x的比值,并将计算得到的比值向上取整,从而得到该业务所需的传输窗口的数量。
可选地,在一种可能的情况下,转发设备也可以对单位数据帧进行划分,从而得到多个传输窗口。示例性地,对于一个以太网帧,转发设备可以将该以太网帧作为一个单位数据帧,将该以太网帧按照指定长度进行划分,从而得到m个传输窗口。
步骤302:根据n个业务中每个业务所需的传输窗口数,从m个传输窗口中为每个业务分配对应的传输窗口。
第一种实现方式:转发设备可以根据每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,该k个传输资源是指将单位时间周期内或单位数据帧内的总传输资源进行划分得到,候选业务标识是指期望使用相应传输资源的业务的业务标识,k不小于n个业务所需的传输窗口数中的最大传输窗口数。根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口。
其中,可以按照传输窗口的大小对单位时间周期内或者是单位数据帧内的总传输资源进行划分,这样,划分得到的传输资源的总数将等于m,也即,k等于m。当然,也可以按照大于传输窗口的粒度来对单位时间周期内或者是单位数据帧内的总传输资源进行划分,这样,k将小于m。其中,当按照n个业务中所需传输窗口数中最大传输窗口数对应的业务的带宽来进行划分时,k将等于最大传输窗口数。再或者,还可以按照小于传输窗口的粒度来对单位时间周期内或者单位数据帧内的总传输资源进行划分,这种情况下,k将大于m。也即,在本申请实施例中,k不小于最大传输窗口数。其中,k可以等于为最大传输窗口数、m和2 p中的任一数值。
需要说明的是,在该种实现方式中,转发设备可以通过以下几种不同的方法来为每个业务分配对应的传输窗口。
(1)转发设备可以根据每个业务所需的传输窗口数,依次检测n个业务中每个业务中每个业务是否期望使用第一传输资源,第一传输资源为k个传输资源中的任一传输资源;如果n个业务中不存在期望使用第一传输资源的业务,则确定第一传输资源对应的候选业务标识 为空;如果n个业务中存在期望使用第一传输资源的业务,则将期望使用第一传输资源的一个或多个业务的业务标识作为第一传输资源的候选业务标识。之后,转发设备可以根据k个传输资源的先后顺序和每个传输资源对应的候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列;当n个业务所需的传输窗口总数等于m时,按照m个传输窗口的先后顺序,将m个传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务;当n个业务所需的传输窗口总数小于m时,按照m个传输窗口的先后顺序,将m个传输窗口中与n个业务所需的传输窗口总数相等数量的传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务。
其中,各个业务可以按照每个业务所需的传输窗口数从大到小的顺序进行排列,也可以按照各个业务的紧急程度来进行排列,本申请实施例对此不做限定。同时,转发设备可以按照k个传输资源的先后顺序,对k个传输资源进行排序,并依次编号。对于排在第一个的传输资源,该传输资源的排序编号即为1,排在第二个的传输资源,排序编号即为2,以此类推。
在此基础上,转发设备可以从k个传输资源中的第一个传输资源开始,依次检测第1个业务、第2个业务……第n个业务是否期望使用第一个传输资源,将期望使用第一个传输资源的业务标识作为第一个传输资源的候选业务标识。接下来,转发设备可以依次检测第1个业务、第2个业务……第n个业务是否期望使用k个传输资源中的第二个传输资源,以此类推。
示例性地,在检测某个业务是否期望使用某个传输资源时,以k个传输资源中的第j个传输资源也即,第一传输资源为例,以n个业务中的第i个业务为例,转发设备可以通过以下两种方式来检测第i个业务是否期望使用第一传输资源。
在第一种方式中,转发设备可以确定第i个业务所需的传输窗口数与j的乘积,j为第一传输资源在k个传输资源中的排序编号;确定该乘积除以k所得到的余数;如果该余数小于第i个业务所需的传输窗口数,则确定第i个业务期望使用该第一传输资源。如果该余数大于第一个业务所需的传输窗口数,则确定第i个业务不期望使用第一传输资源。
例如,参见图4,假设当前有4个业务,这4个业务对应的业务标识分别为S1、S2、S3和S4,其中,S1所需的传输窗口数为4,S2所需的传输窗口数为3,S3所需的传输窗口数为2,S4所需的传输窗口数为3。上述4个业务的排列顺序为S1、S2、S3和S4。假设k等于12,也即,存在12个传输资源。在这种情况下,转发设备首先可以计算S1所需的传输窗口数与1的乘积,得到的乘积为4,将该乘积除以k所得到的余数为4,由于该余数不小于不小于S1所需的传输窗口数,因此可知,S1不期望使用第一个传输资源。接下来,转发设备采用同样的方法检测第2个业务是否期望使用第一个传输资源,以此类推。通过上述方法可以确定得到所有的业务均不期望使用第一个传输资源,此时,转发设备可以确定第一个传输资源对应的候选业务标识为空。在确定第一个传输资源对应的候选业务标识之后,转发设备接下来可以参考上述方法依次检测每个业务是否期望使用第2个传输资源。其中,通过上述方法可以得到每个业务对应的余数均不小于自身所需的传输窗口数,因此,可以确定第2个传输资源对应的候选业务标识也为空。而对于第3个传输资源,通过上述方法确定得到业务S1对应的余数为0,小于S1所需的传输窗口数,而其他业务对应的余数均大于相应业务所需的传输窗口数,因此可见,S1期望使用第3个传输资源,其他业务数据不期望使用第3个传输资源。此时,即可以确定第3个传输资源对应的候选业务标识为S1。同理,通过上述方法, 可以确定第4、8个传输资源对应的候选业务标识为S2和S4,第5、7、10和11个传输资源对应的候选业务标识为空,第6个传输资源对应的候选业务标识为S1和S3,第9个传输资源对应的候选业务标识S1,第12个传输资源对应的候选业务标识为S1、S2、S3和S4。
在确定每个传输资源对应的候选业务标识之后,转发设备可以按照k个传输资源的先后顺序和各个候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列。
其中,转发设备可以在确定得到每个传输资源对应的候选业务标识之后,再按照传输资源的先后顺序,将各个传输资源对应的候选业务标识进行排列,从而得到业务标识缓存队列。
需要说明的是,对于同一传输资源对应的候选业务标识,转发设备可以将各个业务标识按照各自所标识的业务的业务编号从小到大进行排列。或者,各个业务标识可以按照其所标识的业务对应的余数从大到小的顺序进行排列,其中,各个业务标识所标识的业务对应的余数是指相应业务所需的传输窗口数与该传输资源的排序编号的乘积除以k得到的余数。
可选地,在本申请实施例中,转发设备也可以在每确定得到一个传输资源对应的候选业务标识后,将对应的候选业务标识按照对应的业务的先后顺序添加至业务标识缓存队列中。也即,转发设备可以在确定出第1个传输资源对应的候选业务标识之后,按照各个候选业务标识对应的业务的先后顺序,形成一个初始业务标识缓存队列,之后,在确定出第2个传输资源对应的候选业务标识之后,按照各个候选业务标识对应的业务的先后顺序,从初始业务标识缓存队列的队尾开始,依次将第2个传输资源对应的候选业务标识添加至该业务标识缓存队列中,以此类推,直到将第k个传输资源对应的候选业务标识添加至业务标识缓存队列为止。
值得注意的是,当采用上述方法来确定每个传输资源对应的候选业务标识时,会出现前几个传输资源均无对应的候选业务标识的情况,也即,没有业务期待使用这几个传输资源。在这种情况下,为了减小时延,转发设备可能需要提前一个时隙或者是更早将全部传输资源对应的候选业务标识确定出来,从而保证在本时隙内从第一个传输窗口开始,即可以将各个传输窗口分配出去。
另外,需要说明的是,当采用第一种方式来依次检测每个业务是否期望使用各个传输资源时,对于k个传输资源中的第j个传输资源,参见图5,转发设备可以通过一个编号为j的时钟脉冲信号来触发确定第j个传输资源对应的候选业务标识的操作。可选地,参见图6,转发设备也可以通过数值j个相应的时钟脉冲信号来触发,本申请实施例对此不做限定。
在第二种方式中,转发设备可以确定第i个业务数据所需的传输窗口数与k-j+1乘积,j为第一传输资源在k个传输资源中的排序编号;确定该乘积除以k所得到的余数;如果该余数小于第i个业务所需的传输窗口数,则确定第i个业务期望使用第一传输资源。如果该余数不小于第i个业务所需的传输窗口数,则确定第i个业务不期望使用第一传输资源。
例如,参见图7,仍以前述图4所举示例中的4个业务和12个传输资源为例。首先,对于第1个传输资源,转发设备可以计算S1所需的传输窗口数与12的乘积,得到的乘积为48,该乘积分别除以12后所得到的余数为0,小于S1所需的传输窗口数,因此可知S1期望使用第1个传输资源。对于剩余的S2-S4,由于这三个业务对应的余数均小于相应业务所需的传输窗口数,因此可知,这3个业务均期望使用第1个传输资源,此时,可以确定第1个传输资源对应的候选业务标识包括所有业务的业务标识。对于第2个传输资源,转发设备可以参考前述方法依次确定4个业务对应的余数,分别为8、9、10和9。4个余数中的每个余数均 不小于对应的业务所需的传输窗口数,因此,可以确定没有业务期望使用第2个传输资源,也即,第2个传输资源对应的候选业务标识为空。以此类推,对于第3-12个传输资源,转发设备均可以参照上述方法来确定对应的候选业务标识,最终确定出第3、6、8、11和12个传输资源对应的候选业务标识也为空,第4、10个传输资源对应的候选业务标识为S1,第5个和第9个传输资源对应的候选业务标识为S2和S4,第7个传输资源对应的候选业务标识为S1和S3。
由上述介绍可见,在该种实现方式中,对于k个传输资源中的第j个传输资源,在确定第j个传输资源对应的候选业务标识时,实际上相当于是将第j个传输资源看做第j+k-1个传输资源进行的评估。在这种情况下,对于第1个传输资源,相当于是将第1个传输资源看做第k个传输资源来进行评估,这样,第1个传输资源将是所有业务均期待使用的传输资源。也即,第1个传输资源对应的候选业务标识将包括所有业务数据的业务标识,不可能为空。在这种情况下,转发设备无需提前将全部传输资源对应的候选业务标识确定出来,就可以保证在本时隙内从第一个传输窗口开始,即时将各个传输窗口分配出去。
需要说明的是,当采用第二种方式来依次检测每个业务是否期望使用各个传输资源时,对于k个传输资源中的第j个传输资源,转发设备可以通过图4中所示的编号为j的时钟脉冲信号来触发确定第j个传输资源对应的候选业务标识的操作。可选地,参见图8,转发设备也可以通过数值m-j+1和相应的时钟脉冲信号来触发,本申请实施例对此不做限定。
上述是本申请实施例中介绍的两种确定传输资源对应的候选业务标识的实现方式。在一些可能的情况下,转发设备也可以采用其他方式来检测某个业务是否期望使用某个传输资源。
示例性地,当k等于最大传输窗口数时,转发设备可以计算每个业务所需的传输窗口数与k的商,得到每个业务的业务步长。之后,对于第一个传输资源,转发设备可以计算每个业务的业务步长与该初始累积值的和,得到每个业务的累计步长。将累计步长不小于1的业务的业务标识作为第一个传输资源的候选业务标识。之后,对于第二个传输资源,转发设备可以将第一个传输资源的候选业务标识所标识的各个业务的累计步长减一,得到相应业务当前的累计步长,对于剩余的业务,则仍采用前述的方法,计算相应业务的业务步长与当前时刻最近一次确定的该业务的累计步长之间的和,得到相应业务当前的累计步长。之后,转发设备可以比较每个业务当前的累计步长与1之间的大小,进而确定第二个传输资源对应的候选业务标识,以此类推,直至确定出所有传输资源对应的候选业务标识为止。
基于前述介绍可知,n个业务所需的传输窗口总数可能小于m,也可能等于m。基于此,在生成业务标识缓存队列之后,如果n个业务所需的传输窗口总数小于m,则转发设备可以按照m个传输窗口的先后顺序,将m个传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务。如果n个业务所需的传输窗口总数小于m,则转发设备可以按照m个传输窗口的先后顺序,将m个传输窗口中与n个业务所需的传输窗口总数相等数量的传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务。
示例性地,转发设备可以从业务标识缓存队列中的第一个业务标识开始,将m个传输窗口中的第1个传输窗口分配给业务标识缓存队列中的第1个业务标识所标识的业务,将第2个传输窗口分配给业务标识缓存队列中第2个业务标识所标识的业务,以此类推,将第j个传输窗口分配给业务标识缓存队列中的第j个业务标识所标识的业务。这样,对于分配出去的每个传输窗口,该传输窗口将对应一个业务,且该传输窗口在m个传输窗口中的排序编号 与对应的业务在业务标识缓存队列中的排序编号相同。需要说明的是,业务标识缓存队列中的第一个业务标识是指位于队首的业务标识,第二个业务标识位于第一个业务标识之后,以此类推,最后一个业务标识即为位于该业务标识缓存队列中的队尾的业务标识。
例如,参见图4,第1和2个传输资源对应的候选业务标识为空,第3个传输资源对应的候选业务标识为S1,则业务标识缓存队列中的第1个业务标识即为S1。第4个传输资源对应的候选业务标识为S2和S4,则业务标识缓存队列中的第2个业务标识为S2,第3个业务标识为S4。第5个传输资源对应的候选业务标识为空,第6个传输资源对应的候选业务标识为S1和S3,所以,业务标识缓存队列中的第4个业务标识为S1,第5个业务标识为S3。以此类推,最终得到的业务标识缓存队列为:S1、S2、S4、S1、S3、S2、S4、S1、S1、S2、S3、S4。在确定业务标识缓存队列之后,假设m=12,也即,有12个传输窗口,则转发设备可以按照12个传输窗口的先后顺序和业务标识的先后顺序,将第1个传输窗口分配给S1,将第2个传输窗口分配给S2,第3个传输窗口分配给S4,第4个传输窗口分配给S1,以此类推,直到为业务标识缓存队列中的12个业务标识均对应的分配了传输窗口为止。同理,参见图7,根据各个传输资源对应的候选业务标识得到的业务标识缓存队列为:S1、S2、S3、S4、S1、S2、S4、S1、S3、S2、S4、S1,则转发设备可以按照上述缓存队列,如图中所示,将12个传输窗口依次分配给业务标识缓存队列中各个业务标识所标识的业务。
需要说明的是,上述图4和图7示出了当k等于m,且n个业务所需的传输窗口总数也等于m时,根据每个传输资源对应的候选业务标识生成业务标识缓存队列,进而根据业务标识缓存队列为每个业务分配传输窗口的示意图。当然,如果n个业务所需的传输窗口总数小于m,则相应地业务标识缓存队列中包括的候选业务标识的数量也将小于m,这种情况下,同样可以参照上述方法来为业务标识缓存队列中的各个候选业务标识分配对应的传输窗口。
可选地,图9示出了当k小于m且k等于n个业务所需传输窗口数中的最大传输窗口数Cmax时,根据每个传输资源对应的候选业务标识生成业务标识缓存队列,进而根据业务标识缓存队列为每个业务分配传输窗口的示意图。
如图9所示,仍以前述的4个业务和12个传输窗口为例。4个业务所需的传输窗口数中的最大传输窗口数为4。因此,k=4,也即,存在4个传输资源。此时,对于第1个传输资源,转发设备计算S1所需的传输窗口数与1的乘积,得到的乘积为4。计算该乘积除以4之后所得的余数,该余数为0,该余数小于其所需的传输窗口数,因此可知,S1期望使用第一个传输资源。对于S2-S4,采用同样的方法,确定得到对应的余数分别为3、2、3,均不小于相应业务所需的传输窗口数,因此可见,其余业务并不期望使用第1个传输资源。此时,即可以确定第1个传输资源对应的候选业务标识为S1。转发设备可以将S1添加至业务标识缓存队列的队尾。之后,转发设备可以继续通过前述方法,确定得到第2个传输资源对应的候选业务标识,分别为S1、S2、S3、S4,将第2个传输资源对应的候选业务标识,按照各个业务标识所标识的业务的先后顺序,添加至业务标识缓存队列中队尾。以此类推,将第3个传输资源对应的候选业务标识S1、S2、S4、第4个传输资源对应的候选业务标识S1、S2、S3、S4依次添加至业务标识缓存队列,此时得到的业务标识缓存队列为S1、S1、S2、S3、S4、S1、S2、S4、S1、S2、S3、S4。之后,转发设备即可以参考前述介绍的相关方法,按照12个传输窗口的先后顺序和该业务标识缓存队列为每个业务分配对应的传输窗口。
可选地,在一种可能的情况中,在依次确定k个传输资源中的每个传输资源对应的候选 业务标识时,转发设备也可以参考前述介绍的第二种方式中介绍的方法,将其中的第j个传输资源当做是第j+k-1个传输资源来进行评估。也即,对于第j个传输资源,转发设备可以确定第i个业务所需的传输窗口数与j+k-1的乘积。之后,转发设备可以确定该乘积除以k后所得到的余数。如果该余数小于第i个业务所需的传输窗口数,则确定第i个业务期望使用第j个传输资源,否则,则确定第i个业务不期望使用第j个传输资源。
需要说明的是,在该种实现方式中,转发设备根据n个业务所需的传输窗口数中的最大传输窗口数和每个业务所需的传输窗口数,确定每个传输资源对应的候选业务标识,这样,转发设备只需确定C max个传输资源对应的候选业务标识即可确定得到一个业务标识缓存队列,也即,转发设备只需执行C max次评估操作,即可以得到一个业务标识缓存队列,进而根据该业务标识缓存队列完成传输窗口的分配,相较于前述图4和7所示的确定m个传输资源对应的候选业务标识进行m次评估操作,减少了评估操作的次数。
上述是本申请实施例提供的第一种根据n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,进而根据每个传输资源对应的候选标识,为每个业务分配对应的传输窗口的实现方式,接下来,本申请实施例将介绍上述过程的第二种实现方式。
(2)根据n个业务中每个业务所需的传输窗口数,依次检测n个业务中每个业务是否期望使用第一传输资源,第一传输资源为k个传输资源中的任一传输资源;如果n个业务中不存在期望使用第一传输资源的业务,则确定第一传输资源对应的候选业务标识为空;如果n个业务中存在期望使用第一传输资源的业务,则将期望使用第一传输资源的一个或多个业务的业务标识作为第一传输资源的候选业务标识。当确定出第一传输资源对应的候选业务标识时,根据第一传输资源对应的候选业务标识,生成业务标识缓存队列;从m个传输窗口中当前剩余的传输窗口中的第一个传输窗口开始,依次为业务标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口,并将已分配的业务标识从缓存队列中删除;当检测到业务标识缓存队列为空时,将第二传输资源作为第一传输资源,执行根据n个业务中每个业务所需的传输窗口数,依次检测n个业务中每个业务是否期望使用第一传输资源的步骤,第二传输资源位于第一传输资源之后且与第一传输资源相邻。
在该种实现方式中,转发设备可以参考前述实现方式中介绍的内容,来确定第一传输资源对应的候选业务标识。在得到第一传输资源对应的候选业务标识之后,该转发设备可以根据第一传输资源对应的候选业务标识生成一个业务标识缓存队列,该业务标识缓存队列中仅包括第一传输资源对应的候选业务标识。其中,根据第一传输资源对应的候选业务标识生成业务标识缓存队列的实现方式也可以参考前述实现方式中生成业务标识缓存队列的实现方式,本申请实施例不再赘述。
在根据第一传输资源对应的候选业务标识生成一个业务标识缓存队列之后,转发设备可以按照前述介绍的相关实现方式,依次为业务标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口。其中,每为一个业务标识分配完对应的传输窗口之后,则可以将该业务标识从业务标识缓存队列中删除。
当检测到业务标识缓存队列为空时,也即,当第一传输资源对应的该业务标识缓存队列中的所有业务标识均分配到对应的传输窗口之后,该转发设备可以继续通过上述方法来确定下一个传输资源对应的候选业务标识,进而根据下一个传输资源对应的候选业务标识再次生 成一个业务标识缓存队列,并根据该业务标识缓存队列分配传输窗口。以此类推,直到处理完最后一个传输资源为止。
需要说明的是,在该种实现方式中,k可以小于m,且小于n个业务所需的传输窗口总数。接下来以k等于n个业务所需传输窗口数中的最大传输窗口为例来对上述过程进行说明。
按照k个传输资源的先后顺序,首先确定第1个传输资源对应的w 1个候选业务标识。在确定第1个传输资源对应的候选业务标识时,转发设备可以计算每个业务所需的传输窗口数与传输资源的排序编号也即1的乘积,得到n个乘积,之后,转发设备可以确定n个乘积中每个乘积除以C max后得到的余数,从而得到n个余数。从n个业务中选择对应的余数小于相应业务所需的传输窗口数的业务,将选择的业务的业务标识作为第1个传输资源对应的w 1个候选业务标识。
在确定第1个传输资源对应的w 1个候选业务标识之后,转发设备可以按照w 1个候选业务标识所标识的业务的先后顺序,根据w 1个候选业务标识生成一个业务标识缓存队列,并按照m个传输窗口的先后顺序,将第1个到第w 1个传输窗口依次分配给该业务标识缓存队列中第1个到第w 1个业务标识所标识的业务。其中,每分配完一个业务标识,转发设备可以将该业务标识从缓存队列中删除。
在为这个业务标识缓存队列中的最后一个业务标识分配对应的传输窗口之后,接下来,转发设备可以确定第2个传输资源对应的候选业务标识。其中,转发设备可以计算每个业务所需传输窗口数与传输资源的排序编号2的乘积,得到n个乘积。之后,确定每个乘积除以C max之后所得的余数。从n个业务中选择对应的余数小于相应业务所需的传输窗口数的业务,将选择的业务的业务标识作为第2个传输资源对应的候选业务标识。后续,转发设备可以参考介绍的方式,根据第2个传输资源对应的候选业务标识生成一个业务标识缓存队列,将m个传输窗口中剩余的传输窗口中的第一个传输窗口分配给业务标识缓存队列中的第一个业务标识,第二个传输窗口分配给业务标识缓存队列中的第二个业务标识,以此类推,直到分配完为止。其中,同样的,每分配完一个业务标识,将业务标识从业务缓存队列中删除。
在为这个业务标识缓存队列中的业务标识分配完传输窗口之后,转发设备可以参考前述方法,进行第三个传输资源的候选业务标识的确定。以此类推,直到完成第C max个传输资源的确定,将m个传输窗口分配完为止。
图10是本申请实施例示出的一种通过上述方法为业务分配传输窗口的示意图。如图10所示,仍以图4示出的4个业务数据和12个传输窗口为例,C max=4,因此,k=4,也即存在4个传输资源。在这种情况下,转发设备可以首先确定第1个传输资源对应的候选业务标识。其中,转发设备可以计算每个业务与1的乘积,从而得到4个乘积,分别为4、3、2、3。确定每个乘积除以4后所得的余数,得到4个余数,分别为:0、3、2、3。其中,只有S1对应的余数小于S1所需的传输窗口数,因此,可以将S1作为第1个传输资源对应的候选业务标识。此时,根据第1个传输资源对应的候选业务标识得到的业务标识缓存队列中只有S1一个业务标识。转发设备可以将12个传输窗口中的第1个传输窗口分配给S1。
在将第1个传输窗口分配给S1之后,转发设备可以确定第2个传输资源对应的候选标识。此时,转发设备可以计算每个业务所需的传输窗口数与2的乘积,从而得到4个乘积,分别为8、6、4、6。确定每个乘积除以4后所得的余数,得到4个余数,分别为:0、2、0、2。所有业务对应的余数均小于相应业务所需的传输窗口数,因此,可以确定第2个传输资源对 应的候选业务标识为S1、S2、S3、S4。此时,根据第2个传输资源对应的候选业务标识得到的业务标识缓存队列为S1、S2、S3、S4。此时,转发设备可以从第2个传输窗口开始,将第2个传输窗口到第5个传输窗口依次分配给S1、S2、S3、S4所标识的业务。
在将第5个传输窗口分配给业务标识缓存队列中的最后一个业务标识S4所标识的业务之后,转发设备接下来可以确定第3个传输资源对应的候选业务标识。此时,转发设备计算每个业务所需的传输窗口数与3的乘积,得到4个乘积,分别为:12、9、6、9。获取每个乘积除以4后得到的余数,分别为:0、1、2、1。由此可见,除了S3对应的余数不小于S3所需的传输窗口数,剩余的业务对应的余数均小于相应业务所需的传输窗口数,因此,可以确定第3个传输资源对应的候选业务标识为S1、S2、S4,根据这些候选业务标识生成的业务标识缓存队列为:S1、S2、S4。之后,转发设备将第6个传输窗口到第8个传输窗口依次分配给S1、S2、S4所标识的业务。
在将第8个传输窗口分配给业务标识缓存队列中的最后一个业务标识S4所标识的业务之后,转发设备可以参考前述实现方式确定第4个传输资源对应的候选业务标识,分别为S1、S2、S3、S4。之后,转发设备可以参考前述介绍的方式,将最后4个传输窗口依次分配给S1、S2、S3、S4所标识的业务。
由上述介绍可知,在该种实现方式中,转发设备最多确定C max个传输资源的候选业务标识,也即,最多进行C max次的评估。并且,在该种实现方式中,转发设备每根据一个传输资源对应的候选业务标识,生成一个业务标识缓存队列之后,都会等待为该业务标识缓存队列中所有业务标识所标识的业务分配完传输窗口之后,才进行下一次的评估,这样,业务标识缓存队列的长度不至于过长,降低了实现代价。
可选地,在上述介绍的方法中,在确定第j个传输资源对应的候选业务标识的确定时,转发设备也可以将第j个传输资源作为第j+k-1个传输资源来进行处理,也即,对于第j个传输资源,转发设备可以计算每个业务所需的传输窗口数与j+k-1的乘积。
需要说明的是,在本申请实施例中,n个业务可以均为有效业务,这样,当n个业务所需的传输窗口总数等于m时,通过上述方法将m个传输窗口全部分配给n个业务之后,每个传输窗口均会承载有一个业务的业务数据。可选地,在一种可能的情况中,n个业务中可以包括一部分有效业务和一部分空闲业务,也即,则在本申请实施例中,为了保证承载这些有效业务的传输窗口能够均匀分布在单位时间周期或单位数据帧内,转发设备可以构造一个或多个空闲业务,该一个或多个空闲业务所需的传输窗口数即等于m与所有有效业务所需的传输窗口总数之间的差。之后,转发设备可以将构造的这些空闲业务混在在有效业务中,得到n个业务,从而通过前述的方法来为各个业务分配对应的传输窗口。由于这些业务为空闲业务,因此,后续在步骤303中,在这些空闲业务对应的传输窗口上可以发送填充比特。
上述主要介绍了转发设备并行的确定每个传输资源对应的候选业务标识,并根据候选业务标识生成业务标识缓存队列,进而以此来分配传输窗口的过程。接下来将介绍转发设备以串行方式来分配传输窗口的两种实现方式。
第二种实现方式:根据n个业务中第一个业务所需的传输窗口数C 1和m,从m个传输窗口中为第一个业务分配C 1个传输窗口;根据n个业务中第i个业务所需的传输窗口数C i和m,从m个传输窗口中的剩余传输窗口中为第i个业务分配C i个传输窗口,剩余传输窗口是指m个传输窗口中除去为前i-1个业务分配的传输窗口之外剩余的传输窗口,i为大于1的 整数。
在该种实现方式中,转发设备可以按照业务的先后顺序,依次为每个业务分配对应的传输窗口,这样,对于第1个业务,转发设备可以从m个传输窗口中选择C 1个传输窗口,而对于后续的其他业务,转发设备只能从剩余的未分配的传输窗口中为相应业务分配所需数量的传输窗口。
示例性地,对于第1个业务,转发设备可以计算第1个业务所需的传输窗口数C 1与m个传输窗口中每个传输窗口的排序编号之间的乘积,从而得到m个乘积。其中,每个传输窗口的排序编号是指相应传输窗口在m个传输窗口中排在第几位。例如,对于m个传输窗口中的第1个传输窗口,这个传输窗口的排序编号即为1,对于m个传输窗口中的第j个传输窗口,这个传输窗口的排序编号即为j。在得到m个乘积之后,转发设备可以获取每个乘积除以m之后所得的余数,之后,转发设备可以从m个传输窗口中选择对应的余数小于C 1的传输窗口,将选择的这些传输窗口分配给第1个业务。
对于第2个业务,当前m个传输窗口中已经有C 1个传输窗口分配给了第1个业务,未分配的剩余传输窗口数为m-C 1。基于此,转发设备可以计算第2个业务所需的传输窗口数C 2与m个传输窗口中每个传输窗口的排序编号之间的乘积,从而得到m个乘积。在得到m个乘积之后,转发设备可以获取每个乘积除以m-C 1之后所得的余数,之后,转发设备可以从m个传输窗口中选择对应的余数小于C 2的传输窗口,将选择的这些传输窗口分配给第2个业务。
以此类推,对于第i个业务,未分配的剩余传输窗口数为m-(C 1+…+C i-1),在这种情况下,转发设备可以计算第i个业务所需的传输窗口数C i与m个传输窗口中每个传输窗口的序号之间的乘积,从而得到m个乘积。在得到m个乘积之后,转发设备可以获取每个乘积除以m-(C 1+…+C i-1)之后所得的余数,之后,转发设备可以从m个传输窗口中选择对应的余数小于C i的传输窗口,将选择的这些传输窗口分配给第i个业务。其中,i不大于n。
需要说明的是,对于最后一个业务,如果m正好等于所有业务所需的传输窗口总数,则在为前n-1分配完传输窗口之后,剩余的传输窗口数将正好等于最后一个业务所需的传输窗口数,在这种情况下,转发设备可以直接将最后剩余的传输窗口分配给最后一个业务。
第三种实现方式:令i=1,j=1,根据第i个业务数据所需的传输窗口数和m,判断第i个业务是否期望使用第h个传输窗口,h等于j或m-j+1;如果第i个业务期望使用第h个传输窗口,则将第h个传输窗口分配给第i个业务,令i=1,j=j+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤,直至j=m为止;如果第i个业务不期望使用第h个传输窗口,则令i=i+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤,直至i=n时,将第h个传输窗口分配给第n个业务,令i=1,j=j+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤。其中,j是指传输窗口的排序编号。
在该种实现方式中,当h等于j时,对于第j个传输窗口,转发设备可以首先评估第1个业务是否期望使用该传输窗口,如果第1个业务不期望使用该传输窗口,则转发设备可以继续评估第2个业务是否期望使用该传输窗口,以此类推,如果直到第n-1个业务仍然不期望使用该传输窗口,则该转发设备可以直接将该传输窗口分配给最后一个业务。如果确定某个业务期望使用该传输窗口,则该转发设备可以将该传输窗口分配给该业务,对于在该业务之后的其他业务,不再继续进行评估。转发设备可以直接开始进行下一个传输窗口的评估。
示例性地,对于第1个传输窗口,转发设备可以首先评估第1个业务是否期望使用该传输窗口。此时,对于第1个业务而言,这是第1次评估,基于此,转发设备可以令Q 1=1,计算第1个业务所需的传输窗口数C 1与Q 1的乘积,并获取该乘积除以m后所得的余数,如果该余数小于C 1,则转发设备可以将第1个传输窗口分配给第1个业务。如果该余数不小于C 1,则转发设备可以继续评估第2个业务是否期望使用该传输窗口。此时,对于第2个业务而言,这也是第1次评估,因此,转发设备可以令Q 2=1,计算第2个业务所需的传输窗口数C 2与Q 2的乘积,并获取该乘积除以m-C 1后所得的余数。如果该余数小于C 2,则转发设备可以将该传输窗口分配给第2个业务,如果该余数不小于C 2,则该转发设备可以继续参考前述的方法评估第3个业务是否期望使用该传输窗口,依此类推。
在将第1个传输窗口分配给第i个业务之后,接下来,转发设备可以分配第2个传输窗口。在分配第2个传输窗口时,转发设备依然从第1个业务开始评估。其中,在进行第j个传输窗口的评估时,转发设备可以确定在此之前对该业务进行评估的次数,并将该次数加1,得到Q i,之后,转发设备可以计算第i个业务所需的传输窗口数C i与Q i的乘积,并获取该乘积除以m-(C 1+…+C i-1)后所得的余数。之后,转发设备可以参考前述方法通过比较该余数与C i之间的大小来确定是否将当前传输窗口分配给第i个业务。
可选地,当h=m-j+1时,实现方式可以参考h=j时实现方式。与前述实现方式不同的是,在这种情况下,相当于是从m个传输窗口中的最后一个传输窗口开始进行分配。
需要说明的是,在上述介绍的第二种方式和第三种方式中,如果传输窗口总数等于n个业务所需的传输窗口数总和,则通过上述方法正好可以将m个传输窗口全部分配给n个业务。如果传输窗口总数m大于n个业务所需的传输窗口的总和,则在为n个业务分配完传输窗口之后,还会存在一部分剩余的传输窗口。在本申请实施例中,对于这些剩余的传输窗口,转发设备可以通过这些传输窗口来传输该单位时间周期内或单位数据帧内的业务配置参数,其中,该业务配置参数可以包括该单位时间周期内或单位数据帧内各个业务所需的传输窗口数,除此之外,还可以包括该时隙内包括的传输窗口总数m。
步骤303:根据每个业务对应的传输窗口,将n个业务的业务数据复用为一路数据,发送复用后的数据。
在为每个业务分配对应的传输窗口之后,该转发设备可以按照各个业务对应的传输窗口,将n个业务的业务数据复用为一路数据,从而使得复用后的业务数据能够在指定时隙的m个传输窗口上传输。
例如,参见图11,,一个FlexE帧可以包括8行,每行的第一个66比特码块为开销区域,也即,包括8个66比特码块的开销区域。除开销区域之外,剩余的为净荷区域。净荷区域中每行包括1023*20个66比特码块,这样,净荷区域将包括(1023*20)*8个66比特码块。其中,净荷区域可以被划分20个时隙。如图11中所示,编号相同的66比特码块属于同一时隙,这样,一个时隙内包含有1023*8个66比特码块。假设将一个66比特码块作为一个传输窗口,则一个时隙内包括1023*8=8184个传输窗口。当通过上述方法确定在一个时隙内每个业务对应的传输窗口之后,参见图12,假设S1业务所需的传输窗口数为C1,则将S1业务对应的传输窗口(也即66比特码块)将有C1个,这样,可以得到承载有S1的业务数据的C1个码块。同理,对于S2-Sn,均可以通过对应的传输窗口来承载业务数据。之后,转发设备可以将承载有n个业务的业务数据的66比特码块作为一路数据,并在该时隙内传输复用得到的一 路数据。
可选地,在一种可能的情况中,转发设备也可以采用以太网帧格式承载n个业务的复用数据。在这种情况下,参见图13,转发设备可以按照n个业务所对应的传输窗口,对n个业务进行交织,形成复用数据流。之后,转发设备可以生成封装头部,用于承载形成复用数据流的各个业务所需的传输窗口数以及该时隙内传输窗口总数m等参数,将该复用数据流作为封装净荷,放在封装头部之后,从而得到封装数据。最后,转发设备可以将封装数据作为以太网帧,生成以太网数据流,进而通过FlexE接口的一个时隙或多个时隙发送出去。
当通过上述方法将多个业务发送出去之后,对于作为接收端的下游转发设备,该转发设备可以根据该时隙内的业务配置参数,采用与前述与上游转发设备相同的方法来确定各个业务对应的传输窗口,也即,确定各个业务由哪些传输窗口来承载,这样,该下游转发设备即可以根据确定的各个业务对应的传输窗口对接收到的业务进行解复用,从而还原得到各个业务。
需要说明的是,为了保证下游转发设备能够正确的解复用,在本申请实施例中,上游转发设备在根据各个业务的传输窗口发送各个业务时,还需要将该时隙内的业务配置参数传输至下游转发设备。
其中,在一种可能的情况中,各个时隙内包含的传输窗口总数可以是一定的,并且,在各个时隙内包含的待映射的业务也可以是固定的。也即,每个时隙内均包括n个待映射业务,且各个业务所需的传输窗口数固定。在这种情况下,上游的转发设备只需向下游的转发设备发送一次业务配置参数即可。
可选地,在另一种可能的情况中,各个时隙内包含的待映射的业务不是固定的。也即,各个时隙内的待映射的业务的个数不同。或者,各个时隙内待映射的业务的个数相同,但是各个业务所需的传输窗口数不同。或者,上述两者都不同。在这种情况下,则上游的转发设备可以在每个时隙内发送复用后的业务数据之前或同时,实时传输该时隙内的业务配置参数,以便下游转发设备在接收到业务之后,可以根据该业务配置参数对接收到的业务进行正确的解复用。
在本申请实施例中,发送端可以获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,其中,该单位时间周期内或单位数据帧内包含有m个传输窗口。之后,根据每个业务所需的传输窗口数,发送端可以从m个传输窗口中为每个业务分配对应的传输窗口,根据每个业务对应的传输窗口,将n个业务的业务数据复用为一路数据,发送复用后的数据。由此可见,本申请实施例可以将单位时间周期或单位数据帧划分为m个传输窗口,之后,通过为每个业务分配对应的传输窗口来传输相应业务,这样,多个业务就可以复用一个时间周期或数据帧来进行业务的传输,避免了相关技术中一个时间周期或一个数据帧仅能承载一种业务所造成的带宽资源浪费。
另外,在本申请实施例中,作为发送端的上游转发设备还可以将单位时间周期内或者是单位数据帧内的业务配置参数发送至作为接收端的下游转发设备。下游转发设备可以根据该业务配置参数,采用与上游转发设备相同的方法来确定各个业务对应的传输窗口,也即,确定各个业务由哪些传输窗口来承载,这样,该下游转发设备即可以根据确定的各个业务对应的传输窗口对接收到的业务进行解复用,从而还原得到各个业务。由此可见,本申请实施例中,上游转发设备中不必存储业务与传输窗口之间的映射关系,上下游转发设备之间也不必 传输业务与传输窗口之间的映射关系,只需传输少量业务配置参数即可实现业务的正确解复用,存储和传输效率较高。
参见图14,本发明实施例提供了一种业务处理装置1400,该装置1400包括:
获取模块1401,用于执行前述实施例中的步骤301;
分配模块1402,用于执行前述实施例中的步骤302;
发送模块1403,用于执行前述实施例中的步骤303。
可选地,分配模块1402包括:
确定子模块,用于根据n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,k个传输资源是指将单位时间周期内或单位数据帧内的总传输资源进行划分得到,候选业务标识是指期望使用相应传输资源的业务的业务标识,k不小于n个业务所需的传输窗口数中的最大传输窗口数;
分配子模块,用于根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口。
可选地,k为最大传输窗口数、m和2 p中的任一数值。
可选地,确定子模块具体用于:
根据n个业务中每个业务所需的传输窗口数,依次检测n个业务中每个业务是否期望使用第一传输资源,第一传输资源为k个传输资源中的任一传输资源;
如果n个业务中不存在期望使用第一传输资源的业务,则确定第一传输资源对应的候选业务标识为空;
如果n个业务中存在期望使用第一传输资源的业务,则将期望使用第一传输资源的一个或多个业务的业务标识作为第一传输资源的候选业务标识。
可选地,分配子模块具体用于:
根据k个传输资源的先后顺序和每个传输资源对应的候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列;
当n个业务所需的传输窗口总数等于m时,按照m个传输窗口的先后顺序,将m个传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务;
当n个业务所需的传输窗口总数小于m时,按照m个传输窗口的先后顺序,将m个传输窗口中与n个业务所需的传输窗口总数相等数量的传输窗口依次分配给业务标识缓存队列中的各个业务标识所标识的业务。
可选地,当n个业务所需的传输窗口总数等于m时,n个业务中包括一个或多个空闲业务。
可选地,每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务的业务编号从小到大进行排列后的顺序,或者,每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务对应的余数从大到小进行排列后的顺序,各个业务对应的余数是指相应业务所需的传输窗口数与相应传输资源在k个传输资源中的排序编号的乘积除以k所得到的余数。
可选地,分配子模块具体用于:
当确定出第一传输资源对应的候选业务标识时,根据第一传输资源对应的候选业务标识, 生成业务标识缓存队列;
从m个传输窗口中当前剩余的传输窗口中的第一个传输窗口开始,依次为业务标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口,并将已分配的业务标识从缓存队列中删除;
相应地,该装置还用于:
当检测到业务标识缓存队列为空时,将第二传输资源作为第一传输资源,重新执行根据n个业务中每个业务所需的传输窗口数,依次检测n个业务中每个业务是否期望使用第一传输资源的步骤,第二传输资源位于第一传输资源之后且与第一传输资源相邻。
可选地,确定子模块具体用于:
对于n个业务中的第i个业务,确定第i个业务所需的传输窗口数与j的乘积,j为第一传输资源在k个传输资源中的排序编号;
确定乘积除以k所得到的余数;
如果余数小于第i个业务所需的传输窗口数,则确定第i个业务期望使用第一传输资源。
可选地,确定子模块具体用于:
对于n个业务中的第i个业务,确定第i个业务所需的传输窗口数与k-j+1的乘积,j为第一传输资源在k个传输资源中的排序编号;
确定乘积除以k所得到的余数;
如果余数小于第i个业务所需的传输窗口数,则确定第i个业务期望使用第一传输资源。
可选地,分配模块1402具体用于:
根据n个业务中第一个业务所需的传输窗口数C 1和m,从m个传输窗口中为第一个业务分配C 1个传输窗口;
根据n个业务中第i个业务所需的传输窗口数C i和m,从m个传输窗口中的剩余传输窗口中为第i个业务分配C i个传输窗口,剩余传输窗口是指m个传输窗口中除去为前i-1个业务分配的传输窗口之外剩余的传输窗口,i为大于1的整数。
可选地,分配模块1402具体用于:
令i=1,j=1,根据第i个业务所需的传输窗口数和m,判断第i个业务是否期望使用第h个传输窗口,h等于j或h等于m-j+1;
如果第i个业务期望使用第h个传输窗口,则将第h个传输窗口分配给第i个业务,令i=1,j=j+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤,直至j=m为止;
如果第i个业务不期望使用第h个传输窗口,则令i=i+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤,直至i=n时,将第h个传输窗口分配给第n个业务,令i=1,j=j+1,返回确定第i个业务是否期望使用第h个传输窗口的步骤。
可选地,该装置1400还用于:
向接收设备发送业务配置参数,以使接收设备根据业务配置参数对接收到的复用后的数据进行解复用,得到n个业务的业务数据,业务配置参数包括n个业务中每个业务所需的传输窗口数。
综上所述,在本申请实施例中,发送端可以获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,其中,该单位时间周期内或单位数据帧内包含有m个传输窗口。之后,根据每个业务所需的传输窗口数,发送端可以从m个传输窗口中为每 个业务分配对应的传输窗口,根据每个业务对应的传输窗口,将n个业务的业务数据复用为一路数据,发送复用后的数据。由此可见,本申请实施例可以将单位时间周期或单位数据帧划分为m个传输窗口,之后,通过为每个业务分配对应的传输窗口来传输相应业务,这样,多个业务就可以复用一个时间周期或数据帧来进行业务的传输,避免了相关技术中一个时间周期或一个数据帧仅能承载一种业务所造成的带宽资源浪费。
需要说明的是:上述实施例提供的业务处理装置在处理业务时,仅以上述各功能模块的划分进行举例说明,实际应用中,可以根据需要而将上述功能分配由不同的功能模块完成,即将设备的内部结构划分成不同的功能模块,以完成以上描述的全部或者部分功能。另外,上述实施例提供的业务处理装置与业务处理方法实施例属于同一构思,其具体实现过程详见方法实施例,这里不再赘述。
在上述实施例中,可以全部或部分地通过软件、硬件、固件或者其任意结合来实现。当使用软件实现时,可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时,全部或部分地产生按照本发明实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中,或者从一个计算机可读存储介质向另一个计算机可读存储介质传输,例如,所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如:同轴电缆、光纤、数据用户线(Digital Subscriber Line,DSL))或无线(例如:红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如:软盘、硬盘、磁带)、光介质(例如:数字通用光盘(Digital Versatile Disc,DVD))、或者半导体介质(例如:固态硬盘(Solid State Disk,SSD))等。
本领域普通技术人员可以理解实现上述实施例的全部或部分步骤可以通过硬件来完成,也可以通过程序来指令相关的硬件完成,所述的程序可以存储于一种计算机可读存储介质中,上述提到的存储介质可以是只读存储器,磁盘或光盘等。
应当理解的是,本文提及的“多个”是指两个或两个以上。在本申请的描述中,除非另有说明,“/”表示或的意思,例如,A/B可以表示A或B;本文中的“和/或”仅仅是一种描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B这三种情况。另外,为了便于清楚描述本申请实施例的技术方案,在本申请的实施例中,采用了“第一”、“第二”等字样对功能和作用基本相同的相同项或相似项进行区分。本领域技术人员可以理解“第一”、“第二”等字样并不对数量和执行次序进行限定,并且“第一”、“第二”等字样也并不限定一定不同。
以上所述为本申请提供的实施例,并不用以限制本申请,凡在本申请的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本申请的保护范围之内。

Claims (27)

  1. 一种业务处理方法,其特征在于,所述方法包括:
    获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,所述单位时间周期内或单位数据帧包含有m个传输窗口,所述n个业务所需的传输窗口总数不大于所述m,所述m和所述n均为大于1的整数;
    根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口;
    根据每个业务对应的传输窗口,将所述n个业务的业务数据复用为一路数据,发送复用后的数据。
  2. 如权利要求1所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口,包括:
    根据所述n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,所述k个传输资源是指将所述单位时间周期内或单位数据帧内的总传输资源进行划分得到,所述候选业务标识是指期望使用相应传输资源的业务的业务标识,所述k不小于所述n个业务所需的传输窗口数中的最大传输窗口数;
    根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口。
  3. 如权利要求2所述的方法,其特征在于,所述k为所述最大传输窗口数、所述m和2 p中的任一数值。
  4. 如权利要求2所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,确定k个传输资源中每个传输资源对应的候选业务标识,包括:
    根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源,所述第一传输资源为所述k个传输资源中的任一传输资源;
    如果所述n个业务中不存在期望使用所述第一传输资源的业务,则确定所述第一传输资源对应的候选业务标识为空;
    如果所述n个业务中存在期望使用所述第一传输资源的业务,则将期望使用所述第一传输资源的一个或多个业务的业务标识作为所述第一传输资源的候选业务标识。
  5. 如权利要求2-4任一所述的方法,其特征在于,所述根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口,包括:
    根据所述k个传输资源的先后顺序和每个传输资源对应的候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列;
    当所述n个业务所需的传输窗口总数等于所述m时,按照所述m个传输窗口的先后顺序,将所述m个传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务;
    当所述n个业务所需的传输窗口总数小于所述m时,按照所述m个传输窗口的先后顺序, 将所述m个传输窗口中与所述n个业务所需的传输窗口总数相等数量的传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务。
  6. 如权利要求5所述的方法,其特征在于,当所述n个业务所需的传输窗口总数等于所述m时,所述n个业务中包括一个或多个空闲业务。
  7. 如权利要求5所述的方法,其特征在于,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务的业务编号从小到大进行排列后的顺序,或者,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务对应的余数从大到小进行排列后的顺序,所述各个业务对应的余数是指相应业务所需的传输窗口数与相应传输资源在所述k个传输资源中的排序编号的乘积除以所述k所得到的余数。
  8. 如权利要求4所述的方法,其特征在于,所述根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口,包括:
    当确定出所述第一传输资源对应的候选业务标识时,根据所述第一传输资源对应的候选业务标识,生成业务标识缓存队列;
    从所述m个传输窗口中当前剩余的传输窗口中的第一个传输窗口开始,依次为所述业务标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口,并将已分配的业务标识从缓存队列中删除;
    相应地,所述方法还包括:
    当检测到所述业务标识缓存队列为空时,将第二传输资源作为所述第一传输资源,重新执行所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源的步骤,所述第二传输资源位于所述第一传输资源之后且与所述第一传输资源相邻。
  9. 如权利要求4-8任一所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源,包括:
    对于所述n个业务中的第i个业务,确定第i个业务所需的传输窗口数与j的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;
    确定所述乘积除以所述k所得到的余数;
    如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
  10. 如权利要求4-8任一所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源,包括:
    对于所述n个业务中的第i个业务,确定所述第i个业务所需的传输窗口数与k-j+1的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;
    确定所述乘积除以所述k所得到的余数;
    如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
  11. 如权利要求1所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口,包括:
    根据所述n个业务中第一个业务所需的传输窗口数C 1和所述m,从所述m个传输窗口中为所述第一个业务分配C 1个传输窗口;
    根据所述n个业务中第i个业务所需的传输窗口数C i和所述m,从所述m个传输窗口中的剩余传输窗口中为所述第i个业务分配C i个传输窗口,所述剩余传输窗口是指所述m个传输窗口中除去为前i-1个业务分配的传输窗口之外剩余的传输窗口,所述i为大于1的整数。
  12. 如权利要求1所述的方法,其特征在于,所述根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口,包括:
    令i=1,j=1,根据第i个业务所需的传输窗口数和所述m,判断第i个业务是否期望使用第h个传输窗口,所述h等于j或所述h等于m-j+1;
    如果所述第i个业务期望使用所述第h个传输窗口,则将所述第h个传输窗口分配给所述第i个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述j=m为止;
    如果所述第i个业务不期望使用所述第h个传输窗口,则令所述i=i+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述i=n时,将所述第h个传输窗口分配给所述第n个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤。
  13. 如权利要求1-12任一所述的方法,其特征在于,所述方法还包括:
    向接收设备发送业务配置参数,以使所述接收设备根据所述业务配置参数对接收到的复用后的数据进行解复用,得到所述n个业务的业务数据,所述业务配置参数包括所述n个业务中每个业务所需的传输窗口数。
  14. 一种业务处理装置,其特征在于,所述装置包括:
    获取模块,用于获取单位时间周期内或单位数据帧内待映射的n个业务中每个业务所需的传输窗口数,所述单位时间周期内或单位数据帧包含有m个传输窗口,所述n个业务所需的传输窗口总数不大于所述m,所述m和所述n均为大于1的整数;
    分配模块,用于根据所述n个业务中每个业务所需的传输窗口数,从所述m个传输窗口中为每个业务分配对应的传输窗口;
    发送模块,用于根据每个业务对应的传输窗口,将所述n个业务的业务数据复用为一路数据,发送复用后的数据。
  15. 如权利要求14所述的装置,其特征在于,所述分配模块包括:
    确定子模块,用于根据所述n个业务中每个业务所需的传输窗口数,确定k个传输资源 中每个传输资源对应的候选业务标识,所述k个传输资源是指将所述单位时间周期内或单位数据帧内的总传输资源进行划分得到,所述候选业务标识是指期望使用相应传输资源的业务的业务标识,所述k不小于所述n个业务所需的传输窗口数中的最大传输窗口数;
    分配子模块,用于根据每个传输资源对应的候选业务标识,为每个业务分配对应的传输窗口。
  16. 如权利要求15所述的装置,其特征在于,所述k为所述最大传输窗口数、所述m和2 p中的任一数值。
  17. 如权利要求15所述的装置,其特征在于,所述确定子模块具体用于:
    根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源,所述第一传输资源为所述k个传输资源中的任一传输资源;
    如果所述n个业务中不存在期望使用所述第一传输资源的业务,则确定所述第一传输资源对应的候选业务标识为空;
    如果所述n个业务中存在期望使用所述第一传输资源的业务,则将期望使用所述第一传输资源的一个或多个业务的业务标识作为所述第一传输资源的候选业务标识。
  18. 如权利要求15-17任一所述的装置,其特征在于,所述分配子模块具体用于:
    根据所述k个传输资源的先后顺序和每个传输资源对应的候选业务标识所标识的业务的先后顺序,生成业务标识缓存队列;
    当所述n个业务所需的传输窗口总数等于所述m时,按照所述m个传输窗口的先后顺序,将所述m个传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务;
    当所述n个业务所需的传输窗口总数小于所述m时,按照所述m个传输窗口的先后顺序,将所述m个传输窗口中与所述n个业务所需的传输窗口总数相等数量的传输窗口依次分配给所述业务标识缓存队列中的各个业务标识所标识的业务。
  19. 如权利要求18所述的装置,其特征在于,当所述n个业务所需的传输窗口总数等于所述m时,所述n个业务中包括一个或多个空闲业务。
  20. 如权利要求18所述的装置,其特征在于,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务的业务编号从小到大进行排列后的顺序,或者,所述每个传输资源对应的候选业务标识所标识的业务的先后顺序是指按照各个业务对应的余数从大到小进行排列后的顺序,所述各个业务对应的余数是指相应业务所需的传输窗口数与相应传输资源在所述k个传输资源中的排序编号的乘积除以所述k所得到的余数。
  21. 如权利要求17所述的装置,其特征在于,所述分配子模块具体用于:
    当确定出所述第一传输资源对应的候选业务标识时,根据所述第一传输资源对应的候选业务标识,生成业务标识缓存队列;
    从所述m个传输窗口中当前剩余的传输窗口中的第一个传输窗口开始,依次为所述业务 标识缓存队列中的各个业务标识所标识的业务分配对应的传输窗口,并将已分配的业务标识从缓存队列中删除;
    相应地,所述装置还用于:
    当检测到所述业务标识缓存队列为空时,将第二传输资源作为所述第一传输资源,重新执行所述根据所述n个业务中每个业务所需的传输窗口数,依次检测所述n个业务中每个业务是否期望使用所述第一传输资源的步骤,所述第二传输资源位于所述第一传输资源之后且与所述第一传输资源相邻。
  22. 如权利要求17-21任一所述的装置,其特征在于,所述确定子模块具体用于:
    对于所述n个业务中的第i个业务,确定第i个业务所需的传输窗口数与j的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;
    确定所述乘积除以所述k所得到的余数;
    如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
  23. 如权利要求17-21任一所述的装置,其特征在于,所述确定子模块具体用于:
    对于所述n个业务中的第i个业务,确定所述第i个业务所需的传输窗口数与k-j+1的乘积,所述j为所述第一传输资源在所述k个传输资源中的排序编号;
    确定所述乘积除以所述k所得到的余数;
    如果所述余数小于所述第i个业务所需的传输窗口数,则确定所述第i个业务期望使用所述第一传输资源。
  24. 如权利要求14所述的装置,其特征在于,所述分配模块具体用于:
    根据所述n个业务中第一个业务所需的传输窗口数C 1和所述m,从所述m个传输窗口中为所述第一个业务分配C 1个传输窗口;
    根据所述n个业务中第i个业务所需的传输窗口数C i和所述m,从所述m个传输窗口中的剩余传输窗口中为所述第i个业务分配C i个传输窗口,所述剩余传输窗口是指所述m个传输窗口中除去为前i-1个业务分配的传输窗口之外剩余的传输窗口,所述i为大于1的整数。
  25. 如权利要求14所述的装置,其特征在于,所述分配模块具体用于:
    令i=1,j=1,根据第i个业务所需的传输窗口数和所述m,判断第i个业务是否期望使用第h个传输窗口,所述h等于j或所述h等于m-j+1;
    如果所述第i个业务期望使用所述第h个传输窗口,则将所述第h个传输窗口分配给所述第i个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述j=m为止;
    如果所述第i个业务不期望使用所述第h个传输窗口,则令所述i=i+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤,直至所述i=n时,将所述第h个传输窗口分配给所述第n个业务,令所述i=1,所述j=j+1,返回所述确定第i个业务是否期望使用第h个传输窗口的步骤。
  26. 如权利要求14-25任一所述的装置,其特征在于,所述装置还用于:
    向接收设备发送业务配置参数,以使所述接收设备根据所述业务配置参数对接收到的复用后的数据进行解复用,得到所述n个业务的业务数据,所述业务配置参数包括所述n个业务中每个业务所需的传输窗口数。
  27. 一种计算机可读存储介质,其特征在于,包括指令,所述指令在计算机上运行时,使得计算机执行权利要求1-13任一项所述的方法。
PCT/CN2020/116610 2019-09-24 2020-09-21 业务处理方法、装置及存储介质 WO2021057678A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20868968.7A EP4024752A4 (en) 2019-09-24 2020-09-21 METHOD AND DEVICE FOR SERVICE PROCESSING AND STORAGE MEDIUM
US17/703,472 US20220217091A1 (en) 2019-09-24 2022-03-24 Service processing method and apparatus, and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910906148.4A CN112636883A (zh) 2019-09-24 2019-09-24 业务处理方法、装置及存储介质
CN201910906148.4 2019-09-24

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/703,472 Continuation US20220217091A1 (en) 2019-09-24 2022-03-24 Service processing method and apparatus, and storage medium

Publications (1)

Publication Number Publication Date
WO2021057678A1 true WO2021057678A1 (zh) 2021-04-01

Family

ID=75165613

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/116610 WO2021057678A1 (zh) 2019-09-24 2020-09-21 业务处理方法、装置及存储介质

Country Status (4)

Country Link
US (1) US20220217091A1 (zh)
EP (1) EP4024752A4 (zh)
CN (1) CN112636883A (zh)
WO (1) WO2021057678A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115766460B (zh) * 2021-08-31 2024-08-20 华为技术有限公司 数据传输方法、装置、设备及存储介质
CN116996198B (zh) * 2023-09-25 2023-12-19 之江实验室 一种灵活以太网双向时延对称小颗粒时隙分配方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040095884A1 (en) * 2002-11-04 2004-05-20 Lee Ho Sook Method of controlling upstream data transmission in Ethernet PON and apparatus thereof
CN101931884A (zh) * 2009-06-23 2010-12-29 北京三星通信技术研究有限公司 一种数据同步方法和系统
CN106506110A (zh) * 2015-09-06 2017-03-15 中兴通讯股份有限公司 统计复用光传送网方法及装置
CN107566075A (zh) * 2016-07-01 2018-01-09 华为技术有限公司 一种发送和接收业务的方法、装置和网络系统
CN109861781A (zh) * 2017-11-30 2019-06-07 华为技术有限公司 接口传输方法、装置及设备

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140280398A1 (en) * 2013-03-15 2014-09-18 Miosoft Corporation Distributed database management
CN109981209B (zh) * 2017-12-28 2022-01-28 中兴通讯股份有限公司 光传送网中业务发送、接收方法及装置
CN110266612B (zh) * 2018-03-12 2022-01-25 中兴通讯股份有限公司 数据传输方法及装置、网络设备及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040095884A1 (en) * 2002-11-04 2004-05-20 Lee Ho Sook Method of controlling upstream data transmission in Ethernet PON and apparatus thereof
CN101931884A (zh) * 2009-06-23 2010-12-29 北京三星通信技术研究有限公司 一种数据同步方法和系统
CN106506110A (zh) * 2015-09-06 2017-03-15 中兴通讯股份有限公司 统计复用光传送网方法及装置
CN107566075A (zh) * 2016-07-01 2018-01-09 华为技术有限公司 一种发送和接收业务的方法、装置和网络系统
CN109861781A (zh) * 2017-11-30 2019-06-07 华为技术有限公司 接口传输方法、装置及设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4024752A4

Also Published As

Publication number Publication date
EP4024752A1 (en) 2022-07-06
CN112636883A (zh) 2021-04-09
US20220217091A1 (en) 2022-07-07
EP4024752A4 (en) 2022-10-05

Similar Documents

Publication Publication Date Title
EP3605975B1 (en) Client service transmission method and device
US7230917B1 (en) Apparatus and technique for conveying per-channel flow control information to a forwarding engine of an intermediate network node
JP6420354B2 (ja) 優先度および帯域幅割り当てに基づくトラフィッククラスアービトレーション
WO2021057678A1 (zh) 业务处理方法、装置及存储介质
US7961744B2 (en) Frame multiplexing device
CN100512205C (zh) 虚拟输出队列(VoQ)管理方法和装置
US10075391B2 (en) Flexible deterministic binary scheduler
US20210409510A1 (en) Transmitter and Receiver, Serializer and Deserializer and Methods for Transmitting and Receiving, Serializing and Deserializing
JP5467535B2 (ja) 多重伝送システム、多重装置、多重分離装置、及び多重伝送方法
US7558260B2 (en) Byte-timeslot-synchronous, dynamically switched multi-source-node data transport bus system
CN113228538B (zh) 数据传输方法及装置
US20220167316A1 (en) Method and apparatus for transmitting service data
WO2022147762A1 (zh) 一种数据包排序方法及装置
EP3609141B1 (en) An ethernet bonding processor and corresponding ethernet frame receiver
KR102091152B1 (ko) 계층적 네트워크에서 다중코어를 이용한 패킷 처리 방법 및 그 장치
Huang et al. LAN with collision avoidance: switch implementation and simulation study
US9130772B1 (en) Methods, systems, and computer program products for adaptive inverse packet multiplexing in which traffic allocation is dynamically adjustable on individual links
CN113824525A (zh) 资源配置方法、装置及可读存储介质
CN115883457A (zh) 一种通信方法以及路由设备
US20090185490A1 (en) Method of monitoring traffic in an optical or electronic network with shared resources
KR20200044642A (ko) 다중계층 네트워크 환경에서 패킷을 처리하는 방법 및 그 장치
JP2009278250A (ja) データ伝送装置および帯域割当方法
JPH03280644A (ja) 動的スロット割当て多重化方式
KR20060108408A (ko) 레지덴셜 이더넷 시스템에서 동기 데이터의 전송을 위한슬롯의 재조합 방법

Legal Events

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

Ref document number: 20868968

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020868968

Country of ref document: EP

Effective date: 20220330