CN117376739A - Port service mapping processing method and device, storage medium and electronic device - Google Patents
Port service mapping processing method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN117376739A CN117376739A CN202210753843.3A CN202210753843A CN117376739A CN 117376739 A CN117376739 A CN 117376739A CN 202210753843 A CN202210753843 A CN 202210753843A CN 117376739 A CN117376739 A CN 117376739A
- Authority
- CN
- China
- Prior art keywords
- osu
- port
- ports
- mapping
- target
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 111
- 238000003672 processing method Methods 0.000 title abstract description 10
- 238000000034 method Methods 0.000 claims abstract description 30
- 230000005540 biological transmission Effects 0.000 claims description 32
- 238000004590 computer program Methods 0.000 claims description 16
- 238000012545 processing Methods 0.000 claims description 10
- 230000010355 oscillation Effects 0.000 claims 1
- 230000036962 time dependent Effects 0.000 claims 1
- 230000003287 optical effect Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0064—Arbitration, scheduling or medium access control aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application provides a port service mapping processing method, a device, a storage medium and an electronic device, wherein the method comprises the following steps: grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively obtaining mapping opportunities of the multiple groups of OSU ports; determining a target service port for scheduling according to the mapping opportunities of the multiple groups of OSU ports; inserting the service or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block; the overhead of the ODUk and the OPUk is inserted into the target OPUk port to generate an ODUk frame of the ODU port corresponding to the target service port, which can solve the problem of how to multiplex the ODU port service into the ODUk frame in the related art, multiplex the OSU into the ODUk frame, and perform efficient bearing for the low-rate service, thereby ensuring quality.
Description
Technical Field
The embodiment of the application relates to the field of communication, in particular to a port service mapping processing method, a device, a storage medium and an electronic device.
Background
In order to support both services based on optical service units (Optical Service Unit, abbreviated OSU) and services based on ODUk, a metro optical transport network (Optical Transport Network, abbreviated OTN) network should support both OSU and ODUk switching, and on a core node device of the metro OTN network, OSU to other metro OTN networks needs to be multiplexed into ODUk frames.
No solution has been proposed for the problem of how to multiplex OSU port traffic into ODUk frames in the related art.
Disclosure of Invention
The embodiment of the application provides a port service mapping processing method, a device, a storage medium and an electronic device, which are used for at least solving the problem of multiplexing OSU port service into an ODUk frame in the related technology.
According to an embodiment of the present application, there is provided a port traffic mapping processing method, including:
grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively obtaining mapping opportunities of the multiple groups of OSU ports;
determining a target service port for scheduling according to the mapping opportunities of the multiple groups of OSU ports;
inserting the service or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block;
and inserting the overheads of the ODUk and the OPUk into a target OPUk port to generate an ODUk frame of the ODU port corresponding to the target service port.
According to another embodiment of the present application, there is also provided a port traffic mapping processing apparatus, including:
the acquisition module is used for grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively acquiring mapping opportunities of the multiple groups of OSU ports;
a determining module, configured to determine a target service port for scheduling according to the mapping opportunities of the multiple sets of OSU ports;
an inserting module, configured to insert a service or an IDLE frame of the target OSU port into an OPUk payload block corresponding to the target service port, to obtain a target OPUk payload block;
and the first generation module is used for inserting the overheads of the ODUk and the OPUk into a target OPUk port so as to generate an ODUk frame of the ODU port corresponding to the target service port.
According to a further embodiment of the present application, there is also provided a computer readable storage medium having stored therein a computer program, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
According to a further embodiment of the present application, there is also provided an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
In the embodiment of the application, grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively obtaining mapping opportunities of the multiple groups of OSU ports; determining a target service port for scheduling according to the mapping opportunities of the multiple groups of OSU ports; inserting the service or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block; the overhead of the ODUk and the OPUk is inserted into the target OPUk port to generate an ODUk frame of the ODU port corresponding to the target service port, which can solve the problem of how to multiplex the ODU port service into the ODUk frame in the related art, multiplex the OSU into the ODUk frame, and perform efficient bearing for the low-rate service, thereby ensuring quality.
Drawings
Fig. 1 is a hardware block diagram of a mobile terminal according to a port service mapping processing method of an embodiment of the present application;
FIG. 2 is a flow chart of a port traffic mapping processing method according to an embodiment of the present application;
fig. 3 is a flowchart of a scheduling method of multiplexing multiple OSU port maps to ODUk frames according to the present embodiment;
FIG. 4 is a flow chart of a scheduling method for multiplexing multiple OSU port maps to ODUk frames according to the present alternative embodiment;
fig. 5 is a block diagram of a port traffic mapping processing apparatus according to an embodiment of the present application.
Detailed Description
Embodiments of the present application will be described in detail below with reference to the accompanying drawings in conjunction with the embodiments.
It should be noted that the terms "first," "second," and the like in the description and claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.
The method embodiments provided in the embodiments of the present application may be performed in a mobile terminal, a computer terminal or similar computing device. Taking the example of running on a mobile terminal, fig. 1 is a block diagram of a hardware structure of the mobile terminal according to the port service mapping processing method of the embodiment of the present application, as shown in fig. 1, the mobile terminal may include one or more (only one is shown in fig. 1) processors 102 (the processors 102 may include, but are not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA) and a memory 104 for storing data, where the mobile terminal may further include a transmission device 106 for a communication function and an input/output device 108. It will be appreciated by those skilled in the art that the structure shown in fig. 1 is merely illustrative and not limiting of the structure of the mobile terminal described above. For example, the mobile terminal may also include more or fewer components than shown in fig. 1, or have a different configuration than shown in fig. 1.
The memory 104 may be used to store a computer program, for example, a software program of an application software and a module, such as a computer program corresponding to a port service mapping processing method in the embodiment of the present application, and the processor 102 executes the computer program stored in the memory 104, thereby performing various functional applications and service chain address pool slicing processing, that is, implementing the method described above. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory remotely located relative to the processor 102, which may be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 106 is arranged to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, simply referred to as NIC) that can connect to other network devices through a base station to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used to communicate with the internet wirelessly.
In this embodiment, a method for processing port service mapping running on the mobile terminal or network architecture is provided, and fig. 2 is a flowchart of the method for processing port service mapping according to an embodiment of the present application, as shown in fig. 2, where the flowchart includes the following steps:
step S202, grouping the multi-OSU ports to obtain a plurality of groups of OSU ports, and respectively obtaining mapping opportunities of the plurality of groups of OSU ports;
in this embodiment, the OSU is an improvement technology made on a short board of a conventional optical transmission network (Optical Transport Network, abbreviated as OTN) technology, which changes the characteristic that the OTN adopts a time slot partition frame structure, and adopts a more flexible Payload Block (PB) partition mode, so that efficient bearing of services with different granularity of 2M-100Gbps can be realized.
In order to support both OSU-based services and ODUk-based services, the metro OTN network should support both OSU and ODUk switching, and on the core node device of the metro OTN network, OSU to other metro OTN networks needs to be multiplexed into ODUk. Therefore, the backbone OTN network only needs to support ODUk switching, and the existing OTN network can be continued.
The OTN adopts a time slot mode to divide a frame structure, the maximum support of 80 time slots is 80 time slots, the granularity of the minimum time slot is 1.25Gbps, which indicates that the maximum service access number of the ODUk is 80, and the minimum service bandwidth of the bearing is 1.25Gbps. And the OSU technology adopts a brand new division mode, the ODUk frame is divided into a plurality of PB, and one OSU occupies one or more PB. Compared with the ODUk in the related art, the OSU can provide fine bandwidth granularity, can not depend on the traditional OTN time slot structure any more, and can effectively enhance service bearing flexibility, so that the OSU has expandability required by future network long-term evolution and matches with service grouping evolution trend.
Step S204, determining a target service port for scheduling according to mapping opportunities of a plurality of groups of OSU ports;
step S206, inserting the business or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target business port to obtain the target OPUk payload block;
in step S208, the overheads of the ODUk and the OPUk are inserted into the target OPUk port to generate an ODUk frame of the ODU port corresponding to the target service port.
In this embodiment, the step S206 may specifically include: judging whether the services of a plurality of groups of OSU ports exist or not; if the judgment result is yes, inserting the service of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block; and if the judgment result is negative, inserting the IDLE frame into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block.
In this embodiment, in step S202, the obtaining mapping opportunities of the multiple sets of OSU ports respectively may specifically include: generating a mapping opportunity counter, wherein the mapping opportunity counter can be specifically generated by adopting a sigma-delta algorithm; accumulating mapping opportunities of a plurality of groups of OSU ports through a mapping opportunity counter; the mapping opportunities for the multiple sets of OSU ports are read from the mapping opportunity counter.
In an alternative embodiment, before the step S202, the method further includes: performing time division self-oscillation on a payload block of an OPUk payload area according to a time slot table, wherein the OPUk payload area comprises a plurality of payload blocks, and further, reading the time slot table based on a time slot corresponding to the payload blocks to obtain an OPU port number, a transmission period and a service layer rate to which the time slot belongs; according to the OPU port number, the transmission period and the payload block corresponding to the time-division self-oscillation of the service layer rate on the time slot, a sigma-delta algorithm can be adopted to perform time-division self-oscillation; generating a payload block counter through a transmission period of the OPUk payload area, and counting the time-self-oscillating payload blocks through the payload block counter.
In another alternative embodiment, prior to step S204, the method further includes:
the following steps are performed for each of the multiple sets of OSU ports to determine the mapping opportunities and corresponding payload blocks for the multiple sets of OSU ports, referred to as the current OSU port set for the OSU port being executed: obtaining mapping opportunity counters and payload block counters of all OSU ports in a current OSU port group; accumulating mapping opportunities of all OSU ports in the current OSU port group according to the mapping opportunity counter, and counting payload blocks corresponding to all OSU ports in the current OSU port group according to the payload block counter; judging whether the counter value of the payload block is smaller than a transmission period; if the judgment result is yes, adding 1 to the counter value of the payload block; resetting the transmission period and setting the counter value of the payload block to 1 if the judgment result is negative, setting the mapping opportunity to 1 if the mapping opportunity is greater than 0, and setting the mapping opportunity to 0 if the mapping opportunity is equal to 0; judging whether the following formula is established: cmodP < C, where j is the payload block, C is the traffic rate of the OSU port, and P is the transmission period; if the judgment result is yes, adding 1 to the mapping opportunity; storing non-empty service queues, mapping opportunity counters M and payload block counters j of all OSU ports in the current OSU port group under the condition that the judgment result is negative but the mapping opportunity is greater than 0; and determining that the number of the current OSU port group is set to be the current OSU port group plus 1, wherein the initial value of the number of the current OSU port group is 1.
Correspondingly, the step S204 may specifically include: judging whether the number of the current OSU port group reaches the group number of a plurality of groups of OSU ports or not; if the number of the current OSU port group reaches the group number of a plurality of groups of OSU ports, and under the condition that the service queues exist in the plurality of groups of OSU ports and the mapping opportunity is greater than 0, polling out the target service ports in the plurality of groups of OSU ports or randomly selecting one target service port according to the service priority of the plurality of groups of OSU ports, and reducing the mapping opportunity of the target service ports by 1; in the case that none of the multiple sets of OSU ports has a traffic queue or mapping opportunity equal to 0, an invalid OSU port is generated.
The embodiment adopts a time division mode to realize the polling scheduling of the service queues of the multiple OSU ports and completes the filling of the payload block content of the multiport ODUk. Fig. 3 is a flowchart of a scheduling method of multiplexing multiple OSU port maps to ODUk frames according to the present embodiment, and as shown in fig. 3, includes:
step S301, adopting a sigma-delta algorithm to time-divide a self-vibration OPUk payload area according to a time slot table;
step S302, generating a payload block counter through the P value of the OPUk payload area;
step S303, a sigma-delta algorithm is adopted to generate a mapping opportunity counter, so that the mapping opportunity of the OSU port service is obtained;
step S304, judging mapping opportunity for the super-multiple OSU port service according to the service priority of the OUS port service, polling the service port to be scheduled according to the judging result, and reading the corresponding OSU port service according to the service port;
step S305, using the scheduled service port, inserting the read service frame or IDLE frame of the OSU port in the corresponding OPUk payload block;
in step S306, the overheads of the ODUk and the OPUk are inserted, and an ODUk frame of the corresponding port is generated.
The present embodiment is described in detail below with reference to 1024 (2048/4096) OSU ports and service maps multiplexed to 80 ODUk ports.
Fig. 4 is a flowchart of a scheduling method for multiplexing multiple OSU port maps to ODUk frames according to the present alternative embodiment, as shown in fig. 4, including:
s401, a self-vibrating OPUk payload area, comprising:
s4011, allocating and giving a PB block time division self-oscillating OPUk payload area according to a slot table, with initial bank_cnt=0;
s4012, bank_cnt=bank_cnt_bank_cnt+1, new PB block start, bank_cnt=0;
the rate and transmission period P values of the OPU service layers are configured, with a minimum of 1 OPU service layer and a maximum of 80 opuks (k=0, 1, 2e,3,4, flex). Based on PB block time division self-oscillation, the slot table is read, and the OPU port number, the transmission period P and the service layer rate to which the slot belongs are returned. And adopting a sigma delta algorithm to perform self-vibration OPUk payload area on the corresponding time slot. Sequentially performing bank classification on 1024 (2048/4096) OSU ports, wherein 128 (256/512) ports correspond to 1 bank, and the polling counter bank_cnt needs 8 clock cycles to finish counting 1024 (2048/4096) OSU ports;
s402, generating a payload block counter, comprising:
s4021, inquiring a mapping opportunity counter M and a payload block timer j of 128 OSU ports corresponding to a bank, wherein the OSU port number packet is expandable, and is not limited to 128, but can be 256 or 512;
s4022, judging whether j < P is true, executing S4023 if the judging result is positive, otherwise executing S2044;
s4023, the payload block timer accumulates j=j+1;
s4024, a new transmission period is reset, j=1; if M >0, m=1; else m=0;
the mapping opportunity counter M and the payload block counter j corresponding to 128 (256/512) OSU ports are selected according to the bank_cnt. 128 (256/512) OSU ports may be counted for payload blocks per clock cycle. Wherein the new transmission period is reset when OSU port j > = P, where j=1; if M >0, then m=1, reserving an opportunity to the next transmission period window, otherwise, M clear 0;
s403, generating a mapping opportunity counter, including:
step S4031, judging whether j×c mod P < C is true, if yes, executing step S4032, otherwise executing step S4033;
s4032, the mapping opportunity timer accumulates m=m+1, and then proceeds to S404;
s4033, whether M >0 is satisfied or not is determined, and if yes, the process proceeds to step S404, otherwise, the process returns to step S4022.
And simultaneously calculating mapping opportunities for 128 (256/512) OSU ports according to a sigma-delta algorithm, if j times Cmod P < C are met at the moment, adding 1 to the opportunity counter M of the OSU port, and otherwise, keeping unchanged. Meanwhile, when the value of the port M is larger than 0, a mapping opportunity is generated;
s404, polling judgment, including:
s4041, storing non-empty service queues, M and j values of all ports of the current bank;
s4042, determining whether bank_cnt=8 is satisfied, if yes, executing S4043, otherwise returning to S4012;
s4043, judging whether all service queues are non-empty, executing S4044 if the judging result is yes, otherwise executing S4052;
s4044, acquiring service priority;
s4045, selecting a target traffic port according to the traffic priority poll, and then performing S4051.
The non-empty queues of all OSU ports of the current bank are stored, a mapping opportunity counter M and a payload block counter j. When the bank_cnt=8, if a non-empty port exists in the data queue with mapping opportunity, judging priority according to OSU service type (CBR > PKT), and polling scheduling ports in 8 banks; otherwise, generating an invalid OSU port;
s405, mapping multiplexing, including:
s4051, mapping OSU frame to current payload block, m=m-1;
s4052, filling the IDLE frame;
inserting an OSU frame (data frame, maintenance status frame, PKT keep-alive frame, etc.) into the OPUk payload block when the polling port is valid, updating the M value; otherwise, inserting an OSU IDLE frame;
s406, inserting overhead, including: and inserting the overheads of the ODUk and the OPUk, and generating an ODUk frame corresponding to the ODU port.
By the embodiment, time-division polling scheduling can save hardware implementation resources, reduce complexity, realize efficient transmission from mapping multiplexing of ultra-multi-OSU port services to multi-port ODUk services, and achieve the effect of expandability of port numbers and service priorities. The method can effectively solve the problem of carrying out high-efficiency bearing on low-rate service and ensure the quality.
In an embodiment of the present application, there is further provided a port service mapping processing apparatus, and fig. 5 is a block diagram of the port service mapping processing apparatus according to an embodiment of the present application, as shown in fig. 5, where the apparatus includes:
an obtaining module 52, configured to group the multiple OSU ports to obtain multiple groups of OSU ports, and obtain mapping opportunities of the multiple groups of OSU ports respectively;
a determining module 54, configured to determine a target service port for scheduling according to the mapping opportunities of the multiple sets of OSU ports;
an inserting module 56, configured to insert a service or an IDLE frame of the target OSU port into an OPUk payload block corresponding to the target service port, to obtain a target OPUk payload block;
a first generating module 58, configured to insert the overheads of the ODUk and the OPUk into the target OPUk port, so as to generate an ODUk frame of the ODU port corresponding to the target service port.
In an embodiment, the inserting module 56 is further configured to determine whether the services of the multiple sets of OSU ports all exist; if the judgment result is yes, inserting the service of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block; and if the judgment result is negative, inserting the IDLE frame into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block.
In one embodiment, the obtaining module 52 is further configured to generate a mapping opportunity counter; counting mapping opportunities of the multiple groups of OSU ports through the mapping opportunity counter; and reading mapping opportunities of the multiple groups of OSU ports from the mapping opportunity counter.
In an embodiment, the device further comprises:
the self-oscillation module is used for carrying out time-division self-oscillation on the payload blocks of the OPUk payload area according to the time slot table, wherein the OPUk payload area comprises a plurality of payload blocks;
a second generating module, configured to generate a payload block counter through a transmission period of the OPUk payload area;
and the counting module is used for counting the payload blocks of the time-lapse self-oscillation through the payload block counter.
In an embodiment, the self-oscillation module is further configured to read a slot table based on a slot corresponding to the payload block, to obtain an OPU port number, a transmission period, and a service layer rate to which the slot belongs; and according to the OPU port number, the transmission period and the service layer rate, the payload block corresponding to the self-oscillation is time-divided on the time slot.
In an embodiment, the device further comprises:
an execution module, configured to execute the following steps for each of the multiple sets of OSU ports, to determine mapping opportunities and corresponding payload blocks for the multiple sets of OSU ports, and for an OSU port being executed, refer to a current OSU port set:
obtaining mapping opportunity counters and payload block counters of all OSU ports in a current OSU port group;
accumulating mapping opportunities of all OSU ports in the current OSU port group according to the mapping opportunity counter, and counting payload blocks corresponding to all OSU ports in the current OSU port group according to the payload block counter;
adding 1 to the counter value of the payload block under the condition that the counter value of the payload block is smaller than the transmission period;
resetting the transmission period and setting the counter value of the payload block to 1 when the timer value of the payload block is not less than the transmission period, setting the mapping opportunity to 1 when the mapping opportunity is greater than 0, and setting the mapping opportunity to 0 when the mapping opportunity is equal to 0;
judging whether the following formula is established: cmodP < C, where j is the payload block, C is the traffic rate of the OSU port, and P is the transmission period;
if the judgment result is yes, adding 1 to the mapping opportunity;
if the judgment result is negative and the mapping opportunity is greater than 0, storing non-empty service queues of all OSU ports in the current OSU port group, the mapping opportunity counter M and the payload block counter j;
and determining that the number of the current OSU port group is set to be 1 plus the current OSU port group, wherein the initial value of the number of the current OSU port group is 1.
In an embodiment, the determining module 54 is further configured to determine whether the number of the current OSU port group reaches the group number of the multiple groups of OSU ports; if the number of the current OSU port group reaches the group number of the multiple groups of OSU ports, and the mapping opportunity of the multiple groups of OSU ports is greater than 0 when service queues exist in the multiple groups of OSU ports, the target service ports are polled out of the multiple groups of OSU ports according to the service priority of the multiple groups of OSU ports, and the mapping opportunity of the target service ports is reduced by 1; and generating invalid OSU ports under the condition that no service queue exists in the plurality of groups of OSU ports or the mapping opportunity is equal to 0.
Embodiments of the present application also provide a computer readable storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
In one exemplary embodiment, the computer readable storage medium may include, but is not limited to: a usb disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing a computer program.
Embodiments of the present application also provide an electronic device comprising a memory having a computer program stored therein and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
In an exemplary embodiment, the electronic apparatus may further include a transmission device connected to the processor, and an input/output device connected to the processor.
Specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the exemplary implementation, and this embodiment is not described herein.
It will be appreciated by those skilled in the art that the modules or steps of the application described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may be implemented in program code executable by computing devices, so that they may be stored in a storage device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps of them may be fabricated into a single integrated circuit module. Thus, the present application is not limited to any specific combination of hardware and software.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the same, but rather, various modifications and variations may be made by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the principles of the present application should be included in the protection scope of the present application.
Claims (10)
1. A method for processing port traffic mapping, the method comprising:
grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively obtaining mapping opportunities of the multiple groups of OSU ports;
determining a target service port for scheduling according to the mapping opportunities of the multiple groups of OSU ports;
inserting the service or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block;
and inserting the overheads of the ODUk and the OPUk into a target OPUk port to generate an ODUk frame of the ODU port corresponding to the target service port.
2. The method of claim 1, wherein inserting the traffic or IDLE frame of the target OSU port into the OPUk payload block corresponding to the target traffic port to obtain the target OPUk payload block comprises:
judging whether the services of the multiple groups of OSU ports exist or not;
if the judgment result is yes, inserting the service of the target OSU port into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block;
and if the judgment result is negative, inserting the IDLE frame into the OPUk payload block corresponding to the target service port to obtain a target OPUk payload block.
3. The method of claim 1, wherein separately obtaining mapping opportunities for the plurality of sets of OSU ports comprises:
generating a mapping opportunity counter;
accumulating mapping opportunities of the multiple groups of OSU ports through the mapping opportunity counter;
and reading mapping opportunities of the multiple groups of OSU ports from the mapping opportunity counter.
4. The method of claim 1, wherein prior to separately acquiring the mapping opportunities for the plurality of sets of OSU ports, the method further comprises:
performing time division self-oscillation on payload blocks of an OPUk payload area according to a time slot table, wherein the OPUk payload area comprises a plurality of payload blocks;
generating a payload block counter by a transmission period of the OPUk payload area;
counting the payload blocks of the time-dependent oscillation by the payload block counter.
5. The method of claim 4, wherein time-division autovibrating the payload blocks of the OPUk payload section in accordance with the slot table comprises:
reading a time slot table based on the time slot corresponding to the payload block to obtain an OPU port number, a transmission period and a service layer rate to which the time slot belongs;
and according to the OPU port number, the transmission period and the service layer rate, the payload block corresponding to the self-oscillation is time-divided on the time slot.
6. The method of any of claims 1 to 5, wherein prior to determining a target traffic port for scheduling based on mapping opportunities for the plurality of sets of OSU ports, the method further comprises:
the following steps are performed for each of the plurality of sets of OSU ports to determine mapping opportunities and corresponding payload blocks for the plurality of sets of OSU ports, for the OSU ports being performed, referred to as the current OSU port set:
obtaining mapping opportunity counters and payload block counters of all OSU ports in a current OSU port group;
accumulating mapping opportunities of all OSU ports in the current OSU port group according to the mapping opportunity counter, and counting payload blocks corresponding to all OSU ports in the current OSU port group according to the payload block counter;
adding 1 to the counter value of the payload block under the condition that the counter value of the payload block is smaller than the transmission period;
resetting the transmission period and setting the counter value of the payload block to 1 when the timer value of the payload block is not less than the transmission period, setting the mapping opportunity to 1 when the mapping opportunity is greater than 0, and setting the mapping opportunity to 0 when the mapping opportunity is equal to 0;
judging whether the following formula is established: cmodP < C, where j is the payload block, C is the traffic rate of the OSU port, and P is the transmission period;
if the judgment result is yes, adding 1 to the mapping opportunity;
if the judgment result is negative and the mapping opportunity is greater than 0, storing non-empty service queues of all OSU ports in the current OSU port group, the mapping opportunity counter M and the payload block counter j;
and determining that the number of the current OSU port group is set to be 1 plus the current OSU port group, wherein the initial value of the number of the current OSU port group is 1.
7. The method of claim 6, wherein determining a target traffic port for scheduling based on mapping opportunities for the plurality of sets of OSU ports comprises:
judging whether the number of the current OSU port group reaches the group number of the plurality of groups of OSU ports or not;
if the number of the current OSU port group reaches the group number of the multiple groups of OSU ports, and if the multiple groups of OSU ports all have service queues and the mapping opportunity is greater than 0, polling the target service port in the multiple groups of OSU ports or randomly polling the target service port in the multiple groups of OSU ports according to the service priority of the multiple groups of OSU ports, and reducing the mapping opportunity of the target service port by 1;
and generating invalid OSU ports under the condition that no service queue exists in the plurality of groups of OSU ports or the mapping opportunity is equal to 0.
8. A port traffic mapping processing apparatus, the apparatus comprising:
the acquisition module is used for grouping the multiple OSU ports to obtain multiple groups of OSU ports, and respectively acquiring mapping opportunities of the multiple groups of OSU ports;
a determining module, configured to determine a target service port for scheduling according to the mapping opportunities of the multiple sets of OSU ports;
an inserting module, configured to insert a service or an IDLE frame of the target OSU port into an OPUk payload block corresponding to the target service port, to obtain a target OPUk payload block;
and the first generation module is used for inserting the overheads of the ODUk and the OPUk into a target OPUk port so as to generate an ODUk frame of the ODU port corresponding to the target service port.
9. A computer readable storage medium having a computer program stored therein, wherein the computer program is arranged to perform the method of any of claims 1 to 7 when run.
10. An electronic device comprising a memory in which a computer program is stored and a processor arranged to run the computer program to perform the method of any of claims 1 to 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210753843.3A CN117376739A (en) | 2022-06-29 | 2022-06-29 | Port service mapping processing method and device, storage medium and electronic device |
| PCT/CN2023/083517 WO2024001337A1 (en) | 2022-06-29 | 2023-03-23 | Port service mapping processing method and apparatus, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210753843.3A CN117376739A (en) | 2022-06-29 | 2022-06-29 | Port service mapping processing method and device, storage medium and electronic device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117376739A true CN117376739A (en) | 2024-01-09 |
Family
ID=89382684
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210753843.3A Pending CN117376739A (en) | 2022-06-29 | 2022-06-29 | Port service mapping processing method and device, storage medium and electronic device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN117376739A (en) |
| WO (1) | WO2024001337A1 (en) |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010114622A (en) * | 2008-11-06 | 2010-05-20 | Nippon Telegr & Teleph Corp <Ntt> | Optical communication system, transmitter of optical subscriber unit, receiver of optical network unit, and method for transmitting outgoing signal of optical subscriber unit |
| CN111490845B (en) * | 2019-01-28 | 2023-06-30 | 中兴通讯股份有限公司 | Method, device and system for delivering customer service |
| CN114866618A (en) * | 2019-04-30 | 2022-08-05 | 华为技术有限公司 | Data transmission method and device in optical transport network |
| CN113395613B (en) * | 2020-03-11 | 2022-08-19 | 华为技术有限公司 | Method, device and system for carrying service |
| CN114567828A (en) * | 2022-03-01 | 2022-05-31 | 北京华环电子股份有限公司 | Method, device and system for realizing cross multiplexing of OSU (open service Unit) service to OPUK (OpenUK) by FPGA (field programmable Gate array) |
-
2022
- 2022-06-29 CN CN202210753843.3A patent/CN117376739A/en active Pending
-
2023
- 2023-03-23 WO PCT/CN2023/083517 patent/WO2024001337A1/en unknown
Also Published As
| Publication number | Publication date |
|---|---|
| WO2024001337A1 (en) | 2024-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108282415B (en) | Scheduling method and device | |
| CN108632886A (en) | A kind of method for processing business and device | |
| US8914662B2 (en) | Implementing transparent clock by correcting time information carried in data using residence time information | |
| CN112154630A (en) | Shaping traffic on PLCA-supported 10SPE networks | |
| JP2014522202A (en) | Method, apparatus, and system for reconstructing and reordering packets | |
| TWI680663B (en) | Method and apparatus for client service transmission | |
| US20060274779A1 (en) | Filling token buckets of schedule entries | |
| WO2020142867A1 (en) | Traffic shaping method and related device | |
| CN109672560A (en) | Flexible ethernet management channel extended method and equipment | |
| CN110856052B (en) | Flexe implementation method and device supporting multiple granularities and electronic equipment | |
| US8929216B2 (en) | Packet scheduling method and apparatus based on fair bandwidth allocation | |
| US7565496B2 (en) | Sharing memory among multiple information channels | |
| EP3461085A1 (en) | Method and device for queue management | |
| CN117376739A (en) | Port service mapping processing method and device, storage medium and electronic device | |
| WO2023134508A1 (en) | Service processing method, apparatus and system in optical transport network | |
| CN107770875A (en) | Aeronautical Ad hoc networks hybrid MAC protocols | |
| JP6204002B2 (en) | Method and device for allocating time-frequency resources to a data packet for transmitting the data packet over a communication network, a computer program for performing such a method, and information storage for storing such a computer program Storage medium | |
| WO2020169009A1 (en) | Configuration method and device of slot container | |
| JP5924208B2 (en) | Cell multiplexing apparatus and method | |
| CN115632752A (en) | Data transmission method and device and electronic equipment | |
| CN112398753B (en) | Data transmission control method and device | |
| US7411949B2 (en) | System, method and apparatus for preparing a table for a cell scheduler | |
| CN116893983B (en) | Data caching method, device and medium | |
| WO2024007804A1 (en) | Method and apparatus for recovering bit rate of constant bit rate signal | |
| CN117896642A (en) | Scheduling method and device of OSU in OTN equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication |