Title :
Termination detection in delay tolerant networks
Author :
Katiyar, Shivendra ; Karmakar, Sushanta
Author_Institution :
Dept. of Comput. Sci., Indian Inst. of Technol. Guwahati, Guwahati, India
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 :
distributed processing; program verification; system recovery; trees (mathematics); delay tolerant network; distributed system; link-failure model; spanning tree; termination detection; Color; Computational modeling; Computer crashes; Delay; Detection algorithms; Heuristic algorithms; Middleware; Termination detection; delay tolerant networks; link failure; spanning tree;
Conference_Titel :
Electronics Computer Technology (ICECT), 2011 3rd International Conference on
Conference_Location :
Kanyakumari
Print_ISBN :
978-1-4244-8678-6
Electronic_ISBN :
978-1-4244-8679-3
DOI :
10.1109/ICECTECH.2011.5942108
