Network calculus meets queueing theory -a simulation based approach to bounded queues Export

@proceedings{citeulike:561441, abstract = {Quality of Service (QoS) is an area with high academic curiosity. Our long-term goal is to develop a unified mathematical model. This paper is a first step towards this ambitious goal. The most widespread models for network QoS are network calculus and queueing theory. While the strength of queueing theory is its proven applicability to a wide area of problems, Network calculus can offer performance guarantees. We analyse by simulation the benefit of bringing the two of them together, i.e., bounding the stochastic processes of a queue with methods from network calculus. A basic result from network calculus is that enforcing traffic shaping and service curves bounds the buffer. This leads to denying buffer states in queues with infinite buffer. Specifically, we analyse what happens with the probability mass of such buffer states. Finally, we discuss how our results can be used for dimensioning buffers for multiplexed traffic.}, author = {Pandit, K. and Schmittt, J. and Steinmetz, R.}, citeulike-article-id = {561441}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1309365}, journal = {Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on}, keywords = {network\_calculus}, pages = {114--120}, posted-at = {2006-03-23 17:22:02}, priority = {2}, title = {Network calculus meets queueing theory -a simulation based approach to bounded queues}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1309365}, year = {2004} }

TY - CONF ID - citeulike:561441 L3 - citeulike-article-id:561441 N2 - Quality of Service (QoS) is an area with high academic curiosity. Our long-term goal is to develop a unified mathematical model. This paper is a first step towards this ambitious goal. The most widespread models for network QoS are network calculus and queueing theory. While the strength of queueing theory is its proven applicability to a wide area of problems, Network calculus can offer performance guarantees. We analyse by simulation the benefit of bringing the two of them together, i.e., bounding the stochastic processes of a queue with methods from network calculus. A basic result from network calculus is that enforcing traffic shaping and service curves bounds the buffer. This leads to denying buffer states in queues with infinite buffer. Specifically, we analyse what happens with the probability mass of such buffer states. Finally, we discuss how our results can be used for dimensioning buffers for multiplexed traffic. JF - Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on EP - 120 TI - Network calculus meets queueing theory -a simulation based approach to bounded queues SP - 114 KW - network_calculus AU - Pandit, K AU - Schmittt, J AU - Steinmetz, R PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1309365 ER -