The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Over the past two decades, great efforts have been made in the study of routing and manipulating light waves at the subwavelength scale with open nanostructures such as photonic crystal waveguides (PCWs), surface plasmon waveguides (SPWs), and coupled resonator optical waveguides (CROWs), for their great potential in many photonic technologies such as highly integrated photonic signal-processing systems...
We demonstrate novel re-optimization design techniques for realizing agile and seamless service migration with minimum connection disruptions. We also show the effectiveness of our integer linear programming based approach through network simulations.
In this paper, we study a new optical network paradigm, where statistical sharing is supported in optical networks. This new paradigm is motivated by the recent revolution of Software Defined Optics (SDO). Software defined variable-bandwidth transponders can support variable data rates for a single connection, i.e. base rates and peak rates. Guaranteeing the peak rates for all the connections simultaneously...
Data center networks become increasingly important with the growth of cloud computing. For any integers k ≥ 0 and n ≥ 2, the k-dimensional DCell, Dk,n, has been proposed for one of the most important data center networks as a server-centric data center network structure. In this paper, we propose an efficient algorithm for finding disjoint paths in node-to-set routing...
In this paper, we aim to minimize the total network cost in flexible-grid optical networks with multiple line rates. Besides transponder cost, regenerator cost, and shared infrastructure cost, the cost of regenerator sites is also considered. We first provide the problem definition and formulate the problem as an integer linear program (ILP). We also propose a heuristic algorithm considering both...
Simulations of shared mesh restoration in a backbone network supporting rapid provisioning show up to 27% fewer regenerators than dedicated protection, plus ~40% increase in capacity. Regenerator site concentration and minimum-regenerator routing provide best results.
We address the problem of finding the least cost disjoint path pair with delay constraints, where working and protection paths require different delay constraints. A heuristic algorithm is proposed and compared with optimal ILP results.
In this paper, we study the problem of regenerator site selection for mixed line rate optical networks. The objective is to minimize the number of regenerator sites for a given set of requests whose routing is flexible. We show that the problem is NP-complete and propose several heuristic algorithms to address the problem. The heuristic algorithms first order the set of requests based on several parameters,...
We use Monte Carlo simulations of quasi-static traffic growth to study concentration of regenerator sites in dynamic photonic networks supporting service velocity. Idle regenerators can be reduced by >60% compared to unrestricted regeneration sites.
We study the impact of partitioning client-side fiber cross-connects on the blocking performance of colorless, non-directional ROADM based dynamic optical networks. Simulations show that smaller fiber cross-connects (16×16, 48×48) can achieve low blocking.
We consider the problem of finding end-to-end shortest disjoint paths for a given sequence of domains in multi-domain networks. A Path Computation Element (PCE) serves as a computing entity in each domain, specializing in path computation and optimization. We propose a novel PCE-based scheme that computes the shortest path over multiple domains in the forward direction and computes the disjoint path...
We show that blocking in dynamic networks of colorless, non-directional ROADMs is tolerant to intra-node contention when contention-aware routing/wavelength assignment (RWA) algorithms are used. An optional client-side cross-connect enables low blocking with simpler RWA variants.
We consider survivable traffic grooming through dedicated lightpath protection in a network with impairment constraints. Results evaluate the dependency of network equipment placement on survivable lightpath provisioning in terms of the network cost.
We present a heuristic algorithm to address the demand aggregation problem in DWDM optical networks employing shared ring protection. The algorithm decides the route and wavelength of each demand with the aim of minimizing the total number of optical line cards as well as reducing the total number of DWDM rings.
We present a k-shortest path algorithm for overlay demand routing in optical networks. The proposed algorithm can find paths in trap topologies and show higher demand routing success rate compared to shortest path algorithm-based approaches.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.