DYNAMIC SHORTEST PATH ANALYSIS OF ROUTING TECHNIQUE VIA GENETIC ALGORITHM

Abstract

The performance and reliability of the internet depend in large part on properties of routing techniques. IP routing protocols nowadays compute paths based on the network configuration parameters and topology, missing view to the current traffic load on the routers and links. This paper discusses routing optimization using Genetic Algorithm (GA) then studies and analyzes the problems in order to increase routing performance in median networks. A genetic algorithm will be proposed in a detail to advise the performance of Open Shortest Path First (OSPF) routing Protocol. The simulated results show that the probability of convergence to shortest path has been superior via momentary using GA in OSPF protocol. ‫ألجينية‬ ‫ألخوارزمية‬ ‫بواسطة‬ ‫المسالك‬ ‫تقنية‬ ‫في‬ ‫الطرق‬ ‫ألقصر‬ ‫ديناميكي‬ ‫تحليل‬ ‫الخالصة‬ ‫ذقُيح‬ ‫خصائص‬ ً‫عه‬ ‫االساط‬ ‫تانذسجح‬ ‫ذعرًذ‬ ‫االَرشَد‬ ‫في‬ ‫وانفاعهيح‬ ‫انكفاءج‬ ٌ‫ا‬ : ‫انًسا‬ ‫ن‬ ‫يعرثش‬ ‫و‬ .‫ك‬ ‫ال‬ (IP ‫ت‬ ٍ‫ي‬) ‫شوذىكىالخ‬ ‫انًسانك‬ ‫رن‬ ‫يع‬ ,‫انشثكح‬ ‫وذىتىنىجيا‬ ‫انشثكح‬ ‫يحذداخ‬ ‫وتحسة‬ ‫حانيا‬ ‫انسثم‬ ‫ذحصي‬ ‫انري‬ ‫ك‬ ‫يعايُح‬ ‫ذى‬ ٌ‫فقذا‬ ‫تياَاخ‬ ‫في‬ ‫انضائذ‬ ‫انحًم‬ ‫تسثة‬ ً‫عه‬ ‫انشثكح‬ ‫انشاتظ‬ ‫دساسح‬ ‫ثى‬ ٍ‫وي‬ ‫انجيُيح‬ ‫انخىاسصييح‬ ‫تاسرخذاو‬ ‫انًسهكيح‬ ‫االفضهيح‬ ‫ذفعيم‬ ‫كيفيح‬ ‫يُاقش‬ ‫انثحث‬ ‫هزا‬. ‫وانطشق‬ ‫انًسهكي‬ ‫انًعانج‬ ‫وذحهيم‬ ‫اخ‬ ‫تانرفصيم‬ ‫طشحها‬ ‫ذى‬ ‫انجيُيح‬ ‫انخىاسصييح‬ ٌ‫ا‬ .‫انكثشي‬ ‫انشثكاخ‬ ‫في‬ ‫انًسانك‬ ‫اداء‬ ‫صيادج‬ ‫نغشض‬ ‫ال‬ ‫اداء‬ ً‫ان‬ ‫واإلشاسج‬ (OSPF ‫َرا‬ .‫تشوذىكىل‬) ‫انًحاكا‬ ‫ئج‬ ‫األ‬ ٌ‫ا‬ ‫ذظهش‬ ‫ج‬ ‫انجيُيح‬ ‫نهخىاسصييح‬ ‫انىقري‬ ٍ‫انرضًي‬ ‫خالل‬ ٍ‫ي‬ ‫هي‬ ‫انًسانك‬ ‫اقصش‬ ً‫ان‬ ‫نهرقاسب‬ ‫سجحيح‬ (‫انًسانك‬ ‫تشوذىكىل‬ ‫في‬ OSPF .)