Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Multilayer Client-Server Queueing Network Model with Synchronous and Asynchronous Messages
IEEE Transactions on Software Engineering
Modeling IP traffic using the batch Markovian arrival process
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Dimensioning the contention channel of DOCSIS cable modem networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
On the applicability of the number of collisions in p-persistent CSMA/CD protocols
Computers and Operations Research
Multi-class Markovian arrival processes and their parameter fitting
Performance Evaluation
On the performance modelling and optimisation of DOCSIS HFC networks
Network performance engineering
| Hi-index | 0.01 |
In this paper we determine the optimal fraction c^* of the uplink channel capacity that should be dedicated to the contention channel in a DOCSIS cable network in order to minimize its mean response time. For this purpose, we have developed an open queueing network with a non-standard form of blocking consisting of tens to hundreds of nodes. The network contains several types of customers that enter the network at various points according to a Markovian arrival process with marked customers. One of the main building blocks of the model exists in capturing the behavior of the conflict resolution algorithm by means of a single processor sharing queue. To assess the performance characteristics of this open queueing network we rely on an advanced decomposition technique that is specifically designed to deal with the Markovian nature of the arrival pattern. Several simulations are run to confirm the accuracy of the decomposition technique. We also explore the impact of a variety of systems parameters, e.g., the number of cable modems, the initial backoff window size, the correlation structure of the arrival process, the mean packet sizes, etc., on the optimal fraction c^*.