DocumentCode
1924270
Title
Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization
Author
Srimani, Pradip K. ; Xu, Zhenyu
Author_Institution
Dept. of Comput. Sci., Clemson Univ., SC
fYear
2007
fDate
5-7 March 2007
Firstpage
27
Lastpage
31
Abstract
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms
Keywords
computational complexity; distributed algorithms; fault tolerance; graph theory; defensive alliance; distributed protocol; fault tolerant distributed algorithm; network graph; offensive alliance; self-stabilization design; Algorithm design and analysis; Bibliographies; Computer science; Convergence; Design optimization; Distributed algorithms; Fault tolerance; Fault tolerant systems; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing: Theory and Applications, 2007. ICCTA '07. International Conference on
Conference_Location
Kolkata
Print_ISBN
0-7695-2770-1
Type
conf
DOI
10.1109/ICCTA.2007.54
Filename
4127338
Link To Document