An Algebraic Approach to Computing the Reliability of Internet Routing

被引：0
作者：
Li, Qi [1 ]
Xu, Mingwei [1 ]
Wu, Jianping [1 ]
Lee, Patrick P. C. [2 ]
Xu, Ke [1 ]
机构：
[1] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China
[2] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Peoples R China
来源：
2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN) | 2011年
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Evaluating the reliability of Internet routing is important for an ISP to assess existing peer relationships or establish new peer relationships. Existing algorithms for network reliability computations take all routing paths as inputs. However, these paths may not be actually available for routing because of the constraints of routing policies in the Internet. In this paper, we propose an algebraic approach that effectively reduces the number of candidate routing paths according to the given routing policy. We further improve the accuracy of the routing reliability result by subtracting the miscounted value of routing paths due to overlooking routing policy constraints.
引用
收藏
页数：6
相关论文
共 16 条
  • [1] Barlow R.E., 1974, Statistical theory of reliability and life testing: probability models
  • [2] Resolving inter-domain policy disputes
    Ee, Cheng Tien
    Chun, Byung-Gon
    Ramachandran, Vijay
    Lakshminarayanan, Kaushik
    Shenker, Scott
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) : 157 - 168
  • [3] Implications of autonomy for the expressiveness of policy routing
    Feamster, N
    Johari, R
    Balakrishnan, H
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) : 25 - 36
  • [4] Flavel Ashley., 2009, Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM '09, P183
  • [5] Griffin TG, 2005, ACM SIGCOMM COMP COM, V35, P1, DOI 10.1145/1090191.1080094
  • [6] The stable paths problem and interdomain routing
    Griffin, TG
    Shepherd, FB
    Wilfong, G
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (02) : 232 - 243
  • [7] Griggin TG, 2002, 10TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, PROCEEDINGS, P90, DOI 10.1109/ICNP.2002.1181389
  • [8] Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
    Hou, Meijia
    Wang, Dan
    Xu, Mingwei
    Yang, Jiahai
    [J]. 2009 29TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 2009, : 68 - +
  • [9] Theory and New Primitives for Safely Connecting Routing Protocol Instances
    Le, Franck
    Xie, Geoffrey G.
    Zhang, Hui
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) : 219 - 230
  • [10] Levin H, 2008, ACM S THEORY COMPUT, P57
12