• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Analysis of stochastic service guarantees in communication networks: A traffic model. (2005)

by Yuming Jiang , Peder J Emstad
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 25
Next 10 →

Stochastic Network Calculus

by Yuming Jiang , 2008
"... A basic calculus is presented for stochastic service guaran-tee analysis in communication networks. Central to the cal-culus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service c ..."
Abstract - Cited by 116 (23 self) - Add to MetaCart
A basic calculus is presented for stochastic service guaran-tee analysis in communication networks. Central to the cal-culus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the deterministic network calculus framework. With m.b.c stochastic arrival curve and stochastic service curve, vari-ous basic results are derived under the (min, +) algebra for the general case analysis, which are crucial to the develop-ment of stochastic network calculus. These results include (i) superposition of flows, (ii) concatenation of servers, (iii) output characterization, (iv) per-flow service under aggre-gation, and (v) stochastic backlog and delay guarantees. In addition, to perform independent case analysis, stochastic strict server is defined, which uses an ideal service process and an impairment process to characterize a server. The concept of stochastic strict server not only allows us to im-prove the basic results (i) – (v) under the independent case, but also provides a convenient way to find the stochastic ser-vice curve of a serve. Moreover, an approach is introduced to find the m.b.c stochastic arrival curve of a flow and the stochastic service curve of a server.
(Show Context)

Citation Context

...hers as a crucial step (e.g. [37][27]). In recent years, many attempts have been made for developing a stochastic network calculus, which include [22][39][5] [6] [25][13][31][34][40][4][26][28][2][19]=-=[18]-=-[9][17]. However, the following basic properties required by a network calculus have made the stochastic network calculus challenging: (P.1) (Superposition Property) The superposition of flows can be ...

A min-plus calculus for end-to-end statistical service guarantees

by Almut Burchard, Jörg Liebeherr, Stephen Patek - IEEE TRANSACTION ON INFORMATION THEORY , 2006
"... The network calculus offers an elegant framework for determining worst-case bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic b ..."
Abstract - Cited by 35 (5 self) - Add to MetaCart
The network calculus offers an elegant framework for determining worst-case bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic bound on the service received by an individual flow or an aggregate of flows. The problem of concatenating per-node statistical service curves to form an end-to-end (network) statistical service curve is explored. Two solution approaches are presented that can each yield statistical network service curves. The first approach requires the availability of time scale bounds at which arrivals and departures at each node are correlated. The second approach considers a service curve that describes service over time intervals. Although the latter description of service is less general, it is argued that many practically relevant service curves may be compliant to this description.
(Show Context)

Citation Context

.... After the manuscript for this paper became available in 2002 [9], several studies have appeared on the network calculus, some extending the framework developed in this paper, e.g., [3], [13], [20], =-=[22]-=-, [28], [30]. The statistical network calculus has also been related to other analytical techniques. For example, in [28] it has been shown that the effective bandwidth theory [23] can be expressed in...

On Superlinear Scaling of Network Delays

by Almut Burchard, Jörg Liebeherr, Florin Ciucu
"... We investigate scaling properties of end-to-end delays in packet networks for a flow that traverses a sequence of H nodes and that experiences cross traffic at each node. When the traffic flow and the cross traffic do not satisfy independence assumptions, we find that delay bounds scale faster than ..."
Abstract - Cited by 14 (7 self) - Add to MetaCart
We investigate scaling properties of end-to-end delays in packet networks for a flow that traverses a sequence of H nodes and that experiences cross traffic at each node. When the traffic flow and the cross traffic do not satisfy independence assumptions, we find that delay bounds scale faster than linearly. More precisely, for exponentially bounded packetized traffic we show that delays grow with Θ(H log H) in the number of nodes on the network path. This superlinear scaling of delays is qualitatively different from the scaling behavior predicted by a worst-case analysis or by a probabilistic analysis assuming independence of traffic arrivals at network nodes.

Delay bounds in communication networks with heavy-tailed and self-similar traffic

by Jörg Liebeherr, Almut Burchard, Florin Ciucu - IEEE Transactions on Information Theory , 2012
"... Traffic with self-similar and heavy-tailed characteristics has been widely reported in communication networks, yet, the state-of-the-art of analytically predicting the delay performance of such networks is lacking. We address a particularly difficult type of heavy-tailed traffic where only the first ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
Traffic with self-similar and heavy-tailed characteristics has been widely reported in communication networks, yet, the state-of-the-art of analytically predicting the delay performance of such networks is lacking. We address a particularly difficult type of heavy-tailed traffic where only the first moment can be computed, and present nonasymptotic end-to-end delay bounds for such traffic. The derived performance bounds are non-asymptotic in that they do not assume a steady state, large buffer, or many sources regime. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is described by service curves. Our analysis considers a multi-hop path of fixed-capacity links with heavy-tailed self-similar cross traffic at each node. A key contribution of the analysis is a novel probabilistic sample-path bound for heavy-tailed arrival and service processes, which is based on a scale-free sampling method. We explore how delays scale as a function of the length of the path, and compare them with lower bounds. A comparison with simulations illustrates pitfalls when simulating self-similar heavy-tailed traffic, providing further evidence for the need of analytical bounds. I.
(Show Context)

Citation Context

...those governed by fractional Brownian motion [30], but do not extend to heavy-tailed distributions. There are also efforts for extending the network calculus to heavy-tailed distributions [15], [16], =-=[20]-=-, [21], which are discussed in more detail in the next section. The remainder of this paper is organized as follows. In Sections II and III, respectively, we discuss our characterization of heavy-tail...

A Calculus for Stochastic QoS Analysis

by Yong Liu , Chen-khong Tham , Yuming Jiang , 2006
"... The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performanc ..."
Abstract - Cited by 9 (7 self) - Add to MetaCart
The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e. deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.

A (min, ×) Network Calculus for Multi-Hop Fading Channels

by Hussein Al-zubaidy, Jörg Liebeherr, Almut Burchard , 2013
"... A fundamental problem for the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
A fundamental problem for the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate, the performance analysis of wireless networks has resorted to higher-layer abstractions, e.g., using Markov chain models. In this work, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistical bounds on delay and backlog across multiple nodes. We conduct the analysis in a transfer domain, which we refer to as the SNR domain, where the service process at a link is characterized by the instantaneous signalto-noise ratio at the receiver. We discover that, in the transfer domain, the network model is governed by a dioid algebra, which we refer to as (min, ×) algebra. Using this algebra we derive the desired delay and backlog bounds. An application of the analysis is demonstrated for a simple multi-hop network with Rayleigh fading channels.
(Show Context)

Citation Context

...performance analysis of wireless networks with fading channels include queueing theory [7], [13], [16], effective bandwidth [12], [18], [24]– [26] and, more recently, network calculus [5], [9], [10], =-=[14]-=-, [19], [23]. A detailed discussion of these works is given in [1]. The stochastic properties of fading channels present a formidable challenge for a network-layer analysis since the service processes...

Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic

by Jörg Liebeherr, Almut Burchard, Florin Ciucu , 2010
"... Traffic with self-similar and heavy-tailed characteristics has been widely reported in networks, yet, only few analytical results are available for predicting the delay performance of such networks. We address a particularly difficult type of heavy-tailed traffic where only the first moment can be ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Traffic with self-similar and heavy-tailed characteristics has been widely reported in networks, yet, only few analytical results are available for predicting the delay performance of such networks. We address a particularly difficult type of heavy-tailed traffic where only the first moment can be computed, and present the first non-asymptotic end-to-end delay bounds for such traffic. The derived performance bounds are non-asymptotic in that they do not assume a steady state, large buffer, or many sources regime. Our analysis considers a multihop path of fixed-capacity links with heavy-tailed self-similar cross traffic at each node. A key contribution of the analysis is a probabilistic sample-path bound for heavy-tailed arrival and service processes, which is based on a scale-free sampling method. We explore how delays scale as a function of the length of the path, and compare them with lower bounds. A comparison with simulations illustrates pitfalls when simulating self-similar heavy-tailed traffic, providing further evidence for the need of analytical bounds.
(Show Context)

Citation Context

...those governed by fractional Brownian motion [23], but do not extend to heavy-tailed distributions. There are also efforts for extending the network calculus to heavy-tailed distributions [12], [13], =-=[16]-=-, [17], which are discussed in more detail in the next section. The remainder of this paper is organized as follows. In Section II and Section III, respectively, we discuss our characterization of hea...

Scaling Properties in the Stochastic Network Calculus

by Florin Ciucu , 2007
"... Modern networks have become increasingly complex over the past years in terms of control algorithms, applications and service expectations. Since classical theories for the analysis of telephone networks were found inadequate to cope with these complexities, new analytical tools have been conceived ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Modern networks have become increasingly complex over the past years in terms of control algorithms, applications and service expectations. Since classical theories for the analysis of telephone networks were found inadequate to cope with these complexities, new analytical tools have been conceived as of late. Among these, the stochastic network calculus has given rise to the optimism that it can emerge as an elegant mathematical tool for assessing network performance. This thesis argues that the stochastic network calculus can provide new analytical insight into the scaling properties of network performance metrics. In this sense it is shown that end-to-end delays grow as Θ(H log H) in the number of network nodes H, as opposed to the Θ(H) order of growth predicted by other theories under simplifying assumptions. It is also shown a comparison between delay bounds obtained with the stochastic network calculus and exact results available in some product-form queueing networks. The main technical contribution of this thesis is a construction of a statistical network service curve that expresses the service given to a flow by a network as if the flow traversed a single node only. This network service curve enables the proof of the O(H log H) scaling
(Show Context)

Citation Context

...nvelopes, service with statistical service curves, and it is a relatively simple extension at a single node of the first scenario (see Qiu et. al. [95, 96], Chang [29], Li et. al. [76], Jiang et. al. =-=[60, 61]-=-, Fidler [48]). Probabilistic performance bounds can also be obtained in scenarios with deterministic envelopes and deterministic service. The key idea is to account for the statistical multiplexing g...

On the flow-level delay of a spatial multiplexing MIMO wireless channel

by Kashif Mahmood, Amr Rizk, Yuming Jiang - In Proc. IEEE ICC , 2011
"... Abstract—The MIMO wireless channel offers a rich ground for quality of service analysis. In this work, we present a stochastic network calculus analysis of a MIMO system, operating in spatial multiplexing mode, using moment generating functions (MGF). We quantify the spatial multiplexing gain, achie ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Abstract—The MIMO wireless channel offers a rich ground for quality of service analysis. In this work, we present a stochastic network calculus analysis of a MIMO system, operating in spatial multiplexing mode, using moment generating functions (MGF). We quantify the spatial multiplexing gain, achieved through multiple antennas, for flow level quality of service (QoS) performance. Specifically we use Gilbert-Elliot model to describe individual spatial paths between the antenna pairs and model the whole channel by an N-State Markov Chain, where N depends upon the degrees of freedom available in the MIMO system. We derive probabilistic delay bounds for the system and show the impact of increasing the number of antennas on the delay bounds under various conditions, such as channel burstiness, signal strength and fading speed. Further we present results for multi-hop scenarios under statistical independence. I.
(Show Context)

Citation Context

...v modeling. In addition, stochastic network calculus, which as a more general theory covers effective bandwidth and effective capacity, has recently been applied for QoS analysis of wireless channels =-=[15]-=-–[17]. However, none of these works analyzed MIMO channels. There are two transmission techniques for MIMO systems. Spatial multiplexing is used to increase throughput by transmitting independent data...

Stochastic service guarantee analysis based on time-domain models

by Jing Xie, Yuming Jiang - In Proc. MASCOTS , 2009
"... Abstract—Stochastic network calculus is a theory for stochastic service guarantee analysis of computer communication networks. In the current stochastic network calculus literature, its traffic and server models are typically based on the cumulative amount of traffic and cumulative amount of service ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
Abstract—Stochastic network calculus is a theory for stochastic service guarantee analysis of computer communication networks. In the current stochastic network calculus literature, its traffic and server models are typically based on the cumulative amount of traffic and cumulative amount of service respectively. However, there are network scenarios where the applicability of such models is limited, and hence new ways of modeling traffic and service are needed to address this limitation. This paper presents time-domain models and results for stochastic network calculus. Particularly, we define traffic models, which are based on probabilistic lower-bounds on cumulative packet inter-arrival time, and server models, which are based on probabilistic upperbounds on cumulative packet service time. In addition, examples demonstrating the use of the proposed time-domain models are provided. On the basis of the proposed models, the five basic properties of stochastic network calculus are also proved, which implies broad applicability of the proposed time-domain approach. I.
(Show Context)

Citation Context

...n-plus algebra [4]. It is worth highlighting that the following results are for discrete time systems with unit discretization step. The virtual-backlog-centric (v.b.c) stochastic arrival curve model =-=[14]-=- is defined based on a probabilistic upper-bound on cumulative arrival. To ease later analysis, the definition of v.b.c stochastic arrival curve model presented in this paper is based on the number of...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University