Some models for contention resolution in cable networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2345, Issue , 2002, Pages 117-128

  Boxma, Onno ^a   Denteneer, Dee ^b   Resing, Jacques ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Digital Signal Processing Group Prof   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ACCESS PROTOCOLS; CABLE NETWORKS; CONTENTION RESOLUTION; FIRST COME FIRST SERVED; RANDOM ORDER OF SERVICE; REPAIR FACILITIES; SERVICE ORDERS; STANDARD MACHINES;

CABLES;

EID: 23044534225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47906-6_9     Document Type: Conference Paper

References (16)

1. Driel van, C-J., 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
2. 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)
3. 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
4. Tsybakov, B.: Survey of USSR contributions to random multiple-access communications. IEEE Trans. Inf. Theory 31 (1985) 143-165
5. Kleinrock, L.: Queueing Systems, Vol. 2. Wiley, New York (1976)
6. Bertsekas, D.P., Gallager, R.G.: Data Networks. Prentice-Hall, Englewood Cliffs, N.J (1992)
7. Capetanakis, J.I.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25 (1979) 505-515
8. Tsybakov, B.S., Mikhailov, V.A.: Random multiple access of packets: Part and try algorithm. Probl. Peredachi Inf. 16 (1980) 65-79
9. Mitra, D.: Waiting time distributions for closed queueing network models of sharedprocessor systems. In: F.J.Kylstra (ed.), Performance’81, NHPC, Amsterdam (1981) 113-131
10. Kobayashi, H.: Modeling and Analysis. An Introduction to System Performance Evaluation Methodology. Addison-W esley, Reading (Mass.) (1978)
11. 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
12. Borst, S.C., Boxma, O.J., Morrison, J.A., Núñez Queija, R.: The equivalence of processor sharing and service in random order. SPOR-Rep ort 2002-01, Eindhoven University of Technology (2002)
13. Cohen, J.W.: On processor sharing and random order of service (Letter to the editor). J. Appl. Probab. 21 (1984) 937
14. Janssen, A.J.E.M., de Jong, M.J.M.: Analysis of contention tree-algorithms. IEEE Trans. Inf. Theory 46 (2000) 2163-2172
15. Denteneer, D., Pronk, V.: On the number of contenders in a contention tree. Proc. ITC Specialist Seminar, Girona (2001) 105-112
16. Boxma, O.J., Denteneer, D., Resing, J.A.C.: Some models for contention resolution in cable networks. EURANDOM Report 2001-037 (2001)