CN108418649A - A kind of method and apparatus calculating service delay - Google Patents
A kind of method and apparatus calculating service delay Download PDFInfo
- Publication number
- CN108418649A CN108418649A CN201810151486.7A CN201810151486A CN108418649A CN 108418649 A CN108418649 A CN 108418649A CN 201810151486 A CN201810151486 A CN 201810151486A CN 108418649 A CN108418649 A CN 108418649A
- Authority
- CN
- China
- Prior art keywords
- business
- multiplex section
- computing device
- time delay
- multiplex
- 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
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0201—Add-and-drop multiplexing
- H04J14/0202—Arrangements therefor
- H04J14/021—Reconfigurable arrangements, e.g. reconfigurable optical add/drop multiplexers [ROADM] or tunable optical add/drop multiplexers [TOADM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- 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/0005—Switch and router aspects
-
- 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/0005—Switch and router aspects
- H04Q2011/0007—Construction
- H04Q2011/0016—Construction using wavelength multiplexing or demultiplexing
-
- 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/0005—Switch and router aspects
- H04Q2011/0007—Construction
- H04Q2011/002—Construction using optical delay lines or optical buffers or optical recirculation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
An embodiment of the present invention provides a kind of method and apparatus calculating service delay, are related to the communications field, can accurately reflect the time delay of business.The program includes：Computing device determines that the number N, N of whole multiplex sections in ROADM networks are the integer more than 2；Computing device determines N business；For the first business and the second business in N business, the corresponding at least one multiplex section of the first business at least one multiplex section corresponding with the second business is not exactly the same, and the first business and the second business are arbitrary two business in N business；Computing device determines the time delay of each multiplex section in whole multiplex sections according to the corresponding time delay of N business and the corresponding multiplex section of N business.The application is applied to ROADM networks.
Description
Technical field
This application involves the communications field more particularly to a kind of method and apparatus calculating service delay.
Background technology
All-optical network refers to that network transmission and exchange process are all realized by optical fiber, it is not necessary to realize electric light and light wherein
Electricity conversion, therefore network speed can be greatly improved.All-optical network needs to introduce reconfigurable optical point in switching layer in the important stage of development
Insert multiplexer (Reconfigurable Optical Add-Drop Multiplexer, ROADM).ROADM networks have flexible
Dispatching and service management ability, can eliminate the bandwidth bottleneck of electric equipment, realize network transparency, simplify and accelerate high speed
The assignment of circuit and business provide speed, reduce networking expense and O＆M cost.
Before activating the service in current ROADM networks, can be obtained by route planning the minimum hop count of business with
And most short fiber distance, it then can be according to the minimum hop count of business and the time delay of most short fiber range estimation business.
But it is only capable of reflecting that business is transmitted in a fiber according to the minimum hop count of business and most short fiber distance and be made
At propagation delay, can not reflect the processing delay of business, serial time delay and storage time delay etc., the accounting of these time delays with
The rate of business is related with the performance of equipment.Therefore, there is an urgent need for a kind of technologies for the time delay that can accurately reflect business.
Invention content
Embodiments herein provides a kind of method and apparatus calculating service delay, can accurately reflect business
Time delay.
In order to achieve the above objectives, embodiments herein adopts the following technical scheme that：
In a first aspect, providing a kind of method calculating service delay, it is applied to reconfigurable optical add/drop multiplexer ROADM nets
Network, including：
Computing device determines that the number N, N of whole multiplex sections in ROADM networks are the integer more than 2；
Computing device determines N business；For the first business and the second business in N business, the first business corresponds to
At least one multiplex section at least one multiplex section corresponding with the second business it is not exactly the same, the first business and the second business are
Arbitrary two business in N business；
Computing device determines all multiple according to the corresponding time delay of N business and the corresponding multiplex section of N business
With the time delay of each multiplex section in section.
Second aspect provides a kind of computing device, is applied to reconfigurable optical add/drop multiplexer ROADM networks, including：
Determination unit, for determining that the number N, N of whole multiplex sections in ROADM networks are the integer more than 2；
Determination unit is additionally operable to determine N business；For the first business and the second business in N business, the first industry
Corresponding at least one multiplex section at least one multiplex section corresponding with the second business of being engaged in is not exactly the same, the first business and second
Business is arbitrary two business in N business；
Determination unit is additionally operable to be determined according to the corresponding time delay of N business and the corresponding multiplex section of N business
The time delay of each multiplex section in whole multiplex sections.
The third aspect provides a kind of computer readable storage medium, computer is stored on computer readable storage medium
Program, the method that above-mentioned calculating service delay is realized when computer program is executed by processor.
For the embodiment of the present application by filtering out N business, N is the number of whole multiplex sections in ROADM networks, right as a result,
The first business in N business and the second business, the corresponding at least one multiplex section of the first business are corresponding with the second business
At least one multiplex section is not exactly the same, and the first business and the second business are arbitrary two business in N business, according to N items
The corresponding time delay of business and the corresponding multiplex section of N business determine the time delay of each multiplex section in whole multiplex sections.
Compared with prior art, time delay is determined according to the minimum hop count of business and most short fiber distance, but the time delay is only capable of reflecting industry
Caused propagation delay is transmitted in business in a fiber.The embodiment of the present application can accurately reflect the time delay of business, business
Time delay includes propagation delay, processing delay, serial time delay and storage time delay etc..
Description of the drawings
Fig. 1 is a kind of structural schematic diagram of computing device provided by the embodiments of the present application；
Fig. 2 is a kind of flow diagram of method calculating service delay provided by the embodiments of the present application；
Fig. 3 is a kind of schematic diagram of ROADM networks provided by the embodiments of the present application；
Fig. 4 is a kind of structural schematic diagram of computing device provided by the embodiments of the present application.
Specific implementation mode
The method and apparatus provided in an embodiment of the present invention for calculating service delay are described in detail below in conjunction with the accompanying drawings.
Term " first " and " second " in the description and claims of this application and above-mentioned attached drawing etc. are to be used for area
Not different objects, rather than for limiting particular order.For example, the first business and the second business are different just for the sake of distinguishing
Business is not defined its sequencing.
The terms "and/or", only a kind of incidence relation of description affiliated partner, indicates that there may be three kinds of passes
System, for example, A and/or B, can indicate：Individualism A exists simultaneously A and B, these three situations of individualism B.In addition, herein
Middle character "/", it is a kind of relationship of "or" to typically represent forward-backward correlation object；In formula, character "/" indicates forward-backward correlation
Object is the relationship of a kind of " being divided by ".
It should be noted that in the embodiment of the present invention, " (of) ", " corresponding (corresponding, relevant) "
" corresponding (corresponding) " can be used with sometimes, it is noted that when not emphasizing its difference, table
The meaning reached is consistent.
The embodiment of the present application provides a kind of method calculating service delay, is applied to ROADM networks.For example, being applied to
The transaction of financial instrument high frequency, electric network protection, automatic Pilot for carrying out in ROADM networks etc. need the time delay of the business of ultralow time delay
In estimation.
As shown in Figure 1, being a kind of structural schematic diagram of computing device provided by the embodiments of the present application.In the present invention, it counts
It may include processing module 101, communication module 102, memory module 103, display module 104 to calculate equipment 1.Wherein, processing module
101 for controlling each section hardware device and application software of computing device etc.；Communication module 102 is for can be used bee
Nest, Ethernet and the communication modes such as infrared receive the instruction of miscellaneous equipment transmission, can also be sent to the data of computing device
High in the clouds or miscellaneous equipment；Memory module 103 is used to execute the storage of software program of computing device, the storage of data and software
Operation etc., can be random access memory (Random Access Memory, RAM), erasable programmable read-only register
(Erasable Programmable Read Only Memory, EPROM), solid state disk (Solid State Drives,
SSD one or more) and in SD card (Secure Digital Memory Card) etc.；Display module 104 is used for showing
The operation interface and operating result at family can receive the data of processing module 101 and display.
The embodiment of the present application provides a kind of method calculating service delay, as shown in Fig. 2, including：
201, computing device determines the number N of whole multiplex sections in ROADM networks.
Wherein, N is the integer more than 2.
It should be noted that each multiplex section in ROADM networks can correspond to a unique number.For example,
As shown in figure 3, be a kind of schematic diagram of ROADM networks, it is assumed that N=10, i.e. ROADM networks include 10 multiplex sections, this 10
The corresponding number of multiplex section is 1-10.
202, computing device determines N business.
Wherein, for the first business and the second business in N business, the corresponding at least one multiplex section of the first business with
The corresponding at least one multiplex section of second business is not exactly the same, and the first business and the second business are arbitrary two in N business
Business.
In a kind of possible design, when first business of ROADM networks, which is established, to be completed, computing device determines first
Business belongs to a wherein business for N business, and determines the number of the corresponding at least one multiplex section of first business.
When the Article 2 business of ROADM networks, which is established, to be completed, computing device determines Article 2 business corresponding at least one
The number of a multiplex section；Computing device determines the number and Article 2 business pair of the corresponding at least one multiplex section of first business
Whether the number at least one multiplex section answered is identical；If it is determined that the volume of the corresponding at least one multiplex section of first business
The number of number at least one multiplex section corresponding with Article 2 business is not exactly the same, and computing device determines first article of business and
Whether the number for the unduplicated multiplex section that two business include is more than or equal to 2；If computing device determines unduplicated multiplex section
Number be more than or equal to 2, computing device determines that Article 2 business belongs to wherein one of N business.
When the Article 3 business of ROADM networks, which is established, to be completed, computing device determines Article 3 business corresponding at least one
The number of a multiplex section；Computing device determines the number or Article 2 business pair of the corresponding at least one multiplex section of first business
Whether the number of the number at least one multiplex section answered, at least one multiplex section corresponding with Article 3 business is identical；
If it is determined that number at least one multiplex section corresponding with Article 3 business of the corresponding at least one multiplex section of first business
It numbers not exactly the same, or determines that the number of the corresponding at least one multiplex section of Article 2 business is corresponding with Article 3 business extremely
The number of a few multiplex section is not exactly the same, and computing device determines first business, Article 2 business and Article 3 business packet
Whether the number of the unduplicated multiplex section included is more than or equal to 3；If computing device determines first article of business, Article 2 business and
The number for the unduplicated multiplex section that three business include is more than or equal to 3, and computing device determines that Article 3 business belongs to N business
Wherein one.
In the case where computing device determines M business in N business, M is the positive integer less than N, when third industry
When completion is established in business, third business is the business created in ROADM networks, and computing device determines third business corresponding at least one
The number of a multiplex section；Computing device determines that the number of the corresponding at least one multiplex section of third business is corresponding with the 4th business
Whether the number of at least one multiplex section is identical；4th business is any one article of business of M articles of business；If it is determined that third industry
Be engaged in corresponding at least one multiplex section corresponding with the 4th business at least one multiplex section of number number it is not exactly the same, count
Whether the number for calculating the unduplicated multiplex section that equipment determines that M business and third business include is more than or equal to M+1；If calculating is set
The standby number for determining unduplicated multiplex section is more than or equal to M+1, and computing device determines that third business belongs to wherein the one of N business
Item.
For example, as shown in figure 3, being a kind of schematic diagram of ROADM networks, it is assumed that N=10, M=3, i.e. ROADM networks
Including 10 multiplex sections, computing device has determined that 3 business, including business 1, business 2 and business 3.Business 1 is corresponding at least
One multiplex section includes multiplex section 2 and 3；The corresponding at least one multiplex section of business 2 includes multiplex section 1,2 and 3；Business 3 corresponds to
At least one multiplex section include multiplex section 1 and 2.If the number of the corresponding at least one multiplex section of new business is 1 and 4；Meter
It calculates equipment and determines that the number of the corresponding at least one multiplex section of new business and business 1, business 2 or business 3 are corresponding extremely
The number of a few multiplex section is not exactly the same, and computing device determines that business 1, business 2, business 3 and new business include
The number of unduplicated multiplex section is equal to 4 (i.e. M+1=4)；Computing device determines that new business belongs to wherein the one of N business
Item.
In addition, if computing device determines that the number for the unduplicated multiplex section that M business and third business include is less than M+
1, computing device determines that third business is not belonging to wherein one of N business.For example, if as shown in figure 3, ROADM networks
In the number of the corresponding at least one multiplex section of new business be 1 and 3；Computing device determines new business corresponding at least one
The number of the number of a multiplex section at least one multiplex section corresponding with business 1, business 2 or business 3 is not exactly the same, but
Be the unduplicated multiplex section that computing device determines that business 1, business 2, business 3 and new business include number be less than M+1=
4；Computing device determines that new business is not belonging to wherein one of N business.
In alternatively possible design, in the case where computing device determines M business in N business, calculate
Equipment determines that the first numerical value, the first numerical value are the number of the corresponding unduplicated multiplex section of M business；When third business has been established
Cheng Shi, third business are the business created in ROADM networks, and computing device determines that second value, second value are third business
The number of unduplicated multiplex section corresponding with M business；Computing device determines whether second value is more than the first numerical value；If really
Determine second value and be more than the first numerical value, or if it is determined that second value is equal to the first numerical value, and second value is more than M, computing device
Determine that third business belongs to wherein one of N business；If it is determined that second value is equal to the first numerical value, and second value is equal to M,
Computing device determines that third business is not belonging to wherein one of N business.
Illustratively, the corresponding unduplicated multiplex section of M business can be mapped in the first register by computing device,
First register can store the binary number of N-bit length, and each bit corresponds to each multiplex section in ROADM networks.Its
In, the corresponding multiplex section of M business is 1 in the corresponding bit of the first register.For example, not repeated when M business is corresponding
Multiplex section when including 1,3,5,7 and 9, the 1st, 3,5,7,9 bit of the first register is 1.First numerical value is stored in
In first counter, in the first numerical value i.e. the first register bit be 1 number of bits.
Third business and the corresponding unduplicated multiplex section of M business can be mapped to the second register by computing device
In, the second register can store the binary number of N-bit length, and each bit corresponds to each multiplex section in ROADM networks.
Wherein, third business and the corresponding multiplex section of M business are 1 in the corresponding bit of the second register.For example, working as third business
Unduplicated multiplex section corresponding with M business include 1,3,5,7,9,11 and 13 when, the second register the 1st, 3,5,7,
9,11,13 bits are 1.Second value is stored in the second counter, and bit is 1 in second value i.e. the second register
Number of bits.As an example it is assumed that third business includes multiplex section a and multiplex section c, M business includes multiplex section a, multiplexing
Section b and multiplex section d, then multiplex section a, multiplex section b, multiplex section c and multiplex section the d corresponding bit in the second register are 1,
Remaining bit is 0.
When third business, which is established, to be completed, third business is the business created in ROADM networks, and computing device determines second
Whether the value of counter is more than the value of the first counter；If it is determined that the value of the second counter is more than the value of the first counter, calculate
Equipment determines that third business belongs to wherein one of N business；Or, if it is determined that the value of the second counter is equal to the first counter
Value, and the value of the second counter is more than M, computing device determines that third business belongs to wherein one of N business；If it is determined that second
The value of counter is equal to the value of the first counter, and the value of the second counter is equal to M, and computing device determines that third business is not belonging to
Wherein one of N business.
203, computing device determines the corresponding time delay of N business.
Computing device carries out service delay end to end to every business in N business and tests；Preserve the industry of N business
Business time delay.
Optionally, if computing device determines that the number of the corresponding at least one multiplex section of third business is corresponding with the 4th business
At least one multiplex section number it is identical；Or when computing device determines that third business is not belonging to wherein the one of N business
When, the number of the corresponding at least one multiplex section of third business includes the volume of the corresponding at least one multiplex section of the 4th business
Number, the corresponding time delay of the 4th business and multiplex section can be updated to the corresponding time delay of third business and multiplex section by computing device.
This is because the settling time of third business is later than the settling time of the 4th business, therefore the time delay of third business can more reflect net
The actual conditions of network, therefore the time delay and multiplex section of the 4th business can be deleted, and store the time delay and multiplex section of third business.
In a kind of possible design, if computing device determine the number of the corresponding at least one multiplex section of third business with
The number of the corresponding at least one multiplex section of 4th business is identical, and the corresponding time delay of the 4th business is updated to by computing device
The average value of the corresponding time delay of third business and the corresponding time delay of the 4th business.
204, computing device determines complete according to the corresponding time delay of N business and the corresponding multiplex section of N business
The time delay of each multiplex section in portion's multiplex section.
Computing device establishes N number of side according to the corresponding time delay of N business and the corresponding multiplex section of N business
Journey.For any one business in N business, the corresponding equation of the business is as follows：
Wherein, k is the number of the corresponding multiplex section of the business, α1-αkFor the number of the corresponding multiplex section of the business,For the time delay of the corresponding k multiplex section of the business, t1For the corresponding time delay of the business.
Illustratively, N number of equation is as follows：
Wherein k, m and j are the numbers of the corresponding multiplex section of corresponding service.α1..., αk, η1, η2..., ηm, χ1, χ2..., χj
∈ { 1,2 ..., N }.t1..., tNFor the corresponding time delay of N number of business.It should be noted that the multiplex section that every business is passed through
Number is not necessarily identical, i.e. k, and m and j are not necessarily identical.Above-mentioned equation group is solved, it is each multiple in obtaining in each ROADM networks
With the delay estimation value τ of section1, τ2..., τN。
Then, can be according to the time delay of the time-delay calculation business of multiplex section when the new business of newly-built low time delay, and it can be with
Time delay based on business carries out business Route Selection.Specifically, when cooking up the shortest business of time delay according to the time delay of multiplex section
After routing, time delay can be judged by the optical signal to noise ratio (Optical Signal Noise Ratio, OSNR) of artificial service
Whether shortest business can be correct open-minded.If the OSNR of emulation indicates time delay, shortest business routing is unsatisfactory for service fulfillment
Demand, then judge whether the shortest business routing of time delay passes through relay.If the business cooked up is route without relaying
Website then illustrates that the shortest business of time delay can not be correct open-minded, then can plan the longer routing of another time delay and again into
The above-mentioned judgement of row.
If network structure regulation, such as network capacity extension enlarging, when leading to the multiplex section number N increases in ROADM networks,
Such as increase R multiplex section, then it can increase R business on the basis of original N number of business.For (N+R) a industry
Business, the corresponding at least one multiplex section of any two of which business are not exactly the same.Determine that the process of R business can join
Examine the process of step 202.As it can be seen that method provided by the embodiments of the present application has very good scalability, it is suitable for existing net
In common upgrading.
In a kind of possible design, computing device can periodically or irregularly update the time delay of each multiplex section.Citing
For, when business changes either network structure is adjusted when or when meeting the preset update cycle, computing device can
To adjudicate the time delay that flow updates each multiplex section according to the following conditions：A) according to existing routing table, to whole industry in network
Business re-starts online delay testing；B) according to the time delay of the time-delay calculation whole business of each multiplex section of computing device storage.
C) difference for the time delay that the online time delay of acquisition business is obtained with business according to the time-delay calculation of multiplex section, according to whole business pair
The difference answered obtains the average value ε of difference；If d) ε is less than pre-set thresholding ε0, then need not update each multiplex section when
Prolong；If ε>ε0, then the time delay to each multiplex section is needed to be updated.If desired the time delay of each multiplex section is updated, then from current
New business starts, and N number of business is redefined out in the business opened, and to establish N number of equation, calculates each multiplexing
The new time delay of section.Detailed process can refer to step 201-204.
For the embodiment of the present application by filtering out N business, N is the number of whole multiplex sections in ROADM networks, right as a result,
The first business in N business and the second business, the corresponding at least one multiplex section of the first business are corresponding with the second business
At least one multiplex section is not exactly the same, and the first business and the second business are arbitrary two business in N business, according to N items
The corresponding time delay of business and the corresponding multiplex section of N business determine the time delay of each multiplex section in whole multiplex sections.
Compared with prior art, time delay is determined according to the minimum hop count of business and most short fiber distance, but the time delay is only capable of reflecting industry
Caused propagation delay is transmitted in business in a fiber.The embodiment of the present application can accurately reflect the time delay of business, business
Time delay includes propagation delay, processing delay, serial time delay and storage time delay etc..
The embodiment of the present application provides a kind of computing device, and computing device 4 includes：Determination unit 401, updating unit 402, place
Unit 403 and storage unit 404 are managed, wherein：
Determination unit 401, for determining that the number N, N of whole multiplex sections in ROADM networks are the integer more than 2；
Determination unit 401 is additionally operable to determine N business；For the first business and the second business in N business,
The corresponding at least one multiplex section of one business at least one multiplex section corresponding with the second business is not exactly the same, the first business and
Second business is arbitrary two business in N business；
Determination unit 401 is additionally operable to according to the corresponding time delay of N business and the corresponding multiplex section of N business
Determine the time delay of each multiplex section in whole multiplex section.
Optionally, determination unit 401 is used for：In the case of M business in determining N business, M is less than N's
Positive integer, when third business, which is established, to be completed, third business is the business created in ROADM networks, determines that third business corresponds to
At least one multiplex section number；Determine that the number of the corresponding at least one multiplex section of third business is corresponding with the 4th business
Whether the number of at least one multiplex section is identical；4th business is any one article of business in M articles of business；If it is determined that third
The number of number at least one multiplex section corresponding with the 4th business of the corresponding at least one multiplex section of business is not exactly the same,
Determine whether the number for the unduplicated multiplex section that M business and third business include is more than or equal to M+1；If it is determined that unduplicated
The number of multiplex section is more than or equal to M+1, determines that third business belongs to wherein one of N business；If it is determined that unduplicated multiplexing
The number of section is less than M+1, determines that third business is not belonging to wherein one of N business.
Optionally, determination unit 401 is used for：In the case of M business in determining N business, M is less than N's
Positive integer determines that the first numerical value, the first numerical value are the number of the corresponding unduplicated multiplex section of M business；When third business is built
When vertical completion, third business is the business created in ROADM networks, determines that second value, second value are third business and M items
The number of the corresponding unduplicated multiplex section of business；
Determine whether second value is more than the first numerical value；If it is determined that second value is more than the first numerical value, or if it is determined that second
Numerical value is equal to the first numerical value, and second value is more than M, determines that third business belongs to wherein one of N business；If it is determined that second
Numerical value is equal to the first numerical value, and second value is equal to M, determines that third business is not belonging to wherein one of N business.
Updating unit 402, is used for：If it is determined that the number of the corresponding at least one multiplex section of third business and the 4th business pair
The number at least one multiplex section answered is identical；Wherein, the 4th business is any one article of business in M articles of business；Or work as
When determining that third business is not belonging to wherein one of N business, the number of the corresponding at least one multiplex section of third business includes
The number of the corresponding at least one multiplex section of 4th business；The corresponding time delay of 4th business and multiplex section are updated to third business
Corresponding time delay and multiplex section.
Processing unit 403 is used for：Service delay end to end is carried out to every business in N business to test；
Storage unit 404, the service delay for preserving N business.
Optionally, determination unit 401 is used for：It is corresponding multiple according to the corresponding time delay of N business and N business
N number of equation is established with section；For any one business in N business, the corresponding equation of the business is as follows：
Wherein, k is the number of the corresponding multiplex section of the business, α1-αkFor the number of the corresponding multiplex section of the business, τaFor
The time delay of the corresponding multiplex section of the business, t1For the corresponding time delay of the business；N number of equation is solved, to obtain in whole multiplex sections
The corresponding time delay of each multiplex section.
For the embodiment of the present application by filtering out N business, N is the number of whole multiplex sections in ROADM networks, right as a result,
The first business in N business and the second business, the corresponding at least one multiplex section of the first business are corresponding with the second business
At least one multiplex section is not exactly the same, and the first business and the second business are arbitrary two business in N business, according to N items
The corresponding time delay of business and the corresponding multiplex section of N business determine the time delay of each multiplex section in whole multiplex sections.
Compared with prior art, time delay is determined according to the minimum hop count of business and most short fiber distance, but the time delay is only capable of reflecting industry
Caused propagation delay is transmitted in business in a fiber.The embodiment of the present application can accurately reflect the time delay of business, business
Time delay includes propagation delay, processing delay, serial time delay and storage time delay etc..
It should be noted that during specific implementation, performed by the method for above-mentioned calculating service delay as shown in Figure 2
Each step can pass through the processor of example, in hardware and execute the computer executed instructions of software form stored in memory
It realizes, to avoid repeating, details are not described herein again.And the program corresponding to the action performed by the method for above-mentioned calculating service delay
In the memory that the method that the calculating service delay can be stored in a software form is implemented, executed in order to which processor calls
The corresponding operation of above modules.
It is apparent to those skilled in the art that for convenience and simplicity of description, the module of foregoing description
Specific work process, can refer to corresponding processes in the foregoing method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed method and apparatus can pass through it
Its mode is realized.For example, embodiments described above is only schematical, for example, the division of the module, only
A kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple module or components can combine or
Person is desirably integrated into another system, or some features can be ignored or not executed.Another point, shown or discussed is mutual
Between coupling, direct-coupling or communication connection can be INDIRECT COUPLING or communication link by some interfaces, device or unit
It connects, can be electrical, machinery or other forms.
The module illustrated as separating component may or may not be physically separated, aobvious as module
The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that the independent physics of each unit includes, it can also be during two or more units be integrated in one unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of hardware adds SFU software functional unit.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, it will be understood by those of ordinary skill in the art that：It still may be used
With technical scheme described in the above embodiments is modified or equivalent replacement of some of the technical features；
And these modifications or replacements, various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (13)
1. a kind of method calculating service delay, is applied to reconfigurable optical add/drop multiplexer ROADM networks, which is characterized in that packet
It includes：
Computing device determines that the number N, N of whole multiplex sections in the ROADM networks are the integer more than 2；
The computing device determines N business；For the first business and the second business in the N business, described first
The corresponding at least one multiplex section of business at least one multiplex section corresponding with second business is not exactly the same, and described first
Business and second business are arbitrary two business in the N business；
The computing device is true according to the corresponding time delay of the N business and the corresponding multiplex section of the N business
The time delay of each multiplex section in fixed whole multiplex sections.
2. according to the method described in claim 1, it is characterized in that, the computing device determines that N business includes：
In the case where the computing device determines M business in the N business, M is positive integer less than N, when the
When three business establish completion, the third business is the business created in the ROADM networks, described in the computing device determination
The number of the corresponding at least one multiplex section of third business；
The computing device determines that the number of the corresponding at least one multiplex section of the third business and the 4th business are corresponding extremely
Whether the number of a few multiplex section is identical；4th business is any one article of business in the M articles of business；
If it is determined that the number and the 4th business of the corresponding at least one multiplex section of the third business are corresponding at least one
The number of multiplex section is not exactly the same, and the computing device determines that the M business and the third business included does not repeat
Multiplex section number whether be more than or equal to M+1；
If the computing device determines that the number of the unduplicated multiplex section is more than or equal to M+1, the computing device determines institute
State wherein one that third business belongs to the N business；
If the computing device determines that the number of the unduplicated multiplex section is less than M+1, the computing device determines described the
Three business are not belonging to wherein one of the N business.
3. according to the method described in claim 1, it is characterized in that, the computing device determines that N business includes：
In the case where the computing device determines M business in the N business, M is the positive integer less than N, described
Computing device determines that the first numerical value, first numerical value are the number of the corresponding unduplicated multiplex section of the M business；
When third business, which is established, to be completed, the third business is the business created in the ROADM networks, the computing device
Determine that second value, the second value are of the third business and the corresponding unduplicated multiplex section of the M business
Number；
The computing device determines whether the second value is more than first numerical value；
If it is determined that the second value be more than first numerical value, or if it is determined that the second value be equal to first numerical value,
And the second value is more than M, the computing device determines that the third business belongs to wherein one of the N business；If
Determine that the second value is equal to first numerical value, and the second value is equal to M, the computing device determines the third
Business is not belonging to wherein one of the N business.
4. according to the method in claim 2 or 3, which is characterized in that the method further includes：
If the computing device determines that the number of the corresponding at least one multiplex section of the third business is corresponding with the 4th business
The number of at least one multiplex section is identical；Wherein, the 4th business is any one article of business in the M articles of business；
Or
When the computing device determines that the third business is not belonging to wherein one of the N business, the third business
The number of corresponding at least one multiplex section includes the number of the corresponding at least one multiplex section of the 4th business；
The corresponding time delay of 4th business and multiplex section are updated to the corresponding time delay of the third business by the computing device
And multiplex section.
5. according to claim 1-3 any one of them methods, which is characterized in that the computing device is according to the N business
Corresponding time delay and the corresponding multiplex section of the N business determine each multiplex section in whole multiplex section when
Before prolonging, the method further includes：
The computing device carries out service delay end to end to every business in the N business and tests；
The computing device preserves the service delay of the N business.
6. according to claim 1-3 any one of them methods, which is characterized in that the computing device is according to the N business
Corresponding time delay and the corresponding multiplex section of the N business determine each multiplex section in whole multiplex section when
Prolong including：
The computing device is built according to the corresponding time delay of the N business and the corresponding multiplex section of the N business
Found N number of equation；
For any one business in the N business, the corresponding equation of the business is as follows：
Wherein, k is the number of the corresponding multiplex section of the business, α1-αkFor the number of the corresponding multiplex section of the described business, τaFor
The time delay of the corresponding multiplex section of the business, t1For the corresponding time delay of the business；
The computing device solves N number of equation, to obtain the corresponding time delay of each multiplex section in whole multiplex sections.
7. a kind of computing device is applied to reconfigurable optical add/drop multiplexer ROADM networks, which is characterized in that including：
Determination unit, for determining that the number N, N of whole multiplex sections in the ROADM networks are the integer more than 2；
The determination unit is additionally operable to determine N business；For the first business and the second business in the N business, institute
It is not exactly the same to state the corresponding at least one multiplex section of the first business at least one multiplex section corresponding with second business, institute
The first business and second business are stated as arbitrary two business in the N business；
The determination unit is additionally operable to corresponding multiple according to the corresponding time delay of the N business and the N business
The time delay of each multiplex section in whole multiplex sections is determined with section.
8. computing device according to claim 7, which is characterized in that the determination unit is used for：
In the case of M business in determining the N business, M is the positive integer less than N, when third business has been established
Cheng Shi, the third business are the business created in the ROADM networks, determine that the third business is corresponding at least one multiple
With the number of section；
Determine number at least one multiplex section corresponding with the 4th business of the corresponding at least one multiplex section of the third business
Number it is whether identical；4th business is any one article of business in the M articles of business；
If it is determined that the number and the 4th business of the corresponding at least one multiplex section of the third business are corresponding at least one
The number of multiplex section is not exactly the same, determines for the unduplicated multiplex section that the M business and the third business include
Whether number is more than or equal to M+1；
If it is determined that the number of the unduplicated multiplex section is more than or equal to M+1, determine that the third business belongs to the N business
Wherein one；
If it is determined that the number of the unduplicated multiplex section is less than M+1, determine that the third business is not belonging to the N business
Wherein one.
9. computing device according to claim 7, which is characterized in that the determination unit is used for：
In the case of M business in determining the N business, M is the positive integer less than N, determines the first numerical value, described
First numerical value is the number of the corresponding unduplicated multiplex section of the M business；
When third business, which is established, to be completed, the third business is the business created in the ROADM networks, determines the second number
Value, the second value are the number of the third business and the corresponding unduplicated multiplex section of the M business；
Determine whether the second value is more than first numerical value；
If it is determined that the second value be more than first numerical value, or if it is determined that the second value be equal to first numerical value,
And the second value is more than M, determines that the third business belongs to wherein one of the N business；If it is determined that described second
Numerical value is equal to first numerical value, and the second value is equal to M, determines that the third business is not belonging to the N business
Wherein one.
10. computing device according to claim 8 or claim 9, which is characterized in that further include updating unit, be used for：
If it is determined that number at least one multiplexing corresponding with the 4th business of the corresponding at least one multiplex section of the third business
The number of section is identical；Wherein, the 4th business is any one article of business in the M articles of business；Or
When determining that the third business is not belonging to wherein one of the N business, the third business corresponding at least one
The number of a multiplex section includes the number of the corresponding at least one multiplex section of the 4th business；
The corresponding time delay of 4th business and multiplex section are updated to the corresponding time delay of the third business and multiplex section.
11. according to claim 7-9 any one of them computing devices, which is characterized in that further include processing unit, be used for：
Service delay end to end is carried out to every business in the N business to test；
Storage unit, the service delay for preserving the N business.
12. according to claim 7-9 any one of them computing devices, which is characterized in that the determination unit is used for：
N number of equation is established according to the corresponding time delay of the N business and the corresponding multiplex section of the N business；
For any one business in the N business, the corresponding equation of the business is as follows：
Wherein, k is the number of the corresponding multiplex section of the business, α1-αkFor the number of the corresponding multiplex section of the described business, τaFor
The time delay of the corresponding multiplex section of the business, t1For the corresponding time delay of the business；
N number of equation is solved, to obtain the corresponding time delay of each multiplex section in whole multiplex sections.
13. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program realizes that claim 1-6 any one of them calculates service delay when the computer program is executed by the processor
Method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810151486.7A CN108418649B (en) | 2018-02-13 | 2018-02-13 | A kind of method and apparatus calculating service delay |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810151486.7A CN108418649B (en) | 2018-02-13 | 2018-02-13 | A kind of method and apparatus calculating service delay |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108418649A true CN108418649A (en) | 2018-08-17 |
| CN108418649B CN108418649B (en) | 2019-10-11 |
Family
ID=63128901
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810151486.7A Active CN108418649B (en) | 2018-02-13 | 2018-02-13 | A kind of method and apparatus calculating service delay |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108418649B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113630180A (en) * | 2020-05-06 | 2021-11-09 | 华为技术有限公司 | Optical power adjusting and measuring method, adjusting and measuring system, control equipment and adjusting and measuring station |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070036549A1 (en) * | 2004-03-04 | 2007-02-15 | Fujitsu Limited | Optical transmission apparatus |
| CN101138256A (en) * | 2005-06-06 | 2008-03-05 | 中兴通讯股份有限公司 | Cooperative method for protection recovery between layered network in automatic exchange optical network |
| CN103222215A (en) * | 2012-12-07 | 2013-07-24 | 华为技术有限公司 | Automatic power adjusting method and first ROADM station |
| CN106034043A (en) * | 2015-03-18 | 2016-10-19 | 中兴通讯股份有限公司 | Method and apparatus for improving switching efficiency of multiplexing segments in packet transmit network |
| CN106656681A (en) * | 2017-02-22 | 2017-05-10 | 国家电网公司 | Risk analysis method and device for service transmission delay in power communication network |
-
2018
- 2018-02-13 CN CN201810151486.7A patent/CN108418649B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070036549A1 (en) * | 2004-03-04 | 2007-02-15 | Fujitsu Limited | Optical transmission apparatus |
| CN101138256A (en) * | 2005-06-06 | 2008-03-05 | 中兴通讯股份有限公司 | Cooperative method for protection recovery between layered network in automatic exchange optical network |
| CN103222215A (en) * | 2012-12-07 | 2013-07-24 | 华为技术有限公司 | Automatic power adjusting method and first ROADM station |
| CN106034043A (en) * | 2015-03-18 | 2016-10-19 | 中兴通讯股份有限公司 | Method and apparatus for improving switching efficiency of multiplexing segments in packet transmit network |
| CN106656681A (en) * | 2017-02-22 | 2017-05-10 | 国家电网公司 | Risk analysis method and device for service transmission delay in power communication network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113630180A (en) * | 2020-05-06 | 2021-11-09 | 华为技术有限公司 | Optical power adjusting and measuring method, adjusting and measuring system, control equipment and adjusting and measuring station |
| CN113630180B (en) * | 2020-05-06 | 2022-10-18 | 华为技术有限公司 | Optical power adjusting and measuring method, adjusting and measuring system, control equipment and adjusting and measuring station |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108418649B (en) | 2019-10-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101361306B (en) | Optimized dynamic routing in optical network | |
| US9490928B2 (en) | Arrayed waveguide grating based modular interconnection networks and methods for constructing and applying the same | |
| Gong et al. | Dynamic transparent virtual network embedding over elastic optical infrastructures | |
| Yang et al. | Performance evaluation of multi-stratum resources integration based on network function virtualization in software defined elastic data center optical interconnect | |
| EP3751787A1 (en) | Techniques to generate network simulation scenarios | |
| CN109327410B (en) | Improved three-level CLOS routing method based on FPGA crossing | |
| CN102387082A (en) | Flow-classification-based grouping flow control system and control method | |
| Xing et al. | Load balancing-based routing optimization mechanism for power communication networks | |
| CN101459469A (en) | Optical layer scheduling method for network element and network management control system | |
| CN108418649B (en) | A kind of method and apparatus calculating service delay | |
| WO2003007626A2 (en) | Method and apparatus for network link planning | |
| CN104202262A (en) | Method and device for spectrum allocation in spectral flexible optical network | |
| CN101931462A (en) | Testing control method and device for optical transmission network | |
| CN105763283B (en) | A kind of optical add/drop multiplexer Optimal Configuration Method in wavelength division multiplexed optical network | |
| CN105704192A (en) | Method and equipment for determining controller position in SDN network | |
| KR100273774B1 (en) | Network design method for optimum design of very high speed leased line network | |
| CN1369983A (en) | Method for simulating WDM optical network | |
| CN107786382A (en) | Interface system of selection, device, test console and test system | |
| Lu et al. | Asymmetric CDC ROADM architecture for efficient support of bi-directional asymmetric traffic demands | |
| CN102377661A (en) | Blade server and method for building shortest blade transmission path in blade server | |
| Tcha et al. | Conduit and cable installation for a centralized network with logical star-star topology | |
| CN116367024A (en) | Service deployment method, system and optical channel of Dragonfly all-optical data center network | |
| CN109068331A (en) | A kind of automatic dividing method and device of wireless terminal node | |
| CN115842766B (en) | Flow simulation method and device | |
| CN106301648A (en) | Clock synchronizer controller, determine the method and system of clock synchronization link |
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 |