Petri net modeling and performance analysis of Z39.50 search and retrieval protocol

Author

Paranjpe, Roopali ; Zhou, MengChu ; Wang, Jiacun

Author_Institution

Paradyne Corp., Red Bank, NJ, USA

Volume

1

fYear

1997

fDate

12-15 Oct 1997

Firstpage

257

Abstract

This paper presents a Petri net approach to modeling and performance analysis of the Z39.50 search and retrieval protocol. The Z39.50 state tables present a complex set of events and actions. Based on these state tables, a Petri net model is for the first time constructed for the entire system comprising the protocol. A reachability graph analysis method is applied to the Petri net model to study the behavioral properties of the protocol. Assuming deterministic delays, time analysis is performed and completion times are computed for basic successful events and operations. A timed Petri net simulation tool is used to investigate the behavior of complex Z39.50 services and operations

Keywords

Petri nets; access protocols; client-server systems; database management systems; information retrieval; reachability analysis; software performance evaluation; Petri net modeling; Z39.50 search and retrieval protocol; behavioral properties; completion times; deterministic delays; performance analysis; reachability graph analysis method; state tables; time analysis; timed Petri net simulation tool; Automatic control; Computational modeling; Databases; Delay effects; Information retrieval; Libraries; Open systems; Performance analysis; Protocols; Standards organizations;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on

Conference_Location

Orlando, FL

ISSN

1062-922X

Print_ISBN

0-7803-4053-1

Type

conf

DOI

10.1109/ICSMC.1997.625759

Filename

625759