CN106790421A - A kind of step caching methods of ICN bis- based on corporations - Google Patents
A kind of step caching methods of ICN bis- based on corporations Download PDFInfo
- Publication number
- CN106790421A CN106790421A CN201611094420.6A CN201611094420A CN106790421A CN 106790421 A CN106790421 A CN 106790421A CN 201611094420 A CN201611094420 A CN 201611094420A CN 106790421 A CN106790421 A CN 106790421A
- Authority
- CN
- China
- Prior art keywords
- corporations
- icn
- node
- cache
- content
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of step caching methods of ICN bis- based on corporations, it is characterised in that comprise the following steps：First, SDN controllers describe the community structure in compresses in length technology identification ICN networks based on information, and corporations' division is carried out to ICN networks；2nd, the node corporations importance degree of each node is calculated；3rd, SDN controllers are based on the status information that openflow agreements collect the node in each corporations；4th, the step cache priority level of the node of each corporations is calculated；5th, user initiates interest request, to network request data content interested；6th, ICN interchangers are responsible for routeing and searching for the interest bag data of user；7th, SDN controllers calculate new cache information, formulate two step cache policies and issue two step cache policies to ICN interchangers；8th, the rule that each node is issued according to SDN controllers, performs two step cache policies.The present invention provides a kind of effective approach for the further optimization of ICN caching mechanisms.
Description
Technical field
The present invention relates to a kind of step caching methods of ICN bis- based on corporations.
Background technology
Instantly Internet industry fast development, new network application emerges in an endless stream, and the requirement to network transmission efficiency is more next
It is higher.However, the existing Internet architecture based on ICP/IP protocol stack constantly exposes a series of defects, including structure is consolidated
Change, autgmentability is poor, mobility support is limited, security inadequate natural endowment the problems such as, it is impossible to adapt to current internet develop need
Ask.In order to thoroughly solve problem above, academia proposes software defined network (SDN) and the network centered on information
(ICN).In order to further optimize network, the response delay of user's request content is reduced, ICN introduces caching mechanism, content is delayed
In the presence of closer to the place of user, so as to reduce the access time delay of user, the consumption of the network bandwidth and the load of server are reduced.
But, in the numerous caching mechanisms currently having pointed out, still there are problems that " caching invalid ", " caching homogeneity needs solution
Certainly.
Caching Placement Strategy is used to determine the cache location of content, can be divided into caching on the way and bypass two class mechanism of caching.
Caching refers to that content object is buffered in the caching mechanism returned along road on the node passed through in way where it, including place on the way
Place's caching, selectivity caching etc..The weak point for caching on the way is to easily cause caching redundancy, is easier to cause invalid cache,
Waste of resource.Bypass caching mechanism is by prior collection network status information, then calculates global optimization's scheme that caching is placed.
Such as Pueraria lobota states etc. propose to enliven the path cache policy of the factor based on greatest content, enliven the factor in forwarding according to content first
Maximum hotspot request region is found on path, then using the cache node in uniformity Hash collaboration caching selection regions.Liu
Outer happiness etc. utilizes the idle bandwidth of link by content caching to adjacent node, and according to ratio, the downstream node of forwarding port number
Link utilization and content the caching probability of the Suitable content object on node such as life cycle.
Different from work on hand, herein by community area cache contents object, rationally dispersion caching is right in network-wide basis
As, content object is buffered in each corporations on the node with different importance degrees by its popularity, on the one hand can realize bearing
Carry balanced, on the other hand can improve the variation of each nodal cache content in each corporations.
The content of the invention
The present invention is in view of the shortcomings of the prior art, there is provided a kind of step caching methods of ICN bis- based on corporations.The method ICN
The thought of middle introducing SDN and the corporations of complex network are theoretical, propose the ICN cache policies based on corporations' characteristic, by corporations point
Analysis, identifies the corporations border in ICN, then content object is reasonably buffered in each corporation by " two steps caching " mechanism
Appropriate node on, for the further optimization of ICN caching mechanisms provides a kind of effective approach.
In order to achieve the above object, a kind of step caching methods of ICN bis- based on corporations of the present invention, mainly including following step
Suddenly：
The first step, SDN controllers describe the community structure in compresses in length technology identification ICN networks based on information, to ICN
Network carries out corporations' division；
Second step, the node corporations importance degree for calculating each node；
3rd step, SDN controllers are based on the status information that openflow agreements collect the node in each corporations；
4th step, the step cache priority level of the node of each corporations of calculating；
5th step, user initiate interest request, to network request data content interested；
6th step, ICN interchangers are responsible for routeing and searching for the interest bag data of user；
7th step, SDN controllers calculate new cache information according to the popularity for recalculating, and formulate two steps caching plan
Slightly, and two step cache policies are issued to ICN interchangers；
The rule that 8th step, each node are issued according to SDN controllers, performs two step cache policies.
Preferably, the status information in the 3rd step includes residual memory space, and memory capacity, node corporations are important
Degree and content popularit etc..
Preferably, in the 6th step, when content object is asked by the node in network for the first time, SDN controllers are issued
Flow table, during content object drained into each corporations one step cache priorities level highest node, and by specifying the nodal cache content.
Used as the further improvement of such scheme, the content object is drained into meeting during the step of each corporations one is cached
Whether overtime it is judged step caching, time-out is continued waiting for if having not timed out.
As the further improvement of such scheme, during the content object is drained into the step caching of each corporations one,
When temporary storage time reaches period demand T, SDN controllers recalculate global popularity and the localized epidemics of each temporary content
Degree, and two step cache locations of each content object are calculated accordingly, to realize the rationalization of cache contents spatial distribution.
Corporations' partition problem that compresses in length technology solves ICN networks is described using based on information in the first step.With road
It is node by device/interchanger, complex network is built with the side that is physically connected as between them, is with mixed-media network modules mixed-media degree formula (1)
Object function, optimized algorithm splits the network into different corporations：
Wherein NcThe number of corporations in network is represented, M represents the sum connected in network, mcBetween expression corporations c interior nodes
Connection number, dcRepresent all node number of degrees sums in corporations c.
In the second step, node corporations importance degree refers to the importance degree in node corporations where it.It is defined as follows：
Wherein, c is the corporations' number in network, viRepresent with the router in network as node, the thing between router
Reason link is the ith feature vector of the adjacency matrix that side builds, vikRepresent characteristic vector viIn k-th element.
In 4th step, in the initial period that content object is produced, its popularity (including global popularity and local flow
Row degree) more difficult calculating, and it is inaccurate.Therefore, patent of the present invention proposes that two step caching mechanisms are inaccurate to solve popularity computation
Derivative problem.First, according to corporations' interior joint status information (such as buffer memory capacity, utilization rate and node corporations importance degree)
The priority of a step cache contents object is calculated, when content object is produced and is asked by the node in network, the content object
Temporary cache is in step cache priority level highest node in corporations；Secondly, certain is reached in content object is temporarily stored in corporations
During one given period of time T, SDN controllers are calculated the request situation of the content object according to the whole network and each corporations' node
Global popularity and local popularity, and the two step cache locations to content object are recalculated accordingly.Increasing by two steps caching can
More they tend to rationalize in cache location and temporal distribution with the content object in allowing a step to cache.Node k's once delays
Deposit priority SkIt is defined as：
In terms of global popularity, within the certain hour cycle, the number of times that statistical content c is requested by a user, with Popu (c)
The access frequency for content c within the current statistic cycle is represented, the access time in this cycle to content c is represented with R (c)
Number, then the popularity computation of content c is as follows：
It is of the invention by content for the more doubt problem of localized epidemics' degree of ICN contents in terms of localized epidemics' degree
Localized epidemics' degree is defined on inside community structure, proposes that a kind of ICN local content popularities based on corporations determine method.It is local
Popularity can more embody the user interest in corporations, and cache contents are replaced according to localized epidemics' degree, be more beneficial for corporations' inside section
Point cache content tends to reasonable in spatial and temporal distributions.Within the certain hour cycle, statistical content c is in a corporations i by user
The number of times of request, uses PopuiC () represents the access frequency for content c within the current statistic cycle, use RiC () represents this week
To the access times of content c in phase, then the popularity computation of content c is as follows：
The present invention proposes ICN (the information centre's nets based on network community characteristic under a kind of SDN (software defined network) environment
Network) two step caching mechanisms.ICN caches in a node in the network content object by data transmission procedure, reaches reduction
Other users ask the propagation delay time of the data, but existing cache node selection mechanism has homogeneity and invalid cache etc.
Weak point.To alleviate above mentioned problem, the advantage of ICN caching mechanisms is preferably played, patent of the present invention is by analyzing ICN networks
Community structure, the corporations characteristic according to ICN selects rational nodal cache content object, not only improves cache contents in network
Variation, but also reduce the probability of invalid cache, specifically include：One is the compress technique analysis that length is described based on information
The community structure characteristic of ICN, and analyze significance level of the node in corporations for corporations；Two is the machine by " two steps caching "
Reasonably be buffered in content object optimal in each corporation by system, global popularity based on content object and local popularity
On node.The present invention provides a kind of effective approach for the further optimization of ICN caching mechanisms.
Brief description of the drawings
Fig. 1 is the schematic flow sheet that ICN bis- step caching method of the present invention based on corporations is implemented.
Specific embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be described in detail, but not as a limitation of the invention.
A kind of reference picture 1, step caching methods of ICN bis- based on corporations of the embodiment of the present invention, mainly includes the following steps that：
The first step, SDN controllers describe the community structure in compresses in length technology identification ICN networks based on information, to ICN
Network carries out corporations' division；
Second step, the node corporations importance degree for calculating each node；
3rd step, SDN controllers are based on the status information that openflow agreements collect the node in each corporations, state letter
Breath includes residual memory space, memory capacity, node corporations importance degree and content popularit etc.；
4th step, the step cache priority level of the node of each corporations of calculating；
5th step, user initiate interest request, to network request data content interested；
6th step, ICN interchangers are responsible for routeing and searching for the interest bag data of user；
7th step, SDN controllers calculate new cache information according to the popularity for recalculating, and formulate two steps caching plan
Slightly, and two step cache policies are issued to ICN interchangers；
The rule that 8th step, each node are issued according to SDN controllers, performs two step cache policies.
In 6th step, when content object is asked by the node in network for the first time, SDN controllers issue flow table, will
Content object is drained into the step cache priority level highest node of each corporations one, and by the specified nodal cache content.In described
Hold object drained into can be judged during each corporations one steps is cached step caching whether time-out, continue if having not timed out
Wait time-out.During the content object is drained into the step caching of each corporations one, when temporary storage time reaches period demand T
When, SDN controllers recalculate the global popularity and local popularity of each temporary content, and calculate each content object accordingly
Two step cache locations, to realize the rationalization of cache contents spatial distribution.
Corporations' partition problem that compresses in length technology solves ICN networks is described using based on information in the first step.With road
It is node by device/interchanger, complex network is built with the side that is physically connected as between them, is with mixed-media network modules mixed-media degree formula (1)
Object function, optimized algorithm splits the network into different corporations：
Wherein NcThe number of corporations in network is represented, M represents the sum connected in network, mcBetween expression corporations c interior nodes
Connection number, dcRepresent all node number of degrees sums in corporations c.
In the second step, node corporations importance degree refers to the importance degree in node corporations where it.It is defined as follows：
Wherein, c is the corporations' number in network, viRepresent with the router in network as node, the thing between router
Reason link is the ith feature vector of the adjacency matrix that side builds, vikRepresent characteristic vector viIn k-th element.
In 4th step, in the initial period that content object is produced, its popularity (including global popularity and local flow
Row degree) more difficult calculating, and it is inaccurate.Therefore, patent of the present invention proposes that two step caching mechanisms are inaccurate to solve popularity computation
Derivative problem.First, according to corporations' interior joint status information (such as buffer memory capacity, utilization rate and node corporations importance degree)
The priority of a step cache contents object is calculated, when content object is produced and is asked by the node in network, the content object
Temporary cache is in step cache priority level highest node in corporations；Secondly, certain is reached in content object is temporarily stored in corporations
During one given period of time T, SDN controllers are calculated the request situation of the content object according to the whole network and each corporations' node
Global popularity and local popularity, and the two step cache locations to content object are recalculated accordingly.Increasing by two steps caching can
More they tend to rationalize in cache location and temporal distribution with the content object in allowing a step to cache.Node k's once delays
Deposit priority SkIt is defined as：
In terms of global popularity, within the certain hour cycle, the number of times that statistical content c is requested by a user, with Popu (c)
The access frequency for content c within the current statistic cycle is represented, the access time in this cycle to content c is represented with R (c)
Number, then the popularity computation of content c is as follows：
It is of the invention by content for the more doubt problem of localized epidemics' degree of ICN contents in terms of localized epidemics' degree
Localized epidemics' degree is defined on inside community structure, proposes that a kind of ICN local content popularities based on corporations determine method.It is local
Popularity can more embody the user interest in corporations, and cache contents are replaced according to localized epidemics' degree, be more beneficial for corporations' inside section
Point cache content tends to reasonable in spatial and temporal distributions.Within the certain hour cycle, statistical content c is in a corporations i by user
The number of times of request, uses PopuiC () represents the access frequency for content c within the current statistic cycle, use RiC () represents this week
To the access times of content c in phase, then the popularity computation of content c is as follows：
The present invention proposes ICN (the information centre's nets based on network community characteristic under a kind of SDN (software defined network) environment
Network) two step caching mechanisms.ICN caches in a node in the network content object by data transmission procedure, reaches reduction
Other users ask the propagation delay time of the data, but existing cache node selection mechanism has homogeneity and invalid cache etc.
Weak point.To alleviate above mentioned problem, the advantage of ICN caching mechanisms is preferably played, patent of the present invention is by analyzing ICN networks
Community structure, the corporations characteristic according to ICN selects rational nodal cache content object, not only improves cache contents in network
Variation, but also reduce the probability of invalid cache, specifically include：One is the compress technique analysis that length is described based on information
The community structure characteristic of ICN, and analyze significance level of the node in corporations for corporations；Two is the machine by " two steps caching "
Reasonably be buffered in content object optimal in each corporation by system, global popularity based on content object and local popularity
On node.The present invention provides a kind of effective approach for the further optimization of ICN caching mechanisms.
Below the present invention is described in detail, but it will be apparent that those skilled in the art can carry out various changing
Become and improve, without departing from the scope of the present invention that appended claims are limited.
Claims (5)
1. a kind of step caching methods of ICN bis- based on corporations, it is characterised in that mainly include the following steps that：
The first step, SDN controllers describe the community structure in compresses in length technology identification ICN networks based on information, to ICN networks
Carry out corporations' division；
Second step, the node corporations importance degree for calculating each node；
3rd step, SDN controllers are based on the status information that openflow agreements collect the node in each corporations；
4th step, the step cache priority level of the node of each corporations of calculating；
5th step, user initiate interest request, to network request data content interested；
6th step, ICN interchangers are responsible for routeing and searching for the interest bag data of user；
7th step, SDN controllers calculate new cache information, formulate two step cache policies, and issue two steps to ICN interchangers and delay
Deposit strategy；
The rule that 8th step, each node are issued according to SDN controllers, performs two step cache policies.
2. a kind of step caching methods of ICN bis- based on corporations according to claim 1, it is characterised in that the 3rd step
In status information include residual memory space, memory capacity, node corporations importance degree and content popularit.
3. a kind of step caching methods of ICN bis- based on corporations according to claim 1, it is characterised in that the 6th step
In, when content object is asked by the node in network for the first time, SDN controllers issue flow table, and content object is drained into each society
In group's one step cache priority level highest node, and by the specified nodal cache content.
4. a kind of step caching methods of ICN bis- based on corporations according to claim 3, it is characterised in that the content pair
Step caching can be judged during as being drained into the step caching of each corporations one whether overtime, be continued waiting for if having not timed out
Time-out.
5. a kind of step caching methods of ICN bis- based on corporations according to claim 3, it is characterised in that the content pair
During as being drained into the step caching of each corporations one, when temporary storage time reaches period demand T, SDN controllers are recalculated
The global popularity of each temporary content and local popularity, and two step cache locations of each content object are calculated accordingly, to realize
The rationalization of cache contents spatial distribution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611094420.6A CN106790421B (en) | 2016-12-01 | 2016-12-01 | ICN two-step caching method based on community |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611094420.6A CN106790421B (en) | 2016-12-01 | 2016-12-01 | ICN two-step caching method based on community |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106790421A true CN106790421A (en) | 2017-05-31 |
| CN106790421B CN106790421B (en) | 2020-11-24 |
Family
ID=58884343
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611094420.6A Active CN106790421B (en) | 2016-12-01 | 2016-12-01 | ICN two-step caching method based on community |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106790421B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108173965A (en) * | 2018-01-22 | 2018-06-15 | 广东技术师范学院 | The ICN caching methods that corporations perceive |
| CN108183938A (en) * | 2017-12-20 | 2018-06-19 | 广东技术师范学院 | A kind of ICN caching methods and system based on correlation network fragment |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103581019A (en) * | 2013-10-10 | 2014-02-12 | 北京交通大学 | Information center network mobility management method based on content popularity |
| CN103634231A (en) * | 2013-12-02 | 2014-03-12 | 江苏大学 | Content popularity-based CCN cache partition and substitution method |
| CN103905332A (en) * | 2012-12-31 | 2014-07-02 | 华为技术有限公司 | Method and device for determining caching strategy |
| CN103905538A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Neighbor cooperation cache replacement method in content center network |
| CN103905539A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Optimal cache storing method based on popularity of content in content center network |
| CN103905545A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Reinforced LRU cache replacement method in content-centric network |
| US20150006621A1 (en) * | 2013-07-01 | 2015-01-01 | Futurewei Technologies, Inc. | Adaptive Video Streaming for Information Centric Networks |
| CN104821961A (en) * | 2015-04-16 | 2015-08-05 | 广东技术师范学院 | ICN cache strategy based on node community importance |
| CN105635319A (en) * | 2016-03-03 | 2016-06-01 | 北京邮电大学 | Data caching method and device |
| CN105791397A (en) * | 2016-02-26 | 2016-07-20 | 广东技术师范学院 | Caching method of ICN (Information-Centric Networking) based on SDN |
-
2016
- 2016-12-01 CN CN201611094420.6A patent/CN106790421B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103905332A (en) * | 2012-12-31 | 2014-07-02 | 华为技术有限公司 | Method and device for determining caching strategy |
| US20150006621A1 (en) * | 2013-07-01 | 2015-01-01 | Futurewei Technologies, Inc. | Adaptive Video Streaming for Information Centric Networks |
| CN103581019A (en) * | 2013-10-10 | 2014-02-12 | 北京交通大学 | Information center network mobility management method based on content popularity |
| CN103634231A (en) * | 2013-12-02 | 2014-03-12 | 江苏大学 | Content popularity-based CCN cache partition and substitution method |
| CN103905538A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Neighbor cooperation cache replacement method in content center network |
| CN103905539A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Optimal cache storing method based on popularity of content in content center network |
| CN103905545A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Reinforced LRU cache replacement method in content-centric network |
| CN104821961A (en) * | 2015-04-16 | 2015-08-05 | 广东技术师范学院 | ICN cache strategy based on node community importance |
| CN105791397A (en) * | 2016-02-26 | 2016-07-20 | 广东技术师范学院 | Caching method of ICN (Information-Centric Networking) based on SDN |
| CN105635319A (en) * | 2016-03-03 | 2016-06-01 | 北京邮电大学 | Data caching method and device |
Non-Patent Citations (3)
| Title |
|---|
| 卜振兴、洪卫军: "遗传算法优化模块度的二分网络社团检测方法", 《中国人民公安大学学报(自然科学版)》 * |
| 王贤刚、姚中华、宋汉辰: "MSNV_基于多层次社团划分的网络结构可视化方法", 《计算机应用》 * |
| 蔡君、余顺争: "一种有效提高无标度网络负载容量的管理策略", 《物理学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108183938A (en) * | 2017-12-20 | 2018-06-19 | 广东技术师范学院 | A kind of ICN caching methods and system based on correlation network fragment |
| CN108173965A (en) * | 2018-01-22 | 2018-06-15 | 广东技术师范学院 | The ICN caching methods that corporations perceive |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106790421B (en) | 2020-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tang et al. | The role of cloud computing in content-centric mobile networking | |
| CN107819662B (en) | A kind of service function chain real-time migration method calculating network applied to cloud and mist | |
| CN106331083B (en) | A kind of heterogeneous network selection method considering content distribution energy consumption | |
| CN103338252B (en) | Realizing method of distributed database concurrence storage virtual request mechanism | |
| CN108174397A (en) | A kind of multiple gateway Synergistic method of task-driven | |
| Sinky et al. | Responsive content-centric delivery in large urban communication networks: A LinkNYC use-case | |
| CN108449269A (en) | Data center network load-balancing method based on SDN | |
| Ding et al. | Orchestrating data as a services-based computing and communication model for information-centric Internet of Things | |
| CN107105043A (en) | A kind of content center network caching method based on software defined network | |
| Kang et al. | Application of adaptive load balancing algorithm based on minimum traffic in cloud computing architecture | |
| Zhang et al. | A hybrid ICN cache coordination scheme based on role division between cache nodes | |
| CN106790421A (en) | A kind of step caching methods of ICN bis- based on corporations | |
| CN112148381A (en) | Software definition-based edge computing priority unloading decision method and system | |
| CN103747509B (en) | Network energy minimal overhead method | |
| CN107835130A (en) | A kind of flow allocation method and device | |
| Reshadinezhad et al. | An efficient adaptive cache management scheme for named data networks | |
| Kottursamy et al. | Optimized D-RAN aware data retrieval for 5G information centric networks | |
| Xu et al. | An adaptive flow table adjustment algorithm for SDN | |
| CN108183867A (en) | Information centre's network node buffer replacing method | |
| CN108093056A (en) | Information centre's wireless network virtualization nodes buffer replacing method | |
| Jiang et al. | A robust energy-efficient routing algorithm to cloud computing networks for learning | |
| CN106612298B (en) | A kind of content distribution method and system based on large-scale network node | |
| CN1649326A (en) | Front end system constructing method of multiple distributor of colony server | |
| CN107302571A (en) | Information centre's network route and buffer memory management method based on drosophila algorithm | |
| Gao et al. | Probabilistic caching mechanism based on software defined content centric network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 293 No. 510665 Guangdong city of Guangzhou province Tianhe District Zhongshan Shipai Road Applicant after: GUANGDONG POLYTECHNIC NORMAL University Address before: 293 No. 510665 Guangdong city of Guangzhou province Tianhe District Zhongshan Shipai Road Applicant before: GUANGDONG POLYTECHNIC NORMAL University |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |