CN104506431B - A kind of content search method of content center network, and router and node - Google Patents
A kind of content search method of content center network, and router and node Download PDFInfo
- Publication number
- CN104506431B CN104506431B CN201410820163.4A CN201410820163A CN104506431B CN 104506431 B CN104506431 B CN 104506431B CN 201410820163 A CN201410820163 A CN 201410820163A CN 104506431 B CN104506431 B CN 104506431B
- Authority
- CN
- China
- Prior art keywords
- content
- route
- packet
- node
- file
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a kind of content search method of content center network.The inquiry and forwarding of content center network are all based on content name, itself have that NameSpace is unlimited and route table items it is limited between contradiction.A kind of the problem of invention is more for content center network route table items, and inquiry velocity is slow, it is proposed that stratification content naming method.The naming method has inclusion relation in terms of content from inside to outside using two layers of name, level.When the routing inquiry hit more complete content of internal layer, by the method for " internal layer content effective marker position " set to routeing acknowledgment packet, to route requests node incidentally data buffer storage information.By this piggybacking method, when node continuously asks same larger data block, it is possible to reduce route requests number.Meanwhile after the node for handling route replies packet receives " internal layer content effective marker position " set information, merge the route table items of correlation, so as to compress route table space.
Description
Technical field
To look into the present invention relates to the present invention relates to network communication technology field, more particularly to a kind of content of content center network
Inquiry method.
Background technology
Information centre's network (ICN) and the network architecture technology of its extension also include content center network (CCN), life
Name data network (NDN), without loss of generality, below we with content center network, i.e. CCN, hold within representing this or letter
Network structure centered on breath.CCN is not concerned with the supplier of content centered on content, content is only focused in itself, by internal
The name of appearance and the route based on content name, better meet the demand of information content consumption.
University of California Berkeleys in 2006 and network computer research institute propose a kind of net of data-oriented
Network architecture DONA (data-oriented (and beyond) network architecture).DONA proposes that one kind is held
It is long, can self-validation numerical nomenclature mode, to substitute the domain name in IP network (DNS) system.DONA uses two tuples<P:L>
Data are named, name forms a flat NameSpace without structural.The problem of DONA maximums is that scalability is asked
Topic.Due to using flattening name, polymerization difficulty is big, while significantly larger than IP address, routing table expansion issues are tight again for data volume
Weight, the especially expansible problem of top-level router are more serious.
The Jacobson in Park research centers in 2009 proposes CCN (content- network using content as center
Centric networking), the class URL names for the stratification that CCN is used.For information name is in contrast to IP address, more
Collapsibility, it polymerize (referring to the set to the various information in internet) difficulty and is higher than IP address, and CCN scalability problems are higher than IP network
Network.
Therefore, a kind of content search method of content center network how is proposed, for content center network routing inquiry
Named based on content, itself have that NameSpace is unlimited and route table items it is limited between contradiction, by using name itself
Advantage, accelerate routing inquiry, compression route table items, be a urgent problem to be solved.
The content of the invention
The embodiment of the present invention provides a kind of content search method of content center network, with solve in content center network because
For routing inquiry based on content name and caused NameSpace is unlimited and route table items it is limited between contradiction；
Therefore, first aspect present invention provides a kind of content search method of content center network, it includes following step
Suddenly：
Node receives route requests packet, and the request includes<P:L1,L2>, L1 represent all segmentations of whole file content and
The cryptographic Hash for all small data fragments being each segmented；L2 represents a Hash being entirely segmented of some file of file content
Value；P is to test position certainly；
Local cache is inquired about, has searched whether matching<P:L1,L2>Or<P:L1,*>Data content；
In the case where finding local cache, the packet of generation route replies is simultaneously grouped incidentally data buffer storage in route replies
Information；
Sending node acknowledgment packet after the handling process of continuous route replies packet in the completed；
Data buffer storage information is L1 flag bit set.
Preferably, node does not meet the content of route requests packet, according to routing policy, forwarding route requests packet.
Preferably, the inquiry local cache, has searched whether matching<P:L1,L2>Or<P:L1,*>Data content
Step, which includes first inquiry, matching<P:L1,*>Data content match query again<P:L1,L2>Data content.
Preferably, route requests include L3, represent the cryptographic Hash of some small data fragment of file content.
Second aspect of the present invention has carried a kind of router, and the router includes：
Receiving unit, for receiving request packet from route, the request includes<P:L1,L2>, L1 represented in whole file
Hold the cryptographic Hash of all segmentations and all small data fragments being each segmented；The one of some file of L2 expression file contents is whole
The cryptographic Hash of segmentation；P is to test position certainly；
Query unit, for inquiring about local cache, matching is searched whether<P:L1,L2>Or<P:L1,*>Data in
Hold；
Generation unit, in the case where finding local cache, the packet of generation route replies simultaneously to divide in route replies
Organize incidentally data buffer storage information；
Transmitting element, for continue in the completed route replies packet handling process after sending node acknowledgment packet.
Third aspect present invention provides a kind of content search method of content center network, and this method also includes following step
Suddenly：
Route requests packet is sent, the request includes<P:L1,L2>, L1 represents all segmentations of whole file content and each
The cryptographic Hash of all small data fragments of segmentation；L2 represents a cryptographic Hash being entirely segmented of some file of file content；
Node receives route replies packet, and response is named as<P:L1,L2>Content, and increase newly in the machine routing table new
List item；
Check whether route replies packet carries data buffer storage information corresponding with L1 or L2；
In the case where route replies packet carries corresponding with L1 or L2 data buffer storage information, node is by all coupling numbers
Merge according to the route table items of cache information；
Node continues the handling process that route replies are grouped according to routing policy；
Data buffer storage information corresponding with L1 or L2 is L1 or L2 flag bit set.
Fourth aspect present invention provides a kind of node, and the node includes：
Transmitting element, for sending route requests packet, the request includes<P:L1,L2>, the whole file content of L1 expressions
All segmentations and the cryptographic Hash for all small data fragments being each segmented；L2 represents one whole point of some file of file content
The cryptographic Hash of section；P is to test position certainly；
Receiving unit, for receiving route replies packet, response is named as<P:L1,L2>Content, and in local routing
Increase new list item in table newly；
Query unit, for checking whether route replies packet carries data buffer storage information corresponding with L1 or L2；
Combining unit, in the case of carrying data buffer storage information corresponding with L1 or L2 in route replies packet, section
Point merges the route table items of all matched data cache informations.
The embodiment of the present invention reduces route query times, effectively reduces routing cost by incidentally cache information；
The route table items related by merging content, compression route table space.
Brief description of the drawings
Fig. 1 is the scene graph of content center network；
Fig. 2 is the route request information process chart that the embodiment of the present invention assists route discovery；
Fig. 3 is the route replies Message Processing flow that the embodiment of the present invention assists routing table to merge；
Fig. 4 is the thinking of present invention layering.
Embodiment
Below by drawings and examples, technical scheme is described in further detail.
Fig. 1 is the scene graph of content center network, as shown in figure 1, content center network includes node 1, route 1, route 2
With route 3；Wherein, node 1 is connected with route 1, and route 1 is connected with route 2.Stored in different routers identical or different
Data or content.File content is layered successively, and level has inclusion relation in terms of content from inside to outside.In an example
In, it is divided into three layers, a is expressed as the cryptographic Hash of all segmentations and all small data fragments being each segmented on whole file content；
B, c is a cryptographic Hash being entirely segmented of some file in file content；K is some small data fragment of file content
Cryptographic Hash.
In Fig. 1, different routers are illustrated to have the different pieces of information segment of same entire content file.There is this in route 1
Some small data fragment of entire content file, such as：The data slot is named as<P,a,b,k>；There is this complete in route 1
The whole segmentation of the one of some file of content file, such as：It is named as<P, a, b, *>、<P, a, c, *>Etc.；There is this in route 2
The completion content of entire content file, such as be named as<P, a, *, *>, wherein a is the completion content of file, and b, c are file
A certain segmentation, k be a certain segmentation a certain small data fragment；
In the embodiment of the present invention, when receiving the content search from node 1, router according to content, with title and
Associated description is inquired about.When route 1 receives content more complete from the inquiry internal layer of node 1, for example, by route
The method of " internal layer content effective marker position " set of acknowledgment packet, to route requests node incidentally data buffer storage information.Pass through
This piggybacking method, when node continuously asks same larger data block, it is possible to reduce route requests number.Meanwhile locate
After line of reasoning receives " internal layer content effective marker position " set information by the node of acknowledgment packet, merge the route table items of correlation,
So as to compress route table space.
Fig. 2 is the route request information process chart that the embodiment of the present invention assists route discovery；As shown in Figure 2：
In step 201, node receives route requests packet, and inquiry is named as<P:L1,L2,L3>Content；Wherein, L1
Refer to the cryptographic Hash of entire content file；L2 represents the cryptographic Hash of one segmentation of the content file；L3 represents the content file
The cryptographic Hash of one data slot of some segmentation；P is to test position certainly, interior for verifying the copyright owner of entire content file
The mandate publisher of appearance, the visible range of content.
In step 202, querying node local cache, matching has been searched whether<P:L1,*,*>Partial data content,
If so, going to step 203, otherwise, 204 are gone to step；
In step 203, node generation route replies packet, the L1 flag bit set that route replies are grouped, goes to step
208；
In step 204, querying node local cache, matching has been searched whether<P:L1,L2,*>Partial data content,
If so, going to step 205, otherwise, 206 are gone to step；
In step 205, node generation route replies packet, the L2 flag bit set that route replies are grouped, goes to step
208；
In step 206, querying node local cache, matching has been searched whether<P:L1,L2,L3>Partial data in
Hold, if so, going to step 207, otherwise, go to step 209；
In step 207, node generation route replies packet, goes to step 208；
In a step 208, node has the content for meeting route requests packet, starts the processing stream of follow-up route replies packet
Journey；
In step 209, node does not meet the content of route requests packet, according to routing policy, continues route requests
The handling process of packet.
It should be noted that content level is divided into L1, L2, L3 in the present embodiment, L1 represents that whole file content owns
Segmentation and the cryptographic Hash for all small data fragments being each segmented；What the one of some file of L2 expression file contents was entirely segmented
Cryptographic Hash；L3 represents the hash values of a data slot of some segmentation of whole file content；Here layering is an example
Son, it can also be divided into i layers, L1 ... Li (i=2,3 ...).
Fig. 3 is the route replies Message Processing flow that the embodiment of the present invention assists routing table to merge；As shown in Figure 3：
In step 301, node receives route replies packet, and response is named as<P:L1,L2,L3>Content；
In step 302, check route replies packet L1 flag bits whether set, if set, turn 303；Otherwise, turn
304；
In step 303, node is by all matchings<P:L1,*,*>Route table items merge, go to step 306；
In step 304, check route replies packet L2 flag bits whether set, if set, turn 305；Otherwise, turn
306；
In step 305, node is by all matchings<P:L1,L2,*>Route table items merge, go to step 306；
Within step 306, node continues the handling process that route replies are grouped according to routing policy.
It should be noted that content level is divided into L1, L2, L3 in the present embodiment, L1 represents that whole file content owns
Segmentation and the cryptographic Hash for all small data fragments being each segmented；What the one of some file of L2 expression file contents was entirely segmented
Cryptographic Hash；L3 represents the hash values of a data slot of some segmentation of whole file content；Here layering is an example
Son, it can also be divided into i layers, Li (i=1,2,3 ...).
Fig. 4 is the thinking of present invention layering；As shown in figure 4, by taking video file as an example, L1 represents whole video text
Part, L2 represent one segmentation of the video file, and L3 represents a data slot of some segmentation of the video file；
P is used for content self-validation, and the scope of checking includes：The copyright owner of content, the mandate publisher of content, content
Visible range.By taking video file as an example, the scope of P checkings includes the producer (such as China Film Production Group) of video file, video text
The mandate publisher (such as Tengxun's video) of part, (such as VIP user is visible, and member user is visible, owns for the visible range of video file
User is visible etc.).
With reference to Fig. 1, Fig. 2, Fig. 3, specific introduce the inquiry between the node of embodiment and route and merge route table items
Process：
1) query name of node 1 is the content of (P1, a, b, k)；
2) node 1 receives the acknowledgment packet of router 1, increases new list item in the machine routing table：
| Name | Next-hop | Distance |
| (P1,a,b,k) | Router 1 | 1 |
Table 1
3) query name of node 1 is the content of (P1, a, b, h)；
4) node 1 receives the acknowledgment packet of router 2, increases new list item in local routing table：
| Name | Next-hop | Distance |
| (P1,a,b,k) | Router 1 | 1 |
| (P1,a,b,*) | Router 1 | 2 |
Table 2
5) because content (P1, a, b, *) includes content (P1, a, b, k), the routing table of node 1 merges, and deletes former road
By list item.Routing table after renewal is：
| Name | Next-hop | Distance |
| (P1,a,b,*) | Router 1 | 2 |
Table 3
It should be noted that file is not limited solely to video file, audio file, data file etc. are can also be,
Three layers are equally also not limited to for layering, can be layered according to user's needs, but the central idea being layered still is wrapped
Containing relation.
Professional should further appreciate that, each example described with reference to the embodiments described herein
Unit and algorithm steps, it can be realized with electronic hardware, computer software or the combination of the two, it is hard in order to clearly demonstrate
The interchangeability of part and software, the composition and step of each example are generally described according to function in the above description.
These functions are performed with hardware or software mode actually, application-specific and design constraint depending on technical scheme.
Professional and technical personnel can realize described function using distinct methods to each specific application, but this realization
It is it is not considered that beyond the scope of this invention.
Above-described embodiment, the purpose of the present invention, technical scheme and beneficial effect are carried out further
Describe in detail, should be understood that the embodiment that the foregoing is only the present invention, be not intended to limit the present invention
Protection domain, within the spirit and principles of the invention, any modification, equivalent substitution and improvements done etc., all should include
Within protection scope of the present invention.
Claims (7)
1. a kind of content search method of content center network, it is characterised in that this method comprises the following steps：
Router receives route requests packet, and the request includes<P:L1,L2>, the cryptographic Hash of the whole file content of L1 expressions；L2
Represent a cryptographic Hash being entirely segmented of some file of file content；P is to test position certainly；
Local cache is inquired about, has searched whether matching<P:L1,L2>Or<P:L1,*>Data content；
In the case where finding local cache, the packet of generation route replies is simultaneously grouped incidentally data buffer storage letter in route replies
Breath, wherein, the data buffer storage information is L1 flag bit set；
Sending node acknowledgment packet after the handling process of continuous route replies packet in the completed.
2. according to the method for claim 1, it is characterised in that node does not meet the content of route requests packet, according to
Routing policy, forwarding route requests packet.
3. according to the method for claim 1, it is characterised in that the inquiry local cache, searched whether matching<P:
L1,L2>Or<P:L1,*>Data content the step of include first inquiry have matching<P:L1,*>Data content match query again<
P:L1,L2>Data content.
4. according to the method for claim 1, it is characterised in that route requests include L3, represent file content some
The cryptographic Hash of small data fragment.
5. a kind of router, it is characterised in that the router includes：
Receiving unit, for receiving request packet from route, the request includes<P:L1,L2>, the whole file content of L1 expressions
Cryptographic Hash；L2 represents a cryptographic Hash being entirely segmented of some file of file content；P is to test position certainly；
Query unit, for inquiring about local cache, matching is searched whether<P:L1,L2>Or<P:L1,*>Data content；
Generation unit, in the case where finding local cache, the packet of generation route replies simultaneously to be sent in route replies packet
Band data buffer storage information, wherein, the data buffer storage information is L1 flag bit set；
Transmitting element, for continue in the completed route replies packet handling process after sending node acknowledgment packet.
6. a kind of content search method of content center network, it is characterised in that this method also comprises the following steps：
Node sends route requests packet, and the request includes<P:L1,L2>, the cryptographic Hash of the whole file content of L1 expressions；L2 tables
Show the one of some file of the file content cryptographic Hash being entirely segmented；P is to test position certainly；
Route replies packet is received, response is named as<P:L1,L2>Content, and in local routing table increase newly new list item；
Check whether route replies packet carries data buffer storage information corresponding with L1 or L2；
In the case where route replies packet carries data buffer storage information corresponding with L1 or L2, node delays all matched datas
Stored route table items merge；
Node continues the handling process that route replies are grouped according to routing policy.
7. a kind of node, it is characterised in that the node includes：
Transmitting element, for sending route requests packet, the request includes<P:L1,L2>, the Kazakhstan of the whole file content of L1 expressions
Uncommon value；L2 represents a cryptographic Hash being entirely segmented of some file of file content；P is to test position certainly；
Receiving unit, for receiving route replies packet, response is named as<P:L1,L2>Content, and in local routing table
Increase new list item newly；
Query unit, for checking whether route replies packet carries data buffer storage information corresponding with L1 or L2；
Combining unit, in the case of carrying data buffer storage information corresponding with L1 or L2 in route replies packet, node will
The route table items of all matched data cache informations merge.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410820163.4A CN104506431B (en) | 2014-12-25 | 2014-12-25 | A kind of content search method of content center network, and router and node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410820163.4A CN104506431B (en) | 2014-12-25 | 2014-12-25 | A kind of content search method of content center network, and router and node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104506431A CN104506431A (en) | 2015-04-08 |
| CN104506431B true CN104506431B (en) | 2017-11-17 |
Family
ID=52948146
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410820163.4A Active CN104506431B (en) | 2014-12-25 | 2014-12-25 | A kind of content search method of content center network, and router and node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104506431B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110099135B (en) * | 2018-01-29 | 2020-06-16 | 中国科学院声学研究所 | Data open service system and method based on ICN naming |
| CN108449387A (en) * | 2018-02-24 | 2018-08-24 | 中国科学院信息工程研究所 | Content node in content distributing network and content distribution method |
| WO2021223097A1 (en) * | 2020-05-06 | 2021-11-11 | 北京大学深圳研究生院 | Authentication and authorization method for data content in network and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102917042A (en) * | 2012-10-12 | 2013-02-06 | 中兴通讯股份有限公司 | Method and device for realizing internet services based on convergence of CDN (content distribution network) and network |
| EP2574009A3 (en) * | 2011-09-21 | 2013-06-05 | Samsung Electronics Co., Ltd. | Network apparatus based on content name, method of generating and authenticating content name |
| CN103401795A (en) * | 2013-08-07 | 2013-11-20 | 电子科技大学 | Method for eliminating redundancy of transmission contents in content central network |
| CN103548020A (en) * | 2011-05-12 | 2014-01-29 | 华为技术有限公司 | Method and system for longest prefix matching of variable-sized hierarchical names by treelets |
| CN103559215A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Content name storage structure oriented design method in content network |
| CN103873602A (en) * | 2014-02-21 | 2014-06-18 | 北京邮电大学 | Network resource naming method and generating device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20130085558A (en) * | 2011-12-21 | 2013-07-30 | 삼성전자주식회사 | A processing method of an interest message and a data message according to priority in a content centric network |
-
2014
- 2014-12-25 CN CN201410820163.4A patent/CN104506431B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103548020A (en) * | 2011-05-12 | 2014-01-29 | 华为技术有限公司 | Method and system for longest prefix matching of variable-sized hierarchical names by treelets |
| EP2574009A3 (en) * | 2011-09-21 | 2013-06-05 | Samsung Electronics Co., Ltd. | Network apparatus based on content name, method of generating and authenticating content name |
| CN102917042A (en) * | 2012-10-12 | 2013-02-06 | 中兴通讯股份有限公司 | Method and device for realizing internet services based on convergence of CDN (content distribution network) and network |
| CN103401795A (en) * | 2013-08-07 | 2013-11-20 | 电子科技大学 | Method for eliminating redundancy of transmission contents in content central network |
| CN103559215A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Content name storage structure oriented design method in content network |
| CN103873602A (en) * | 2014-02-21 | 2014-06-18 | 北京邮电大学 | Network resource naming method and generating device |
Non-Patent Citations (3)
| Title |
|---|
| 信息中心网络研究综述;夏春梅，徐明伟;《计算机科学与探索》;20130731(第7期);第484页页 * |
| 内容中心网络路由查找关键技术研究;汪漪;《中国博士学位论文全文数据库 信息科技辑》;20140715(第7期);第I139-2页 * |
| 未来网络体系架构研究综述;黄韬，刘江，霍如，魏亮，刘韵洁;《通信学报》;20140831;第35卷(第8期);第184-197页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104506431A (en) | 2015-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11601522B2 (en) | Data management in an edge network | |
| CN104052661B (en) | Container name server and container name analytic method | |
| US9461907B2 (en) | Data routing | |
| Zhang et al. | A survey of caching mechanisms in information-centric networking | |
| CN107070786A (en) | The processing method of data source movement, the method E-Packeted and its device | |
| Rao et al. | Lbma: A novel locator based mobility support approach in named data networking | |
| CN104506431B (en) | A kind of content search method of content center network, and router and node | |
| CN105657006B (en) | A kind of access acceleration method and system for the first time accelerating network based on online | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN105262833B (en) | A kind of the cross-layer caching method and its node of content center network | |
| Doan Van et al. | An efficient in‐network caching decision algorithm for I nternet of things | |
| Li et al. | Hybrid wireless networks with FIB-based named data networking | |
| JP7202558B1 (en) | DIGITAL OBJECT ACCESS METHOD AND SYSTEM IN HUMAN-CYBER-PHYSICAL COMBINED ENVIRONMENT | |
| Wang et al. | Fog computing based content-aware taxonomy for caching optimization in information-centric networks | |
| CN104537091A (en) | Networked relational data query method based on hierarchical identification routing | |
| CN102378407B (en) | Object name resolution system and method in internet of things | |
| CN111611348A (en) | ICN network information name searching method based on learning bloom filter | |
| CN108141463A (en) | For Internet of Things resource discovering and the distributive resources list based on ICN of routing | |
| Moeini et al. | Service specification and discovery in IoT networks | |
| CN1281027C (en) | Collaborative filtering recommendation approach for dealing with ultra-mass users | |
| US11568014B2 (en) | Information centric network distributed search with approximate cache | |
| Shi et al. | ICN-based cache-aware routing scheme in MSN | |
| Anastasiades et al. | Content discovery in wireless information-centric networks | |
| CN104980493B (en) | A kind of discovery method of servicing based on active cache algorithm | |
| CN111557086B (en) | Selecting from a plurality of items matching an interest |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210804 Address after: Room 1601, 16th floor, East Tower, Ximei building, No. 6, Changchun Road, high tech Industrial Development Zone, Zhengzhou, Henan 450001 Patentee after: Zhengzhou xinrand Network Technology Co.,Ltd. Address before: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District Patentee before: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES |
|
| TR01 | Transfer of patent right |