Region Disjoint Paths in a Class of Optimal Line Graph Networks

Communication networks are one of the backbones to society, and it is important that they withstand failures. Improving the robustness of a network involves good algorithms for network connectivity and routing in the presence of faults. The importance of being able to connect the good parts of the network when catastrophic failures, natural or manmade, affect the system cannot be underestimated in either a military or a natural disaster situation. Traditional network robustness has been studied where point failures occur, with no reference to their locality. In reality, if regional failures are taken into consideration as the metric to evaluate the robustness of a network, then we can apply them to situations where simultaneous failures take place, but clustered in regions. Region Based Connectivity (RBC) was introduced in INFOCOM 2006, subsequent to which there have been some researchers who have looked at various aspects of this metric. In this paper, we look at the RBC of a class of uniform networks produced by recursive modified line graphs. This work deals with topological regions, and not geometric regions. The study shows that these networks display optimal RBC and calculates the upper bounds on the radius of these regions for optimal RBC.

[1]  Eytan Modiano,et al.  Geographic max-flow and min-cut under a circular disk failure model , 2012, INFOCOM.

[2]  Ling Zhou,et al.  Fault-Tolerance in Sensor Networks: A New Evaluation Metric , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Henry Selvaraj,et al.  Constrained Disjoint Paths in Geometric Networks , 2009, Int. J. Comput. Intell. Appl..

[4]  Miguel Angel Fiol,et al.  Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[5]  Arunabha Sen,et al.  Region-based connectivity - a new paradigm for design of fault-tolerant networks , 2009, 2009 International Conference on High Performance Switching and Routing.

[6]  Yusuke Kobayashi,et al.  Max-flow min-cut theorem and faster algorithms in a circular disk failure model , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[7]  G. Indumathi,et al.  Throughput Maximization in Wireless Systems Using an Adaptive Cross Layer Scheduling , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[8]  Eytan Modiano,et al.  Geographic max-flow and min-cut under a circular disk failure model , 2012, 2012 Proceedings IEEE INFOCOM.