CN107566194B - Method for realizing cross-domain virtual network mapping - Google Patents
Method for realizing cross-domain virtual network mapping Download PDFInfo
- Publication number
- CN107566194B CN107566194B CN201710986489.8A CN201710986489A CN107566194B CN 107566194 B CN107566194 B CN 107566194B CN 201710986489 A CN201710986489 A CN 201710986489A CN 107566194 B CN107566194 B CN 107566194B
- Authority
- CN
- China
- Prior art keywords
- virtual
- node
- network
- physical
- domain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method for realizing cross-domain virtual network mapping, belonging to the technical field of communication. In the method, after a user generates a service request, a service provider initiates the construction of a multi-domain virtual network request, and selects a proper node and path in a bottom layer cross-domain converged network to bear the resource requirement of the multi-domain virtual network request. The method comprises the steps of analyzing a virtual network request and local and global topological attributes of nodes in a bottom layer physical network, combining network local resource attributes, establishing a node multi-attribute evaluation model by adopting an improved principal component analysis method, measuring the priority of the nodes in the mapping process by utilizing an approximate ideal solution sorting method based on the evaluation model, analyzing bottom layer link load pressure distribution, selecting a bearing path with sufficient resources for a virtual link, better utilizing bottom layer multi-domain network resources, improving the construction success rate of the multi-domain virtual network request, increasing the network profit-cost ratio, effectively improving the resource distribution balance and reducing the network mapping delay.
Description
Technical Field
The invention belongs to the technical field of communication, and relates to a method for realizing cross-domain virtual network mapping.
Background
The cross-domain bottom physical network consists of a heterogeneous wireless access network, an optical network backbone network and a data center network. Different network layers have different physical network resources, such as wireless frequency domain and time domain two-dimensional resource block resources, wireless backhaul bandwidth resources, optical fiber spectrum resources, IT computing resources and the like, communication technologies in the layers are different from one another, and the traditional network architecture is independent, closed and inflexible among the layers and cannot meet the requirements of 5G services. How to implement inter-layer cooperation of cross-domain underlying network facilities and uniform management of physical network resources is a key challenge facing current research.
The cross-domain and cross-technology network virtualization technology provides an efficient management mode for the current cross-domain underlying network, and the underlying multi-domain network resources are abstracted to form a physical resource sharing pool, so that unified management and scheduling of the physical multi-domain network resources can be realized, and effective fusion and coexistence of the cross-domain underlying network can be realized. The management of the bottom multi-domain network resources is facilitated while different service requirements of users are met, and the utilization rate of the bottom multi-domain network resources is improved.
At present, research on the mapping problem of the cross-domain virtual network is less, so that the technical problem which needs to be solved urgently is to realize the 5G network by deeply analyzing the topological attribute and the resource attribute in the cross-domain fusion network environment and realizing efficient mapping of the virtual network and effective utilization of underlying network resources.
Disclosure of Invention
In view of this, an object of the present invention is to provide a method for implementing cross-domain virtual network mapping, which can measure mapping importance of a virtual network request and a bottom physical network based on topology attributes and resource attributes of the network during mapping, thereby improving construction power of the cross-domain virtual network request and efficient utilization of multi-domain network resources.
In order to achieve the purpose, the invention provides the following technical scheme:
a method for implementing cross-domain virtual network mapping, the method comprising the steps of:
s1: constructing a cross-domain virtual network mapping model;
s2: calculating a topology attribute value and a resource attribute value of a node in the current network according to a cross-domain virtual network mapping model, determining a node multi-attribute evaluation model, and reflecting a network load distribution condition by defining a link resource unit price;
s3: and selecting an optimal bottom layer node for the virtual node to be deployed, and then selecting an optimal bottom layer path for the virtual link to be deployed based on the bearing physical node of the virtual node, so as to complete the node mapping process and the link mapping process.
Further, the cross-domain virtual network mapping model in step S1 includes a bottom layer cross-domain converged network model and a multi-domain virtual network request model;
the bottom layer cross-domain fusion network model is as follows: the underlying cross-domain converged network is marked as a weighted undirected graphWherein N isSRepresenting a set of underlying physical nodes, including a heterogeneous radio access network node setBackbone network switching node setAnd data center node setAnd isLSRepresenting a set of underlying physical links, including a set of wireless backhaul linksAnd aggregation of optical fiber physical linksAnd is Andrespectively represent the underlying physical nodes nSAnd the underlying physical link lSHas an attribute of, and nS∈NS,lS∈LS;
Multi-domain virtual network requests marked as weighted undirected graphsWherein N isVAs a collection of virtual nodes, i.e.LVAs a set of virtual links, i.e. Andrespectively representing virtual nodes nVWith virtual links lVA resource request of, and nV∈NV,lV∈LV;
The loop-free paths of all underlying networks are marked PS;
Resource request by virtual node taking into account channel resource request RB (n) by virtual radio access network nodeV) Computing resource requirement CPU (n) of virtual backbone network switching node and virtual data center nodeV) Geographic location L oc (n)V) And a mappable range D (n) of each virtual nodeV) The resource request of a virtual link takes into account the bandwidth resource requirement BW (l) of the virtual linkV);
For a multi-domain virtual network request, represented as a triplet VNR(k)(GV,ta,td) Wherein t isaIndicating the time of generation of a multi-domain virtual network request, tdRepresenting the time that the multi-domain virtual network request lasts in the underlying network;
the virtual request mapping needs to satisfy the following resource constraints:
dis(loc(nV),loc(nS))≤D(nV)
where dis (i, j) denotes the distance between two nodes, D (n)V) As mappable ranges of virtual nodes, cpuV(n) CPU, the size of the resource request of the virtual nodeSAnd (n) is the available resource amount size of the physical node.
Further, the bottom layer physical node nSHas the attribute that the heterogeneous wireless access network node can use frequency domain and time domain two-dimensional resource block resourcesBackbone network switching node available computing resourceData center node available computing resourcesAnd isIn addition, the geographic location L oc (n) of the physical node is also includedS);
The underlying physical link lSHaving attributes including available bandwidth resources for wireless backhaul linksAnd available spectrum resources of the optical fiber physical linkAnd is
Further, the node mapping process of step S3 includes the steps of:
s301 a: calculating the value of a virtual node and a median center value, then establishing a node multi-attribute evaluation model by combining the node resource demand and the node local bandwidth resource demand, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority value of the virtual node by approaching an ideal solution algorithm, arranging all the virtual nodes in a descending order according to the mapping priority value, and selecting the virtual node with the largest priority value for mapping;
s302 a: calculating a standby physical node set of the selected virtual nodes, calculating the values and the compact center values of all physical nodes in the standby physical node set according to the physical network topology, then establishing a node multi-attribute evaluation model by combining the available resource quantity of the nodes and the local available bandwidth resource quantity of the nodes, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority values of the physical nodes by an approximate ideal solution algorithm, and sorting all the physical nodes in a descending order according to the mapping priority values;
s303 a: selecting a physical node with the largest mapping priority value to deploy the selected virtual node;
step S3 the link mapping process includes the steps of:
s301 b: calculating a link resource cost coefficient according to the link resources available in the physical network;
s302 b: determining bottom layer bearing nodes corresponding to virtual nodes at two ends of a virtual link, taking a link resource cost coefficient as a weight, finding K shortest paths between two physical nodes by adopting a K shortest path algorithm, and selecting a bottom layer path with the minimum link hop number and the path bandwidth meeting the virtual link bandwidth resource request in a standby path to complete the deployment of the corresponding virtual link.
The invention has the beneficial effects that: the cross-domain virtual network mapping method provided by the invention is used for carrying out local and global analysis on the topological connection relation between the nodes in the physical network and the virtual network by combining with the local available physical resources of the underlying network, establishing a new node multi-attribute evaluation model by using a principal component analysis method, measuring the priority of the nodes in the mapping process by a TOPSIS method based on the model, and providing a cross-domain virtual network mapping algorithm based on the network available resources and the dynamic topological attributes. In the link mapping process, the load pressure distribution of the bottom link is analyzed, the link mapping cost is reduced, and the mapping success rate and the mapping benefit of the subsequent multi-domain virtual network are effectively improved.
Drawings
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
FIG. 1 is a cross-domain converged network mapping architecture diagram of the present invention;
FIG. 2 is an exemplary diagram of node centrality;
FIG. 3 is a flow chart of the present invention.
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
1 constructing cross-domain virtual network mapping model
As shown in fig. 1 and 2, the cross-domain virtual network mapping model includes an underlying cross-domain converged network model and a multi-domain virtual network request model. The underlying cross-domain converged network can be marked as a weighted undirected graphWherein N isSRepresenting a set of underlying physical nodes, including a heterogeneous radio access network node setBackbone network switching node setAnd data center node setAnd isLSRepresenting a set of underlying physical links, including a set of wireless backhaul linksAnd aggregation of optical fiber physical linksAnd is Andrespectively represent the underlying physical nodes nS(nS∈NS) With the underlying physical link lS(lS∈LS) The attribute it has. Physical node nSHas the attribute that the heterogeneous wireless access network node can use frequency domain and time domain two-dimensional resource block resourcesBackbone network switching node available computing resourceData center node available computing resourcesAnd isIn addition, the geographic location L oc (n) of the physical node is also includedS) Etc. and the physical link lSThe attributes of (1) include available bandwidth resources of the wireless backhaul linkAnd available spectrum resources of the optical fiber physical linkAnd isThe loop-free paths of all underlying networks can be labeled as PS。
Multi-domain virtual network requests marked as weighted undirected graphsWherein N isVAs a collection of virtual nodes, i.e.LVIs a set of virtual links that are,namely, it is Andrespectively representing virtual nodes nV(nV∈NV) With virtual links lV(lV∈LV) The resource request of (2). In general, the resource request of the virtual node mainly takes into account the channel resource request RB (n) of the virtual radio access network nodeV) Computing resource requirements CPU (n) of virtual backbone network switching node and virtual data center nodeV) And geographic location L oc (n)V) Mappable range D (n) of each virtual nodeV) The resource request of the virtual link mainly considers the bandwidth resource requirement BW (l) of the virtual linkV). For a multi-domain virtual network request, this may be represented as a triplet VNR(k)(GV,ta,td) Wherein t isaIndicating the time of generation of a multi-domain virtual network request, tdIndicating the time that the multi-domain virtual network request lasts in the underlying network.
The virtual request mapping needs to satisfy the following resource constraints:
dis(loc(nV),loc(nS))≤D(nV)
where dis (i, j) denotes the distance between two nodes, cpuV(n) mappable extent of a virtual node, cpuV(n) CPU, the size of the resource request of the virtual nodeSAnd (n) is the available resource amount size of the physical node.
2 System analysis
The node local bandwidth resource is the sum of the bandwidth resources on all links connected to the node divided by the number of contiguous links.
For each underlying node N ∈ NSThe local bandwidth resources of the nodes are as follows:
in order to reflect the resource allocation situation of the physical link, the unit resource cost of the physical link is defined as the reciprocal of the size of the residual bandwidth resource, and the unit resource cost coefficient of the physical link with more available resources is small.
η adjusts the weight coefficient to adjust the value of the resource cost coefficient, the value of the invention is 1.
3 mapping basic step
FIG. 3 shows a flow chart of the present invention.
3.1 node mapping procedure
Firstly, a physical node set which can be mapped in respective range is found for two virtual nodes, namely dis (loc (n) is satisfiedV),loc(nS))≤D(nV) And (4) conditions.
Calculating the value of the virtual node and the value of the median center according to the virtual network request topology, then establishing a node multi-attribute evaluation model by combining the node resource demand and the node local bandwidth resource demand, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority value of the virtual node by approaching an ideal solution algorithm, arranging all the virtual nodes in a descending order according to the mapping priority value, and selecting the virtual node with the largest priority value for mapping.
Calculating a standby physical node set of the selected virtual nodes, calculating the values and the compact centrality values of all physical nodes in the standby physical node set according to the physical network topology, then establishing a node multi-attribute evaluation model by combining the node available resource quantity and the node local available bandwidth resource quantity, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority values of the physical nodes by an approximate ideal solution algorithm, arranging all the physical nodes in a descending order according to the mapping priority values, and selecting the physical node with the largest priority value for deployment.
3.2 Link mapping procedure
And after the deployment of all the virtual nodes in the request is completed, starting the mapping processing of the virtual link. In the physical path selection process, a link bandwidth resource cost coefficient is taken as a weight, a K-shortest path algorithm is adopted, and a physical path with available bandwidth meeting the bandwidth requirement in the request is selected as a bearing path of the virtual link. If the path bandwidth meets the resource requirement of the virtual link, the mapping is successful, and the size of the available resource is updated; otherwise the link mapping fails.
(1) The multi-domain virtual network requests which need to be subjected to network mapping are arranged in a descending order according to the size of the mapping income, namely the multi-domain virtual network requests with large income are preferentially mapped;
(2) according to a set mapping period, sequentially extracting multi-domain virtual network requests with the maximum profit from the queue in the step (1) for mapping; if a multi-domain virtual network request fails to be mapped in the mapping period, the multi-domain virtual network request is discarded.
The inventor carries out a large number of simulation experiments on the method provided by the invention, and the experimental results prove that the method provided by the invention is effective and can improve the mapping success rate of the multi-domain virtual network request.
Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.
Claims (3)
1. A method for realizing cross-domain virtual network mapping is characterized in that: the method comprises the following steps:
s1: constructing a cross-domain virtual network mapping model;
s2: calculating a topology attribute value and a resource attribute value of a node in the current network according to a cross-domain virtual network mapping model, determining a node multi-attribute evaluation model, and reflecting a network load distribution condition by defining a link resource unit price;
s3: selecting an optimal bottom layer physical node for the virtual node to deploy, then selecting an optimal bottom layer physical path for the virtual link to deploy based on the bearing physical node of the virtual node, and completing a node mapping process and a link mapping process;
the cross-domain virtual network mapping model in the step S1 includes a bottom layer cross-domain converged network model and a multi-domain virtual network request model;
the bottom layer cross-domain fusion network model is as follows: the underlying cross-domain converged network is marked as a weighted undirected graphWherein N isSRepresenting a set of underlying physical nodes, including a heterogeneous radio access network node setBackbone network switching node setAnd data center node setAnd isLSRepresenting a set of underlying physical links, including a set of wireless backhaul linksAnd aggregation of optical fiber physical linksAnd is Andrespectively represent the underlying physical nodes nSAnd the underlying physical link lSHas an attribute of, and nS∈NS,lS∈LS;
For virtual heterogeneous wireless access node bonding,a set of switching nodes for a virtual backbone network,a set of virtual data center nodes;for a set of virtual wireless backhaul links,is a virtual optical fiber physical link set;
multi-domain virtual network requests marked as weighted undirected graphsWherein N isVAs a collection of virtual nodes, i.e.LVAs a set of virtual links, i.e. Andrespectively representing virtual nodes nVWith virtual links lVA resource request of, and nV∈NV,lV∈LV;
The loop-free paths of all underlying networks are marked PS;
Resource request by virtual node taking into account channel resource request RB (n) by virtual radio access network nodeV) Computing resource requirement CPU (n) of virtual backbone network switching node and virtual data center nodeV) Geographic location L oc (n)V) And a mappable range D (n) of each virtual nodeV) The resource request of a virtual link takes into account the bandwidth resource requirement BW (l) of the virtual linkV);
For a multi-domain virtual network request, represented as a triplet VNR(k)(GV,ta,td) Wherein t isaIndicating the time of generation of a multi-domain virtual network request, tdRepresenting the time that the multi-domain virtual network request lasts in the underlying network; k represents the kth VNR;
the virtual request mapping needs to satisfy the following resource constraints:
dis(loc(nV),loc(nS))≤D(nV)
where dis (i, j) denotes the distance between two nodes, D (n)V) As mappable ranges of virtual nodes, cpuV(n) CPU, the size of the resource request of the virtual nodeS(n) is the size of the available resource amount of the physical node; loc represents the geographic coordinate value of the node.
2. The method of claim 1, wherein the method comprises: the bottom layer physical node nSHas the attribute that the heterogeneous wireless access network node can use frequency domain and time domain two-dimensional resource block resourcesBackbone network switching node available computing resourceData center node available computing resourcesAnd isIn addition, the geographic location L oc (n) of the physical node is also includedS);
3. The method of claim 1, wherein the method comprises: step S3 the node mapping process includes the steps of:
s301 a: calculating the value of a virtual node and a median center value, then establishing a node multi-attribute evaluation model by combining the node resource demand and the node local bandwidth resource demand, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority value of the virtual node by approaching an ideal solution algorithm, arranging all the virtual nodes in a descending order according to the mapping priority value, and selecting the virtual node with the largest priority value for mapping;
s302 a: calculating a standby physical node set of the selected virtual nodes, calculating the values and the compact center values of all physical nodes in the standby physical node set according to the physical network topology, then establishing a node multi-attribute evaluation model by combining the available resource quantity of the nodes and the local available bandwidth resource quantity of the nodes, obtaining a new principal component index by using a principal component analysis method based on the evaluation model, calculating the mapping priority values of the physical nodes by an approximate ideal solution algorithm, and sorting all the physical nodes in a descending order according to the mapping priority values;
s303 a: selecting a physical node with the largest mapping priority value to deploy the selected virtual node;
step S3 the link mapping process includes the steps of:
s301 b: calculating a link resource cost coefficient according to the link resources available in the physical network;
s302 b: determining bottom layer bearing physical nodes corresponding to virtual nodes at two ends of a virtual link, taking a link resource cost coefficient as a weight, finding K shortest paths between the two physical nodes by adopting a K-shortest path algorithm, and selecting the bottom layer physical path with the minimum link hop number and the path bandwidth meeting the virtual link bandwidth resource request in the K shortest paths to complete the deployment of the corresponding virtual link.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710986489.8A CN107566194B (en) | 2017-10-20 | 2017-10-20 | Method for realizing cross-domain virtual network mapping |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710986489.8A CN107566194B (en) | 2017-10-20 | 2017-10-20 | Method for realizing cross-domain virtual network mapping |
Publications (2)
Publication Number | Publication Date |
---|---|
CN107566194A CN107566194A (en) | 2018-01-09 |
CN107566194B true CN107566194B (en) | 2020-07-31 |
Family
ID=60986715
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710986489.8A Active CN107566194B (en) | 2017-10-20 | 2017-10-20 | Method for realizing cross-domain virtual network mapping |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107566194B (en) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108092824B (en) * | 2018-01-15 | 2020-05-01 | 淮阴师范学院 | Control system diagnosis method based on complex dynamic network |
CN108270684B (en) * | 2018-01-25 | 2021-03-30 | 重庆邮电大学 | Time-frequency joint fragment sensing resource equalization virtual optical network mapping method |
CN108377220B (en) * | 2018-02-27 | 2020-10-02 | 重庆邮电大学 | Transparent virtual optical network collaborative mapping method for sensing node importance |
CN109067579B (en) * | 2018-08-01 | 2021-05-04 | 重庆邮电大学 | 5G network slice topology design and reliable mapping method for failure of bottom node |
CN108989122B (en) * | 2018-08-07 | 2019-04-16 | 北京邮电大学 | Virtual network requests mapping method, device and realization device |
CN110035336B (en) * | 2019-04-11 | 2021-11-09 | 重庆邮电大学 | Routing fiber core frequency spectrum allocation method of space division multiplexing elastic optical network |
CN110224918A (en) * | 2019-05-17 | 2019-09-10 | 西安交通大学 | A kind of cross-domain SDN mapping method of virtual network |
CN110232486B (en) * | 2019-06-26 | 2023-03-21 | 哈尔滨理工大学 | Multi-workshop comprehensive scheduling method based on K shortest path |
CN110290435B (en) * | 2019-07-31 | 2022-03-08 | 国网河北省电力有限公司邢台供电分公司 | Optical fiber network management method and device and terminal equipment |
CN112688848B (en) * | 2020-12-17 | 2021-12-21 | 北京邮电大学 | Heterogeneous virtual network mapping method and system |
CN112685209B (en) * | 2020-12-24 | 2023-02-17 | 国网河南省电力公司信息通信公司 | Virtual resource overhaul service fault recovery method and system |
CN112953761B (en) * | 2021-01-26 | 2022-10-25 | 中国电子科技集团公司第七研究所 | Virtual-real resource mapping method for virtual network construction in multi-hop network |
CN113099328B (en) * | 2021-04-07 | 2023-03-14 | 重庆邮电大学 | Resource allocation method of multi-core elastic optical network based on node and crosstalk perception |
CN114422375B (en) * | 2021-12-10 | 2024-04-30 | 国网河南省电力公司 | Virtual network resource allocation method, device, medium and program product |
CN114697222B (en) * | 2022-03-22 | 2023-06-20 | 西安交通大学 | Survivability virtual network mapping algorithm based on space-time-ground fusion network |
CN115361295B (en) * | 2022-08-24 | 2023-07-07 | 广东电网有限责任公司 | TOPSIS-based resource backup method, device, equipment and medium |
CN116582451B (en) * | 2023-07-13 | 2023-11-21 | 三峡科技有限责任公司 | Communication operation method combining elastic communication network with virtualization technology |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104320343A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Electric energy perception cross-domain virtual network mapping method and system |
US20150046592A1 (en) * | 2013-08-07 | 2015-02-12 | Nec Laboratories America, Inc. | Network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks |
CN104468308A (en) * | 2014-10-29 | 2015-03-25 | 北京邮电大学 | Cross-domain virtual network mapping method and system based on particle swarm optimization |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104717098B (en) * | 2015-04-09 | 2017-12-29 | 北京邮电大学 | A kind of data processing method and device |
-
2017
- 2017-10-20 CN CN201710986489.8A patent/CN107566194B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150046592A1 (en) * | 2013-08-07 | 2015-02-12 | Nec Laboratories America, Inc. | Network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks |
CN104320343A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Electric energy perception cross-domain virtual network mapping method and system |
CN104468308A (en) * | 2014-10-29 | 2015-03-25 | 北京邮电大学 | Cross-domain virtual network mapping method and system based on particle swarm optimization |
Non-Patent Citations (1)
Title |
---|
高效用低电能开销的虚拟网络映射算法研究;张忠宝;《中国博士学位论文全文库》;20150430;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN107566194A (en) | 2018-01-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107566194B (en) | Method for realizing cross-domain virtual network mapping | |
Sundararaj | Optimal task assignment in mobile cloud computing by queue based ant-bee algorithm | |
Nguyen et al. | Cooperative task offloading and block mining in blockchain-based edge computing with multi-agent deep reinforcement learning | |
Yang et al. | Data-driven network slicing from core to RAN for 5G broadcasting services | |
Chamola et al. | An optimal delay aware task assignment scheme for wireless SDN networked edge cloudlets | |
CN113810205B (en) | Service computing power information reporting and receiving method, server and data center gateway | |
Huang et al. | Software-defined QoS provisioning for fog computing advanced wireless sensor networks | |
CN107277832A (en) | A kind of mapping method of wireless dummy network | |
JP2018523442A (en) | Software defined topology for user plane (SDT) | |
CN106341893A (en) | Resource distribution method and apparatus | |
Ebrahimzadeh et al. | Cooperative computation offloading in FiWi enhanced 4G HetNets using self-organizing MEC | |
CN109347657B (en) | Method for constructing virtual data domain of scientific and technological service under SDN mode | |
CN115632939B (en) | Automatic network selection and routing method for achieving multi-target achievement of computational power network | |
CN115665227B (en) | Universal heterogeneous integrated computing network resource intelligent adaptation network architecture and method | |
CN105530312A (en) | Network service path selection system and selection method | |
Eghbali et al. | Bandwidth allocation and pricing for SDN-enabled home networks | |
Bera et al. | Mobility-aware flow-table implementation in software-defined IoT | |
Shi et al. | Hierarchical auction and dynamic programming based resource allocation (HA&DP-RA) algorithm for 5G RAN slicing | |
Li et al. | A distributed ADMM approach with decomposition-coordination for mobile data offloading | |
Lovén et al. | Weathering the reallocation storm: Large-scale analysis of edge server workload | |
JP2022503762A (en) | Cellular telecommunications network | |
Yang et al. | Towards 6g joint haps-mec-cloud 3c resource allocation for delay-aware computation offloading | |
Happ et al. | On the impact of clustering for IoT analytics and message broker placement across cloud and edge | |
Baktir et al. | Addressing the challenges in federating edge resources | |
CN108833162B (en) | Network node sequencing method and virtual network mapping method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |