logo

SCIENTIA SINICA Informationis, Volume 51 , Issue 9 : 1540(2021) https://doi.org/10.1360/SSI-2020-0215

An inter-domain routing reputation model based on autonomous domain collaboration

More info
  • ReceivedJul 5, 2020
  • AcceptedFeb 10, 2021
  • PublishedSep 14, 2021

Abstract


Funded by

国家自然科学基金(61502528,61902447)


References

[1] Wang N, Du X H, Wang W J, et al. A survey of the border gateway protocol security. Chin J Comput, 2017, 40: 138--160. Google Scholar

[2] Giotsas V, Luckie M, Huffaker B. Inferring complex as relationships. In: Proceedings of the 2014 Conference on Internet Measurement Conference, 2014. 23--30. Google Scholar

[3] Kuerbis B, Mueller M. Negotiating a new governance hierarchy: An analysis of the conflicting incentives to secure internet routing. Communications and Strategies, 2011,(81):125-142 https://ssrn.com/abstract=2021835. Google Scholar

[4] Konte M, Perdisci R, Feamster N. ASwatch. SIGCOMM Comput Commun Rev, 2015, 45: 625-638 CrossRef Google Scholar

[5] Nordstr?m O, Dovrolis C. Beware of BGP attacks. SIGCOMM Comput Commun Rev, 2004, 34: 1-8 CrossRef Google Scholar

[6] BGPmon Blog. BGP leak causing Internet outages in Japan and beyond. https://bgpmon.net/bgp-leak-causing-internet-outages-in-japan-and-beyond/,2017. Google Scholar

[7] BGPmon Blog. Large scale BGP hijack out of India.https://bgpmon.net/large-scale-bgp-hijack-out-of-india/,2015. Google Scholar

[8] Testart C, Philipp R, Alistair K, et al. Profiling BGP serial hijackers: capturing persistent misbehavior in the global routing table. In: Proceedings of the Internet Measurement Conference, 2019. 420--434. Google Scholar

[9] Chung T, Aben E, Bruijnzeels T, et al. RPKI is coming of age: a longitudinal study of RPKI deployment and invalid route origins. In: Proceedings of the Internet Measurement Conference, 2019. 406--419. Google Scholar

[10] Chen D, Qiu H, Zhu J H, et al. Research on blockchain-based interdomain security solutions. J Softw, 2020, 31: 208--227. Google Scholar

[11] Resnick P, Kuwabara K, Zeckhauser R. Reputation systems. Commun ACM, 2000, 43: 45-48 CrossRef Google Scholar

[12] Ishmanov F, Bin Zikria Y. Trust Mechanisms to Secure Routing in Wireless Sensor Networks: Current State of the Research and Open Research Issues. J Sens, 2017, 2017(1): 1-16 CrossRef Google Scholar

[13] Sharma A, Pilli E S, Mazumdar A P. Towards trustworthy Internet of Things: A survey on Trust Management applications and schemes. Comput Commun, 2020, 160: 475-493 CrossRef Google Scholar

[14] Ge X, Chen J, Wang C X. 5G green cellular networks considering power allocation schemes. Sci China Inf Sci, 2016, 59: 1-14 CrossRef Google Scholar

[15] Chang J, Venkatasubramanian K K, West A G, et al. AS-TRUST: a trust quantification scheme for autonomous systems in BGP. In: Proceedings of the Trust and Trustworthy Computing, 2011. 262--276. Google Scholar

[16] Chang J, Venkatasubramanian K K, West A G. AS-CRED: Reputation and Alert Service for Interdomain Routing. IEEE Syst J, 2013, 7: 396-409 CrossRef ADS Google Scholar

[17] Yu H, Rexford J, Felten E W. A distributed reputation approach to coopertive Internet routing protection, In: Proceedings of the 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. 73--78. Google Scholar

[18] Hu N, Zou P, Zhu P D. J Software, 2010, 21: 505-515 CrossRef Google Scholar

[19] Lee J Y, Oh J C. A node-centric reputation computation algorithm on online social networks. In: Applications of Social Media and Social Network Analysis. Cham: Springer, 2015. 1--22. Google Scholar

[20] Xia N, Li W, Lu Y, et al. A trust model for the inter-domain routing system. J Comput Res Dev, 2016, 53: 845--860. Google Scholar

[21] Sankar A U P, Poornachandran P, Ashok A, et al. B-secure: a dynamic reputation system for identifying anomalous BGP paths. In: Advances in Intelligent Systems and Computing. Singapore: Springer, 2017. 515: 767--775. Google Scholar

[22] Arouna H A, Metongnon L, Lobelle M. Reputation rating algorithm for BGP links. In: Proceedings of International Conference on e-Infrastructure and e-Services for Developing Countries, 2017. 352--357. Google Scholar

[23] Huston G. BGP in 2019 - BGP Churn. http://blog.apnic.net/2020/01/15/bgp-in-2019-bgp-churn/. Google Scholar

[24] Gill P, Schapira M, Goldberg S. A survey of interdomain routing policies. SIGCOMM Comput Commun Rev, 2013, 44: 28-34 CrossRef Google Scholar

[25] Zhang M, Li J, Brooks S. I-Seismograph: Observing, Measuring, and Analyzing Internet Earthquakes. IEEE/ACM Trans Networking, 2017, 25: 3411-3426 CrossRef Google Scholar

[26] Zhu J H, Guo Y, Wang Z X. 基于多特征的域间路由节点安全状态评估方法. Sci Sin-Inf, 2014, 44: 527-536 CrossRef Google Scholar

[27] Breiman L. Machine Learning, 2001, 45: 5-32 CrossRef Google Scholar

[28] Ismail R, Josang A. The beta reputation system. In: Proceedings of the Bled Econference, 2002. 41. Google Scholar

[29] Casella G, Berger R L. Statistical inference. Technometrics, 1990,33(4). Google Scholar

[30] Tozal M E. Autonomous system ranking by topological characteristics: a comparative study. In: Proceedings of the 2017 Annual IEEE International Systems Conference(SysCon), 2017. 1--8. Google Scholar

[31] Nur A Y, Tozal M E. Identifying critical autonomous systems in the Internet. J Supercomput, 2018, 74: 4965-4985 CrossRef Google Scholar

[32] Kamvar S, Schlosser M, Garcia-molina H. The EigenTrust Algorithm for Reputation Management in P2P Networks. In: Proceedings of the 12th International Conference on World Wide Web, 2003. 640--651. Google Scholar

[33] Yashkina E, Pinigin A, Lee J Y, et al. Expressing trust with temporal frequency of user interaction in online communities. In: Proceedings of International Conference on Advanced Information Networking and Applications, 2019. 1133--1146. Google Scholar

[34] Fan X, Liu L, Zhang R. Decentralized Trust Management. ACM Comput Surv, 2020, 53: 1-33 CrossRef Google Scholar

[35] Fan X X, Liu L, Li M C, et al. EigenTrust+: attack resilient trust management. In: Proceedings of the 8th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), 2012. 416--425. Google Scholar

[36] Fan X, Liu L, Li M. GroupTrust: Dependable Trust Management. IEEE Trans Parallel Distrib Syst, 2017, 28: 1076-1090 CrossRef Google Scholar

[37] Bellini E, Iraqi Y, Damiani E. Blockchain-Based Distributed Trust and Reputation Management Systems: A Survey. IEEE Access, 2020, 8: 21127-21151 CrossRef Google Scholar

  • Figure 1

    Logical framework of ASCIR

  • Figure 2

    (Color online) AS9498 behavior feature statistic (2015.11.06 10:00$\sim$11:00UTC). (a) Anum; (b) Wnum; (c) APL; (d) APED; (e) AA IAT; (f) AW IAT; (g) WA IAT

  • Figure 3

    (Color online) The correlation between AS local feature distance and its network properties. (a) AS customer cone and feature distance; (b) AS IP subnets and feature distance; (c) AS degree and feature distance

  • Figure 4

    (Color online) Quantitative evaluation of AS9498 reputation (2015.11.06)

  •   

    Algorithm 1 AS global reputation aggregate algorithm

    Require:Output: Global reputation evaluation $R_{ea}$;

    for $n~\in~G.A~-~\left~\{~e,a~\right~\}~$

    $n$.voted $\Leftarrow~{\rm~False}$, $n.R(n,a)~\Leftarrow~{\rm~Eval}(n,a)$;

    end for

    $e.{\rm~voted}~\Leftarrow~{\rm~True}$, $e.R(e,a)~\Leftarrow~{\rm~Eval}(e,a)$;

    Initialize voting AS queue $Q~\Leftarrow~\emptyset$;

    ${\rm~ENQUEUE}(Q,e)$;

    Initialize aggregate round $k~\Leftarrow~0$;

    while $Q~\neq~\emptyset$ do

    $v~\Leftarrow~{\rm~DEQUEUE}(Q)$;

    Initialize reputation evaluation feedback list of current round ${\rm~FeedbackList}~\Leftarrow~\emptyset$;

    for $u~\in~G.{\rm~neibor}(v)$

    if $u.{\rm~voted}~=~{\rm~False}$ AND $u$ and $a$ have interaction history then

    ${\rm~FeedbackList.append}(\beta_{vu}~u.R(u,a))$;

    ${\rm~ENQUEUE}(Q,u)$;

    end if

    end for

    $v.R(v,a)^{(k+1)}~=~\alpha_v~v.R(v,a)^{(k)}~+~(1-\alpha_v)~\sum_{f~\in~{\rm~FeedbackList}}f$;

    $e.R(e,a)^{(k+1)}~=~\alpha_e~e.R(e,a)^{(k)}~+~(1-\alpha_e)~\sum_{m~\in~G.{\rm~neibor}(e)}\beta_{em}m.R(m,a)^{(k+1)}$;

    Calculate $\delta~=~\left~|~e.R(e,a)^{(k+1)}~-~e.R(e,a)^{(k)}~\right~|$;

    if $\delta~<~\varepsilon$ AND $k~>~K$ then

    return $e.R(e,a)^{(k+1)}$;

    break;

    end if

    $k~\Leftarrow~k~+~1$;

    end while

    return $e.R(e,a)^{(k)}$.

qqqq

Contact and support