Discrete Capacity Assignment in IP networks using Particle Swarm Optimization

Applied Mathematics and Computation

Volumn 217, Issue 12, 2011, Pages 5338-5346

  Wille, Emilio Carlos Gomes ^a   Yabcznski, Eduardo ^a   Lopes, Heitor Silvério ^a  

^a FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

Discrete Capacity Assignment; IP networks; Particle Swarm Optimization; Quality of Service

Indexed keywords

BOTTLENECK LINK; CAPACITY ASSIGNMENT; COMPUTATIONAL EFFORT; CONSTRAINED COMBINATORIAL OPTIMIZATION; DESIGN METHODOLOGY; DISCRETE VARIABLES; EXHAUSTIVE SEARCH; IP NETWORKS; LINK CAPACITIES; OPTIMAL SOLUTIONS; PERFORMANCE METRICS; PROBLEM FORMULATION; PSO ALGORITHMS; SIMPLE APPROACH; TRAFFIC MODELING; TRAFFIC PATTERN;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; CONSTRAINED OPTIMIZATION; QUALITY OF SERVICE;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 79551628402     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2010.12.003     Document Type: Article

References (19)

1. L. Kleinrock Queueing Systems Computer Applications Vol. II 1976 Wiley Interscience New York
2. M. Gerla, and L. Kleinrock On the topological design of distributed computer networks IEEE Trans. Commun. 25 1977 48 60
3. M. Mellia, A. Carpani, and R.L. Cigno Measuring IP and TCP behavior on edge nodes IEEE Globecom 2002 2002
4. V. Paxson, and S. Floyd Wide-area traffic: the failure of Poisson modeling IEEE/ACM Trans. Network. 3 1995 226 244
5. E.C.G. Wille, M. Mellia, E. Leonardi, and M. Ajmone-Marsan Algorithms for IP networks design with end-to-end QoS constraints Comput. Networks 50 2006 1086 1103
6. J.F. Hayes Modeling and Analysis of Computer Communications Networks 1984 Plenum Press New York
7. J. Kennedy, R.C. Eberhart, A new optimizer using particle swarm theory, in: Proceedings of the 6th International Symposium on Micro Machine and Human Science, 1995, pp. 39-43.
8. K. Maruyama, and D.T. Tang Discrete link capacity and priority assignments in communication networks IBM J. Res. Develop 1977 254 263
9. C. Ersoy, A. Levi, and O. Gumrah Artificial intelligence search techniques for discrete link capacity assignment in prioritized multiservice networks Int. J. Comput. Syst. Sci. Eng. 2000 191 197
10. X. Liu, J. Igarashi, H. Miyamoto, A capacity assignment method with different types of channel capacities for packet switched networks, in: 2nd Switching Network Systems Division, NEC Corp., 1990, pp. 194-199.
11. R. Ferreira, and H. Luna Discrete capacity and flow assignment algorithms with performance guarantee Comput. Commun. 26 10 2003 1056 1069
12. X. Chao, M. Miyazawa, and M. Pinedo Queueing Networks - Customers, Signals and Product Form Solutions 1999 John Wiley New York
13. M. Garetto, and D. Towsley An efficient technique to analyze the impact of bursty tcp traffic in wide-area networks Perform. Eval. 65 2 2008 181 202
14. C. Fraleigh, F. Tobagi, and C. Diot Provisioning IP backbone networks to support latency sensitive traffic IEEE Infocom 03 2003
15. J. Kennedy, and R.C. Eberhart Swarm Intelligence 2001 Morgan Kauffmann San Francisco
16. H.S. Lopes, L.S. Coelho, Particle swarm optimization with fast local search for the blind traveling salesman problem, in: Proceedings of the 5th International Conference on Hybrid Intelligent Systems, 2005, pp. 245-250.
17. H.S. Lopes, F. Hembecker, W. Godoy Jr., Particle swarm optimization for the multidimensional knapsack problem, in: Proceedings of the 8th International Conference on Adaptive and Natural Computing Algorithms, vol. LNCS 4431, 2007, pp. 358-365.
18. R.C. Eberhart, X. Hu, Y. Shi, Swarm intelligence for permutation optimization: a case study of n-queens problem, in: IEEE Swarm Intelligence Symposium, 2003, pp. 243-246.
19. E. Yabcznski, Algorithms for solving the discrete capacity assignment problem in TCP/IP networks, MSc. dissertation, Graduate Program on Electrical Engineering and Industrial Informatics (CPGEI), Federal University of Technology - Paraná (UTFPR) - Brazil (in Portuguese), 2007.