The performance of the consensus algorithm running on FDDI

Author

Sergent, Nicole

Author_Institution

Dept. d´´Inf., Ecole Polytech. Fed. de Lausanne, Switzerland

fYear

1998

fDate

21-23 Jan 1998

Firstpage

77

Lastpage

83

Abstract

This paper presents an application of Hierarchical Coloured Timed Petri Nets to the modelling and the performance evaluation of a distributed consensus algorithm. We took a top down modular approach to manage the complexity of the considered protocols. The termination time of the consensus algorithm is mainly set by the communications cost, i.e. by the timing characteristics of the communication network. In a simplified way, the network latency is taken into account in the system model. As the underlying physical network we have considered FDDI. By simulating the consensus Petri net model, it is possible to evaluate the termination time of the consensus algorithm

Keywords

FDDI; Petri nets; computational complexity; delays; performance evaluation; protocols; timing; FDDI; communication network; communications cost; complexity; consensus algorithm; consensus algorithm performance; distributed consensus algorithm; hierarchical coloured timed Petri nets; modelling; network latency; performance evaluation; protocols; termination time; timing characteristics; top down modular approach; Computational modeling; Costs; Delay; Distributed algorithms; Distributed computing; FDDI; Fault tolerant systems; Petri nets; Telecommunication traffic; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1998. PDP '98. Proceedings of the Sixth Euromicro Workshop on

Conference_Location

Madrid

Print_ISBN

0-8186-8332-5

Type

conf

DOI

10.1109/EMPDP.1998.647183

Filename

647183