SavedAdd your journal

Journals / Trakya Üniversitesi Fen Bilimleri Dergisi / 2008 / Cilt: 9 Sayı: 1

REFINDING OF THE OPTIMAL PATH WHEN THE NETWORK CHANGES

AĞ DEĞİŞİMLERİNDE OPTİMAL YOLUN BULUNMASI

Şenol Zafer Erdoğan(Maltepe University, Faculty of Engineering, 34857 Maltepe Istanbul)
E. Murat Esin(Maltepe University, Faculty of Engineering, 34857 Maltepe Istanbul)
Erdem Uçar(TRAKYA UNIVERSITY, FACULTY OF ENGINEERING AND ARCHITECTURE)
Pages
25–29
Publication Date
2016-08-05
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this study, in a real network, two different network environments have been created and two routing tables in these different network environments have been updated by using this approach.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a new intelligent agent type which tries to find the new optimal path when the network changes is used.
📊
Key Findings & Data:Self Cloning Ant Colony Approach is used to find the optimal path.
💡
Conclusion & Impact:In this study, in a real network, two different network environments have been created and two routing tables in these different network environments have been updated by using this approach.
🔬Design:Makale
📍Scope:Comprehensive Sample
⚙️Variables:Yönlendirme Algoritmaları · Karınca Kolonisi · Bilgisayar Ağları

Abstract

In this study, a new intelligent agent type which tries to find the new optimal path when the network changes is used. Self Cloning Ant Colony Approach is used to find the optimal path. The approach focusing on the search and routing algorithm has been developed. Self Cloning Ants can clone or destroy themselves. These ants find the optimal path between the source and destination node. In this study, in a real network, two different network environments have been created and two routing tables in these different network environments have been updated by using this approach.

Özet

Bu çalışmada, yeni bir akıllı karınca tipi kullanılmaktadır ve onlar ağ değişimlerinde yeni optimal yolu bulmaya çalışmaktadırlar. Kendini klonlayan karınca kolonisi yaklaşımı optimal yolu bulmak için kullanılır. Bu yaklaşım, arama ve yönlendirme algoritmalarına odaklanarak tasarlanmıştır. Kendini klonlayan karıncalar kendilerini klonlayabilir ya da yok edebilirler. Bu karıncalar kaynak ve hedef düğüm arasındaki optimal yolu bulurlar. Bu çalışmada, gerçek bir ağ içerisinde, iki farklı ağ ortamı oluşturulmuştur ve bu farklı ağ ortamlarındaki iki yönlendirme tablosu bu yaklaşım kullanılarak güncellenmiştir.

🔖

Cite This Article

Erdoğan, Ş. Z., Esin, E. M., Uçar, E. (2016). REFINDING OF THE OPTIMAL PATH WHEN THE NETWORK CHANGES. Trakya Üniversitesi Fen Bilimleri Dergisi, Cilt: 9 Sayı: 1, 25–29. https://ajindex.com/articles/1328629

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (11)

  1. BARAN, B., SOSA, S. (2000), A New Approach for AntNet routing, Computer Communications and Networks, Proceedings Ninth International Conference, 303- 308
  2. ESİN, E. M., ERDOGAN, Ş. Z. (2006) Self Cloning Ant Colony Approach and Optimal Path Finding, Proceedings of the Euro American Conference on Telematics and Information Systems (EATIS 2006), Colombia
  3. ERDOGAN, Ş. Z., ESİN, E. M. (2006) Routing Table Updating by Using Self Cloning Ant Colony Approach, Proceedings of 5th International Symposium on Intelligent Manufacturing Systems (IMS'2006), Sakarya, Türkiye
  4. YUN, H., ZİNCİR-HEYWOOD, A. N. (2004) Intelligent Ants for Adaptive Network Routing, Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR'2004)
  5. FOROUZAN, B. A. (2001) Data Communications and Networking, Mc-Graw Hill, ISBN:0-07-232204-7
  6. HALABİ, B. (1997) Internet Routing Architectures, Cisco Press, ISBN: 1-56205-652-2,
  7. LİANG, S., ZİNCİR-HEYWOOD, A. N., HEYWOOD, M. I. (2005) Adding More Intelligence to the Network Routing Problem: AntNet and GA-agents, Elsevier
  8. CARO, G. D., DORIGO, M. (1998) AntNet: Distributed Stigmergetic Control for Communications Networks, J. Artificial Intelligence, vol. 9, 317-365
  9. ERDOGAN, S. Z., ESİN, E. M. (2006) An Application of Two Different Algorithms on the Same Network, Proceedings of the International Symposium on Communications and Information Technologies 2006 (ISCIT2006), Thailand
  10. OMNET++, http://www.omnetpp.org/external/whatis.php, June 2005
  11. PERKINS, C. E., Royer, E. M., 1999, Ad-hoc on demand distance vector routing, In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90 - 100, New Orleans