Traffic Engineering in G-MPLS networks with QoS guarantees

In this paper a new Traffic Engineering (TE) scheme to efficiently route sub-wavelength requests with different QoS requirements is proposed for G-MPLS networks. In most previous studies on TE based on dynamic traffic grooming, the objectives were to minimize the rejection probability by respecting the constraints of the optical node architecture, but without considering service differentiation. In practice, some high-priority (HP) connections can instead be characterized by specific constraints on the maximum tolerable end-to-end delay and packet-loss ratio. The proposed solution consists of a distributed two-stage scheme: each time a new request arrives, an on-line dynamic grooming scheme finds a route which fulfills the QoS requirements. If a HP request is blocked at the ingress router, a preemption algorithm is executed locally in order to create room for this traffic. The proposed preemption mechanism minimizes the network disruption, both in term of number of rerouted low-priority connections and new set-up lightpaths, and the signaling complexity. Extensive simulation experiments are performed to demonstrate the efficiency of our scheme

PROVIDING THE BOUNDARY LINE CONTROLLED REQUEST WITH ADAPTABLE TRANSMISSION RATES IN WDM MESH NETWORKS

The mixture of applications increases and supported over optical networks, to the network customers new service guarantees must be offered .The partitioning the data into multiple segments which can be processed independently the useful data to be transferred before a predefined deadline .this is a deadline driven request. To provide the request the customer chooses the bandwidth DDRs provide scheduling flexibility for the service providers. It chooses bandwidth while achieving two objectives 1.satisfying the guaranteed deadline 2.decreasing network resource utilization .by using bandwidth allocation policies improve the network performance and by using mixed integer linear program allows choosing flexible transmission rates

Resilient network dimensioning for optical grid/clouds using relocation

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)

Migration strategies toward all optical metropolitan access rings

This paper was published in Journal of Lightwave Technology and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the IEEE website: http://dx.doi.org/10.1109/JLT.2007.901325. Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under law.Nowadays, network operators are steadily deploying optical circuit switching (OCS) equipment in their metropolitan networks in order to cope with traffic increase and, most importantly, in order to reduce capital expenditures and operational expenditures of existing active technologies. On the other hand, optical burst switching (OBS) technology is expected to become mature in the medium term, and it may be used as an alternative to current OCS networks due to its potential advantages in terms of bandwidth allocation granularity. While OBS is being extensively studied in the literature, little attention has been paid in conducting a comparative analysis of OBS versus OCS, especially concerning cost analysis. In this paper, we provide a comparative analysis of OBS versus OCS as an evolutionary technology for all-optical rings in the metropolitan-access network. This paper is specifically targeted toward optimizing the number of optoelectronic receivers and wavelengths with real traffic matrices from the metropolitan rings in Madrid, Spain. Such matrices also include traffic projections of foreseeable broadband services, which are based on a market analysis from the largest operator in Spain. Our findings show that OCS might be more efficient than OBS in the metro-access segment, which is characterized by a highly centralized traffic pattern. However, the more distributed the traffic is, the more efficient the OBS is as well. Consequently, OBS might be better suited to metro-core networks, which show a more distributed and dynamic traffic pattern.The authors would like to thank the e-Photon/ONe+ network of excellenc

A Lightweight, Non-intrusive Approach for Orchestrating Autonomously-managed Network Elements

Software-Defined Networking enables the centralized orchestration of data traffic within a network. However, proposed solutions require a high degree of architectural penetration. The present study targets the orchestration of network elements that do not wish to yield much of their internal operations to an external controller. Backpressure routing principles are used for deriving flow routing rules that optimally stabilize a network, while maximizing its throughput. The elements can then accept in full, partially or reject the proposed routing rule-set. The proposed scheme requires minimal, relatively infrequent interaction with a controller, limiting its imposed workload, promoting scalability. The proposed scheme exhibits attracting network performance gains, as demonstrated by extensive simulations and proven via mathematical analysis.Comment: 6 pages 7, figures, IEEE ISCC'1

Resource Allocation in Survivable WDM Networks Under a Sliding Scheduled Traffic Model

In recent years there has been an increasing number of applications that require periodic use of lightpaths at predefined time intervals, such as database backup and on-line classes. A new traffic model, referred to as the scheduled traffic model, has been proposed to handle such scheduled lightpath demands. In this thesis we present two new integer linear program ( ILP) formulations for the more general sliding scheduled traffic model, where the setup and teardown times may vary within a specified range. We consider both wavelength convertible networks and networks without wavelength conversion capability. Our ILP formulations jointly optimize the problem of scheduling the demands ( in time) and allocating resources for the scheduled lightpaths. Simulation results show that our formulations are able to generate optimal solutions for practical sized networks. For larger networks, we have proposed a fast two-step heuristic to solve the demand scheduling problem and the RWA problem separately

Desenvolvimento de heurísticas para o dimensionamento de redes óticas transparentes

In this dissertation a set of heuristic algorithms was developed, implemented and validated for the dimensioning of transparent optical networks. A generic platform was also created in order to allow the heuristics development and implementation, based on two main entities: a logical layer manager and a physical layer manager. The referred structure was designed in order to allow the test of a vast variety of heuristic algorithms. Within the scope of this dissertation were developed traffic scheduling algorithms based on the individual traffic quantity of each request. In addition, some routing, grooming and wavelength assignment algorithms were also developed. The main goal of these heuristics is is to dimension networks, while recurring to the minimum possible amount of resources, thus minimizing the CAPEX of the network, while also trying to guarantee the total traffic routing. For simplicity reasons only the case of networks without survivabilty was treated, although the platform is sufficiently generic to allow its inclusion in future work. Regarding the economic aspects, a detailed and comparative study was conducted, focusing on the networks CAPEX, in order to validate and assess the quality of the solutions provided by the heuristics developed based on the solutions given by an integer linear programming model. Finally, some conclusions and possible future work are discussed.Nesta dissertação foram desenvolvidas, implementadas e validadas heurísticas para o dimensionamento de redes óticas de transporte transparentes. Foi criada uma plataforma genérica para o desenvolvimento e a implementação das heurísticas baseada em duas entidades principais: um gestor de recursos da camada lógica e um gestor de recursos da camada física. Esta estrutura foi desenhada de modo a poder ser usada para testar uma grande variedade de heurísticas. No âmbito desta tese foram desenvolvidas heuristicas considerando o escalonamento dos pedidos baseados na quantidade de tráfego de cada pedido. Foram ainda desenvolvidos algoritmos para o encaminhamento, a atribuição de comprimentos de onda e agregação dos pedidos de tráfego. O objetivo das heurísticas passa pelo dimensionamento de uma rede, onde recorrendo-se a um mínimo possível de recursos, e portanto, minimizando o CAPEX da rede, se tenta garantir o encaminhamento total do tráfego. Por uma questão de simplificidade apenas foram consideradas redes sem sobrevivência, no entanto, a plataforma é suficientemente genérica para permitir a inclusão de sobrevivência. Tendo também em conta a referida vertente económica, foi elaborado um estudo detalhado e comparativo, tendo em foco o CAPEX da rede, com o objetivo de validar a qualidade das soluções fornecidas pelas heurísticas desenvolvidas tendo por base os valores obtidos através de um modelo baseado em programação linear inteira. Finalmente, são partilhadas e discutidas algumas conclusões e direções para o desenvolvimento de trabalho futuro.Mestrado em Engenharia Eletrónica e Telecomunicaçõe

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

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