Yazar "Esin, E. Murat" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim Yok
    Yayın
    An application of two different algorithms on the same network
    (2006) Erdogan, Şenol Zafer; Esin, E. Murat
    In this study, Dijkstra algorithm and self cloning ant colony approach are explained. Dijkstra is a well known algorithm to find the shortest path. Self cloning ant colony approach is a new method to find the optimal path between the pair of the nodes in an unknown net topology. Both methods are applied on the same network and the results and differences are shown. © 2006 IEEE.
  • Küçük Resim Yok
    Yayın
    Routing table updating by using intelligent agents
    (SPRINGER, 2009) Erdogan, Senol Zafer; Esin, E. Murat
    In a network, one of the important problems is making an efficient routing decision. Many studies have been carried out on making a decision and several routing algorithms have been developed. In a network environment, every node has a routing table and these routing tables are used for making routing decisions. Nowadays, intelligent agents are used to make routing decisions. Intelligent agents have been inspired by social insects such as ants. One of the intelligent agent types is self a cloning ant. In this study, a self cloning ant colony approach is used. Self cloning ants are a new synthetic ant type. This ant assesses the situation and multiplies through cloning or destroying itself. It is done by making a routing decision and finding the optimal path. This study explains routing table updating by using the self cloning ant colony approach. In a real net, this approach has been used and routing tables have been created and updated for every node.