TY - GEN
T1 - A Markov-Modulated Bernoulli Process Approximation for the analysis of Banyan networks
AU - Meliksetian, Dikran S.
AU - Chen, C. Y.Roger
N1 - Publisher Copyright:
© 1993 ACM.
PY - 1993/6/1
Y1 - 1993/6/1
N2 - The Markov-Modulated Bernoulli Process (MMBP) model is used to analyze the delay experienced by messages in clocked, packed-switched Banyan networks with k X k output-buffered switches. This approach allows us to analyze both single packet messages and multipacket messages with general traffic pattern including uniform traffic, hot-spot traffic, locality of reference, etc. The ability to analyze multipacket messages is very important for multimedia applications. Previous work, which is only applicable to restricted message and traffic patterns, resorts to either heuristic correction factors to artificially tune the model or tedious computational efforts. In contrast, the proposed model, which is applicable to much more general message and traffic patterns, not only is an application of a theoretically complete model but also requires a minimal amount of computational effort. In all cases, the analytical results are compared with results obtained by simulation and are shown to be very accurate.
AB - The Markov-Modulated Bernoulli Process (MMBP) model is used to analyze the delay experienced by messages in clocked, packed-switched Banyan networks with k X k output-buffered switches. This approach allows us to analyze both single packet messages and multipacket messages with general traffic pattern including uniform traffic, hot-spot traffic, locality of reference, etc. The ability to analyze multipacket messages is very important for multimedia applications. Previous work, which is only applicable to restricted message and traffic patterns, resorts to either heuristic correction factors to artificially tune the model or tedious computational efforts. In contrast, the proposed model, which is applicable to much more general message and traffic patterns, not only is an application of a theoretically complete model but also requires a minimal amount of computational effort. In all cases, the analytical results are compared with results obtained by simulation and are shown to be very accurate.
UR - http://www.scopus.com/inward/record.url?scp=84939360134&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84939360134&partnerID=8YFLogxK
U2 - 10.1145/166955.167005
DO - 10.1145/166955.167005
M3 - Conference contribution
AN - SCOPUS:84939360134
T3 - Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993
SP - 183
EP - 194
BT - Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993
PB - Association for Computing Machinery, Inc
T2 - 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1993
Y2 - 10 May 1993 through 14 May 1993
ER -