Data networks
A priority scheme for the IEEE 802.14 MAC protocol for hybrid fiber-coax networks
IEEE/ACM Transactions on Networking (TON)
The Distribution of Queueing Network States at Input and Output Instants
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Analysis of contention tree algorithms
IEEE Transactions on Information Theory
The (R)evolution of access networks for the information superhighway
IEEE Communications Magazine
The equivalence between processor sharing and service in random order
Operations Research Letters
An M/G/1 Queueing Model with Gated Random Order of Service
Queueing Systems: Theory and Applications
Transient analysis of tree-Like processes and its application to random access systems
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
A discrete-time queueing model with periodically scheduled arrival and departure slots
Performance Evaluation
On the performance modelling and optimisation of DOCSIS HFC networks
Network performance engineering
Hi-index | 0.00 |
In this paper we consider some models for contention resolution in cable networks, in case the contention pertains to requests from a finite population of stations and is carried out by means of contention trees. More specifically, we study a number of variants of the standard machine repair model, that differ in the service order at the repair facility. Considered service orders are first come first served, random order of service, and gated random order of service. For these variants, we study the sojourn time at the repair facility. In the case of the free access protocol for contention trees, the first two moments of the access delay in contention are accurately represented by those of the sojourn time at the repair facility under random order of service. In the case of the blocked access protocol, gated random order of service is shown to be more appropriate.