Institutional Repository

Protocol performance using image protocols

Show simple item record

dc.contributor.author Kritzinger, PS
dc.contributor.editor Kritzinger, P.
dc.date.accessioned 2019-05-14T11:56:15Z
dc.date.available 2019-05-14T11:56:15Z
dc.date.issued 1987
dc.identifier.citation Proceedings of the 4th South African Computer Symposium, Holiday Inn, Pretoria, 1-3 July 1987, edited by P. Kritzinger (UCT). en
dc.identifier.uri http://hdl.handle.net/10500/25420
dc.description.abstract Performance analyses of data communication systems do not always rely on a detailed analysis of the underlying protocols. Those analyses which do, usually rely on an analysis of the protocol state transition graph. These graphs tend to become very large for nontrivial protocols and the analyses correspondingly complex. Image protocols are a recent approach to reduce the complexity of communication protocol analysis. The method allows for the construction of an image protocol which is generally sma.ller than the original protocol and its analysis therefore less complex. An image protocol system is said to be faithful if it preserves the safety and liveness properties \ of the original protocol system. In this paper we show that an image protocol is also faithful as far as its performance is concerned, a result which simplifies performance studies of the protocol considerably. An example which illustrates the principles involved is included. en
dc.language.iso en en
dc.subject Protocol performance en
dc.subject Image protocol en
dc.subject Aggregation en
dc.subject State transition graph en
dc.subject Finite state machine en
dc.subject Multiclass queueing theory en
dc.subject Queueing network en
dc.subject MVA-algorithm en
dc.title Protocol performance using image protocols en
dc.type Article en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics