Deterministic Latency Bounded Network Slice Deployment in IP-Over-WDM Based Metro-Aggregation Networks

Abstract

As a critical enabler of the next generation networks, network slicing can dynamically and flexibly create virtual networks leveraging necessary network resources for services with different quality of service (QoS) requirements. To satisfy the strict QoS requirements of some vertical industries, e.g., industry automation, the Deterministic Networking (DetNet) concept has been recently proposed to investigate deterministic service provisioning with bounds on service latency, loss, and jitter. A critical issue for providing deterministic services is how to allocate the right amount of resources that ensures the QoS requirements within a network slice. In this paper, we first obtain the amount of network resources needed for a network slice, using the stochastic network calculus (SNC) method, to ensure the end-to-end latency requirement under specific traffic demands. We then study the network slice deployment problem in an IP-over-WDM (wavelength division multiplexing) metro aggregation network and propose a heuristic with three different objectives: minimizing traffic hops, minimizing lightpaths and minimizing wavelengths, which can help network service provider to optimize network deployment under different considerations. The simulation results show the comparison of the resource utilization under different strategies.

Deep Reinforcement Learning-Based Deterministic Routing and Scheduling for Mixed-Criticality Flows

“…The authors in [10] present a formulation in the integer linear programming (ILP) framework which models the joint routing and scheduling problem for flows of periodic real-time transmissions in converged TSN networks. Network calculusbased flow routing and bandwidth allocation in IP-over-WDM architecture is also investigated to achieve the deterministic data delivery in metro-aggregation networks [11]. The authors in [3] also focus on the joint routing and scheduling problem in large-scale deterministic networks using CSQF to maximize traffic acceptance for network planning and online flow admission.…”

Deterministic Service Function Chaining over Beyond 5G Edge Fabric

“…We set the simulation time as 1000 time units. For each SFC request, the resource block N k , data rate λ k (Mbps), and memory(GB) are set as randomly distributed value within [50, 100], [20,200] and [1,8], respectively [21].…”

“…First, due to the finite physical resources (e.g., bandwidth, memory and CPU) in the network, the optimal resource allocation and path selection should be performed optimally to achieve higher resource efficiency and to avoid resource bottleneck. Second, how to ensure that the service latency is bounded within a deterministic scope also remains a problem yet to be solved [8]. It is desirable to design a joint resource allocation and SFC placement algorithm for deterministic latency assurance due to the above challenges.…”

TopoTrust: A Blockchain-based Trustless and Secure Topology Discovery in SDNs

“…Software-Defined Networking (SDN) came as a response to the rapid increase in network complexity and the emergence of new technologies that require on-demand and applicationspecific network resource allocation, such as Deterministic Networks (DetNet) [1] and 5G networks. The aim of SDN is to simplify the provisioning and distribution of those resources, thus reducing the capital and operational expenditure [2].…”