Abstract

Since network failures have a huge negative impact on our daily life, networks should be recovered from the failures as soon as possible. Although a lot of IP fast reroute methods have been proposed, most methods focus on multiple link failures or a single node failure. This paper proposes an IP fast reroute method which can reroute packets against multiple node failures. The paper is the first paper which deals with multiple node failures in the research area on IP fast reroute. The proposed method generates spanning trees to bypass the failures from a given network topology in network design stage, and reroutes a packet using one of the generated spanning trees every time the packet encounters a node failure in network operation stage. Numerical example shows that such spanning trees can be easily generated using our proposed method.

Original languageEnglish
Title of host publicationICTC 2020 - 11th International Conference on ICT Convergence
Subtitle of host publicationData, Network, and AI in the Age of Untact
PublisherIEEE Computer Society
Pages714-719
Number of pages6
ISBN (Electronic)9781728167589
DOIs
Publication statusPublished - Oct 21 2020
Event11th International Conference on Information and Communication Technology Convergence, ICTC 2020 - Jeju Island, Korea, Republic of
Duration: Oct 21 2020Oct 23 2020

Publication series

NameInternational Conference on ICT Convergence
Volume2020-October
ISSN (Print)2162-1233
ISSN (Electronic)2162-1241

Conference

Conference11th International Conference on Information and Communication Technology Convergence, ICTC 2020
Country/TerritoryKorea, Republic of
CityJeju Island
Period10/21/2010/23/20

Keywords

  • IP Fast Reroute
  • Multiple Node Failures
  • Span-ning Tree

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'An IP Fast Reroute Method against Multiple Node Failures'. Together they form a unique fingerprint.

Cite this