Self-stabilizing multi-agent system for distributed tree graphs | |
| Author | Nguyen Thi Phi Loan |
| Call Number | AIT Thesis no.CS-02-19 |
| Subject(s) | Self-stabilization (Computer science) Computer algorithms |
| Note | A thesis progress submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. CS-02-19 |
| Abstract | Nowadays, the distributed systems are applied more and more and become the indispensable needs in the real life. However, due to the susceptible-to-failure nature of these systems, the self-stabilizing algorithms are proposed as a way to handle failures and bring back the system to the legitimate state. A number of self-stabilizing algorithms are proposed in many different problems such as spanning tree, leader election, minimum spa1ming tree and so on. However, almost of these algorithms are written by the lower level language. The complexity of the algorithm itself and the limit of language in expressing cause the algorithms more diffi cult to understand. This thesis classifies some problems of the self-stabilizing algoritluns and transforms them into the multi-agent systems (MAS). |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. CS-02-19 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung |
| Examination Committee(s) | Hoang Le Tien ;Bohez, Erik L. J. |
| Scholarship Donor(s) | Government of New Zealand |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2002 |