NTS6: IPv6 based Network Topology Service System of CERNET2
|
|
- Merryl O’Connor’
- 6 years ago
- Views:
Transcription
1 NTS6: IPv6 based Network Topology Service System of CERNET2 Lin Cong, Bo Yang, Yang Chen, Guohan Lu, Beixing Deng, Xing Li, Ye Wang (Department of Electronic Engineering, Tsinghua University, Beijing , China) Abstract In this paper, we propose NTS6, an IPv6 based Network Topology Service system, which provides a Query and Response Service of Network Topology Information between any pair of hosts accessing IPv6 Internet via CERNET2. The NTS6 system periodically collects the latest OSPF, BGP and SNMP information of CERNET2. Based on these information, NTS6 provides Network Topology Information such as Net Distance, Available Bandwidth and Path Packet Loss in response to users query. The real-world experiment on CERNET2 confirms the accuracy of our system. Also, NTS6 now performs well on large deployed Maze P2P File-Sharing System. We believe NTS6 will be a powerful middleware for other applications. 1. Introduction P2P overlay networks are popular solutions for largescale distributed network services and applications, such as application layer multicast, P2P multimedia streaming, file sharing and wide-area storage. If we do not consider the network locality in the construction of the P2P overlay, hosts nearby in the overlay network may actually be far away in the underlying network. This may waste too much network resource and, therefore, degrade performance significantly. One important aspect of constructing an efficient overlay network is how to exploit network locality in the underlying network [1]. There are mainly two schemes for the construction of locality-aware P2P overlay. One is measurement based, such as Meridian [2]. This scheme requires lots of end-to-end measurements, and its scalability is questionable. The other is coordinate based, such as GNP [3] and Vivaldi [4]. But the availability of the network coordinate system has not been well tested. Rather that there is not yet a large-scale network coordinate system according with the real network condition. We propose a new-style approach to handle this problem using network-layer information. Considering the exactitude and integrity of ISP's network topology information, it should be an accurate and deployable solution. We obtain routing, bandwidth and traffic information from Next Generation China Education and Research Network (CERNET2) ISP directly. Through analyzing and utilizing these information, we propose the NTS6, an IPv6 based Network Topology Service system, which provides a Query and Response Service of Network Topology Information between any pair of hosts accessing IPv6 Internet via CERNET2. Our major contribution of this work could be summarized as follows. We present the design and implementation of NTS6 system and deploy it on the real IPv6 Internet. We evaluate the performance of our NTS6 system by real-world experiment on CERNET2. Our NTS6 system is used by largely-deployed Maze P2P File-Sharing System for more than seven months and performs well. The rest of this paper is organized as follows. First we introduce the CERNET2 in Section 2. Then we present the design and implementation of our NTS6 system in Section 3 and evaluate its performance in Section 4. We introduce the application of our NTS6 system in the large deployed Maze P2P File-Sharing System in Section 5. We conclude the whole paper with Section 6 and present our acknowledgement in Section Overview of the Next Generation Education and Research Network in China (CERNET2) CERNET2 is one of the largest next generation Internet backbones and the core network of the China Next Generation Internet (CNGI) Project as well as the only nationwide academic network. Also it is the world's largest native IPv6 backbone so far. CERNET2 connects 200 universities and 100+ Research Institutes at 1Gbps-10Gbps. CERNET2
2 backbone adopting the native IPv6 protocol provides a rich experimental environment for the next generation Internet technique. CERNET2 also partly introduces the advanced IPv6 routers developed by local company. It will become the most important infrastructure for deployment of advanced network technique and killing applications of the next generation Internet, and it will be a big promotion of China s next generation Internet development. The routing control of CERNET2 bases on some new generation network protocols. The Interior Gateway Protocol of CERNET2 backbone network is OSPFv3 [5] [6], the External Gateway Protocol between the CERNET2 backbone AS and the CERNET2 regional ASes connected to the backbone is BGP4+ [7]. The network management protocol of the CERNET2 backbone network is SNMPv2c [8]. parses route entries into AS Number field, Prefix field and NextHop field SNMP Information Collecting and Processing The data collecting host sends SNMP requests to backbone network routers, and obtains SNMP data from the special MIB database. Then it derives the available bandwidth and Path Packet Loss on the shortest path (3.1.1) between each pair of backbone network routers. Set the packet loss rate of the i th segment on the shortest path as d i, and define the Path Packet Loss as : D = 1 (1 d i ). i 3. The Design and Implementation of NTS6 System NTS6 system includes two subsystems. One is Network Topology Information Collecting and Processing subsystem. The other is Network Topology Information Query and Response subsystem Network Topology Information Collecting and Processing Subsystem The NTS6 system collects latest OSPF, BGP and SNMP information on CENTET2 backbone network every 15 minutes. It obtains the topology and route state of CERNET2 backbone from OSPF information, the IPv6 address prefixes of the ASes connected to CERNET2 from BGP information, and the backbone network link state such as bandwidth and packet loss rate from SNMP information OSPF Information Collecting and Processing The data collecting host builds an adjacency relationship with a core router on CERNET2 backbone network, and collects all the LSAs (Link State Advertisement) of OSPF on CERNET2. Then it calculates the shortest path and OSPF metric between each pair of backbone Advertising Routers on CERNET2 using Dijkstra algorithm BGP Information Collecting and Processing The data collecting host builds a peer relationship with a core router on CERNET2 backbone network, then obtains the BGP information from CERNET2, and Figure 1. CERNET2 Network Topology Figure 1 shows the network topology of CERNET2 and the geographical locations of the CERNET2 backbone and regional ASes Network Topology Information Query and Response Subsystem The NTS6 system provides users with service of querying the Network Topology Information between any pair of IPv6 hosts (A and B). The Network
3 Topology Information is a three-tuple (Net Distance, Available Bandwidth, Path Packet Loss), includes Net Distance that denotes whether the special IPv6 addresses A and B belong to the same AS and the OSPF metric on backbone network between A and B, the minimal available bandwidth (Available Bandwidth) and the Path Packet Loss (Path Packet Loss) on the shortest path between A and B Network Topology Information Query There are four steps in Network Topology Information Query. Figure 2 shows this four-step procedure. matches A and B, then records its Advertising Router field separately. If Advertising Router of A and B are the same, which means they connect to CERNET2 through the same backbone network router, NTS6 will skip Step 3 to Step 4. Step3. OSPF Shortest Path Query According to the result from OSPF information processing, NTS6 calculates the shortest path between the backbone network routers through which A and B connect to CENRET2, also obtains the OSPF metric. Step4. SNMP Information Query and NTS6 Information Creation If Step 3 has been executed, there must be a shortest path between A and B. Then query the Available Bandwidth, Path Packet Loss from SNMP information, and set Net Distance equal to OSPF metric on this shortest path. Otherwise, because the A and B belong to the same AS or connect to CERNET2 through the same backbone network router, NTS6 will consider that the Available Bandwidth between A and B is infinity, the Path Packet Loss and Net Distance are all zero. Finally, create the three-tuple NTS6 information (Net Distance, Available Bandwidth, Path Packet Loss) and send it back to users. Figure 3 describes the query process of NTS6 system. Figure 2. Frame of Network Topology Information Query Step1. BGP Information Query NTS6 searches the BGP IPv6 Prefix field, fetches out the entries of BGP routing table that matches A and B, and then records its AS Number field and NextHop field. If AS number of A and B are the same, which means they are located in the same AS and Net Distance should be set to 0, NTS6 will skip the next three steps. Figure 3. Query Process of NTS6 System Network Topology Information Response Step2. Backbone Access Router Query NTS6 searches the Prefix field of AS External LSA and Intra Area Prefix LSA in OSPF routing information, fetches out the Prefix field that matches the NextHop field in the BGP information which Figure 4. The Procedure of XML-RPC Method
4 NTS6 system answers network topology information query by XML-RPC method. XML-RPC is a message transmission method based on HTTP protocol which can deliver a complex data structure easily. Figure 4 [9] denotes the procedure of the XML-RPC method. 4. Performance Evaluation of NTS6 System Since the NTS6 System was put into practice in July 2006, the Net Distance on CERNET2 has been stable. The Available Bandwidth between most pairs of IPv6 addresses in different ASes on CERNET2 backbone network is stably periodic. The Path Packet Loss of every shortest path is always zero, illustrating the fact that the packet loss rate on CERNET2 backbone link is always zero Peering Selection based on NTS6 System A typical application of NTS service is for the end hosts to perform peer/server selection based on the NTS6 information. Firstly, the end host queries the NTS6 service about its NTS6 information to several other hosts. When it gets the response, it usually ranks the hosts based on the NTS6 information and then tries the hosts in proper order beginning from the one with the highest rank. When such ranks reflect the actual end-to-end performance accurately, the end host then gets good network performance without the overhead of performing the end-to-end measurement. In this section, we design a straightforward procedure to cluster and rank the hosts based on the NTS6 information and then compare the ranks with the end-to-end network performance measured by the end hosts. We setup an IPv6 test-bed composed of 12 end hosts distributed among six different sites on the CERNET2 (see Table 1), two hosts per site. We cluster and rank the hosts based on the NTS6 information (Net Distance, Available Bandwidth, Path Packet Loss) as follows: 1. When the (Net Distance) ij is zero, classify the two hosts i and j to a same class. 2. For each Class i, we rank other classes based on (Net Distance) ij. If two classes have equal (Net Distance) ij to Class i, we then rank them based on (Available Bandwidth) ij accordingly, and finally based on (Path Packet Loss) ij when (Available Bandwidth) ij is still the same. Meanwhile, we measure the end-to-end TCP throughput Bulk Transfer Capacity (BTC) [10] and RTT using Iperf [11] and ping6 between every pair of the 12 hosts. We ran Iperf for 100 seconds and took 80 RTT samples on each path. Table 1. Six Institutes in Our Experiment TSCS Computer Science Department of Tsinghua University TSEE Electronic Engineering Department of Tsinghua University PKU Peking University SCUT South China University of Technology ZJU Zhejiang University HUST Huazhong University of Science and Technology Table 2 shows the result of clustering and ranking. The 12 hosts are clustered to five classes. Each row shows the ranks from one host to the total five classes. Note that the hosts from TSEE and PKU are clustered into a same Class, despite the different universities they are from. However, although TSEE and TSCS are both in Tsinghua University, they are clustered into different classes showing that the Network Topology Information may not match exactly with the geographical topology. Class Class Table 2. Clustering and Ranking of Class based on NTS6 Information TSCS TSEE &PKU SCUT ZJU HUST TSCS 1 st 2 nd 4 th 5 th 3 rd TSEE &PKU 2 nd 1 st 4 th 5 th 3 rd SCUT 3 rd 4 th 1 st 5 th 2 nd ZJU 3 rd 4 th 5 th 1 st 2 nd HUST 2 nd 3 rd 4 th 5 th 1 st Figure 5. End-to-end BTC VS. NTS6 ranks
5 Figure 6. RTT VS. NTS6 ranks Figure 5 compares the ranking result with the endto-end BTC. Each curve corresponds to one row in Table 2. As shown in this figure, the BTC decreases when the rank increases. Figure 6 compares the ranking result with average RTT between a pair of classes. As shown in this figure, the RTT increases as the rank increases. This is likely to be true as we first rank the hosts based on the topology distance (Net Distance) ij between two hosts, and larger (Net Distance) ij likely leads to fewer BTC and larger RTT. Both two figures show that the NTS6 ranks agree well with the actual end-to-end performance and suggest that we can use NTS6 information to perform peer/server selection. Figure 7. The User Number of NTS6 system Figure 7 denotes the user number of NTS6 system from December 1 st, 2006 to January 7 th, Compared with IPv4 users, the number of IPv6 users is still under development. 5. Application of NTS6 in Maze System Maze [12] [13] [14] is a P2P File-Sharing system which is developed and deployed by the Computer Science Department of Peking University. The structure of Maze is similar to Napster, with a centralized, cluster-based search engine, but is additionally outfitted with a social network of peers. Maze is a largely deployed file sharing system with more than 1.4 million registered users. It has an average of 30,000 peers online at any time, and roughly 13TB of data exchanged daily. Recently Maze releases an IPv6 version and provides P2P file-sharing service for IPv6 users. During the collaboration in China New Generation Internet (CNGI) Project, now NTS6 provides network topology service for all the users accessing the Maze File-Sharing system through IPv6. According to our observation, NTS6 performs very stably and effectively for more than seven months, and responses about twenty thousand queries coming from more than eight thousand individual IPv6 users distributing around China. Figure 8. The Distribution of Access IPv6 Addresses Figure 8 denotes the distribution of these individual IPv6 users. The number under every city means the summation of the accessing IPv6 addresses belonging to that city. 6. Conclusion
6 This paper presents the design and implementation of NTS6, an IPv6 based Network Topology Service System of CERNET2. According to our real-world experiment on CERNET2, the actual end-to-end measurement indicates that the NTS6 system can reflect the actual data transmission performance by clustering the IPv6 addresses to Classes and then ranking them. Now NTS6 system has been used in the large deployed Maze P2P File-Sharing System and performs very stably and effectively. We now focus on applying our NTS6 system on more kinds of large scale P2P applications, such as the P2P multimedia streaming system, overlay routing and etc. 7. Acknowledgement This work is supported by the National Science Foundation of China Project (No ) and the China New Generation Internet Project (No.CNGI A). 8. Reference [1] Xin Yan Zhang, Qian Zhang, Zhensheng Zhang, etc. A Construction of Locality-Aware Overlay Network: moverlay and Its Performance. IEEE Journal on Selected Areas in Communications, Vol.22, No.1, Pages 18-28, [2] B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A Lightweight Network Location Service without Virtual Coordinates. In Proceedings of ACM SIGCOMM 05, August [3] T. S. E. Ng and H. Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In Proceedings of IEEE INFOCOM 02, June [4] F.Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A Decentralized Network Coordinate System. In Proceedings of ACM SIGCOMM 04, August [5] J. Moy. RFC 2328: OSPF Version 2. IETF [6] R.Coltun, D.Ferguson, J.Moy. RFC 2740: OSPF for IPv6. IETF [7] Y.Rekhter, T.Li, S.Hares. RFC 4271: A Border Gateway Protocol 4 (BGP-4). IETF [8] D.Harrington, R.Presuhn, B.Wijnen. RFC 3411: An Architecture for Describing SNMP Management Frameworks. IETF [9] XML-RPC. [10] Matt Mathis and Mark Allman, RFC 3148: A Framework for Defining Empirical Bulk Transfer Capacity Metrics. IETF [11] Iperf. [12] Maze Project Homepage. [13] Mao Yang, Zheng Zhang, Xiaoming Li, Yafei Dai. An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System. In Proc. of IPTPS 05, Feb [14] Qiao Lian, Yu Peng, Mao Yang. Robust Incentives via Multilevel Tit-for-tat. In Proc. of IPTPS 06, Feb
Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3
Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Han Zhi-nan Yan Wei Zhang Li Wang Yue Computer Network Laboratory Department of Computer Science & Technology, Peking University
More informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More informationDOLPHIN: THE MEASUREMENT SYSTEM FOR THE NEXT GENERATION INTERNET
DOLPHIN: THE MEASUREMENT SYSTEM FOR THE NEXT GENERATION INTERNET Xinpei Lang, Gang Zhou, Chen Gong, Wei Han National Lab of Software Development Environment Department of Computer Science Beihang University,
More informationRouting in the Internet
Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes
More informationRouting Protocols. Technology Description BGP CHAPTER
CHAPTER 11 This chapter describes the level of support that Cisco ANA provides for routing protocols, as follows: Technology Description, page 11-1 Information Model Objects (IMOs), page 11-3 Vendor-Specific
More informationPeer-to-Peer Streaming Systems. Behzad Akbari
Peer-to-Peer Streaming Systems Behzad Akbari 1 Outline Introduction Scaleable Streaming Approaches Application Layer Multicast Content Distribution Networks Peer-to-Peer Streaming Metrics Current Issues
More informationPharos: A Decentralized and Hierarchical Network Coordinate System for Internet Distance Prediction
: A Decentralized and Hierarchical Network Coordinate System for Internet Distance Prediction Yang Chen, Yongqiang Xiong, Xiaohui Shi, Beixing Deng,XingLi Department of Electronic Engineering, Tsinghua
More informationNetwork Delay Model for Overlay Network Application
, 2009, 5, 400-406 doi:10.4236/ijcns.2009.25045 Published Online August 2009 (http://www.scirp.org/journal/ijcns/). Network Delay Model for Overlay Network Application Tian JIN, Haiyan JIN School of Electronics
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline! Distance vector routing! Link state routing! IGP and EGP Intra-domain routing protocol, inter-domain routing protocol!
More informationNetwork Working Group. Intended status: Experimental Expires: March 16, 2010 Tsinghua University C. Metz Cisco Systems, Inc. September 12, 2009
Network Working Group Internet-Draft Intended status: Experimental Expires: March 16, 2010 J. Wu Y. Cui X. Li M. Xu Tsinghua University C. Metz Cisco Systems, Inc. September 12, 2009 4over6 Transit Solution
More informationA Survey on Routing Issues and Associated Protocols for Best-effort Delivery in IP Networks
Volume 119 No. 12 2018, 707-716 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A Survey on Routing Issues and Associated Protocols for Best-effort Delivery in IP Networks MajidhaFathima
More informationMigrating from OSPF to IS-IS
Migrating from OSPF to IS-IS ISP Workshops Last updated 25 th August 2015 1 Introduction p With the advent of IPv6 and dual stack networks, more ISPs expressing interest to migrate to IS-IS n Migration
More informationOptimal Performance Analysis Enabling OSPF and BGP in Internal and External WAN
Optimal Performance Analysis Enabling OSPF and BGP in Internal and External WAN K. RamKumar 1, S. Raj Anand 2 1,2 VelTechMultiTech Dr. Rangarajan Dr. Sakunthala Engineering College, Chennai Abstract:-
More informationCERNET and CNGI-CERNET2 CERNET2
CERNET and CNGI-CERNET2 CERNET2 INET Kuala Lumpur 2009 MA Yan Beijing University of Posts and Telecommunications 2009/07/20 Agenda General information of Internet in China CERNET China Education and Research
More informationOpen Shortest Path First (OSPF)
CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working
More informationRouting Protocols. Autonomous System (AS)
Routing Protocols Two classes of protocols: 1. Interior Routing Information Protocol (RIP) Open Shortest Path First (OSPF) 2. Exterior Border Gateway Protocol (BGP) Autonomous System (AS) What is an AS?
More informationExperimental Study on Neighbor Selection Policy for Phoenix Network Coordinate System
Experimental Study on Neighbor Selection Policy for Phoenix Network Coordinate System Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua National Laboratory for Information Science and
More informationA Connectionless Approach to Intra- and Inter-Domain Traffic Engineering
A Connectionless Approach to Intra- and Inter-Domain Traffic Engineering Hema T. Kaur, Shivkumar Kalyanaraman ECSE Department, Rensselaer Polytechnic Institute, Troy, NY-12180 {hema,shivkuma}@networks.ecse.rpi.edu
More informationThis document is not restricted to specific software and hardware versions.
Contents Introduction Prerequisites Requirements Components Used Background Information Configure Network Diagram Configuration DN Bit Verify Troubleshoot Related Cisco Support Community Discussions Introduction
More informationMigrating from OSPF to IS-IS
Migrating from OSPF to IS-IS Philip Smith philip@nsrc.org SAFNOG 2 7 th -8 th April 2015 Mbabane Last updated 27 March 2014 1 Presentation slides p Available at: n http://bgp4all.com/ftp/seminars/safnog2-
More informationOSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
More informationLINX accredited training Another 10 years. Stephen Groombridge Systems & Network Training
LINX accredited training Another 10 years Stephen Groombridge Systems & Network Training The training programme 2001 2008 2018 LINX 1 TCP/IP TCP/IP IPv4 some IPv6 IPv4 some/bit more IPv6 LINX 2 Static
More informationA Flow Label Based QoS Scheme for End-to-End Mobile Services
A Flow Label Based QoS Scheme for End-to-End Mobile Services Tao Zheng, Lan Wang, Daqing Gu Orange Labs Beijing France Telecom Group Beijing, China e-mail: {tao.zheng; lan.wang; daqing.gu}@orange.com Abstract
More informationIntroduction to OSPF
Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment
More informationCMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala October 9, 2018 (a) October 18 October 9,
CMSC 417 Computer Networks Prof. Ashok K Agrawala 2018 Ashok Agrawala October 9, 2018 (a) October 18 October 9, 2018 1 host Message, Segment, Packet, and Frame host HTTP HTTP message HTTP TCP TCP segment
More information! Distance vector routing! Link state routing.! Path vector routing! BGP: Border Gateway Protocol! Route aggregation
! Distance vector routing! Link state routing Information Network I Youki Kadobayashi! IGP and EGP Intra-domain routing protocol, inter-domain routing protocol! Path vector routing! BGP: Border Gateway
More informationROUTING PROTOCOLS. Mario Baldi Routing - 1. see page 2
ROUTING PROTOCOLS Mario Baldi www.baldi.info Routing - 1 Copyright Notice This set of transparencies, hereinafter referred to as slides, is protected by copyright laws and provisions of International Treaties.
More informationOSPFv3 Address Families
The Open Shortest Path First version 3 (OSPFv3) address families feature enables both IPv4 and IPv6 unicast traffic to be supported. With this feature, users may have two processes per interface, but only
More informationComprehensive Solution for Anomaly-free BGP
Comprehensive Solution for Anomaly-free BGP Ravi Musunuri, Jorge A. Cobb Department of Computer Science, The University of Texas at Dallas, Richardson, TX-7083-0688 musunuri, cobb @utdallas.edu Abstract.
More informationICS 351: Today's plan. distance-vector routing game link-state routing OSPF
ICS 351: Today's plan distance-vector routing game link-state routing OSPF distance-vector routing game 1. prepare a list of all neighbors and the links to them, and the metric for each link 2. create
More informationChapter 7: Routing Dynamically. Routing & Switching
Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based
More informationICS 351: Today's plan. OSPF BGP Routing in general
ICS 351: Today's plan OSPF BGP Routing in general link-state routing in distance-vector (Bellman-Ford, Ford-Fulkerson, RIP-style) routing, each router distributes its routing table to its neighbors an
More informationMeasuring IPv6 Adoption
Measuring IPv6 Adoption Presenter: Johannes Zirngibl Technische Universität München Munich, 18. May 2017 Author: Jakub Czyz (University of Michigan) Mark Allman (International Computer Science Institute)
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline Continued from previous lecture on: Distance vector routing Link state routing IGP and EGP Interior gateway protocol, Exterior
More informationInter-Autonomous-System Routing: Border Gateway Protocol
Inter-Autonomous-System Routing: Border Gateway Protocol Antonio Carzaniga Faculty of Informatics University of Lugano June 14, 2005 Outline Hierarchical routing BGP Routing Routing Goal: each router u
More informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in
More informationCSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca
CSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca Based partly on lecture notes by Rob Sherwood, David Mazières, Phil Levis, John Jannotti Today Last time: Intra-Domain Routing (IGP) RIP distance
More informationQoS Routing Extensions to OSPF
QoS Routing Extensions to OSPF Jani Lakkakorpi jani.lakkakorpi@nokia.com Abstract This paper briefly describes the extensions suggested to the OSPF [1] protocol to support QoS routes. These extensions
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationProviding Reliable IPv6 Access Service Based on Overlay Network
Providing Reliable IPv6 Access Service Based on Overlay Network Xiaoxiang Leng, Jun Bi, and Miao Zhang Network Research Center, Tsinghua University Beijing 100084, China Abstract. During the transition
More informationBGP-LS extension for inter-as topology retrieval
BGP-LS extension for inter-as topology retrieval draft-wang-idr-bgpls-inter-as-topology-ext Aijun Wang China Telecom IETF101@London, Mar 2018 1/10 Contents Scenarios Summary and Requirements Current Solutions
More informationRouting(2) Inter-domain Routing
Routing(2) Inter-domain Routing Information Network I Youki Kadobayashi 1 Outline! Continued from previous lecture on:! Distance vector routing! Link state routing! IGP and EGP Interior gateway protocol,
More informationVivaldi: A Decentralized Network Coordinate System
Vivaldi: A Decentralized Network Coordinate System Xintong Wang, Han Zhang EECS 589 Paper Review 1 Full Reference Authors: Frank Dabek, Russ Cox, Frans Kaashoek and Robert Morris. Title: Vivaldi: A Decentralized
More informationRouting Overview for Firepower Threat Defense
Path Determination This chapter describes underlying concepts of how routing behaves within the Cisco Firepower Threat Defense, and the routing protocols that are supported. Routing is the act of moving
More informationCS 43: Computer Networks. 24: Internet Routing November 19, 2018
CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small
More informationVivaldi: A Decentralized Network Coordinate System. Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT. Published at SIGCOMM 04
Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published at SIGCOMM 04 Presented by: Emmanouel Kyriakakis Key tool: Synthetic Coordinates
More informationOverview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load
Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C
More informationInternet Routing Protocols Tuba Saltürk
Internet Routing Protocols 15505068 Tuba Saltürk Outline Internet Routers Routing Protocol Interior Gateway Protocol (IGP) Distance- Vector Routing Protocol Routing Information Protocol (RIP) Interior
More informationInter-Autonomous-System Routing: Border Gateway Protocol
Inter-Autonomous-System Routing: Border Gateway Protocol Antonio Carzaniga Faculty of Informatics University of Lugano December 10, 2014 Outline Hierarchical routing BGP Routing 2005 2007 Antonio Carzaniga
More informationDynamics of Hot-Potato Routing in IP Networks
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs Research http://www.research.att.com/~jrex Joint work with Renata Teixeira (UCSD), Aman Shaikh (AT&T), and Timothy Griffin (Intel)
More informationIETF 81 World IPv6 Day Operators Review
IETF 81 World IPv6 Day Operators Review Hurricane Electric IPv6 Native Backbone Massive Peering! Enabled IPv6 Years Ago!! IETF 81 Quebec Canada 26 th July 2011 Martin J. Levy, Director IPv6 Strategy Hurricane
More informationA SDN-like Loss Recovery Solution in Application Layer Multicast Wenqing Lei 1, Cheng Ma 1, Xinchang Zhang 2, a, Lu Wang 2
5th International Conference on Information Engineering for Mechanics and Materials (ICIMM 2015) A SDN-like Loss Recovery Solution in Application Layer Multicast Wenqing Lei 1, Cheng Ma 1, Xinchang Zhang
More informationInterdomain routing CSCI 466: Networks Keith Vertanen Fall 2011
Interdomain routing CSCI 466: Networks Keith Vertanen Fall 2011 Overview Business relationships between ASes Interdomain routing using BGP Advertisements Routing policy Integration with intradomain routing
More informationBuilding a low-latency, proximity-aware DHT-based P2P network
Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan
More informationInter-domain Routing. Outline. Border Gateway Protocol
Inter-domain Routing Outline Border Gateway Protocol Internet Structure Original idea CS 640 2 Internet Structure Today CS 640 3 Route Propagation in the Internet Autonomous System (AS) corresponds to
More informationVirtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing
Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing Zhi Li, Prasant Mohapatra, and Chen-Nee Chuah University of California, Davis, CA 95616, USA {lizhi, prasant}@cs.ucdavis.edu,
More informationCERNET2. CERNET2 Design Goals CERNET2 Backbone. CERNET2 Operation Current Status. Why Next Generation Internet in
China Testbed CERNET2 (Next Generation China Education and Research Network ) "We were e a learner e and follower owe in the edeveop development e of the first generation e Inter net, but we have caught
More informationICS 351: Today's plan. OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics
ICS 351: Today's plan OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics OSPF OSPF generally used within a single Autonomous System (AS), i.e. within an organization
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
More informationRouting. Jens A Andersson Communication Systems
Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationEnhancement of the CBT Multicast Routing Protocol
Enhancement of the CBT Multicast Routing Protocol Seok Joo Koh and Shin Gak Kang Protocol Engineering Center, ETRI, Korea E-mail: sjkoh@pec.etri.re.kr Abstract In this paper, we propose a simple practical
More informationApplication Presence Fingerprinting for NAT-Aware Router
Application Presence Fingerprinting for NAT-Aware Router Jun Bi, Lei Zhao, and Miao Zhang Network Research Center, Tsinghua University Beijing, P.R. China, 100084 junbi@cernet.edu.cn Abstract. NAT-aware
More informationTop-Down Network Design
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic
More informationEvaluating Application-Layer Traffic Optimization Cost Metrics for P2P Multimedia Streaming
Downloaded from orbit.dtu.dk on: Feb 07, 2018 Evaluating Application-Layer Traffic Optimization Cost Metrics for P2P Multimedia Streaming Poderys, Justas; Soler, José Published in: Proceedings of 25th
More informationCSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS
CSE 47 Introduction to Computer Networks Roch Guérin Final Exam Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS 1. [10 points] Bob has been provided with the following pair of
More informationComputer Science 461 Midterm Exam March 14, :00-10:50am
NAME: Login name: Computer Science 461 Midterm Exam March 14, 2012 10:00-10:50am This test has seven (7) questions, each worth ten points. Put your name on every page, and write out and sign the Honor
More informationP2P Traffic Optimization Based on Dynamic Network Information Aware
Int. J. Communications, Network and System Sciences, 2017, 10, 90-104 http://www.scirp.org/journal/ijcns ISSN Online: 1913-3723 ISSN Print: 1913-3715 P2P Traffic Optimization Based on Dynamic Network Information
More informationIP Routing Volume Organization
IP Routing Volume Organization Manual Version 20091105-C-1.03 Product Version Release 6300 series Organization The IP Routing Volume is organized as follows: Features IP Routing Overview Static Routing
More informationIntroduction. Keith Barker, CCIE #6783. YouTube - Keith6783.
Understanding, Implementing and troubleshooting BGP 01 Introduction http:// Instructor Introduction Keith Barker, CCIE #6783 CCIE Routing and Switching 2001 CCIE Security 2003 kbarker@ine.com YouTube -
More informationRouting Concepts. IPv4 Routing Forwarding Some definitions Policy options Routing Protocols
Routing Basics 1 Routing Concepts IPv4 Routing Forwarding Some definitions Policy options Routing Protocols 2 IPv4 Internet uses IPv4 Addresses are 32 bits long Range from 1.0.0.0 to 223.255.255.255 0.0.0.0
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationHybrid Overlay Structure Based on Random Walks
Hybrid Overlay Structure Based on Random Walks Ruixiong Tian 1,, Yongqiang Xiong 2, Qian Zhang 2,BoLi 3, Ben Y. Zhao 4, and Xing Li 1 1 Department of Electronic Engineering, Tsinghua University 2 Microsoft
More informationWhich of the following describe the process identifier that is used to run OSPF on a router? (Choose two)
ICND1 OSPF Questions Question 1 Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two) A. It is locally significant. B. It is globally significant. C.
More informationRouting Unicast routing protocols
Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type
More informationProtecting an EBGP peer when memory usage reaches level 2 threshold 66 Configuring a large-scale BGP network 67 Configuring BGP community 67
Contents Configuring BGP 1 Overview 1 BGP speaker and BGP peer 1 BGP message types 1 BGP path attributes 2 BGP route selection 6 BGP route advertisement rules 6 BGP load balancing 6 Settlements for problems
More informationMPLS L3VPN. The MPLS L3VPN model consists of three kinds of devices: PE CE Site 2. Figure 1 Network diagram for MPLS L3VPN model
is a kind of PE-based L3VPN technology for service provider VPN solutions. It uses BGP to advertise VPN routes and uses to forward VPN packets on service provider backbones. provides flexible networking
More informationIPv6 Module 6x ibgp and Basic ebgp
IPv6 Module 6x ibgp and Basic ebgp Objective: Using IPv6, simulate four different interconnected ISP backbones using a combination of IS-IS, internal BGP, and external BGP. Topology : Figure 1 BGP AS Numbers
More informationResearch on Heterogeneous Communication Network for Power Distribution Automation
3rd International Conference on Material, Mechanical and Manufacturing Engineering (IC3ME 2015) Research on Heterogeneous Communication Network for Power Distribution Automation Qiang YU 1,a*, Hui HUANG
More informationTable of Contents 1 Static Routing Configuration RIP Configuration 2-1
Table of Contents 1 Static Routing Configuration 1-1 Introduction 1-1 Static Route 1-1 Default Route 1-1 Application Environment of Static Routing 1-1 Configuring a Static Route 1-2 Configuration Prerequisites
More informationConfiguring OSPF. Cisco s OSPF Implementation
Configuring OSPF This chapter describes how to configure OSPF. For a complete description of the OSPF commands in this chapter, refer to the OSPF s chapter of the Network Protocols Reference, Part 1. To
More informationAn Experimental Analysis on OSPF-TE Convergence Time
An Experimental Analysis on OSPF-TE Convergence Time S. Huang* a, K. Kitayama a, F. Cugini b, F. Paolucci c, A. Giorgetti c, L. Valcarenghi c, P. Castoldi c a Osaka University, Osaka, Japan; b CNIT, Pisa,
More informationLast time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm
Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost
More informationAkamai's V6 Rollout Plan and Experience from a CDN Point of View. Christian Kaufmann Director Network Architecture Akamai Technologies, Inc.
Akamai's V6 Rollout Plan and Experience from a CDN Point of View Christian Kaufmann Director Network Architecture Akamai Technologies, Inc. Agenda About Akamai General IPv6 transition technologies Challenges
More informationRouting Basics. What is Routing? Routing Components. Path Determination CHAPTER
CHAPTER 5 Routing Basics This chapter introduces the underlying concepts widely used in routing protocols Topics summarized here include routing protocol components and algorithms In addition, the role
More informationRouting Basics ISP/IXP Workshops
Routing Basics ISP/IXP Workshops 1 Routing Concepts IPv4 Routing Forwarding Some definitions Policy options Routing Protocols 2 IPv4 Internet uses IPv4 addresses are 32 bits long range from 1.0.0.0 to
More informationIntroduction to OSPF
Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 Agenda OSPF Primer OSPF in Service Provider Networks OSPF BCP - Adding Networks OSPF Command Summary 2 OSPF Primer 3
More informationOn Feasibility of P2P Traffic Control through Network Performance Manipulation
THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE On Feasibility of P2P Traffic Control through Network Performance Manipulation HyunYong Lee Masahiro Yoshida
More informationVivaldi Practical, Distributed Internet Coordinates
Vivaldi Practical, Distributed Internet Coordinates Frank Dabek Russ Cox Robert Morris Frans Kaashoek Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology ACM SIGCOMM
More informationMotivation and goal Design concepts and service model Architecture and implementation Performance, and so on...
Motivation and goal Design concepts and service model Architecture and implementation Performance, and so on... Autonomous applications have a demand for grasping the state of hosts and networks for: sustaining
More informationNetwork Forensics Prefix Hijacking Theory Prefix Hijacking Forensics Concluding Remarks. Network Forensics:
Network Forensics: Network OS Fingerprinting Prefix Hijacking Analysis Scott Hand September 30 th, 2011 Outline 1 Network Forensics Introduction OS Fingerprinting 2 Prefix Hijacking Theory BGP Background
More informationChapter 4: outline. Network Layer 4-1
Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link
More informationEarly Measurements of a Cluster-based Architecture for P2P Systems
Early Measurements of a Cluster-based Architecture for P2P Systems Balachander Krishnamurthy, Jia Wang, Yinglian Xie I. INTRODUCTION Peer-to-peer applications such as Napster [4], Freenet [1], and Gnutella
More informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
More informationOSPFv3 Address Families
The Open Shortest Path First version 3 (OSPFv3) address families feature enables both IPv4 and IPv6 unicast traffic to be supported. With this feature, users may have two processes per interface, but only
More informationOSPFv3 Address Families
The Open Shortest Path First version 3 (OSPFv3) address families feature enables both IPv4 and IPv6 unicast traffic to be supported. With this feature, users may have two processes per interface, but only
More informationChapter 4: Advanced Internetworking. Networking CS 3470, Section 1
Chapter 4: Advanced Internetworking Networking CS 3470, Section 1 Intra-AS and Inter-AS Routing a C C.b b d A A.a a b A.c c B.a a B c Gateways: perform inter-as routing amongst themselves b perform intra-as
More informationENERGY-EFFICIENT PROTOCOL IN OMNET++ SIMULATION ENVIRONMENT. Krzysztof Daniluk
159 ENERGY-EFFICIENT PROTOCOL IN OMNET++ SIMULATION ENVIRONMENT Krzysztof Daniluk Abstract: New idea for energy-efficient extension for OSPF protocol is presented. New concept is based on Dijkstra s algorithm,
More informationRouting Basics. ISP Workshops. Last updated 10 th December 2015
Routing Basics ISP Workshops Last updated 10 th December 2015 1 Routing Concepts p IPv4 & IPv6 p Routing p Forwarding p Some definitions p Policy options p Routing Protocols 2 IPv4 p Internet still uses
More informationIntended status: Standards Track Expires: December 11, 2018 Chongqing University of Posts and Telecommunications June 9, 2018
DetNet Internet Draft Intended status: Standards Track Expires: December 11, 2018 H. Wang P. Wang C. Zhang Y. Yang Chongqing University of Posts and Telecommunications June 9, 2018 Joint Scheduling Architecture
More information