CN109245932A - A kind of security function service chaining dispositions method - Google Patents
A kind of security function service chaining dispositions method Download PDFInfo
- Publication number
- CN109245932A CN109245932A CN201811101545.6A CN201811101545A CN109245932A CN 109245932 A CN109245932 A CN 109245932A CN 201811101545 A CN201811101545 A CN 201811101545A CN 109245932 A CN109245932 A CN 109245932A
- Authority
- CN
- China
- Prior art keywords
- service chaining
- security function
- resource
- link
- deployment
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of security function service chaining dispositions methods, are related to technical field of network security.The present invention considers the case where physical node can provide a variety of security functions, a kind of improved security function service chaining dispositions method is proposed, based on resource needed for the weight relationship comprehensive assessment service chaining deployment between required computational resource requirements, storage resource demands and network resource requirement.And according to gained service chaining integration requirement size, deployment secure function services chain realizes network cost minimum under the premise of meeting service chaining resource requirement, successful deployment security function.
Description
Technical field
The present invention relates to technical field of network security, and in particular to a kind of security function service chaining dispositions method.
Background technique
With the appearance that the magnanimity Novel Internet such as e-commerce, social networks, instant messaging is applied, at present with TCP/IP
Agreement is that the oriented Internet Architecture of core has been difficult to meet the business demand of rapid growth, needs to break through tradition funnel-shaped rigid
The property network system and closed framework.Under this demand, software defined network (Software Defined Networking,
SDN) technologies such as (Network Function Virtualization, NFV) are virtualized and are come into being with network function, it can be real
The flow deployment that now automates, quick resource pool and on demand dynamic service abilities are provided etc., reached by tight coupling
To reduction hardware device complexity, the purpose of save the cost.Based under SDN/NFV theory framework, how rationally, efficient deployment it is full
The service function chain (Service Function Chain, SFC) of sufficient users on diversity has become academia and industrial circle
One of hot issue of concern.
Based in SDN/NFV theory framework, forwarding isolated characteristic by control, network-control become it is more flexible simultaneously
With more scalability.By carrying out virtualization and logical abstraction to bottom physical network, certainly by SDN controller guidance converting flow
The dynamic Virtual Service node that passes through is, it can be achieved that flexible, convenient, efficient service function, this flow is sequenced through Virtual Service function
The sequence of energy node composition is known as service chaining, as shown in Figure 1.
User oriented security service demand, layout form security service chain and issue.Therefore, it is necessary to select a satisfaction
Security service ability, security function sequence, resource requirement optimal path, the problem be based on service chaining security function deployment
Problem (or being mapping problems), as shown in Figure 2.Wherein, Fig. 2 (a) is a security service chain request, is requested by its function suitable
Sequence is represented by (FW, NAT, IPS).There are the functional requirement that a variety of deployment way can meet security service chain, such as Fig. 2 (b) and
Fig. 2 (c).But it can be seen that second of deployment way in Fig. 2 (c) is substantially better than the first deployment way in Fig. 2 (b).
Therefore, it is necessary to carry out the research of security function service chaining deployment issue, i.e., according to the corresponding peace of security service demand sequence selection
Complete functional set goes forward side by side walking along the street by reducing network cost under the premise of meeting functional requirement, resource requirement to greatest extent, ensureing
Service quality.
In the prior art scheme, the deployment sequence of a plurality of service chaining reached simultaneously is not accounted for mostly, or is ignored
Physical node available function type.Segmentation scheme, which limits physical node, only can provide a certain security function, and only examine
The bandwidth demand between security function is considered, has not considered to realize that security function disposes required computing resource and storage resource.
Therefore, in order to preferably portray the integration requirement of service chaining, the relationship between each demand is described, needs to propose a kind of improved peace
Global function service chaining dispositions method.
Summary of the invention
(1) technical problems to be solved
The technical problem to be solved by the present invention is how to propose a kind of improved security function service chaining dispositions method,
Under the premise of meeting service chaining resource requirement, successful deployment security function, network cost minimum is realized.
(2) technical solution
In order to solve the above-mentioned technical problems, the present invention provides a kind of, security function service chaining dispositions method, including it is following
Step:
Firstly, the service chaining request set of definition while the R service chaining reached request composition is Φ={ Q1,Q2,…,
QR, wherein service chaining requests QrIt is expressed as oriented sequence Qr=(qr,0,qr,1,qr,2,…,qr,h-1,qr,h,qr,h+1,…,qr,H,
qr,H+1), altogether comprising the security function node of H, corresponding H security function, 1≤h≤H,1≤r≤R, wherein
qr,0And qr,H+1Respectively indicate service chaining request QrIngress node and Egress node, qr,h-1It is qr,hPrevious security function section
Point, qr,h+1It is qr,hThe latter security function node；From qr,hTo qr,h+1Demand link be expressed as link (qr,h,qr,h+1),
Corresponding bandwidth demand is expressed as bw (qr,h,qr,h+1)；Define triple (fr,h,cr,h,zr,h) indicateRequired security function
And resource, i.e. fr,hFor qr,hRequired security function, cr,h, and zr,hRespectively qr,hRequired computing resource and storage resource；
Secondly, being pre-processed to service chaining integration requirement, the service chaining request sequence Φ ` after being sorted；
Finally, being disposed to the service chaining request sequence Φ ` after sequence, during deployment, so that deployment result was both full
The arranged in sequence of sufficient security function also meets the bandwidth demand between security function.
Preferably, pretreated step is carried out to service chaining integration requirement specifically:
When service chaining resource request reaches, service chaining integration requirement is pre-processed first, defines W={ w1,
w2,…,wRIndicate the integration requirement of all R service chainings request, wherein wr∈ W is that service chaining requests QrIntegration requirement, then wr
It indicates are as follows:
Wherein, α=[α1,α2,α3] indicate computing resource, the weight of storage resource and Internet resources, and meet α1+α2+α3
=1, C_SUMr、S_SUMr、B_SUMrRespectively indicate service chaining request in all computational resource requirements, storage resource demands and
Bandwidth resources demand； Average computation resource requirement, storage for the request of R service chaining
Resource requirement and bandwidth resources demand, respectively indicate as follows:
According to the resulting service chaining integration requirement size w of calculatingr, service chaining is requested to carry out descending arrangement, is sorted
Service chaining request sequence Φ ` afterwards.
Preferably, the step of service chaining request sequence Φ ` after sequence being disposed specifically:
RightIn security function when being disposed, prioritized deployment bandwidth demand is greater than the network of preset threshold
Link, and the link deployment that bandwidth demand is greater than preset threshold in adjacent locations or is deployed on the same physical node.
Preferably, when disposing to the service chaining request sequence Φ ` after sequence, bandwidth demand is greater than preset threshold
Link deployment is on the same physical node.
Preferably, rightIn security function when being disposed, firstly, according to service chaining Qr=(qr,0,
qr,1,qr,2,…,qr,h-1,qr,h,qr,h+1,…,qr,H,qr,H+1) in bandwidth demand size descending arrange QrIn all links,
Update Qr, successively dispose each of the links link (qr,h,qr,h+1), secondly, in link link (qr,h,qr,h+1) during deployment,
Meet security function node qr,h、qr,h+1Computing resource, on the basis of storage resource and link network resource, as far as possible by two
Node deployment is in adjacent locations, until completing the deployment of all service chainings.
Preferably, in link link (qr,h,qr,h+1) during deployment, meeting security function node qr,h、qr,h+1Meter
On the basis of calculating resource, storage resource and link network resource, by two node deployments on the same physical node.
(3) beneficial effect
The present invention considers the case where physical node can provide a variety of security functions, proposes a kind of improved security function clothes
Business chain dispositions method, it is comprehensive based on the weight relationship between required computational resource requirements, storage resource demands and network resource requirement
Resource needed for closing the deployment of evaluation services chain.And according to gained service chaining integration requirement size, deployment secure function services chain,
Under the premise of meeting service chaining resource requirement, successful deployment security function, network cost minimum is realized.
Detailed description of the invention
Fig. 1 is service chaining example；
Fig. 2 is existing two kinds of security services function chain deployment way schematic diagram；
Fig. 3 is bottom-layer network example topology；
Fig. 4 is that service chaining requests example；
Fig. 5 is flow chart of the method for the present invention.
Specific embodiment
To keep the purpose of the present invention, content and advantage clearer, with reference to the accompanying drawings and examples, to of the invention
Specific embodiment is described in further detail.
It only can provide a certain security function, peace proposed by the present invention different from limiting physical node in existing dispositions method
Global function service chaining dispositions method, it is contemplated that physical node can provide the case where a variety of security functions, which more meets really
Application scenarios.Bottom-layer network topology schematic diagram as shown in Figure 3, bottom-layer network topology GSIt altogether include 15 physical nodes, i.e.,
Physical node set VS={ v1,v2,v3,v4,v5,v6,v7,v8,v9,v10,v11,v12,v13,v14,v15}.Wherein forward node collection
Close TSWith security function node set NSRespectively TS={ v1,v2,v3,v4,v5,v6,v7,v8,v9}、NS={ v10,v11,v12,v13,
v14,v15}.Each security function node supports a variety of security functions of offer, the data in square brackets [] to indicate the security function section
The security function that point is supported, the interior data of round parentheses () in each in Fig. 3 respectively indicate the computing capability and storage energy of the node
Power.For example, security function node v10Computing capability and storage capacity be respectively 20 and 40, can support to realize security function respectively
f3And f4.The bandwidth capacity of digital representation link beside each of the links, "/" left side are upstream bandwidth capacity, and right side is downlink band
Tolerance.For example, link (v1,v3) upstream bandwidth capacity B (v1,v3) and downlink bandwidth capacity B (v3,v1) it is respectively 12Mbps
And 10Mbps, i.e. B (v1,v3)=12Mbps, B (v3,v1)=10Mbps, v1With v3Between hop count hop (v1,v3)=1.
The service chaining request set of definition while the R service chaining reached request composition is Φ={ Q1,Q2,…,QR,
Middle service chaining requestIt is represented by oriented sequence Qr=(qr,0,qr,1,qr,2,…,qr,h-1,
qr,h,qr,h+1,…,qr,H,qr,H+1), altogether comprising H security function nodes, corresponding H security function, 1≤h≤H.Wherein,
qr,0And qr,H+1Respectively indicate service chaining request QrIngress node and Egress node, qr,h-1It is qr,hPrevious security function section
Point, qr,h+1It is qr,hThe latter security function node；From qr,hTo qr,h+1Demand link be expressed as link (qr,h,qr,h+1),
Corresponding bandwidth demand is expressed as bw (qr,h,qr,h+1)；Define triple (fr,h,cr,h,zr,h) indicateRequired security function
And resource, i.e. fr,hFor qr,hRequired security function, cr,h, and zr,hRespectively qr,hRequired computing resource and storage resource is (interior
Deposit demand).Service chaining as shown in Figure 4 requests example, service chaining request set Φ={ Q1,Q2,Q3, wherein service chaining is requested
Q1Ingress node and Egress node be respectively v1And v8, Q13 security functions of demand altogether, are followed successively by f1、f4And f2, wherein f1It is
f4Previous security function demand, f2It is f4The latter security function demand.Q1Middle security function f1The calculating money that need to meet
Source demand and storage resource demands, respectively 3 and 1.From f1To f4Link link (f1,f4) corresponding bandwidth demand bw (f1,
f4)=4Mbps, from f4Function is to f2Link link (the f of function4,f2) corresponding bandwidth demand bw (f4,f2)=3Mbps.It is taking
It is engaged in during chain deployment, the arranged in sequence of security function should be met, also to meet the bandwidth demand between security function.
A kind of improved security function service chaining dispositions method process that this patent is proposed is as shown in Figure 5.Mainly include
The pretreatment of service chaining integration requirement and security service function distributing two parts.
When service chaining resource request reaches, service chaining integration requirement is pre-processed first.Due to what is reached simultaneously
Service chaining demand has differences, and defines W={ w1,w2,…,wRIndicate the integration requirement of all R service chainings request, wherein wr
∈ W is that service chaining requests QrIntegration requirement.Then wrIt indicates are as follows:
Wherein, α=[α1,α2,α3] indicate computing resource, the weight of storage resource and Internet resources, and meet α1+α2+α3
=1, it can be adjusted according to network condition, type of service and user preference.C_SUMr、S_SUMr、B_SUMrRespectively indicate service
All computational resource requirements, storage resource demands and bandwidth resources demand in chain request；For average computation resource requirement, storage resource demands and the band of the request of R service chaining
Wide resource requirement respectively indicates as follows:
According to the resulting service chaining integration requirement size w of calculatingr, service chaining is requested to carry out descending arrangement, defines Φ ` table
Service chaining request sequence after showing sequence, and Φ ` is disposed.Service chaining integration requirement pretreated stream is described by taking Fig. 4 as an example
Journey defines weight α=[α of computational resource requirements, storage resource demands and network resource requirement1,α2,α3]=[0.3,0.3,
0.4], it is computed, service chaining requests Q1,Q2,Q3Integration requirement be respectively w1=0.53, w2=1.01 and w3=1.46.It is then new
Obtained service chaining request sequence Φ `={ Q3,Q2,Q1, service chaining deployment sequence is followed successively by Q3,Q2,Q1。
RightIn security function when being disposed, to avoid resource from becoming bottleneck, reduce deployment secure clothes
Network cost caused by business chain, the biggish network link of prioritized deployment bandwidth demand of the present invention, and bandwidth demand is biggish
Link deployment is in adjacent locations.Firstly, according to service chaining Qr=(qr,0,qr,1,qr,2,…,qr,h-1,qr,h,qr,h+1,…,qr,H,
qr,H+1) in bandwidth demand size descending arrange QrIn all links, update Qr, successively dispose each of the links link (qr,h,
qr,h+1)。
In link link (qr,h,qr,h+1) during deployment, meeting security node qr,h、qr,h+1Computing resource, storage money
On the basis of source and link network resource, as far as possible by two node deployments in adjacent locations, it might even be possible to which consideration is deployed in same
On a physical node.Until completing the deployment of all service chainings.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (6)
1. a kind of security function service chaining dispositions method, which comprises the following steps:
Firstly, the service chaining request set of definition while the R service chaining reached request composition is Φ={ Q1,Q2,…,QR,
Middle service chaining requests QrIt is expressed as oriented sequence Qr=(qr,0,qr,1,qr,2,…,qr,h-1,qr,h,qr,h+1,…,qr,H,qr,H+1), altogether
Comprising H security function nodes, corresponding H security function, 1≤h≤H,1≤r≤R, wherein qr,0And qr,H+1
Respectively indicate service chaining request QrIngress node and Egress node, qr,h-1It is qr,hPrevious security function node, qr,h+1It is
qr,hThe latter security function node；From qr,hTo qr,h+1Demand link be expressed as link (qr,h,qr,h+1), corresponding bandwidth needs
It asks and is expressed as bw (qr,h,qr,h+1)；Define triple (fr,h,cr,h,zr,h) indicateRequired security function and resource, i.e.,
fr,hFor qr,hRequired security function, cr,h, and zr,hRespectively qr,hRequired computing resource and storage resource；
Secondly, being pre-processed to service chaining integration requirement, the service chaining request sequence Φ ` after being sorted；
Finally, being disposed to the service chaining request sequence Φ ` after sequence, during deployment, so that deployment result had both met peace
Full Featured arranged in sequence also meets the bandwidth demand between security function.
2. the method as described in claim 1, which is characterized in that it is specific to carry out pretreated step to service chaining integration requirement
Are as follows:
When service chaining resource request reaches, service chaining integration requirement is pre-processed first, defines W={ w1,w2,…,wR}
Indicate the integration requirement of all R service chaining requests, wherein wr∈ W is that service chaining requests QrIntegration requirement, then wrIt indicates are as follows:
Wherein, α=[α1,α2,α3] indicate computing resource, the weight of storage resource and Internet resources, and meet α1+α2+α3=1,
C_SUMr、S_SUMr、B_SUMrRespectively indicate all computational resource requirements, storage resource demands and the bandwidth in service chaining request
Resource requirement； Average computation resource requirement, storage resource for the request of R service chaining
Demand and bandwidth resources demand, respectively indicate as follows:
According to the resulting service chaining integration requirement size w of calculatingr, service chaining is requested to carry out descending arrangement, the clothes after being sorted
Be engaged in chain request sequence Φ `.
3. the method as described in claim 1, which is characterized in that disposed to the service chaining request sequence Φ ` after sequence
Step specifically:
RightIn security function when being disposed, prioritized deployment bandwidth demand is greater than the lattice chain of preset threshold
Road, and the link deployment that bandwidth demand is greater than preset threshold in adjacent locations or is deployed on the same physical node.
4. method as claimed in claim 3, which is characterized in that when being disposed to the service chaining request sequence Φ ` after sequence,
Bandwidth demand is greater than the link deployment of preset threshold on the same physical node.
5. method as claimed in claim 3, which is characterized in that rightIn security function when being disposed, it is first
First, according to service chaining Qr=(qr,0,qr,1,qr,2,…,qr,h-1,qr,h,qr,h+1,…,qr,H,qr,H+1) in bandwidth demand size
Descending arranges QrIn all links, update Qr, successively dispose each of the links link (qr,h,qr,h+1), secondly, in link link
(qr,h,qr,h+1) during deployment, meeting security function node qr,h、qr,h+1Computing resource, storage resource and link
On the basis of Internet resources, as far as possible by two node deployments in adjacent locations, until completing the deployment of all service chainings.
6. method as claimed in claim 5, which is characterized in that in link link (qr,h,qr,h+1) during deployment, meeting
Security function node qr,h、qr,h+1Computing resource, on the basis of storage resource and link network resource, by two node deployments
On the same physical node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811101545.6A CN109245932A (en) | 2018-09-20 | 2018-09-20 | A kind of security function service chaining dispositions method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811101545.6A CN109245932A (en) | 2018-09-20 | 2018-09-20 | A kind of security function service chaining dispositions method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109245932A true CN109245932A (en) | 2019-01-18 |
Family
ID=65059817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811101545.6A Pending CN109245932A (en) | 2018-09-20 | 2018-09-20 | A kind of security function service chaining dispositions method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109245932A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110018832A (en) * | 2019-02-20 | 2019-07-16 | 中国人民解放军海军工程大学 | A kind of Radar Software deployment of components strategy based on improvement Dynamic Programming |
| CN111800291A (en) * | 2020-05-27 | 2020-10-20 | 北京邮电大学 | Service function chain deployment method and device |
| CN112148496A (en) * | 2020-10-12 | 2020-12-29 | 北京计算机技术及应用研究所 | Energy efficiency management method and device for computing storage resources of super-fusion virtual machine and electronic equipment |
| CN113507411A (en) * | 2021-06-10 | 2021-10-15 | 中国联合网络通信集团有限公司 | Path selection method, device, equipment and storage medium |
| CN113839864A (en) * | 2020-06-23 | 2021-12-24 | 中兴通讯股份有限公司 | Network deployment method, device, system and storage medium of autonomous domain system AS |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395501A (en) * | 2017-08-29 | 2017-11-24 | 电子科技大学 | A kind of cross-domain dispositions method of network service function chain |
| CN107483286A (en) * | 2017-08-14 | 2017-12-15 | 电子科技大学 | Merge the method with deployment services functional chain under a kind of environment based on cloud and mist |
| CN107682203A (en) * | 2017-10-30 | 2018-02-09 | 北京计算机技术及应用研究所 | A kind of security function dispositions method based on service chaining |
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
-
2018
- 2018-09-20 CN CN201811101545.6A patent/CN109245932A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107483286A (en) * | 2017-08-14 | 2017-12-15 | 电子科技大学 | Merge the method with deployment services functional chain under a kind of environment based on cloud and mist |
| CN107395501A (en) * | 2017-08-29 | 2017-11-24 | 电子科技大学 | A kind of cross-domain dispositions method of network service function chain |
| CN107682203A (en) * | 2017-10-30 | 2018-02-09 | 北京计算机技术及应用研究所 | A kind of security function dispositions method based on service chaining |
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110018832A (en) * | 2019-02-20 | 2019-07-16 | 中国人民解放军海军工程大学 | A kind of Radar Software deployment of components strategy based on improvement Dynamic Programming |
| CN110018832B (en) * | 2019-02-20 | 2022-07-12 | 中国人民解放军海军工程大学 | Radar software component deployment strategy based on improved dynamic programming |
| CN111800291A (en) * | 2020-05-27 | 2020-10-20 | 北京邮电大学 | Service function chain deployment method and device |
| CN113839864A (en) * | 2020-06-23 | 2021-12-24 | 中兴通讯股份有限公司 | Network deployment method, device, system and storage medium of autonomous domain system AS |
| CN112148496A (en) * | 2020-10-12 | 2020-12-29 | 北京计算机技术及应用研究所 | Energy efficiency management method and device for computing storage resources of super-fusion virtual machine and electronic equipment |
| CN112148496B (en) * | 2020-10-12 | 2023-09-26 | 北京计算机技术及应用研究所 | Energy efficiency management method and device for computing storage resources of super-fusion virtual machine and electronic equipment |
| CN113507411A (en) * | 2021-06-10 | 2021-10-15 | 中国联合网络通信集团有限公司 | Path selection method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109245932A (en) | A kind of security function service chaining dispositions method | |
| Shetiya et al. | Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks | |
| US6519254B1 (en) | RSVP-based tunnel protocol providing integrated services | |
| Liu et al. | Delay-optimized video traffic routing in software-defined interdatacenter networks | |
| CN104168191B (en) | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network | |
| US9197544B2 (en) | Comprehensive multipath routing for congestion and quality-of-service in communication networks | |
| Zhang et al. | Toward concurrent video multicast orchestration for caching-assisted mobile networks | |
| CN104734991B (en) | A kind of end-to-end time delay towards industrial backhaul network ensures transmission dispatching method | |
| KR20160108500A (en) | System and method for a software defined protocol network node | |
| Feng et al. | Enabling efficient service function chains at terrestrial-satellite hybrid cloud networks | |
| CN108881028A (en) | The SDN network resource regulating method of application perception is realized based on deep learning | |
| CN106537824A (en) | Method and apparatus for reducing response time in information-centric networks | |
| CN107124303A (en) | The service chaining optimization method of low transmission time delay | |
| Nouruzi et al. | Online service provisioning in NFV-enabled networks using deep reinforcement learning | |
| CN106992944A (en) | A kind of method for mapping resource in wireless dummy network | |
| Jahromi et al. | NFV and SDN-based cost-efficient and agile value-added video services provisioning in content delivery networks | |
| Liu et al. | Q-learning based content placement method for dynamic cloud content delivery networks | |
| Nacakli et al. | Controlling P2P-CDN live streaming services at SDN-enabled multi-access edge datacenters | |
| Wang et al. | Edge-based traffic engineering for OSPF networks | |
| Shirmarz et al. | A novel flow routing algorithm based on non-dominated ranking and crowd distance sorting to improve the performance in SDN | |
| Jin et al. | Utility max–min fair resource allocation for communication networks with multipath routing | |
| Cheng et al. | Application-aware routing scheme for sdn-based cloud datacenters | |
| Kassir et al. | Service placement for real-time applications: Rate-adaptation and load-balancing at the network edge | |
| Huang et al. | A proportional fairness scheduling for wireless sensor networks | |
| Atzori et al. | A network-oriented survey and open issues in cloud computing |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190118 |
|
| RJ01 | Rejection of invention patent application after publication |