Availability is a key service metric when deploying service function chains (SFCs) over network slices in 5G networks. We study the problem of determining the composition of a slice for a service function chain and the mapping of the slice to the physical transport network in a way that guarantees availability of the SFC while minimizing cost. To improve the availability, we design a slice that provides multiple paths (possibly with non-disjoint routing over the physical infrastructure) for hosting SFCs, and we determine the appropriate dimensioning of bandwidth on each path. Our simulation results show the effectiveness of our approach in terms of the cost of establishing the SFC and the SFC acceptance ratio.
Towards Efficiently Provisioning 5G Core Network Slice Based on Resource and Topology Attributes
Efficient provisioning of 5G network slices is a major challenge for 5G network slicing technology. Previous slice provisioning methods have only considered network resource attributes and ignored network topology attributes. These methods may result in a decrease in the slice acceptance ratio and the slice provisioning revenue. To address these issues, we propose a two-stage heuristic slice provisioning algorithm, called RT-CSP, for the 5G core network by jointly considering network resource attributes and topology attributes in this paper. The first stage of our method is called the slice node provisioning stage, in which we propose an approach to scoring and ranking nodes using network resource attributes (i.e., CPU capacity and bandwidth) and topology attributes (i.e., degree centrality and closeness centrality). Slice nodes are then provisioned according to the node ranking results. In the second stage, called the slice link provisioning stage, the k-shortest path algorithm is implemented to provision slice links. To further improve the performance of RT-CSP, we propose RT-CSP+, which uses our designed strategy, called minMaxBWUtilHops, to select the best physical path to host the slice link. The strategy minimizes the product of the maximum link bandwidth utilization of the candidate physical path and the number of hops more »
- Award ID(s):
- 1718929
- Publication Date:
- NSF-PAR ID:
- 10258042
- Journal Name:
- Applied Sciences
- Volume:
- 9
- Issue:
- 20
- Page Range or eLocation-ID:
- 4361
- ISSN:
- 2076-3417
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In this work, we consider the network slice composition problem for Service Function Chains (SFCs), which addresses the issue of allocating bandwidth and VNF resources in a way that guarantees the availability of the SFC while minimizing cost. For the purpose of satisfying the availability requirement of the SFC, we adapt a traffic-weighted availability model which ensures that the long-term fraction of traffic supported by the slice topology remains above a desired threshold. We propose a method for composing a single or multi-path slice topology and for properly dimensioning VNF replicas and bandwidth on the slice paths. Through simulations, we show that our proposed algorithm can reduce the total cost of establishment compared to a dedicated protection approach in 5G networks.
-
This paper addresses a routing selection strategy for elastic network slices that dynamically adjust required resources over time. When admitting elastic initial slice requests, sufficient spare resources on the same path should be reserved to allow existing elastic slices to increase their bandwidth dynamically. We demonstrate a deep Reinforcement Learning (RL) model to intelligently make routing choice decisions for elastic slice requests and inelastic slice requests. This model achieves higher revenue and higher acceptance rates compared to traditional heuristic methods. Due to the lightness of this model, it can be deployed in an embedded system. We can also use a relatively small amount of data to train the model and achieve stable performance. Also, we introduce a Recurrent Neural Network to auto-encode the variable-size environment and train the encoder together with the RL model.
-
Networked data involve complex information from multifaceted channels, including topology structures, node content, and/or node labels etc., where structure and content are often correlated but are not always consistent. A typical scenario is the citation relationships in scholarly publications where a paper is cited by others not because they have the same content, but because they share one or multiple subject matters. To date, while many network embedding methods exist to take the node content into consideration, they all consider node content as simple flat word/attribute set and nodes sharing connections are assumed to have dependency with respect to all words or attributes. In this paper, we argue that considering topic-level semantic interactions between nodes is crucial to learn discriminative node embedding vectors. In order to model pairwise topic relevance between linked text nodes, we propose topical network embedding, where interactions between nodes are built on the shared latent topics. Accordingly, we propose a unified optimization framework to simultaneously learn topic and node representations from the network text contents and structures, respectively. Meanwhile, the structure modeling takes the learned topic representations as conditional context under the principle that two nodes can infer each other contingent on the shared latent topics.more »
-
Network embedding has attracted a surge of attention in recent years. It is to learn the low-dimensional representation for nodes in a network, which benefits downstream tasks such as node classification and link prediction. Most of the existing approaches learn node representations only based on the topological structure, yet nodes are often associated with rich attributes in many real-world applications. Thus, it is important and necessary to learn node representations based on both the topological structure and node attributes. In this paper, we propose a novel deep attributed network embedding approach, which can capture the high non-linearity and preserve various proximities in both topological structure and node attributes. At the same time, a novel strategy is proposed to guarantee the learned node representation can encode the consistent and complementary information from the topological structure and node attributes. Extensive experiments on benchmark datasets have verified the effectiveness of our proposed approach.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Publisher's Version of Record
- https://doi.org/10.3390/app9204361
