Technique to Neutralize Link Failures for an ACO-Based Routing Algorithm

2012 ◽  
pp. 251-260
Author(s):  
Delfín Rupérez Cañas ◽  
Ana Lucila Sandoval Orozco ◽  
Luis Javier García Villalba
Keyword(s):  
Routing Algorithm ◽  
Link Failures

An Augmented Routing Algorithm for Trusted Detection of Link Failures in MANETs

2016 ◽  
Vol 96 (4) ◽  
pp. 5185-5201 ◽  
Author(s):  
M. S. Rahul ◽  
E. Arun ◽  
P. Mohamed Shameem ◽  
J. Rajeesh
Keyword(s):  
Routing Algorithm ◽  
Link Failures

scholarly journals Distributed and Fault-Tolerant Routing for Borel Cayley Graphs

2012 ◽  
Vol 8 (10) ◽  
pp. 124245 ◽  
Author(s):  
Junghun Ryu ◽  
Eric Noel ◽  
K. Wendy Tang
Keyword(s):  
Interconnection Networks ◽  
Fault Tolerant ◽  
Cayley Graphs ◽  
Routing Algorithm ◽  
Topology Change ◽  
Link Failures ◽  
End To End Delay ◽  
Low Degree ◽  
Transitivity Property ◽  
Path Lengths

We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment. BCGs are known to be an efficient topology in interconnection networks because of their small diameters, short average path lengths, and low-degree connections. However, the application of BCGs is hindered by a lack of size flexibility and fault-tolerant routing. We propose a fault-tolerant routing algorithm for BCGs. Our algorithm exploits the vertex-transitivity property of Borel Cayley graphs and relies on extra information to reflect topology change. Our results show that the proposed method supports good reachability and a small End-to-End delay under various link failures scenarios.

scholarly journals Maximally Spatial-Disjoint Lightpaths in Optical Networks

2018 ◽  
Vol 10 (2) ◽  
pp. 733 ◽  
Author(s):  
M. Waqar Ashraf ◽  
Sevia M. Idrus ◽  
Farabi Iqbal
Keyword(s):  
Optical Networks ◽  
Optical Transmission ◽  
Routing Algorithm ◽  
Spatial Distance ◽  
Physical Plane ◽  
Network Nodes ◽  
Link Failures ◽  
All Optical ◽  
End To End

Lightpaths enable end-to-end all-optical transmission between network nodes. For survivable routing, traffic is often carried on a primary lightpath, and rerouted to another disjointed backup lightpath in case of the failure of the primary lightpath. Though both lightpaths can be physically disjointed, they can still fail simultaneously if a disaster affects them simultaneously on the physical plane. Hence, we propose a routing algorithm for provisioning a pair of link-disjoint lightpaths between two network nodes such that the minimum spatial distance between them (while disregarding safe regions) is maximized. Through means of simulation, we show that our algorithm can provide higher survivability against spatial-based simultaneous link failures (due to the maximized spatial distance).

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Precondition of a Routing Algorithm Dealing with Multiple Security Metrics

2011 ◽  
Vol E94-B (6) ◽  
pp. 1625-1629
Author(s):  
Atsufumi MORIYAMA ◽  
Hiroshi ISHINISHI ◽  
Katsuichi NAKAMURA ◽  
Yoshiaki HORI
Keyword(s):  
Routing Algorithm ◽  
Security Metrics

Rollback Links Characterization for the Snapshot Routing Algorithm in Polar-Orbit Satellite Networks

2015 ◽  
Vol E98.B (8) ◽  
pp. 1715-1724 ◽  
Author(s):  
Zhu TANG ◽  
Chunqing WU ◽  
Zhenqian FENG ◽  
Wanrong YU ◽  
Baokang ZHAO ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Satellite Networks ◽  
Polar Orbit ◽  
Orbit Satellite

An adaptive routing algorithm for integrated information networks

2019 ◽  
Vol 16 (7) ◽  
pp. 195-206 ◽  
Author(s):  
Feng Wang ◽  
Dingde Jiang ◽  
Sheng Qi
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Information Networks ◽  
Integrated Information
Sign in / Sign up

Export Citation Format

Share Document