311 research outputs found

    Resilient network dimensioning for optical grid/clouds using relocation

    Get PDF
    In this paper we address the problem of dimensioning infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We will provide an overview of our work in this area, and in particular focus on how to design the resulting grid/cloud to be resilient against network link and/or server site failures. To this end, we will exploit relocation: under failure conditions, a request may be sent to an alternate destination than the one under failure-free conditions. We will provide a comprehensive overview of related work in this area, and focus in some detail on our own most recent work. The latter comprises a case study where traffic has a known origin, but we assume a degree of freedom as to where its end up being processed, which is typically the case for e. g., grid applications of the bag-of-tasks (BoT) type or for providing cloud services. In particular, we will provide in this paper a new integer linear programming (ILP) formulation to solve the resilient grid/cloud dimensioning problem using failure-dependent backup routes. Our algorithm will simultaneously decide on server and network capacity. We find that in the anycast routing problem we address, the benefit of using failure-dependent (FD) rerouting is limited compared to failure-independent (FID) backup routing. We confirm our earlier findings in terms of network capacity savings achieved by relocation compared to not exploiting relocation (order of 6-10% in the current case studies)

    On the offline physical layer impairment aware RWA algorithms in transparent optical networks: state-of-the-art and beyond

    Get PDF
    In transparent optical networks with no regeneration, the problem of capacity allocation to traffic demands is called "Roting and Wavelength Assignment". Much work on this topic recently has focused on the dynamic case, whereby demands arrive and must be served in real-time. In addition, due to lack of regeneration, physical impairments accumulate as light propagates and QoT may become inappropiate (e.g., too high Bit Error Rate). Considering the physical layer impairments in the network planning phase gives rise to a class of RWA algorithms: offline Physical Layer Impairment Aware- (PLIA-)RWA. This paper makes a survey of such algorithms, proposes a taxonomy, and a comparison between these algorithms for common metrics. We also propose a novel offline PLIA-RWA algorithm, called POLIO-RWA, and show through simulations that it decreases blocking rate compared with other PLIA-RWA algorithms.Postprint (published version

    Joint dimensioning of server and network infrastructure for resilient optical grids/clouds

    Get PDF
    We address the dimensioning of infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We design the resulting grid/cloud to be resilient against network link or server failures. To this end, we exploit relocation: Under failure conditions, a grid job or cloud virtual machine may be served at an alternate destination (i.e., different from the one under failure-free conditions). We thus consider grid/cloud requests to have a known origin, but assume a degree of freedom as to where they end up being served, which is the case for grid applications of the bag-of-tasks (BoT) type or hosted virtual machines in the cloud case. We present a generic methodology based on integer linear programming (ILP) that: 1) chooses a given number of sites in a given network topology where to install server infrastructure; and 2) determines the amount of both network and server capacity to cater for both the failure-free scenario and failures of links or nodes. For the latter, we consider either failure-independent (FID) or failure-dependent (FD) recovery. Case studies on European-scale networks show that relocation allows considerable reduction of the total amount of network and server resources, especially in sparse topologies and for higher numbers of server sites. Adopting a failure-dependent backup routing strategy does lead to lower resource dimensions, but only when we adopt relocation (especially for a high number of server sites): Without exploiting relocation, potential savings of FD versus FID are not meaningful

    Physical layer aware open optical networking

    Get PDF
    L'abstract è presente nell'allegato / the abstract is in the attachmen

    Modeling Off-line Routing and Spectrum Allocation Problem in Elastic Optical Network

    Get PDF
    The swift escalation in internet traffic due to diverse bandwidth starving applications and innovative concepts of modern technologies such as Elastic Optical Networks (EONs) and Software-defined networking (SDN) demands a dynamic and flexible optical network architecture both at the control and data plane. Characteristically, the flexibility in EONs is achieved by the emerging SDN-enabled sliceable bandwidth variable transponders (SBVTs) that support multiple optical carriers' simultaneous generation. These generated multiple optical carriers can operate different lightpaths using slice-ability or combined into a single high-rate super-channel. In this perspective, one of the major issues in EON is Routing and Spectrum Allocation (RSA). Typically, in EON, RSA is a spectrum management and Nondeterministic Polynomial-time hardness (NP-hard) problem in which network resources mainly bank on the applied ordering strategy. This article proposed a novel heuristic algorithm, Minimum Hops with Least Slot Spectrum (MHLS), to accommodate maximum traffic requests with better spectrum utilization. The proposed algorithm aims to minimize block requests, block traffic, and the total number of spectrum slots used in the network. The MHLS exploits Dijkstra-shortest-path and SDN-enabled SBVTs for RSA problem. The performance evaluation of MHLS is accomplished on the entire USA network

    Scheduled virtual topology design under periodic traffic in transparent optical networks

    Get PDF
    This paper investigates offline planning and scheduling in transparent optical networks for a given periodic traffic demand. The main objective is to minimize the number of transceivers needed which make up for the main network cost. We call this problem ldquoScheduled Virtual Topology Designrdquo and consider two variants: non-reconfigurable and reconfigurable equipment. We formulate both problems as exact MILPs (Mixed Integer Linear Programs). Due to their high complexity, we propose a more scalable tabu search heuristic approach, in conjunction with smaller MILP formulations for the associated subproblems. The main motivation of our research efforts is to assess the benefits of using reconfigurable equipment, realized as a reduction in the number of required transceivers. Our results show that the achieved reductions are not very significant, except for cases with large network loads and high traffic variability.The work described in this paper was carried out with the support of the BONE-project ("Building the Future Optical Network in Europe”), a Network of Excellence funded by the European Commission through the 7th ICTFramework Programme, support of the MEC Spanish project TEC2007- 67966-01/TCM CONPARTE-1 and developed in the framework of "Programa de Ayudas a Grupos de Excelencia de la Región de Murcia, de la Fundación Séneca (Plan Regional de Ciencia y Tecnología 2007/2010).
    corecore