A Mobile Agent Service-Oriented Scripting Language Encoded on a Process Calculus

Author(s):  
Hervé Paulino ◽  
Luís Lopes
2014 ◽  
Vol 25 (3) ◽  
pp. 666-709 ◽  
Author(s):  
MICHELE BOREALE ◽  
ROBERTO BRUNI ◽  
ROCCO DE NICOLA ◽  
MICHELE LORETI

Service-oriented computing is calling for novel computational models and languages with well-disciplined primitives for client–server interaction, structured orchestration and unexpected events handling. We present CaSPiS, a process calculus where the conceptual abstractions of sessioning and pipelining play a central role for modelling service-oriented systems. CaSPiS sessions are two-sided, uniquely named and can be nested. CaSPiS pipelines permit orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner's side of a session. Several examples are presented to provide evidence of the flexibility of the chosen set of primitives. One key contribution is a fully abstract encoding of Misra et al.'s orchestration language Orc. Another main result shows that in CaSPiS it is possible to program a ‘graceful termination’ of nested sessions, which guarantees that no session is forced to hang forever after the loss of its partner.


2008 ◽  
Vol 4 (4) ◽  
pp. 333-349
Author(s):  
Jinho Ahn

Mobile agent technology has emerged as a promising programming paradigm for developing highly dynamic and large-scale service-oriented computing middlewares due to its desirable features. For this purpose, first of all, scalable location-transparent agent communication issue should be addressed in mobile agent systems despite agent mobility. Although there were proposed several directory service and message delivery mechanisms, their disadvantages force them not to be appropriate to both low-overhead location management and fast delivery of messages to agents migrating frequently. To mitigate their limitations, this paper presents a scalable distributed directory service and message delivery mechanism. The proposed mechanism enables each mobile agent to autonomously leave tails of forwarding pointers on some few of its visiting nodes depending on its preferences. This feature results in low message forwarding overhead and low storage and maintenance cost of increasing chains of pointers per host. Also, keeping mobile agent location information in the effective binding cache of each sending agent, the sending agent can communicate with mobile agents much faster compared with the existing ones.


2015 ◽  
Vol 8 (1) ◽  
pp. 10
Author(s):  
Rao Sohail Iqbal ◽  
Shakeel Ahmad ◽  
Sher Afzal Khan

Sign in / Sign up

Export Citation Format

Share Document