Abstract
Concurrent distributed systems modelling is a complex task. When we add mobility, the scenario is still worse, as specific problems are added. Petri nets is a largely used formalism to model and analyze complex systems, specially distributed and concurrent ones. Petri nets models are executable, allowing the simulation of abstract specifications. For this reason, Petri nets have been widely used as a validation and specification tool. This paper presents results of a performance comparative study of three mobile agents design patterns. The Itinerary, Star-Shaped and Branching migration patterns were investigated as solutions to a distributed information retrieval system. The three solutions were modelled with timed Coloured Petri Nets. The models were validated using simulation and occurrence graph analysis techniques. Experiments were conducted using further simulations and data were collected in order to evaluate the performance of each design pattern. The obtained data allow us to conclude that, for the studied scenarios, the Branching Pattern presents the the best performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
