Abstract
Software-defined networking (SDN) enables routing control to program in the logically centralized controllers. It is expected to improve the routing efficiency even in highly dynamic situations. In this article, we make an in-depth observation of practical Internet datasets and investigate the relationship between betweenness centrality and network throughput. Furthermore, we propose a new routing observation factor, differential ratio of betweenness centrality (DRBC), to denote the varying amplitude of betweenness centrality to node degree. We reveal an interesting phenomenon that DRBC is proportional to the routing efficiency when the maximum betweenness centrality varies in a small range. Based on this, a DRBC-based routing scheme is proposed to improve routing efficiency. The experimental results verify that DRBC-based routing can improve the network throughput and accelerate the routing optimization.
- Z. N. Abdullah, I. Ahmad, and I. Hussain. 2019. Segment routing in software defined networks: A survey. IEEE Commun. Surv. Tutor. 21, 1 (2019), 464--486. DOI:https://doi.org/10.1109/COMST.2018.2869754Google Scholar
Cross Ref
- A. L. Barab and R. Albert. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 7 (2002), 47--97.Google Scholar
- M. Boguna, F. Papadopoulos, and D. Krioukov. 2010. Sustaining the internet with hyperbolic mapping. Nat. Commun. 9 (2010) Issue 07.Google Scholar
- CAIDA. (2018). Retrieved from: http://www.caida.org/home.Google Scholar
- B. E. Carpenter. 2016. A SDN controller with energy efficient routing in the internet of things (IoT). Procedia Comput. Sci. 89 (2016), 218--227.Google Scholar
Cross Ref
- N. Cheng, F. Lyu, J. Chen, W. Xu, H. Zhou, S. Zhang, and X. Shen. 2018. Big data driven vehicular networks. IEEE Netw. (2018), 1--8. DOI:https://doi.org/10.1109/MNET.2018.1700460Google Scholar
- K. Christoph, T. Marc, and B. Demian. 2016. Dynamic information routing in complex networks. Nat. Commun. 7, 12 (2016). DOI:10.1038/ncomms11061Google Scholar
- CIDR-Report. (2019). Retrieved from: http://www.cidr-report.org/as2.0/.Google Scholar
- A. Destounis, S. Paris, L. Maggi, G. S. Paschos, and J. Leguay. 2018. Minimum cost SDN routing with reconfiguration frequency constraints. IEEE/ACM Trans. Netw. 26, 4 (Aug. 2018), 1577--1590. DOI:https://doi.org/10.1109/TNET.2018.2845463Google Scholar
Digital Library
- X. Gao, B. Wang, and W. Deng. 2017. Software defined routing system. In Wireless Algorithms, Systems, and Applications. Springer International Publishing, 617--628.Google Scholar
- J. W. Guck, A. V. Bemten, M. Reisslein, and W. Kellerer. 2018. Unicast QoS routing algorithms for SDN: A comprehensive survey and performance evaluation. IEEE Commun. Surv. Tutor. 20 (2018), 388--415. Issue 1. DOI:https://doi.org/10.1109/COMST.2017.2749760Google Scholar
Cross Ref
- S. Haeri and L. Trajkovic. 2014. Deflection routing in complex networks. In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS’14). 2217--2220.Google Scholar
- Z. He, J. Cao, and X. Liu. 2016. SDVN: Enabling rapid network innovation for heterogeneous vehicular communication. IEEE Netw. 30, 4 (July 2016), 10--15. DOI:https://doi.org/10.1109/MNET.2016.7513858Google Scholar
Digital Library
- T. Hegr and L. Bohac. 2014. Impact of nodal centrality measures to robustness in software-defined networking. Adv. Electr. Electron. Eng. 12, 4 (2014), 252--259.Google Scholar
- H. Kawamoto and A. Igarashi. 2012. Efficient packet routing strategy in complex networks. Phys. A: Stat. Mech. Appl. 391, 3 (2012), 895--904.Google Scholar
Cross Ref
- D. Kim, Y. H. Kim, K. H. Kim, et al. 2017. Cloud-centric and logically isolated virtual network environment based on software-defined wide area network. Sustainability 9, 12 (2017), 2382.Google Scholar
Cross Ref
- D. Krioukov. 2016. Clustering implies geometry in networks. Phys. Rev. Lett. 116 (May 2016), 208302. Issue 20. DOI:https://doi.org/10.1103/PhysRevLett.116.208302Google Scholar
Cross Ref
- M. Lee and J. Sheu. 2016. An efficient routing algorithm based on segment routing in software-defined networking. Comput. Netw. 103 (2016), 44--55.Google Scholar
Digital Library
- B. Lin, B. Chen, Y. Gao, et al. 2016. Advanced algorithms for local routing strategy on complex networks. PLOS One 11 (July 2016), 1--17.Google Scholar
- C. Lin, K. Wang, and G. Deng. 2017. A QoS-aware routing in SDN hybrid networks. Procedia Comput. Sci. 110 (2017), 242--249.Google Scholar
Cross Ref
- X. Ling, M. Hu, R. Jiang, and Q. Wu. 2010. Global dynamic routing for scale-free networks. Phys. Rev. E 81 (Jan. 2010), 016113. Issue 1.Google Scholar
- W. Liu and B. Liu. 2014. Congestion control in complex network based on local routing strategy. Acta Phys. Sin. 63, 24 (2014), 248901.Google Scholar
- M. Luckie and R. Beverly. 2017. The impact of router outages on the as-level internet. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM’17). ACM, New York, NY, 488--501.Google Scholar
- N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, et al. 2008. OpenFlow: Enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev. 38, 2 (Mar. 2008), 69--74.Google Scholar
Digital Library
- Networkx. (2018). Retrieved from: http://networkx.github.io.Google Scholar
- B. A. A. Nunes, M. Mendonca, X. N. Nguyen, K. Obraczka, and T. Turletti. 2014. A survey of software-defined networking: Past, present, and future of programmable networks. IEEE Commun. Surv. Tutor. 16, 3 (July 2014), 1617--1634. DOI:https://doi.org/10.1109/SURV.2014.012214.00180Google Scholar
Cross Ref
- Z. Qazi, C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu. 2013. SIMPLE-fying middlebox policy enforcement using SDN. SIGCOMM Comput. Commun. Rev. 43, 4 (Aug. 2013), 27--38.Google Scholar
Digital Library
- W. Quan, N. Cheng, M. Qin, H. Zhang, H. Chan, and X. Shen. 2019. Adaptive transmission control for software defined vehicular networks. IEEE Wirel. Commun. Lett. 8, 3 (2019), 653--656. DOI:https://doi.org/10.1109/LWC.2018.2879514Google Scholar
Cross Ref
- W. Quan, Y. Liu, H. Zhang, and S. Yu. 2017. Enhancing crowd collaborations for software defined vehicular networks. IEEE Commun. Mag. 55, 8 (2017), 80--86. DOI:https://doi.org/10.1109/MCOM.2017.1601162Google Scholar
Digital Library
- K. G. Ramakrishnan and M. A. Rodrigues. 2001. Optimal routing in shortest-path data networks. Bell Labs Tech. J. 6, 1 (Jan. 2001), 117--138.Google Scholar
- D. Rueda, E. Calle, and L. Marzo. 2017. Improving the robustness to targeted attacks in software defined networks. In Proceedings of the 13th International Conference on Design of Reliable Communication Networks (DRCN’17). 1--8.Google Scholar
- H. Thomas, V. Stefano, D. Alberto, and V. Laurent. 2017. SWIFT: Predictive fast reroute (SIGCOMM’17). 460--473.Google Scholar
- K. Wang, H. Yin, W. Quan, and G. Min. 2018. Enabling collaborative edge computing for software defined vehicular networks. IEEE Netw. 32, 5 (2018), 112--117. DOI:https://doi.org/10.1109/MNET.2018.1700364Google Scholar
Cross Ref
- N. Wang, K. H. Ho, G. Pavlou, and M. Howarth. 2008. An overview of routing optimization for internet traffic engineering. IEEE Commun. Surv. Tutor. 10, 1 (year 2008), 36--56. DOI:https://doi.org/10.1109/COMST.2008.4483669Google Scholar
Digital Library
- W. Wang, C. Yin, G. Yan, and B. Wang. 2006. Integrating local static and dynamic information for routing traffic. Phys. Rev. E 74 (Jul 2006), 016101. Issue 1.Google Scholar
- J. Wu, M. Dong, K. Ota, J. Li, and Z. Guan. 2018. Big data analysis-based secure cluster management for optimized control plane in software-defined networks. IEEE Trans. Netw. Serv. Manag. 15, 1 (Mar. 2018), 27--38. DOI:https://doi.org/10.1109/TNSM.2018.2799000Google Scholar
Cross Ref
- J. Wu, C. K. Tse, and F. C. M. Lau. 2014. Effective routing algorithms based on node usage probability from a complex network perspective. In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS’14). 2209--2212. DOI:https://doi.org/10.1109/ISCAS.2014.6865608Google Scholar
Cross Ref
- J. Xie, F. R. Yu, T. Huang, R. Xie, J. Liu, and Y. Liu. 2019. A survey of machine learning techniques applied to software defined networking (SDN): Research issues and challenges. IEEE Commun. Surv. Tutor. 21, 1 (2019), 393--430. DOI:https://doi.org/10.1109/COMST.2018.2866942Google Scholar
Cross Ref
- G. Yan, T. Zhou, B. Hu, Z. Fu, and B. Wang. 2006. Efficient routing on complex networks. Phys. Rev. E 73 (Apr. 2006), 046108. Issue 4. DOI:https://doi.org/10.1103/PhysRevE.73.046108Google Scholar
Cross Ref
- Q. Ye, W. Zhuang, S. Zhang, A. Jin, X. Shen, and X. Li. 2018. Dynamic radio resource slicing for a two-tier heterogeneous wireless network. IEEE Trans. Vehic. Technol. 67, 10 (Oct. 2018), 9896--9910.Google Scholar
Cross Ref
- S. Yoon, T. Ha, S. Kim, and H. Lim. 2017. Scalable traffic sampling using centrality measure on software-defined networks. IEEE Commun. Mag. 55, 7 (July 2017), 43--49.Google Scholar
Digital Library
- W. T. Zaumen and A. J. Garcia-Luna. 1991. Dynamics of distributed shortest-path routing algorithms. SIGCOMM Comput. Commun. Rev. 21, 4 (Aug. 1991), 31--42. DOI:https://doi.org/10.1145/115994.115997Google Scholar
Digital Library
- P. Zeng, K. Nguyen, Y. Shen, and S. Yamada. 2014. On the resilience of software defined routing platform. In Proceedings of the 16th Asia-Pacific Network Operations and Management Symposium. 1--4. DOI:https://doi.org/10.1109/APNOMS.2014.6996605Google Scholar
Cross Ref
- H. Zhang, W. Quan, H. Chao, and C. Qiao. 2016. Smart identifier network: A collaborative architecture for the future internet. IEEE Netw. 30, 3 (May 2016), 46--51. DOI:https://doi.org/10.1109/MNET.2016.7474343Google Scholar
Digital Library
- S. Zhang, W. Quan, J. Li, W. Shi, P. Yang, and X. S. Shen. 2018. Air-ground integrated vehicular network slicing with content pushing and caching. IEEE J. Select. Areas Commun. 36 (2018). Issue 10. Retrieved from: https://arxiv.org/abs/1806.03860.Google Scholar
- S. Zhu and G. M. Huang. 1998. A new parallel and distributed shortest path algorithm for hierarchically clustered data networks. IEEE Trans. Parallel Distrib Syst. 9, 9 (Sept. 1998), 841--855.Google Scholar
Digital Library
Index Terms
Betweenness Centrality Based Software Defined Routing: Observation from Practical Internet Datasets
Recommendations
Alpha Current Flow Betweenness Centrality
Algorithms and Models for the Web GraphAbstractA class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting ...
Sink Group Betweenness Centrality
IDEAS '21: Proceedings of the 25th International Database Engineering & Applications SymposiumThis article introduces the concept of Sink Group Node Betweenness centrality to identify those nodes in a network that can “monitor” the geodesic paths leading towards a set of subsets of nodes; it generalizes both the traditional node betweenness ...
Efficient Estimation of Betweenness Centrality in Wireless Networks
In wireless networks, the betweenness of a node has been considered an indication of that node's importance in efficiently and reliably delivering messages. In a large wireless network, however, the cost of computing the betweenness of every node is ...






Comments