CN1705256A - A method for accelerating convergence of link state - Google Patents
A method for accelerating convergence of link state Download PDFInfo
- Publication number
- CN1705256A CN1705256A CNA2004100371370A CN200410037137A CN1705256A CN 1705256 A CN1705256 A CN 1705256A CN A2004100371370 A CNA2004100371370 A CN A2004100371370A CN 200410037137 A CN200410037137 A CN 200410037137A CN 1705256 A CN1705256 A CN 1705256A
- Authority
- CN
- China
- Prior art keywords
- link
- information
- state
- renewal
- network
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
A method for accelerating link state converge, which contains adopting the pre-updating information of local cache to calculate route when adopted pre-updating state is effective, if it is ineffective then calculating using information from network, when the calculation is ended, establishing service through signaling protocol according to calculated result and caching said route information, setting the pre-updating state effective and keeping timer reset, if the timer of pre-updating state preservation is overtime, then setting the pre-updating state ineffective, said invention raises route calculation accuracy avoiding calculation error due to error link information, and guarantees the stability of optic network system.
Description
Technical field
The present invention relates to the optical network communication field, relate in particular to a kind of accelerating chain line state convergence method.
Background technology
Optical-fiber network comprises SDH/Sonet (Synchronous Digital Hierarchy/Synchronous Optical Network), wavelength network, is a kind of system based on centralized management traditionally.Optical network node normally " is made mute ", and establishment, maintenance, dismounting that light connects all need manual intervention, and the light that this mode is set up connects and is called permanent connection.This optical network system can not satisfy the continuous growth of data service, demand dynamically and flexibly, and the key that addresses this problem is to realize dynamic light exchange.For this reason, the ASON of ITU (ASON) framework is given has increased a control plane on the optical-fiber network traditionally: optical network node at first obtains the annexation of present networks node and other optical network nodes by the discovery technique of link part; Issue its node and Link State by control plane again, and the state publications of other network nodes in the reception network, final each optical network node all has a accurately " network map " (being network topological information) of topology of network of describing, comprising node, link, resource information; When optical network node is connected by customer equipment or system administration request, utilize the information of " network map ", obtain a feasible path in conjunction with certain routing algorithm, the node that drives on the path by signaling protocol is set up interconnection again, finishes the dynamic foundation that light connects up to destination node; Connect dynamically at network and to set up, to remove or fault causes that respective nodes will in time be issued node, the link-state information of renewal when link circuit resource changes, realize the synchronous again of " network map ".
In order to set up professional connect (or heavy-route), currently used method is: shortest-path first algorithm (CSPF) calculating path that at first utilizes belt restraining; Drive road construction by signaling protocol then; Respective nodes is in time issued node, the link-state information after the renewal, this information spreads in network, under perfect condition, after waiting for that diffusion finishes, after each node all obtains to comprise the network topological information of newly-built link information, set up next bar service link again, to guarantee the accuracy of each bar link information.
Yet, in real network is used, the variation of network operation state is complicated and diversified, because the diffusion of network state information needs the regular hour, in some cases, node after the renewal, link-state information also diffusion finish, just require to set up a business, as in following two kinds of situations: the one, the user needs many professional connections within a short period of time; The 2nd, when network failure occurring, be subjected to this fault effects and have many service needed heavy-routes in the business that same node point is initiated.Therefore, in very short time, will issue many orders of setting up professional (or heavy-route).At this moment, if the link change information after a last order issues is not diffusion end also, " network map " and the actual conditions that might cause initiating on the professional node this moment are inconsistent, thereby the mistake that can cause route to be calculated, the path that makes calculating is not optimum, even may cause the road construction failure.For example, under the heavy-route situation, because Internet resources are not synchronously in time, available resources are not enough on the path of calculating, but have available path in the real network.Thereby cause the heavy-route failure, reduced the stability and the efficient of system.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the purpose of this invention is to provide a kind of accelerating chain line state convergence method, solve and to issue many within a short period of time professional to connect the paths of being calculated that occurred under the situation of (or heavy-route) be not optimum and even wrong problem occurs.
The objective of the invention is to be achieved through the following technical solutions:
The invention provides a kind of method of accelerating chain line state convergence, comprising: network node carries out route calculating and determines new link information according to the network topological information of preserving; Then new link information buffer memory is got up, and set up professional by signaling protocol according to the route result calculated; When carrying out next bar route calculating, the link information of topology information then Network Based and/or buffer memory carries out next bar route calculation.
Described link information also comprises: " the pre-renewal " state is used for indicating whether the link information of this link finishes in the whole network diffusion; And " pre-update mode keeps " timer, described " pre-update mode keeps " timer is used to set the specific time, and this special time represents that link information spreads the needed time that finishes in the whole network.
Method of the present invention also comprises step: " the pre-renewal " state to the related link in the path of determining according to the route result calculated is judged, if " the pre-renewal " of link is effective status, then make " the pre-renewal " state of link remain effective status, and " the pre-update mode keeps " timer that resets; If " the pre-renewal " state of link is a disarmed state, then " the pre-renewal " state of described link is set to effective status, and enables " pre-update mode keeps " timer.
Method of the present invention further comprises: step 1: when network node need be determined mulitpath information in the time of setting, then carry out route calculating and determine the routing information that article one is new according to the network topological information of preserving; Step 2: set up business according to the route result calculated by signaling protocol, simultaneously that this bar is the new related link information in path is saved in the buffer memory; Step 3: carry out the calculating of the new routing information of next bar according to the network topological information of network node and the link information of buffer memory, determine new link information, and execution in step 2, all calculate up to mulitpath information and determine to finish.
The described related link information in path that this bar is new is saved in the buffer memory and further comprises: the link in the network topological information of network node this locality is set to " the pre-renewal " state, and the link-state information that is in described " the pre-renewal " state is removed " the pre-renewal " state when receiving link corresponding state information updating message.
For link information setting " the pre-update mode keeps " timer that is in " the pre-renewal " state, when " pre-update mode keeps " timer expiry, " the pre-renewal " state is removed, and removed the link information data of buffering.
The described link corresponding state information updating message of receiving is meant the link-state information that obtains by procotol from network.
The link information of employed link when carrying out the calculating of the new routing information of next bar, also comprise step: whether the link of judging use is provided with " the pre-renewal " state, if " the pre-renewal " state of the link of determining is effective, then adopt the link information of in the link information of buffer memory, determining, otherwise adopt the link information of in network topological information, determining.
When needs carry out route calculating and determine new link information, judge whether to meet the quick convergence condition of Link State of setting, if meet, then carrying out route according to the inventive method calculates, otherwise, directly the network topological information of preserving according to network node carries out route calculating, and sets up professional by signaling protocol according to the route result calculated.
Described network topological information obtains from network by Routing Protocol.
As seen from the above technical solution provided by the invention, when the user issues many when professional in the short time, maybe network failure ought appear, and be subjected to this fault effects when the business of same node point initiation has many service needed heavy-routes, according to the present invention, can be by directly using " the pre-renewal " link information of buffer memory, promptly, directly the link information based on pre-renewal carries out determining of new routing information, thereby has the effect of quickening link convergence; And, because the network topological information that when carrying out route calculating, does not have direct use not upgrade in time, thereby avoided occurring because of using the problem of the route mistake in computation that wrong link information causes, thereby improved the accuracy that route is calculated, guaranteed the stability of optical network system.
Description of drawings
Fig. 1 shows the flow chart that quickens the link convergence method in the ASON of the present invention;
Fig. 2 selects to use the flow chart of link when showing according to the inventive method calculating route.
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.
Core concept of the present invention is network node carries out route calculating and determines new link information according to the network topological information of preserving after, then, set up professional by signaling protocol according to the route result calculated, and new link information is kept in the buffer memory, so that when next bar route is calculated, can directly use the link information and/or the network topological information of buffer memory, like this, make need not to wait until new link information in network, issue finish after, carrying out the route of next bar link again calculates, thereby quickened the convergence rate of link-state information, and can guarantee that route result of calculation is comparatively accurate.
Under given conditions, as issuing batch service as the user when connecting; Maybe network failure ought appear, and be subjected to this fault effects when the business of same node point initiation has many service needed heavy-routes, will issue the order of setting up batch service (or heavy-route), promptly need to set up at short notice many new routing informations, at this moment, just can utilize method of the present invention to carry out determining of new routing information.In order to realize the present invention, in link information, increase " the pre-renewal " state and " pre-update mode keeps " timer." the pre-renewal " state shows whether this link is in pre-update mode, if be in pre-update mode, uses the pre-renewal link information in the buffer memory when then calculating route, otherwise use the information that obtains by Routing Protocol from network." pre-update mode keeps " effect of timer is when it is overtime, shows that information spreads end in whole network.
Having several different methods can be implemented in the link information increases " pre-renewal " state and " pre-update mode keeps " timer.For example, when the initialization network topological information, two fields are set in the data structure of every link information: " the pre-renewal " mode field and " pre-update mode keeps " timer field; Or will " pre-upgrade " mode field and " pre-update mode keeps " timer field be arranged on corresponding temporary variable of link or database in.
The data type of " the pre-renewal " mode field can be to represent any data type of two states, for example integer, character type, full mold, Boolean type, enumeration type etc., the present invention preferably adopts Boolean type, and promptly the value of " the pre-renewal " state has two: true or false.When " pre-upgrade " of certain bar link when state value is true, show that then this link is in " the pre-renewal " state, when route is calculated, can directly use link information that should bar link institute buffer memory.
" pre-update mode keeps " timer is a timer, comprise a time dependent variable, the initial value of variable can be set according to certain conditions, when variable change during to specific value (this specific value is also referred to as final value), will trigger an incident, as, change and " pre-update mode keeps " timer corresponding " the pre-renewal " state, make " the pre-renewal " state be in disarmed state, be false.Final value is artificial the setting, usually be set at a certain specific value, as be set at 0, therefore, can wait the size of initialization according to the characteristic of final value, the time dependent speed of variable, network, in net, spread and finish to satisfy the link that in the specific time, makes variation.
To describe below according to the method for quickening link convergence in the ASON of the present invention, may further comprise the steps:
Whether step 10, judgement " accelerating ated test function on " state are in effective status, if be in effective status, then execution in step 11; Otherwise execution in step 15;
Usually can judge whether whether this route calculating meets the condition that starts the accelerating ated test function, promptly need " accelerating ated test function on " state to be set to effective status according to specified conditions; Described specified conditions comprise: when the user issues the batch service connection; Maybe network failure ought occur, and be subjected to this fault effects when the business of same node point initiation has many service needed heavy-routes.
Certainly, the present invention also can omit this step in the specific implementation process, promptly gives tacit consent to all route computational process and all handles according to the processing procedure of accelerating ated test link-state information of the present invention.
In step 111, adopt " the pre-renewal " link information temporary on this link to calculate route, that is, it is that " the pre-renewal " link information that basis is stored in the local internal memory carries out route and calculates that route is calculated, rather than adopts " really " link information to carry out route calculating; Described " really " link information is the link information that obtains from network by Routing Protocol;
In step 113, if " the pre-renewal " state of the link that uses is invalid, then in the enterprising walking along the street in basis of " really " link information by calculating, that is, only adopt " really " link information that obtains by network topological information to carry out route calculating;
In step 112, judge whether a professional route is calculated to finish, if calculated execution in step 110, otherwise execution in step 12;
After step 12, a professional calculating finish, issue configuration signal on the one hand, promptly set up professional by signaling protocol according to the route result calculated; On the other hand the routing link information temporary storage that has calculated, and " the pre-renewal " state of each link on should the business route is set to effectively, if " the pre-renewal " state of this link is effective, " the pre-update mode keep " timer of this link that then resets, and still make " the pre-renewal " state of this link effective; If " the pre-renewal " state of this link is invalid, then enable " pre-update mode keeps " timer of this link, " the pre-renewal " state of this link is set to effective status;
Therefore, under " accelerating ated test function on " state, when calculating next bar route and meeting the effective link of " pre-upgrade " state, use " the pre-renewal " information of local cache, rather than " really " link information that from network, obtains by Routing Protocol.Like this, concerning the present networks node, played and quickened link information effect of convergence fast from network, also avoided also spreading the mistake that end produces because of last one link information; Thereby significantly reduced because of link information spreads untimely caused mistake in computation, improved the operation stability and the efficient of network;
If step 13 also has service needed to set up, then execution in step 11, otherwise execution in step 14;
In calculating routing procedure, when the link information in the network changes, the information of this link will spread in whole network, after the network element of initiating to calculate in the process of diffusion is received the link updating message, if " the pre-renewal " state of this link is in effective status, and the link information in the updating message is identical with temporary information, described information spinner will comprise bandwidth information, protection type etc., then make " the pre-renewal " state invalid, and stop " pre-update mode keeps " timer, be about to described link information as authentic and valid link information;
If " pre-update mode keeps " timer expiry of certain bar link, then " the pre-renewal " state is set to disarmed state, remove the link information data of buffering, stop " pre-update mode keeps " timer, described link information will become authentic and valid link information; Show link information diffusion end in whole network during described " pre-update mode keeps " timer expiry.The value calcaneus rete network scale of timer is relevant, if network is bigger, then diffusion time long, this value need be established bigger, such as the several seconds to tens of second, if network is smaller, then can establish smallerly, hundreds of milliseconds are to the several seconds.Below the reason at link information setting " the pre-update mode keeps " timer of " pre-upgrade " state is described: this is because Link State " pre-renewal " is not the link information that obtains from real network, as time passes, when the lastest imformation of physical link is diffused into this network element, need make " the pre-renewal " state of this link invalid.But, because the complexity of network may have other network element application business simultaneously, therefore may occur one and jump the situation that link recurs the link information change, these changes come from the business of initiating on the different network elements; All these change the result all will be diffused into the whole network by Routing Protocol, therefore the lastest imformation that certain network element obtained is the result of combined influence, and the link information that thinks of oneself only when creating, like this, the link information of physical link lastest imformation and " the pre-renewal " is inconsistent, thereby may cause this link to be in " pre-upgrade " state always, and cause " the pre-renewal " link information and actual information inconsistent.Therefore, this timer is set guarantees after certain hour, assert link-state information the whole network diffusion, remove " the pre-renewal " state this moment.
As can be seen, in the present invention, since in local network node in advance buffer memory the expection the routing convergence result, when the professional route of carrying out the back is calculated, just can calculate route according to the link information and the actual network topological information of " the pre-renewal ", concerning the network diffusion, play the effect of accelerating ated test.Therefore, before the link information diffusion is not also finished, just can carry out the route calculation of new business, and can not occur also not finishing caused mistake because of diffusion of information.
By adopting method of the present invention, when having calculated a route, the link information of determining has been cushioned the link information that is used as " the pre-renewal ", when calculating next time route, use the link information and the network topological information of " the pre-renewal " to calculate route, promptly, when " the pre-renewal " state is arranged when calculating the link that uses, use the link information of buffer memory to calculate route, when calculating not setting of link " the pre-renewal " state that uses, use network topological information to calculate route.That is to say, in network, can directly use the link information of " the pre-renewal " before the actual convergence of link information, therefore, obtained the effect of accelerating ated test.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (10)
1, a kind of method of accelerating chain line state convergence is characterized in that, comprises step:
Network node carries out route calculating and determines new link information according to the network topological information of preserving;
Then new link information buffer memory is got up, and set up professional by signaling protocol according to the route result calculated;
When carrying out next bar route calculating, the link information of topology information then Network Based and/or buffer memory carries out next bar route calculation.
2, the method for accelerating chain line state convergence according to claim 1 is characterized in that described link information also comprises: " the pre-renewal " state is used for indicating whether the link information of this link finishes in the whole network diffusion; And " pre-update mode keeps " timer, described " pre-update mode keeps " timer is used to set the specific time, and this special time represents that link information spreads the needed time that finishes in the whole network.
3, the method for accelerating chain line state convergence according to claim 2, also comprise step: " the pre-renewal " state to the related link in the path of determining according to the route result calculated is judged, if " the pre-renewal " of link is effective status, then make " the pre-renewal " state of link remain effective status, and " the pre-update mode keeps " timer that resets; If " the pre-renewal " state of link is a disarmed state, then " the pre-renewal " state of described link is set to effective status, and enables " pre-update mode keeps " timer.
4, the method for accelerating chain line state convergence according to claim 1 is characterized in that this method further comprises:
Step 1: when network node need be determined mulitpath information in the time of setting, then carry out route calculating and determine the routing information that article one is new according to the network topological information of preserving;
Step 2: set up business according to the route result calculated by signaling protocol, simultaneously that this bar is the new related link information in path is saved in the buffer memory;
Step 3: carry out the calculating of the new routing information of next bar according to the network topological information of network node and the link information of buffer memory, determine new link information, and execution in step 2, all calculate up to mulitpath information and determine to finish.
5, the method for accelerating chain line state convergence according to claim 4 is characterized in that the described related link information in path that this bar is new of step 2 is saved in the buffer memory and further comprises:
Link in the network topological information of network node this locality is set to " the pre-renewal " state, and the link-state information that is in described " the pre-renewal " state is removed " the pre-renewal " state when receiving link corresponding state information updating message.
6, the method for accelerating chain line state convergence according to claim 5 is characterized in that described step 2 also comprises:
For link information setting " the pre-update mode keeps " timer that is in " the pre-renewal " state, when " pre-update mode keeps " timer expiry, " the pre-renewal " state is removed, and removed the link information data of buffering.
7, the method for accelerating chain line state convergence according to claim 5 is characterized in that the described link corresponding state information updating message of receiving is meant the link-state information that obtains by procotol from network.
8, the method for accelerating chain line state convergence according to claim 4, it is characterized in that, in described step 3, the link information of employed link when carrying out the calculating of the new routing information of next bar, also comprise step: whether the link of judging use is provided with " the pre-renewal " state, if " the pre-renewal " state of the link of determining is effective, then adopts the link information of in the link information of buffer memory, determining, otherwise adopt the link information of in network topological information, determining.
9, the method for accelerating chain line state convergence according to claim 4 is characterized in that, carries out described step 1 and also comprises before:
When needs carry out route calculating and determine new link information, judge whether to meet the condition of the Link State accelerating ated test of setting, if meet, then execution in step 1, otherwise, directly the network topological information of preserving according to network node carries out route calculating, and sets up professional by signaling protocol according to the route result calculated.
10, the method for accelerating chain line state convergence according to claim 1, wherein, described network topological information obtains from network by Routing Protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100371370A CN100550695C (en) | 2004-06-03 | 2004-06-03 | A kind of method of accelerating chain line state convergence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100371370A CN100550695C (en) | 2004-06-03 | 2004-06-03 | A kind of method of accelerating chain line state convergence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1705256A true CN1705256A (en) | 2005-12-07 |
| CN100550695C CN100550695C (en) | 2009-10-14 |
Family
ID=35577702
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100371370A Expired - Fee Related CN100550695C (en) | 2004-06-03 | 2004-06-03 | A kind of method of accelerating chain line state convergence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100550695C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008022574A1 (en) * | 2006-08-17 | 2008-02-28 | Huawei Technologies Co., Ltd. | Method and device for fast convergence |
| CN101227313B (en) * | 2007-01-19 | 2010-07-28 | 华为技术有限公司 | Business path regulation method and communication system as well as route computing unit |
| CN101056270B (en) * | 2007-05-18 | 2010-10-06 | 华为技术有限公司 | A route convergence method and routing device |
| CN101572837B (en) * | 2009-06-18 | 2012-01-04 | 烽火通信科技股份有限公司 | Method for updating route information for ASON batch path computation |
| CN101394302B (en) * | 2007-09-19 | 2012-04-04 | 华为技术有限公司 | Method and device for controlling routing oscillation |
| CN101610128B (en) * | 2008-06-20 | 2013-03-27 | 中兴通讯股份有限公司 | Method for realizing fast route convergence by optical transport network (OTN) overheads |
-
2004
- 2004-06-03 CN CNB2004100371370A patent/CN100550695C/en not_active Expired - Fee Related
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008022574A1 (en) * | 2006-08-17 | 2008-02-28 | Huawei Technologies Co., Ltd. | Method and device for fast convergence |
| US7817542B2 (en) | 2006-08-17 | 2010-10-19 | Huawei Technologies Co., Ltd | Method and network device for fast service convergence |
| CN101227313B (en) * | 2007-01-19 | 2010-07-28 | 华为技术有限公司 | Business path regulation method and communication system as well as route computing unit |
| CN101056270B (en) * | 2007-05-18 | 2010-10-06 | 华为技术有限公司 | A route convergence method and routing device |
| US9461908B2 (en) | 2007-05-18 | 2016-10-04 | Huawei Technologies Co., Ltd. | Method of route convergence, routing device, and main control board in routing device |
| CN101394302B (en) * | 2007-09-19 | 2012-04-04 | 华为技术有限公司 | Method and device for controlling routing oscillation |
| CN101610128B (en) * | 2008-06-20 | 2013-03-27 | 中兴通讯股份有限公司 | Method for realizing fast route convergence by optical transport network (OTN) overheads |
| CN101572837B (en) * | 2009-06-18 | 2012-01-04 | 烽火通信科技股份有限公司 | Method for updating route information for ASON batch path computation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100550695C (en) | 2009-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0423053B1 (en) | Method of using cached partial trees in computing a path in a data communication network | |
| EP2058986B1 (en) | A method for determining a routing path and a routing path determination unit | |
| US7852863B2 (en) | System and methods for connections using automatically switched optical network control planes | |
| CN101207508B (en) | System and method for implementation of optical network band width distribution according to need | |
| CN100454837C (en) | Method for realizing cross-domain route separation | |
| CN101309122B (en) | Clock track relation establishing method and clock track relation computing apparatus | |
| EP1303111A2 (en) | System and method for routing stability-based integrated traffic engineering for gmpls optical networks | |
| EP2096802B1 (en) | A hierarchical routing query method of automatic switched optical network | |
| US20090313350A1 (en) | Method for optimising the distribution of a service from a source to a plurality of clients in a network | |
| CN101047440A (en) | Method of service route return | |
| CN101572837B (en) | Method for updating route information for ASON batch path computation | |
| CN1167554A (en) | Routing in a communication network | |
| CN112702267B (en) | Distributed training routing method, system, storage medium and computer equipment | |
| CN101060420A (en) | Adaptive optical transmission network connecting performance optimization method and equipment | |
| CN101322343A (en) | Multicast protection method and device in WDM optical network | |
| CN1705256A (en) | A method for accelerating convergence of link state | |
| CN1601934A (en) | Distributing topopology polymerization method of wave wavelength route optical network | |
| CN109242242A (en) | A kind of method and system modeled for determining system protection private network business risk | |
| CN101360347A (en) | Route selection method for wavelength routing optical network | |
| CN1306737C (en) | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network | |
| CN100479449C (en) | Method for controlling flow | |
| US7324750B2 (en) | Protection scheme for a communication network | |
| CN1707978B (en) | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network | |
| CN1983908B (en) | Method for automatically correcting label resource management | |
| CN100352235C (en) | Automatic binding method for link corcuit with flow engineering |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091014 Termination date: 20170603 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |