CN101193053B - A multi-gateway route selection method based on central management - Google Patents
A multi-gateway route selection method based on central management Download PDFInfo
- Publication number
- CN101193053B CN101193053B CN2006101456801A CN200610145680A CN101193053B CN 101193053 B CN101193053 B CN 101193053B CN 2006101456801 A CN2006101456801 A CN 2006101456801A CN 200610145680 A CN200610145680 A CN 200610145680A CN 101193053 B CN101193053 B CN 101193053B
- Authority
- CN
- China
- Prior art keywords
- path
- circuit
- tensity
- gateway
- factor
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a method for selecting a multi-gateway router with central management. The method comprises the following steps: a call control server picks out the paths with the hop numbers which are less than or equal to a collocated hop number between a coming-in side gateway and a going-out side gateway according to the network topological collocation; the modification average transmission line stress degree of each path is respectively calculated according to a total resource collocation number and a occupied resource number; the path with the least modification average transmission line stress degree is selected from all the paths as the bearer path. The invention also discloses another method for selecting a multi-gateway router with central management. In the method, if the stress degree factors of each route of the shortest path are all less than a collocated load start threshold, the shortest path is selected as the bearer path for current call; otherwise, the path with the least modification average transmission line stress degree is the bearer path. The invention solves the problem of congestion caused by unfair distribution of resources among gateways. Thus, the whole network can operate steadily, fairly and controllably.
Description
Technical field
The present invention relates to a kind of route selection method, relate in particular to a kind of multiple gateway route selection method that centre management is arranged.
Background technology
Two, three or more gateways are registered on the call control server simultaneously, and this network model is called the multi-gateway model that centre management is arranged; Because this network model practicality, economy, therefore obtained application soon, along with the large-scale application of this model, will occur adopting in the increasing Da Qu multi-gateway model to come networking, and the interoffice between big interval employing call control server is interconnected.After this application acquires a certain degree, the same call control server gateway of administration down can get more and more, load between these gateways also can be increasing, and the number of resources between multiple gateway is limited, busier between therefore just possible some gateway, and not too busy between some gateway.Average marks are carried on a shoulder pole on other gateways and are gone with how allowing these loads, and how effectively to avoid the resource exhaustion between some gateway under the situation that load increases suddenly, and very idle between other gateway, are the problems that need solve.
Route Selection between gateway has multiple mode at present, and as distributing according to need according to the shortest principle of route, the method for this routing is very single, and can not utilize the resource between gateway preferably.Suppose to have two gateways, two paths are arranged between them, one shorter, and another is long, and under a lot of situation of the load between these two gateways, the shortest path between these two gateways will be very busy.Increase to a certain degree at load, the resource on the shortest path is with depleted, and other hope will be rejected through the load of this paths; And on this time long that paths because load and idle not, at this moment just on short path appearance congested.
If can before the resource exhaustion on the shortest path, share part load and walk that path of length, so just can not occur not loading on the long route, and the situation of resource exhaustion on the short path.Therefore the mode that another kind of routing just occurred, mode according to load sharing is carried out routing, this mode is simply come to two different path allocation load as weights according to the ratio of resource, the load of the distribution that resource distribution is many is more, the load of the distribution that resource distribution is fewer is few, but this mode is not considered the lasting time of loading, and the load duration that has is short, some longer duration of loading, bearing resource also can be occupied always.On the other hand, load is constantly to change on the path, and this method is not the foundation of load variations as routing, and therefore final result will be unordered and unmanageable, occur the situation of resource exhaustion equally easily, and the probability that is this situation has reduced some.
On the other hand, for the path that comprises a plurality of circuits (route of footpath between last two neighboring gateways shows the way), generally be that the resource simple average with each circuit compared afterwards when calculating.But, though this algorithm has embodied the resource distribution in path to a certain extent or has taken situation, if but a certain circuit wherein is at full stretch, and other line resource is more abundant, its mean value may be relatively low and selected, but at this moment may cause the routing failure because this circuit can not reallocate resource.
This shows that technology and the routing policy that adopts in actual applications is actually inequitable at present, can not coordinate the utilization of resources and distribution between the gateway in the multi-gateway model preferably.
Summary of the invention
The technical problem to be solved in the present invention just provides a kind of multiple gateway route selection method that centre management is arranged, overcome because between gateway resource allocation unfair and cause easily congested, thereby make whole network controlled, stable, operation liberally.
In order to solve the problems of the technologies described above, the invention provides a kind of multiple gateway route selection method that centre management is arranged, comprise the steps:
(1) call control server disposes according to network topology, and jumping figure between Incoming side gateway and the out side gateway is come out smaller or equal to the Path selection of the fair jumping figure of configuration, reads the resource distribution sum and the occupied resource number of these circuits;
(2) calculate the correction circuit tensity factor=f (the circuit tensity factor) of each circuit on every paths respectively, the circuit tensity factor=occupied resource number/resource distribution sum wherein, the domain of definition of function f (x) is: 0＜=x＜=1; And f (x) is a f (0)=0, f (1)=infinitely-great smooth function;
(3) calculate the correction average line tensity of every paths more respectively, revising the average line tensity is the correction circuit tensity factor sum of each circuit on the path, again divided by the jumping figure in this path;
(4) choosing the path of revising average line tensity minimum in all paths is bearer path.
Further, for being that resource distribution adds up to the number of the available time multiplexing circuit identification code that disposes between gateway by time division multiplexing circuit carrying between gateway, the occupied resource number is the number of the time multiplexing circuit identification code that taken.
Further, for being that resource distribution adds up to carrying total bandwidth available between gateway by the carrying of IP circuit between gateway, the occupied resource number is for making the bandwidth of using up.
Further, described function f (x)=1/ (1-x)-1.
The present invention also provides a kind of multiple gateway route selection method that centre management is arranged, and comprises the steps:
(1) call control server disposes according to network topology, and jumping figure between Incoming side gateway and the out side gateway is come out smaller or equal to the Path selection of the fair jumping figure of configuration, reads the resource distribution sum and the occupied resource number of these circuits;
(2) calculate the circuit tensity factor of each circuit in the sets of lines on every paths respectively, wherein the circuit tensity factor=occupied resource number/resource distribution sum;
(3) the tensity factor of each circuit of shortest path is just selected the bearer path of shortest path as current calling for use all less than the stating with load thresholding of configuration in step 2, otherwise, execution in step 4;
(4) calculate the correction average line tensity of every paths respectively, revising the average line tensity is the correction circuit tensity factor sum of each circuit on the path, again divided by the jumping figure in this path, wherein revise the circuit tensity factor=f (the circuit tensity factor), the domain of definition of function f (x) is: 0＜=x＜=1; And f (x) is a f (0)=0, f (1)=infinitely-great smooth function;
(5) choosing the path of revising average line tensity minimum in all paths is bearer path.
Further, for being that resource distribution adds up to the number of the available time multiplexing circuit identification code that disposes between gateway by time division multiplexing circuit carrying between gateway, the occupied resource number is the number of the time multiplexing circuit identification code that taken.
Further, for being that resource distribution adds up to carrying total bandwidth available between gateway by the carrying of IP circuit between gateway, the occupied resource number is for making the bandwidth of using up.
Further, described function f (x)=1/ (1-x)-1.
The present invention has following beneficial effect:
1, the busy extent factor of circuits all on the paths is added up averages again, when utilizing very busy and another section circuit of the one section circuit of such method on this paths very idle, the fact of that section resource anxiety that to have covered trunks busy of averaging, and this time, this paths was re-used as the circuit tensity that section of circuit anxiety may be increased the weight of in selecteed path, and then caused congested.And after adopting function f (x) to revise, final correction average line tensity will become to congested very sensitive, can revise the average line tensity and can become a very big value congested being reflected in immediately imminent the time, and then the selected possibility of this paths will reduce rapidly, so just played the effect of avoiding congested.After being about to calling on the congested circuit and having discharged a part, this paths may be selected chance will increase.Therefore this invention can avoid congested effectively.
2, compare with the routing mode according to load sharing of uniform or weighting, uniformly or the method according to load sharing of weighting, do not consider the difference of different load duration length, therefore occur existing on the fairness bigger fluctuation easily.The present invention is then present resource distribution sum and the important factor of the resource sum that has taken as the different route quality of evaluation, it has utilized all gateways all to be within the compass of competency of same ASC administrative service center, and ASC administrative service center is easy to dynamic observe the advantage of all internodal busy extent, is controlled on the different paths load sharing uniformly.
If 3 select shortest path as current path, overload on the less shortest path of jumping figure might appear, even resource exhaustion, and on the long path of jumping figure without any load, in fact need only the jumping figure of a paths in the scope that can tolerate, just should to these paths, remove a part of load sharing, to alleviate the less pressure of jumping figure than short path.Therefore the present invention is limited in the scope of routing in the fair jumping figure that a webmaster can dispose, and so both can accomplish load sharing is gone to the path of growing, can allow the user that restriction is made in these longer paths again, in order to avoid the Path too long expense is too big.
4, the present invention is by setting a stating with load thresholding, the shortest and the two kinds of factors of Congestion Avoidance of route are all taken into account, when the circuit tensity factor of each section circuit on the shortest path all starts thresholding less than load control, therefore illustrating that the user thinks can not take place congestedly this time, should select the path of shortest path as current call bearer for use.When the circuit tensity factor of any one section circuit on the shortest path just needs to start the mechanism of load sharing greater than congested control thresholding the time, other paths of cause help shortest paths to share load.Therefore the present invention has taken into account the advantage of the shortest and two aspects of Congestion Avoidance of route.
Description of drawings
Fig. 1 is call control server of the present invention and gateway connection diagram;
Fig. 2 is the flow chart that the present invention has the multiple gateway route selection method of centre management;
Fig. 3 is another flow chart that the present invention has the multiple gateway route selection method of centre management;
Fig. 4 is the exemplary plot of resource occupation/configuration between gateway among Fig. 1 of the present invention;
Fig. 5 is that the present invention realizes in the system of the routing function under the multi-gateway model, at 1-〉6-5 and 1-7-resource occupation/configuring condition on 5 liangs of paths.
Embodiment
The present invention is described in detail below in conjunction with drawings and the specific embodiments.
As shown in Figure 1, node 8 is call control servers among the figure, and node from 1 to 7 is the gateways that are under the jurisdiction of node 8 management.Dotted line node 8 and the node from 1 to 7 is a signaling link; Node 1 to 7 solid line each other then is a bearing link.System of the present invention comprises webmaster (not shown), at least one call control server, at least four gateways, same call control server is down formed netted connection between a plurality of gateways of administration, and the path of one or more is arranged between two non-conterminous gateways.
As shown in Figure 2, a kind of multiple gateway route selection method that centre management is arranged of the present invention comprises the steps:
Each path may be made up of one or more of circuit, and every paths is noted with the form of sets of lines, supposes between Ni and the Nj a certain paths only through a node Nk, so the sets of lines of this paths be (Ni, Nk), (Nk, Nj) };
A (Ni, Nk)/T (Ni, Nk)+...+A (Nk, Nj)/T (Nk, Nj) }/h=average line tensity (formula 1)
F (A (Ni, Nk)/T (Ni, Nk))+...+f (A (Nk, Nj)/T (Nk, Nj)) }/h=revises average line tensity (formula 2)
Wherein ((Ni, Nk) ... (Nk, Nj)) ∈ sets of lines, h is the jumping figure of this sets of lines;
Wherein function f (x) should possess following characteristic:
The domain of definition of f (x) is: 0＜=x＜=1; And f (x) is if a f (0)=0, f (1)=infinitely-great smooth function, so just can make f (A (and Ni, Nk)/T (Ni, Nk)) approach 1 the busiest, make f (A (and Ni, Nk)/T (Ni, Nk)) approach 0 least busy.F (x)=1/ (1-x)-1 possesses above-mentioned condition, with f (x) substitution formula 2, obtains formula 3.
A (Ni, Nk)/(T (Ni, Nk)-A (Ni, Nk))+...+A (Nk, Nj)/(T (Nk, Nj)-A (Nk, Nj)) }/h=engineering correction average line tensity (formula 3)
Step 207: utilize the engineering correction average line tensity of each paths that calculates in the step 206 in all paths, to choose the path of that path of engineering correction average line tensity minimum as current calling.
Pointed engineering correction algorithm in the formula 3, be resulting function f (x)=1/ (1-x)-1 substitution formula 2, and the smooth function that meets f (x) feature has a lot, as the function that arrives commonly used in the high mathematics such as 1/ (1-sin ((pi/2) * x))-1, the feature that all meets f (x), these smooth functions should only not be confined to f (x)=1/ (1-x)-1, therefore this function should dispose, and the user can report the occupation condition parameter of webmaster according to routing module control, weigh the influence of different f (x), and then can revise f (x) load control effect.
As shown in Figure 3, the present invention also provides a kind of multiple gateway route selection method that centre management is arranged, and comprises the steps:
Step 308 finishes.
Step 310 utilizes the engineering correction average line tensity of each paths that calculates in the step 309 to choose the path of that path of correction average line tensity minimum as current calling in all paths;
Equally, in this example, the function f (x)=1/ (1-x)-1 that engineering correction average line tensity uses, the smooth function that meets f (x) feature has a lot, these smooth functions should only not be confined to f (x)=1/ (1-x)-1, so this function should dispose, and the user can report the occupation condition parameter of webmaster according to routing module control, weigh the influence of different f (x), and then can revise f (x) load control effect.
Fig. 4 is resource occupation between gateway of the present invention/configuration illustration.All internodal marks among the figure, divide subrepresentation be occupied resource sum A between node (Ni, Nk), and denominator is represented be the resource sum T that disposes between node (Ni, Nk).This fraction representation then be two nodes (Ni, Nk) the circuit tensity factors A between (Ni, Nk)/T (Ni, Nk).
Fig. 5 is an illustration, explanation be at 1-6-5 and 1-7-resource occupation/configuring condition on 5 liangs of paths.
If between this two paths, select the path of a free time according to formula 1, path 1-then〉6-〉5 average line tensity is: (0.53+0.97)/2=0.75, the road is through 1-〉7-〉5 average line tensity is: (0.85+0.85)/2=0.85.If directly selecting the less path of average line tensity is current path, then should select 1-〉6-〉5 for current path, but clearly, this time path 1--6-circuit 6-between 55 line efficiency reached 97%, if this time is still at 1-〉6-〉5 these routings above paths, at once can be at circuit 6-〉produce between 5 congestedly, therefore in fact should select 1-〉7-〉5 be current path.
If calculate in the path of selecting a free time between this two paths according to formula 3, path 1-then〉6-〉5 correction average line tensity is: (53/ (100-53)+97/ (100-97))/2=33.427, the road is through 1-〉7-〉5 average line tensity is: (85/ (100-85)+85 (100-85))/2=5.56.Selecting to revise the less path of average line tensity is current path, then should select 1-〉7-〉5 for current path, just avoid that this time and be about to congested path, this just explanation can become very big through revising later formula 3 when any one section circuit in the paths is about to take place to revise the average line tensity congested the time at once, choose possibility on this paths thereby having reduced load, thereby reached the purpose of Congestion Avoidance.
The present invention is by calculate revising the average line tensity, being provided with that load sharing starts thresholding, method that the fair jumping figure of load sharing is set is used for Route Selection, taken into account the advantage of the shortest and Congestion Avoidance two aspects of route, coordinate the load between multiple gateway under the same call control server effectively, make whole network controlled, stable, fair operation.
Claims (8)
1. the multiple gateway route selection method that centre management is arranged comprises the steps:
(1) call control server disposes according to network topology, and jumping figure between Incoming side gateway and the out side gateway is come out smaller or equal to the Path selection of the fair jumping figure of configuration, reads the resource distribution sum and the occupied resource number of these circuits;
(2) calculate the correction circuit tensity factor=f (the circuit tensity factor) of each circuit on every paths respectively, the circuit tensity factor=occupied resource number/resource distribution sum wherein, the domain of definition of function f (x) is: 0＜=x＜=1; And f (x) is a f (0)=0, f (1)=infinitely-great smooth function;
(3) calculate the correction average line tensity of every paths more respectively, revising the average line tensity is the correction circuit tensity factor sum of each circuit on the path, again divided by the jumping figure in this path;
(4) choosing the path of revising average line tensity minimum in all paths is bearer path.
2. method according to claim 1, it is characterized in that: for being to carry between gateway by the time division multiplexing circuit, resource distribution adds up to the number of the available time multiplexing circuit identification code that disposes between gateway, and the occupied resource number is the number of the time multiplexing circuit identification code that taken.
3. method according to claim 1 is characterized in that: for being that resource distribution adds up to carrying total bandwidth available between gateway by the carrying of IP circuit between gateway, the occupied resource number is for making the bandwidth of using up.
4. according to any described method in the claim 1～3, it is characterized in that: described function f (x)=1/ (1-x)-1.
5. the multiple gateway route selection method that centre management is arranged comprises the steps:
(1) call control server disposes according to network topology, and jumping figure between Incoming side gateway and the out side gateway is come out smaller or equal to the Path selection of the fair jumping figure of configuration, reads the resource distribution sum and the occupied resource number of these circuits;
(2) calculate the circuit tensity factor of each circuit in the sets of lines on every paths respectively, wherein the circuit tensity factor=occupied resource number/resource distribution sum;
(3) the tensity factor of each circuit of shortest path is just selected the bearer path of shortest path as current calling for use all less than the stating with load thresholding of configuration in step 2, otherwise, execution in step 4;
(4) calculate the correction average line tensity of every paths respectively, revising the average line tensity is the correction circuit tensity factor sum of each circuit on the path, again divided by the jumping figure in this path, wherein revise the circuit tensity factor=f (the circuit tensity factor), the domain of definition of function f (x) is: 0＜=x＜=1; And f (x) is a f (0)=0, f (1)=infinitely-great smooth function;
(5) choosing the path of revising average line tensity minimum in all paths is bearer path.
6. method according to claim 5, it is characterized in that: for being to carry between gateway by the time division multiplexing circuit, resource distribution adds up to the number of the available time multiplexing circuit identification code that disposes between gateway, and the occupied resource number is the number of the time multiplexing circuit identification code that taken.
7. method according to claim 5 is characterized in that: for being that resource distribution adds up to carrying total bandwidth available between gateway by the carrying of IP circuit between gateway, the occupied resource number is for making the bandwidth of using up.
8. according to any described method in the claim 5～7, it is characterized in that: described function f (x)=1/ (1-x)-1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101456801A CN101193053B (en) | 2006-11-23 | 2006-11-23 | A multi-gateway route selection method based on central management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101456801A CN101193053B (en) | 2006-11-23 | 2006-11-23 | A multi-gateway route selection method based on central management |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101193053A CN101193053A (en) | 2008-06-04 |
| CN101193053B true CN101193053B (en) | 2011-04-20 |
Family
ID=39487814
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101456801A Expired - Fee Related CN101193053B (en) | 2006-11-23 | 2006-11-23 | A multi-gateway route selection method based on central management |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101193053B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101404674B (en) * | 2008-11-17 | 2011-09-21 | 杭州华三通信技术有限公司 | Call routing method, proxy server and relay device |
| CN102457393A (en) * | 2010-10-29 | 2012-05-16 | 鸿富锦精密工业（深圳）有限公司 | Data transmission management equipment and method |
| CN105516328A (en) * | 2015-12-18 | 2016-04-20 | 浪潮(北京)电子信息产业有限公司 | Dynamic load balancing method and system, and devices used for distributed storage system |
| CN110868348B (en) * | 2019-10-17 | 2022-11-15 | 深圳绿米联创科技有限公司 | Multi-gateway communication method, device and system and electronic equipment |
| CN111031181B (en) * | 2019-11-18 | 2021-09-17 | 集奥聚合(北京)人工智能科技有限公司 | Method, system and server for deploying and scheduling home-based line of outgoing call of telephone |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6400681B1 (en) * | 1996-06-20 | 2002-06-04 | Cisco Technology, Inc. | Method and system for minimizing the connection set up time in high speed packet switching networks |
| CN1472924A (en) * | 2003-07-11 | 2004-02-04 | �廪��ѧ | Selecting method based on path-time delay probability distribution |
| CN1756233A (en) * | 2004-09-30 | 2006-04-05 | 富士通株式会社 | Route selection method in the communication network and device |
| CN1853376A (en) * | 2003-09-19 | 2006-10-25 | 皇家飞利浦电子股份有限公司 | Minium cost routing lookup for AD HOC wireless communication system |
-
2006
- 2006-11-23 CN CN2006101456801A patent/CN101193053B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6400681B1 (en) * | 1996-06-20 | 2002-06-04 | Cisco Technology, Inc. | Method and system for minimizing the connection set up time in high speed packet switching networks |
| CN1472924A (en) * | 2003-07-11 | 2004-02-04 | �廪��ѧ | Selecting method based on path-time delay probability distribution |
| CN1853376A (en) * | 2003-09-19 | 2006-10-25 | 皇家飞利浦电子股份有限公司 | Minium cost routing lookup for AD HOC wireless communication system |
| CN1756233A (en) * | 2004-09-30 | 2006-04-05 | 富士通株式会社 | Route selection method in the communication network and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101193053A (en) | 2008-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Long et al. | LABERIO: Dynamic load-balanced routing in OpenFlow-enabled networks | |
| US7486621B2 (en) | Method and apparatus for load sharing and overload control for packet media gateways under control of a single media gateway controller | |
| EP4238295A1 (en) | Methods, systems, and computer readable media for rank processing for network function selection | |
| CN101193053B (en) | A multi-gateway route selection method based on central management | |
| US20110106932A1 (en) | Network Management System | |
| CN107070794A (en) | A kind of low rail information network optimal network benefit delay constraint method for routing | |
| CN101610433A (en) | The multi-constraint condition routing selection method that a kind of support policy is resolved | |
| CN101471881B (en) | Method for routing and load balancing in mesh networks | |
| CN116389491B (en) | Cloud edge computing power resource self-adaptive computing system | |
| CN108234309A (en) | A kind of transmission method of network data | |
| CN112543151B (en) | SDN controller deployment method and device, electronic equipment and storage medium | |
| CN108173766B (en) | Multi-service hierarchical topological routing method based on differentiated QoS | |
| CN109005126A (en) | The processing method and equipment of data flow | |
| Valetto et al. | A self-organized load-balancing algorithm for overlay-based decentralized service networks | |
| CN101193335A (en) | System and method for selecting route under multi-gateway model of core network | |
| CN101193428A (en) | A mobile service switch center server for selecting route | |
| CN101977159A (en) | Management method of bandwidth resources of narrow band network | |
| CN102710431A (en) | Method for automatically designing topology of business-driven transmission network | |
| CN106028415B (en) | A kind of Delay Tolerant Network method for routing of internet of things oriented application | |
| CN1898921B (en) | Network topology generation method and node | |
| Manfredi et al. | Small world effects in networks: An engineering interpretation | |
| Liu et al. | Area: an automatic runtime evolutionary adaptation mechanism for creating self-adaptation algorithms in wireless networks | |
| CN110830315A (en) | Network function construction method and device | |
| US11894978B1 (en) | Computing power scheduling methods, apparatus, electronic devices and storage media | |
| Sarr et al. | Robust discovery, addressing and routing protocol for dynamic linear network |
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: 20110420 Termination date: 20151123 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |