CN1708030A - System for controlling packet service network flow and method thereof - Google Patents
System for controlling packet service network flow and method thereof Download PDFInfo
- Publication number
- CN1708030A CN1708030A CNA2004100486976A CN200410048697A CN1708030A CN 1708030 A CN1708030 A CN 1708030A CN A2004100486976 A CNA2004100486976 A CN A2004100486976A CN 200410048697 A CN200410048697 A CN 200410048697A CN 1708030 A CN1708030 A CN 1708030A
- Authority
- CN
- China
- Prior art keywords
- node
- flow control
- cell
- service network
- control information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to flow controlling technology in communication field, and discloses one kind of flow controlling system and method in grouping service network. The grouping service network can realize flow control in relatively low cost, ensure no overflow and underflow and protect rearrangement function. The flow controlling system and method in grouping service network adopts random flow controlling mode, and has introduced stage-by-stage flow control mode and ensured time tolerance to avoid overflow and underflow. Ensuring time tolerance may be realized through increasing buffer memory, reducing the granularity of the service cell sent to the next level of node and other method.
Description
Technical field
The present invention relates to the fluidics of the communications field, particularly the fluidics of packet service network.
Background technology
In data communication and field of telecommunications, in order to solve the problem of bandwidth deficiency, usually adopt the mode of Packet Service, make a plurality of users can share same channel, thereby improve the resource utilization of network.Yet Packet Service does not impose any restrictions the number of users of using channel simultaneously, when miscellaneous service enters channel simultaneously and surpasses certain limit, the buffer memory of some unit of network is overflowed, as buffer memory of router or switch etc., thereby cause losing in a large number of packet, congestion phenomenon in network, occurs.When network occurs can not providing the service specified quality to the data flow of having set up when congested.For fear of this situation, need to obtain the current state information of each node of network, and adopt certain flow control mechanism that the flow of whole network is controlled according to this information.
The main employing of current flux control is non-with the road flow control mode.Non-ly be meant that with the road flow control congestion information that transmits two nodes of data is not to be placed in the same bag with data to transmit, but adopt one independently channel congestion information is sent to next node, whether decision continues to transmit data to the other side node according to the congestion information that obtained.When 3 of existence or 3 above nodes, can adopt the flow control step by step or the flow control of bypassing the immediate leadership.Control is meant the transmission rate of the channel status information modulation present node that the direct downstream site of employing present node returns step by step; The control of bypassing the immediate leadership is the transmission rate that adopts the channel status information modulation present node that the indirect downstream site of present node returns.Suppose to exist in the network serial-port that constitutes Data transmission by node A, B, C, the channel status information modulation that node A only utilizes Node B to return sends the speed of data to Node B, the channel status information modulation that Node B only utilizes node C to return sends the speed of data to node C, this just is called control step by step, if the channel status information that node A utilizes node C to return is modulated the transmission rate of its data, then being called is the control of bypassing the immediate leadership.
Flow control mainly adopts certain algorithm of band feedback to realize.As on March 6th, 2002
Disclosed, application number is 00803312.9, and denomination of invention is the patent application of " fair flow controlling method in the packet network "; On October 5th, 1994 is disclosed, and application number is 93120145.4, and denomination of invention is the patent application of " the information flow control system of packet switch " etc., and these methods can be carried out flow control preferably to a complete packet service network.
In " fair flow controlling method in the packet network " patent, provide a kind of method of the packet switching network being carried out fair flow control.Each node all links to each other with a plurality of transmission data/reception data source.Its flow control methods schematic diagram as shown in Figure 1.This system mainly is made up of source 10,11,13,14 and network 12, and wherein network 12 comprises node 21,22,23,24 again.
Source 10,11,13,14 is used to transmit and receive data.Those of ordinary skill in the art will be appreciated that the source can be mobile phone, be connected to the computer of network etc.
Node 21,22,23,24 is mainly used in the data that the source is sent and is sent to the destination through certain path, can realize functions such as route control, flow control, service quality therebetween.Those of ordinary skill in the art can know that node can be switch or router.General each node all has a buffer memory, is used to store the data queue that receives from each source.
Node 21 is connected with node 22 with source 10,11 among the figure; Node 22 is connected with node 21,23,24; Node 23 is connected with node 22 with source 13,14; Node 24 is connected with node 22,23.
Actual when carrying out flow control, the resource management cell that except business datum, also has reaction network bandwidth availability that between source and node, transmits (Resource Management Cell is called for short " RMC ").RMC can be produced by source or node.Suppose that source 10,11 is the transmission source, source 13,14 is a reception sources.The business datum that is sent by source 10,11 is delivered to source, destination 13,14 through network 12, and this moment, network 12 can be regarded the Virtual Channel (VirtualChannel is called for short " VC ") between transmission source and the reception sources as.After receiving data, the source, destination returns the RMC of reflection current network state to the transmission source by this VC.
Information spinner among the RMC will comprise current cell rate (Current Cell Ratio, abbreviation " CCR "), minimum cell rate (Minimum Cell Ratio, abbreviation " MCR "), do not increase (Not Increase, abbreviation " NI ") field, crowded explanation (Congest Introduction is called for short " CI ") field and explicit rate field.When the source produced RMC, CCR was set to current permission cell rate.The minimum bandwidth of distributing for each VC when MCR explanation source produces RMC.Explicit rate is RMC when passing through in the network node, return the available bandwidth that RMC allows by node according to what certain algorithm write, so explicit rate is the information of reaction current network state.CI represents the very crowded bandwidth that needs the reduction source of network, and prevents to increase service traffics with a NI.
The whole group business network is exactly to adjust the data transmission rate of transmitting terminal in real time by obtaining explicit rate value in the RMC information that receiving terminal feeds back, thus the flow control of realization the whole network.
In " the information flow control system of packet switch) " patent, come the information flow in the telecommunication circuit is controlled by a kind of packet switch with inputoutput buffer.Its information flow control system schematic diagram as shown in Figure 2.Mainly form by input buffer 30, adjusting device 31, switch 32, output buffer 33.
At first the data that each data service source is sended over are deposited into respectively in the input buffer 30, and adjusting device 31 can be regulated the transmission data rate that input buffer 30 outputs to switch 32, and process switch 32 backs are by output buffer 33 dateouts.And the current state of feedback output buffer 33 is adjusted adjusting device 31.If, then adjust adjusting device 31 and reduce the data transmission rate that corresponding input buffer 30 sends to switch 32 when anterior bumper 33 overflows; If, then adjust the corresponding input buffer 30 of adjusting device 31 increases and send to the data transmission rate of switch 32, thereby realize flow control at this service node when anterior bumper 33 is empty.
Because the data volume of transmission over networks is increasing; the very high type of service of some priority particularly, as banking etc., network is when breaking down; must there be a kind of mechanism to guarantee the continuity and the service quality of network, therefore inevitably needs to adopt the protection switching technique.Two main aspects of protection switching technique are reliability and protection switch time.Reliability is meant can not produce mistake protection or service disconnection.Protection switch time is meant that finishing protection switches the needed time.If the time that protection is switched is longer, can causes losing in a large number of packet, thereby influence the service quality of network.
For in protection switch time, flow control still can work on, and therefore need adopt the flow control technique with protection switch function to guarantee professional service quality for some Packet Service.In the prior art, a kind of being to use adopted the non-with the road flow control mode of one of above-mentioned algorithm, a kind of be to use common with the road flow control mode.
In actual applications, there is following problem in such scheme: systematic comparison complexity, cost are than higher, and flow control can not realize when the generation protection is switched.
Cause the main cause of this situation to be, the prior art scheme has adopted non-with the road flow control mode, and this mode causes the complexity of system and cost to increase owing to needing to increase extra Channel Transmission network state information; When switching, the prior art scheme since need to use one independently channel transmit the current state information of network, and be difficult to this extra channel is controlled, so be difficult to realize flow control when protection is switched.
Summary of the invention
In view of this; main purpose of the present invention is to provide a kind of packet service network flow control system and method thereof; make packet service network to realize real-time traffic control, guarantee that overflow or underflow do not appear in the buffer memory of each node, and have the protection switch function with smaller cost.
For achieving the above object, the invention provides a kind of packet service network flow control system, comprise at least two interconnective nodes, wherein
Each node is used for sending the cell that has flow control information according to the state of this node to the node of direct neighbor, and from cell, decomposite flow control information, and send the speed of cell to the node of this direct neighbor according to this flow control information decision from the node of described direct neighbor.
Wherein, described node continues to send the cell that has described flow control information to the node of described direct neighbor, and every adjacent two time intervals that have the cell of described flow control information must be little of satisfying following two conditions simultaneously:
Can guarantee that the node that stopped described direct neighbor in this node generation overflow in the past sends data to this node;
Can guarantee that the node that started described direct neighbor before this node generation underflow sends data to this node.
The payload that comprises described flow control information and the described data of carrying in the described cell.
Described system comprises three nodes at least, and wherein having two nodes at least is main and standby relation.
Flow control information in the described cell can be 2 parts, and wherein, a part is represented the state of receiving node, and a part is represented the state of sending node.
Can calculate or adjust the upper limit in the described time interval by a kind of or its combination in any in the following factor:
The cache size of data channel, euclidean distance between node pair, cell transmission speed, cell size, node reaction time and carrier wave speed.
Described node can be packet switch or router.
The present invention also provides a kind of packet service network flow control methods, comprises following steps:
First node sends the cell that has flow control information according to the state of this node to the Section Point of direct neighbor;
After described Section Point is received described cell, therefrom decomposite described flow control information, and send the speed of cell according to described flow control information decision to described first node.
Wherein, the described cell that has flow control information is to continue to send, and per two time intervals that have the cell of flow control information must be little of satisfying following two conditions:
Can guarantee that stopping described Section Point in the past in described first node generation overflow sends data to described first node;
Can guarantee before described first node generation underflow, to start described Section Point and send data to described first node.
Can calculate or adjust the upper limit in the described time interval by a kind of or its combination in any in the following factor:
The cache size of data channel, euclidean distance between node pair, cell transmission speed, cell size, node reaction time and carrier wave speed.
By relatively finding that technical scheme difference with the prior art of the present invention is, has at first adopted the mode with the road flow control, next has introduced the pattern of Flow Control step by step, solves overflow and the underflow problem in the Flow Control by guaranteeing time margin.The assurance of time margin can be by strengthening buffer memory, reducing to realize to the professional modes such as granularity of next stage node transmission.
Difference on this technical scheme, brought comparatively significantly beneficial effect, it promptly is 00803312.9 and 93120145.4 Chinese patent with respect to application number, the present invention is owing to the method that has adopted with the road flow control, flow-control information is attached in the cell that transmits data and sends together, avoided extra Channel Transmission network state information, therefore simplified system, reduced cost.Secondly, under the prerequisite that guarantees time margin, realize Flow Control step by step, avoided the generation of overflow and underflow, guaranteed the real-time of Flow Control, and can realize support the protection switch function.
Description of drawings
Fig. 1 is a fair flow controlling method schematic diagram in the packet network in the prior art;
Fig. 2 is the information flow control system schematic diagram of packet switch in the prior art;
Fig. 3 has the packet switching system of protection switch function according to an embodiment of the invention with road flow control system schematic diagram;
Fig. 4 transmits the cell structure schematic diagram according to an embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
Fig. 3 has the packet switching system of protection switch function according to an embodiment of the invention with road flow control system schematic diagram, as shown in the figure.Mainly constitute: node 40,41,42 by three network nodes.In order to guarantee that overflow or underflow do not take place during switching, adopt the mode of Flow Control step by step.
Node 40,41,42 is mainly used in the Route Selection of finishing network, flow control, and those of ordinary skill in the art can know that this node can be other Packet Service load bearing equipment in switch, router or the communication network.Usually in node, comprise an input buffer and an output buffer.Input buffer is used to preserve the data that data source or other nodes send over, and forms a data formation; Output buffer is used to preserve the data queue that sends to other nodes or destination.
Node 40 and node 42 all are the two-way treatment facilities in the network among the figure, be sending node also be receiving node.Node 41 is the secondary node of node 40.Node 41 is used to guarantee when network breaks down, and data service can continuous unbroken transmission, and the situation of losing in a large number do not occur wrapping.Promptly under normal circumstances data are transmitted between node 40 and node 42, and when node 40 broke down, data were transmitted between node 41 and node 42, realize the protection switch function.
Fig. 4 is a transmission cell structure schematic diagram according to an embodiment of the invention, as shown in the figure.One is transmitted cell and comprises two parts: Flow Control/state information and payload user data.A cell has 68 bytes, and wherein preceding 4 bytes are Flow Control/state information, and other 64 bytes are payload user data.
Flow Control/state information is respectively F0, F1, C0, C1.Wherein F0, F1 are described in the invention with the road flow control information.The F0 byte use Rx_P7 to each bit representation of Rx_P0 the state of 8 receiving nodes of correspondence.If mode bit is 1 pairing node unsaturation of expression, still can receive data; Be that 0 expression node corresponding is saturated, can not receive data.If pairing node is counted 8 of less thaies, then adopt the several bit representation node corresponding that begin from Rx_P0.The state of representing the opposite end receiving node during reception is represented the state of local terminal receiving node during transmission.F1 byte uses the state of Tx_P7 to corresponding 8 sending nodes of each bit representation institute of Tx_P0, represents that node has data to send if mode bit is 1, is 0 and represents that node does not have data to send.If node is counted 8 of less thaies, adopt the several bit representation node corresponding that begin from Tx_P0.The state of representing the opposite end sending node during reception is represented the state of local terminal sending node during transmission.C0 and C1 are other state of a control information.
Payload user data is the grouping busihess data that is carried, and its length is variable.The longest can be 64 bytes, and the shortest can be 0 byte.
When carrying out flow control, require cell must be at certain time intervals in sustained delivery, even when not having payload user data to transmit between node, also Flow Control/state information must be delivered to the other side, guarantee to obtain at any time between the node the other side's state, thereby adjust the speed of transceive data separately, finally realize the flow control of whole system.If there is not the data carried by data payload in the cell, claim that this cell is pure Flow Control cell.
Packet switching system with protection switch function shown in Figure 3 with road flow control system schematic diagram in; under normal circumstances; concerning node 42; must guarantee that from the time interval between adjacent two cells of node 41,40 arrival nodes 42 node 42 has time enough nargin to go to realize stopping to send data to node 41,40, guarantee that perhaps node 42 has time enough nargin to go to realize starting to node 41,40 transmission data.By the appropriate size that this time interval is set, buffer memory overflow or underflow can not occur in the time of can guaranteeing 42 transmissions of node 41,40 and node data.The technical staff who is familiar with field of the present invention will appreciate that, this large interval I is with according to the physical distance between two nodes, the cache size of node, cell size, the factors such as time of the speed of passage transmitting data and the control information of node response traffic calculate.Can be by increasing nodal cache, the mode that reduces cell size increases time interval size, guarantees that internodal Flow Control has sufficient time margin.Need to prove that the present invention adopts the method for Flow Control step by step, must guarantee above-mentioned time margin between every adjacent two-stage.The system of switching for needing protection; in the system for example shown in Figure 3; node 40 and backup node 41 thereof belong to same one-level; node 42 belongs to one-level; therefore between node 40 and the node 42; all must guarantee time margin in design between node 41 and the node 42, flow control system operate as normal in the time of can guaranteeing to switch like this.
When protection was switched, node 40 switched to node 41.Because adopt regular time to send cell signal at interval, the business datum that can not cause being stored in the node 41 all sends to node 42 and causes the buffer memory of node 42 to overflow quickly; Can not occur its buffer memory because node 42 processing speeds are very fast yet and be empty situation.Owing to comprise the current state information of node 41,42 in the cell, therefore still can realize flow control simultaneously.
Though by reference some preferred embodiment of the present invention, the present invention is illustrated and describes, but those of ordinary skill in the art should be understood that, can do various changes to it in the form and details, and the spirit and scope of the present invention that do not depart from appended claims and limited.
Claims (10)
1. a packet service network flow control system is characterized in that, comprises at least two interconnective nodes, wherein
Each node is used for sending the cell that has flow control information according to the state of this node to the node of direct neighbor, and from cell, decomposite flow control information, and send the speed of cell to the node of this direct neighbor according to this flow control information decision from the node of described direct neighbor.
2. packet service network flow control system according to claim 1, it is characterized in that, described node continues to send the cell that has described flow control information to the node of described direct neighbor, and every adjacent two time intervals that have the cell of described flow control information must be little of satisfying following two conditions simultaneously:
Can guarantee that the node that stopped described direct neighbor in this node generation overflow in the past sends data to this node;
Can guarantee that the node that started described direct neighbor before this node generation underflow sends data to this node.
3. packet service network flow control system according to claim 2 is characterized in that, comprises the payload of described flow control information and the described data of carrying in the described cell.
4. according to any described packet service network flow control system in the claim 1 to 3, it is characterized in that described system comprises three nodes at least, wherein have at least to form the protection switch function between two nodes.
5. according to any described packet service network flow control system in the claim 1 to 3, it is characterized in that the flow control information in the described cell can be 2 parts, wherein, a part is represented the state of receiving node, and a part is represented the state of sending node.
6. according to any described packet service network flow control system in the claim 1 to 3, it is characterized in that, can calculate or adjust the upper limit in the described time interval by a kind of or its combination in any in the following factor:
The cache size of data channel, euclidean distance between node pair, cell transmission speed, cell size, node reaction time and carrier wave speed.
7. according to any described packet service network flow control system in the claim 1 to 3, it is characterized in that described node can be other Packet Service load bearing equipment in packet switch, router or the communication network.
8. a packet service network flow control methods is characterized in that, comprises following steps:
First node sends the cell that has flow control information according to the state of this node to the Section Point of direct neighbor;
After described Section Point is received described cell, therefrom decomposite described flow control information, and send the speed of cell according to described flow control information decision to described first node.
9. packet service network flow control methods according to claim 8, it is characterized in that, the described cell that has flow control information is to continue to send, and per two time intervals that have the cell of flow control information must be little of satisfying following two conditions:
Can guarantee that stopping described Section Point in the past in described first node generation overflow sends data to described first node;
Can guarantee before described first node generation underflow, to start described Section Point and send data to described first node.
10. packet service network flow control methods according to claim 9 is characterized in that, can calculate or adjust the upper limit in the described time interval by a kind of or its combination in any in the following factor:
The cache size of data channel, euclidean distance between node pair, cell transmission speed, cell size, node reaction time and carrier wave speed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100486976A CN1708030A (en) | 2004-06-11 | 2004-06-11 | System for controlling packet service network flow and method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100486976A CN1708030A (en) | 2004-06-11 | 2004-06-11 | System for controlling packet service network flow and method thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1708030A true CN1708030A (en) | 2005-12-14 |
Family
ID=35581687
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2004100486976A Pending CN1708030A (en) | 2004-06-11 | 2004-06-11 | System for controlling packet service network flow and method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1708030A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008098422A1 (en) * | 2007-02-15 | 2008-08-21 | Zte Corporation | A method for transmitting the flow control information in the fixed-length packet exchange |
| WO2009049458A1 (en) * | 2007-10-15 | 2009-04-23 | Zte Corporation | An online capacity-reduction method for non-stopped service of a protection ring network of an optical transmision multiple segment |
| CN101188575B (en) * | 2007-12-04 | 2010-06-09 | 浙江大学 | A traffic control and message buffering method oriented to distribution subscription system |
| CN101159158B (en) * | 2006-10-02 | 2010-07-21 | 国际商业机器公司 | Method and system of detecting a corruption in a data block |
| CN101621833B (en) * | 2009-08-13 | 2012-05-09 | 中兴通讯股份有限公司 | Message flux control method and base station controller |
| CN101420462B (en) * | 2008-12-11 | 2013-03-20 | 中国移动通信集团北京有限公司 | Method and system for distributing data |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
-
2004
- 2004-06-11 CN CNA2004100486976A patent/CN1708030A/en active Pending
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159158B (en) * | 2006-10-02 | 2010-07-21 | 国际商业机器公司 | Method and system of detecting a corruption in a data block |
| US7793159B2 (en) | 2006-10-02 | 2010-09-07 | International Business Machines Corporation | Method, computer program product, and computer system for detecting a corruption in a data block stored by a tape recording apparatus |
| WO2008098422A1 (en) * | 2007-02-15 | 2008-08-21 | Zte Corporation | A method for transmitting the flow control information in the fixed-length packet exchange |
| CN101542988B (en) * | 2007-02-15 | 2011-07-13 | 中兴通讯股份有限公司 | A method for transmitting the flow control information in the fixed-length packet exchange |
| WO2009049458A1 (en) * | 2007-10-15 | 2009-04-23 | Zte Corporation | An online capacity-reduction method for non-stopped service of a protection ring network of an optical transmision multiple segment |
| CN101188575B (en) * | 2007-12-04 | 2010-06-09 | 浙江大学 | A traffic control and message buffering method oriented to distribution subscription system |
| CN101420462B (en) * | 2008-12-11 | 2013-03-20 | 中国移动通信集团北京有限公司 | Method and system for distributing data |
| CN101621833B (en) * | 2009-08-13 | 2012-05-09 | 中兴通讯股份有限公司 | Message flux control method and base station controller |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7295519B2 (en) | Method of quality of service based flow control within a distributed switch fabric network | |
| EP3036869B1 (en) | Reconfigurable and variable-rate shared multi-transponder architecture for flexible ethernet-based optical networks | |
| US7161907B2 (en) | System and method for dynamic rate flow control | |
| US7274660B2 (en) | Method of flow control | |
| US8339961B2 (en) | Dynamic bandwidth allocation method and dynamic bandwidth allocation device | |
| JPH0846590A (en) | Data transmission system | |
| CA2342097A1 (en) | Link state routing techniques | |
| JPH04227356A (en) | Telecommunication network having near-by transfer mode | |
| US7483435B2 (en) | Process for the transmission of data by a multi-user, point to multi-point digital data transmission system | |
| JP2003018186A (en) | Communications equipment and communication control method | |
| CN1237843C (en) | Improvements in a third generation cellular network | |
| CN1708030A (en) | System for controlling packet service network flow and method thereof | |
| Charny et al. | Scalability issues for distributed explicit rate allocation in ATM networks | |
| CN100502370C (en) | Optimizing system and method for medium transmission on different transmission channels | |
| CN107342949B (en) | It is a kind of realize TDM and Packet Service statistical multiplex transmission device, method | |
| CA2223868A1 (en) | Broadband telecommunications system | |
| CN101453411B (en) | Method, system and equipment for label switch path establishment | |
| US6721413B1 (en) | Method and apparatus for observing and controlling a multi-layered communication network | |
| JPH07131465A (en) | Atm cell multiplex control system | |
| Albuquerque et al. | Multicast flow control with explicit rate feedback for adaptive real-time video services | |
| JP2002164925A (en) | Multicast communication system and multicast communication method | |
| Qian et al. | Wimax services over transport networks | |
| Marsan et al. | TCP over ABR: Some Preliminary Simulation Results | |
| CN118200241A (en) | Multi-queue scheduling system | |
| JPH03119845A (en) | Resource allocation system for packet switching 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 | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20051214 |