Context. Resource allocation is an important issue in order to complete a task in the field of agent system. Several protocols are available for task distribution and for efficient resource allocation among agents. Efficient task distribution and resource allocation among agents are often play important roles to obtain high performance. However, the situation becomes more complicated when the resources are dependent on each other where multiple buyers and providers of resources negotiate in parallel. Objectives. In this paper, we proposed an agent based protocol for synchronizing and allocating dependent resources that involves parallel negotiation between multiple buyers and providers of resources. Methods. Literature survey has been conducted in the studied areas in order to position the work and gain more knowledge. Moreover, to validate the proposed protocol, a simulation study was performed. Results. The suggested protocol can handle dependent resources negotiation parallel and the result illustrates that. Moreover, the approach can avoid broadcasting of call for proposals to reduce the communication overhead, which usually occur in many other protocols. Conclusion. In the suggested protocol, we have presented a new idea of re-planning with other techniques like Information board and leveled commitment. In a simulation study, it was identified that this approach is able to deal with the dependent resources according to the simulation results.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:bth-1920 |
| Date | January 2011 |
| Creators | Kulsumunnessa, Omme, Aslanyan, Zaruhi |
| Publisher | Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0019 seconds