Delay models for contention trees in closed populations

Performance Evaluation

Volumn 53, Issue 3-4, 2003, Pages 169-185

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Cable networks; Contention tree; Machine repair model; Request grant mechanism

Indexed keywords

DATA TRANSFER; NETWORKS (CIRCUITS); TREES (MATHEMATICS);

DELAY MODELS;

POPULATION STATISTICS;

EID: 0038053212     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(03)00061-0     Document Type: Conference Paper

References (23)

1. Avi-Itzhak B., Halfin S., Response times in gated. M/G/1/ queues: the processor sharing case Queueing Syst. 4:1989;263-279.
2. D.P. Bertsekas, R.G. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1992.
3. S.C. Borst, O.J. Boxma, J.A. Morrison, R. Núñez Queija, The equivalence of processor sharing and service in random order, Oper. Res. Lett. 31 (2003) 254-262.
4. Capetanakis J.I., Tree algorithms for packet broadcast channels. IEEE Trans. Inform. Theory. 25:1979;505-515.
5. J.W. Cohen, The Single Server Queue, 2nd ed., North-Holland, Amsterdam, 1982.
6. Cohen J.W., On processor sharing and random order of service. J. Appl. Prob. 21:1984;937.
7. Coleman R.D., Use of a gate to reduce the variance of delays in queues with random service. Bell Syst. Tech. J. 52(8):1973;1403-1422.
8. Corner M.D., Liebeherr J., Golmie N., Bisdikian C., Su D.H., A priority scheme for the IEEE 802.14 MAC protocol for hybrid fiber-coax networks. IEEE/ACM Trans. Network. 8(2):2000;200-211.
9. D. Denteneer, V. Pronk, On the number of contenders in a contention tree, in: Proceedings of the ITC Specialist Seminar, Girona, 2001, pp. 105-112.
10. van Driel 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 Commun. Mag. 35(6):1997;2-10.
11. DVB, Digital Video Broadcasting (DVB), DVB interaction channel for cable TV distribution systems (CATV), Working draft, Version 3, 28 June 2000, based on European Telecommunications Standard 300 800, March 1998.
12. Janssen A.J.E.M., de Jong M.J.M., Analysis of contention tree-algorithms. IEEE Trans. Inform. Theory. 46:2000;2163-2172.
13. L. Kleinrock, Queueing Systems Vol. 2: Computer Applications, Wiley, New York, 1976.
14. H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley, Reading, MA, 1978.
15. Mathys P., Flajolet Ph., Q-ary collision resolution algorithms in random-access systems with free or blocked channel access. IEEE Trans. Inform. Theory. 31:1985;217-243.
16. Merakos L.F., Bisdikian C., Delay analysis of the n-ary stack random access algorithm. IEEE Trans. Inform. Theory. 34:1988;931-942.
17. D. Mitra, Waiting time distributions for closed queueing network models of shared-processor systems, in: F.J. Kylstra (Ed.), Proceedings of the Performance'81, North-Holland, Amsterdam, 1981, pp. 113-131.
18. K.C. Sevcik, I. Mitrani, The distribution of queueing network states at input and output instants, in: M. Arato, et al. (Eds.), Proceedings of the Performance'79, North-Holland, Amsterdam, 1979, pp. 319-335.
19. L. Takács, Introduction to the Theory of Queues, Oxford University Press, Oxford, 1962.
20. Tsybakov B.S., Mikhailov V.A., Random multiple access of packets: part and try algorithm. Problem Peredachi Inform. 16:1980;65-79.
21. Tsybakov B., Survey of USSR contributions to random multiple-access communications. IEEE Trans. Inform. Theory. 31:1985;143-165.
22. Vaulot E., Les formules d'Erlang et leur calcul pratique. Ann. Telecom. 6:1951;279-286.
23. Whitt W., Heavy-traffic approximations for service systems with blocking. AT&T Bell Lab. Tech. J. 63:1984;689-708.