276 research outputs found

    Considering Transmission Impairments in Wavelength Routed Networks

    Get PDF
    Abstract — We consider dynamically reconfigurable wavelength routed networks in which lightpaths carrying IP traffic are on demand established. We face the Routing and Wavelength Assignment problem considering as constraints the physical impairments that arise in all-optical wavelength routed networks. In particular, we study the impact of the physical layer when establishing a lightpath in transparent optical network. Because no signal transformation and regeneration at intermediate nodes occurs, noise and signal distortions due to non-ideal transmission devices are accumulated along the physical path, and they degrade the quality of the received signal. We propose a simple yet accurate model for the physical layer which consider both static and dynamic impairments, i.e., nonlinear effects depending on the actual wavelength/lightpath allocation. We then propose a novel algorithm to solve the RWA problem that explicitly considers the physical impairments. Simulation results show the effectiveness of our approach. Indeed, when the transmission impairments come into play, an accurate selection of paths and wavelengths which is driven by physical consideration is mandatory. I

    An Ant-based Approach for Dynamic RWA in Optical WDM Networks

    Get PDF

    High speed all optical networks

    Get PDF
    An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. The first solution to wavelength division multiplexing (WDM) based WAN networks that overcomes this limitation is presented. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs. The principle of the Lightnet architecture is the construction and use of virtual topology networks, embedded in the original network in the wavelength domain. For this construction Lightnets utilize the new concept of lightpaths which constitute the links of the virtual topology. Lightpaths are all-optical, multihop, paths in the network that allow data to be switched through intermediate nodes using high throughput passive optical switches. The use of the virtual topologies and the associated switching design introduce a number of new ideas, which are discussed in detail

    Ant-based Survivable Routing in Dynamic WDM Networks with Shared Backup Paths

    Get PDF

    On QoS-assured degraded provisioning in service-differentiated multi-layer elastic optical networks

    Full text link
    The emergence of new network applications is driving network operators to not only fulfill dynamic bandwidth requirements, but offer various grades of service. Degraded provisioning provides an effective solution to flexibly allocate resources in various dimensions to reduce blocking for differentiated demands when network congestion occurs. In this work, we investigate the novel problem of online degraded provisioning in service-differentiated multi-layer networks with optical elasticity. Quality of Service (QoS) is assured by service-holding-time prolongation and immediate access as soon as the service arrives without set-up delay. We decompose the problem into degraded routing and degraded resource allocation stages, and design polynomial-time algorithms with the enhanced multi-layer architecture to increase the network flexibility in temporal and spectral dimensions. Illustrative results verify that we can achieve significant reduction of network service failures, especially for requests with higher priorities. The results also indicate that degradation in optical layer can increase the network capacity, while the degradation in electric layer provides flexible time-bandwidth exchange.Comment: accepted by IEEE GLOBECOM 201

    A heuristic for placement of limited range wavelength converters in all-optical networks

    Get PDF
    Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem [K.C. Lee, V.O.K. Li, IEEE J. Lightwave Technol. 11 (1993) 962-970] in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of optical signals is significantly high. We observe that limited range converters at few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 28-node US long haul network, hypothetical 30-node INET network and the results agree with the analysis. (C) 2001 Elsevier Science B.V, All rights reserved

    Study of Routing and Wavelength Assignment problem and Performance Analysis of Genetic Algorithm for All-Optical Networks

    Get PDF
    All-optical networks uses the concept of wavelength division multiplexing (WDM). The problem of routing and wavelength assignment (RWA) is critically important for increasing the efficiency of wavelength routed All-optical networks. For the given set of connections, the task of setting up lightpaths by routing and assigning a wavelength to each connection is called routing and wavelength allocation problem. In work to date, the problem has been formulated as integer linear programming problem. There are two variations of the problem: static and dynamic, in the static case, the traffic is known where as in dynamic case, connection request arrive in some random fashion. Here we adopt the static view of the problem. We have studied the Genetic Algorithm to solve the RWA problem and also we studied a modified Genetic Algorithm with reference to the basic model. We studied a novel opimization problem formulations that offer the promise of radical improvements over the existing methods. We adopt a static view of the problem and saw new integer- linear programming formulations, which can be addressed with highly efficient linear programming methods and yield optimal or near-optimal RWA policies. All-optical WDM networks are chracterized by multiple metrics (hop-count, cost, delay), but generally routing protocols only optimize one metric, using some variant shortest path algorithm (e.g., the Dijkstra, all-pairs and Bellman-ford algorithms). The multicriteria RWA problem has been solved combining the relevant metrics or objective functions. The performance of RWA algorithms have been studied across the different standard networks. The performance of both the algorithms are studied with respect to the time taken for making routing decision, number of wavelengths required and cost of the requested lightpaths. It has been observed that the modified genetic algorithm performed better than the existing algorithm with respect to the time and cost parameters
    corecore