CN107086968A - Traffic scheduling processing method and processing device - Google Patents
Traffic scheduling processing method and processing device Download PDFInfo
- Publication number
- CN107086968A CN107086968A CN201610084820.2A CN201610084820A CN107086968A CN 107086968 A CN107086968 A CN 107086968A CN 201610084820 A CN201610084820 A CN 201610084820A CN 107086968 A CN107086968 A CN 107086968A
- Authority
- CN
- China
- Prior art keywords
- buffer area
- priority
- client traffic
- low order
- business datum
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/722—Admission control; Resource allocation using reservation actions during connection setup at the destination endpoint, e.g. reservation of terminal resources or buffer space
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of traffic scheduling processing method and processing device, wherein, this method includes：In the case where the business datum that buffer area is stored is more than the payload area size of logical channel unit, it is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is the business datum of low order client traffic；Cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling, the problem of how selecting to be loaded into logical channel unit all the way from multichannel client traffic in correlation technique is solved, realizes and business all the way is dispatched out from multi-channel service according to the priority of buffer area.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of traffic scheduling processing method and processing device.
Background technology
When underway long haul communication, optical transfer network (Optical Transport Network, referred to as OTN)
Important role is play, its reason is that the data transmitted in optical transfer network all have specific frame structure, these frames
Number abundant Overhead is protected in structure, these Overhead are referred to as electric layer expense, and electric layer expense makes plus photosphere expense
Obtaining optical transfer network has powerful Operations, Administration and Maintenance function, and communication link and client traffic can be monitored.
Therefore, many will carry out the customer data business of middle and long distance transmission, all be to first pass through certain method in transmitting terminal to load
Enter in the particular frame format required by optical transfer network, be transmitted on the communication link, it is specific from these again in receiving terminal
Customer data business is recovered according to the method with transmitting terminal contrary in frame structure, the purpose of transmission is realized.
The specific frame structure transmitted in optical transfer network is referred to as Optical Channel Transport Unit-k (optical channel transport
Unit, referred to as OTU), Optical Channel Transport Unit-k is by Optical Channel Transport Unit-k expense and Optical Channel Data Unit-k (optical
Channel data unit, referred to as ODU) composition；Optical Channel Data Unit-k is by Optical Channel Data Unit-k expense and optical channel
Payload Unit (optical channel payload unit, referred to as OPU) is constituted；Optical channel Payload Unit is by optical channel
Payload Unit expense and optical channel Payload Unit payload composition；In transmitting terminal, various types of client traffics are all by one
Fixed method is loaded into optical channel Payload Unit payload part, and optical channel Payload Unit expense then loads client traffic loading
Enter the adjustment information carried out during optical channel Payload Unit payload and rate information, OPU expenses are formed plus OPU payloads
OPU, OPU add light plus ODU expenses formation ODU, ODU plus the formation of ODU expenses OTU, OTU
Just it can be transmitted after some expenses of layer in optical transfer network, in receiving terminal, after receiving OTN frames, according to OTU
The data of transmission are monitored with management, and therefrom OPU at recovery with ODU expenses, according to the tune in OPU expenses
Whole information and rate information recover client traffic from OPU payloads, realize transparent transmission of the client traffic in optical transfer network.
Optical transfer network standard mesh is previous have been worked out three kinds of methods client traffic has been loaded into optical channel Payload Unit payload.
First method is bit synchronous mapping code (Bit-synchronous Mapping Procedure, referred to as BMP),
Need to be consistent using client traffic speed during BMP methods and OPU speed.Second method is asynchronous mapping code
(Asynchronous Mapping Procedure, referred to as AMP), during using AMP methods, client traffic speed
With OPU speed and need not be consistent, but the difference of the two speed necessarily be within the specific limits.The third
Mapping method is general mapping code (Generic Mapping Procedure, referred to as GMP), GMP use bar
Part be have to be lower than for client traffic speed and carry its OPU speed, because GMP use conditions are loose, therefore it is used
Scope is wider, but is exactly the model split OPU payloads that GMP uses time slot there is also shortcoming, this rigid bandwidth
The problem of there is bandwidth waste in dividing mode.
Based on this, the mapping process (Frame based Mapping Procedure, referred to as FMP) based on frame is carried
Out, FMP mappings are divided OPU payloads according to the mode of logical channel unit, this to be divided into flexible-belt
Wide dividing mode, in theory logical channel unit bandwidth may be sized to it is consistent with client traffic bandwidth, improve band
Wide utilization rate.When implementing FMP mappings, multiple low order client traffics are mapped in a high-order OTN frame, low order client
Business is loaded among the logical channel unit of high-order OTN frame payload areas.One logical channel unit during mapping
A kind of low order client traffic can only be loaded, due to there are multiple low-order services, exists and how to select one from multichannel client traffic
It is not well solved also in the problem of road is loaded into logical channel unit, correlation technique.
The problem of for how to select to be loaded into logical channel unit all the way from multichannel client traffic in correlation technique, also not
Propose effective solution.
The content of the invention
It is how objective from multichannel in correlation technique at least to solve the invention provides a kind of traffic scheduling processing method and processing device
The problem of selecting to be loaded into logical channel unit all the way in the business of family.
According to an aspect of the invention, there is provided a kind of traffic scheduling processing method, including：The industry stored in buffer area
In the case that data of being engaged in are more than the payload area size of logical channel unit, it is determined that the buffer area for storing business datum
Cache priority level, wherein, the business datum be low order client traffic business datum；Adjusted according to buffer area priority
Spend cache priority level highest low order client traffic all the way.
Further, methods described also includes：Judge whether the business datum of buffer area storage is more than logical channel unit
Payload area size；In the case where judged result is no, insertion IDLE idle frames to the payload section of logical channel unit
In domain.
Further, according to buffer area priority scheduling go out cache priority level highest all the way low order client traffic include：
The buffer area of buffer area highest priority is present in the case of one, dispatches out cache priority level highest low order client all the way
Business；Buffer area highest priority buffer area exist it is multiple in the case of, from the cache priority level highest caching
The minimum low order client traffic all the way of buffer area numbering is dispatched out in area.
Further, methods described also includes：The business datum of low order client traffic is loaded into all the way described in dispatching out
The payload area of the logical channel unit of high-order ODU frames.
Further, methods described also includes：The business datum amount of buffer area according to where taking every road low order client traffic
For the buffer area where every road low order client traffic, cache priority level is set；Set not for the low order client traffic of different rates
With the buffer area priority of quantity.
Further, methods described also includes：The division interval of the cache priority level is determined in the following manner：
(p+k) * (V1/V2), wherein, V1 is the speed of low order client traffic data, and V2 is the speed of high-order ODU frames, is adjusted
The business datum that buffer area can be cached in during a kind of low order client traffic for spending highest priority is k, a logic
The payload area size of channel unit is p.
Further, the data volume of buffer area according to where taking every road low order client traffic is every road low order client traffic institute
Buffer area set priority include：In n<In the case of m, when the business datum in buffer area is equal to p, if
First grade is put, when the business datum in buffer area is equal to or more than [p+ (a-1) * (p+k) * (V1/V2)], is set
A-th of grade, wherein, a is more than 1, after a priority levels are set, and increases on a priority levels
Plus equal to or more than (p+k) * (V1/V2) cache size；Or, in n>In the case of m, when the business in buffer area
When data are equal to k, the priority of first grade is set, when the data in buffer area are equal to or more than [k+ (a-1)
(p+k) * (V1/V2)] when, the priority of a-th of grade is set, after a priority levels are set, in a
Cache size of the increase equal to or more than (p+k) * (V1/V2) on priority level；Wherein, it is preferential according to the buffer area
Level dispatches out cache priority level highest, and clock cycle number used in low order client traffic is n all the way, described in dispatching out
The business datum of buffer area where low order client traffic is loaded into the payload section of the logical channel unit of high-order ODU frames all the way
Clock cycle number used in domain is m.
Further, for low order client traffic speed it is different in the case of, the corresponding buffer area of all low order client traffics
During priority level highest, the priority of buffer area priority is identical, the priority of other levels of caches area priority according to
The mode alignd during priority level highest is corresponded.
According to another aspect of the present invention, a kind of traffic scheduling processing unit is additionally provided, including：Determining module, is used for
In the case where the business datum that buffer area is stored is more than the payload area size of logical channel unit, it is determined that for storing
The cache priority level of the buffer area of business datum, wherein, the business datum is the business datum of low order client traffic；Adjust
Module is spent, cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling.
Further, scheduler module includes：First scheduling unit, for the buffer area presence in buffer area highest priority
In the case of one, cache priority level highest low order client traffic all the way is dispatched out；Second scheduling unit, for slow
Deposit area's highest priority buffer area exist it is multiple in the case of, from the cache priority level highest buffer area in dispatch out
The minimum low order client traffic all the way of buffer area numbering.
Further, described device also includes：Loading module, for low order client traffic all the way described in dispatching out
Business datum is loaded into the payload area of the logical channel unit of high-order ODU frames.
Further, described device also includes：First setup module, for according to where being taken per road low order client traffic
Buffer area where the business datum Liang Weimei roads low order client traffic of buffer area sets cache priority level；Second setup module,
The buffer area priority of varying number is set for the low order client traffic for different rates.
By the present invention, the feelings of the payload area size of logical channel unit are more than using the business datum stored in buffer area
Under condition, it is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is low order visitor
The business datum of family business；Cache priority level highest low order client traffic, solution all the way are gone out according to buffer area priority scheduling
The problem of how selecting to be loaded into logical channel unit all the way from multichannel client traffic in correlation technique of having determined, realizes root
Business all the way is dispatched out from multi-channel service according to the priority of buffer area.
Brief description of the drawings
Accompanying drawing described herein is used for providing a further understanding of the present invention, constitutes the part of the application, the present invention
Schematic description and description be used for explain the present invention, do not constitute inappropriate limitation of the present invention.In the accompanying drawings：
Fig. 1 is the flow chart of traffic scheduling processing method according to embodiments of the present invention；
Fig. 2 is the block diagram of traffic scheduling processing unit according to embodiments of the present invention；
Fig. 3 is the block diagram one of traffic scheduling processing unit according to the preferred embodiment of the invention；
Fig. 4 is the block diagram two of traffic scheduling processing unit according to the preferred embodiment of the invention；
Fig. 5 is the block diagram three of traffic scheduling processing unit according to the preferred embodiment of the invention；
Fig. 6 is the schematic diagram that priority level in varied situations according to embodiments of the present invention is divided；
Fig. 7 is the flow chart for proposing dispatching method according to embodiments of the present invention.
Embodiment
Describe the present invention in detail below with reference to accompanying drawing and in conjunction with the embodiments.It should be noted that in the feelings not conflicted
Under condition, the feature in embodiment and embodiment in the application can be mutually combined.
The embodiments of the invention provide a kind of traffic scheduling processing method, Fig. 1 is traffic scheduling according to embodiments of the present invention
The flow chart of processing method, as shown in figure 1, including：
Step S102, in the case where the business datum that buffer area is stored is more than the payload area size of logical channel unit,
It is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is low order client traffic
Business datum；
Step S104, cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling.
By above-mentioned steps, the business datum stored in buffer area is more than the situation of the payload area size of logical channel unit
Under, it is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is low order client's industry
The business datum of business；Cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling, solved
The problem of how selecting to be loaded into logical channel unit all the way from multichannel client traffic in correlation technique, realizes according to slow
The priority for depositing area dispatches out business all the way from multi-channel service.
Further, this method also includes：Judge whether the business datum of buffer area storage is more than the net of logical channel unit
Lotus area size；In the case where judged result is no, the payload area of insertion IDLE idle frames to logical channel unit
In.
Further, according to buffer area priority scheduling go out cache priority level highest all the way low order client traffic include：
The buffer area of buffer area highest priority is present in the case of one, dispatches out cache priority level highest low order client all the way
Business；Buffer area highest priority buffer area exist it is multiple in the case of, from the cache priority level highest buffer area
It is middle to dispatch out the minimum low order client traffic all the way of buffer area numbering.
Further, this method also includes：The business datum of the low order client traffic all the way dispatched out is loaded into high-order
The payload area of the logical channel unit of ODU frames.
Further, this method also includes：The business datum amount of buffer area is according to where taking every road low order client traffic
Cache priority level is set per the buffer area where the low order client traffic of road；Set different for the low order client traffic of different rates
The buffer area priority of quantity.
Further, this method also includes：The division interval of cache priority level is determined in the following manner：(p+k)*(V1/
V2), wherein, V1 be low order client traffic data speed, V2 be high-order ODU frames speed, dispatch out priority
The business datum that can cache of buffer area is k in during a kind of low order client traffic of highest, logical channel unit
Payload area size is p.
Further, the data volume of buffer area according to where taking every road low order client traffic is every road low order client traffic institute
Buffer area set priority include：In n<In the case of m, when the business datum in buffer area is equal to p, if
First grade is put, when the business datum in buffer area is equal to or more than [p+ (a-1) * (p+k) * (V1/V2)], is set
A-th of grade, wherein, a is more than 1, after a priority levels are set, and increases on a priority levels
Equal to or more than (p+k) * (V1/V2) cache size；Or, in n>In the case of m, when the business number in buffer area
During according to equal to k, the priority of first grade is set, when the data in buffer area are equal to or more than [k+ (a-1)
(p+k) * (V1/V2)] when, the priority of a-th of grade is set, it is excellent in a after a priority levels are set
Cache size of the increase equal to or more than (p+k) * (V1/V2) in first level grade；Wherein, according to the buffer area priority
Dispatch out cache priority level highest all the way clock cycle number used in low order client traffic be n, by dispatch out this all the way
The business datum of buffer area is loaded into the payload area institute of the logical channel unit of high-order ODU frames where low order client traffic
Clock cycle number is m.
Further, for low order client traffic speed it is different in the case of, the corresponding buffer area of all low order client traffics
During priority level highest, the priority of buffer area priority is identical, the priority of other levels of caches area priority according to
The mode alignd during priority level highest is corresponded.
The embodiment of the present invention additionally provides a kind of traffic scheduling processing unit, and Fig. 2 is that business according to embodiments of the present invention is adjusted
The block diagram of processing unit is spent, as shown in Fig. 2 including：
Determining module 22, the business datum for being stored in buffer area is more than the feelings of the payload area size of logical channel unit
Under condition, it is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is low order client
The business datum of business；
Scheduler module 24, cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling.
Fig. 3 is the block diagram one of traffic scheduling processing unit according to the preferred embodiment of the invention, as shown in figure 3, scheduling mould
Block 24 includes：
First scheduling unit 32, in the case of having one in the buffer area of buffer area highest priority, dispatches out slow
Deposit the low order client traffic all the way of highest priority；
Second scheduling unit 34, for the buffer area of buffer area highest priority exist it is multiple in the case of, from the caching
The minimum low order client traffic all the way of buffer area numbering is dispatched out in the buffer area of highest priority.
Fig. 4 is the block diagram two of traffic scheduling processing unit according to the preferred embodiment of the invention, as shown in figure 4, the device
Also include：
Loading module 42, for the business datum of the low order client traffic all the way dispatched out to be loaded into high-order ODU frames
Logical channel unit payload area.
Fig. 5 is the block diagram three of traffic scheduling processing unit according to the preferred embodiment of the invention, as shown in figure 5, the device
Also include：
First setup module 52, the business datum Liang Weimei roads for the buffer area according to where being taken per road low order client traffic
Buffer area where low order client traffic sets cache priority level；
Second setup module 54, the buffer area priority of varying number is set for the low order client traffic for different rates.
The embodiment of the present invention is further described with reference to specific embodiment.
Client traffic (corresponding to above-mentioned low order client traffic) is in transmitting procedure, it is necessary to which OTN frames are carried, in reality
When applying the FMP mappings of logic-based channel unit, the payload area of high-order OTN frames (servicing layer service) is divided
For multiple logical channel units, low order client traffic is loaded into one or more logical channel list in high-order OTN frames
In member.Need to open up buffer area when implementing to cache multichannel client traffic, the present invention provides a kind of client traffic to patrolling
Collect the dispatching method of channel unit, when logical channel unit needs loading data, the buffer area according to shared by client traffic
Full degree, selected from multichannel client traffic all the way client traffic be loaded into logical channel unit payload region, pass through
This method can be economized on resources with the less size that buffer area is opened up for client traffic.
When logical channel unit carries out the preparation of loading data in high-order OTN frames, detect that each road client traffic takes slow
The business datum that area is filled is deposited, when the data that client traffic buffer area is stored are net more than or equal to a logical channel unit
During lotus area size, the data in buffer area are just loaded into logical channel unit payload region, this is client traffic to logic
The basic principle of channel unit dispatching method.Dispatching method basic principle is met due to there are multiple buffer area data storages
Situation, and can only once select the data of client traffic all the way to load a logical channel unit payload region, therefore design
Dispatching method need on the basis of basic principle, increase extra alternative condition.Taken according to every road client traffic slow
Deposit area fill data number, be that the buffer area where every road client traffic sets multilevel precedence, buffer area fills number
According to more, the higher grade of priority, and priority is also higher.Preferentially by buffer area where priority highest client traffic
Data be fitted into logical channel unit payload, it is preferential by buffer area where high-speed client traffic if priority is identical
Data be fitted into logical channel unit payload.Can be not synchronized according to actual conditions to reduce the size of buffer area
Rate client traffic sets the priority level of varying number.
When implementing FMP mappings, all client traffics are first kept among respective buffer area first, once only
Client traffic is loaded into a logical channel unit payload region all the way for energy selection.Picked out from all buffer areas slow
The more buffer area of deposit data, the data in the buffer area are fitted into logical channel unit payload.When actually realizing,
The number that buffer area fills data is characterized by setting multilevel precedence, when the data in buffer area reach certain amount,
The priority of one grade is set, when reaching the priority of first grade on the basis of buffer area institute data storage quantity,
When being stored in the again many certain amounts of data of buffer area, the priority of second grade is set, due to reaching second etc.
Data when data are more than the priority for reaching first grade in buffer area during the priority of level in buffer area, it is corresponding excellent
First weigh also higher.
The number of levels of buffer area priority can be set according to the actual conditions of client traffic and service layer service, be existed slow
Deposit the inconsistent situation of the quantity of area's priority level.The comparison of priority level is carried out for convenience, provides all clients
During the corresponding buffer area priority level highest of business, its priority is consistent, the priority of other level priorities then according to
The mode alignd during priority level highest is corresponded.Such as, the buffer area for being client traffic A is there is provided 3 preferential
Level grade, priority order 3>2>1, it is client traffic B buffer area there is provided 5 priority levels, priority is suitable
Sequence 5>4>3>2>1, when the corresponding buffer areas of client traffic A buffer area corresponding with client traffic B carries out priority etc.
When level compares, it then follows during grade highest, the consistent principle of priority, and according to progress alignment ratio in the case of grade highest
Compared with the priority of other level priorities.I.e. the priority level 5 of client traffic B buffer areas is cached with client traffic A
The priority of area's priority level 3 is consistent, and the rest may be inferred, priority level 4 and the client's industry of client traffic B buffer areas
The priority of business A buffer areas priority level 2 is consistent, priority level 3 and the client's industry of client traffic B buffer areas
The priority of business A buffer areas priority level 1 is consistent, and the priority of client traffic A buffer areas priority level 1 is big
In the priority of the priority level 1 and 2 of client traffic B buffer areas.
Assuming that being selected according to buffering area priority and client traffic speed in logical channel unit payload region to be put into
Clock cycle number used in client traffic is n (implementing the clock cycle used in dispatching method), by the data in buffer area
It is m to fill clock cycle number used in a logical channel unit payload region.Cached in during traffic control method
The data of Qu Suoneng cachings are k (n* data/address bus bit wide), and a logical channel unit payload area size is p (m*
Data/address bus bit wide), when handling some buffer area data, client traffic is stored in the data of another buffer area most
Mostly (p+k), therefore by a logical channel unit payload region p plus interior buffer area institute energy during traffic control method
The data k of caching is divided multiplied by client rate and the ratio of service layer's speed as client traffic buffer area priority level
Interval, at equal intervals can also be slightly larger than this value to facilitate hardware to realize when actually realizing.For different situations
Lower buffer area priority equivalent partition, Fig. 6 is that priority level in varied situations according to embodiments of the present invention is divided
Schematic diagram, as shown in fig. 6, when n and m size cases are inconsistent, carrying out having certain area during priority level setting
Not.
If n<M, i.e., the clock cycle is less than one logical channel unit payload area of loading and made used in traffic control method
Clock cycle, when the data in buffer area are equal to a logical channel unit payload area size p, set first
The priority of individual grade, when the data in buffer area are equal or slightly larger than [p+ (p+k) * (client rate/service layer's speed)],
The priority of second grade is set, when the data in buffer area are equal or slightly larger than [p+2* (p+k) * (client rates/service
Layer speed)] when, the priority of Three Estate is set, and the rest may be inferred sets the priority level quantity needed, set
After highest priority level, it is still necessary on this basis plus (p+k) * (client rate/service layer's speed) or slightly larger than the value
Cache size.When setting a priority level, often cache size required for road client traffic etc. or it is slightly larger than
[p+a* (p+k) * (client rate/service layer's speed)].
If n>M, i.e., the clock cycle is more than one logical channel unit payload area of loading and made used in traffic control method
Clock cycle, during the data k that interior buffer area can be cached during the data in buffer area are equal to traffic control method,
The priority of first grade is set, when the data in buffer area are equal or slightly larger than [k+ (p+k) * (client rates/service layer
Speed)] when, the priority of second grade is set, when the data in buffer area are equal or slightly larger than [k+2* (p+k) * (clients
Speed/service layer's speed)] when, the priority of Three Estate is set, and the rest may be inferred sets the priority level quantity needed,
After highest priority level is asked in setting, it is still necessary on this basis plus (p+k) * (client rate/service layer's speed) or slightly
More than the cache size of the value.When setting a priority level, it is equal to per the cache size required for the client traffic of road
Or slightly larger than [k+a* (p+k) * (client rate/service layer's speed)].
Fig. 7 is the flow chart for proposing dispatching method according to embodiments of the present invention, as shown in fig. 7, comprises following steps：
Step S702, service layer needs to send data；
Step S704, determines whether that buffer area data are more than logical channel unit payload pThe feelings for being no in judged result
Under condition, step S706 is performed, in the case where the judgment result is yes, step S708 is performed；
Step S706, inserts IDLE frames；
Step S708, judges the buffer area quantity more than logical channel unit payload p more than oneIt is in judged result
In the case of no, step S710 is performed, in the case where the judgment result is yes, step S712 is performed；
Step S710, chooses the buffer area that only one data storage is more than p；
Step S712, compares the priority of these buffer areas；
Step S714, judges priority identical buffer area quantity more than oneIn the case where judged result is no,
Step S716 is performed, in the case where the judgment result is yes, step S718 is performed；
Step S716, chooses only one and has top-priority buffer area；
Step S718, selection buffer area numbering minimum.
Below for buffer area priority equivalent partition under different situations, the embodiment of the present invention is entered to advance with specific embodiment
One step explanation.
Embodiment one
10 road ODU2 are mapped to OPU4 by way of FMP, wherein an important step is will by dispatching method
Different business is loaded into the payload area of logical channel unit.When actually realizing, bit wide is 40 bytes, and logic is led to
Road unit payload region is 475 bytes.In such cases, the clock cycle used in traffic control method is less than loading one and patrolled
Collect the clock cycle used in channel unit payload area.
Step 1.1, it is 10 10 buffer areas of road ODU2 traffic assignments, and gives each buffer area numbering.Due to this 10
Road service rate is identical, is data between the priority that each buffer area sets 3 grades, the priority of each grade
Difference is (480+4*40) * (10/100)=64 byte.When the data of buffer area are equal to 480 byte, first etc. is set
The priority of level, is represented with S1；When the data of buffer area are equal to 480+64=544 bytes, second grade of setting
Priority, is represented with S2；When the data of buffer area are equal to 480+2*64=608 bytes, the excellent of Three Estate is set
First level, is represented with S3；The capacity of each buffer area is 480+3*64=672 bytes.Precedence level code order is S3S2S1,
S3 is a high position, and S1 is low level, reaches corresponding priority level, then related home position 1, otherwise sets to 0.It can press
These three binary numbers are switched into decimal number according to coded sequence, referred to as priority value, conveniently compared.
Step 1.2, when the logical channel unit in OPU4 is ready to that data can be filled, 10 ODU2 are detected
Buffer area, determine whether the data of cache bank memories storage more than 475 bytes, if nothing, insertion IDLE frames are to logic
In channel unit payload, return to step 1.2；If so, performing step 1.3.
Step 1.3, the data of only one of which cache bank memories storage are judged whether more than 475 bytes, if so, this is cached
Data in area are fitted into the payload area of logical channel unit, return to step 1.2；If it is not, performing step 1.4.
Step 1.4, detect the priority of these buffer areas and compare these buffer area priority values, judge whether only have
The priority value of one buffer area is maximum, if so, the data in the buffer area to be loaded to the payload section of logical channel unit
In domain, return to step 1.2；If it is not, performing step 1.5.
Step 1.5, the minimum buffer area of buffer area numbering is chosen, and data therein are loaded into the net of logical channel unit
In lotus region, return to step 1.2.
Embodiment two
By 2 road ODU4,4 road ODU3,4 road ODU2, OPUC4 is mapped to by way of FMP, wherein heavy
The step wanted is the payload area that different business is loaded into logical channel unit by dispatching method.In this case,
Bit wide is 160 bytes, and logical channel unit payload region is 475 bytes, and the clock cycle used in traffic control method is more than
Load the clock cycle used in a logical channel unit payload region.Dispatching method flow chart is as shown in fig. 7, specific implementation
Process is as follows：
Step 2.1, it is that 10 road client traffics distribute 10 buffer areas, and gives each buffer area numbering.Due to this 10 tunnel
Client traffic speed is different, is that the buffer area of different rates sets the priority of different number grades.For ODU4 business
Buffer area sets the difference of data between the priority of 5 grades, the priority of each grade to be (480+4*160)
* the byte of (100/400)=280, when the data of buffer area are equal to 640 byte, set the priority of first grade, uses
A1 is represented；When the data of buffer area are equal to 640+280=920 bytes, the priority of second grade is set, A2 is used
Represent；When the data of buffer area are equal to 640+2*280=1200 bytes, the priority of Three Estate is set, A3 is used
Represent；When the data of buffer area are equal to 640+3*280=1480 bytes, the priority of the 4th grade is set, A4 is used
Represent；When the data of buffer area are equal to 640+4*280=1760 bytes, the priority of the 5th grade is set, A5 is used
Represent；The capacity of each buffer area is 640+5*280=2040 bytes.Precedence level code order is A5A4A3A2A1,
A5 is a high position, and A1 is low level, reaches corresponding priority level, then related home position 1, otherwise sets to 0.Can
These three binary numbers are switched into decimal number according to coded sequence, referred to as priority value, conveniently compared.
For the buffer area of ODU3 business, the difference of data between the priority of 4 grades, the priority of each grade is set
For (480+4*160) * (40/400)=112 byte, set according to the above method, the capacity of ODU3 buffer areas is
640+4*112=1088 bytes, coded sequence is B4B3B2B1.For the buffer area of ODU2 business, 3 grades are set
Priority, the difference of data is (480+4*160) * (10/400)=28 byte between the priority of each grade, according to
The above method is set, and the capacity of ODU2 buffer areas is 640+3*28=724 bytes, and coded sequence is C3C2C1.
Wherein, A5, B4 are identical with C3 priority, will add one 1 behind ODU3 coding more respectively for convenience,
Add two 1 formation 5bit value behind ODU2 coding, be converted to metric priority value.
Step 2.2, when the logical channel unit in OPUC4 is ready to that data can be filled, 10 cachings are detected
Area, determines whether the data of cache bank memories storage more than 475 bytes, if nothing, insertion IDLE frames to logical channel list
In first payload, return to step 2.2；If so, performing step 2.3.
Step 2.3, the data of only one of which cache bank memories storage are judged whether more than 475 bytes, if so, this is cached
Data in area are fitted into the payload area of logical channel unit, return to step 2.2；If it is not, performing step 2.4.
Step 2.4, detect the priority of these buffer areas and compare these buffer area priority values, judge whether only have
The priority value of one buffer area is maximum, if so, the data in the buffer area to be loaded to the payload section of logical channel unit
In domain, return to step 2.2；If it is not, performing step 2.5.
Step 2.5, the minimum buffer area of buffer area numbering is chosen, and data therein are loaded into the net of logical channel unit
In lotus region, return to step 2.2.
Above-described embodiment, the data volume stored according to buffer area carries out the division of priority level, and to not synchronized
The client traffic of rate divides the priority level of varying number, realizes the preferential caching more by client traffic data are stored
Area's data are put among the logical channel unit payload region of high-order OTN frames, it is possible to reduce be to be opened up per road client traffic
Buffer size.
Obviously, those skilled in the art should be understood that above-mentioned each module of the invention or each step can be with general
Computing device realizes that they can be concentrated on single computing device, or is distributed in multiple computing devices and is constituted
Network on, alternatively, the program code that they can be can perform with computing device be realized, it is thus possible to by they
Storage is performed by computing device in the storage device, and in some cases, can be to be held different from order herein
They, are either fabricated to each integrated circuit modules or will be many in them by the shown or described step of row respectively
Individual module or step are fabricated to single integrated circuit module to realize.So, the present invention is not restricted to any specific hardware
Combined with software.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the invention, for the technology of this area
For personnel, the present invention can have various modifications and variations.Within the spirit and principles of the invention, that is made is any
Modification, equivalent substitution, improvement etc., should be included in the scope of the protection.
Claims (12)
1. a kind of traffic scheduling processing method, it is characterised in that including：
In the case where the business datum that buffer area is stored is more than the payload area size of logical channel unit, it is determined that with
In the cache priority level for the buffer area for storing business datum, wherein, the business datum is low order client traffic
Business datum；
Cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling.
2. according to the method described in claim 1, it is characterised in that methods described also includes：
Judge whether the business datum of buffer area storage is more than the payload area size of logical channel unit；
In the case where judged result is no, insertion IDLE idle frames are into the payload area of logical channel unit.
3. according to the method described in claim 1, it is characterised in that cache priority level is gone out most according to buffer area priority scheduling
The high client traffic of low order all the way includes：
Exist in the buffer area of buffer area highest priority in the case of one, dispatch out cache priority level highest one
Road low order client traffic；
Buffer area highest priority buffer area exist it is multiple in the case of, from the cache priority level highest delay
Deposit and the minimum low order client traffic all the way of buffer area numbering is dispatched out in area.
4. according to the method described in claim 1, it is characterised in that methods described also includes：
The business datum of low order client traffic is loaded into high rank optical channel data unit all the way described in dispatching out
The payload area of the logical channel unit of ODU frames.
5. according to the method described in claim 1, it is characterised in that methods described also includes：
The business datum Liang Weimei roads low order client traffic institute of buffer area according to where taking every road low order client traffic
Buffer area set cache priority level；
For the low order client traffic of different rates, the buffer area priority of varying number is set.
6. method according to claim 5, it is characterised in that methods described also includes：
The division interval of the cache priority level is determined in the following manner：(p+k) * (V1/V2), wherein, V1 is
The speed of low order client traffic data, V2 is the speed of high-order ODU frames, dispatches out a kind of low of highest priority
The business datum that buffer area can be cached in during rank client traffic is k, the payload area of a logical channel unit
Size is p.
7. method according to claim 6, it is characterised in that the buffer area according to where taking every road low order client traffic
Data volume be that buffer area where per road low order client traffic sets priority to include：
In n<In the case of m, when the business datum in buffer area is equal to p, first grade is set, when slow
When depositing the business datum in area equal to or more than [p+ (a-1) * (p+k) * (V1/V2)], a-th of grade is set, wherein,
A is more than 1, after a priority levels are set, increases on a priority levels and is equal to or more than
(p+k) * (V1/V2) cache size；Or,
In n>In the case of m, when the business datum in buffer area is equal to k, the preferential of first grade is set
Level, when the data in buffer area are equal to or more than [k+ (a-1) (p+k) * (V1/V2)], sets the excellent of a-th grade
First level, after a priority levels are set, increases on a priority levels and is equal to or more than
(p+k) * (V1/V2) cache size；
Wherein, according to used in the buffer area priority scheduling goes out cache priority level highest low order client traffic all the way
Clock cycle number is n, will dispatch out described in the business datum of buffer area where low order client traffic all the way load
It is m to the clock cycle number used in the payload area of the logical channel unit of high-order ODU frames.
8. method according to any one of claim 1 to 7, it is characterised in that for low order client traffic speed not
With in the case of, during the corresponding buffer area priority level highest of all low order client traffics, buffer area priority
Priority is identical, the priority of other levels of caches area priority alignd when priority level highest in the way of one
One correspondence.
9. a kind of traffic scheduling processing unit, it is characterised in that including：
Determining module, the business datum for being stored in buffer area is more than the payload area size of logical channel unit
In the case of, it is determined that the cache priority level of the buffer area for storing business datum, wherein, the business datum is
The business datum of low order client traffic；
Scheduler module, cache priority level highest low order client traffic all the way is gone out according to buffer area priority scheduling.
10. device according to claim 9, it is characterised in that scheduler module includes：
First scheduling unit, in the case of having one in the buffer area of buffer area highest priority, is dispatched out
Cache priority level highest low order client traffic all the way；
Second scheduling unit, for the buffer area of buffer area highest priority exist it is multiple in the case of, from described
The minimum low order client traffic all the way of buffer area numbering is dispatched out in cache priority level highest buffer area.
11. device according to claim 9, it is characterised in that described device also includes：
Loading module, for the business datum of low order client traffic to be loaded into high-order light and led to all the way described in dispatching out
The payload area of the logical channel unit of track data unit ODU frames.
12. device according to claim 9, it is characterised in that described device also includes：
First setup module, the business datum amount for the buffer area according to where being taken per road low order client traffic is every
Buffer area where the low order client traffic of road sets cache priority level；
Second setup module, the buffer area priority of varying number is set for the low order client traffic for different rates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610084820.2A CN107086968B (en) | 2016-02-14 | 2016-02-14 | Service scheduling processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610084820.2A CN107086968B (en) | 2016-02-14 | 2016-02-14 | Service scheduling processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107086968A true CN107086968A (en) | 2017-08-22 |
| CN107086968B CN107086968B (en) | 2022-04-08 |
Family
ID=59614007
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610084820.2A Active CN107086968B (en) | 2016-02-14 | 2016-02-14 | Service scheduling processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107086968B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113076061A (en) * | 2021-03-18 | 2021-07-06 | 四川和芯微电子股份有限公司 | Single RAM multi-module data caching method |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1773898A (en) * | 2004-11-12 | 2006-05-17 | 阿尔卡特公司 | Method and apparatus for transporting a client layer signal over an optical transport network (OTN) |
| CN1972243A (en) * | 2005-11-25 | 2007-05-30 | 北京邮电大学 | A method for implementing differentiation of service levels based on GFP |
| CN101155006A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method and apparatus for fixed velocity service transmission |
| CN101674218A (en) * | 2008-09-09 | 2010-03-17 | 华为技术有限公司 | Method and device for intercommunicating optical transport networks |
| EP2178234A1 (en) * | 2008-06-26 | 2010-04-21 | Huawei Technologies Co., Ltd. | Method, apparatus and system for transmitting and receiving client signals |
| CN101729373A (en) * | 2008-10-29 | 2010-06-09 | 阿尔卡特朗讯 | Method and device for dispatching multipriority traffic |
| CN101800614A (en) * | 2009-02-05 | 2010-08-11 | 华为技术有限公司 | Universal mapping and demapping method and device in optical transport network |
| US20120082455A1 (en) * | 2010-10-05 | 2012-04-05 | Bardalai Snigdho C | TE-Link Bandwidth Model for ODU Switch Capable OTN Interfaces |
| CN103299562A (en) * | 2010-12-10 | 2013-09-11 | 日本电信电话株式会社 | Client signal mapping circuit and mapping method |
| JP2013197719A (en) * | 2012-03-16 | 2013-09-30 | Nec Corp | Device, system and method for radio communication |
| CN103441930A (en) * | 2013-08-21 | 2013-12-11 | 杭州华三通信技术有限公司 | MPLS TE packet forwarding and management method and device |
| CN103561359A (en) * | 2013-10-22 | 2014-02-05 | 华为技术有限公司 | Multiple connection method and device for optical channel data unit |
| CN104486078A (en) * | 2014-12-01 | 2015-04-01 | 北京成众志科技有限公司 | Information multi-stage anti-fake coding and authentication method |
-
2016
- 2016-02-14 CN CN201610084820.2A patent/CN107086968B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1773898A (en) * | 2004-11-12 | 2006-05-17 | 阿尔卡特公司 | Method and apparatus for transporting a client layer signal over an optical transport network (OTN) |
| CN1972243A (en) * | 2005-11-25 | 2007-05-30 | 北京邮电大学 | A method for implementing differentiation of service levels based on GFP |
| CN101155006A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method and apparatus for fixed velocity service transmission |
| EP2178234A1 (en) * | 2008-06-26 | 2010-04-21 | Huawei Technologies Co., Ltd. | Method, apparatus and system for transmitting and receiving client signals |
| CN101674218A (en) * | 2008-09-09 | 2010-03-17 | 华为技术有限公司 | Method and device for intercommunicating optical transport networks |
| CN101729373A (en) * | 2008-10-29 | 2010-06-09 | 阿尔卡特朗讯 | Method and device for dispatching multipriority traffic |
| CN101800614A (en) * | 2009-02-05 | 2010-08-11 | 华为技术有限公司 | Universal mapping and demapping method and device in optical transport network |
| US20120082455A1 (en) * | 2010-10-05 | 2012-04-05 | Bardalai Snigdho C | TE-Link Bandwidth Model for ODU Switch Capable OTN Interfaces |
| CN103299562A (en) * | 2010-12-10 | 2013-09-11 | 日本电信电话株式会社 | Client signal mapping circuit and mapping method |
| JP2013197719A (en) * | 2012-03-16 | 2013-09-30 | Nec Corp | Device, system and method for radio communication |
| CN103441930A (en) * | 2013-08-21 | 2013-12-11 | 杭州华三通信技术有限公司 | MPLS TE packet forwarding and management method and device |
| CN103561359A (en) * | 2013-10-22 | 2014-02-05 | 华为技术有限公司 | Multiple connection method and device for optical channel data unit |
| CN104486078A (en) * | 2014-12-01 | 2015-04-01 | 北京成众志科技有限公司 | Information multi-stage anti-fake coding and authentication method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113076061A (en) * | 2021-03-18 | 2021-07-06 | 四川和芯微电子股份有限公司 | Single RAM multi-module data caching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107086968B (en) | 2022-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101291179B (en) | Customer signal transmission method in optical transmitting network and related equipment | |
| CN107566074B (en) | The method and transmission equipment of client signal are transmitted in optical transfer network | |
| CN109478941B (en) | Method and device for transmitting and receiving multiple paths of services | |
| CN105451102B (en) | A kind of method, apparatus and system handling signal | |
| CN102204208B (en) | Lossless adjustment method of oduflex channel bandwidth and oduflex channel | |
| CN102215153B (en) | Bandwidth control method and communication node | |
| CN103533464B (en) | Migrate method and the communication node of data | |
| CN109981209A (en) | Business sending, receiving method and device in optical transfer network | |
| CN101873517B (en) | Signal transmission method, device and communication system for optical transport network | |
| CN101800912A (en) | Method and device for mapping and demapping client signal | |
| CN101536369B (en) | Method and device for supporting optical transmission network service dispatch in optical synchronization network | |
| CN102246434A (en) | Generic mapping procedure (GMP) mapping method, de-mapping method and device thereof | |
| CN101610430B (en) | Method and device for realizing cross scheduling of ODUk | |
| CN110649986B (en) | Service transmission method, device, equipment and storage medium using flexible optical network | |
| CN103825668A (en) | Generic mapping procedure (GMP) mapping method, demapping method and device | |
| CN109391370B (en) | Transmission rate adjusting method in optical transmission network and network equipment | |
| CN103840878B (en) | OTN equipment is based on the electric cross-capacity test macro of ODU0/1 particle and method | |
| CN107040314A (en) | A kind of method and device of business transmission | |
| CN101252403B (en) | Realizing method of traffic transmission in light transmitted network | |
| US20090310486A1 (en) | Network data transport multiplexer bus with global and local optimization of capacity allocation | |
| CN105577319A (en) | Signal transmitting and receiving methods of optical channel transmission unit and devices | |
| CN107086968A (en) | Traffic scheduling processing method and processing device | |
| CN102594648B (en) | Service scheduling method and apparatus | |
| CN102098595B (en) | Customer signal transmitting method in optical transport network and related equipment | |
| CN101834662A (en) | Communication system, monitoring device and network monitoring method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |