RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Shedding Light on the Use of AS Relationships for Path Inference

        Wenping Deng,Wolfgang Mühlbauer,Yuexiang Yang,Peidong Zhu,Xicheng Lu,Bernhard Plattner 한국통신학회 2012 Journal of communications and networks Vol.14 No.3

        Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer,peer, or provider routes are preferred. Apparently, applying such constraints eliminates many “correct” paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

      • SCIESCOPUSKCI등재

        Shedding Light on the Use of AS Relationships for Path Inference

        Deng, Wenping,Muhlbauer, Wolfgang,Yang, Yuexiang,Zhu, Peidong,Lu, Xicheng,Plattner, Bernhard The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.3

        Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer, peer, or provider routes are preferred. Apparently, applying such constraints eliminates many "correct" paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼