scholarly journals Network Traffic Prediction Based on SVR Improved By Chaos Theory and Ant Colony Optimization

Author(s):  
Yonglin Liang ◽  
Lirong Qiu
2018 ◽  
Vol 24 (2) ◽  
pp. 223-228
Author(s):  
Felix U. Ogban ◽  
Roy Nentui

Packets routing and bandwidth sensing in a network platform remains an integral part of the study of signal flow.The algorithm to route packets in a network link called the AntNet algorithm was inspired by the behavior of real ant colonies. At each node in the network, a forward ant deposits some amount of pheromones at different links that responds to the node’s queue length. In this paper, we propose the inclusion of the computation of paths to adapt with the Depth Search Ant Explorer Network (DS-ANTENet) algorithm for discrete problems as an IP based mechanism. This method is tested and the efficiency is compared to the original AntNet algorithm and the Link-State algorithm to check the transmission of computing traffic flows between the nodes. We then made comparison with the algorithms proposed in the literature. The protocols were sorted out in terms of average number of lost packets ranging from the higher priority queue to the lower priority queue which then resulted to the fact that; First, AntNetBW (loss ratios reduction of 9.6% when compared to the AntNet and the Link-State algorithm respectively. Secondly,  SANTENetBW (loss ratios reduction of 8.3% and 36.7% when compared to the AntNet and the Link-State algorithm respectively. Finally, DS-ANTENet (loss ratios reduction 0.7% and 33.2% when compared to the AntNet and the Link- State algorithm respectively.Keywords: Packets Routing, Bandwidth Sensing, Network Traffic, Ant Colony Optimization Algorithm, AntNet


2010 ◽  
Vol 37 (12) ◽  
pp. 8343-8347 ◽  
Author(s):  
Li Shi-chang ◽  
Zhu Qing-sheng ◽  
Yan Zhe ◽  
Yang Hao-lan

2021 ◽  
Vol 26 (4) ◽  
pp. 591-611
Author(s):  
Emile Franc Doungmo Goufo ◽  
Chokkalingam Ravichandran ◽  
Gunvant A. Birajdar

Highly applied in machining, image compressing, network traffic prediction, biological dynamics, nerve dendrite pattern and so on, self-similarity dynamic represents a part of fractal processes where an object is reproduced exactly or approximately exact to a part of itself. These reproduction processes are also very important and captivating in chaos theory. They occur naturally in our environment in the form of growth spirals, romanesco broccoli, trees and so on. Seeking alternative ways to reproduce self-similarity dynamics has called the attention of many authors working in chaos theory since the range of applications is quite wide. In this paper, three combined notions, namely the step series switching process, the Julia’s technique and the fractal-fractional dynamic are used to create various forms of self-similarity dynamics in chaotic systems of attractors, initially with two, five and seven scrolls. In each case, the solvability of the model is addressed via numerical techniques and related graphical simulations are provided. It appears that the initial systems are able to trigger a self-similarity process that generates the exact or approximately exact copy of itself or part of itself. Moreover, the dynamics of the copies are impacted by some model’s parameters involved in the process. Using mathematical concepts to re-create features that usually occur in a natural way proves to be a prowess as related applications are many for engineers.


2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao

2012 ◽  
Vol 3 (3) ◽  
pp. 122-125
Author(s):  
THAHASSIN C THAHASSIN C ◽  
◽  
A. GEETHA A. GEETHA ◽  
RASEEK C RASEEK C

Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.


2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.


Sign in / Sign up

Export Citation Format

Share Document