CN108206790A - A kind of selection of SDN joint routes and resource allocation methods based on network slice - Google Patents
A kind of selection of SDN joint routes and resource allocation methods based on network slice Download PDFInfo
- Publication number
- CN108206790A CN108206790A CN201810026551.3A CN201810026551A CN108206790A CN 108206790 A CN108206790 A CN 108206790A CN 201810026551 A CN201810026551 A CN 201810026551A CN 108206790 A CN108206790 A CN 108206790A
- Authority
- CN
- China
- Prior art keywords
- switch
- resource allocation
- link
- resource
- user flow
- 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
- 238000013468 resource allocation Methods 0.000 title claims abstract description 74
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000005540 biological transmission Effects 0.000 claims description 17
- 230000008569 process Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 7
- 238000005457 optimization Methods 0.000 abstract 1
- 238000012797 qualification Methods 0.000 abstract 1
- 238000010025 steaming Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010187 selection method Methods 0.000 description 2
- 244000062793 Sorghum vulgare Species 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000006317 isomerization reaction Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 235000019713 millet Nutrition 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding in a switch fabric
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
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 SDN joint routes selection based on network slice and resource allocation methods, belong to technical field of communication network.This method is:S1SDN controllers receive the request of user's steaming transfer;S2 controllers flow resource requirement according to user, determine candidate switch set and alternative link set;S3 modeled networks are sliced and resource allocation identification;S4:Determine network slice and resource allocation qualifications;S5 modeling users flow end-to-end time delay and network load;S6 flows end-to-end time delay with user and network load is minimised as target, is the flow-optimized determining network dicing strategy of each user;S7 judges each network slice with the presence or absence of shared interchanger and shared link;S9 controllers are sliced network and resource allocation policy is issued to respective switch, and each interchanger completes routing and the resource allocation that user flows according to flow table.The present invention flows end-to-end time delay with user and network load is minimised as target, realizes the selection of SDN joint routes and the optimization of resource allocation.
Description
Technical Field
The invention belongs to the technical field of communication networks, and relates to an SDN joint routing selection and resource allocation method based on network slicing.
Background
Software Defined Networking (SDN) is an emerging network architecture and technology based on Software, and can be applied to networks with characteristics of large scale, isomerization and the like. The SDN is mainly characterized in that a control plane is separated from a data plane, a network is controlled in a logic centralized mode, and flexible and efficient network management and operation maintenance are achieved through software programming. The SDN separates a control plane from a data plane, so that the network control function can be logically centralized, and the management and control of routing are greatly simplified; the open application programming interface is adopted for control, so that the service time of the service flow can be effectively shortened, and the utilization rate of network resources is improved.
In order to meet the transmission requirements of various types of service streams in the network, a network slicing technology can be adopted, namely, on the basis of the same physical network, technologies such as SDN (software defined network) and network virtualization are utilized, a plurality of network slices are constructed according to needs, effective support for different user requirements is realized, and the service experience of users is improved. Although SDN and network slices can significantly improve network service support capability, characteristics of complex network architecture, heterogeneous convergence of network forwarding devices, and diversified service requirements in an SDN network all bring new problems and challenges to routing mechanisms and network resource allocation.
Document [ Alba Xifra Porxas, shin-Chun line, and Min luo.qos-aware virtualization-Enabled routing software-definenetworks (icc),2015] proposes a multi-tenant management architecture in an SDN network, which meets QoS requirements of users through tenant isolation, prioritization and traffic allocation, but does not consider network load problems, which may cause excessive load on some nodes or links. Documents [ millet, zhangli, gomper gold, etc. ] a user service request selection method based on end-to-end network slicing, CN106210042A, 2016 propose a user service request selection method of end-to-end network slicing, which implements user request response by authenticating and authorizing users through a controller and matching proper network slicing, but the method does not consider resource allocation proportion when multiple users share physical resources.
In summary, how to comprehensively consider the service requirements, the node capacity, the link capacity, the transmission characteristics, and the like of the user in the network environment based on the SDN, and implement a joint routing selection and resource allocation scheme for the user under the SDN architecture, thereby reducing the network delay and balancing the network load becomes an urgent problem to be solved.
Disclosure of Invention
In view of this, the present invention provides a network slice-based SDN joint routing and resource allocation method.
In order to achieve the purpose, the invention provides the following technical scheme:
an SDN joint routing and resource allocation method based on network slices comprises the following steps:
s1: a Software Defined Network (SDN) controller receives a user streaming request;
s2: the controller determines a candidate switch set and a candidate link set according to the resource requirements of the user flow;
s3: modeling network slices and resource allocation identifications;
s4: determining a network slice and a resource allocation limiting condition;
s5: modeling end-to-end time delay of user flow and network load;
s6: optimizing and determining a network slicing strategy for each user flow by taking the end-to-end time delay of the user flow and the minimization of network load as targets;
s7: judging whether each network slice has a shared switch and a shared link, if so, executing the step S8; otherwise, go to step S9;
s8: judging whether the shared switch and the shared link meet the switch and link resource constraint, if so, executing the step S9; otherwise, executing resource allocation strategy for the shared switch and the shared link;
s9: the controller issues the network slice and the resource allocation strategy to the corresponding switches, and each switch completes the routing and resource allocation of the user flow according to the flow table.
Further, in step S1, the user streaming request is modeled asWherein S iskAnd DkSource and destination switches respectively representing kth subscriber flow, fkIndicating the data traffic of the k-th user flow,indicating the lowest transmission rate requirement for the k-th user stream,andthe switch computation resource demand and the storage resource demand of the kth user flow are respectively represented.
Further, in step S2, the candidate switch set is determined according to the switch resource requirement of the user flow, i.e. NiAs a candidate switch for user flow k, only if the computing resources of that switchAnd storage resourcesSatisfy the resource requirements of user flow k, i.e.And isTo be provided withSet of candidate switches representing the kth subscriber flow, i.e.
The candidate link set is determined according to the link resource requirements of the user flow, i.e. Li,jAs a candidate link for user flow k, only if the bandwidth resource B of the link is availablei,jThe bandwidth resource requirement of the user flow k is satisfied, and the sending rate R of the link isi,jMeeting the minimum sending rate requirement of user flow kI.e. fk≤Bi,jAnd isTo be provided withSet of candidate links representing the k-th user flow, i.e.
Further, in step S3, the modeling web sliceThe resource allocation identifier is specifically: let xi,j,kE {0,1} is the network slice ID of user flow k, if xi,j,kIf 1, it means that the network slice allocated for the user flow k includes the switch NiAnd link Li,jOtherwise, xi,j,k=0;Respectively representing the occupation of N by user flow kiCalculating the resource proportion and the storage resource proportion; deltai,j,k∈[0,1]Indicating that user stream k occupies Li,jThe transmission resource ratio of (1).
Further, in step S4, the network slice and the resource allocation limiting condition include switch flow conservation, and a switch, link capacity and a resource allocation limiting condition, where the switch flow conservation condition is specifically as follows:
routing source switch S for user flow kkOnly one output path is selected, i.e.
Trunk exchanger N for user flow kjAt equal input and output flows, i.e.
Destination switch D for user flow kkOnly one input path is selected, i.e.
The switch capacity limiting condition comprises a switch computing resource capacity and storage resource capacity limiting condition, and the modeling is as follows:
user flow occupation NiCannot exceed the amount of computing resources of the switch, i.e. the switch is not powered onUser flow occupation NiCannot exceed the amount of storage resources of the switch, i.e.
The limiting condition of the link capacity is that the user flow occupies Li,jCannot exceed the amount of bandwidth resources of the link, i.e. the link resources of
The switch resource allocation limiting condition comprises a switch computing resource and storage resource allocation limiting condition and is modeled as follows:
user flow occupation NiIs not more than 1, i.e. the sum of the allocation proportions of the computing resources of
User flow occupation NiIs not more than 1, i.e. the sum of the allocation proportions of the storage resources
The limited condition of link resource allocation is that the user flow occupies Li,jIs not more than 1, i.e. the sum of the bandwidth resource allocation proportions
Further, in step S5, the system end-to-end delay is modeled as the sum of the link transmission delay and the switch queuing delay, i.e. the system end-to-end delay is modeled as the sum of the link transmission delay and the switch queuing delayWherein D isi,jIndicating the link transmission delay, DiIndicating queuing delay of switch, for Di,jAnd DiThe modeling is as follows:
modeling link transmission delay
The modeling exchanger processes the data process into an M | M |1 queuing system to obtainWherein, muiRepresents NiService rate of (λ)iRepresents NiThe service arrival rate of (2);
the network load is modeled as the sum of the link load and the switch load, namely:wherein, Ui,jIndicating the link load, UiIndicating switch load, for Ui,jAnd UiThe modeling is as follows:
modeling link load
Modeling switch loadWherein,the load is calculated for the switch and,store the load for the switch, α are weight coefficients.
Further, in step S6, the network slicing policy is to determine a network slicing policy for each user flow respectively under the condition that the network slicing and resource allocation limiting conditions are satisfied, that is, for each user flow k, commandThe resource allocation strategy for each flow is optimized and determined by taking the end-to-end time delay of the user flow and the network load minimization as the targets, namely:
further, in step S7, the determination of whether or not there are shared switches and shared links in each network slice is to determineAnd if so, a shared switch and a shared link exist.
Further, in step S8, the determining whether the shared switch and the shared link satisfy the switch and link resource constraints is respectively as follows:
judging switch NiIf the user flow occupies more than the computing resource of the switch, the computing resource of the switch is constrained, that is, the user flow occupies more than the computing resource of the switchOptimizing and determining the user flow in N by using the minimization of the queuing delay of the switch and the calculation load of the switch as the targetjComputing resource allocation policy of
Judging switch NiIf the storage resources of the switch are occupied by multiple user flows and exceed the storage resource amount, that isOptimizing and determining the user flow at N by using the minimization of the storage load of the switch as a targetjStorage resource allocation policy of
Judging the link Li,jIf the bandwidth resource occupied by the multiple user streams exceeds the link bandwidth resource amount, that isOptimally determining the user flow at L by using the link transmission delay and the link load minimization as the targeti,jResource allocation policy of
Further, in step S9, the network slice and the resource allocation policy of the user flow k are the same as those described above
The invention has the beneficial effects that: the invention can effectively reduce the end-to-end time delay of the network, balance the network load and improve the network stability.
Drawings
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
FIG. 1 is a block diagram of an exemplary communication system in accordance with an embodiment of the present invention;
FIG. 2 is a flow chart of joint routing and resource allocation according to an embodiment of the present invention;
fig. 3 is a communication diagram of an application of the method of joint routing and resource allocation according to an embodiment of the present invention.
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The SDN adopts OpenFlow to realize the separation of a control function and a forwarding function, and a controller completes the control function of a network. The OpenFlow switch stores the flow table to realize the lookup and forwarding of the data flow. The switch is connected to an external controller through a secure channel through an OpenFlow protocol, and inquires and manages the flow table. The flow table includes Header fields (matching Header fields), activity Counters (Counters), 0 or more execution Actions (Actions). And the OpenFlow switch searches the data flow, if the data flow is matched with the OpenFlow switch, the related strategy is executed, otherwise, the data flow is forwarded to the controller through the safety channel, and the controller executes a corresponding decision.
Fig. 1 is a block diagram illustrating an exemplary communication system in accordance with an embodiment of the present invention. In the communication system, the SDN control plane comprises a centralized controller; the SDN data plane contains a plurality of distributed forwarding devices, wherein the forwarding devices may be any router, switch, virtual switch, etc. supporting the SDN protocol.
Fig. 2 is a flowchart illustrating a joint routing and resource allocation process according to an embodiment of the present invention. The method in an embodiment comprises the steps of:
s201, a controller receives a user stream transmission request;
s202, determining a candidate switch set and a candidate link set;
s203, modeling a network slice and a resource allocation identifier;
s204, determining network slices and resource allocation limiting conditions;
s205, modeling the end-to-end time delay and the network load of the user flow;
s206, optimizing and determining a network slicing strategy for each user flow by taking the end-to-end time delay of the user flow and the minimization of the network load as targets;
s207, judging whether a shared switch and a shared link exist in each network slice, and if yes, executing S208; otherwise, S209 is executed;
s208, judging whether the shared switch and the shared link meet the switch and link resource constraint, if so, executing S209; otherwise, executing resource allocation strategy for the shared switch and the shared link;
and S209, the controller issues the network slice and the resource allocation strategy to the corresponding switches, and each switch finishes the routing and resource allocation of the user flow according to the flow table.
Fig. 3 is a communication diagram of an application of the method for combining routing and resource allocation according to an embodiment of the present invention, and the following describes a routing process in detail with reference to the embodiment:
(1) data flow f1,f2Respectively to the source switch S1,S2And sending the routing request.
(2) Source switch S1,S2If no matching flow entry exists in the local flow table, S201 is executed, and a routing request message is sent to the controller.
(3) The controller executes S202 and determines f1Candidate switch set ofAnd candidate link setDetermination of f2Candidate switch set ofAnd candidate link set
(4) The controller executes S203 to model the network slice and the resource allocation identification.
(5) The controller executes S204 to determine a network slice and a resource allocation constraint.
(6) The controller executes S205 to model the end-to-end delay of the user flow and the network load, and then an objective function is obtainedAnd
(7) the controller executes step S206 to determine f1The network slicing strategy isSet up f1The resource allocation strategy off2The network slicing strategy isSet up f2The resource allocation strategy of
(8) The controller executes step S207 to determine f1And f2Presence sharing node N3If there is no shared link, S208 is executed.
(9) The controller executes step S208 to determine the sharing node N3If node resource constraints are met, assume shared node N3If the node resource constraint is satisfied, S210 is performed.
(10) Each switch performs S210, completing f1And f2Routing and resource allocation.
Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.
Claims (10)
1. An SDN joint routing and resource allocation method based on network slices is characterized in that: the method comprises the following steps:
s1: a Software Defined Network (SDN) controller receiving a user streaming request;
s2: the controller determines a candidate switch set and a candidate link set according to the resource requirements of the user flow;
s3: modeling network slices and resource allocation identifications;
s4: determining a network slice and a resource allocation limiting condition;
s5: modeling end-to-end time delay of user flow and network load;
s6: optimizing and determining a network slicing strategy for each user flow by taking the end-to-end time delay of the user flow and the minimization of network load as targets;
s7: judging whether each network slice has a shared switch and a shared link, if so, executing the step S8; otherwise, go to step S9;
s8: judging whether the shared switch and the shared link meet the switch and link resource constraint, if so, executing the step S9; otherwise, executing resource allocation strategy for the shared switch and the shared link;
s9: the controller issues the network slice and the resource allocation strategy to the corresponding switches, and each switch completes the routing and resource allocation of the user flow according to the flow table.
2. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S1, the user streaming request is modeled asWherein S iskAnd DkSource and destination switches respectively representing kth subscriber flow, fkIndicating the data traffic of the k-th user flow,indicating the lowest transmission rate requirement for the k-th user stream,andthe switch computation resource demand and the storage resource demand of the kth user flow are respectively represented.
3. According to claim1, the SDN joint routing and resource allocation method based on the network slice is characterized in that: in step S2, the candidate switch set is determined according to the switch resource requirement of the user flow, i.e. NiAs a candidate switch for user flow k, only if the computing resources of that switchAnd storage resourcesSatisfy the resource requirements of user flow k, i.e.And isTo be provided withSet of candidate switches representing the kth subscriber flow, i.e.
The candidate link set is determined according to the link resource requirements of the user flow, i.e. Li,jAs a candidate link for user flow k, only if the bandwidth resource B of the link is availablei,jThe bandwidth resource requirement of the user flow k is satisfied, and the sending rate R of the link isi,jMeeting the minimum sending rate requirement of user flow kI.e. fk≤Bi,jAnd isTo be provided withTo representCandidate link sets for the k-th user flow, i.e.
4. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S3, the modeling network slice and the resource allocation identifier are specifically: let xi,j,kE {0,1} is the network slice ID of user flow k, if xi,j,kIf 1, it means that the network slice allocated for the user flow k includes the switch NiAnd link Li,jOtherwise, xi,j,k=0;Respectively representing the occupation of N by user flow kiCalculating the resource proportion and the storage resource proportion; deltai,j,k∈[0,1]Indicating that user stream k occupies Li,jThe transmission resource ratio of (1).
5. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S4, the network slice and the resource allocation limiting condition include switch flow conservation, and a switch, link capacity and a resource allocation limiting condition, where the switch flow conservation condition is specifically as follows:
routing source switch S for user flow kkOnly one output path is selected, i.e.
Trunk exchanger N for user flow kjAt equal input and output flows, i.e.
Destination switch D for user flow kkOnly one of them is selectedInput paths, i.e.
The switch capacity limiting condition comprises a switch computing resource capacity and storage resource capacity limiting condition, and the modeling is as follows:
user flow occupation NiCannot exceed the amount of computing resources of the switch, i.e. the switch is not powered onUser flow occupation NiCannot exceed the amount of storage resources of the switch, i.e.
The limiting condition of the link capacity is that the user flow occupies Li,jCannot exceed the amount of bandwidth resources of the link, i.e. the link resources of
The switch resource allocation limiting condition comprises a switch computing resource and storage resource allocation limiting condition and is modeled as follows:
user flow occupation NiIs not more than 1, i.e. the sum of the allocation proportions of the computing resources of
User flow occupation NiIs not more than 1, i.e. the sum of the allocation proportions of the storage resources
The limited condition of link resource allocation is that the user flow occupies Li,jIs not more than 1, i.e. the sum of the bandwidth resource allocation proportions
6. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S5, the system end-to-end delay is modeled as the sum of the link transmission delay and the switch queuing delay, i.e. the system end-to-end delay is modeled as the sum of the link transmission delay and the switch queuing delayWherein D isi,jIndicating the link transmission delay, DiIndicating queuing delay of switch, for Di,jAnd DiThe modeling is as follows:
modeling link transmission delay
The modeling exchanger processes the data process into an M | M |1 queuing system to obtainWherein, muiRepresents NiService rate of (λ)iRepresents NiThe service arrival rate of (2);
the network load is modeled as the sum of the link load and the switch load, namely:wherein, Ui,jIndicating the link load, UiIndicating switch load, for Ui,jAnd UiThe modeling is as follows:
modeling link load
Modeling switch loadWherein,the load is calculated for the switch and,store the load for the switch, α are weight coefficients.
7. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S6, the network slicing policy is to determine a network slicing policy for each user flow respectively under the condition that the network slicing and resource allocation limiting conditions are satisfied, that is, for each user flow k, orderThe resource allocation strategy for each flow is optimized and determined by taking the end-to-end time delay of the user flow and the network load minimization as the targets, namely:
8. the SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S7, the determination of whether or not there are shared switches and shared links in each network slice is to determineAnd if so, a shared switch and a shared link exist.
9. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S8, the determining whether the shared switch and the shared link satisfy the switch and link resource constraints includes:
judging switch NiIf the user flow occupies more than the computing resource of the switch, the computing resource of the switch is constrained, that is, the user flow occupies more than the computing resource of the switchOptimizing and determining the user flow in N by using the minimization of the queuing delay of the switch and the calculation load of the switch as the targetjComputing resource allocation policy of
Judging switch NiIf the storage resources of the switch are occupied by multiple user flows and exceed the storage resource amount, that isOptimizing and determining the user flow at N by using the minimization of the storage load of the switch as a targetjStorage resource allocation policy of
Judging the link Li,jIf the bandwidth resource occupied by the multiple user streams exceeds the link bandwidth resource amount, that isOptimally determining the user flow at L by using the link transmission delay and the link load minimization as the targeti,jResource allocation policy of
10. The SDN federated routing and resource allocation method based on network slice of claim 1, wherein: in step S9, the network slice and the resource allocation policy of the user flow k are
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810026551.3A CN108206790B (en) | 2018-01-11 | 2018-01-11 | SDN joint routing selection and resource allocation method based on network slice |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810026551.3A CN108206790B (en) | 2018-01-11 | 2018-01-11 | SDN joint routing selection and resource allocation method based on network slice |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108206790A true CN108206790A (en) | 2018-06-26 |
CN108206790B CN108206790B (en) | 2021-03-16 |
Family
ID=62606284
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810026551.3A Active CN108206790B (en) | 2018-01-11 | 2018-01-11 | SDN joint routing selection and resource allocation method based on network slice |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108206790B (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111225379A (en) * | 2018-11-27 | 2020-06-02 | 上海华为技术有限公司 | Baseband resource processing method and baseband management equipment |
WO2020108537A1 (en) * | 2018-11-30 | 2020-06-04 | 深圳先进技术研究院 | Software-defined virtual network-based resource allocation system |
CN111865681A (en) * | 2020-07-14 | 2020-10-30 | 中国电力科学研究院有限公司 | Core network slice end-to-end time delay optimization method, system and storage medium |
CN112637066A (en) * | 2020-12-15 | 2021-04-09 | 南瑞集团有限公司 | Network slicing and path selection optimization method and system for power internet of things |
CN112825502A (en) * | 2019-11-20 | 2021-05-21 | 中兴通讯股份有限公司 | Network slice creation method, basic network controller, system, and storage medium |
US11606255B2 (en) | 2018-09-25 | 2023-03-14 | Zte Corporation | Method and apparatus for creating network slices |
CN116346621A (en) * | 2023-03-29 | 2023-06-27 | 广州爱浦路网络技术有限公司 | Adjustment method and device of network slice selection auxiliary information, electronic equipment and storage medium |
CN117240787A (en) * | 2023-11-14 | 2023-12-15 | 鹏城实验室 | Switch load balancing method and device, electronic equipment and readable storage medium |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3099015A1 (en) * | 2015-05-25 | 2016-11-30 | Juniper Networks, Inc. | Selecting and monitoring a plurality of services key performance indicators using twamp |
CN106572516A (en) * | 2016-09-28 | 2017-04-19 | 华为技术有限公司 | Network slice selection method, terminal equipment and network equipment |
CN106714093A (en) * | 2017-02-22 | 2017-05-24 | 重庆邮电大学 | Cellular and D2D (Device-to-Device) communication combined user access and slice partitioning method |
CN106911516A (en) * | 2017-03-20 | 2017-06-30 | 重庆邮电大学 | A kind of software defined network controller dispositions method |
CN106921571A (en) * | 2017-03-07 | 2017-07-04 | 重庆邮电大学 | A kind of software defined network joint route selection and flow allocation method |
CN106936705A (en) * | 2017-03-06 | 2017-07-07 | 重庆邮电大学 | A kind of software defined network route selection method |
CN107071782A (en) * | 2017-04-01 | 2017-08-18 | 北京邮电大学 | The wireless resource allocation methods cut into slices based on network |
CN107404733A (en) * | 2017-08-22 | 2017-11-28 | 山东省计算中心(国家超级计算济南中心) | A kind of 5G method of mobile communication and system based on MEC and layering SDN |
US20170373929A1 (en) * | 2016-06-24 | 2017-12-28 | Korea University Research And Business Foundation | Method for assigning master controller in software defined network |
-
2018
- 2018-01-11 CN CN201810026551.3A patent/CN108206790B/en active Active
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3099015A1 (en) * | 2015-05-25 | 2016-11-30 | Juniper Networks, Inc. | Selecting and monitoring a plurality of services key performance indicators using twamp |
US20170373929A1 (en) * | 2016-06-24 | 2017-12-28 | Korea University Research And Business Foundation | Method for assigning master controller in software defined network |
CN106572516A (en) * | 2016-09-28 | 2017-04-19 | 华为技术有限公司 | Network slice selection method, terminal equipment and network equipment |
CN106714093A (en) * | 2017-02-22 | 2017-05-24 | 重庆邮电大学 | Cellular and D2D (Device-to-Device) communication combined user access and slice partitioning method |
CN106936705A (en) * | 2017-03-06 | 2017-07-07 | 重庆邮电大学 | A kind of software defined network route selection method |
CN106921571A (en) * | 2017-03-07 | 2017-07-04 | 重庆邮电大学 | A kind of software defined network joint route selection and flow allocation method |
CN106911516A (en) * | 2017-03-20 | 2017-06-30 | 重庆邮电大学 | A kind of software defined network controller dispositions method |
CN107071782A (en) * | 2017-04-01 | 2017-08-18 | 北京邮电大学 | The wireless resource allocation methods cut into slices based on network |
CN107404733A (en) * | 2017-08-22 | 2017-11-28 | 山东省计算中心(国家超级计算济南中心) | A kind of 5G method of mobile communication and system based on MEC and layering SDN |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11606255B2 (en) | 2018-09-25 | 2023-03-14 | Zte Corporation | Method and apparatus for creating network slices |
CN111225379A (en) * | 2018-11-27 | 2020-06-02 | 上海华为技术有限公司 | Baseband resource processing method and baseband management equipment |
CN111225379B (en) * | 2018-11-27 | 2024-05-03 | 上海华为技术有限公司 | Baseband resource processing method and baseband management equipment |
WO2020108537A1 (en) * | 2018-11-30 | 2020-06-04 | 深圳先进技术研究院 | Software-defined virtual network-based resource allocation system |
CN112825502A (en) * | 2019-11-20 | 2021-05-21 | 中兴通讯股份有限公司 | Network slice creation method, basic network controller, system, and storage medium |
CN111865681A (en) * | 2020-07-14 | 2020-10-30 | 中国电力科学研究院有限公司 | Core network slice end-to-end time delay optimization method, system and storage medium |
CN112637066A (en) * | 2020-12-15 | 2021-04-09 | 南瑞集团有限公司 | Network slicing and path selection optimization method and system for power internet of things |
CN116346621A (en) * | 2023-03-29 | 2023-06-27 | 广州爱浦路网络技术有限公司 | Adjustment method and device of network slice selection auxiliary information, electronic equipment and storage medium |
CN117240787A (en) * | 2023-11-14 | 2023-12-15 | 鹏城实验室 | Switch load balancing method and device, electronic equipment and readable storage medium |
CN117240787B (en) * | 2023-11-14 | 2024-03-01 | 鹏城实验室 | Switch load balancing method and device, electronic equipment and readable storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN108206790B (en) | 2021-03-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108206790B (en) | SDN joint routing selection and resource allocation method based on network slice | |
Korilis et al. | Architecting noncooperative networks | |
CN106936705B (en) | Software defined network routing method | |
Krishna et al. | On the speedup required for work-conserving crossbar switches | |
CN109257091B (en) | Global load balancing satellite-ground cooperative network networking device and method | |
CN106911516B (en) | A kind of software defined network controller portion arranging method | |
Filali et al. | SDN controller assignment and load balancing with minimum quota of processing capacity | |
CN105516312A (en) | Software defined networking load balancingdevice and method | |
US20070268829A1 (en) | Congestion management groups | |
CN106921571A (en) | A kind of software defined network joint route selection and flow allocation method | |
CN106572019B (en) | Time delay guarantee hybrid SDN energy-saving flow scheduling method | |
CN107948067B (en) | Link load balancing method for QoS guarantee of multiple service flows in software defined network | |
CN108092895B (en) | Software Defined Network (SDN) joint routing selection and network function deployment method | |
CN114567598A (en) | Load balancing method and device based on deep learning and cross-domain cooperation | |
CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
CN105978805A (en) | Anycast attribute service oriented energy-saving routing method | |
Paganini et al. | Network stability under alpha fair bandwidth allocation with general file size distribution | |
Porxas et al. | QoS-aware virtualization-enabled routing in software-defined networks | |
CN105847146B (en) | A method of it improving level distribution SDN and controls plane router efficiency | |
CN107018018A (en) | A kind of server delta online upgrading method and system based on SDN | |
Patil | Load balancing approach for finding best path in SDN | |
Cai et al. | Optimal cloud network control with strict latency constraints | |
CN108366015B (en) | Route calculation method for software defined network | |
CN108880895B (en) | SDN joint routing selection and network function deployment method based on user flow transmission overhead optimization | |
CN116192746B (en) | SDN-based routing path selection method, SDN-based routing path selection device and storage medium |
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 |