Blocking Performance And Analysis Of Routing And Wavelength Assignement Using Shortest Path Routing Algorithm In All-Optical Network

2019 ◽  
Author(s):  
Ashutosh Srivastava ◽  
N Siva Balan ◽  
P Piruthiviraj
Keyword(s):  
Shortest Path ◽  
Optical Network ◽  
Routing Algorithm ◽  
Shortest Path Routing ◽  
All Optical ◽  
All Optical Network

Routing algorithm using the flooding mechanism in a hybrid optical-CDMA and WDM all-optical network

2007 ◽  
Vol 13 (2) ◽  
pp. 149-155 ◽  
Author(s):  
Mehdi Shadaram ◽  
Ahmad Musa ◽  
Virgilio Gonzalez ◽  
John Medrano
Keyword(s):  
Optical Network ◽  
Routing Algorithm ◽  
Optical Cdma ◽  
All Optical ◽  
All Optical Network

A Recursive Shortest Path Routing Algorithm With Application for Wireless Sensor Network Localization

2016 ◽  
Vol 16 (11) ◽  
pp. 4631-4637 ◽  
Author(s):  
Juan Cota-Ruiz ◽  
Pablo Rivas-Perea ◽  
Ernesto Sifuentes ◽  
Rafael Gonzalez-Landaeta
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Sensor Network Localization ◽  
Shortest Path Routing ◽  
Network Localization

Merit of hybrid EDFA/Raman amplification in fixed-grid all-optical network exploiting multirate transponders

2017 ◽  
Vol 31 (1) ◽  
pp. e3383
Author(s):  
Arsalan Ahmad ◽  
Andrea Bianco ◽  
Hussein Chouman ◽  
Daniele DeTommas ◽  
Guido Marchetto ◽  
...  
Keyword(s):  
Optical Network ◽  
Raman Amplification ◽  
Fixed Grid ◽  
All Optical ◽  
All Optical Network

scholarly journals All-Optical Network Capacity for 5G Cellular Fronthaul

2019 ◽  
Author(s):  
Philip Perry ◽  
Adaranijo Peters ◽  
Sally McClean ◽  
Philip Morrow ◽  
Bryan Scotney ◽  
...  
Keyword(s):  
Optical Network ◽  
Network Capacity ◽  
All Optical ◽  
All Optical Network

OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES

2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG
Keyword(s):  
Shortest Path ◽  
Time Complexity ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Optimum Time ◽  
Shortest Path Routing ◽  
Routing Strategy ◽  
Bisection Width ◽  
Twisted Cube ◽  
Twisted Cubes

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.

Sign in / Sign up

Export Citation Format

Share Document