IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v26y2016i4p269-285.html
   My bibliography  Save this article

Online traffic prediction in the cloud

Author

Listed:
  • Bruno L. Dalmazo
  • João P. Vilela
  • Marilia Curado

Abstract

Network traffic prediction is a fundamental tool to harness several management tasks, such as monitoring and managing network traffic. Online traffic prediction is usually performed based on large sets of historical data used in training algorithms, for example, to determine the size of static windows to bound the amount of traffic under consideration. However, using large sets of historical data may not be suitable in highly volatile environments, such as cloud computing, where the coupling between time series observations decreases rapidly with time. To fill this gap, this work presents a dynamic window size algorithm for traffic prediction that contains a methodology to optimize a threshold parameter alpha that affects both the prediction and computational cost of our scheme. The alpha parameter defines the minimum data traffic variability needed to justify dynamic window size changes. Thus, with the optimization of this parameter, the number of operations of the dynamic window size algorithm decreases significantly. We evaluate the alpha estimation methodology against several prediction models by assessing the normalized mean square error and mean absolute percent error of predicted values over observed values from two real cloud computing datasets, collected by monitoring the utilization of Dropbox, and a data center dataset including traffic from several common cloud computing services. Copyright © 2016 John Wiley & Sons, Ltd.

Suggested Citation

  • Bruno L. Dalmazo & João P. Vilela & Marilia Curado, 2016. "Online traffic prediction in the cloud," International Journal of Network Management, John Wiley & Sons, vol. 26(4), pages 269-285, July.
  • Handle: RePEc:wly:intnem:v:26:y:2016:i:4:p:269-285
    DOI: 10.1002/nem.1934
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1934
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.1934?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Mario Lemes Proença & Gilberto Fernandes & Luiz F. Carvalho & Marcos V. O. de Assis & Joel J. P. C. Rodrigues, 2016. "Digital signature to help network management using flow analysis," International Journal of Network Management, John Wiley & Sons, vol. 26(2), pages 76-94, March.
    2. Hamada Alshaer, 2015. "An overview of network virtualization and cloud network as a service," International Journal of Network Management, John Wiley & Sons, vol. 25(1), pages 1-30, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xuxia Zhong & Ying Wang & Xuesong Qiu & Wenjing Li, 2016. "FlowVisor‐based cost‐aware VN embedding in OpenFlow networks," International Journal of Network Management, John Wiley & Sons, vol. 26(5), pages 373-395, September.
    2. Pramod C. Mane & Nagarajan Krishnamurthy & Kapil Ahuja, 2023. "Resource availability in the social cloud: An economics perspective," Bulletin of Economic Research, Wiley Blackwell, vol. 75(2), pages 541-566, April.
    3. Bram Naudts & Mario Kind & Sofie Verbrugge & Didier Colle & Mario Pickavet, 2016. "How can a mobile service provider reduce costs with software‐defined networking?," International Journal of Network Management, John Wiley & Sons, vol. 26(1), pages 56-72, January.
    4. Achref Amri & Aref Meddeb, 2021. "Optimal server selection for competitive service providers in network virtualization context," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 77(3), pages 451-467, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:26:y:2016:i:4:p:269-285. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.