Abstract
The decision and ability to aggregate packets can have significant impact on the performance of a communication system. The impact can be even more substantial when the system operates under a heavy load. In this paper, we present a queuing model which describes a packet encapsulation and aggregation process. Using this model, we provide analysis of the end-to-end delay of a packet transmitted by the system. The analytical model is verified by a simulation model of the system. We calculate the maximum number of packets in a single frame for which packet aggregation minimizes the average total delay of a packet. It is numerically shown that when the load is high, the higher the variability of the packet service time, the higher the maximum allowed number of packets in the frame should be to achieve the minimum average total packet delay. However, the impact of the variability of the packet service time is insignificant when the system load is moderate or low.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akar, N., Oguz, N.C., Sohraby, K.: A Novel Computational Method for Solving Finite QBD Processes. Communications in Statistics, Stochastic Models 16.2 (2000)
Akar, N., Oguz, N.C., Sohraby, K.: Matrix-Geometric Solution in Finite and Infinite M/G/1 Type Markov Chains: A Unifying Generalized State-Space Approach. IEEE J. on Selected Areas in Communications 16(5) (1998)
Akar, N., Sohraby, K.: An Invariant Subspace Approach in M/G/1 and G/M/1 Type Markov Chains. Communications in Statistics, Stochastic Models 13(3) (1997)
Bailey, N.T.J.: On queuing process with bulk service. J. of Royal Statistical Association 16 Series B, 80–87 (1954)
Chaudhry, M.L., Templeton, J.G.C.: A First Course in Bulk Queues. Wiley, New York (1983)
Chaudhry, M.L., Medhi, J., Sim, S.H., Templeton, J.G.C.: On a two hetrogeneous-server Markovian queue with general bulk service rule. Sankhyā 49 Series B, pp. 35–50 (1987)
Flanagan, W.A.: Voice over Frame Relay. Telecom Books, New York (1997)
Medhi, J.: Waiting time distribution in a Poisson queue with general bulk service rule. Management Sci. 21, 777–782 (1975)
Medhi, J.: Recent Developments in Bulk Queueing Models. Wiley Eastern, New Delhi (1984)
Medhi, J.: Stochastic Models in Queueuing Theory, 2nd edn. Academic Press, London (2003)
Neuts, M.F.: A general class of bulk queues with Poisson input. Ann. Math. Stat. 38, 759–770 (1967)
Neuts, M.F.: Matrix-Geometric Solutions to Stochastic Models-An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981)
Sim, S.H., Templeton, J.G.C.: Steady state results for the M/M(a,b)/c batch service system. Euro. J. Operations Research 21, 260–267 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, J.H., Gusak, O., Oliver, N., Sohraby, K. (2006). A Model of a Packet Aggregation System. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_49
Download citation
DOI: https://doi.org/10.1007/11902140_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)