Region disjoint paths in a class of optimal line graph networks

Prashant D. Joshi, Arunabha Sen, Said Hamdioui, Koen Bertels

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 17th IEEE International Conference on Computational Science and Engineering, CSE 2014, Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014
EditorsXingang Liu, Didier El Baz, Ching-Hsien Hsu, Kai Kang, Weifeng Chen
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1256-1260
Number of pages5
ISBN (Electronic)9781479979813
DOIs
StatePublished - Jan 26 2015
Event17th IEEE International Conference on Computational Science and Engineering, CSE 2014 - Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014 - Chengdu, China
Duration: Dec 19 2014Dec 21 2014

Publication series

NameProceedings - 17th IEEE International Conference on Computational Science and Engineering, CSE 2014, Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014

Other

Other17th IEEE International Conference on Computational Science and Engineering, CSE 2014 - Jointly with 13th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2014, 13th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2014 and 8th International Conference on Frontier of Computer Science and Technology, FCST 2014
CountryChina
CityChengdu
Period12/19/1412/21/14

Keywords

  • Line graphs
  • Network connectivity
  • Region Based Connectivity
  • Topological regions

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Region disjoint paths in a class of optimal line graph networks'. Together they form a unique fingerprint.

Cite this