641 research outputs found

    Efficient Make Before Break Capacity Defragmentation

    Get PDF
    International audienceOptical multilayer optimization continuously reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need to add new resources for new requests, saving CAPEX and leads to optical network defragmentation. The focus of this paper is on Layer 2, i.e., on capacity de-fragmentation at the OTN layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by redefining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. For the Quality of Service, it is desirable to operate under Make Before Break (MBB), with the minimum number of rerouting. The challenge is to identify the rerouting order, one connection at a time, while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with the state of the art. We also provide some defragmentation analysis in terms of the bandwidth requirement vs. the number of reroutings

    Management of Spectral Resources in Elastic Optical Networks

    Get PDF
    Recent developments in the area of mobile technologies, data center networks, cloud computing and social networks have triggered the growth of a wide range of network applications. The data rate of these applications also vary from a few megabits per second (Mbps) to several Gigabits per second (Gbps), thereby increasing the burden on the Inter- net. To support this growth in Internet data traffic, one foremost solution is to utilize the advancements in optical networks. With technology such as wavelength division multiplexing (WDM) networks, bandwidth upto 100 Gbps can be exploited from the optical fiber in an energy efficient manner. However, WDM networks are not efficient when the traffic demands vary frequently. Elastic Optical Networks (EONs) or Spectrum Sliced Elastic Optical Path Networks (SLICE) or Flex-Grid has been recently proposed as a long-term solution to handle the ever-increasing data traffic and the diverse demand range. EONs provide abundant bandwidth by managing the spectrum resources as fine-granular orthogonal sub-carriers that makes it suitable to accommodate varying traffic demands. However, the Routing and Spectrum Allocation (RSA) algorithm in EONs has to follow additional constraints while allocating sub-carriers to demands. These constraints increase the complexity of RSA in EONs and also, make EONs prone to the fragmentation of spectral resources, thereby decreasing the spectral efficiency. The major objective of this dissertation is to study the problem of spectrum allocation in EONs under various network conditions. With this objective, this dissertation presents the author\u27s study and research on multiple aspects of spectrum allocation in EONs: how to allocate sub-carriers to the traffic demands, how to accommodate traffic demands that varies with time, how to minimize the fragmentation of spectral resources and how to efficiently integrate the predictability of user demands for spectrum assignment. Another important contribution of this dissertation is the application of EONs as one of the substrate technologies for network virtualization

    Lightpath fragmentation for efficient spectrum utilization in dynamic elastic optical networks

    Get PDF
    The spectrum-sliced elastic optical path network (SLICE) architecture has been presented as an efficient solution for flexible bandwidth allocation in optical networks. An homologous problem to the classical Routing and Wavelength Assignment (RWA) arises in such an architecture, called Routing and Spectrum Assignment (RSA). Imposed by current transmission technologies enabling the elastic optical network concept, the spectrum contiguity constraint must be ensured in the RSA problem, meaning that the bandwidth requested by any connection must be allocated over a contiguous portion of the spectrum along the path between source and destination nodes. In a dynamic network scenario, where incoming connections are established and disconnected in a quite random fashion, spectral resources tend to be highly fragmented, preventing the allocation of large contiguous spectrum portions for high data-rate connection requests. As a result, high data-rate connections experience unfairly increased bocking probability in contrast to low data-rate ones. In view of this, the present article proposes a lightpath fragmentation mechanism that makes use of the idle transponders in the source node of a high data-rate connection request to fragment it into multiple low data-rate ones, more easily allocable in the network. Besides, aiming to support such an operation, a light-weight RSA algorithm is also proposed so as to properly allocate the generated lightpath fragments over the spectrum. Benefits of the proposed approach are quantified through extensive simulations, showing drastically reduced high data-rate connection blocking probability compared to a usual contiguous bandwidth allocation, while keeping the performance of low data-rate requests to similar levels.Postprint (author’s final draft

    DeepDefrag: A deep reinforcement learning framework for spectrum defragmentation

    Get PDF
    Exponential growth of bandwidth demand, spurred by emerging network services with diverse characteristics and stringent performance requirements, drives the need for dynamic operation of optical networks, efficient use of spectral resources, and automation. One of the main challenges of dynamic, resource-efficient Elastic Optical Networks (EONs) is spectrum fragmentation. Fragmented, stranded spectrum slots lead to poor resource utilization and increase the blocking probability of incoming service requests. Conventional approaches for Spectrum Defragmentation (SD) apply various criteria to decide when, and which portion of the spectrum to defragment. However, these polices often address only a subset of tasks related to defragmentation, are not adaptable, and have limited automation potential. To address these issues, we propose DeepDefrag, a novel framework based on reinforcement learning that addresses the main aspects of the SD process: determining when to perform defragmentation, which connections to reconfigure, and which part of the spectrum to reallocate them to. DeepDefrag outperforms the well-known Older-First First-Fit (OF-FF) defragmentation heuristic, achieving lower blocking probability under smaller defragmentation overhead

    DeepDefrag: A deep reinforcement learning framework for spectrum defragmentation

    Get PDF
    Exponential growth of bandwidth demand, spurred by emerging network services with diverse characteristics and stringent performance requirements, drives the need for dynamic operation of optical networks, efficient use of spectral resources, and automation. One of the main challenges of dynamic, resource-efficient Elastic Optical Networks (EONs) is spectrum fragmentation. Fragmented, stranded spectrum slots lead to poor resource utilization and increase the blocking probability of incoming service requests. Conventional approaches for Spectrum Defragmentation (SD) apply various criteria to decide when, and which portion of the spectrum to defragment. However, these polices often address only a subset of tasks related to defragmentation, are not adaptable, and have limited automation potential. To address these issues, we propose DeepDefrag, a novel framework based on reinforcement learning that addresses the main aspects of the SD process: determining when to perform defragmentation, which connections to reconfigure, and which part of the spectrum to reallocate them to. DeepDefrag outperforms the well-known Older-First First-Fit (OF-FF) defragmentation heuristic, achieving lower blocking probability under smaller defragmentation overhead
    • …
    corecore