Modeling available bandwidth for an efficient qos characterization of a network path

  • Authors:
  • Alexander Chobanyan;Matt W. Mutka;V. S. Mandrekar;Ning Xi

  • Affiliations:
  • Department of Computer Science and Engineering, Michigan State University;Department of Computer Science and Engineering, Michigan State University;Department of Statistics and Probability, Michigan State University;Department of Electrical and Computer Engineering, Michigan State University

  • Venue:
  • NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Estimating the reliability of an end–to–end network path is critically important for applications that support remote real–time task execution. Available bandwidth, which is defined as a minimum spare capacity of links constituting a network path, is an important QoS characteristic of the path. In this work we demonstrate a new approach to modelling available bandwidth behavior from a time-series analysis prospective. In particular, we introduce a notion of crossing probability–the probability that available bandwidth drops below the QoS critical threshold for the period of time required for a real-time task execution.We estimate “crossing probability” by an application of the ARCH2 (AutoRegressive Conditional Heteroscedasticity) model to available bandwidth behavior. We estimate model coefficients β0 and β1 to quickly output “crossing probability” for arbitrary values of threshold and length of the real-time task. The model was evaluated on real bandwidth measurements across multiple network paths.