Stochastic Network Calculus

@inproceedings{Liu2004StochasticNC,
  title={Stochastic Network Calculus},
  author={Yong Liu and Yuming Jiang},
  year={2004}
}
The issue of Quality of Service (QoS) performance analysis in packet switching networks has drawn a lot of attention in the networking community in recent years. There is a lot of work including an elegant theory under the name of network calculus focusing on analysis of deterministic worst case QoS performance bounds. In the meantime, other researchers have studied the stochastic QoS performance for specific schedulers. As yet, there has been no systematic investigation and analysis of end-to… 
A Stochastic Network Calculus Approach for NCS Performance Analysis
TLDR
Stochastic network calculus is used to analyze stochastic service guarantees of NCS, and the end-to-end delay bound and buffer bound under different violation probability in two network scenarios are obtained.
Extending Stochastic Network Calculus to Loss Analysis
TLDR
This paper introduces a new parameter named loss factor into stochastic network calculus and derives the loss bound through the existing arrival curve and service curve via this parameter, and proves that this result is suitable for the networks with multiple input flows.
New stochastic network calculus for loss analysis
TLDR
A new kind of stochastic network calculus based on defining arrival and service curves using a different functional called tail weight is performed, demonstrated by presenting fundamental results on backlog and delay bounds and concatenation of nodes.
Analysis of Stochastic Service Guarantees in Communication Networks: A Server Model
TLDR
This paper proposes a server model, called stochastic service curve, which characterizes the service of the server by two Stochastic processes: an ideal service process and an impairment process and shows that with the concept of stoChastic service Curve, these challenges can be well addressed.
Analysis of Stochastic Service Guarantees in Communication Networks: A Basic Calculus
TLDR
Stochastic strict server is defined, which uses an ideal service process and an impairment process to characterize a server to perform independent case analysis and provides a convenient way to find the stochastic service curve of a serve.
A temporal network calculus approach to service guarantee analysis of stochastic networks
TLDR
The time-domain SNC traffic and service models are concretized by linking some well-known stochastic processes to them by investigating the delay performance of a Gilbert-Elliott channel and it is shown that the delay bound can be improved under the independence condition.
A Temporal Network Calculus for Performance Analysis of Computer Networks
TLDR
On the basis of the proposed models, the five basic properties of stochastic network calculus are proved, which implies broad applicability ofThe proposed time-domain approach.
A network calculus approach to delay evaluation of IEEE 802.11 DCF
TLDR
This paper exemplifies applying stochastic network calculus to delay analysis of the IEEE 802.11 distributed coordination function (DCF) by obtaining delay bounds for different arrival processes using a timedomain server model.
A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows
TLDR
This paper applies a new stochastic network calculus for many flows using an approach taken from large deviations techniques to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtains a simple evaluation formula for the end-to-end backlog.
Stochastic service guarantee analysis based on time-domain models
  • Jing Xie, Yuming Jiang
  • Computer Science
    2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems
  • 2009
TLDR
On the basis of the proposed models, the five basic properties of stochastic network calculus are proved, which implies broad applicability ofThe proposed time-domain approach.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
A service curve approach for quality of service management in integrated services networks
TLDR
This dissertation examines some of the fundamental problems related to quality of service management in integrated services networks and develops a scheduling algorithm, called the Subnet Service Curve based Earliest Deadline first (SSCED) algorithm, which guarantees subnet service curves to virtual connections.
End-to-end statistical delay service under GPS and EDF scheduling: a comparison study
  • V. Sivaraman, F. Chiussi, M. Gerla
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
It is demonstrated that achieving the maximal schedulable regions under GPS could necessitate dynamic resynchronization of the GPS weights, an operation considered infeasible for practical implementation.
Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals
TLDR
An exponential characterization (EBB) introduced in [11] is employed to analyze virtual circuit packet switching communication networks in a stochastic setting and shows that a network of servers, that are all either GPS or PGPS, is stable whenever the service rate of each node is larger than the total arrival rate to it.
Delay Bounds in a Network with Aggregate Scheduling
TLDR
An upper bound on the queuing delay is derived as a function of priority traffic utilization and the maximum hop count of any flow, and the shaping parameters at the network ingress.
Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes
  • A. Elwalid, D. Mitra
  • Computer Science
    IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
A framework for GPS scheduling is developed which is based on statistical QoS guarantees and statistical multiplexing, and one of the main contributions is a pragmatic design process by which most of the realizable set is realized by only two critical weights.
Performance bounds in communication networks with variable-rate links
TLDR
Deterministic and statistical bounds on queue size and packet delay in isolated variable-rate communication server-nodes are derived, including cases of single-input and multiple-input under first-come-first-serve queueing.
On Per-Session End-to-End Delay Distributions and the Call Admission Problem for Real-Time Applications with QOS Requirements
TLDR
This paper studies the end-to-end delay distribution seen by individual sessions under simple first-come first-served (FCFS) multiplexing in a network model with two significant features: all traffic is connection-oriented, and cross traffic along routes is representative of that seen by calls in a moderately sized wide area network.
Statistical Analysis of Generalized Processor Sharing Scheduling Discipline
TLDR
Borders on the individual session backlog and delay distribution under the generalized processor sharing (GPS) scheduling discipline are developed and it is shown that networks belonging to a broad class of GPS assignments, the so-called consistent relative session treatment (CRST) GPS assignments are stable in a stochastic sense.
Effective envelopes: statistical bounds on multiplexed traffic in packet networks
  • R. Boorstyn, A. Burchard, J. Liebeherr, C. Oottamakorn
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
This work considers a statistical service which assumes statistical independence of flows, but does not make any assumptions on the statistics of traffic sources, other than that they are regulated, e.g., by a leaky bucket, and presents functions which are, with high certainty, upper bounds of multiplexed traffic.
Second moment resource allocation in multi-service networks
TLDR
A new approach for determining per-connection performance parameters such as delay-bound violation probability and loss probability in multi-service networks, which utilizes a traffic characterization consisting of the variances of a stream's rate distribution over multiple interval lengths, which captures its burstiness properties and autocorrelation structure.
...
1
2
3
4
...