Some models for contention resolution in cable networks

DOI10.1007/3-540-47906-6_9MaRDI QIDQ3045036zbMATH OpenFDO

Authors Dee Denteneer, Jacques Resing, Onno Boxma

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2345/23450117.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1263198
• Stochastic Contention Resolution With Short Delays
• Analysis of contention tree algorithms
• A new contention resolution procedure for HFC access networks and its performance evaluation
• Contention resolution with constant expected delay

Cited in

(4)

• The equivalence between processor sharing and service in random order.
• A new contention resolution procedure for HFC access networks and its performance evaluation
• Queues in DOCSIS cable modem networks
• HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES

This page was built for publication: Some models for contention resolution in cable networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3045036)