A Method and a Genetic Algorithm for Deriving Protocols for Distributed Applications with Minimum Communication Cost

We consider a set of rules for deriving the specification of the protocol of a distributed system from a given specification of services, and define and formulate the message exchange optimization problem using a 0-1 integer programming model. This problem is about determining the minimum number of messages to be exchanged between the physical locations of the distributed system, in order to reduce the communication cost. We then present a genetic algorithm for solving this problem. The main advantage of this algorithm, in comparison with exact algorithms, is that its complexity remains manageable for realistic large specifications. The experimental results show that the minimum number of messages to be exchanged is found in a very reasonable time. keywords protocol synthesis, service specification, protocol specification, communication cost, 0-1 integer linear programming, genetic algorithm