A Better ACA for Routing and Wavelength Assignment in ASON with Supporting Different SLA of Services and 10Pbps Network Capacity

2014 ◽  
Vol 687-691 ◽  
pp. 4148-4152
Author(s):  
Pu Wang ◽  
Bo Liu ◽  
Li Jia Zhang ◽  
Yong Jun Wang ◽  
Qing Hua Tian ◽  
...  
Keyword(s):  
Optical Networks ◽  
Ant Colony Algorithm ◽  
Probability Function ◽  
Transition Probability ◽  
Routing And Wavelength Assignment ◽  
Network Capacity ◽  
Wavelength Assignment ◽  
Control Factor ◽  
Transition Probability Function ◽  
Different Levels

Dynamic RWA algorithm which supports differentiating business service quality levels becomes a hot research in optical networks. This paper proposes a better ant colony algorithm for routing and wavelength assignment in ASON with supporting differentiating SLA of services and 10P bps network capacity. Firstly, the algorithm adds the concept of business interval period M to dynamically adjust the wavelength grouped in different periods So as to better meet the sercice requests of different levels; Secondly the algorithm adds a link selection control factor in the transition probability function ACA in order to achieve a better link load balancing. Simulation results show that after joining the cyclical and link selection control factor, blocking rate becomes lower and the load of network becomes more evenly.

scholarly journals Routing Strategies in Survivable Optical Networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Routing Problem ◽  
Routing Strategy ◽  
Survivable Optical Networks ◽  
Conventional Algorithm ◽  
Better Than

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 

Optical Network Optimization

2013 ◽  
pp. 1-23
Author(s):  
Bin Wang ◽  
Yousef S. Kavian
Keyword(s):  
Network Design ◽  
Optical Networks ◽  
Optimization Problems ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Topology Design ◽  
Wdm Optical Networks ◽  
Design Problems ◽  
Optical Network Design

Optical networks form the foundation of the global network infrastructure; hence, the planning and design of optical networks is crucial to the operation and economics of the Internet and its ability to support critical and reliable communication services. This book chapter covers various aspects of optimal optical network design, such as wavelength-routed Wavelength Division Multiplexing (WDM) optical networks, Spectrum-Sliced Elastic (SLICE) optical networks. As background, the chapter first briefly describes optical ring networks, WDM optical networks, and SLICE optical networks, as well as basic concepts of routing and wavelength assignment and virtual topology design, survivability, and traffic grooming in optical networks. The reader is referred to additional references for details. Many optical network design problems can be formulated as sophisticated optimization problems, including (1) Routing and Wavelength Assignment (RWA) and virtual topology design problem, (2) a suite of network design problems (such as variants of traffic grooming, survivability, and impairment-aware routing), (3) various design problems aimed at reducing the overall energy consumption of optical networks for green communication, (4) various design optimization problems in SLICE networks that employ OFDM technologies. This chapter covers numerous optical network design optimization problems and solution approaches in detail and presents some recent developments and future research directions.

scholarly journals The Strassen invariance principle for certain non-stationary Markov–Feller chains

2020 ◽  
Vol 121 (1) ◽  
pp. 1-34 ◽  
Author(s):  
Dawid Czapla ◽  
Katarzyna Horbacz ◽  
Hanna Wojewódka-Ściążko
Keyword(s):  
Gene Expression ◽  
Mathematical Model ◽  
Population Dynamics ◽  
Invariance Principle ◽  
Probability Function ◽  
Stochastic Dynamics ◽  
Transition Probability ◽  
Type Condition ◽  
Iterated Logarithm ◽  
Transition Probability Function

We propose certain conditions implying the functional law of the iterated logarithm (the Strassen invariance principle) for some general class of non-stationary Markov–Feller chains. This class may be briefly specified by the following two properties: firstly, the transition operator of the chain under consideration enjoys a non-linear Lyapunov-type condition, and secondly, there exists an appropriate Markovian coupling whose transition probability function can be decomposed into two parts, one of which is contractive and dominant in some sense. Our criterion may serve as a useful tool in verifying the functional law of the iterated logarithm for certain random dynamical systems, developed e.g. in biology and population dynamics. In the final part of the paper we present an example application of our main theorem to a mathematical model describing stochastic dynamics of gene expression.

Sign in / Sign up

Export Citation Format

Share Document