CN101155137A - Method for confirming routing path and its confirming unit - Google Patents

Method for confirming routing path and its confirming unit Download PDF

Info

Publication number
CN101155137A
CN101155137A CNA2006101526876A CN200610152687A CN101155137A CN 101155137 A CN101155137 A CN 101155137A CN A2006101526876 A CNA2006101526876 A CN A2006101526876A CN 200610152687 A CN200610152687 A CN 200610152687A CN 101155137 A CN101155137 A CN 101155137A
Authority
CN
China
Prior art keywords
wavelength
logical links
path
cost function
function value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CNA2006101526876A
Other languages
Chinese (zh)
Inventor
李桥
徐展琦
霍静
苏扬
王飞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Xidian University
Original Assignee
Huawei Technologies Co Ltd
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=39229719&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=CN101155137(A) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Huawei Technologies Co Ltd, Xidian University filed Critical Huawei Technologies Co Ltd
Priority to CNA2006101526876A priority Critical patent/CN101155137A/en
Priority to AT07720919T priority patent/ATE480076T1/en
Priority to DE602007008913T priority patent/DE602007008913D1/en
Priority to CNA2007800004015A priority patent/CN101517985A/en
Priority to ES07720919.5T priority patent/ES2352518T5/en
Priority to EP07720919.5A priority patent/EP2058986B2/en
Priority to PCT/CN2007/001346 priority patent/WO2008037155A1/en
Publication of CN101155137A publication Critical patent/CN101155137A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/62—Wavelength based
    • 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
    • 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/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)
  • Use Of Switch Circuits For Exchanges And Methods Of Control Of Multiplex Exchanges (AREA)

Abstract

The invention discloses a method of determining route path, comprising: receiving the service connection request information, wherein the said service connection request information is composed of source node ID, host node ID; searching the path with minimal cost function value from source node to host node on plane of each wavelength based on network topology information containing wavelength link, logic link, the said cost function value of the said logic link is less than the cost function value of link of any wavelength in network; determining the said path with minimal cost function value as route path of the current service. The invention also discloses a determining unit of route path, preferably the logic link is used, and regarding to the influence of usable wavelength and wavelength link number in the existing logic link on route selection, the bandwidth resource of network is fully used.

Description

A kind of method of definite routed path and routed path determining unit
Technical field
The present invention relates to a kind of communication technology, relate in particular to a kind of method and routed path determining unit of definite routed path.
Background technology
Along with the develop rapidly of internet with to the requirement of service quality, press for a kind of high bandwidth, can effectively support the transmission net that IP (Internet Protocol) is professional, and satisfied the demand of growing IP operation well bandwidth based on interconnected type WDM (wavelength division multiplexing) optical transfer network of wavelength division multiplexing and optical cross connect technology.Traditional IP over ATM over SDH over WDM 4 layer networks are because function is overlapping too many, management and control plane are too complicated, the simplification demand that can not adapt to network management, people begin IP operation directly is carried on the WDM network and transmit, and have formed IP over WDM technology.IP over WDM technology can greatly be expanded the existing network bandwidth, is the main developing direction of broadband IP backbone network.
Development in view of MPLS (multiprotocol label switching) technology, people combine the MPLS technology again with optical internet, GMPLS (exchange of general multiple protocols label) technology has been proposed, adopt optical wavelength label in return, the seamless fusion of light exchange having carried out with IP layer routing forwarding and WDM physical layer, utilize wavelength to seek route, and identify the light path of being set up, for upper-layer service provides wavelength interchange channel at a high speed.
Zhu H Y, Zang H, people such as Zhu K Y are at document " A Novel Generic Graph Model forTraffic Grooming in Heterogeneous WDM Mesh Networks " (IEEE/ACMTransactions on Networking, 2003,11 (2): described two kinds of routing algorithm: MinTH (minimizing the light path jumping figure) algorithm and MinLP (minimizing the light path number) algorithm 285～299.).Introduce this two kinds of routing algorithms below respectively.
In the MinTH algorithm, the light path jumping figure of making every effort to each source, the right LSP (label switched path) of destination node are crossed over is minimum, according to this strategy, adopts single-hop light path mode between source, destination node as far as possible, and for a LSP connection request, the route establishment step is:
If step 100 source, destination node be an existing single-hop (going directly) light path on certain wavelength plane, as long as enough available bandwidths are arranged, the LSP connection request that then allows this light path carrying newly arrive;
If there is not single-hop (going directly) light path between step 200 source, destination node,,, distribute the wavelength link by first fit (First-Fit) criterion in newly-built light path process for source, the newly-built single-hop of destination node (going directly) light path.
In step 100, do not find the single-hop light path that is fit to this LSP connection request, and in step 200, can't set up the single-hop light path time, then the LSP connection request is adopted the mode of multi-hop light path routing, but should make the light path jumping figure minimum.
In the MinTH algorithm, although can guarantee that the light path jumping figure of IP operation stream leap is minimum, but because MinTH uses the single-hop light path as much as possible, so in network, have under the situation of identical services quantity and will set up more light path, and preferentially do not use existing light path when setting up light path, so can expend more wavelength link; At this moment, when afterwards service bandwidth demand is big, just might in whole system, have idle wavelength link to use, thereby cause this business connection failure, cause the increase of connection request blocking rate, thereby can not make full use of the bandwidth resources of network.
In the MinLP algorithm, make every effort to make LSP connection request of carrying to need newly-built light path number minimum, the routing step of MinLP is:
If source, existing many light path paths of destination node select a minimum light path path of jumping figure to carry the LSP connection request that newly arrives;
If newly-built light path, newly-built light path quantity should be minimum.
In the MinLP algorithm, the light path number of only making every effort in the network is minimum, in routing process, does not consider the influence of available bandwidth routing, therefore can not make full use of the bandwidth resources of network.
Summary of the invention
The method and the routed path determining unit that the purpose of this invention is to provide a kind of definite routed path.Solved because of not considering available bandwidth and existing logical links medium wavelength number of links the drawback that influence brought routing.
The invention discloses a kind of method of definite routed path, comprising:
A, reception service connection request message, described service connection request message comprises source node sign, destination node sign and bandwidth on demand;
B, according to comprising the network topological information of wavelength link, logical links and the source node of bandwidth on demand on each wavelength plane to the path of seeking the cost function value minimum between the destination node, the cost function value of described logical links is less than the cost function value of arbitrary wavelength link in the network;
C, the path of described cost function value minimum is defined as the routed path of current business.
The cost function value of described logical links is directly proportional with the wavelength number of links of this logical links.
The cost function value of described logical links is directly proportional with the remaining bandwidth of this logical links.
Described step B specifically comprises:
B1, calculate the cost function value of each logical links on each wavelength plane, and utilize the cost function value of the logical links of gained to upgrade network topological information by following formula:
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l
L in the formula Mn iExpression node m is to the logical links between the node n, h Mn iBe to be λ on the wavelength plane iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth of each wavelength link, and α is cost function value coefficient (0＜α＜1), Min (C (P Uv i)) be the minimum cost functional value of each wavelength link on all wavelengths plane;
B2, according to the source node of network topological information on each wavelength plane that upgrades to the path of seeking the cost function value minimum between the destination node.
When the cost function value of cost functional value minimal path is not infinity, described method also comprises: newly-built logical links on the wavelength link of current business routed path, the wavelength link of newly-built logical links correspondence on the current business routed path in the deletion topological diagram, and the bandwidth of wavelength link composed to this newly-built logical links, the remaining bandwidth of all logical links on the described current business routed path is deducted bandwidth on demand.
Described method also comprises:
Receive the professional request message that discharges, the described professional request message that discharges comprises source node sign, destination node sign and bandwidth on demand;
Remaining bandwidth with the logical links of described source node to the path between the destination node in topological diagram adds bandwidth on demand.
When the remaining bandwidth of the logical links on the path between destination node of the source node described in the topological diagram equals the wavelength link bandwidth, this logical links is reverted to the wavelength link.
The invention also discloses a kind of routed path determining unit, comprising:
Receiving element is used to receive business request information, and described service connection request message comprises source node sign, destination node sign and bandwidth on demand;
The path determining unit, be used for according to comprising that the network topological information of wavelength link, logical links and the source node of bandwidth on demand on each wavelength plane are to the path of seeking the cost function value minimum between the destination node, the path of described cost function value minimum is defined as the routed path of current business, and the cost function value of described logical links is less than the cost function value of arbitrary wavelength link in the network.
Described path determining unit comprises:
Computing unit is used for calculating by following formula the cost function value of each logical links on each wavelength plane:
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l
L in the formula Mn iExpression node m is to the logical links between the node n, h Mn iBe to be λ on the wavelength plane iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth of each wavelength link, and α is cost function value coefficient (0＜α＜1), Min (C (P Uv i)) be the minimum cost functional value of each wavelength link on all wavelengths plane;
The cost function value updating block is used for the cost function value renewal network topological information according to the logical links of computing unit gained;
Obtain path unit, be used for the source node of network topological information on each wavelength plane that upgrade according to described updating block to seeking the path of cost function value minimum between the destination node, and the path of described cost function value minimum be defined as the routed path of current business.
Described routed path determining unit also comprises: the topology information updating block, when the cost function value of cost functional value minimal path is not infinity, delete the wavelength link on the current business routed path in the topological diagram, and the remaining bandwidth of the logical links on the described current business routed path is deducted bandwidth on demand.
Therefore,, and consider the influence of available bandwidth and existing logical links medium wavelength number of links, made full use of the bandwidth resources of network routing by preferential use logical links.
Description of drawings
Fig. 1 is the routing algorithm flow chart that the present invention proposes;
Fig. 2 (a) is network physical example topology figure of the present invention;
Fig. 2 (b) is the initial hierarchical diagram example of network of the present invention;
Fig. 2 (c) is accept business a hierarchical diagram example behind the connection request r1 of network of the present invention;
Fig. 2 (d) is the network of the present invention λ behind the connection request r2 that accepts business 1The hierarchical diagram example;
Fig. 2 (e) is the network of the present invention λ behind the connection request r3 that accepts business 2The hierarchical diagram example;
Fig. 3 is the NSF Network backbone network physical topology figure that emulation of the present invention is used;
Fig. 4 shows the influence of different α values to network blocking probability;
Fig. 5 shows the situation that service request that α equals at 0.1,0.5,0.9 o'clock takies the logic chain way;
Fig. 6 shows the situation that business that α equals at 0.1,0.5,0.9 o'clock takies the wavelength number of links;
Fig. 7 shows the situation that α equals 0.1,0.5,0.9 o'clock network bandwidth utilance;
Fig. 8 shows the situation of MCTLN, MinTH, three kinds of algorithm network bandwidths of MinLP utilance;
Fig. 9 shows routed path determining unit of the present invention.
Embodiment
Understand and realization the present invention the existing embodiments of the invention of describing in conjunction with the accompanying drawings for the ease of persons skilled in the art.
The present invention proposes a kind of IP of being used for over WDM optical internet and determine routed path method-MCTLN (Minimizing the Cost of Total Lightpaths in Network).This basic idea is, in the optical internet based on IP over WDM, not only will consider the routing of WDM layer, also will consider the routing of IP layer, and logical links of the present invention is a light path.According to the present invention, preferential selection has been built logical links and has been come bearer IP service stream, in selecting the logical links process, preferentially select remaining bandwidth less, and take the less logical links of wavelength number of links, like this, will save wavelength link circuit resource as much as possible, thereby improve the utilance of the bandwidth resources of network, in addition, so also help the foundation of the business of big bandwidth, reduce service blocking rate.
Below with reference to Fig. 1 the method that the present invention determines routed path is described.
Step 1, according to the wavelength collection that optical fiber provided, the physical topology of given optical-fiber network is converted into some mutual non-conterminous wavelength plane, make up hierarchical topology figure, the cost function value of each wavelength link of initialization.
With the network physical topological representation be G (N, L, F, W), N representation node collection wherein, L represents the two-way link collection, F is the optical fiber collection on every link, W is the wavelength available collection on each optical fiber.Suppose that every link all is made up of the opposite one-way optical fiber of a pair of direction, every optical fiber provides | W| wavelength.Node number and number of links are used respectively | N| and | L| represents.Fig. 2 (a) shows a kind of physical topology figure, wherein, | N|=6, | L|=6, F are single fiber, | W|=2.(F W) can be configured to hierarchical topology figure shown in Fig. 2 (b) to physical topology G shown in Fig. 2 (a), in this hierarchical topology figure, 2 wavelength plane graph: λ is arranged for N, L 1Plane and λ 2The plane; G (N, L,, F, W) each the node N in k∈ N is replicated 1 time in each wavelength plane graph; Link l Mn∈ L is mapped on each wavelength plane, a wavelength of certain the bar optical fiber in the corresponding physical topology of every wavelength link.
Link in each wavelength plane graph of the present invention can be divided into two kinds of wavelength link and logical links.The wavelength link p mn i ∈ L Expression λ iWavelength channel on the wavelength plane between node m and the n promptly, refers among the physical topology G wavelength X between two adjacent nodes iCorresponding wavelength channel; Logical links l Mn iAmong the expression physical topology G, a logical links of between any two node m and n, setting up, this logical links uses wavelength X iBecause setting up logical links must take the wavelength link, therefore, after a logical links is set up, in hierarchical topology figure, just should remove the shared wavelength link of this logical links; All logical links on this wavelength link are removed, at λ iTo recover the shared wavelength link of logical links in the topological diagram on the wavelength plane.
After hierarchical topology figure set up, by formula (1) calculated the cost function value of every wavelength link on each wavelength plane.
Figure A20061015268700111
In formula (1), f Mn Pq, iBe illustrated in λ iWavelength link P on the wavelength plane Mn iBy logical links l Pq iThe situation that takies.When f mn pq , i = 1 The time, expression node m, n are at λ iWavelength link P on the wavelength plane Mn iBy logical links l Pq iTake, at this moment C ( p mn i ) = + ∞ , Mean that this wavelength link is occupied, its resource has been transferred on the logical links; When f mn pq , i = 0 , Be that the wavelength link is not used, then cost function value is a value by the common decision of multiple factor (as the physical length of this wavelength link, the cost of erection of this wavelength link), at this moment, and for wavelength link P Mn i, its cost function value C (P Mn i) can determine according to multiple factor (as physical length and/or construction cost), in the present invention, C (P Mn i) size do not influence effect of the present invention, therefore, each wavelength link on each wavelength plane can be made as identical value, as be made as 1.
Step 2, reception IP operation request message (hereinafter to be referred as business request information), described business request information comprise connection request message and discharge request message.The service connection request message table is shown r, and (b), wherein, s, d are respectively source, the place node signs that business request information is carried for s, d, and b is a bandwidth on demand; The professional required list that discharges is shown rl 1(b), wherein, s, d are respectively source, the place node signs that business request information is carried for s, d, and b is a bandwidth on demand.
Step 3, judge whether the type of business request information is connection request, if, execution in step 4, otherwise execution in step 24.
Step 4, when business request information is connection request message, according to the remaining bandwidth b of logical links on bandwidth on demand b and the wavelength plane i, by formula (2) calculate the cost function value c (l of each logical links on each wavelength plane Mn i).
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l - - - ( 2 )
H in the formula (2) Mn iBe that wavelength is λ iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth of each wavelength link, and α is cost function value coefficient (0＜α＜1), and α is used to adjust the remaining bandwidth and the proportion of shared wavelength number of links when routing of logical links, Min (C (P Uv i)) be the minimum cost functional value of all wavelengths link in each wavelength plane under the current network state.
By formula (2) as can be known, as the remaining bandwidth b of bandwidth on demand b greater than current logical links lThe time, i.e. b＞b lThe time, c (l Mn i) be+∞ that promptly, for the current business request, this logical links is unavailable.
By formula (2) as can be known, the remaining bandwidth b that is less than or equal to current logical links as bandwidth on demand b lThe time, i.e. b≤b lThe time, c (l Mn i) be At this moment because of
Figure A20061015268700123
Less than 1, so
Figure A20061015268700124
Less than Min (C (P Uv i), promptly Cost function value less than all wavelengths link in each wavelength plane under the current network state, promptly, the cost function value of arbitrary logical links is all less than the cost function value of all wavelengths link in each wavelength plane under the current network state, therefore, as long as when having wavelength link and logical links simultaneously between two nodes, according to the path principle of choosing the minimum cost functional value, all can preferentially choose logical links.This also just means, preferentially chooses the logical links set up the routed path as current business.
Figure A20061015268700126
In the multinomial, can be by choosing the proportion that suitable α comes remaining bandwidth and the shared wavelength number of links of this logical links in the balanced logic link.When 0＞α＞1, remaining bandwidth and wavelength number of links all will consider, and along with the increase of α, increase gradually at the shared proportion of wavelength number of links of source node to each bar logical links between the destination node, and the shared proportion of remaining bandwidth reduces gradually; When α equals 1, at source node to each bar logical links between the destination node, do not consider this factor of remaining bandwidth, according to the path principle of choosing the minimum cost functional value, can preferentially choose the routed path of the link of logic chain way minimum as current business, promptly preferential selection takies the less logical links of wavelength number of links in routing process, realizes aim of saving; When α equals 0, at source node to each bar logical links between the destination node, do not consider this factor of wavelength number of links, according to the path principle of choosing the minimum cost functional value, can preferentially choose the routed path of the link of remaining bandwidth minimum, so just can guarantee that the bigger service request of bandwidth on demand of follow-up arrival finds the probability of utilogic link bigger as current business.Therefore, according to
Figure A20061015268700131
Can preferred remaining bandwidth the routed path of the less logical links of wavelength number of links of putting in less and these 2 logical links as current business, and can be by choosing the proportion that suitable α adjusts remaining bandwidth and shared wavelength number of links in the logical links, thereby select the routed path of suitable logical links as current business.
Step 5, on each wavelength plane, can utilize dijkstra's algorithm (Di Jiesitela algorithm) to seek the path P of minimum cost functional value kAlso available other algorithm (as bellman-ford algorithm) is sought the path of minimum cost functional value, then, and with the path P of the minimum cost functional value that finds on each wavelength plane kCompare, choose the path P of minimum cost functional value k
Step 6, judge whether to find the path of many minimum cost functional values, if, execution in step 7, otherwise, execution in step 17.
If step 7 finds the path P of many minimum cost functional values k, judge whether the logic chain way that is comprised in each paths equates, if equate that then execution in step 9, otherwise, execution in step 8.
Step 8, choose the routed path of the maximum paths of logical links as current business, execution in step 10 then.
Step 9, according to the path P of First-fit criterion from many minimum cost functional values kThe middle routed path of selecting a paths as current business is perhaps selected any paths as this professional routed path, and is distributed the corresponding bandwidth resource, and execution in step 10 then.
Step lO, logical links is set up in path according to step 8 or the selected current business of step 9, promptly, the wavelength link of process on this path of deletion on the physical topology figure, newly-built and the corresponding logical links of wavelength link, revise on the current business path newly-built and built the available bandwidth of logical links again, promptly, the available bandwidth of newly-built logical links on the current business path is revised as the wavelength link bandwidth deducts bandwidth on demand, the available bandwidth of having built logical links on the current business path is revised as former available bandwidth deducts bandwidth on demand, return step 2 then, receive next business request information.
Step 17, when not finding mulitpath, judge whether to find the path of a minimum cost functional value, if, execution in step 18, otherwise, execution in step 19.
Step 18, with the routed path of this paths as current business, execution in step 10 then.
Step 19, refuse this service connection request, return step 2 then, receive next business request information.
If step 24 service request is to discharge request message, the available bandwidth that then will carry the logical links of described business is revised as former available bandwidth and adds bandwidth on demand.
Whether the available bandwidth of each bar logical links of the logical links of step 25, the described release request of judgement carrying equals the bandwidth of wavelength link, if then execution in step 26, otherwise, return step 2, receive next business request information.
Step 26, if the available bandwidth of logical links between the sourcesink node of the described release request message of carrying equals the bandwidth of wavelength link, illustrate and do not carry any business on it, then remove this logical links, on the hierarchical diagram of this logical links correspondence, recover the wavelength link that this logical links takies
The present invention need | move the Dijkstra shortest path algorithm respectively on W| the wavelength plane, the computation complexity of Dijkstra shortest path algorithm is O (N 2), like this for the IP over WDM optical interconnection network of N node, the computation complexity of MCTLN algorithm be O (| W|N 2).
Embodiment one
Below to receive three service connection request message (r 1, r 2, r 3), the professional request message (rl that discharges 1) method for routing of the present invention is described for example.When initial, do not have logical links, each wavelength link cost functional value is Δ Mn,, establish Δ for convenient narration Mn=1.
Receiving service connection request message is r 1(n 1, n 4, 0.4).Can be according to the remaining bandwidth 1 of logical links on the bandwidth on demand 0.4 of this connection request and the wavelength plane, by formula (2) calculate the cost function value of logical links on each wavelength plane respectively.
On each wavelength plane of hierarchical topology figure, on each wavelength plane, seek the path P of minimum cost functional value separately with the Dijkstra shortest path algorithm kλ in the hierarchical diagram shown in Fig. 2 (b) 1On the wavelength plane current business connection request message r 1(n 1, n 4, 0.4) and find shortest path (n 1 1, n 2 1, n 4 1), at λ 2Find shortest path (n on the wavelength plane 1 2, n 2 2, n 4 2), owing to find two shortest paths.Can select a paths or choose the path of a paths wantonly by the First-Fit criterion as current business; In two above-mentioned wavelength planes, two shortest path cost function value that find are 2, and the wavelength plane λ at two paths places 1, λ 2Last logical links number average is 0, chooses λ according to the First-Fit criterion 1Shortest path (n on the wavelength plane 1 1, n 2 1, n 4 1), and at λ 1Newly-built logical links (n on the wavelength plane 1 1, n 4 1).
At λ 1Newly-built logical links (n on the wavelength plane 1 1, n 4 1), delete it the wavelength link (n of process 1 1, n 2 1), (n 2 1, n 4 1), because the bandwidth capacity of every wavelength link is 1, set up logical links after, the bandwidth capacity of wavelength link is taken by logical links, then logical links (n 1 1, n 4 1) bandwidth capacity be 1, connecting bandwidth request by loaded service thereon is 0.4, then this logical links available bandwidth is 1-0.4=0.6 (shown in Fig. 2 (c)).
New service connection request r 2(n 1, n 5, 0.2) arrive.
The cost function value of computational logic link.At this moment, C ( l 14 1 ) = [ α h 14 1 N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) = 0.267 , (α gets 0.5).
With the Dijkstra shortest path algorithm at λ 1, λ 2Seek the footpath on two wavelength planes, shown in Fig. 2 (c), the path of minimum cost functional value is λ 1The wavelength plane on shortest path be (l 14 1, P 45), with P 45Become logical links l 45 1By logical links l 14 1And l 45 1Carrying request r 2
Deletion λ 1Wavelength link (n on the wavelength plane 4 1, n 5 1), with logical links l 14 1Remaining bandwidth change 0.6-0.2=0.4 into, with logical links l 45 1Remaining bandwidth change 1-0.2=0.8 into.This moment λ 1Hierarchical diagram shown in Fig. 2 (d), λ 2Hierarchical topology figure constant.Continue the latency services request message.
New service connection request message r 3(n 1, n 4, 0.7) arrive.
Computational logic link cost value.At this moment, C ( l 14 1 ) = + ∞ , C ( l 45 1 ) = [ α h 45 1 N ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) = 0.433 , (α gets 0.5).
With the Dijkstra shortest path algorithm at λ 1, λ 2Seek the footpath on two wavelength planes, λ in Fig. 2 (b) 2The wavelength plane on find the path (n of minimum cost functional value 1 2, n 2 2, n 4 2), this path is by wavelength link (n 1 2, n 2 2), (n 2 2, n 4 2) form.By these two wavelength links is the newly-built logical links l of this service connection request 14 2, by logical links l 14 2Carrying request r 3
Deletion λ 2(n on the wavelength plane 1 2, n 2 2), (n 2 2, n 4 2) two wavelength links, with logical links l 14 2Remaining bandwidth change 1-0.7=0.3 into.This moment λ 2Hierarchical diagram shown in Fig. 2 (e), λ 1Hierarchical diagram constant.Continue the latency services request message.
The professional request message rl that discharges 1(n 1, n 4, 0.4) arrive.
What this request will discharge is according to service connection request message r 1(n 1, n 4, 0.4) and the resource set up.Owing to be r 1(n 1, n 4, 0.4) and the logical links built is (n 1 1, n 4 1), at (n 1 1, n 4 1) remaining bandwidth on add 0.4, (n at this moment 1 1, n 4 1) remaining bandwidth be 0.8.The latency services request message.
The validity of the routing algorithm that proposes for check the present invention adopts the Computer Simulation checking.
In order better to compare and to analyze, the emulation topology adopts NSF Network backbone network, totally 14 nodes, 21 links.All nodes do not possess the wavelength conversion ability, observe the consistent wavelength restriction, as shown in Figure 3.
The condition that Computer Simulation of the present invention sets is as follows: in the physical topology of optical-fiber network, the one-way optical fiber that 1 pair of direction of every chain route is opposite is formed, and every optical fiber can be supported 4 wavelength, and the bandwidth capacity of each wavelength link is normalized to 1; The bandwidth on demand of service request is obeyed even distribution U (0,1); In NSF Network network, the source, the destination node that arrive request message are selected at random in node 1 to 9; Suppose that (s, d are the Poisson process arrival of β according to arrival rate b) to all connection request message r, and it is the exponential distribution of 1/ μ that the duration of the connection of building is obeyed average, supposes μ=1 in emulation.Allow to exist simultaneously between 1 pair of node a plurality of professional connections.Need set up logical links for each request that arrives.If this time request is not then refused in success.In case be rejected, just abandon immediately, promptly there is not waiting list.
Fig. 4 shows the influence of different α values to network blocking probability.In the emulation experiment blocking rate is defined as: connection request number/total connection request number of blocking rate=abandon.Therefrom we can see: (1), along with the increase of offered load, and network blocking probability also increases thereupon; (2), under the identical situation of professional arrival rate, when α=0.5, the blocking rate maximum.
Fig. 5 shows the situation that service request that α equals at 0.1,0.5,0.9 o'clock takies the logic chain way.What therefrom we were passable sees: under the identical situation of offered load,, take the logic chain way and also becoming big along with the variation of α, wherein α=0.1 maximum, 0.5 take second place, 0.9 minimum.In other words, α=0.1 o'clock newly-built light path at most, 0.5 take second place, 0.9 minimum.
Fig. 6 shows the situation that business that α equals at 0.1,0.5,0.9 o'clock takies the wavelength number of links, and from the simulation result of Fig. 7 as can be seen: when α equaled 0.1,0.5,0.9, pairing to take wavelength number of links size basic identical.
Fig. 7 shows the situation that α equals 0.1,0.5,0.9 o'clock network bandwidth utilance, therefrom as can be seen, at offered load hour, it is identical that α equals 0.1,0.5,0.9 Time Bandwidth utilance, but increase along with offered load, α equals 0.1 basic held stationary, and that α equals 0.5 and 0.9 curvilinear motion amplitude is bigger, no evident regularity.
Fig. 8 shows MCTLN, MinTH, three kinds of algorithms of MinLP situation to network bandwidth utilance, in the emulation experiment bandwidth availability ratio is defined as: bandwidth availability ratio=all bandwidth occupied by service/all logical links bandwidth, as can be seen from Figure 8: the bandwidth availability ratio of MCTLN is maximum, and MinTH bandwidth availability ratio minimum.
As shown in Figure 9, the invention also discloses a kind of routed path determining unit, comprising: receiving element, be used to receive business request information, described service connection request message comprises source node sign, destination node sign and bandwidth on demand; The path determining unit, be used for according to comprising that the network topological information of wavelength link, logical links and the source node of bandwidth on demand on each wavelength plane are to the path of seeking the cost function value minimum between the destination node, the path of described cost function value minimum is defined as the routed path of current business, and the cost function value of described logical links is less than the cost function value of arbitrary wavelength link in the network.
Described path determining unit comprises: computing unit is used for calculating by following formula the cost function value of each logical links on each wavelength plane:
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l
L in the formula Mn iExpression node m is to the logical links between the node n, h Mn iBe to be λ on the wavelength plane iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth capacity of each wavelength link, and α is cost function value coefficient (0＜α＜1), Min (C (P Uv i)) be the minimum cost functional value of each wavelength link on all wavelengths plane; The cost function value updating block is used for the cost function value renewal network topological information according to the logical links of computing unit gained; Obtain path unit, be used for the source node of network topological information on each wavelength plane that upgrade according to described updating block to seeking the path of cost function value minimum between the destination node, and the path of described cost function value minimum be defined as the routed path of current business; The topology information updating block, when the cost function value of cost functional value minimal path is not infinity, delete the wavelength link on the current business routed path in the topological diagram, and the remaining bandwidth of the logical links on the described current business routed path is deducted bandwidth on demand.
Though described the present invention by embodiment, those of ordinary skills know, without departing from the spirit and substance in the present invention, just can make the present invention that many distortion and variation are arranged, and scope of the present invention is limited to the appended claims.

Claims (10)

1. the method for a definite routed path is characterized in that, comprising:
A, reception service connection request message, described service connection request message comprises source node sign, destination node sign and bandwidth on demand;
B, according to comprising the network topological information of wavelength link, logical links and the source node of bandwidth on demand on each wavelength plane to the path of seeking the cost function value minimum between the destination node, the cost function value of described logical links is less than the cost function value of arbitrary wavelength link in the network;
C, the path of described cost function value minimum is defined as the routed path of current business.
2. method according to claim 1 is characterized in that, the cost function value of described logical links is directly proportional with the wavelength number of links of this logical links.
3. method according to claim 1 is characterized in that, the cost function value of described logical links is directly proportional with the remaining bandwidth of this logical links.
4. according to one of them described method of claim 1 to 3, it is characterized in that described step B specifically comprises:
B1, calculate the cost function value of each logical links on each wavelength plane, and utilize the cost function value of the logical links of gained to upgrade network topological information by following formula:
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l
L in the formula Mn iExpression node m is to the logical links between the node n, h Mn iBe to be λ on the wavelength plane iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth of each wavelength link, and α is cost function value coefficient (0＜α＜1), Min (C (P Uv i)) be the minimum cost functional value of each wavelength link on all wavelengths plane;
B2, according to the source node of network topological information on each wavelength plane that upgrades to the path of seeking the cost function value minimum between the destination node.
5. method according to claim 4, it is characterized in that, when the cost function value of cost functional value minimal path is not infinity, described method also comprises: newly-built logical links on the wavelength link of current business routed path, the wavelength link of newly-built logical links correspondence on the current business routed path in the deletion topological diagram, and the bandwidth of wavelength link composed to this newly-built logical links, the remaining bandwidth of all logical links on the described current business routed path is deducted bandwidth on demand.
6. method according to claim 1 is characterized in that, described method also comprises:
Receive the professional request message that discharges, the described professional request message that discharges comprises source node sign, destination node sign and bandwidth on demand;
Remaining bandwidth with the logical links of described source node to the path between the destination node in topological diagram adds bandwidth on demand.
7. method according to claim 6 is characterized in that, when the remaining bandwidth of the logical links on the path between destination node of the source node described in the topological diagram equals the wavelength link bandwidth, this logical links is reverted to the wavelength link.
8. a routed path determining unit is characterized in that, comprising:
Receiving element is used to receive business request information, and described service connection request message comprises source node sign, destination node sign and bandwidth on demand;
The path determining unit, be used for according to comprising that the network topological information of wavelength link, logical links and the source node of bandwidth on demand on each wavelength plane are to the path of seeking the cost function value minimum between the destination node, the path of described cost function value minimum is defined as the routed path of current business, and the cost function value of described logical links is less than the cost function value of arbitrary wavelength link in the network.
9. routed path determining unit according to claim 8 is characterized in that, described path determining unit comprises:
Computing unit is used for calculating by following formula the cost function value of each logical links on each wavelength plane:
c ( l mn i ) = [ α h mn i N + ( 1 - α ) b l C ] × Min ( C ( P uv i ) ) , b ≤ b l + ∞ , b > b l
L in the formula Mn iExpression node m is to the logical links between the node n, h Mn iBe to be λ on the wavelength plane iLogical links l Mn iThe wavelength number of links that takies, N is the node number of network, and C is the bandwidth of each wavelength link, and α is cost function value coefficient (0＜α＜1), Min (C (P Uv i)) be the minimum cost functional value of each wavelength link on all wavelengths plane;
The cost function value updating block is used for the cost function value renewal network topological information according to the logical links of computing unit gained;
Obtain path unit, be used for the source node of network topological information on each wavelength plane that upgrade according to described updating block to seeking the path of cost function value minimum between the destination node, and the path of described cost function value minimum be defined as the routed path of current business.
10. according to Claim 8 or 9 described routed path determining units, it is characterized in that, described routed path determining unit also comprises: the topology information updating block, when the cost function value of cost functional value minimal path is not infinity, delete the wavelength link on the current business routed path in the topological diagram, and the remaining bandwidth of the logical links on the described current business routed path is deducted bandwidth on demand.
CNA2006101526876A 2006-09-25 2006-09-25 Method for confirming routing path and its confirming unit Pending CN101155137A (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
CNA2006101526876A CN101155137A (en) 2006-09-25 2006-09-25 Method for confirming routing path and its confirming unit
AT07720919T ATE480076T1 (en) 2006-09-25 2007-04-23 METHOD FOR DETERMINING A ROUTE AND ROUTE DETERMINATION UNIT
DE602007008913T DE602007008913D1 (en) 2006-09-25 2007-04-23 METHOD FOR DETERMINING A ROAD PATH AND ROAD DETERMINATION UNIT
CNA2007800004015A CN101517985A (en) 2006-09-25 2007-04-23 Method for determining routing path and determination unit for routing path
ES07720919.5T ES2352518T5 (en) 2006-09-25 2007-04-23 A method for determining the routing route and a unit for determining said route field of the invention
EP07720919.5A EP2058986B2 (en) 2006-09-25 2007-04-23 A method for determining a routing path and a routing path determination unit
PCT/CN2007/001346 WO2008037155A1 (en) 2006-09-25 2007-04-23 A method for determining a routing path and a routing path determination unit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2006101526876A CN101155137A (en) 2006-09-25 2006-09-25 Method for confirming routing path and its confirming unit

Publications (1)

Publication Number Publication Date
CN101155137A true CN101155137A (en) 2008-04-02

Family

ID=39229719

Family Applications (2)

Application Number Title Priority Date Filing Date
CNA2006101526876A Pending CN101155137A (en) 2006-09-25 2006-09-25 Method for confirming routing path and its confirming unit
CNA2007800004015A Pending CN101517985A (en) 2006-09-25 2007-04-23 Method for determining routing path and determination unit for routing path

Family Applications After (1)

Application Number Title Priority Date Filing Date
CNA2007800004015A Pending CN101517985A (en) 2006-09-25 2007-04-23 Method for determining routing path and determination unit for routing path

Country Status (6)

Country Link
EP (1) EP2058986B2 (en)
CN (2) CN101155137A (en)
AT (1) ATE480076T1 (en)
DE (1) DE602007008913D1 (en)
ES (1) ES2352518T5 (en)
WO (1) WO2008037155A1 (en)

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102026051A (en) * 2010-12-13 2011-04-20 西安交通大学 Layered virtual topology-based cross-granularity layer survivability method
CN101626523B (en) * 2008-07-10 2011-06-29 中国移动通信集团天津有限公司 Method and device for scheduling circuit resources
CN102137026A (en) * 2011-04-29 2011-07-27 东北大学 Multiconstraint and multicast routing method in WDM (Wavelength Division Multiplexing) optical network
CN102186126A (en) * 2011-04-29 2011-09-14 东北大学 Special unicast multi-layer protective method based on load equalization in optical network
CN102271294A (en) * 2011-04-29 2011-12-07 东北大学 Load balance-based unicast share multi-layer protection method in optical fiber network
CN102281201A (en) * 2011-08-29 2011-12-14 中国联合网络通信集团有限公司 route selection and resource distribution method and device
CN102480433A (en) * 2010-11-26 2012-05-30 财团法人工业技术研究院 Network server and load balancing routing method for networks thereof
CN102655478A (en) * 2012-04-30 2012-09-05 黄林果 Path selection method based on mixed service awareness
CN102665149A (en) * 2012-04-20 2012-09-12 北京联合大学 Route constraint based method and device for allocating wavelength
CN102907053A (en) * 2012-08-01 2013-01-30 华为技术有限公司 Wavelength division network planning method and equipment
CN104301216A (en) * 2014-10-30 2015-01-21 国家电网公司 Business data flow direction control method and device
CN104753751A (en) * 2013-12-27 2015-07-01 中兴通讯股份有限公司 Method and system for dynamically determining virtual network
CN105245307A (en) * 2015-09-08 2016-01-13 北京邮电大学 Method of determining communication path in communication network and equipment
CN105847380A (en) * 2016-04-18 2016-08-10 乐视控股（北京）有限公司 UDP acceleration method and system in content distribution network
WO2016127368A1 (en) * 2015-02-12 2016-08-18 华为技术有限公司 Path selection method, device and system
CN106961389A (en) * 2016-01-08 2017-07-18 中兴通讯股份有限公司 A kind of route selection method and device
CN107533437A (en) * 2015-09-24 2018-01-02 慧与发展有限责任合伙企业 Elastic store structure
CN109429117A (en) * 2017-08-30 2019-03-05 中国移动通信集团设计院有限公司 Route selection method and equipment
WO2020061791A1 (en) * 2018-09-26 2020-04-02 深圳大学 Wdm optical network optimization method based on waveband switching
CN112564845A (en) * 2019-09-10 2021-03-26 华为技术有限公司 Method for determining logical connection and related equipment
CN113347098A (en) * 2021-06-01 2021-09-03 中国联合网络通信集团有限公司 Network routing method and device

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102036173B (en) * 2009-09-28 2013-06-12 华为技术有限公司 Method and device for wireless network data transmission
FR2973975B1 (en) * 2011-04-05 2013-03-22 Alcatel Lucent METHOD FOR OBTAINING INFORMATION ON THE OPERATING STATES OF NODES OF A COMMUNICATION NETWORK FOR OPTIMIZED ENERGY-RATE ROUTING, AND DEVICE THEREOF
EP3136649B1 (en) * 2015-08-27 2018-03-14 Alcatel Lucent Method and system for providing load information of an optical data transmission system
CN108462638B (en) * 2016-12-12 2021-05-25 中国电信股份有限公司 Method and system for determining service route
CN112788744B (en) 2019-11-01 2022-04-12 维沃移动通信有限公司 Connection processing method and communication device
CN112866109B (en) * 2021-02-05 2023-02-03 北方工业大学 Routing method for network traffic engineering
CN114039920B (en) * 2021-10-19 2022-07-12 苏州大学 Load balancing flow grooming method and system based on IP over Quasi-CWDM network
CN114338503B (en) * 2022-01-04 2022-11-22 武汉烽火技术服务有限公司 Method and device for adjusting domain resources in communication network
CN114697268B (en) * 2022-03-24 2024-02-09 中天宽带技术有限公司 Flow control method and device and electronic equipment

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6195553B1 (en) * 1999-04-20 2001-02-27 Analytical Graphics, Inc. Method and apparatus for determining optimal paths among objects of a communications network
US7380017B2 (en) * 2001-05-03 2008-05-27 Nortel Networks Limited Route protection in a communication network
US7725035B2 (en) * 2004-04-20 2010-05-25 Fujitsu Limited Method and system for managing network traffic
CN100361445C (en) * 2004-12-17 2008-01-09 电子科技大学 Integrated service leading method for WDM optical network

Cited By (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101626523B (en) * 2008-07-10 2011-06-29 中国移动通信集团天津有限公司 Method and device for scheduling circuit resources
CN102480433A (en) * 2010-11-26 2012-05-30 财团法人工业技术研究院 Network server and load balancing routing method for networks thereof
US8862775B2 (en) 2010-11-26 2014-10-14 Industrial Technology Research Institute Network server and load balancing routing method for networks thereof
CN102480433B (en) * 2010-11-26 2014-10-01 财团法人工业技术研究院 Network server and load balancing routing method for networks thereof
CN102026051B (en) * 2010-12-13 2013-01-02 西安交通大学 Layered virtual topology-based cross-granularity layer survivability method
CN102026051A (en) * 2010-12-13 2011-04-20 西安交通大学 Layered virtual topology-based cross-granularity layer survivability method
CN102271294A (en) * 2011-04-29 2011-12-07 东北大学 Load balance-based unicast share multi-layer protection method in optical fiber network
CN102186126A (en) * 2011-04-29 2011-09-14 东北大学 Special unicast multi-layer protective method based on load equalization in optical network
CN102137026A (en) * 2011-04-29 2011-07-27 东北大学 Multiconstraint and multicast routing method in WDM (Wavelength Division Multiplexing) optical network
CN102271294B (en) * 2011-04-29 2013-07-24 东北大学 Load balance-based unicast share multi-layer protection method in optical fiber network
CN102137026B (en) * 2011-04-29 2013-07-24 东北大学 Multiconstraint and multicast routing method in WDM (Wavelength Division Multiplexing) optical network
CN102186126B (en) * 2011-04-29 2013-11-06 东北大学 Special unicast multi-layer protective method based on load equalization in optical network
CN102281201A (en) * 2011-08-29 2011-12-14 中国联合网络通信集团有限公司 route selection and resource distribution method and device
CN102665149A (en) * 2012-04-20 2012-09-12 北京联合大学 Route constraint based method and device for allocating wavelength
CN102655478A (en) * 2012-04-30 2012-09-05 黄林果 Path selection method based on mixed service awareness
CN102907053B (en) * 2012-08-01 2014-10-08 华为技术有限公司 Wavelength division network planning method and equipment
WO2014019167A1 (en) * 2012-08-01 2014-02-06 华为技术有限公司 Planning method and device for wavelength division multiplexing network
CN102907053A (en) * 2012-08-01 2013-01-30 华为技术有限公司 Wavelength division network planning method and equipment
CN104753751A (en) * 2013-12-27 2015-07-01 中兴通讯股份有限公司 Method and system for dynamically determining virtual network
CN104301216A (en) * 2014-10-30 2015-01-21 国家电网公司 Business data flow direction control method and device
WO2016127368A1 (en) * 2015-02-12 2016-08-18 华为技术有限公司 Path selection method, device and system
CN105245307A (en) * 2015-09-08 2016-01-13 北京邮电大学 Method of determining communication path in communication network and equipment
CN105245307B (en) * 2015-09-08 2018-09-11 北京邮电大学 Method and apparatus for determining communication path in a communication network
CN107533437A (en) * 2015-09-24 2018-01-02 慧与发展有限责任合伙企业 Elastic store structure
CN106961389A (en) * 2016-01-08 2017-07-18 中兴通讯股份有限公司 A kind of route selection method and device
CN105847380A (en) * 2016-04-18 2016-08-10 乐视控股（北京）有限公司 UDP acceleration method and system in content distribution network
CN109429117A (en) * 2017-08-30 2019-03-05 中国移动通信集团设计院有限公司 Route selection method and equipment
WO2020061791A1 (en) * 2018-09-26 2020-04-02 深圳大学 Wdm optical network optimization method based on waveband switching
CN112564845A (en) * 2019-09-10 2021-03-26 华为技术有限公司 Method for determining logical connection and related equipment
CN112564845B (en) * 2019-09-10 2022-03-08 华为技术有限公司 Method for determining logical connection and related equipment
CN113347098A (en) * 2021-06-01 2021-09-03 中国联合网络通信集团有限公司 Network routing method and device
CN113347098B (en) * 2021-06-01 2022-11-22 中国联合网络通信集团有限公司 Network routing method and device

Also Published As

Publication number Publication date
EP2058986A4 (en) 2009-11-11
EP2058986A1 (en) 2009-05-13
EP2058986B2 (en) 2014-06-18
WO2008037155A1 (en) 2008-04-03
EP2058986B1 (en) 2010-09-01
ES2352518T3 (en) 2011-02-21
DE602007008913D1 (en) 2010-10-14
CN101517985A (en) 2009-08-26
ATE480076T1 (en) 2010-09-15
ES2352518T5 (en) 2014-10-06

Similar Documents

Publication Publication Date Title
CN101155137A (en) Method for confirming routing path and its confirming unit
Gerstel et al. Cost-effective traffic grooming in WDM rings
Dutta et al. A survey of virtual topology design algorithms for wavelength routed optical networks
US7899326B2 (en) System for utilizing wavelength reachability and wavelength occupation status information to describe cross-connection capabilities in optical networks
US7113481B2 (en) Informed dynamic path protection for optical networks
CN101052235B (en) Business combing method and device for ASON special protection
CN104836736A (en) Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network
CN101322343A (en) Multicast protection method and device in WDM optical network
US6711324B1 (en) Software model for optical communication networks
Yao et al. Rerouting schemes for dynamic traffic grooming in optical WDM mesh networks
Zhang et al. Dynamic light trail routing in WDM optical networks
CN102186123B (en) Multicast-sharing and multilayer protection method based on subtrees in WDM (wavelength division multiplexer) optical network,
CN100579025C (en) Route information maintaining method of automatic exchange optical network
CN101248700A (en) Discovery of an adjacent network element within a network data plane
Yu et al. Historical data learning based dynamic LSP routing for overlay IP/MPLS over WDM networks
WO2008011770A1 (en) System for utilizing wavelength reachability and wavelength occupation status information to describe cross-connection capabilities in optical networks
Lu et al. Asymmetric CDC ROADM architecture for efficient support of bi-directional asymmetric traffic demands
EP3128690B1 (en) A method and apparatus for traffic engineering on an optical transport network
CN101841466A (en) Optical network routing method based on diffusion of information
CN102271294B (en) Load balance-based unicast share multi-layer protection method in optical fiber network
Gumaste et al. Light-frames: A pragmatic framework for optical packet transport
Chowdhary et al. A cost effective approach for survivable multicast traffic grooming in bidirectional multiwavelength ring networks
Tran et al. Design of logical topology for IP over WDM networks: Network performance vs. resource utilization
Su et al. Joint routing and resource allocation in optical transport networks
Wu et al. Multi-domain grooming algorithm based on hierarchical integrated multi-granularity auxiliary graph in optical mesh networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20080402