A simple scheme for termination detection in delay tolerant networks

Author

Katiyar, Shivendra ; Karmakar, Sushanta

Author_Institution

Dept. of Comput. Sci., Indian Inst. of Technol. Guwahati, Guwahati, India

fYear

2011

fDate

27-29 May 2011

Firstpage

478

Lastpage

482

Abstract

Termination detection in distributed systems has been a popular problem of study. It involves determining whether a computation running on multiple nodes has ceased all its activities. A large number of termination detection algorithms have been proposed with different computational models and methodologies. Here, termination detection is being investigated in the context of link-failure model which is common in Delay Tolerant Networks. A spanning tree based termination detection algorithm is used to suit such a model. Termination detection is freezed locally until the spanning tree is restored, rather than restarting it from the scratch again.

Keywords

computer network reliability; failure analysis; fault tolerant computing; program verification; trees (mathematics); computational models; delay tolerant networks; distributed systems; link-failure model; spanning tree; termination detection algorithm; Color; Computational modeling; Computer crashes; Switches; Termination detection; delay tolerant networks; link failure; spanning tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Conference_Location

Xi´an

Print_ISBN

978-1-61284-485-5

Type

conf

DOI

10.1109/ICCSN.2011.6014939

Filename

6014939