Preemption rates for a parallel link loss network

Performance Evaluation

Volumn 66, Issue 1, 2009, Pages 21-46

  Zhao, Zhen ^a   Weber, Steven ^a   de Oliveira, Jaudelice C ^a  

^a Drexel University   (United States)

Author keywords

Erlang B; Loss network; Lumpable; Nearly completely decomposable (NCD); Preemption

Indexed keywords

COMPUTER NETWORKS; LIGHT EMISSION; LUMINESCENCE; MARKOV PROCESSES; NETWORK PROTOCOLS; SENSOR NETWORKS; SEPARATION;

ERLANG-B; LOSS NETWORK; LUMPABLE; NEARLY COMPLETELY DECOMPOSABLE (NCD); PREEMPTION;

BLOCKING PROBABILITY;

EID: 54949141086     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2008.07.002     Document Type: Article

References (34)

1. S. Weber, J.C. de Oliveira, B. Willman, Z. Zhao, Combined preemption and adaptation in next generation multiservice networks, in: Proceedings of IEEE ICC 2006, Istanbul, Turkey, June 2006
2. Z. Zhao, B. Willman, S. Weber, J.C. de Oliveira, Performance analysis of a parallel link network with preemption, in: Proceedings of the 40th Annual Conference on Information Sciences and Systems, CISS'06, Princeton, NJ, March 2006
3. Z. Zhao, S. Weber, J.C. de Oliveira, Heavy traffic analysis of a multi-class loss link with preemption, in: Proceedings of the 41st Annual Conference on Information Sciences and Systems, CISS'07, Baltimore, MD, March 2007
4. J.C. de Oliveira, J.P. Vasseur, L. Chen, C. Scoglio, Label switched path (LSP) preemption policies for MPLS traffic engineering, Tech. Rep. RFC 4829, Internet Engineering Task Force (IETF), April 2007. http://www.rfc-editor.org/rfc/rfc4829.txt
5. M.J. Markowski, A.S. Sethi, Fully distributed wireless transmission of heterogeneous real-time data, in: Proceedings of the IEEE Vehicular Technology Conference, VTC, vol. 2, Ottawa, Ontario, Canada, May 1998, pp. 1439-1442
6. Haykin S. Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications 23 2 (2005) 201-220
7. J.A. Garay, I.S. Gopal, Call preemption in communication networks, in: Proceedings of IEEE INFOCOM, vol. 3, Florence, Italy, May 1992, pp. 1043-1050
8. M. Peyravian, A.D. Kshemkalyani, Connection preemption: Issues, algorithms, and a simulation study, in: Proceedings of IEEE INFOCOM, vol. 1, Kobe, Japan, April 1997, pp. 143-151
9. de Oliveira J.C., Scoglio C., Akyildiz I.F., and Uhl G. New preemption policies for DiffServ-aware traffic engineering to minimize rerouting in MPLS networks. IEEE/ACM Transactions on Networking 12 4 (2004) 733-745
10. J. Sung-eok, R.T. Abler, A.E. Goulart, The optimal connection preemption algorithm in a multi-class network, in: Proceedings of IEEE International Conference on Communications, ICC, vol. 4, New York, NY, April 2002, pp. 2294-2298
11. S. Tong, D. Hoang, O. Yang, Bandwidth allocation and preemption for supporting differentiated-service-aware traffic engineering in multi-service networks, in: Proceedings of IEEE International Conference on Communications, ICC, vol. 2, New York, NY, April 2002, pp. 1305-1309
12. V. Stanisic, M. Devetsikiotis, A dynamic study of providing quality of service using preemption policies with random selection, in: Proceedings of IEEE International Conference on Communications, ICC, vol. 3, Anchorage, AK, May 2003, pp. 1543-1546
13. F. Blanchy, L. Melon, G. Leduc, Routing in a MPLS network featuring preemption mechanisms, in: Proceedings of the International Conference on Telecommunications, ICT, vol. 1, Tahiti, Papeete, French Polynesia, February 2003, pp. 253-260
14. K. Yu, L. Zhang, H. Zhang, A preemption-aware path selection algorithm for DiffServ/MPLS networks, in: Proceedings of the IEEE Workshop on IP Operations and Management, Beijing, China, October 2004, pp. 129-133
15. R.C. Vieira, P.R. Guardieiro, A proposal and evaluation of a LSP preemption policy implemented with fuzzy logic and genetic algorithms in a DiffServ/MPLS test-bed, in: Proceedings of International Conference on Communications, Circuits and Systems, vol. 1, Hong Kong, China, May 2005, pp. 109-114
16. Ross K.W. Multiservice Loss Models for Broadband Communication Networks (1995), Springer-Verlag
17. Srikant R. The Mathematics of Internet Congestion Control (2003), Birkhäuser, Boston, MA
18. White H., and Christie L.S. Queuing with preemptive priorities or with breakdown. Operations Research 6 1 (1958) 79-95
19. Miller D.R. Computation of steady-state probabilities for M / M / 1 priority queues. Operations Research 29 5 (1981) 945-959
20. Buzen J.P., and Bondi A.B. The response times of priority classes under preemptive resume in M / M / m queues. Operations Research 31 3 (1983) 456-465
21. Ngo B., and Lee H. Analysis of a pre-emptive priority M / M / c model with two types of customers and restriction. Electronics Letters 26 15 (1990) 1190-1192
22. Cho Y.Z., and Un C.K. Analysis of the M / G / 1 queue under a combined preemptive/nonpreemptive priority discipline. IEEE Transactions on Communications 41 1 (1993) 132-141
23. Helly W. Two doctrines for the handling of two-priority traffic by a group of N servers. Operations Research 10 2 (1962) 268-269
24. Burke P.J. Priority traffic with at most one queueing class. Operations Research 10 4 (1962) 567-569
25. Calabrese D.A., Fischer M.J., Hoiem B.E., and Kaiser E.P. Modeling a voice network with preemption. IEEE Transactions on Communications 28 1 (1980) 22-27
26. Fischer M.J. Priority loss systems - unequal holding times. IIE Transactions 12 1 (1980) 47-53
27. Dayar T., and Stewart W.J. Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains. SIAM Journal of Matrix Analysis and its Applications 18 2 (1997) 482-498
28. Ball F., and Yeo G.F. Lumpability and marginalisability for continuous-time Markov chains. Journal of Applied Probability 30 3 (1993) 518-528
29. Kemeny J.G., and Snell J.L. Finite Markov Chains (1983), Springer-Verlag, New York, NY
30. Schehrer B. On the calculation of overflow systems with a finite number of sources and full available groups. IEEE Transactions on Communications Com-26 1 (1978) 75-82
31. Mitra D., and Morrison J.A. Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Transactions on Networking 2 6 (1994) 558-570
32. Yin G.G., and Zhang Q. Discrete-Time Markov Chains: Two-Time-Scale Methods and Applications (2005), Springer, New York, NY
33. Reiman M.I., and Schmitt J.A. Performance models of multirate traffic in various network implementations. In: Labetoulle J., and Roberts J.W. (Eds). Proceeding of 14th International Teletraffic Congress, Antibes Juan-les-Pins, France vol. 1b (1994), Elsevier Science B.V. 1217-1227
34. Meyer C.D. Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Review 31 2 (1989) 240-272