Abstract
In this paper, we analyse a finite sized discrete time priority buffer with two types of packet arrivals, referred to as class 1 and class 2 packets. Packets of both classes arrive according to a discrete batch Markovian arrival process, taking into account the correlated nature of arrival processes in heterogeneous telecommunication networks. Packets of class 1 are assumed to have both space priority and transmission priority over packets of class 2. In particular, the partial buffer sharing acceptance policy is adopted as space priority mechanism. Using a matrix analytic approach, the buffer content is analysed and through some numerical examples, the impact of the priority scheduling, the threshold and the correlation in the arrival process is demonstrated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Radha, H., Chen, Y., Parthasarathy, K., Cohen, R.: Scalable internet video using MPEG-4. Signal Processing: Image communication 15(1-2), 95–126 (1999)
Laevens, K., Bruneel, H.: Discrete-time multiserver queues with priorities. Performance Evaluation 33(4), 249–275 (1998)
Mehmet Ali, M., Song, X.: A performance analysis of a discrete-time priority queueing system with correlated arrivals. Performance Evaluation 57(3), 307–339 (2004)
Takine, T., Sengupta, B., Hasegawa, T.: An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes. IEEE Transactions on Communications 42(2-4), 1837–1845 (1994)
Walraevens, J., Steyaert, B., Bruneel, H.: Performance analysis of a single-server ATM queue with a priority scheduling. Computers & Operations Research 30(12), 1807–1829 (2003)
Walraevens, J., Wittevrongel, S., Bruneel, H.: Performance analysis of a priority buffer with train arrivals. In: Proceedings of the 2006 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2006), Simulation Series 38(3), Calgary (July 2006), pp. 586–594 (2006)
Latouche, G., Ramaswami, V.: Introduction to matrix analytic methods in stochastic modeling. Series on statistics and applied probability, ASA-SIAM (1999)
Van Velthoven, J., Van Houdt, B., Blondia, C.: The impact of buffer finiteness on the loss rate in a priority queueing system. In: Horváth, A., Telek, M. (eds.) EPEW 2006. LNCS, vol. 4054, pp. 211–225. Springer, Heidelberg (2006)
Kröner, H., Hébuterne, G., Boyer, P., Gravey, A.: Priority management in ATM switching nodes. IEEE Journal on Selected Areas in Communications 9(3), 418–427 (1991)
Zhao, J., Li, B., Cao, X., Ahmad, I.: A matrix-analytic solution for the DBMAP/PH/1 priority queue. Queueing Systems 53(3), 127–145 (2006)
Spaey, K.: Superposition of Markovian traffic sources and frame aware buffer acceptance. PhD thesis, Universitaire Instelling Antwerpen (2002)
Blondia, C., Casals, O.: Statistical multiplexing of VBR sources: A matrix-analytic approach. Performance Evaluation 16, 5–20 (1992)
Fiems, D., Bruneel, H.: A note on the discretization of Little’s result. Operations Research Letters 30(1), 17–18 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiems, D., Walraevens, J., Bruneel, H. (2007). Performance of a Partially Shared Priority Buffer with Correlated Arrivals. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)