Some Models for Contention Resolution in Cable Networks

Authors:
Onno J. Boxma;Dee Denteneer;Jacques Resing
Affiliations:
-;-;-
Venue:
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Year:
2002

Citing 4
Cited 3

Data networks

Data networks
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

Waiting Time Asymptotics in the Single Server Queue with Service in Random Order

Queueing Systems: Theory and Applications
Heavy traffic analysis of the discriminatory randomorderofservice discipline

ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
The equivalence between processor sharing and service in random order

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider some models for contention resolution in cable networks, in case the contention pertains to requests 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.