Tight bounds in message delays despite faults in a class of line digraph networks

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

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

1 Scopus citations

Abstract

Communication networks must be designed to withstand failures. The robustness of a network needs to account for graceful performance degradation with multiple failures in the network. The traditional delay metric of the diameter of the network is insufficient in this regards to represent the message passing delay in the presence of faults. This paper explores the d-wide diameter of a class of regular extended line digraphs which bound the delays despite faults. By studying the container of the network's underlying graph, a measure of the distance between nodes through multiple node disjoint paths is obtained. This study shows that the class of networks designed by extended line digraphs has very tight upper bounds on the d-wide diameter and is just one more than the normal diameter. Thus despite d-1 node failures the worst case delay is just one more than that of the original network. This tight bound has very powerful uses in areas of enabling load balancing and bounded delays despite multiple network faults.

Original languageEnglish (US)
Title of host publicationProceedings - 14th International Symposium on Pervasive Systems, Algorithms and Networks, I-SPAN 2017, 11th International Conference on Frontier of Computer Science and Technology, FCST 2017 and 3rd International Symposium of Creative Computing, ISCC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages60-65
Number of pages6
Volume2017-November
ISBN (Electronic)9781538608401
DOIs
StatePublished - Nov 27 2017
Event14th International Symposium on Pervasive Systems, Algorithms and Networks, I-SPAN 2017, 11th International Conference on Frontier of Computer Science and Technology, FCST 2017 and 3rd International Symposium of Creative Computing, ISCC 2017 - Exeter, Devon, United Kingdom
Duration: Jun 21 2017Jun 23 2017

Other

Other14th International Symposium on Pervasive Systems, Algorithms and Networks, I-SPAN 2017, 11th International Conference on Frontier of Computer Science and Technology, FCST 2017 and 3rd International Symposium of Creative Computing, ISCC 2017
CountryUnited Kingdom
CityExeter, Devon
Period6/21/176/23/17

Keywords

  • D-wide network diameter
  • Fault Tolerance
  • Graph containers
  • Line digraphs
  • Load balancing
  • Network diameter
  • Routing delays

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Tight bounds in message delays despite faults in a class of line digraph networks'. Together they form a unique fingerprint.

Cite this