A Bounding Histogram Approach for Network Performance Analysis (original) (raw)
Related papers
Performance Analysis of a Queue by Combining Stochastic Bounds, Real Traffic Traces and Histograms
The Computer Journal, 2016
Efficient blocking probability computation of complex traffic flows for network dimensioning
Computers & Operations Research, 2008
Efficient parametric analysis of performance measures for communication networks
Christos Cassandras, Yu-chi Ho
IEEE Journal on Selected Areas in Communications, 1990
Bounding delays in packet-routing networks
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95, 1995
Towards a universal sketch for origin-destination network measurements
2011
Dimensioning of data networks: a flow-level perspective
European Transactions on Telecommunications, 2009
A novel approach to bottleneck analysis in networks
NOMS 2008 - 2008 IEEE Network Operations and Management Symposium, 2008
A Note on Stochastic Bounds for Queueing Networks
Advances in Applied Probability, 1984
A Stochastic Network Calculus1
2004
Stochastic Service Curve and Delay Bound Analysis: A Single Node Case
Stochastic models for throughput analysis of randomly arriving elastic flows in the Internet
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
On the relevance of time scales in performance oriented traffic characterizations
1996
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
2005
Learn More, Sample Less: Control of Volume and Variance in Network Measurement
IEEE Transactions on Information Theory, 2005
Zero-budget network dimensioning
2005
Stochastic Comparison of Queueing Networks
International Series in Operations Research & Management Science, 2010
A network efficiency measure for congested networks
Europhysics Letters (EPL), 2007
Statistical modeling and performance analysis of multi-scale traffic
2003
Network Performance Analysis based on Histogram Workload Models
2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007
Optimal IP network dimensioning for stream-type traffic using probabilistic delay constraints
AEU - International Journal of Electronics and Communications, 2006
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking, 1993
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing, 2007
Traffic Properties for Stochastic Routing on Scale-Free Networks
IEICE Transactions on Communications, 2011
A model to estimate the throughput value for a transport network
2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI), 2013
Optimization Letters, 2007
Stochastic Performance Analysis of Non-Feedforward Networks
Network Traffic Modeling and Packet-Loss Probability Approximation
Journal of Mathematical Sciences, 2006
Network Characteristics: Modelling, Measurements, and Admission Control
Quality of ServiceIWQoS 2003, 2003
An Information-Theoretic Approach to Routing Scalability
Proceedings of the 13th ACM Workshop on Hot Topics in Networks - HotNets-XIII, 2014
1995
Probabilistic estimation of network size and diameter
… Computing, 2009. LADC' …, 2009
Stochastic Analysis of Deterministic Routing Algorithms in the Presence of Self-Similar Traffic
The Journal of Supercomputing, 2006
A short tutorial on network calculus. I. Fundamental bounds in communication networks
2000
Performance Measurement of the Heterogeneous Network
Arxiv preprint arXiv:1110.3597, 2011