Convergence time analysis of OSPF routing protocol using social network metrics
Authors:
- Muhammad WaqasMWMuhammad Waqas
- Saif Ur Rehman MalikSMSaif Ur Rehman Malik
- Saeed AkbarSASaeed Akbar
- Adeel AnjumAAAdeel Anjum
- Naveed AhmadNANaveed Ahmad
- 1 May 2019
- journal article
- research article
- Published by Elsevier in Future Generation Computer Systems
- Vol. 94, 62-71
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimized Open Shortest Path First Algorithm Based On Moth Flame OptimizationIndian Journal of Science and Technology, 2017
- Using social network analysis of human aspects for online social network software: a design methodologyComplex Adaptive Systems Modeling, 2016
- A Centrality Entropy Maximization Problem in Shortest Path Routing NetworksComputer Networks, 2016
- A Review on Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) Routing ProtocolInternational Journal of Future Generation Communication and Networking, 2016
- Pop-routing: Centrality-based tuning of control messages for faster route convergence2016
- Convergence time analysis of open shortest path first routing protocol in internet scale networksElectronics Letters, 2012
- StakeRare: Using Social Networks and Collaborative Filtering for Large-Scale Requirements ElicitationIEEE Transactions on Software Engineering, 2011
- Improving Convergence Speed and Scalability in OSPF: A SurveyIEEE Communications Surveys & Tutorials, 2011
- BRITE: an approach to universal topology generation2002
- OSPF Protocol Analysis1991