CN110380972B - SDN joint routing selection and rule caching method based on user stream transmission cost optimization - Google Patents

SDN joint routing selection and rule caching method based on user stream transmission cost optimization Download PDF

Info

Publication number
CN110380972B
CN110380972B CN201910655181.4A CN201910655181A CN110380972B CN 110380972 B CN110380972 B CN 110380972B CN 201910655181 A CN201910655181 A CN 201910655181A CN 110380972 B CN110380972 B CN 110380972B
Authority
CN
China
Prior art keywords
rule
user
energy consumption
routing
modeling
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910655181.4A
Other languages
Chinese (zh)
Other versions
CN110380972A (en
Inventor
柴蓉
袁琼芳
陈前斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201910655181.4A priority Critical patent/CN110380972B/en
Publication of CN110380972A publication Critical patent/CN110380972A/en
Application granted granted Critical
Publication of CN110380972B publication Critical patent/CN110380972B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • 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/124—Shortest path evaluation using a combination of metrics
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to an SDN joint routing selection and rule caching method based on user stream transmission cost optimization, and belongs to the technical field of communication networks. The method comprises the following steps: s1: modeling user flow characteristics; s2: modeling user flow routing selection and rule cache variables; s3: modeling a user stream transmission cost; s4: modeling user flow rule caching overhead; s5: modeling user stream transmission energy consumption; s6: modeling user flow routing selection and rule cache limiting conditions; s7: and determining a joint routing and rule caching strategy based on the minimization of the user stream transmission cost. The invention can ensure the effective transmission and service quality of the user stream, meet the requirement of the user rule cache, and realize the minimization of the transmission cost of the user stream by optimizing and determining the routing selection and the rule cache strategy.

Description

SDN joint routing selection and rule caching method based on user stream transmission cost optimization
Technical Field
The invention belongs to the technical field of communication networks, and relates to an SDN joint routing selection and rule caching method based on user stream transmission cost optimization.
Background
Software-Defined Networking (SDN) is an emerging network architecture and technology that performs unified control and management of data forwarding devices, such as routers and switches, in a data plane in a logically centralized manner by introducing one or more controllers in a control plane.
In SDN, each user flow is associated with a set of flow processing rules, such as rules for packet forwarding, deletion, and modification. The SDN switch may pre-cache certain flow forwarding rules in its Ternary Content Addressable Memory (TCAM). When receiving the user flow, the SDN switch matches the user flow with a flow forwarding rule captured in advance by the SDN switch. If the user flow specific forwarding rule is cached in the TCAM of the switch, the switch correspondingly forwards the user flow, otherwise, the switch sends a flow establishing request message to the SDN controller, the SDN controller determines a flow forwarding strategy according to the global view of the network of the SDN controller, and issues the strategy to the switch related to the flow forwarding path. However, the limited storage space of TCAMs and the diversified service requirements of user flows pose difficulties and challenges to the user flow routing and rule caching mechanisms.
At present, relevant documents develop research aiming at SDN routing and rule caching problems, for example, aiming at a rule caching content problem, an existing article proposes to minimize space occupation of a TCAM flow table under the constraint of Quality of Service (QoS) of a user flow; there is also a document that proposes a joint routing selection and rule caching strategy to minimize link utilization and reduce power consumption. But the existing research rarely considers the SDN joint routing and rule caching problems based on user stream transmission cost optimization.
In summary, how to comprehensively consider characteristics such as user flow service requirements, link capacity, and QoS guarantee in a network environment of an SDN, and implement joint routing selection and rule caching, thereby reducing user flow transmission energy consumption and rule caching overhead, and implementing effective user flow transmission has become an urgent problem to be solved.
Disclosure of Invention
In view of this, the present invention aims to provide an SDN joint routing and rule caching method based on user stream transmission cost optimization, which models user stream transmission cost as an optimization target and implements a user stream joint routing and rule caching strategy.
In order to achieve the purpose, the invention provides the following technical scheme:
in the method, aiming at an SDN scene formed by a controller and a plurality of switches, assuming that the popularity of user flows in a network obeys Zipf distribution, each switch can cache a corresponding flow forwarding rule, if the corresponding forwarding rule is not stored in the switch, the controller calculates the routing rule according to a related algorithm and caches the routing rule into all the switches on the path, modeling the transmission cost of the user flows as an optimization target, and realizing a combined routing and rule caching strategy. The method specifically comprises the following steps:
s1: modeling user flow characteristics;
s2: modeling user flow routing selection and rule cache variables;
s3: modeling a user stream transmission cost;
s4: modeling user flow rule caching overhead;
s5: modeling user stream transmission energy consumption;
s6: modeling user flow routing selection and rule cache limiting conditions;
s7: and determining a joint routing and rule caching strategy based on the minimization of the user stream transmission cost.
Further, in step S1, the modeling of the user flow characteristics specifically includes: let the user flow set F ═ F1,f2,...,fLIn which flL is more than or equal to 1 and less than or equal to L, and L represents the number of user streams; let TlAnd RlRespectively represents flTraffic demand and forwarding rule size; the popularity of user flows in a modeled network obeys a Zipf distribution, i.e. flProbability of arrival of
Figure BDA0002136654370000021
Where β represents a shape parameter of the Zipf distribution.
Further, in step S2, the modeling of the user flow routing and rule cache variables specifically includes: let ViRepresenting the ith switch, i is more than or equal to 1 and less than or equal to N, wherein N is the number of switches, Li,jRepresents ViAnd VjI is more than or equal to 1, j is more than or equal to N, i is not equal to j; let xi,j,lE {0,1} represents flLink selection identity of, x i,j,l1 represents flSelection of Li,jCarrying out data transmission, otherwise, xi,j,l0; let yi,lE {0,1} represents flRule cache identification of y i,l1 represents flSelection of ViRegular caching is carried out, otherwise, yi,l＝0。
Further, in step S3, modeling the user streaming cost specifically includes: the cost of user stream transmission is the sum of the costs of all user streams, i.e.
Figure BDA0002136654370000022
Wherein, ClIs flIs modeled as Cl＝w1Ul+w2ElWherein, UlDenotes flRule cache overhead, ElDenotes flEnergy consumption required for transmission, w1And w2Is a weighting factor.
Further, in step S4, modeling the user flow rule cache overhead specifically includes: f. oflCaching regular overhead U at switchlIs modeled as
Figure BDA0002136654370000031
Where ρ isiRepresents ViUnit cost of the cached data flow rule.
Further, in step S5, the modeling of the user streaming energy consumption specifically includes: f. oflThe energy consumption required by transmission is the sum of the transmission energy consumption of the switch and the processing energy consumption of the controller, namely:
Figure BDA0002136654370000032
wherein the content of the first and second substances,
Figure BDA0002136654370000033
denotes flThe energy consumption of transmission is calculated by the formula
Figure BDA0002136654370000034
Wherein E isi,jIs shown at Li,jEnergy consumption of upper transmission unit bit stream;
Figure BDA0002136654370000035
indicating switch uncached flWhen the rule is corresponding, the switch sends a flow establishing request message to the controller, the controller processes the energy consumption required by the flow establishing request message, and the calculation formula is as follows:
Figure BDA0002136654370000036
wherein λ isiRepresents ViStreaming request message to controllerThe size of the capsule is determined by the size of the capsule,
Figure BDA0002136654370000037
indicating the power consumption required by the controller to process a unit of bit information.
Further, link Li,jEnergy consumption E of unit bit stream up transmissioni,jThe calculation formula of (2) is as follows:
Figure BDA0002136654370000038
wherein the content of the first and second substances,
Figure BDA0002136654370000039
represents ViThe output port stores and sends the energy consumption of the unit bit stream, and the calculation formula is as follows:
Figure BDA00021366543700000310
wherein the content of the first and second substances,
Figure BDA00021366543700000311
represents ViThe power consumption of the port when the egress port reaches the maximum transmission rate,
Figure BDA00021366543700000312
represents ViOut port rate, γrp(. represents) ViConverting the port rate into a weight function of energy consumption;
Figure BDA00021366543700000313
represents VjThe input port receives and stores the energy consumption of the unit bit stream, and the calculation formula is
Figure BDA00021366543700000314
Wherein the content of the first and second substances,
Figure BDA00021366543700000315
represents VjThe power consumption of the port when the ingress port reaches the maximum transmission rate,
Figure BDA00021366543700000316
represents ViIngress port rate;
Figure BDA00021366543700000317
expresses the energy consumption of V processing unit bit stream, and has the calculation formula
Figure BDA00021366543700000318
Wherein the content of the first and second substances,
Figure BDA00021366543700000319
represents VjMatching the power consumption of the unit bit stream,
Figure BDA00021366543700000320
represents VjEnergy consumption to take action after completion of the matching unit bit stream, CjRepresents VjThe buffer capacity of (2).
Further, in step S6, the modeling of the user flow routing and rule cache restriction condition specifically includes: the flow conservation condition at the switch is modeled as:
(1) for any source switch Vi＝Sl，
Figure BDA00021366543700000321
(2) For any relay exchanger Vj≠{Sl,DlIs represented by
Figure BDA00021366543700000322
Wherein Sl、DlRespectively represents flThe source switch and the destination switch;
(3) for any source switch Vj＝Dl，
Figure BDA0002136654370000041
Switch VjThe cache capacity limit condition is modeled as:
Figure BDA0002136654370000042
further, in step S7, determining the joint routing and rule caching policy based on the minimization of the user stream transmission cost specifically includes: under the condition of meeting the restriction conditions of routing selection and rule caching, the routing selection and rule caching strategies are optimized and determined by taking the minimization of the transmission cost of the user stream as the target, namely
Figure BDA0002136654370000043
The invention has the beneficial effects that: the invention can ensure the effective transmission and service quality of the user stream, meet the requirement of the user rule cache, and realize the minimization of the transmission cost of the user stream by optimizing and determining the routing selection and the rule cache strategy.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a schematic diagram of a network scenario supporting network rule caching;
fig. 2 is a schematic flow chart of a method according to an embodiment of the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Referring to fig. 1 to 2, fig. 1 is a schematic diagram of a network scenario supporting network rule caching, as shown in fig. 1, a controller and a plurality of switches exist in the network, the popularity of a user flow in the network obeys Zipf distribution, each switch can cache a corresponding flow forwarding rule, if the corresponding forwarding rule is not stored in the switch, the switch sends a flow establishing request message to the controller, and the controller determines a flow forwarding policy according to a global view of the network and issues the policy to a switch related to a flow forwarding path. Modeling the user stream transmission cost as an optimization target, and realizing combined routing selection and rule caching.
Fig. 2 is a schematic flowchart of a method for SDN joint routing and rule caching based on user stream transmission cost optimization according to this embodiment, and as shown in fig. 2, the method according to this embodiment specifically includes the following steps:
1) modeling user flow characteristics
Let the user flow set F ═ F1,f2,...,fLIn which flL is more than or equal to 1 and less than or equal to L, and L represents the number of user streams; let TlAnd RlRespectively represents flTraffic demand and forwarding rule size; the popularity of user flows in a modeled network obeys a Zipf distribution, i.e. flProbability of arrival of
Figure BDA0002136654370000051
Where β represents a shape parameter of the Zipf distribution.
2) Modeling user flow routing selection and rule caching variables
Let ViRepresenting the ith switch, i is more than or equal to 1 and less than or equal to N, wherein N is the number of switches, Li,jRepresents ViAnd VjI is more than or equal to 1, j is more than or equal to N, i is not equal to j; let xi,j,lE {0,1} represents flLink selection identity of, x i,j,l1 represents flSelection of Li,jCarrying out data transmission, otherwise, xi,j,l0; let yi,lE {0,1} represents flRule cache identification of y i,l1 represents flSelection of ViRegular caching is carried out, otherwise, yi,l＝0。
3) Modeling user streaming costs
The cost of user stream transmission is the sum of the costs of all user streams, i.e.
Figure BDA0002136654370000052
Wherein, ClIs flIs modeled as Cl＝w1Ul+w2ElWherein, UlDenotes flRule cache overhead, ElDenotes flEnergy consumption required for transmission, w1And w2Is a weighting factor.
4) Modeling user flow rule caching overhead
flCaching regular overhead U at switchlIs modeled as
Figure BDA0002136654370000053
Where ρ isiRepresents ViUnit cost of the cached data flow rule.
5) Modeling user streaming energy consumption
flThe energy consumption required by transmission is the sum of the transmission energy consumption of the switch and the processing energy consumption of the controller, namely:
Figure BDA0002136654370000054
wherein the content of the first and second substances,
Figure BDA0002136654370000055
denotes flThe energy consumption of transmission is calculated by the formula
Figure BDA0002136654370000056
Wherein E isi,jIs shown at Li,jThe energy consumption of the upper transmission unit bit stream is calculated by the following formula:
Figure BDA0002136654370000057
wherein the content of the first and second substances,
Figure BDA0002136654370000058
represents ViThe output port stores and sends the energy consumption of the unit bit stream, and the calculation formula is as follows:
Figure BDA0002136654370000061
wherein the content of the first and second substances,
Figure BDA0002136654370000062
represents ViThe power consumption of the port when the egress port reaches the maximum transmission rate,
Figure BDA0002136654370000063
represents ViOut port rate, γrp(. represents) ViConverting the port rate into a weight function of energy consumption;
Figure BDA0002136654370000064
the energy consumption of the unit bit stream received and stored by the Vj input port is represented by the formula
Figure BDA0002136654370000065
Wherein the content of the first and second substances,
Figure BDA0002136654370000066
represents VjThe power consumption of the port when the ingress port reaches the maximum transmission rate,
Figure BDA0002136654370000067
represents ViIngress port rate;
Figure BDA0002136654370000068
represents VjThe energy consumption of unit bit stream is processed by the formula
Figure BDA0002136654370000069
Wherein the content of the first and second substances,
Figure BDA00021366543700000610
represents VjMatching the power consumption of the unit bit stream,
Figure BDA00021366543700000611
represents VjEnergy consumption to take action after completion of the matching unit bit stream, CjRepresents VjThe buffer capacity of (2).
Figure BDA00021366543700000612
Indicating switch uncached flWhen the rule is corresponding, the switch sends a flow establishing request message to the controller, the controller processes the energy consumption required by the flow establishing request message, and the calculation formula is
Figure BDA00021366543700000613
Wherein λ isiRepresents ViThe size of the streaming request message sent to the controller,
Figure BDA00021366543700000614
indicating the power consumption required by the controller to process a unit of bit information.
6) Modeling user flow routing and rule cache constraints
The flow conservation condition at the switch is modeled as:
(1) for any source switch Vi＝Sl，
Figure BDA00021366543700000615
(2) For any relay exchanger Vj≠{Sl,DlIs represented by
Figure BDA00021366543700000616
Wherein Sl、DlRespectively represents flThe source switch and the destination switch;
(3) for any source switch Vj＝Dl，
Figure BDA00021366543700000617
Switch VjThe cache capacity limit condition is modeled as:
Figure BDA00021366543700000618
7) determining a combined routing and rule caching strategy based on the minimization of the user stream transmission cost: under the condition of meeting the restriction conditions of routing selection and rule caching, the routing selection and rule caching strategies are optimized and determined by taking the minimization of the transmission cost of the user stream as the target, namely
Figure BDA00021366543700000619
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.

Claims (7)

1. An SDN joint routing and rule caching method based on user stream transmission cost optimization is characterized by specifically comprising the following steps:
s1: modeling the user flow characteristics specifically comprises the following steps: let the user flow set F ═ F1,f2,...,fLIn which flL is more than or equal to 1 and less than or equal to L, and L represents the number of user streams; let TlAnd RlRespectively represents flTraffic demand and forwarding rule size; the popularity of user flows in a modeled network obeys a Zipf distribution, i.e. flProbability of arrival of
Figure FDA0003151712280000011
WhereinAnd beta represents a shape parameter of the Zipf distribution;
s2: modeling user flow routing selection and rule cache variables;
s3: modeling the user streaming cost specifically comprises the following steps: the cost of user stream transmission is the sum of the costs of all user streams, i.e.
Figure FDA0003151712280000012
Wherein, ClFor the l user stream flIs modeled as Cl＝w1Ul+w2ElWherein, UlDenotes flRule cache overhead, ElDenotes flEnergy consumption required for transmission, w1And w2Is a weight factor;
s4: modeling user flow rule caching overhead;
s5: modeling user stream transmission energy consumption;
s6: modeling user flow routing selection and rule cache limiting conditions;
s7: and determining a joint routing and rule caching strategy based on the minimization of the user stream transmission cost.
2. The SDN joint routing and rule caching method of claim 1, wherein in step S2, modeling user flow routing and rule caching variables specifically comprises: let ViRepresenting the ith switch, i is more than or equal to 1 and less than or equal to N, wherein N is the number of switches, Li,jRepresents ViAnd VjI is more than or equal to 1, j is more than or equal to N, i is not equal to j; let xi,j,lE {0,1} represents flLink selection identity of, xi,j,l1 represents flSelection of Li,jCarrying out data transmission, otherwise, xi,j,l0; let yi,lE {0,1} represents flRule cache identification of yi,l1 represents flSelection of ViRegular caching is carried out, otherwise, yi,l＝0。
3. SDN joint routing and rule caching according to claim 2The method is characterized in that, in step S4, modeling the user flow rule cache overhead specifically includes: f. oflCaching regular overhead U at switchlIs modeled as
Figure FDA0003151712280000013
Where ρ isiRepresents ViUnit cost of the cached data flow rule.
4. The SDN federated routing and rule caching method of claim 3, wherein in step S5, modeling user streaming energy consumption specifically comprises: f. oflThe energy consumption required by transmission is the sum of the transmission energy consumption of the switch and the processing energy consumption of the controller, namely:
Figure FDA0003151712280000021
wherein the content of the first and second substances,
Figure FDA0003151712280000022
denotes flThe energy consumption of transmission is calculated by the formula
Figure FDA0003151712280000023
Wherein E isi,jIs shown at Li,jEnergy consumption of upper transmission unit bit stream;
Figure FDA0003151712280000024
indicating switch uncached flWhen the rule is corresponding, the switch sends a flow establishing request message to the controller, the controller processes the energy consumption required by the flow establishing request message, and the calculation formula is as follows:
Figure FDA0003151712280000025
wherein λ isiRepresents ViThe size of the streaming request message sent to the controller,
Figure FDA0003151712280000026
indicating the power consumption required by the controller to process a unit of bit information.
5. The SDN joint routing and rule caching method of claim 4, wherein a link L isi,jEnergy consumption E of unit bit stream up transmissioni,jThe calculation formula of (2) is as follows:
Figure FDA0003151712280000027
wherein the content of the first and second substances,
Figure FDA0003151712280000028
represents ViThe output port stores and sends the energy consumption of the unit bit stream, and the calculation formula is as follows:
Figure FDA0003151712280000029
wherein the content of the first and second substances,
Figure FDA00031517122800000210
represents ViThe power consumption of the port when the egress port reaches the maximum transmission rate,
Figure FDA00031517122800000211
represents ViOut port rate, γrp(. represents) ViConverting the port rate into a weight function of energy consumption;
Figure FDA00031517122800000212
represents VjThe input port receives and stores the energy consumption of the unit bit stream, and the calculation formula is
Figure FDA00031517122800000213
Wherein the content of the first and second substances,
Figure FDA00031517122800000214
represents VjThe power consumption of the port when the ingress port reaches the maximum transmission rate,
Figure FDA00031517122800000215
represents ViIngress port rate;
Figure FDA00031517122800000216
represents VjThe energy consumption of unit bit stream is processed by the formula
Figure FDA00031517122800000217
Wherein the content of the first and second substances,
Figure FDA00031517122800000218
represents VjMatching the power consumption of the unit bit stream,
Figure FDA00031517122800000219
represents VjEnergy consumption to take action after completion of the matching unit bit stream, CjRepresents VjThe buffer capacity of (2).
6. The SDN combined routing and rule caching method of claim 5, wherein in step S6, modeling user flow routing and rule caching constraints specifically comprises: the flow conservation condition at the switch is modeled as:
(1) for any source switch Vi＝Sl，
Figure FDA00031517122800000220
(2) For any relay exchanger Vj≠{Sl,DlIs represented by
Figure FDA00031517122800000221
Wherein Sl、DlRespectively represents flThe source switch and the destination switch;
(3) for any source switchVj＝Dl，
Figure FDA00031517122800000222
Switch VjThe cache capacity limit condition is modeled as:
Figure FDA0003151712280000031
7. the SDN joint routing and rule caching method of claim 6, wherein in step S7, determining the joint routing and rule caching policy based on minimizing the user flow transmission cost specifically comprises: under the condition of meeting the restriction conditions of routing selection and rule caching, the routing selection and rule caching strategies are optimized and determined by taking the minimization of the transmission cost of the user stream as the target, namely
Figure FDA0003151712280000032
CN201910655181.4A 2019-07-19 2019-07-19 SDN joint routing selection and rule caching method based on user stream transmission cost optimization Active CN110380972B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910655181.4A CN110380972B (en) 2019-07-19 2019-07-19 SDN joint routing selection and rule caching method based on user stream transmission cost optimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910655181.4A CN110380972B (en) 2019-07-19 2019-07-19 SDN joint routing selection and rule caching method based on user stream transmission cost optimization

Publications (2)

Publication Number Publication Date
CN110380972A CN110380972A (en) 2019-10-25
CN110380972B true CN110380972B (en) 2021-08-31

Family

ID=68254292

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910655181.4A Active CN110380972B (en) 2019-07-19 2019-07-19 SDN joint routing selection and rule caching method based on user stream transmission cost optimization

Country Status (1)

Country Link
CN (1) CN110380972B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108092895A (en) * 2017-12-26 2018-05-29 重庆邮电大学 A kind of software defined network joint route selection and network function dispositions method
CN108521375A (en) * 2018-04-17 2018-09-11 中国矿业大学 The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method
CN108809829A (en) * 2018-06-14 2018-11-13 重庆邮电大学 A kind of SDN rules dispositions method
CN109921996A (en) * 2018-12-29 2019-06-21 长沙理工大学 A kind of virtual flow stream searching method of high performance OpenFlow

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9756121B2 (en) * 2015-06-24 2017-09-05 International Business Machines Corporation Optimizing routing and load balancing in an SDN-enabled cloud during enterprise data center migration
KR102342734B1 (en) * 2017-04-04 2021-12-23 삼성전자주식회사 Software defined network controll devcie and method for setting transmission rule for data packet
KR102160187B1 (en) * 2018-11-20 2020-09-25 광주과학기술원 Apparatus and method deploying firewall on SDN, and network using the same

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108092895A (en) * 2017-12-26 2018-05-29 重庆邮电大学 A kind of software defined network joint route selection and network function dispositions method
CN108521375A (en) * 2018-04-17 2018-09-11 中国矿业大学 The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method
CN108809829A (en) * 2018-06-14 2018-11-13 重庆邮电大学 A kind of SDN rules dispositions method
CN109921996A (en) * 2018-12-29 2019-06-21 长沙理工大学 A kind of virtual flow stream searching method of high performance OpenFlow

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李海鹏.软件定义网络联合路由选择及资源分配算法.《中国优秀硕士学位论文全文数据库 信息科技辑》.2014, *

Also Published As

Publication number Publication date
CN110380972A (en) 2019-10-25

Similar Documents

Publication Publication Date Title
CN106572019B (en) Time delay guarantee hybrid SDN energy-saving flow scheduling method
CN107105043B (en) Content-centric network caching method based on software defined network
CN105812462A (en) SDN (software-defined networking)-based ICN (information-centric networking) routing method
CN113810931B (en) Self-adaptive video caching method for mobile edge computing network
CN106533733A (en) CCN collaborative cache method and device based on network clustering and Hash routing
CN111698732B (en) Time delay oriented cooperative cache optimization method in micro-cellular wireless network
CN112689163A (en) Video service transmission system and method based on SDN and in-network cache
Wu et al. MBP: A max-benefit probability-based caching strategy in information-centric networking
CN105681438A (en) Centralized caching decision strategy in content-centric networking
CN108173903B (en) Application method of autonomous system cooperation caching strategy in CCN
CN112399485A (en) CCN-based new node value and content popularity caching method in 6G
CN108809829B (en) SDN rule deployment method
CN112052198B (en) Hash route cooperative caching method based on node betweenness popularity under energy consumption monitoring platform
CN110380972B (en) SDN joint routing selection and rule caching method based on user stream transmission cost optimization
CN111447506B (en) Streaming media content placement method based on delay and cost balance in cloud edge environment
Liao et al. An energy-efficient sdn-based data collection strategy for wireless sensor networks
Yufei et al. A centralized control caching strategy based on popularity and betweenness centrality in ccn
CN115473854B (en) Intelligent flow control method for multi-mode network
CN113709853B (en) Network content transmission method and device oriented to cloud edge collaboration and storage medium
Fekih et al. Proactive content caching strategy with router reassignment in content centric networks based SDN
CN106790421B (en) ICN two-step caching method based on community
Alduayji et al. PF-EdgeCache: Popularity and freshness aware edge caching scheme for NDN/IoT networks
CN110012071B (en) Caching method and device for Internet of things
Noh et al. Cooperative and distributive caching system for video streaming services over the information centric networking
CN113965588B (en) Content-centric-network-oriented autonomous domain collaborative caching 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