Abstract
Many communication networks such as wireless networks only provide stochastic service guarantees. For analyzing stochastic service guarantees, research efforts have been made in the past few years to develop stochastic network calculus, a probabilistic version of (min, +) deterministic network calculus. However, many challenges have made the development difficult. Some of them are closely related to server modeling, which include output characterization, concatenation property, stochastic backlog guarantee, stochastic delay guarantee, and per-flow service under aggregation. In this paper, we propose a server model, called stochastic service curve to facilitate stochastic service guarantee analysis. We show that with the concept of stochastic service curve, these challenges can be well addressed. In addition, we introduce strict stochastic server to help find the stochastic service curve of a stochastic server, which characterizes the service of the server by two stochastic processes: an ideal service process and an impairment process.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ayyorgun, S., Cruz, R.L.: A composable service model with loss and a scheduling algorithm. In: Proc. IEEE INFOCOM 2004 (2004)
Ayyorgun, S., Feng, W.: A systematic approach for providing end-to-end probabilistic QoS guarantees. In: Proc. IEEE IC3N 2004 (2004)
Burchard, A., Liebeherr, J., Patek, S.D.: A calculus for end-to-end statistical service guarantees. Technical report, CS-2001-19, University of Virginia (2002)
Chang, C.-S.: Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans. Automatic Control 39(5), 913–931 (1994)
Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, Heidelberg (2000)
Cruz, R.L.: A calculus for network delay, part I: network elements in isolation. IEEE Trans. Information Theory 37(1), 114–131 (1991)
Cruz, R.L.: A calculus for network delay, part II: network analysis. IEEE Trans. Information Theory 37(1), 132–141 (1991)
Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE JSAC 13(6), 1048–1056 (1995)
Cruz, R.L.: Quality of service management in integrated services networks. In: Proc. 1st Semi-Annual Research Review, CWC, UCSD (June 1996)
Hassan, M., Krunz, M.M., Matta, I.: Markov-based channel characterization for tractable performance analysis in wireless packet networks. IEEE Trans. Wireless Communications 3(3), 821–831 (2004)
Jiang, Y., Emstad, P.J.: Analysis of stochastic service guarantees in communication networks: A server model. Technical report, Q2S, NTNU (April 2005)
Jiang, Y., Emstad, P.J.: Analysis of stochastic service guarantees in communication networks: A traffic model. Technical report, Q2S, NTNU (February 2005)
Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Trans. Information Theory 44(3), 1087–1096 (1998)
Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queueing Systems for the Internet. Springer, Heidelberg (2001)
Lee, K.: Performance bounds in communication networks with variable-rate links. In: Proc. ACM SIGCOMM 1995, pp. 126–136 (1995)
Li, C., Burchard, A., Liebeherr, J.: A network calculus with effective bandwidth. Technical report, CS-2003-20, University of Virginia (November 2003)
Liebeherr, J.: IWQoS 2004 Panel Talk: Post-Internet QoS Research (2004)
Liu, Y., Tham, C.-K., Jiang, Y.: A stochastic network calculus. Technical report, ECE-CCN-0301, National University of Singapore (December 2003)
Liu, Y., Tham, C.-K., Jiang, Y.: Conformance study for networks with service level agreements. Computer Networks (2005) (in press)
Loynes, R.M.: The stability of a queue with non-independent inter-arrival and service times. Proc. of the Cambridge Philosophical Society 58(3), 497–520 (1962)
Starobinski, D., Sidi, M.: Stochastically bounded burstiness for communication networks. IEEE Trans. Information Theory 46(1), 206–212 (2000)
Workshop Attendees. Report of the National Science Foundation Workshop on Fundamental Research in Networking (April 2003)
Yaron, Q., Sidi, M.: Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. Networking 1, 372–385 (1993)
Yin, Q., Jiang, Y., Jiang, S., Kong, P.Y.: Analysis on generalized stochastically bounded bursty traffic for communication networks. In: Proc. IEEE LCN 2002 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, Y., Emstad, P.J. (2005). Analysis of Stochastic Service Guarantees in Communication Networks: A Server Model. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_19
Download citation
DOI: https://doi.org/10.1007/11499169_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)