Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks

Ramamurthy, S.; Mukherjee, B.

doi:10.1109/glocom.1998.775940

Cited by 106 publications

(93 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The work presented in (Sridharan and Sivarajan, 2004;Ramesh et al, 2000;Ramamurthy and Mukherjee, 1998;Xiong et al, 2003;Cerutti et al, 2005). The work presented in (Pitchumani et al, 2004;Chen et al, 2001) deals with the classes of connections which are differentiated, by the admission control policies, by their blocking probabilities.…”

Section: Jcsmentioning

confidence: 99%

Reducing Call Blocking Probability in Hybrid Multicast Wavelength Division Multiplexing Networks Using Weighted Routing and Wavelength Assignment Algorithm

Sankar¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

In the proposed work, the focus is on increasing the available wavelength in the all-optical networks, for which the Routing and Wavelength Assignment plays a vital role. In the earlier reported work, the wavelengths were assigned to the links which covers a set of destinations but not all the intended destinations. However this proposed work, attempts were made to create multiple spanning tree with minimum cost for reaching all the nodes in the network. Also, the delay (associated with transmission and propagation delay) was considered in the proposed work for demonstrating the Quality of Service. Experimentally the proposed algorithm works by means of constructing Multiple Minimum Spanning Trees (MMST) using Mayeda and Seshu algorithm considering the QoS parameter delay and avoids the call blocking probabilities. For the performance measurement, the parameters such as the cost and delay are considered and depending on the application they can be traded-off. The significance of the work lies in the optimization of the wavelength used in the fibre network, which mainly contributes to the backbone of the Internet. The experiments were conducted for the different scenarios of simulated network configuration and found to produce promising results compared to the existing work.

show abstract

Section: Jcsmentioning

confidence: 99%

Reducing Call Blocking Probability in Hybrid Multicast Wavelength Division Multiplexing Networks Using Weighted Routing and Wavelength Assignment Algorithm

Sankar¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The dynamic RWA is performed online, it is much more challenging; therefore, heuristic algorithms are usually employed in resolving this problem [2] Our work mainly focuses on dynamic RWA problem. In literature, there are static routing approaches available for the dynamic RWA problem, such as shortest-path routing or alternate shortest-path routing [4,5]. These approaches use a set of precomputed shortest paths for lightpath establishment.…”

Section: Routing and Wavelength Assignmentmentioning

confidence: 99%

Ant-based survivable routing in dynamic WDM networks with shared backup paths

Ngo

Jiang

et al. 2006

J Supercomput

View full text Add to dashboard Cite

Abstract. In this paper, we consider the problem of survivable routing in dynamic WDM networks with single link failure model. Our work mainly concerns in how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable lightpath with backup paths sharing. This problem is identified as NP-complete, thus a heuristic for finding near optimal solution with reasonable computation time is usually preferred. Inspired from the principle of ant colony optimization, we propose in this paper an ant-based mobile agents algorithm for this problem with improved blocking performance. To enable the new ant-based algorithm, we propose to use on each network node both a routing table that contains a set of feasible protection cycles between source destination nodes and also a pheromone table for mobile agents. By keeping a suitable number of mobile agents in a network to continually and proactively update the routing tables based on the current network congestion state, the routing solution of a connection request can be obtained with a reasonable computation time. Extensive simulation results upon the ns-2 network simulator and two typical network topologies show that our new algorithm can achieve a significantly lower blocking probability than the promising algorithm for dynamic lightpath protection proposed in [11] with a comparable computation complexity.

show abstract

“…Routing in networks with more than one candidate path has been shown to offer signilicant performance improvement [29]. Fixed alternate path routing (FAPR) has been studied in [30] and [31]. Fixed-path least-congestion routing (FPLCR) has been analyzed in [32].…”

Section: Prior Work In Connection Establishment In Wdm Grooming Networkmentioning

confidence: 99%

A generalized framework for analyzing time-space switched optical networks

Srinivasan

Somani

2002

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks

Cited by 106 publications

References 15 publications

Reducing Call Blocking Probability in Hybrid Multicast Wavelength Division Multiplexing Networks Using Weighted Routing and Wavelength Assignment Algorithm

Reducing Call Blocking Probability in Hybrid Multicast Wavelength Division Multiplexing Networks Using Weighted Routing and Wavelength Assignment Algorithm

Ant-based survivable routing in dynamic WDM networks with shared backup paths

A generalized framework for analyzing time-space switched optical networks

Contact Info

Product

Resources

About