Resource Provisioning for a Multi-Layered Network

Abstract

Given the growth, complexity, and size of the Internet, new methodologies are needed to support cost-effective resource provisioning. This paper provides a cost-based polynomial-time heuristic algorithm for resource provisioning optimization called multi-layered market algorithm (MMA). The MMA is solvable for multi-layered, multi-technology, and practical-sized networks, where the traffic is modeled as a combination of constant bit-rate and variable bit-rate (VBR) traffic streams. A VBR stream is modeled either by a Gaussian process or by a Poisson Pareto burst process (PPBP) which under certain parameter values is long-range dependent-a known characteristic of the Internet traffic streams. The consideration of VBR traffic models in a multi-layered network optimization is a key novel aspect of MMA. The MMA considers a range of transport technologies operating in layers and traffic sharing schemes. The MMA implements flow-size-based routing where flows according to their sizes are routed independently. As routing affects resource requirement, such considerations are important for resource provisioning by the given cost models. The complexity resulting from these considerations, including layering and PPBP traffic, requires a simplified design philosophy which in this paper, is based on adopting the shortest path routing in each layer. This is achieved by MMA which is based on an iterative algorithm, and resource provisioning that is performed link-by-link in all layers. As a benchmark for MMA, we provide an integer linear programming (ILP) formulation for a multi-layered network optimization problem with fixed end-toend demands. The MMA is validated by comparing its solutions to those ILP results in different variants of a six-node network, and its software is verified using double-entry bookkeeping-a method commonly used in accounting systems. The MMA runs on a platform called network markup language, which enables visualization and further validation of the results. INDEX TERMS Integer linear programming, multi-layered network, optimization, Poisson Pareto burst process. RONGPING LIN received the Ph.D. degree from the

A Fast Simulation Model Based on Lindley’s Recursion for the G/G/1/K Queue

“…In PPBP a burst is divided into small pieces at a rate . These kinds of systems are used to model real traffic where the buffer size is fixed and the service time is constant [5,6]. The methodology presented in this work does not represent an exact PPBP model since Algorithms 1 and 2 are not designed to handle the partition of bursts into small entities.…”

“…However, real systems have an arrival process different from that of Poisson. For example, some applications exhibit Long-Range Dependence (LRD) traffic [3][4][5][6]. Therefore, it is desirable to have models for general queuing systems, such as the / /1/ queue, which is generally difficult to analyze; e.g., the / /1/ queue was studied through approximations that result in high mathematical complexity in [7,8], while, in [9], asymptotic representations were used for the metrics of the system.…”

“…In the literature, there are exact solutions and approximations for the / /1/ queue [2,10,11]. For example, the Poisson Pareto Burst Process (PPBP) was studied by their applications in real broadband traffic modeling [5,6,12]. In PPBP burst 2 Mathematical Problems in Engineering arrivals occur as Poisson processes with Pareto distributed length, and each burst is divided into small pieces that will represent the work in the system (packets, entities, users, etc.).…”

OTN-over-WDM optimization in 5G networks: key challenges and innovation opportunities

“…Xing et al proposed a low-complexity heuristic algorithm that aims at minimizing the network cost by effectively provisioning the resources of the multi-layered OTN network [ 44 ]. The authors modeled the network traffic streams as a combination of constant bit-rate and Variable Bit-Rate (VBR) traffic streams.…”

“…The authors modeled the network traffic streams as a combination of constant bit-rate and Variable Bit-Rate (VBR) traffic streams. Moreover, the authors adopted a shortest path routing-based solution at each layer in order to address the architectural and traffic requirements [ 44 ]. The proposed heuristic followed an iterative approach by provisioning the resources link-by-link in each layer.…”