An analytical model for predicting the performance of protocol software implementation in a layered communication architecture is proposed. Each layer is modeled by a queuing network. The model is constructed by focusing the behavior of the protocol entity in a layer. A first come, first served (FCFS) server queue with preemptive priority is employed for an entity and an infinite-server queue for response time of acknowledge packets. Respective layer models are piled up by embedding the lower services in the infinite-server queue. From the perspective of end-to-end performance, the model provides a solution for the following problems, which arise in implementing a layered communication protocol: assigning each layer's process to a processor; giving priority to respective processes in each processor; and providing an error recovery service. The authors present an approximate analysis to obtain an average end-to-end transmission delay and discuss the possible solutions for the problems mentioned.<<ETX>>
[1]
K. Mani Chandy,et al.
The MVA priority approximation
,
1984,
TOCS.
[2]
Pieter S. Kritzinger,et al.
A Performance Model of the OSI Communication Architecture
,
1986,
IEEE Trans. Commun..
[3]
Lionel C. Mitchell,et al.
End-To-End Performance Modeling of Local Area Networks
,
1986,
IEEE J. Sel. Areas Commun..
[4]
Masayuki Murata,et al.
Two-layer modeling for local area networks
,
1988,
IEEE Trans. Commun..
[5]
Paul J. Kühn,et al.
Comparison of Communication Services with Connection-Oriented and Connectionless Data Transmission
,
1985,
MMB.
[6]
Philippe A. Janson,et al.
Connection-oriented versus connectionless protocols: A performance study
,
1985,
IEEE Transactions on Computers.
[7]
N. K. Jaiswal,et al.
Priority queues
,
1968
.
[8]
Stephen S. Lavenberg,et al.
Mean-Value Analysis of Closed Multichain Queuing Networks
,
1980,
JACM.