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.
Routing and wavelength assignment is the important problem to multi-domain ASON. In order to solve this problem, a new impairment-aware routing algorithm based on colored graph model (IRACM) is proposed in this paper. In the proposed algorithm, different ant colonies different and different mechanisms of pheromone control, and the local search and global search are used. The analysis shows that the...
As the distributed multi-domain DWDM optical network has been advocated to be the next generation optical network, there is a pressing need to address the inter-domain RWA (Routing and wavelength assignment) problem. Thus, we propose a set of new inter-domain RWA schemes, including a MLP (Most leisure path) routing strategy based on the Hybrid abstraction and a ID-MU (Inter-domain most used) wavelength...
A novel routing architecture that balances incoming traffic over the Agile All-Photonic Network (AAPN) is proposed. The architecture is based on the adaptive highest random weight (Adaptive HRW) algorithm proposed to design load balanced internet routers. It extends the adaptive HRW algorithm by assigning balancing weights to each source-destination edge node pair in the network. The weights are adapted...
In this paper, we present an all-optical network architecture and a routing protocol for it. The coloured sparse optical torus network (CSOT) consists of an n × n torus for which n = b2 for some b in {2, 3, 4, ...}. Processors of the network are deployed at nodes for which (i + j) mod b = 0, where i and j are row and column indices of a node and b is the block size and the number of wavelengths used...
In recent days, optical fibers have been developed as a transmission medium to carry traffic in order to provide various services in telecommunications platform. Failure of this fibre caused loss of data which can interrupt communication services. Thus, this paper will focus about protection scheme in order to guarantee the survivability of the networks. Besides, the scheme should provide better quality...
With new optical transport systems able to provide sub-wavelength granularity, the dynamic characteristics of the network are expected to strongly increase. Furthermore, such properties are highly related to the underlying physical network topology, which in turn require from the control plane important features such as scalability, dynamism and automatism. In this paper we analyze the properties...
Transparent optical networks based on wavelength division multiplexing (WDM) can exploit the huge capacity of optical fibers by dividing it among different wavelengths. Physical-layer attacks, such as high-powered jamming, can seriously degrade network performance and must be dealt with efficiently. Hence route lightpaths in such a way as to minimize the potential damage caused by various physical-layer...
In transparent optical networks, the signal is directly switched in the optical domain without o-e-o regeneration. When considering high bit rate transmissions, uncompensated Chromatic Dispersion (CD) and Amplified Spontaneous Emission (ASE) noise accumulate along the fibers causing inter symbol interference and OSNR degradation. As a result, several connection requests are blocked for the low signal...
In this paper the problem of dimensioning dynamic optical WDM networks under multi-hour traffic and soft QoS constraints is studied. Unlike previous works, traffic matrices are generated according to a lognormal distribution, a more realistic model than the usual uniform approach. Additionally, instead of requiring hard QoS constraints (e.g. blocking probability under a given threshold 100% of time),...
In translucent optical networks, connections bypass most intermediate nodes transparently. However, their signal quality is affected by the traveled distance and/or the bypass operations. Hence, they might require optical-electrical-optical conversions at some intermediate nodes, in order to regenerate the carried signal. In this paper, we evaluate several approaches to deal with connection routing...
Optical Transport Network (OTN) is a standard approach to offering transport support to a variety of existing service technologies, e.g., ESCON, HDTV, GE, etc. Multiple service technologies can be concurrently multiplexed onto one common transport network, which offers hierarchical transmission rate wrappers physically supported by Wavelength Division Multiplexing (WDM) lambda channels. Algorithms...
Time Driven Switching (TDS) is a recently-proposed switching technique that allows to switch “fractions” of wavelengths (called Synchronous virtual Pipes, SVPs) directly in the optical domain, exploiting the time-coordination of all network components. In this paper a new performance-evaluation model for TDS is proposed and discussed. Using the new model, we conduct a performance comparison between...
Optical network design problems fall in the broad category of network optimization problems. We give a short introduction on network optimization and general algorithmic techniques that can be used to solve complex and difficult network design problems. We apply these techniques to address the static Routing and Wavelength Assignment problem that is related to planning phase of a WDM optical network...
Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexed (WDM) optical networks assumes assigning the routes and wavelengths to be used to create the lightpaths on behalf of the connection requests. The RWA problem belongs to the class of combinatorial optimization problems. The optimal solution to the RWA problem is found to be NP-hard and thus suited to heuristic approaches...
Link-disjoint routing strategy can offer a set of reliable alternate paths when the active best path fails. However, simply employing a set of fully disjointed paths may not necessarily result in the efficient network resource utilization in some circumstances, which degrades the performance of the network system under a highly loaded traffic condition. In this study, we propose two heuristic link-disjoint...
This work examines protection of multicast sessions in optical networks utilizing a novel segment-based algorithm called Level Protection. Our proposed scheme exhibits improved performance compared to other segment-based multicast protection schemes.
This paper proposes an adapted crankback-enabled post-fault restoration scheme against large-area failure events in multi-domain DWDM optical network. This novel solution provides recovery and resource efficiency without increasing routing overheads.
We consider, for the first time, the problem of flexible/open wavelength assignment and propose an optimal as well as heuristic solution. Simulation results validate our solution to within 15% of the theoretical spectral limit.
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.
Hierarchical PCE is evaluated in GMPLS-based multi-domain WSONs. Simulations show that PCE providing edge nodes sequence using detailed information of inter-domain links achieves the best performance guaranteeing a lightweight control plane.
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.