• DocumentCode
    3537712
  • Title

    Modeling call arrivals on VoIP networks as linear Gaussian Process under heavy traffic condition

  • Author

    Ajarmeh, I.A. ; Yu, James ; Amezziane, Mohamed

  • Author_Institution
    Sch. of Comput. & Digital Media, DePaul Univ., Chicago, IL, USA
  • fYear
    2011
  • fDate
    14-16 Dec. 2011
  • Firstpage
    100
  • Lastpage
    105
  • Abstract
    We propose a new model for call arrival process on VoIP tandem networks under heavy traffic load condition. Based on empirical evidence, such call arrivals can be modeled as linear Gaussian processes, and we show that this approach can provide an intuitive and accurate representation for different traffic patterns. In addition, the Gaussian approximation allows finding explicit mathematical equations for the model parameters, and provides effective model validation and significance testing. The model is validated by using hundreds of millions of call records collected from a tandem network in the U.S. We use least-square estimation method to build the model and conduct goodness-of-fit tests to validate it. The result yields a coefficient of determination, R2, of 0.9973 which shows 99.73% of the variability in the data is explained by the proposed model. The predictability of the model is demonstrated by its accuracy applied to another data set.
  • Keywords
    Gaussian processes; Internet telephony; approximation theory; least mean squares methods; telecommunication traffic; Gaussian approximation; VoIP tandem network; call arrival process; heavy traffic load condition; least-square estimation; linear Gaussian process; Data models; Equations; Gaussian distribution; Gaussian processes; Load modeling; Mathematical model; Predictive models; VoIP traffic engineering; call arrival rate; linear gaussian process; traffic modeling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networks (ICON), 2011 17th IEEE International Conference on
  • Conference_Location
    Singapore
  • ISSN
    1556-6463
  • Print_ISBN
    978-1-4577-1824-3
  • Type

    conf

  • DOI
    10.1109/ICON.2011.6168514
  • Filename
    6168514