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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Driel, C-J. van, van Grinsven, P.A.M., Pronk, V., Snijders, W.A.M.: The (r)evolution of access networks for the information super-highway. IEEE Communications Magazine 35 (1997) 2–10
Digital Video Broadcasting (DVB); DVB interaction channel for Cable TV distribution systems (CATV), working draft (Version 3), June 28, 2000, based on European Telecommunications Standard 300 800 (March 1998)
Mathys, P., Flajolet, Ph.: Q-ary collision resolution algorithms in random-access systems with free or blocked channel access. IEEE Trans. Inf. Theory 31 (1985) 217–243
Tsybakov, B.: Survey of USSR contributions to random multiple-access communications. IEEE Trans. Inf. Theory 31 (1985) 143–165
Kleinrock, L.: Queueing Systems, Vol. 2. Wiley, New York (1976)
Bertsekas, D.P., Gallager, R.G.: Data Networks. Prentice-Hall, Englewood Cliffs, N.J (1992)
Capetanakis, J.I.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25 (1979) 505–515
Tsybakov, B.S., Mikhailov, V.A.: Random multiple access of packets: Part and try algorithm. Probl. Peredachi Inf. 16 (1980) 65–79
Mitra, D.: Waiting time distributions for closed queueing network models of shared-processor systems. In: F.J. Kylstra (ed.), Performance’81, NHPC, Amsterdam (1981) 113–131
Kobayashi, H.: Modeling and Analysis. An Introduction to System Performance Evaluation Methodology. Addison-Wesley, Reading (Mass.) (1978)
Sevcik, K.C., Mitrani, I.: The distribution of queueing network states at input and output instants, In: M. Arato et al. (eds.), Performance’79, NHPC, Amsterdam (1979) 319–335
Borst, S.C., Boxma, O.J., Morrison, J.A., Núñez Queija, R.: The equivalence of processor sharing and service in random order. SPOR-Report 2002-01, Eindhoven University of Technology (2002)
Cohen, J.W.: On processor sharing and random order of service (Letter to the editor). J. Appl. Probab. 21 (1984) 937
Janssen, A.J.E.M., de Jong, M.J.M.: Analysis of contention tree-algorithms. IEEE Trans. Inf. Theory 46 (2000) 2163–2172
Denteneer, D., Pronk, V.: On the number of contenders in a contention tree. Proc. ITC Specialist Seminar, Girona (2001) 105–112
Boxma, O.J., Denteneer, D., Resing, J.A.C.: Some models for contention resolution in cable networks. EURANDOM Report 2001-037 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boxma, O., Denteneer, D., Resing, J. (2002). Some Models for Contention Resolution in Cable Networks. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive