A validation model for non-lexical routing protocols

dc.contributor.authorSarakbi, Bakr
dc.contributor.authorKhayou, Hussein
dc.date.accessioned2019-11-09T15:29:34Z
dc.date.available2019-11-09T15:29:34Z
dc.date.issued2017-11-15
dc.departmentHKÜ, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description.abstractRouting 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.en_US
dc.identifier.citationKhayou, H., & Sarakbi, B. (January 01, 2017). A validation model for non-lexical routing protocols. Journal of Network and Computer Applications, 98, 58-64.en_US
dc.identifier.doi10.1016/j.jnca.2017.09.006
dc.identifier.endpage64en_US
dc.identifier.issn1084-8045
dc.identifier.scopus2-s2.0-85029689100
dc.identifier.scopusqualityQ1
dc.identifier.startpage58en_US
dc.identifier.urihttps://doi.org/10.1016/j.jnca.2017.09.006
dc.identifier.urihttps://hdl.handle.net/20.500.11782/682
dc.identifier.volume98en_US
dc.identifier.wosWOS:000414817300005
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherACADEMIC PRESS LTD- ELSEVIER SCIENCE LTDen_US
dc.relation.ispartofJOURNAL OF NETWORK AND COMPUTER APPLICATIONS
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/embargoedAccessen_US
dc.subjectRouting protocols; Algebra; Routing algorithms; Networks; Semirings; Convergence; Routing stability; Loop free routingen_US
dc.titleA validation model for non-lexical routing protocols
dc.typeArticle

Dosyalar

Orijinal paket

Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
000414817300005.pdf
Boyut:
606.08 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası

Lisans paketi

Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
license.txt
Boyut:
1.56 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama: