CN108809829A - A kind of SDN rules dispositions method - Google Patents
A kind of SDN rules dispositions method Download PDFInfo
- Publication number
- CN108809829A CN108809829A CN201810613458.2A CN201810613458A CN108809829A CN 108809829 A CN108809829 A CN 108809829A CN 201810613458 A CN201810613458 A CN 201810613458A CN 108809829 A CN108809829 A CN 108809829A
- Authority
- CN
- China
- Prior art keywords
- user
- interchanger
- rule
- controller
- flows
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/742—Route cache; Operation thereof
Abstract
The present invention relates to a kind of SDN rules dispositions methods, belong to technical field of communication network.It is optimization aim that this method, which models user's steaming transfer overall delay, and implementation rule caches deployment strategy.This method includes：S1：Model user's traffic identifier；S2：Modeling user flows to the route jumping figure of destination node；S3：It models user and flows link selection variable；S4：Model user's steaming transfer overall delay；S5：Model exchanger capacity limitation；S6：It is minimized based on user's steaming transfer overall delay, determines rule cache deployment strategy.Method provided by the invention can meet the needs of user policy caching with the service quality of effective guarantee user, and it is optimal to reach Route Selection, realizes that user's steaming transfer overall delay minimizes.
Description
Technical field
The invention belongs to technical field of communication network, are related to a kind of SDN rules dispositions method.
Background technology
Software defined network (Software-DefinedNetworking, SDN) from data plane it is decoupling go out network
Control logic, being introduced into one or more controllers in a manner of logical centralization to the data in data plane in control plane
Forwarding unit (router and interchanger) carries out unified control and management.
In SDN, each network flow is with one group of stream process rule, and if data packet forwards, deletion and modification etc. are associated.
Regular, the data transfer equipment in network, as interchanger can cache dependency rule in its flow table according to the processing in flow path.
If the forward rule of uncached certain data flows in the flow table of interchanger, needs to send and build stream request to controller, by controller
It determines forwarding data flow path, and issuees a notice to associated switch.Due to the control plane between SDN controllers and interchanger
Time delay is longer, leads to data stream transmitting limited performance.For this problem, number can be promoted by optimization design rule cache mechanism
According to steaming transfer performance.
Have related article to conduct a research for SDN rule cache problems, such as propose a kind of based on caching cost minimization
Regular Deployment Algorithm；For rule cache content problems, has article and proposes the regular pre-cache algorithm based on deep learning,
But existing less regular deployment issue of the consideration based on time delay optimization of research.
In conclusion how by optimization design rule deployment strategy in SDN, realizing that network delay minimizes becomes urgently
It solves the problems, such as.
Invention content
In view of this, the purpose of the present invention is to provide a kind of SDN rules dispositions methods, in the method, for one
The SDN scenes of controller and multiple switch composition, if having cached certain rules according to the popularity of stream in each interchanger,
To carry out respective handling to reaching to flow, if not finding respective rule in interchanger, being according to related algorithm by controller should
One routing rule of stream calculation, and by all interchangers of rule cache on the path, model user's steaming transfer overall delay
For optimization aim, implementation rule caches deployment strategy.
In order to achieve the above objectives, the present invention provides the following technical solutions：
A kind of SDN rules dispositions method, this method are：For the SDN scenes that a controller and multiple switch form,
Assuming that certain rule is cached according to the popularity of stream in each interchanger, to carry out respective handling to reaching to flow；If handing over
Corresponding forward rule is not stored in changing planes, then routing rule is calculated according to related algorithm by controller, and cached to the road
In all interchangers on diameter, modeling user's steaming transfer overall delay is optimization aim, and implementation rule caches deployment strategy；This method
The specific steps are：
S1：Model user's traffic identifier；
S2：Modeling user flows to the route jumping figure of destination node；
S3：It models user and flows link selection variable；
S4：Model user's steaming transfer overall delay；
S5：Model exchanger capacity limitation；
S6：It is minimized based on user's steaming transfer overall delay, determines rule cache deployment strategy.
Further, the step S1 is specially：Enable Uf={ f1,...,fMIndicate that the user's adfluxion for reaching interchanger is closed,
In, fiIt indicates i-th of user's stream, enables SiF is flowed for useriData volume size, 1≤i≤F, F be user's flow amount.
Further, the step S2 is specially：Certain rules, user have been cached according to the popularity of stream in each interchanger
Flow fiAccording to the rule selection next-hop node cached, V is enabledjIndicate that j-th of interchanger, 1≤j≤N, N are the number of interchanger
Mesh；M is enabled to indicate that user flows fiM jump, 1≤m≤Mi, MiF is flowed for useriTotal hop count, δi.m∈ { 0,1 } indicates that user flows fi
Select node identification, δi,m=1 indicates that user flows fiThe transmission of m hop link source nodes build stream request to controller, otherwise, δi,m
=0.
Further, the step S3 is specially：Enable Ej,kIndicate interchanger VjWith interchanger VkBetween link, 1≤j, k≤
N,j≠k；It enablesIndicate that user flows fiLink selection mark,Indicate that user flows fiM jump selection chain
Road Ej,kCarry out data transmission, otherwise,
Further, in step s 4, modeling user's overall transmission delay D is the sum of all user's steaming transfer time delays, i.e.,Wherein,Indicate that user flows fiCarry out corresponding propagation delay time when data forwarding；It indicates by exchanging
Machine builds stream request message to controller transmission, and controller is that user flows fiDetermine the corresponding propagation delay time of forward rule；
User's stream directly matches the corresponding propagation delay time of caching rule by interchanger
Wherein,Indicate that user flows fiIn link Ej,kOn propagation delay time,Indicate that user flows fiIn interchanger VjThe queuing delay at place；
The user flows fiIn link Ej,kOn the calculation formula of propagation delay time beαi,j,k> 0,
In, αi,j,k∈ { 0,1 } indicates that user flows fiThe link E distributedj,kTransfer resource mark, Tj,kFor link Ej,kTransmission speed
Rate；
The user flows fiIn interchanger VjThe calculation formula of the queuing delay at place is：If user's stream process at interchanger
M/M/1 queuing models are followed, according to formulaIt calculates user and flows fiIn interchanger VjThe queuing delay at place,
Wherein, μjAnd λjInterchanger V is indicated respectivelyjThe service rate and arrival rate at place,Indicate interchanger VjF is flowed for useriInstitute
Allocation processing resource identification；
If user's stream does not find matching forward rule in interchanger, which carries out with controller
Interaction, controller determine the transmission path of user's stream, and by all interchangers of rule cache on the path, therefore user flows
fiDistribute caching rule corresponding propagation delay time by controllerWherein, DcqTable
Show the queuing delay for building stream request at controller, DcpIndicate that controller calculates and issue processing delay needed for rule,It indicates
Controller issues rule to propagation delay time needed for each interchanger on selected path；
The calculation formula for building queuing delay of the stream request at controller is：If building stream request at SDN controllers
Processing follows M/M/1 queuing models, according to formulaThe queuing delay for building stream request at controller is calculated,
In, μcAnd λcThe service rate at controller and arrival rate are indicated respectively；
The user flows fiCaching rule is assigned at controller, the computational methods of required processing delay areWherein, SoTo build stream request data package size, CaDevice computing capability in order to control；
The user flows fiThe calculation formula of propagation delay time between interchanger and controller is
Wherein,Tc,jDevice and interchanger V in order to controljBetween
Transmission rate.
Further, the step S5 is specially：Capacity limit condition is modeled asCjFor
Interchanger VjRule cache size.
Further, under the restrictive condition for meeting rule cache and interchanger internal capacity, using minimizing delay as target,
Optimize SDN network rule dispositions method, i.e.,
The beneficial effects of the present invention are：The present invention it is slow can to meet user policy with the service quality of effective guarantee user
The demand deposited, it is optimal to reach Route Selection, realizes that user's steaming transfer overall delay minimizes.
Description of the drawings
In order to keep the purpose of the present invention, technical solution and advantageous effect clearer, the present invention provides following attached drawing and carries out
Explanation：
Fig. 1 is the network scenarios schematic diagram for supporting networking rule deployment；
Fig. 2 is the flow diagram of the method for the invention.
Specific implementation mode
Below in conjunction with attached drawing, the preferred embodiment of the present invention is described in detail.
Fig. 1 is the network scenarios schematic diagram for supporting networking rule deployment, as shown, a controller and multiple exchanges
The SDN scenes of machine composition, if having cached certain rules according to the popularity of stream in each interchanger, to carry out phase to reaching to flow
It should handle, if not finding respective rule in interchanger, be advised for one routing of the stream calculation according to related algorithm by controller
Then, and by all interchangers of rule cache on the path, modeling user's steaming transfer overall delay is optimization aim, realizes rule
Then cache deployment strategy.
Fig. 2 is the flow diagram of the method for the invention, as shown, the method for the invention specifically includes following step
Suddenly：
A kind of SDN rules dispositions method, this method are：For the SDN scenes that a controller and multiple switch form,
Assuming that certain rules have been cached according to the popularity of stream in each interchanger, so as to carry out respective handling to reaching to flow.If
Corresponding forward rule is not stored in interchanger, then routing rule is calculated according to related algorithm by controller, and cached to this
In all interchangers on path, modeling user's steaming transfer overall delay is optimization aim, and implementation rule caches deployment strategy；The party
Method the specific steps are：
1) user's traffic identifier is modeled
User's traffic identifier is modeled, specially：Enable Uf={ f1,...,fMIndicate that the user's adfluxion for reaching interchanger is closed,
In, fiIt indicates i-th of user's stream, enables SiF is flowed for useriData volume size, 1≤i≤F, F be user's flow amount.
2) modeling user flows to the route jumping figure of destination node
Modeling user flows to the route jumping figure of destination node, specially：It is cached according to the popularity of stream in each interchanger
Certain rules, user flow fiAccording to the rule selection next-hop node cached, V is enabledjIndicate j-th of interchanger, 1≤j≤N,
N is the number of interchanger；M is enabled to indicate that user flows fiM jump, 1≤m≤Mi, MiF is flowed for useriTotal hop count, δi.m∈{0,
1 } indicate that user flows fiSelect node identification, δi,m=1 indicates that user flows fiM hop link source nodes transmission build stream request to control
Device processed, otherwise, δi,m=0.
3) modeling user flows link selection variable
It models user and flows link selection variable, specially：Enable Ej,kIndicate interchanger VjWith interchanger VkBetween link, 1
≤j,k≤N,j≠k；It enablesIndicate that user flows fiLink selection mark,Indicate that user flows fiM
Jump selection link Ej,kCarry out data transmission, otherwise,
4) user's steaming transfer overall delay is modeled
It is the sum of all user's steaming transfer time delays to model user's steaming transfer overall delay D, i.e.,Wherein,Indicate that user flows fiCarry out corresponding propagation delay time when data forwarding；Indicate that building stream to controller transmission from interchanger asks
It is that user flows f to ask message, controlleriDetermine the corresponding propagation delay time of forward rule.
According to formulaIt calculates user's stream and caching is directly matched by interchanger
The corresponding propagation delay time of rule, whereinIndicate that user flows fiIn link Ej,kOn propagation delay time,Indicate that user flows fi
In interchanger VjThe queuing delay at place.According to formulaαi,j,k> 0 calculates the user and flows fiIn link Ej,k
On propagation delay time, wherein αi,j,k∈ { 0,1 } indicates that user flows fiThe link E distributedj,kTransfer resource mark, Tj,kFor
Link Ej,kTransmission rate.According to formulaIt calculates user and flows fiIn interchanger VjThe queuing delay at place,
Wherein, μjAnd λjInterchanger V is indicated respectivelyjThe service rate and arrival rate at place,Indicate interchanger VjF is flowed for useriInstitute
Allocation processing resource identification.
If user's stream does not find matching forward rule in interchanger, which carries out with controller
Interaction, controller determine the transmission path of user's stream, and by all interchangers of rule cache on the path, therefore user flows
fiDistribute caching rule corresponding propagation delay time by controllerWherein, DcqTable
Show the queuing delay for building stream request at controller, DcpIndicate that controller calculates and issue processing delay needed for rule,It indicates
Controller issues rule to propagation delay time needed for each interchanger on selected path.According to formulaCalculating is built stream and is asked
Seek the queuing delay at controller, wherein μcAnd λcThe service rate at controller and arrival rate are indicated respectively.User's stream
fiCaching rule is assigned at controller, the computational methods of required processing delay areWherein, SoIt is asked to build stream
Ask data package size, CaDevice computing capability in order to control.According to formulaCalculate institute
It states user and flows fiPropagation delay time between interchanger and controller, whereinTc,jDevice and interchanger V in order to controlj
Between transmission rate.
5) modeling exchanger capacity limitation
Exchanger capacity limitation is modeled, specially：Capacity limit condition is modeled asCj
For interchanger VjRule cache size.
6) it is based on user's steaming transfer overall delay to minimize, determines rule cache deployment strategy
It is minimized based on user's steaming transfer overall delay, determines rule cache deployment strategy, specially：Meeting rule cache
And under the restrictive condition of interchanger internal capacity, using minimizing delay as target, optimize SDN network rule dispositions method, i.e.,
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (7)
1. a kind of SDN rules dispositions method, it is characterised in that：This method is：It is formed for a controller and multiple switch
SDN scenes, it is assumed that certain rule is cached according to the popularity of stream in each interchanger, to reach stream carry out it is corresponding
Processing；If not storing corresponding forward rule in interchanger, routing rule is calculated according to related algorithm by controller, and delayed
It deposits in all interchangers to the path, modeling user's steaming transfer overall delay is optimization aim, implementation rule caching deployment plan
Slightly；This method the specific steps are：
S1：Model user's traffic identifier；
S2：Modeling user flows to the route jumping figure of destination node；
S3：It models user and flows link selection variable；
S4：Model user's steaming transfer overall delay；
S5：Model exchanger capacity limitation；
S6：It is minimized based on user's steaming transfer overall delay, determines rule cache deployment strategy.
2. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：The step S1 is specially：Enable Uf
={ f1,...,fMIndicate that the user's adfluxion for reaching interchanger is closed, wherein fiIt indicates i-th of user's stream, enables SiF is flowed for useri's
Data volume size, 1≤i≤F, F are user's flow amount.
3. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：The step S2 is specially：Each
Certain rules are cached according to the popularity of stream in interchanger, user flows fiNext-hop node is selected according to the rule cached,
Enable VjIndicate that j-th of interchanger, 1≤j≤N, N are the number of interchanger；M is enabled to indicate that user flows fiM jump, 1≤m≤Mi, Mi
F is flowed for useriTotal hop count, δi.m∈ { 0,1 } indicates that user flows fiSelect node identification, δi,m=1 indicates that user flows fiM
The transmission of hop link source node builds stream request to controller, otherwise, δi,m=0.
4. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：The step S3 is specially：It enables
Ej,kIndicate interchanger VjWith interchanger VkBetween link, 1≤j, k≤N, j ≠ k；It enablesIndicate that user flows fiChain
Road selection mark,Indicate that user flows fiM jump selection link Ej,kCarry out data transmission, otherwise,
5. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：In step s 4, the modeling is used
Family overall transmission delay D is the sum of all user's steaming transfer time delays, i.e.,Wherein,Indicate that user flows fiInto
Corresponding propagation delay time when row data forwarding；It indicates to build stream request message from interchanger to controller transmission, controller is to use
Flow f in familyiDetermine the corresponding propagation delay time of forward rule；
User's stream directly matches the corresponding propagation delay time of caching rule by interchanger
Wherein,Indicate that user flows fiIn link Ej,kOn propagation delay time,Indicate that user flows fiIn interchanger VjThe queuing at place
Time delay；
The user flows fiIn link Ej,kOn the calculation formula of propagation delay time beWherein,
αi,j,k∈ { 0,1 } indicates that user flows fiThe link E distributedj,kTransfer resource mark, Tj,kFor link Ej,kTransmission rate；
The user flows fiIn interchanger VjThe calculation formula of the queuing delay at place is：If user's stream process at interchanger follows
M/M/1 queuing models, according to formulaIt calculates user and flows fiIn interchanger VjThe queuing delay at place,
In, μjAnd λjInterchanger V is indicated respectivelyjThe service rate and arrival rate at place,Indicate interchanger VjF is flowed for useriDivide
It is identified with process resource；
If user's stream does not find matching forward rule in interchanger, which is handed over controller
Mutually, controller determines the transmission path of user's stream, and by all interchangers of rule cache on the path, therefore user flows fi
Distribute caching rule corresponding propagation delay time by controllerWherein, DcqTable
Show the queuing delay for building stream request at controller, DcpIndicate that controller calculates and issue processing delay needed for rule,It indicates
Controller issues rule to propagation delay time needed for each interchanger on selected path；
The calculation formula for building queuing delay of the stream request at controller is：If building stream request processing at SDN controllers
M/M/1 queuing models are followed, according to formulaCalculate the queuing delay for building stream request at controller, wherein
μcAnd λcThe service rate at controller and arrival rate are indicated respectively；
The user flows fiCaching rule is assigned at controller, the computational methods of required processing delay areIts
In, SoTo build stream request data package size, CaDevice computing capability in order to control；
The user flows fiThe calculation formula of propagation delay time between interchanger and controller is
Wherein,Tc,jDevice and interchanger V in order to controljBetween
Transmission rate.
6. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：The step S5 is specially：Capacity
Restrictive condition is modeled asCjFor interchanger VjRule cache size.
7. a kind of SDN rules dispositions method according to claim 1, it is characterised in that：The step S6 is specially：Full
Under the restrictive condition of sufficient rule cache and interchanger internal capacity, using minimizing delay as target, optimization SDN network rule deployment
Method, i.e.,
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810613458.2A CN108809829B (en) | 2018-06-14 | 2018-06-14 | SDN rule deployment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810613458.2A CN108809829B (en) | 2018-06-14 | 2018-06-14 | SDN rule deployment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108809829A true CN108809829A (en) | 2018-11-13 |
| CN108809829B CN108809829B (en) | 2020-09-08 |
Family
ID=64085956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810613458.2A Active CN108809829B (en) | 2018-06-14 | 2018-06-14 | SDN rule deployment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108809829B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110380972A (en) * | 2019-07-19 | 2019-10-25 | 重庆邮电大学 | A kind of selection of SDN joint route and rule cache method for spreading defeated cost optimization based on user |
| CN111770515A (en) * | 2020-06-28 | 2020-10-13 | 重庆邮电大学 | SDN controller deployment method based on network cost optimization |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105207912A (en) * | 2015-09-16 | 2015-12-30 | 江苏省未来网络创新研究院 | Method for handling SDN multi-module deployment rule conflicts |
| WO2018067889A1 (en) * | 2016-10-06 | 2018-04-12 | vIPtela Inc. | Method and system for synchronizing policy in a control plane |
| CN108092895A (en) * | 2017-12-26 | 2018-05-29 | 重庆邮电大学 | A kind of software defined network joint route selection and network function dispositions method |
-
2018
- 2018-06-14 CN CN201810613458.2A patent/CN108809829B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105207912A (en) * | 2015-09-16 | 2015-12-30 | 江苏省未来网络创新研究院 | Method for handling SDN multi-module deployment rule conflicts |
| WO2018067889A1 (en) * | 2016-10-06 | 2018-04-12 | vIPtela Inc. | Method and system for synchronizing policy in a control plane |
| CN108092895A (en) * | 2017-12-26 | 2018-05-29 | 重庆邮电大学 | A kind of software defined network joint route selection and network function dispositions method |
Non-Patent Citations (1)
| Title |
|---|
| 贺婧: "基于SDN的信息网络及其高效缓存机制的研究与实现", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110380972A (en) * | 2019-07-19 | 2019-10-25 | 重庆邮电大学 | A kind of selection of SDN joint route and rule cache method for spreading defeated cost optimization based on user |
| CN110380972B (en) * | 2019-07-19 | 2021-08-31 | 重庆邮电大学 | SDN joint routing selection and rule caching method based on user stream transmission cost optimization |
| CN111770515A (en) * | 2020-06-28 | 2020-10-13 | 重庆邮电大学 | SDN controller deployment method based on network cost optimization |
| CN111770515B (en) * | 2020-06-28 | 2022-03-29 | 重庆邮电大学 | SDN controller deployment method based on network cost optimization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108809829B (en) | 2020-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104753797B (en) | A kind of content center network dynamic routing method based on selectivity caching | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN103119900B (en) | Communication system, control appliance, node control method and node control program | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| CN106533733B (en) | The CCN collaboration caching method and device routed based on network cluster dividing and Hash | |
| CN105721600B (en) | A kind of content center network caching method based on complex network measurement | |
| CN102714628A (en) | Communication system, control apparatus, processing rule setting method, packet transmitting method and program | |
| JP6190288B2 (en) | Cache control apparatus, method, and program | |
| CN108366089B (en) | CCN caching method based on content popularity and node importance | |
| WO2017101230A1 (en) | Routing selection method for data centre network and network manager | |
| CN107454019A (en) | Software defined network distribution method of dynamic bandwidth, device, equipment and storage medium | |
| CN106230722A (en) | SDN congestion link method of adjustment based on transfer value | |
| Wu et al. | MBP: A max-benefit probability-based caching strategy in information-centric networking | |
| CN106911516A (en) | A kind of software defined network controller dispositions method | |
| CN108809829A (en) | A kind of SDN rules dispositions method | |
| CN112689163A (en) | Video service transmission system and method based on SDN and in-network cache | |
| CN108965479B (en) | Domain collaborative caching method and device based on content-centric network | |
| CN112399485A (en) | CCN-based new node value and content popularity caching method in 6G | |
| CN108900618A (en) | Content buffering method in a kind of information centre's network virtualization | |
| CN100440867C (en) | Method of real time soft seizing wave length route photo network | |
| CN107959593B (en) | A kind of software defined network mapping method of virtual network | |
| CN105657054B (en) | A kind of content center network caching method based on K mean algorithms | |
| CN108880895A (en) | The selection of SDN joint route and the network function dispositions method of transport overhead optimization are flowed based on user | |
| Kamiyama et al. | Dispersing content over networks in information-centric networking | |
| CN108093056A (en) | Information centre's wireless network virtualization nodes buffer replacing method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |