CN103441929B - A kind of method reducing Wavelength continuity constraint based on WSON network - Google Patents
A kind of method reducing Wavelength continuity constraint based on WSON network Download PDFInfo
- Publication number
- CN103441929B CN103441929B CN201310428033.1A CN201310428033A CN103441929B CN 103441929 B CN103441929 B CN 103441929B CN 201310428033 A CN201310428033 A CN 201310428033A CN 103441929 B CN103441929 B CN 103441929B
- Authority
- CN
- China
- Prior art keywords
- wavelength
- road
- total
- network
- calculate
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
- H04J14/0254—Optical medium access
- H04J14/0256—Optical medium access at the optical channel layer
- H04J14/0257—Wavelength assignment algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
- H04J14/0254—Optical medium access
- H04J14/0267—Optical signaling or routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Optical Communication System (AREA)
Abstract
The present invention relates to WSON network wavelength control techniques field, specifically a kind of method reducing Wavelength continuity constraint based on WSON network, in WSON network, routing module is after the wavelength receiving to specify calculates the request of route, first adopting traditional mode to calculate path, terminating if calculating successfully Ze Suan road；Otherwise carry out wavelength to select to calculate road；Described wavelength selects to calculate road and includes total wavelength calculation road and multilamellar graphic calculation road two parts, first enabling total wavelength and calculates road, terminating if calculating successfully Ze Suan road；When total wavelength calculates road failure, then enable multilamellar graphic calculation road.The method reducing Wavelength continuity constraint based on WSON network of the present invention, reduces and limits without wavelength conversion WSON network medium wavelength seriality, reduces and sets up Wavelength conflict during optical channel, reduces and connects blocking rate.
Description
Technical field
The present invention relates to WSON(wavelength ASON) network wavelength control techniques field, specifically a kind of method reducing Wavelength continuity constraint based on WSON network.Described WSON is espespecially without the WSON of wavelength conversion.
Background technology
WSON is based on wavelength-division multiplex (WDM) and transmits the automatic switching network (ASON) of net, wavelength networks is introduced by plane will be controlled, adopt the control plane technologies such as generalized multiprotocol label switching (GMPLS) protocol (GMPLS) and path-calculating element (PCE), realize the dynamic dispatching of Wavelength routing, realize the intellectuality of Wavelength dispatching, improve the motility of WDM network scheduling and the efficiency of network management.
In order to set up a connection (adopting the optical channel of certain wavelength) in WSON network, it needs to be determined that a route (link namely passed through and node), to be that this connects the one or more available wavelength of distribution simultaneously, here it is route symmetry (RWA) problem in WSON.In traditional circuit-switched network, if one connects and crosses over multilink, as long as the words of bandwidth resources available free in each of the links just can set up such connection.But in WSON, have some limitations.If WSON lacks wavelength shifter, set up a wavelength channel end to end, so be not only required in through link on available free wavelength, and must have identical free wavelength in these links, this Wavelength continuity constraint is the absence of in the WSON of wavelength shifter an important restrictive condition.
The same with traditional circuit switching, the connection blocking rate of ASON is an important indicator of reflection network performance and service quality.In a wavelength networks (WSON network) not having wavelength conversion function, owing to there is Wavelength continuity constraint, it is possible to because Route Blocking or resource are short of and can not set up required light-path, connection request is by blocked.
Summary of the invention
For the defect existed in prior art, it is an object of the invention to provide a kind of method reducing Wavelength continuity constraint based on WSON network, reduce and limit without wavelength conversion WSON network medium wavelength seriality, reduce and set up Wavelength conflict during optical channel, reduce and connect blocking rate.
For reaching object above, the present invention adopts the technical scheme that:
A kind of method reducing Wavelength continuity constraint based on WSON network, it is characterised in that: in WSON network, routing module, after the wavelength receiving to specify calculates the request of route, first adopting traditional mode to calculate path, terminating if calculating successfully Ze Suan road；Otherwise carry out wavelength to select to calculate road；
Described wavelength selects to calculate road and includes total wavelength calculation road and multilamellar graphic calculation road two parts, first enabling total wavelength and calculates road, terminating if calculating successfully Ze Suan road；When total wavelength calculates road failure, then enable multilamellar graphic calculation road.
On the basis of technique scheme, described total wavelength calculates concretely comprising the following steps of road: whether will there is total wavelength as route restriction, calculate a shortest path, if router-level topology success, then appoint the wavelength taking the adjustment after a ripple selects as wavelength from total wavelength.
On the basis of technique scheme, it may be judged whether there is total wavelength and adopt dijkstra's algorithm.
On the basis of technique scheme, described dijkstra's algorithm, when judging that whether current hop is available, checks whether the free wavelength of current hop and the free wavelength of all of hop of forward direction have total wavelength, if not total wavelength, then current hop is unavailable.
On the basis of technique scheme, it may be judged whether there is concretely comprising the following steps of total wavelength: set the total wavelength X in whole piece pathmulFor taking common factor from the free wavelength of all hop of source to destination, if { λmul} ≠ empty set, then illustrate there is the wavelength path meeting Wavelength continuity constraint, therefrom appoint and take a wavelength Xf∈{λmul, then set up corresponding optical path；If { λmul}=empty set, then illustrate to be absent from wavelength path.
On the basis of technique scheme, concretely comprising the following steps of described multilamellar graphic calculation road: the optical-fiber network that has W wavelength is thought the superposition of W the network with same physical topological structure, the wavelength of each Web vector graphic with same physical topological structure is different and unique
Have on the network of same physical topological structure be utilized respectively Constraint Shortest Path First at W carry out pathfinding, obtain a plurality of shortest path corresponding to different wave length, being compared according to route restriction in these paths, optimum one is final wavelength path again.
The method reducing Wavelength continuity constraint based on WSON network of the present invention, reduces and limits without wavelength conversion WSON network medium wavelength seriality, reduces and sets up Wavelength conflict during optical channel, reduces and connects blocking rate.
Accompanying drawing explanation
The present invention has drawings described below:
Fig. 1: physical topology illustrated example,
Fig. 2-1: it is physical topology during λ 1 optical channel that traditional approach builds wavelength,
Fig. 2-2: it is physical topology during λ 6 optical channel that traditional approach builds wavelength,
Fig. 3-1: during multilamellar graphic calculation road λ 1, λ 2, λ 3} physical topology,
Fig. 3-2: during multilamellar graphic calculation road the physical topology of λ 4},
Fig. 3-3: during multilamellar graphic calculation road the physical topology of λ 5},
Fig. 3-4: during multilamellar graphic calculation road the physical topology of λ 6},
Fig. 3-the 5: { physical topology of λ 7} during multilamellar graphic calculation road.
Detailed description of the invention
Below in conjunction with accompanying drawing, the present invention is described in further detail.
Current WSON(is without the WSON of wavelength conversion) in when calculating Wavelength routing, it is assumed that as required to specify the wavelength X this time calculating road1, this just requires that routing module finds the free wavelength having this public in all fiber segments of a process in whole network topology, and meets the shortest path of constraints.For the wavelength (λ such as assumed specified1), it is possible to all of fiber segment there is the path that this wavelength is idle calculate road failure because cannot find.The present invention mainly cannot calculate in the successful situation in road at the wavelength specified, and automatically selects another and meets wavelength continuity and calculate road successful wavelength (such as wavelength X2).
The method reducing Wavelength continuity constraint based on WSON network of the present invention, comprises the following steps:
In WSON network, routing module, after the wavelength receiving to specify calculates the request of route, first adopting traditional mode to calculate path, terminating if calculating successfully Ze Suan road；Otherwise carry out wavelength to select to calculate road；
Described wavelength selects to calculate road and includes total wavelength calculation road and multilamellar graphic calculation road two parts, first enabling total wavelength and calculates road, terminating if calculating successfully Ze Suan road；When total wavelength calculates road failure, then enable multilamellar graphic calculation road.
On the basis of technique scheme, described total wavelength calculates concretely comprising the following steps of road: whether will there is total wavelength as route restriction, calculate a shortest path, if router-level topology success, then appoint the wavelength taking the adjustment after a ripple selects as wavelength from total wavelength.
On the basis of technique scheme, it may be judged whether there is total wavelength and adopt dijkstra's algorithm,
Described dijkstra's algorithm is judging that current hop(jumps, route is often through a node, it is called a jumping, that is: referring to forward in network at packet, packet, through router or the process transferring to other networks either directly through node, calculates successfully route, represent with jumping) whether available time, checking whether the free wavelength of current hop and the free wavelength of all of hop of forward direction have total wavelength, if not total wavelength, then current hop is unavailable；
If the total wavelength X in whole piece pathmulFor taking common factor from the free wavelength of all hop of source to destination, if { λmul} ≠ empty set, then illustrate there is the wavelength path meeting Wavelength continuity constraint, therefrom appoint and take a wavelength Xf∈{λmul, then set up corresponding optical path；If { λmul}=empty set, then illustrate to be absent from wavelength path.
The foregoing describe total wavelength and calculate the principle on road.In traditional route computing method, when calculating route, necessarily refer to devise a stratagem and calculate the route of which wavelength, and each jumping of the route calculated will have this wavelength, if in every paths that sourcesink node is possible, not having this wavelength as long as having in a jumping, then calculate routing failure, this is Wavelength continuity constraint.Total wavelength calculates path method, and while calculating path, what calculate all jumpings is the same from wavelength, is the total wavelength in whole piece path.
On the basis of technique scheme, concretely comprising the following steps of described multilamellar graphic calculation road: the value by with W(W is the positive integer be more than or equal to 2) optical-fiber network of individual wavelength thinks the superposition of W the network with same physical topological structure, the wavelength of each Web vector graphic with same physical topological structure is different and unique, that is: the wavelength of first Web vector graphic with same physical topological structure is λ 1, the wavelength of second Web vector graphic with same physical topological structure is λ 2, the wavelength of the 3rd Web vector graphic with same physical topological structure is λ 3, ..., the rest may be inferred,
Have on the network of same physical topological structure be utilized respectively Constraint Shortest Path First (CSPF) at W carry out pathfinding, obtain a plurality of shortest path corresponding to different wave length, being compared according to route restriction in these paths, optimum one is final wavelength path again.
In multilamellar graphic calculation road, route restriction does not refer to there is common wavelength, and refers to that the route of selection needs to meet other restrictive condition, as through/or cannot pass through certain (a bit) node etc..
Illustrate for Fig. 1 below.
As it is shown in figure 1, for setting up physical topology illustrated example during optical channel, on link, bracket represents the information of the wavelength of each link idle.Idle wavelength information on link topology and each link is by flooding at the whole network, and so each node both knows about topology and the link information of whole network.
Route is calculated in design: source is node A, place is node H, it is intended that wavelength is λ 1.Source node A first by wavelength X 1 be idle link abstract after form topology such as Fig. 2-1, calculate route according to the traditional mode of this topological diagram employing: A-C-D-E-F-H, wavelength is λ 1.
Route is calculated in design: source is node A, place is node H, it is intended that wavelength is λ 6.The abstract rear topology that formed of link that wavelength X 6 is idle is such as Fig. 2-2, it is clear that now cannot calculate route.This is given as solution by the present invention:
When route cannot be calculated, total wavelength is first adopted to calculate road.Calculate route: source is A, place is H.According to dijkstra's algorithm, have A-C-F-H, A-C-G-F-H and A-C-D-E-F-H tri-paths optional:
1. A-C-F-H is when arriving F point, and it is { λ 7} that the free wavelength of A-C, C-F section takes common factor；
2. A-C-G-F-H is when arriving F point, and it is { λ 4} that the free wavelength of A-C, C-G, G-F section takes common factor；
3. A-C-D-E-F-H is when arriving F point, and it is { λ 1, λ 2, λ 3, λ 4} that the free wavelength of A-C, C-D, D-E, E-F section takes common factor.
After arriving F point, it is thus necessary to determine that a paths, if according to the principle that link cost is minimum, then select common factor { λ 1, λ 2, λ 3, the λ 4} of the free wavelength of A-C-D-E-F-H, A-F and the free wavelength of F-H.Therefore A-C-D-E-F-H is last calculation road result, and wavelength available is { λ 1, λ 2, λ 3, λ 4}.
If arriving after F point, according to the principle that node is minimum, from A-C-F-H, A-C-G-F-H and A-C-D-E-F-H tri-, paths determines a paths, then select A-C-F-H.But now the common factor of the free wavelength that the free wavelength of A-F is disconnected with F-H is empty set, calculates unsuccessfully, although also have a paths A-C-G-F-H, wavelength can be used for available λ 4.Total wavelength is calculated road and cannot be calculated road success in this case.
In order to avoid this kind of situation, multilamellar graphic calculation path method can be used to recalculate route.First the network having 7 wavelength in Fig. 1 is thought the superposition of 7 networks with same physical topological structure, can be abstract in { λ 1, λ 2, λ 3}, { λ 4}, { λ 5}, { λ 6}, { superposition of the physical topology of λ 7}, its topology respectively Fig. 3-1, Fig. 3-2, Fig. 3-3, Fig. 3-4, Fig. 3-5 with upper topology.
Respectively these topologys taken out are calculated to the route of A to H, according to the principle that node is minimum, obtain the wavelength topology of route that may be present and correspondence:
A-C-D-E-F-H, { λ 1, λ 2, λ 3} physical topology；
A-C-G-F-H, { λ 4} physical topology.
Further according to the principle (node is minimum) selecting route, from route that may be present, select a route and select the wavelength of correspondence.Last calculation road result is A-C-G-F-H, and wavelength available is { λ 4}.
By the invention it is possible to need not reconstruct on the basis of router-level topology core algorithm, efficiently reduce the restriction of wavelength continuity during road construction, it is to avoid Wavelength conflict, reduce and connect blocking rate, improve the service quality of network.Estimate that the method is effectively applied in the WSON without wavelength translation function, and produce bigger economic benefit.
The content not being described in detail in this specification belongs to the known prior art of professional and technical personnel in the field.
Claims (3)
1. the method reducing Wavelength continuity constraint based on WSON network, it is characterised in that: in WSON network, routing module, after the wavelength receiving to specify calculates the request of route, first adopting traditional mode to calculate path, terminating if calculating successfully Ze Suan road；Otherwise carry out wavelength to select to calculate road；When adopting traditional mode to calculate path, it is necessary to specify the route calculating which wavelength, and each jumping of the route calculated will have this wavelength, if in every paths that sourcesink node is possible, not having this wavelength as long as having in a jumping, then calculate routing failure, this is Wavelength continuity constraint；
Described wavelength selects to calculate road and includes total wavelength calculation road and multilamellar graphic calculation road two parts, first enabling total wavelength and calculates road, terminating if calculating successfully Ze Suan road；When total wavelength calculates road failure, then enable multilamellar graphic calculation road；
Described total wavelength calculates concretely comprising the following steps of road: whether will there is total wavelength as route restriction, and calculate a shortest path, if router-level topology success, then appoints the wavelength taking the adjustment after a ripple selects as wavelength from total wavelength；Judge whether that total wavelength adopts dijkstra's algorithm；
Concretely comprising the following steps of described multilamellar graphic calculation road: the optical-fiber network that has W wavelength is thought the superposition of W the network with same physical topological structure, the wavelength of each Web vector graphic with same physical topological structure is different and unique, have on the network of same physical topological structure be utilized respectively Constraint Shortest Path First at W carry out pathfinding, obtain a plurality of shortest path corresponding to different wave length, being compared according to route restriction in these paths, optimum one is final wavelength path again.
2. the method reducing Wavelength continuity constraint based on WSON network as claimed in claim 1, it is characterized in that: described dijkstra's algorithm is when judging that whether current hop is available, check whether the free wavelength of current hop and the free wavelength of all of hop of forward direction have total wavelength, if not total wavelength, then current hop is unavailable.
3. the method reducing Wavelength continuity constraint based on WSON network as claimed in claim 1, it is characterised in that: judge whether concretely comprising the following steps of total wavelength: set the total wavelength X in whole piece pathmulFor taking common factor from the free wavelength of all hop of source to destination, if { λmul} ≠ empty set, then illustrate there is the wavelength path meeting Wavelength continuity constraint, therefrom appoint and take a wavelength Xf∈{λmul, then set up corresponding optical path；If { λmul}=empty set, then illustrate to be absent from wavelength path.
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310428033.1A CN103441929B (en) | 2013-09-17 | 2013-09-17 | A kind of method reducing Wavelength continuity constraint based on WSON network |
| MYPI2016700320A MY180914A (en) | 2013-09-17 | 2014-08-29 | Wson-based wavelength-continuity constraint reduction method |
| PCT/CN2014/085540 WO2015039554A1 (en) | 2013-09-17 | 2014-08-29 | Wson-based wavelength-continuity constraint reduction method |
| RU2015156802A RU2653318C2 (en) | 2013-09-17 | 2014-08-29 | Wson-based wavelength-continuity constraint reduction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310428033.1A CN103441929B (en) | 2013-09-17 | 2013-09-17 | A kind of method reducing Wavelength continuity constraint based on WSON network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103441929A CN103441929A (en) | 2013-12-11 |
| CN103441929B true CN103441929B (en) | 2016-07-06 |
Family
ID=49695595
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310428033.1A Active CN103441929B (en) | 2013-09-17 | 2013-09-17 | A kind of method reducing Wavelength continuity constraint based on WSON network |
Country Status (4)
| Country | Link |
|---|---|
| CN (1) | CN103441929B (en) |
| MY (1) | MY180914A (en) |
| RU (1) | RU2653318C2 (en) |
| WO (1) | WO2015039554A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103441929B (en) * | 2013-09-17 | 2016-07-06 | 烽火通信科技股份有限公司 | A kind of method reducing Wavelength continuity constraint based on WSON network |
| CN105610713B (en) * | 2015-12-22 | 2019-03-19 | 国网湖北省电力公司咸宁供电公司 | A kind of ASON method for routing of Electric control business |
| CN106060682B (en) * | 2016-05-27 | 2019-04-19 | 深圳大学 | Wavestrip method for routing based on cascaded structure layering optical cross connect |
| CN107317649B (en) * | 2017-06-13 | 2019-01-18 | 烽火通信科技股份有限公司 | The calculation method and its system of shortest path based on WSON damage model |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN101908942A (en) * | 2009-06-05 | 2010-12-08 | 华为技术有限公司 | Method for transmitting damage information, node and network system |
| CN102348138A (en) * | 2011-11-10 | 2012-02-08 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002075971A2 (en) * | 2001-03-20 | 2002-09-26 | Siemens Aktiengesellschaft | Optical transmission system with variable network limits |
| CN100361445C (en) * | 2004-12-17 | 2008-01-09 | 电子科技大学 | Integrated service leading method for WDM optical network |
| CN101883293B (en) * | 2009-05-06 | 2013-02-27 | 中兴通讯股份有限公司 | Method and device for realizing K optimal path algorithm under condition of multiple sides among neighboring nodes |
| EP2706708B1 (en) * | 2011-05-24 | 2015-09-16 | Huawei Technologies Co., Ltd. | Method and apparatus for path selection |
| CN103441929B (en) * | 2013-09-17 | 2016-07-06 | 烽火通信科技股份有限公司 | A kind of method reducing Wavelength continuity constraint based on WSON network |
-
2013
- 2013-09-17 CN CN201310428033.1A patent/CN103441929B/en active Active
-
2014
- 2014-08-29 WO PCT/CN2014/085540 patent/WO2015039554A1/en active Application Filing
- 2014-08-29 RU RU2015156802A patent/RU2653318C2/en active
- 2014-08-29 MY MYPI2016700320A patent/MY180914A/en unknown
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101908942A (en) * | 2009-06-05 | 2010-12-08 | 华为技术有限公司 | Method for transmitting damage information, node and network system |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN102348138A (en) * | 2011-11-10 | 2012-02-08 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103441929A (en) | 2013-12-11 |
| RU2015156802A (en) | 2017-10-23 |
| RU2653318C2 (en) | 2018-05-07 |
| WO2015039554A1 (en) | 2015-03-26 |
| MY180914A (en) | 2020-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1395003B1 (en) | Constraint-based shortest path first method for dynamically switched optical transport networks | |
| US8488963B2 (en) | Link diversity and load balancing across digital and optical express-thru nodes | |
| US7990946B2 (en) | Node apparatus and path setup method | |
| KR101643911B1 (en) | Method and related apparatus for establishing link-diverse traffic paths in a telecommunications network | |
| US20110255443A1 (en) | Virtual routers for gmpls networks | |
| US7639607B2 (en) | Signaling system for simultaneously and autonomously setting a spare path | |
| WO2014081766A1 (en) | Bandwidth on-demand services in multiple layer networks | |
| CN103795628A (en) | Provider link state bridging (PLSB) computation method | |
| US8233487B2 (en) | Communication network system that establishes communication path by transferring control signal | |
| US20140269296A1 (en) | Systems and Methods of Bundled Label Switch Path for Load Splitting | |
| CN103441929B (en) | A kind of method reducing Wavelength continuity constraint based on WSON network | |
| US7639944B2 (en) | Method for protecting cross-ring service in optical network | |
| KR20120066234A (en) | Apparatus and method for managing multilevel link based on generalized multiprotocol label switching for cross layer network | |
| US20170104551A1 (en) | A method for provisioning optical connections in an optical network | |
| CN108781183B (en) | Method, node equipment and system for establishing service path | |
| Morea et al. | Cost benefits of asymmetric IP-over-DWDM networks with elastic transceivers | |
| EP3007393B1 (en) | Method and system for processing rsvp-te signaling | |
| US20100284268A1 (en) | Node State Recovery for a Communication Network | |
| Jamhour et al. | Evaluation of segment-based crankback re-routing for GMPLS-based WSON | |
| Jamhour et al. | Improving recovery in GMPLS-based WSON through crank-back re-routing | |
| WO2003073138A2 (en) | Systems and methods for optical networking | |
| Iizawa et al. | PCE-based fast path control in multi-domain photonic networks | |
| JP2012054730A (en) | Communication apparatus, network, and autonomous distributed routing control method and program for use with them | |
| Liu et al. | On the tradeoffs between path computation efficiency and information abstraction in optical mesh networks | |
| Li | Design and analysis of survivable WDM mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |