DSpace Repository

Self-stabilizing multi-agent system for distributed tree graphs

Show simple item record

dc.contributor.author Nguyen Thi Phi Loan en_US
dc.date.accessioned 2015-01-12T10:39:47Z
dc.date.available 2015-01-12T10:39:47Z
dc.identifier.other AIT Thesis no.CS-02-19 en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/248
dc.description Bangkok : Asian Institute of Technology, 2002 en_US
dc.description 128 p. en_US
dc.description.abstract Nowadays, the distributed systems are a pplied 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 sp anning tree and so on. However, almost of these algorithms are writte n by the lower level language. The complexity of the algorithm itself and the limit of language in expressing cause the algorithms more difficult to understand. This thesis classifies some problems of th e self-stabilizing algor ithms and transforms them into the multi-agent systems (MAS).
dc.relation.ispartof Thesis no. CS-02-19 en_US
dc.relation.ispartof Asian Institute of Technology. Thesis no. CS-02-19 en_US
dc.subject Self-stabilization (Computer science) en_US
dc.subject Computer algorithms en_US
dc.title Self-stabilizing multi-agent system for distributed tree graphs en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account