A validation model for non-lexical routing protocols. (15th November 2017)

• Record Type: Journal Article
• Authors: Khayou, Hussein; Sarakbi, Bakr
• Is Part Of: Journal of network and computer applications. Volume 98(2017)
• Page Start: 58
• Page End: 64
• Publication Date: 2017-11-15
• Subjects: Routing protocols -- Algebra -- Routing algorithms -- Networks -- Semirings -- Convergence -- Routing stability -- Loop free routing; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2017.09.006
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: Routing protocols properties form an essential topic of research. Ensuring that a routing protocol is stable, loop free and reaches the global optimal topology solution is needed for both evaluating it and doing the required enhancements for it. There exist several trials in previous researches to enhance routing protocols. Those works depend on either theoretical models or simulation to validate their results. Existing validation models target lexical based routing metrics only. In this work, we propose a validation model for non-lexical routing metrics (such as Enhanced Interior Gateway Routing Protocol – EIGRP). Our validation model is based on abstract algebra. It helps in validating necessary routing properties and enhancing existing routing protocols in such a way that makes them meet those properties.