Identification and Prediction of Internet Traffic Using Artificial Neural Networks
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper presents the development of an artificial neural network (ANN) model based on the multi-layer perceptron (MLP) for analyzing internet traffic data over IP networks. We applied the ANN to analyze a time series of measured data for network response evaluation. For this reason, we used the input and output data of an internet traffic over IP networks to identify the ANN model, and we studied the performance of some training algorithms used to estimate the weights of the neuron. The comparison between some training algorithms demonstrates the efficiency and the accu-racy of the Levenberg-Marquardt (LM) and the Resilient back propagation (Rp) algorithms in term of statistical crite-ria. Consequently, the obtained results show that the developed models, using the LM and the Rp algorithms, can successfully be used for analyzing internet traffic over IP networks, and can be applied as an excellent and fundamental tool for the management of the internet traffic at different times.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917 · cited 1×
“There has been a number of refinements made to the BP algorithm with arguably the most successful in general being the Resilient Back Propagation method or Rp [59-61].”
MethodFirst- and Second-Order Methods for Learning: Between Steepest Descent and Newton's Method
Battiti, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.2.141 · Cited by 1,193
(2013) · doi:10.4324/9780203763247 · Cited by 400
Traffic prediction using neural networks
Yu, E. S., & Chen, C. Y. R. (2002) · Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference · doi:10.1109/glocom.1993.318226 · Cited by 77
Cited by
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
“The applicability of NNs in traffic prediction instigated various other efforts [86, 500] to compare and contrast various training algorithms for network traffic prediction.”
BackgroundMethodFadlullah, Z. M., Tang, F., Mao, B., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2707140 · Cited by 810
Predicting future traffic using Hidden Markov Models
Chen, Z., Wen, J., & Geng, Y. (2016) · 2016 IEEE 24th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7785328 · Cited by 72
“…bytes) transmitted between a certain source destination pair can be measured, and then a time series analysis model such as linear models including AR,ARMA,ARIMA,FARIMA [6], [7], [16], [14] and nonlinear models including ANN,RNN,GARCH [10], [17], [2], [8] is applied to predict the future traffic.”
Method
Metadata
- Authors
- Chabaa, S., Zeroual, A., & Antari, J.
- Venue
- Journal of Intelligent Learning Systems and Applications
- Publisher
- Scientific Research Publishing, Inc.
- Published
- 2010
- Volume
- 02
- Issue
- 03
- Pages
- 147-155
- ISSN
- 2150-8402 (ISSN-L)
- 2150-8410
- OpenAlex
- W2012546067
- Cited by
- 102
- References
- 4
- FWCI
- 5.44
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.