CN113810939A - User-insensitive network slice dynamic mapping device and method - Google Patents

User-insensitive network slice dynamic mapping device and method Download PDF

Info

Publication number
CN113810939A
CN113810939A CN202110944519.5A CN202110944519A CN113810939A CN 113810939 A CN113810939 A CN 113810939A CN 202110944519 A CN202110944519 A CN 202110944519A CN 113810939 A CN113810939 A CN 113810939A
Authority
CN
China
Prior art keywords
slice
mapping
network
unit
user
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
Application number
CN202110944519.5A
Other languages
Chinese (zh)
Other versions
CN113810939B (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.)
Information Engineering University of PLA Strategic Support Force
Original Assignee
Information Engineering University of PLA Strategic Support Force
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 Information Engineering University of PLA Strategic Support Force filed Critical Information Engineering University of PLA Strategic Support Force
Priority to CN202110944519.5A priority Critical patent/CN113810939B/en
Publication of CN113810939A publication Critical patent/CN113810939A/en
Application granted granted Critical
Publication of CN113810939B publication Critical patent/CN113810939B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/04Arrangements for maintaining operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0252Traffic management, e.g. flow control or congestion control per individual bearer or channel
    • H04W28/0263Traffic management, e.g. flow control or congestion control per individual bearer or channel involving mapping traffic to individual bearers or channels, e.g. traffic flow template [TFT]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The invention belongs to the technical field of network slicing, and particularly relates to a user-insensitive dynamic network slice mapping device and a method, wherein the device comprises a slice demand analysis unit, a slice calculation unit, a slice scheduling unit, a slice mapping unit and a slice monitoring unit; a slice requirement analysis unit generates a network slice requirement view; the slice calculation unit can calculate at least three slice mapping schemes; the slice scheduling unit actively or passively schedules a slice mapping scheme; the slice mapping unit completes function mapping according to one of the slice mapping schemes calculated by the slice calculating unit submitted by the slice scheduling unit to generate a network slice; the slice monitoring unit monitors the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time and guides the dynamic mapping of the slices. When the bottom physical network fails or the user requirement changes, the method and the device ensure that the mapping process and the scheduling process of the slice are not sensitive to users, and ensure the user experience.

Description

User-insensitive network slice dynamic mapping device and method
Technical Field
The invention belongs to the technical field of network slicing, and particularly relates to a user-insensitive dynamic mapping device and method for network slices.
Background
The network slicing technology virtualizes a special network in a physical network, forms a network for providing special service for specific service according to the specific requirement of the service on the network, achieves high matching of the network and the service, and is widely deployed in novel network architectures such as a 5G network and the like. However, in the face of new networks with complicated types and increasingly changing structures, the existing network slice mapping mechanism has entered the performance bottleneck stage.
In recent years, the mapping problem of network slices attracts the attention of the industry, and how to ensure the agility, reliability and operation cost of network slice mapping becomes a hot research trend in the field of novel network structures. However, related research is mostly focused on a mapping method of a static network slice at present, the method avoids the situation that a predefined physical network structure may have node failure or link congestion, and compared with a dynamic slice mapping method, the matching granularity of services and resources is relatively rough. In fact, these static slice mapping methods do not consider the actual network state change, and only perform the determination according to the network state when the slice is designed, which is difficult to process heterogeneous networks and effectively implement multi-class information fusion, and is easy to cause the user experience degradation.
Disclosure of Invention
Aiming at the changes of the bottom physical network structure and the user requirements which may occur in real time in the traditional network and the novel network, the invention provides a user-insensitive dynamic mapping device and a user-insensitive dynamic mapping method for network slices, which are combined with the ideas of network function virtualization and software defined network, the invention supports dynamic mapping of the network slices aiming at different communication requirements in the novel network, supports network slice scheduling, mapping relation between the slices and the physical network and user insensitivity in the scheduling process, and ensures user experience.
In order to solve the technical problems, the invention adopts the following technical scheme:
the invention provides a user-insensitive dynamic mapping device for a network slice, which is arranged between a virtual network layer where the network slice is located and a bottom physical network and specifically comprises a slice demand analysis unit, a slice calculation unit, a slice scheduling unit, a slice mapping unit and a slice monitoring unit;
the slice requirement analysis unit receives the requirements of the user on network node resources and link resources and generates a network slice requirement view;
the slice computing unit computes the matching relation between the virtual network slice topology and the physical network topology according to different user service requirements and the bearing capacity of the underlying physical network, and can compute at least three slice mapping schemes;
the slice scheduling unit actively or passively schedules a slice mapping scheme, and realizes network function migration and flow path adjustment when the service requirement of a user or the structure of a bottom physical network changes;
the slice mapping unit is used for completing functional mapping according to one slice mapping scheme calculated by the slice calculating unit submitted by the slice scheduling unit to generate a network slice;
the slice monitoring unit monitors the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time and guides the dynamic mapping of the slice.
Further, the slice requirement analysis unit constructs a virtual slice topology according to the requirements of the service on transmission bandwidth and processing capacity, and the physical topology corresponding to the virtual slice topology is described in the form of an effective resource graph of each node and link in the network.
Further, after the slice calculation unit obtains the virtual slice topology and the real physical topology, it calculates at least three slice mapping schemes for the network slice on the basis of the minimum topology intersection among the mapping schemes, where the slice mapping schemes need to consider slice service performance and heterogeneity among the schemes.
Further, the task mode of the slice scheduling unit is divided into a slice passive scheduling mode and a slice active scheduling mode; the slice passive scheduling mode is suitable for a network with an infrequent change of a topological structure, and the slice active scheduling mode is suitable for a network with a frequent change of a topological structure.
Further, the slice passive scheduling mode includes: when a node corresponding to a certain scheme mapping relation completed by the slice mapping unit fails, the slice monitoring unit acquires the node failure condition and informs the slice computing unit to generate a slice mapping scheme with low path migration cost according to the residual topology in the bottom physical network; or when a link corresponding to a scheme mapping relation completed by the slice mapping unit fails, the slice monitoring unit acquires a link failure condition and informs the slice computing unit to generate a slice mapping scheme with low path migration cost according to the residual topology in the bottom-layer physical network; the slice scheduling unit then selects the slice mapping scheme recalculated by the slice calculation unit and submits it to the slice mapping unit.
Further, the slice active scheduling mode includes: the slice computing unit designs a slice mapping scheme according to the user service requirement to form a plurality of slice mapping schemes, and the selection schemes of the relay node and the link except necessary nodes among the plurality of slice mapping schemes take the minimum intersection as a principle; in the communication process, the slice scheduling unit controls various slice mapping schemes to be dynamically and randomly scheduled at intervals according to a certain probability;
meanwhile, the slice monitoring unit monitors the node and link conditions of the bottom layer physical network in real time, if a node or link corresponding to a certain slice mapping scheme fails, the slice scheduling unit is informed that the scheme does not participate in the scheduling of the slice mapping relation any more, and the slice computing unit is informed to generate a new slice mapping scheme with a smaller intersection with other slice mapping schemes according to the residual topology in the bottom layer physical network to continue to participate in the scheduling.
Further, the slice monitoring unit includes:
when the physical network part fails or the slice mapping fails, the slice monitoring unit feeds back information to the slice calculating unit and the slice scheduling unit in time to calculate a new slice mapping scheme;
when the user requirement changes, the slice monitoring unit feeds back information to the slice requirement analysis unit in time to generate a new network slice requirement view, and guides the slice calculation unit, the slice scheduling unit and the slice mapping unit to carry out dynamic mapping on the network slices according to the new network slice requirement view.
The invention also provides a user-insensitive dynamic mapping method for the network slices, which comprises the following steps:
receiving the requirements of a user on network node resources and link resources, and generating a network slice requirement view;
according to different user service requirements and the bearing capacity of a bottom physical network, calculating the matching relation between the virtual network slice topology and the physical network topology, and calculating at least three slice mapping schemes;
the slice mapping scheme is actively or passively scheduled, and when the service requirement of a user or the structure of a bottom physical network changes, network function migration and flow path adjustment are realized;
completing functional mapping according to one of the slice mapping schemes calculated by the slice calculating unit submitted by the slice scheduling unit to generate a network slice;
and monitoring the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time, and guiding the dynamic mapping of the slices.
Compared with the prior art, the invention has the following advantages:
the method comprises the steps of firstly acquiring the requirement of a user on network capacity, and calculating a possible slice mapping scheme suitable for the requirement of the user on the basis of the consideration of avoiding the influence of the possible structural change of a physical network corresponding to a slice on the slice; after forming a plurality of feasible slice mapping schemes, one of the slice mapping schemes is actively or passively selected and mapping is performed to generate network slices. The invention introduces a dynamic scheduling mechanism of network slices into the network, and is used for ensuring that users do not feel in the mapping process and the scheduling process of the slices when a bottom-layer physical network fails or the user requirements change, constructing full-dimensional perception and real-time adaptation between the state of the bottom-layer physical network and the service requirements, realizing rapid migration of the slices, and ensuring that the service experience of upper-layer users is not influenced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a schematic structural diagram of a user-insensitive network slice dynamic mapping apparatus according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the connection between the user-insensitive network slice dynamic mapping apparatus and the virtual network layer and the underlying physical network according to the embodiment of the present invention;
FIG. 3 is a schematic diagram illustrating a correspondence between a virtual slice topology and an actual physical network topology according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a slice passive scheduling mode of an embodiment of the present invention;
FIG. 5 is a schematic diagram of a slice active scheduling mode of an embodiment of the present invention;
fig. 6 is a flowchart of a user-insensitive dynamic mapping method for network slices according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer and more complete, the technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention, and based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts belong to the scope of the present invention.
Macroscopically, the overall design of the invention is based on the idea that a network slice decouples a physical network from a user network (as shown in fig. 2), a virtual service subnet corresponding to user requirements is realized in the physical network, and the user is insensitive to underlying network faults, i.e., changes occurring in the physical network do not affect the satisfaction of user experience, thereby avoiding possible service quality degradation and realizing efficient allocation of network resources.
The device for dynamically mapping the network slices without the user feeling is arranged between a virtual network layer where the network slices are located and a bottom physical network, and specifically comprises 5 modules, namely a slice requirement analysis unit, a slice calculation unit, a slice scheduling unit, a slice mapping unit and a slice monitoring unit, as shown in fig. 1.
The slice requirement analysis unit receives the requirements of the user on network node resources and link resources and generates a network slice requirement view.
Specifically, as shown in fig. 3, the slice requirement analysis unit constructs a virtual slice topology according to the requirements of the service on transmission bandwidth and processing capacity; the physical topology corresponding to the virtual slice topology is described in the form of a graph of the effective resources of each node and link in the network.
The slice calculation unit defines the service, function, capacity and connection relation of the network slices according to different user service requirements and the bearing capacity of the underlying physical network, calculates the matching relation of the virtual network slice topology and the physical network topology, and can calculate at least three slice mapping schemes.
Specifically, after the slice calculation unit obtains a virtual slice topology and a real physical topology, on the basis of the principle that the topology intersection of all mapping schemes is minimum (the feasibility of other schemes is guaranteed after one scheme fails), at least three slice mapping schemes are calculated for the network slice, and the slice mapping schemes need to comprehensively consider the slice service performance and the heterogeneity among the schemes.
The slice scheduling unit actively or passively schedules a slice mapping scheme according to the stable condition of the network topology, and when the service requirement of a user or the structure of a bottom physical network changes, network function migration and flow path adjustment are realized, and the accurate matching of virtual resources and service loads is supported. The purpose of slice scheduling is that when the user's needs or the underlying physical network structure change, the network can still continuously meet the user's expectations, and the user is not aware of the slice mapping and scheduling process.
Specifically, the task mode of the slice scheduling unit is divided into a slice passive scheduling mode and a slice active scheduling mode; the slice passive scheduling mode is suitable for a network with an infrequent change of a topological structure, and the slice active scheduling mode is suitable for a network with a frequent change of a topological structure.
In this example, the slice passive scheduling mode specifically includes: as shown in fig. 4, the slice calculation unit calculates a slice mapping scheme according to the communication requirement of the user, forming a first mapping scheme, which can support the communication requirement of the user with less communication cost. When a node (for example, a node B) corresponding to a mapping relation of a mapping scheme I completed by a slice mapping unit fails, a slice monitoring unit acquires a node failure condition and informs a slice computing unit to generate a slice mapping scheme with low path migration cost according to residual topology in a bottom-layer physical network to form a mapping scheme II, wherein the path migration cost of the scheme is low on the basis of the mapping scheme I; similarly, when the slice mapping unit completes the failure of a corresponding link (for example, link GH) in the mapping relationship of the mapping scheme II, the slice monitoring unit acquires the link failure condition and informs the slice computing unit to generate a slice mapping scheme with low path migration cost according to the residual topology in the bottom-layer physical network to form a mapping scheme III, and the path migration cost of the scheme is low on the basis of the mapping scheme II; the slice scheduling unit then selects the slice mapping scheme recalculated by the slice calculation unit and submits it to the slice mapping unit.
In this example, in the active scheduling mode, slices are actively scheduled at fixed time intervals. The slice active scheduling mode specifically includes: as shown in fig. 5, the slice calculation unit designs slice mapping schemes according to communication requirements of users, so as to form a first slice mapping scheme, a second slice mapping scheme and a third slice mapping scheme, and the selection schemes of the relay node and the link, except for necessary nodes, use the minimum intersection as a principle. In the communication process, the slice scheduling unit controls three slice mapping schemes to be dynamically and randomly scheduled at intervals according to a certain probability; meanwhile, the slice monitoring unit monitors the node and link conditions of the bottom layer physical network in real time, if a node or link corresponding to a certain slice mapping scheme fails, the slice scheduling unit is informed that the scheme does not participate in the scheduling of the slice mapping relation any more, and the slice computing unit is informed to generate a new slice mapping scheme with a smaller intersection with other slice mapping schemes according to the residual topology in the bottom layer physical network to continue to participate in the scheduling.
And the slice mapping unit is used for completing functional mapping according to one of the slice mapping schemes calculated by the slice calculating unit submitted by the slice scheduling unit to generate the network slice.
The slice monitoring unit monitors the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time and guides the dynamic mapping of the slice. When the physical network part fails or the slice mapping fails, the slice monitoring unit feeds back information to the slice computing unit and the slice scheduling unit in time, the slice scheduling unit adopts an unaffected mapping scheme, and the slice computing unit computes a new slice mapping scheme to ensure that the selectable slice mapping schemes are not less than 3; when the user requirement changes, the slice monitoring unit feeds back information to the slice requirement analysis unit in time to generate a new network slice requirement view, and guides the slice calculation unit, the slice scheduling unit and the slice mapping unit to carry out dynamic mapping on the network slices according to the new network slice requirement view. And the information in the physical network is updated according to the actual mapping result, so that the dynamic, efficient and accurate adaptation of network resources and user requirements is achieved, and the user is insensitive to the slice mapping and scheduling process.
After a user controller issues communication requirements, the device performs slice calculation for a user by combining the user requirements and physical network conditions and maps the slice calculation to an underlying network, and then actively or passively completes the operation of remapping the slices when resource congestion or failure occurs in the underlying network structure. The user only needs to acquire the device and generates the special virtual network slice according to the requirement, complex resources and structural changes in an actual physical network do not need to be dealt with, underlying network information does not need to be known, and changes of the underlying network cannot influence user experience.
Through the system operation of the above 5 modules, the invention can realize the non-sensory dynamic mapping of the network slice by the user, effectively improve the stability and the high efficiency of the network slice, facilitate the network manager to deal with the fault in the physical network in time and ensure the effective support of the network slice to each service of the upper layer.
Corresponding to the above-mentioned network slice dynamic mapping apparatus, this embodiment further provides a network slice dynamic mapping method, as shown in fig. 6, including the following steps:
and step S61, receiving the requirement of the user for the network node resource and the link resource, and generating a network slice requirement view.
And step S62, calculating the matching relation between the virtual network slice topology and the physical network topology according to different user service requirements and the bearing capacity of the underlying physical network, and calculating at least three slice mapping schemes.
Step S63, the slice mapping scheme is actively or passively scheduled, and when the user service requirement or the structure of the underlying physical network changes, network function migration and traffic path adjustment are implemented.
And step S64, completing function mapping according to one of the slice mapping schemes calculated by the slice calculating unit submitted by the slice scheduling unit, and generating the network slice.
And step S65, monitoring the change situation of user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping situation in real time, and guiding the dynamic mapping of the slice.
The invention virtualizes the network slice from the physical network according to the specific communication demand, the user can only see the communication subject in the communication demand, only the communication subject needs to be given a communication instruction without knowing the actual communication path, and the actual communication path can be actively or passively scheduled according to the network state so as to deal with the failure condition of the nodes and links in the underlying network.
It is to 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.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it is to be noted that: the above description is only a preferred embodiment of the present invention, and is only used to illustrate the technical solutions of the present invention, and not to limit the protection scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (8)

1. A user-insensitive network slice dynamic mapping device is characterized in that the device is arranged between a virtual network layer where a network slice is located and a bottom physical network, and specifically comprises a slice demand analysis unit, a slice calculation unit, a slice scheduling unit, a slice mapping unit and a slice monitoring unit;
the slice requirement analysis unit receives the requirements of the user on network node resources and link resources and generates a network slice requirement view;
the slice computing unit computes the matching relation between the virtual network slice topology and the physical network topology according to different user service requirements and the bearing capacity of the underlying physical network, and can compute at least three slice mapping schemes;
the slice scheduling unit actively or passively schedules a slice mapping scheme, and realizes network function migration and flow path adjustment when the service requirement of a user or the structure of a bottom physical network changes;
the slice mapping unit is used for completing functional mapping according to one slice mapping scheme calculated by the slice calculating unit submitted by the slice scheduling unit to generate a network slice;
the slice monitoring unit monitors the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time and guides the dynamic mapping of the slice.
2. The device according to claim 1, wherein the slice requirement analysis unit constructs a virtual slice topology according to the requirements of the traffic on transmission bandwidth and processing capacity, and the physical topology corresponding to the virtual slice topology is described in the form of a graph of effective resources of each node and link in the network.
3. The device for dynamically mapping network slices insensitive to users according to claim 2, wherein the slice calculation unit calculates not less than three slice mapping schemes for the network slices based on a principle that a topology intersection between the mapping schemes is minimum after acquiring the virtual slice topology and the real physical topology, and the slice mapping schemes need to consider slice service performance and heterogeneity between the schemes.
4. The user-insensitive network slice dynamic mapping apparatus according to claim 1, wherein the task mode of the slice scheduling unit is divided into two modes, a slice passive scheduling mode and a slice active scheduling mode; the slice passive scheduling mode is suitable for a network with an infrequent change of a topological structure, and the slice active scheduling mode is suitable for a network with a frequent change of a topological structure.
5. The user-insensitive network slice dynamic mapping apparatus of claim 4, wherein the slice passive scheduling mode comprises: when a node corresponding to a certain scheme mapping relation completed by the slice mapping unit fails, the slice monitoring unit acquires the node failure condition and informs the slice computing unit to generate a slice mapping scheme with low path migration cost according to the residual topology in the bottom physical network; or when a link corresponding to a scheme mapping relation completed by the slice mapping unit fails, the slice monitoring unit acquires a link failure condition and informs the slice computing unit to generate a slice mapping scheme with low path migration cost according to the residual topology in the bottom-layer physical network; the slice scheduling unit then selects the slice mapping scheme recalculated by the slice calculation unit and submits it to the slice mapping unit.
6. The user-insensitive network slice dynamic mapping apparatus of claim 4, wherein the slice active scheduling mode comprises: the slice computing unit designs a slice mapping scheme according to the user service requirement to form a plurality of slice mapping schemes, and the selection schemes of the relay node and the link except necessary nodes among the plurality of slice mapping schemes take the minimum intersection as a principle; in the communication process, the slice scheduling unit controls various slice mapping schemes to be dynamically and randomly scheduled at intervals according to a certain probability;
meanwhile, the slice monitoring unit monitors the node and link conditions of the bottom layer physical network in real time, if a node or link corresponding to a certain slice mapping scheme fails, the slice scheduling unit is informed that the scheme does not participate in the scheduling of the slice mapping relation any more, and the slice computing unit is informed to generate a new slice mapping scheme with a smaller intersection with other slice mapping schemes according to the residual topology in the bottom layer physical network to continue to participate in the scheduling.
7. The user-insensitive network slice dynamic mapping apparatus according to claim 1, wherein the slice monitoring unit comprises:
when the physical network part fails or the slice mapping fails, the slice monitoring unit feeds back information to the slice calculating unit and the slice scheduling unit in time to calculate a new slice mapping scheme;
when the user requirement changes, the slice monitoring unit feeds back information to the slice requirement analysis unit in time to generate a new network slice requirement view, and guides the slice calculation unit, the slice scheduling unit and the slice mapping unit to carry out dynamic mapping on the network slices according to the new network slice requirement view.
8. A user-insensitive network slice dynamic mapping method is characterized by comprising the following steps:
receiving the requirements of a user on network node resources and link resources, and generating a network slice requirement view;
according to different user service requirements and the bearing capacity of a bottom physical network, calculating the matching relation between the virtual network slice topology and the physical network topology, and calculating at least three slice mapping schemes;
the slice mapping scheme is actively or passively scheduled, and when the service requirement of a user or the structure of a bottom physical network changes, network function migration and flow path adjustment are realized;
completing functional mapping according to one of the slice mapping schemes calculated by the slice calculating unit submitted by the slice scheduling unit to generate a network slice;
and monitoring the change condition of the user service requirement, the node of the bottom layer physical network, the link condition and the slice mapping condition in real time, and guiding the dynamic mapping of the slices.
CN202110944519.5A 2021-08-17 2021-08-17 User-noninductive network slice dynamic mapping device and method Active CN113810939B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110944519.5A CN113810939B (en) 2021-08-17 2021-08-17 User-noninductive network slice dynamic mapping device and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110944519.5A CN113810939B (en) 2021-08-17 2021-08-17 User-noninductive network slice dynamic mapping device and method

Publications (2)

Publication Number Publication Date
CN113810939A true CN113810939A (en) 2021-12-17
CN113810939B CN113810939B (en) 2023-07-18

Family

ID=78893712

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110944519.5A Active CN113810939B (en) 2021-08-17 2021-08-17 User-noninductive network slice dynamic mapping device and method

Country Status (1)

Country Link
CN (1) CN113810939B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7831943B1 (en) * 2007-04-16 2010-11-09 Xilinx, Inc. Checking for valid slice packing in a programmable device
CN108770016A (en) * 2018-06-04 2018-11-06 北京邮电大学 5G end to end network slice generation method based on template and device
CN108965024A (en) * 2018-08-01 2018-12-07 重庆邮电大学 A kind of virtual network function dispatching method of the 5G network slice based on prediction
CN109067579A (en) * 2018-08-01 2018-12-21 重庆邮电大学 Towards the 5G network slice topology design of bottom layer node failure and reliable mapping method
US20190166039A1 (en) * 2017-11-27 2019-05-30 Beijing University Of Posts & Telecommunications Method and apparatus for network slice deployment in mobile communication system
CN110662231A (en) * 2019-09-25 2020-01-07 南京优速网络科技有限公司 Network slice resource adjusting method and system for 5G environment
CN110958133A (en) * 2019-11-01 2020-04-03 北京邮电大学 Network slice mapping method, device, server and storage medium
EP3713370A1 (en) * 2019-03-19 2020-09-23 Comcast Cable Communications Management, LLC Wireless communications for communication setup/response
CN113259177A (en) * 2021-06-17 2021-08-13 国网江苏省电力有限公司信息通信分公司 Reconstruction method and device of virtual network slice

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7831943B1 (en) * 2007-04-16 2010-11-09 Xilinx, Inc. Checking for valid slice packing in a programmable device
US20190166039A1 (en) * 2017-11-27 2019-05-30 Beijing University Of Posts & Telecommunications Method and apparatus for network slice deployment in mobile communication system
CN108770016A (en) * 2018-06-04 2018-11-06 北京邮电大学 5G end to end network slice generation method based on template and device
CN108965024A (en) * 2018-08-01 2018-12-07 重庆邮电大学 A kind of virtual network function dispatching method of the 5G network slice based on prediction
CN109067579A (en) * 2018-08-01 2018-12-21 重庆邮电大学 Towards the 5G network slice topology design of bottom layer node failure and reliable mapping method
EP3713370A1 (en) * 2019-03-19 2020-09-23 Comcast Cable Communications Management, LLC Wireless communications for communication setup/response
CN110662231A (en) * 2019-09-25 2020-01-07 南京优速网络科技有限公司 Network slice resource adjusting method and system for 5G environment
CN110958133A (en) * 2019-11-01 2020-04-03 北京邮电大学 Network slice mapping method, device, server and storage medium
CN113259177A (en) * 2021-06-17 2021-08-13 国网江苏省电力有限公司信息通信分公司 Reconstruction method and device of virtual network slice

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
ABDELQUODDOUSS LAGHRISSI;: "Conformal Mapping for Optimal Network Slice Planning Based on Canonical Domains", IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS *
唐伦;赵国繁;杨恒;赵培培;陈前斌;: "基于可靠性的5G网络切片在线映射算法", 电子与信息学报, no. 08 *
孙士清;彭建华;游伟;李英乐;: "5G网络下资源感知的服务功能链协同构建和映射算法", 西安交通大学学报, no. 08 *
潘志伟;: "基于SDN的网络切片中资源动态调整的方法", 软件, no. 12 *

Also Published As

Publication number Publication date
CN113810939B (en) 2023-07-18

Similar Documents

Publication Publication Date Title
US11805073B2 (en) Controlling placement of workloads of an application within an application environment
US8589543B2 (en) Virtual data center monitoring
CN113709048A (en) Routing information sending and receiving method, network element and node equipment
US8589558B2 (en) Method and system for efficient deployment of web applications in a multi-datacenter system
US7558859B2 (en) Peer-to-peer auction based data distribution
Balasangameshwara et al. Performance-driven load balancing with a primary-backup approach for computational grids with low communication cost and replication cost
CN109167674B (en) Service node scoring method, Domain Name System (DNS) scheduling method and server
US7856572B2 (en) Information processing device, program thereof, modular type system operation management system, and component selection method
US11356338B2 (en) Dynamic inter-cloud placement of virtual network functions for a slice
US20060190602A1 (en) Monitoring for replica placement and request distribution
US11329901B2 (en) Dynamic inter-cloud placement of virtual network functions for a slice
CN110308995A (en) A kind of edge cloud computing service system edges cloud node deployment device
US10445167B1 (en) Automated method and system for diagnosing load performance issues
US9923785B1 (en) Resource scaling in computing infrastructure
CN114095075A (en) Optical network fault recovery method based on service customization demand perception
Wang et al. Infrastructure-efficient virtual-machine placement and workload assignment in cooperative edge-cloud computing over backhaul networks
CN113810939A (en) User-insensitive network slice dynamic mapping device and method
CN113543160A (en) 5G slice resource allocation method and device, computing equipment and computer storage medium
JP7360036B2 (en) Information processing device, information processing system, information processing method and program
Inoue et al. Adaptive VNE method based on Yuragi principle for software defined infrastructure
Intharawijitr et al. Simulation study of low-latency network model with orchestrator in MEC
KR20210056163A (en) Resource management apparatus and method for slice
CN105847172B (en) Job flow control method and device
CN113973092B (en) Link resource scheduling method, device, computing equipment and computer storage medium
US11924053B2 (en) Intelligent infrastructure management in a cloud radio access network

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