CN115208765A - Slice arranging method and system for power business - Google Patents
Slice arranging method and system for power business Download PDFInfo
- Publication number
- CN115208765A CN115208765A CN202210582235.0A CN202210582235A CN115208765A CN 115208765 A CN115208765 A CN 115208765A CN 202210582235 A CN202210582235 A CN 202210582235A CN 115208765 A CN115208765 A CN 115208765A
- Authority
- CN
- China
- Prior art keywords
- service
- time delay
- slice
- executing
- type
- 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
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000002955 isolation Methods 0.000 claims abstract description 49
- 238000004364 calculation method Methods 0.000 claims abstract description 23
- 238000007726 management method Methods 0.000 claims description 30
- 238000004519 manufacturing process Methods 0.000 claims description 27
- 238000004590 computer program Methods 0.000 claims description 16
- 238000004891 communication Methods 0.000 claims description 14
- 238000003860 storage Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 abstract description 12
- 238000010586 diagram Methods 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 239000002245 particle Substances 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 239000002699 waste material Substances 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
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/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/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/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a slice arranging method and system for power service, comprising the following steps: constructing a business model according to the electric power business characteristics; sending a service model according to a slicing arrangement request of a service, and acquiring service parameters, wherein the service parameters comprise a service type, a service isolation type and a service delay requirement; executing a pre-planned broadband resource corresponding to the service according to the service type; executing a slice bearing scheme corresponding to the service according to the service isolation type, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme; and executing the minimum resource strategy to plan the route for the service, acquiring the end-to-end time delay when the service utilizes the minimum resource strategy according to the time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, using the minimum resource strategy to plan the route for the service, and if not, executing the shortest time delay strategy to optimize the route for the service. The problem that differentiated transmission cannot be carried out on services is solved. The purpose of differential transmission is achieved.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a slice arranging method and system for power services.
Background
With the gradual trend of complexity of an electric power communication system, the scale of an electric power communication network is continuously enlarged, the topological structure is increasingly complex, the carried power grid service presents the trend of 'broadband, networking, IP and diversification', the POTN technology with higher requirements is provided for the aspects of carrying capacity, access flexibility, multi-service adaptability and the like of an electric power backbone transmission network, the POTN technology combines the advantages of packet switching and circuit switching, the POTN technology has the networking capability of being suitable for various particle services with different sizes and end-to-end, and is an ideal mode for the evolution of the current electric power backbone communication network.
Meanwhile, the service type in the power communication backbone transmission network gradually evolves to the service of a carrying network of a 4G/5G power wireless private network from the relay protection stability control private line service, a data communication network, a telephone exchange network and a video conference system. The service comprehensive bearing condition of the power wireless private network is comprehensively analyzed, services of the internet of things and broadband services such as large-bandwidth services of 4K videos, AR/VR and the like, services of power network protection, stability, low time delay and high reliability, wide access services derived from the power internet of things and the like coexist in the future power transmission network. Different service scenes have different network performance indexes and isolation requirements, for example, the service delay, bandwidth, reliability, isolation, connection number and other characteristics of four main areas of the original safe I area/II area/III area/IV area are different, the I/II area service requires ultra-low delay and high isolation, and the III/IV area service is relatively insensitive to delay and requires high safety and reliability. Emerging VR (virtual reality) and strong interactive games have clear low-delay requirements, and need a network to have low-delay guarantee of 3ms/6ms magnitude, but do not require strict physical isolation of the network.
Traditional power communication service transmission cannot carry out differentiated transmission on services, and resource waste is caused.
Disclosure of Invention
The embodiment of the specification provides a slice arranging method and a slice arranging system for power services, which are used for solving the problem that the traditional power communication service transmission cannot carry out differentiated transmission on the services, so that the resource waste is caused.
To this end, the examples of the present specification provide the following:
in a first aspect, an embodiment of the present application provides a slicing arrangement method for power services, including:
constructing a service model according to power service characteristics, wherein the power service characteristics comprise service types, service names and service communication demand indexes, the service communication demand indexes comprise time delay, bandwidth, reliability, isolation types and connection numbers required by services, and the isolation types comprise physical isolation and VPN isolation;
sending a service model according to a service slice arranging request to acquire the service parameters, wherein the service parameters comprise a service type, a service isolation type and a service time delay requirement;
executing a pre-planned broadband resource corresponding to the service according to the service type;
executing a slice bearing scheme corresponding to the service according to the service isolation type, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme;
and executing a minimum resource strategy to plan a route for the service, acquiring end-to-end time delay when the service utilizes the minimum resource strategy according to a time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, using the minimum resource strategy to plan the route for the service, and if not, executing a shortest time delay strategy to optimize the route for the service.
Further, according to the service isolation type, executing a slice bearer scheme corresponding to the service, where the slice bearer scheme includes a hard slice bearer scheme and a soft slice bearer scheme, and includes:
judging the service type of the service, wherein the service type comprises a production control service and a management information service, the production control service comprises a production control area safety I area and a production control area safety II area, and the management information service comprises an information management area safety III area and an information management area safety IV area;
and executing a slice bearing scheme corresponding to the service according to the service category, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme.
Further, according to the service isolation type, executing a slice bearer scheme corresponding to the service, including:
if the service type is the safety I area or/and the safety II area of the production control area;
then, the slice bearing scheme adopts a hard slice bearing scheme;
if the service type is a safety III area or/and an IV area of an information management area;
then, the slice loading scheme adopts a soft slice loading scheme.
Further, the executing the pre-planned broadband resource corresponding to the service according to the service type includes:
respectively presetting corresponding pre-planned broadband resources according to different service types;
acquiring the service type, and judging a preplanned broadband resource corresponding to the service type;
and executing the preplanned broadband resource corresponding to the service.
Further, the executing the minimum resource policy is to plan a route for the service, and obtain an end-to-end delay of the service when the service utilizes the minimum resource policy according to a delay calculation model, including:
constructing a node model;
presetting resource strategies according to the node model, wherein the resource strategies comprise a minimum resource strategy and a minimum time delay strategy;
and constructing a time delay calculation model, and obtaining the end-to-end time delay of the service when the minimum resource strategy is utilized according to the time delay calculation model.
Further, the building of the node model includes: and constructing a node model according to the node hierarchy, the node type, the port type and the port information.
Further, the constructing the delay calculation model includes:
acquiring node time delay corresponding to the resource strategy;
acquiring link time delay corresponding to the resource strategy;
and obtaining the time delay calculation model according to the node time delay and the link time delay.
In a second aspect, an embodiment of the present specification further provides a slicing arrangement system for power services, which is configured to implement any one of the methods in the first aspect, and includes:
the service model building module is used for sending a service model according to a slicing arrangement request of a service and acquiring the service parameters, wherein the service parameters comprise a service type, a service isolation type and a service delay requirement;
the execution module is used for executing the preplanned broadband resource corresponding to the service according to the service type; and a slicing bearer scheme corresponding to the service is executed according to the service isolation type, wherein the slicing bearer scheme comprises a hard slicing bearer scheme and a soft slicing bearer scheme;
and the route selection module is used for executing a minimum resource strategy to plan a route for the service, acquiring end-to-end time delay when the service utilizes the minimum resource strategy according to a time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, planning the route for the service by using the minimum resource strategy, and if not, executing a shortest time delay strategy to optimize the route for the service.
In a third aspect, the present specification also provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the method according to any one of the first aspect.
In a fourth aspect, embodiments of the present specification further provide an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the method according to any one of the first aspect when executing the computer program.
The embodiment of the application adopts at least one technical scheme which can achieve the following beneficial effects: when the power communication service transmission can be realized, the service is transmitted in a differentiated mode, and the efficiency and the resource waste and utilization rate are improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow chart of a method provided by an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a hard chip carrying scheme provided in an embodiment of the present disclosure;
fig. 3 is a schematic diagram of a soft slice loading scheme provided in an embodiment of the present disclosure;
fig. 4 is a schematic diagram of node model definition provided in an embodiment of the present specification;
fig. 5 is a schematic diagram of service end-to-end delay provided in an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of a system provided in an embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be clearly and completely described below with reference to specific embodiments of the present application and corresponding drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
The present embodiment provides a slicing and arranging method for power services, please refer to fig. 1, which includes:
001. constructing a service model according to power service characteristics, wherein the power service characteristics comprise service types, service names and service communication demand indexes, the service communication demand indexes comprise time delay, bandwidth, reliability, isolation types and connection numbers required by services, and the isolation types comprise physical isolation and VPN isolation; in a specific implementation, the service category includes, but is not limited to, a production control service and a management information service, the production control service includes a production control area security I area and a production control area security II area, and the management information service includes an information management area security III area and an information management area security IV area; the safety I area of the production control area is a real-time area, the traditional typical service system comprises an electric power data acquisition and monitoring system, an energy management system, a wide-area phasor measurement system, a distribution network automation system, a substation automation system, a power plant automatic monitoring system and the like, and the real-time performance of data transmission is millisecond or second. Typical service types include relay protection, safety automatic control, low-frequency (or low-voltage) automatic load reduction, load control management and the like, the real-time requirement of the service on data transmission is in the millisecond or second level, and the load control management system is in the minute level. The safety II area of the production control area is a non-real-time area, the traditional typical business system comprises a dispatcher training simulation system, a reservoir dispatching automation system, a fault recording information management system, an electric energy metering system, a real-time and next-day electric power market operation system and the like, and the data acquisition frequency is a minute level or an hour level.
Information management area safety III area, information management area safety IV area: the traditional typical service system for managing the information large area comprises a scheduling production management system, an administrative telephone network management system, an electric power enterprise data network and the like. Safety zone iii typical system: a scheduling production management system (DMIS), a lightning monitoring system, a statistical statement system and the like. Safety zone iv typical system: management Information Systems (MIS), office automation systems (OA), customer service systems, and the like.
The service bandwidth of the I/II area is generally in the order of 2M, but the requirements on real-time performance, accuracy, safety and reliability are high. The bandwidth of the large management information area is larger than that of the I/II area service, the magnitude of the bandwidth is about 2-100M, and the requirements on the isolation and the reliability of the network are slightly low.
For example, the power traffic characteristics are shown in the following table:
compared with the public network of an operator, the overall characteristics of the power network service are that the data volume is small, and the isolation and reliability of the I/II area and the III/IV area are obviously distinguished. Therefore, the method is very suitable for dividing different network slices into different service types for carrying out network load bearing. The existing power network uses an SDH network to solely bear I/II service, and cannot complete the differential bearing of I-IV area service on the same physical network.
It should be understood that the above-listed specific references are only for illustrative purposes and should not be construed as limiting the present application in any way.
002. Sending a service model according to a service slice arranging request to acquire service parameters, wherein the service parameters comprise service types, service isolation types and service time delay requirements;
in a specific implementation, the slicing scheduling request of the service includes, but is not limited to, inputting by a scheduling interface for delivering service information input by a user, the service information being delivered and stored according to fields and formats defined by a service model. Or directly sending the business model to the user by requesting, directly inputting business information by the user, and generating detailed information data of the business based on the business model. The business model comprises: and constructing a business model according to the business isolation and SLA requirements.
Specifically, for example, as shown in the following table, the business model is constructed as follows:
in this embodiment, the network slice orchestration method receives a service orchestration request through an orchestration interface.
It should be understood that the above-mentioned specific references are merely illustrative and should not be construed as limiting the present application in any way.
003. Executing a preplanned broadband resource corresponding to the service according to the service type;
in a specific implementation, the executing the pre-planned broadband resource corresponding to the service according to the service type includes but is not limited to:
031. respectively presetting corresponding pre-planned broadband resources according to different service types;
032. acquiring the service type, and judging a pre-planned broadband resource corresponding to the service type;
and executing the preplanned broadband resource corresponding to the service.
Specifically, the service type is judged, if the service type is a production area I and an area II, a slice bandwidth preplanning strategy of the area I/II service is called, and bandwidth resources are preplanned for the service; if the service type is the production III area and the production IV area, calling a slice bandwidth preplanning strategy of the III/IV area service to preplank bandwidth resources for the service.
It should be understood that the specific references listed above are for illustrative purposes only and should not be construed as limiting the application in any way.
004. Executing a slice bearing scheme corresponding to the service according to the service isolation type, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme;
in a specific implementation, according to a service isolation type, a slice bearer scheme corresponding to the service is executed, including but not limited to:
041. respectively presetting corresponding slice bearing schemes according to different service isolation types;
042. acquiring the service isolation type of the service, and judging a slice bearing scheme corresponding to the service isolation type of the service;
specifically, the service type of the service is judged, the service type comprises a production control type service and a management information type service, the production control type service comprises a production control area safety I area and a production control area safety II area, and the management information type service comprises an information management area safety III area and an information management area safety IV area;
and executing a slice bearing scheme corresponding to the service according to the service category, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme.
If the service type is the safety I area or/and the safety II area of the production control area;
then, the slice bearing scheme adopts a hard slice bearing scheme;
if the service type is a safety III area or/and an IV area of an information management area;
then, the slice loading scheme adopts a soft slice loading scheme.
043. And executing a slice bearing scheme corresponding to the service.
Specifically, the service isolation type is judged, and if the service isolation type is hard isolation, a hard slice bearing scheme is called; and if the soft isolation is adopted, calling a soft slice bearing scheme.
Referring to fig. 2, a hard slice bearer scheme includes that a virtual node is L1, and an OSU/ODU cross is performed in a PE/P node;
as shown in fig. 3, the soft-slice bearer scheme is L2, and OSU/ODU crossing and MPLS-TP label switching/ETH crossing of L2 are performed inside the PE/P node, which increases the processing flow of L2 layer and correspondingly increases the internal forwarding delay of a single node compared with the hard-slice bearer scheme.
It should be understood that the specific references listed above are for illustrative purposes only and should not be construed as limiting the application in any way.
005. And executing a minimum resource strategy to plan the route for the service, obtaining the end-to-end time delay of the service when the minimum resource strategy is utilized according to a time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, using the minimum resource strategy to plan the route for the service, and if not, executing a shortest time delay strategy to optimize the route for the service.
In a specific implementation, the executing the minimum resource policy plans a route for the service, and obtains an end-to-end delay of the service when the service utilizes the minimum resource policy according to a delay calculation model, including:
051. constructing a node model;
in a specific implementation, please refer to fig. 4, a node model is constructed according to a node hierarchy, a node type, a port type, and port information.
052. Presetting a resource strategy according to the node model, wherein the resource strategy comprises a minimum resource strategy and a shortest time delay strategy;
053. and constructing a time delay calculation model, and obtaining the end-to-end time delay of the service when the service utilizes the minimum resource strategy according to the time delay calculation model.
In a specific implementation, the constructing the delay calculation model includes:
acquiring node time delay corresponding to the resource strategy; acquiring link time delay corresponding to the resource strategy; and obtaining the time delay calculation model according to the node time delay and the link time delay.
Specifically, the delay model includes two parts, namely node delay and link delay, where the node delay is obtained by using the association shown in the following table, and the corresponding node delay value TNode can be obtained according to the values of different input parameters (vNode level, vNode type, UNI port type, NNI port type, service packet length).
For example, the following table shows a calculation table of the node delay model
Link delay T Link The length of the optical fiber of the link is determined, and the length is calculated by the following formula.
Link delay T Link = link fiber length 5us/km equation (1)
End-to-end delay T = total link delay of the traffic routing path + total node delay of the routing path. Taking the service route of fig. 5 as an example, the service end-to-end delay calculation mode from PE1 to PE2 node is:
T＝T PE1 +T PE2 +T P1 +T P2+ T Link1 +T Link2 +T Link3
and finishing batch slicing arrangement facing different power service types in the network.
In the embodiment, parameter information such as service type, isolation, SLA (time delay, bandwidth and reliability) and the like of the power service can be acquired through the arrangement interface, and data storage is completed based on a service model; the end-to-end delay performance of the estimated service can be simulated finely based on the delay model, and two key requirements of different types of power services on isolation and low-delay guarantee are met; the network slice arranging and processing flow is provided, different hard slice/soft slice bearing schemes can be provided according to different power service types, two requirements of improving the utilization rate of power network resources and guaranteeing service delay requirements can be met, and batch slice arranging of power services can be efficiently completed.
The present embodiment further provides a slicing arrangement system for power services, which is configured to implement the method according to any one of the first aspects, with reference to fig. 6, and includes:
a service model building module 100, configured to send a service model according to a slicing arrangement request of a service, to obtain the service parameter, where the service parameter includes a service type, a service isolation type, and a service delay requirement;
an executing module 200, configured to execute a pre-planned broadband resource corresponding to the service according to the service type; and a slicing bearer scheme corresponding to the service is executed according to the service isolation type, wherein the slicing bearer scheme comprises a hard slicing bearer scheme and a soft slicing bearer scheme;
the route selection module 300 is configured to execute a minimum resource policy to plan a route for the service, obtain an end-to-end delay when the service utilizes the minimum resource policy according to a delay calculation model, determine whether the end-to-end delay meets the service delay requirement, if yes, use the minimum resource policy to plan a route for the service, and if not, execute a shortest delay policy to optimize a route for the service.
The OSU small particle bearing technology supported by the POTN network defines a flexible and elastic new container OSUflex on the premise of keeping the advantages of a traditional OTN hard pipeline, rich OAM and the like, provides a finer time slot granularity and a simpler bandwidth lossless adjustment mechanism, can further support the bearing of small particle services, and supports the efficient bearing of client services with the speed of 2M-100 Gbps. The minimum particle OSUflex provided by the OSU technology corresponds to 2M bandwidth, different hard pipelines can be divided for different services (1 OSUflex corresponds to one hard pipeline), and the granularity of the network hard slice can be reduced to 2Mbps magnitude.
The original smallest particle of the OTN is an ODU0=1.25G, and if the bandwidth is used as physical isolation to carry a power service of several M, it is very wasteful, and the OSU technology in the POTN can be used for carrying with a granularity of 2M, which does not cause waste of bandwidth resources, thereby greatly improving the carrying efficiency of the small-bandwidth service. Therefore, the POTN network is very suitable for the service application scene of the power network, and can also divide different hard slices and soft slices according to the differential characteristics of four large areas to realize the isolation bearing among services.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application therefore also proposes a computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of the embodiments of the present application.
Further, the present application also proposes an electronic device, which includes a memory, a processor and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the electronic device implements the method according to any embodiment of the present application.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A slice arranging method facing to power business is characterized by comprising the following steps:
constructing a service model according to power service characteristics, wherein the power service characteristics comprise service types, service names and service communication demand indexes, the service communication demand indexes comprise time delay, bandwidth, reliability, isolation types and connection numbers required by services, and the isolation types comprise physical isolation and VPN isolation;
sending a service model according to a service slice arranging request to acquire service parameters, wherein the service parameters comprise service types, service isolation types and service time delay requirements;
executing a pre-planned broadband resource corresponding to the service according to the service type;
executing a slice bearing scheme corresponding to the service according to the service isolation type, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme;
and executing a minimum resource strategy to plan a route for the service, acquiring end-to-end time delay when the service utilizes the minimum resource strategy according to a time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, using the minimum resource strategy to plan the route for the service, and if not, executing a shortest time delay strategy to optimize the route for the service.
2. The method of claim 1, wherein executing a slice bearer scheme corresponding to the service according to a service isolation type, the slice bearer scheme including a hard slice bearer scheme and a soft slice bearer scheme comprises:
judging the service type of the service, wherein the service type comprises a production control service and a management information service, the production control service comprises a production control area safety I area and a production control area safety II area, and the management information service comprises an information management area safety III area and an information management area safety IV area;
and executing a slice bearing scheme corresponding to the service according to the service category, wherein the slice bearing scheme comprises a hard slice bearing scheme and a soft slice bearing scheme.
3. The method of claim 2, wherein executing a slice bearer scheme corresponding to the service according to a service isolation type comprises:
if the service type is the safety I area or/and the safety II area of the production control area;
then, the slice bearing scheme adopts a hard slice bearing scheme;
if the service type is a safety III area or/and an IV area of an information management area;
then, the slice bearing scheme adopts a soft slice bearing scheme.
4. The method of claim 1, wherein said executing pre-planned broadband resources corresponding to said service based on said service type comprises:
respectively presetting corresponding pre-planned broadband resources according to different service types;
acquiring the service type, and judging a pre-planned broadband resource corresponding to the service type;
and executing the preplanned broadband resource corresponding to the service.
5. The method of claim 1, wherein said executing the minimum resource policy routes the service and obtains an end-to-end delay for the service using the minimum resource policy according to a delay computation model, comprising:
constructing a node model;
presetting resource strategies according to the node model, wherein the resource strategies comprise a minimum resource strategy and a minimum time delay strategy;
and constructing a time delay calculation model, and obtaining the end-to-end time delay of the service when the service utilizes the minimum resource strategy according to the time delay calculation model.
6. The method of claim 5, wherein the building a node model comprises: and constructing a node model according to the node hierarchy, the node type, the port type and the port information.
7. The method of claim 5, wherein constructing the latency calculation model comprises:
acquiring node time delay corresponding to the resource strategy;
acquiring link time delay corresponding to the resource strategy;
and obtaining the time delay calculation model according to the node time delay and the link time delay.
8. A slicing arrangement system for power services, configured to implement any one of the methods of claim 1-claim 7, comprising:
the service model building module is used for sending a service model according to a service slice arranging request and acquiring the service parameters, wherein the service parameters comprise a service type, a service isolation type and a service delay requirement;
the execution module is used for executing the preplanned broadband resource corresponding to the service according to the service type; and a processor configured to execute a slice bearer scheme corresponding to the service according to the service isolation type, where the slice bearer scheme includes a hard slice bearer scheme and a soft slice bearer scheme;
and the route selection module is used for executing a minimum resource strategy to plan a route for the service, acquiring end-to-end time delay when the service utilizes the minimum resource strategy according to a time delay calculation model, judging whether the end-to-end time delay meets the service time delay requirement, if so, using the minimum resource strategy to plan the route for the service, and if not, executing a shortest time delay strategy to optimize the route for the service.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-7.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1-7 when executing the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210582235.0A CN115208765A (en) | 2022-05-26 | 2022-05-26 | Slice arranging method and system for power business |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210582235.0A CN115208765A (en) | 2022-05-26 | 2022-05-26 | Slice arranging method and system for power business |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115208765A true CN115208765A (en) | 2022-10-18 |
Family
ID=83576658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210582235.0A Pending CN115208765A (en) | 2022-05-26 | 2022-05-26 | Slice arranging method and system for power business |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115208765A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117201434A (en) * | 2023-11-07 | 2023-12-08 | 杭州初灵信息技术股份有限公司 | Ethernet data interaction method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106936645A (en) * | 2017-04-19 | 2017-07-07 | 西安电子科技大学 | The optimization method of the tree network topology structure based on queueing theory |
| US20180035399A1 (en) * | 2016-07-27 | 2018-02-01 | Lg Electronics Inc. | Method and apparatus for performing mm attach and service request procedure for network slice based new radio access technology in wireless communication system |
| WO2018219148A1 (en) * | 2017-05-27 | 2018-12-06 | 华为技术有限公司 | Method, device and system for managing transmission network slices |
| CN113242176A (en) * | 2021-04-01 | 2021-08-10 | 烽火通信科技股份有限公司 | End-to-end multi-path rapid calculation method and device |
| CN114025264A (en) * | 2021-11-15 | 2022-02-08 | 国网天津市电力公司信息通信公司 | Routing planning method for power communication SDH optical transmission network |
| CN114422342A (en) * | 2020-10-13 | 2022-04-29 | 中国移动通信有限公司研究院 | Method, device and equipment for deploying transport network slices and readable storage medium |
-
2022
- 2022-05-26 CN CN202210582235.0A patent/CN115208765A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180035399A1 (en) * | 2016-07-27 | 2018-02-01 | Lg Electronics Inc. | Method and apparatus for performing mm attach and service request procedure for network slice based new radio access technology in wireless communication system |
| CN106936645A (en) * | 2017-04-19 | 2017-07-07 | 西安电子科技大学 | The optimization method of the tree network topology structure based on queueing theory |
| WO2018219148A1 (en) * | 2017-05-27 | 2018-12-06 | 华为技术有限公司 | Method, device and system for managing transmission network slices |
| CN114422342A (en) * | 2020-10-13 | 2022-04-29 | 中国移动通信有限公司研究院 | Method, device and equipment for deploying transport network slices and readable storage medium |
| CN113242176A (en) * | 2021-04-01 | 2021-08-10 | 烽火通信科技股份有限公司 | End-to-end multi-path rapid calculation method and device |
| CN114025264A (en) * | 2021-11-15 | 2022-02-08 | 国网天津市电力公司信息通信公司 | Routing planning method for power communication SDH optical transmission network |
Non-Patent Citations (2)
| Title |
|---|
| 吕聪, 敏熊伟: "基于5G切片和MEC技术的智能电网总体框架设计", 电力信息与通信技术, pages 55 - 57 * |
| 陈望都，陈鹏之，张顺颐: "一种路径时延约束下构造最低代价多播树的探索算法", 南京邮电学院学报(自然科学版), pages 15 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117201434A (en) * | 2023-11-07 | 2023-12-08 | 杭州初灵信息技术股份有限公司 | Ethernet data interaction method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108134669B (en) | Quantum key dynamic supply method and management system for power dispatching service | |
| CN108809857A (en) | A method of the traffic monitoring based on SDN and service quality securing strategy | |
| CN107659419A (en) | Network dicing method and system | |
| CN109327323B (en) | New energy grid-connected power communication network planning and optimizing method and system | |
| CN113810205B (en) | Service computing power information reporting and receiving method, server and data center gateway | |
| CN107210607A (en) | Method and system for providing energy service | |
| Montazerolghaem et al. | OpenAMI: Software-defined AMI load balancing | |
| CN106027288A (en) | Communication traffic prediction method for distribution line information monitoring service | |
| Liu et al. | DL-assisted cross-layer orchestration in software-defined IP-over-EONs: From algorithm design to system prototype | |
| CN104333490A (en) | Power distribution communication business bandwidth prediction method based on communication protocols | |
| CN114025264A (en) | Routing planning method for power communication SDH optical transmission network | |
| Sadeghi et al. | Modeling of Smart Grid traffics using non-preemptive priority queues | |
| Paliwal et al. | Effective resource management in SDN enabled data center network based on traffic demand | |
| EP3979563A1 (en) | Inter-domain data interaction method and apparatus | |
| CN115208765A (en) | Slice arranging method and system for power business | |
| CN109150756A (en) | A kind of queue scheduling weight quantization method based on SDN power telecom network | |
| CN108965013A (en) | IP and the quick open system of optical network service and method | |
| Li et al. | SDN based dynamic and autonomous bandwidth allocation as ACSI services of IEC61850 communications in smart grid | |
| Basu et al. | Drive: Dynamic resource introspection and vnf embedding for 5g using machine learning | |
| CN101635673B (en) | Method and system for booking path, path computing client and path computing unit | |
| CN116455817A (en) | Software-defined cloud network fusion architecture and route implementation method | |
| Ingalalli et al. | SCD based IEC 61850 traffic estimation for substation automation networks | |
| CN106961397B (en) | The optical path method for building up and system of power distribution communication net | |
| Lu et al. | On maximum elastic scheduling in cloud-based data center networks for virtual machines with the hose model | |
| Davoli et al. | Resource Allocation in Satellite Networks—From Physical to Virtualized Network Functions |
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: 20221018 |