Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem
暂无分享,去创建一个
Andries Petrus Engelbrecht | Salman A. Khan | Mohammed A. Mohiuddin | A. Engelbrecht | Mohammad Aijaz Mohiuddin | S. Khan
[1] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[2] M. J. Frank. On the simultaneous associativity of F(x, y) and x+y-F(x, y). (Short Communication). , 1978 .
[3] B. H. Gwee,et al. A GA paradigm for learning fuzzy rules , 1996, Fuzzy Sets Syst..
[4] Didier Dubois,et al. Operations in a Fuzzy-Valued Logic , 1979, Inf. Control..
[5] Tibor Cinkler,et al. On Improving the Accuracy of OSPF Traffic Engineering , 2006, Networking.
[6] Lotfi A. Zadeh,et al. Fuzzy Sets , 1996, Inf. Control..
[7] M. J. Frank. On the simultaneous associativity ofF(x,y) andx +y -F(x,y) , 1979 .
[8] A. Odlyzko,et al. Internet growth: is there a Moore's law for data traffic? , 2000 .
[9] Bo-Hyeun Wang,et al. Automatic rule generation for fuzzy controllers using genetic algorithms: a study on representation scheme and mutation rate , 1998, 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228).
[10] Brunilde Sansò,et al. Corouting: An IP Hybrid Routing Approach , 2008, Fourth International Conference on Networking and Services (icns 2008).
[11] Mikkel Thorup,et al. Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..
[12] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[13] Andries Petrus Engelbrecht,et al. Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem , 2014, Applied Intelligence.
[14] Andreas Bley,et al. Approximability of unsplittable shortest path routing problems , 2009 .
[15] Kenneth L. Calvert,et al. Modeling Internet topology , 1997, IEEE Commun. Mag..
[16] Mikkel Thorup,et al. Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[17] Tibor Cinkler,et al. Practical OSPF traffic engineering , 2004, IEEE Communications Letters.
[18] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[19] Prithviraj Banerjee,et al. Empirical and theoretical studies of the simulated evolution method applied to standard cell placement , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[20] Antonio Nucci,et al. IGP Link Weight Assignment for Operational Tier-1 Backbones , 2007, IEEE/ACM Transactions on Networking.
[21] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[22] Andries Petrus Engelbrecht,et al. A new fuzzy operator and its application to topology design of distributed local area networks , 2007, Inf. Sci..
[23] Jonathan E. Fieldsend,et al. A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts , 2005, EMO.
[24] Alice Chen,et al. Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet , 2012, Future Gener. Comput. Syst..
[25] Andrew Odlyzko,et al. Internet growth: Is there a \Moore''s Law" for data tra?c?," Handbook of Massive Data Sets , 2002 .
[26] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[27] Anton Riedl,et al. Optimized routing adaptation in IP networks utilizing OSPF and MPLS , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[28] Celso C. Ribeiro,et al. A Memetic Algorithm for OSPF Routing , 2002 .
[29] Mikkel Thorup,et al. Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..
[30] M. Dzida,et al. Traffic Flow Optimization in Networks with Combined OSPF/MPLS Routing , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).
[31] A.A. Ghazala,et al. A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem , 2008, 2008 International Conference on Information Security and Assurance (isa 2008).
[32] Matthijs T. J. Spaan,et al. Traffic flow optimization: A reinforcement learning approach , 2016, Eng. Appl. Artif. Intell..
[33] R. Haupt. Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors , 2000, IEEE Antennas and Propagation Society International Symposium. Transmitting Waves of Progress to the Next Millennium. 2000 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (C.
[34] J. Liska,et al. Complete design of fuzzy logic systems using genetic algorithms , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.
[35] Frans van den Bergh,et al. An analysis of particle swarm optimizers , 2002 .
[36] Aditya Akella,et al. Cooperative Interdomain Traffic Engineering Using Nash Bargaining and Decomposition , 2007, IEEE/ACM Transactions on Networking.
[37] Joel Sokol,et al. An integer programming approach to the OSPF weight setting problem ∗ , 2006 .
[38] S. Asadullah,et al. Minimizing the Number of Congested Links in OSPF Routing , 2008, 2008 Australasian Telecommunication Networks and Applications Conference.
[39] D. Medhi,et al. Determining Feasible Link Weight Systems under Various Objectives for OSPF Networks , 2004 .
[40] Daniele Frigioni,et al. Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998, JEAL.
[41] Hongxing Li,et al. Fuzzy Sets and Fuzzy Decision-Making , 1995 .
[42] Sadiq M. Sait,et al. An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem , 2006, 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006.
[43] Ayman El-Sayed,et al. Open Shortest Path First Weight Setting (OSPFWS) solving algorithms comparison and new method for updating weights , 2009 .
[44] L. Buriol,et al. A Memetic Algorithm for the Weight Setting Problem in Deft , 2022 .
[45] Lotfi A. Zadeh,et al. The Concepts of a Linguistic Variable and its Application to Approximate Reasoning , 1975 .
[46] Keith W. Ross,et al. Computer networking - a top-down approach featuring the internet , 2000 .
[47] A.A. Ghazala,et al. A New Approach for Open Shortest Path Weight Setting Problem (OSPFWSP) , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.
[48] Panos M. Pardalos,et al. A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..
[49] K. G. Ramakrishnan,et al. Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.
[50] Deep Medhi,et al. Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach , 2005, IEEE Transactions on Network and Service Management.
[51] S. Weber. A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms , 1983 .
[52] Prithviraj Banerjee,et al. ESp: Placement by simulated evolution , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[53] Andreas Bley,et al. On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem , 2005, IPCO.
[54] Manuel Laguna,et al. Tabu Search , 1997 .
[55] Mikkel Thorup,et al. Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..
[56] Liu Dsosu,et al. Fuzzy random measure and its extension theorem , 1983 .
[57] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[58] Daniele Frigioni,et al. An Experimental Study of Dynamic Algorithms for Directed Graphs , 1998, ESA.
[59] Andreas Bley,et al. Approximability of unsplittable shortest path routing problems , 2009, Networks.
[60] Lotfi A. Zadeh,et al. The concept of a linguistic variable and its application to approximate reasoning-III , 1975, Inf. Sci..
[61] Srikanth Kandula,et al. Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.
[62] Mitsuo Gen,et al. Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF , 2009 .
[63] Sadiq M. Sait,et al. Engineering Evolutionary Algorithm to Solve Multi-objective OSPF Weight Setting Problem , 2006, Australian Conference on Artificial Intelligence.
[64] K. Palanivel,et al. Applying Aspect-Oriented Approach for Instance Adaptation for Object-Oriented Databases , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).
[65] M. N. Vrahatis,et al. Particle swarm optimization method in multiobjective problems , 2002, SAC '02.
[66] Andries Petrus Engelbrecht,et al. A fuzzy particle swarm optimization algorithm for computer communication network topology design , 2010, Applied Intelligence.
[67] Michal Pióro,et al. On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.
[68] Prithviraj Banerjee,et al. Optimization by simulated evolution with applications to standard cell placement , 1991, DAC '90.
[69] Lotfi A. Zadeh,et al. Outline of a New Approach to the Analysis of Complex Systems and Decision Processes , 1973, IEEE Trans. Syst. Man Cybern..
[70] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[71] Ralph Michael Kling,et al. Placement by Simulated Evolution , 1987 .