We study a class of circuit switched wavelength routing networks with xed or alternate routing and with random wavelength allocation. We present an iterative path decomposition algorithm to evaluate accurately and e ciently the blocking performance of such networks with and without wavelength converters. The path decomposition approach naturally captures the correlation of both link loads and l...

In optical WDM networks, transmission of information along optical lines is advantageous since it has high transmission capacity, scalability, feasibility and also high reliability. But large amount of information is being carried; any problem during transmission can lead to severe damage to the data being carried. Hence it is essential to consider the routing as well as the wavelength assignme...

We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-divisionmultiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants’ foraging. The P-route table contains P alternate routes...

A triangulation is said to be Hamiltonian if its dual graph contains a Hamiltonian path. A sequential triangulation is a Hamiltonian triangulation having the additional property that the “turns” in the Hamiltonian path alternate left/right. Such triangulations are useful in computer graphics rendering and are related to a new type of two-guard walk. In this paper we present a simple algorithm t...

We propose a dynamic multipath routing (DMPR) scheme to improve resource utilization of a network for a given quality of service (QoS) in carrying delay sensitive traffic. The proposed scheme takes advantage of available alternate routes which can be used beneficially in communication networks or switches, without increasing the network latency. Through simulation study of circuit-switched, vir...

Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path for IP networks. However, is inflexible sometimes results in congestion on some critical links. By separating the control plane data plane, centralized of Software Defined Networking (SDN)-based approach possesse...

A survey of MPLS protection methods and their utilization in combination with online routing methods is presented in this article. Usually, fault management methods pre-establish backup paths to recover traffic after a failure. In addition, MPLS allows the creation of different backup types, and hence MPLS is a suitable method to support traffic-engineered networks. In this article, an introduc...