Routing dynamics measurement and detection for next step internet signaling protocol (original) (raw)

Measurements and analysis of end-to-end Internet dynamics

1997

Accurately characterizing end-to-end Internet dynamics-the performance that a user actually obtains from the lengthy series of network links that comprise a path through the Internet-is exceptionally difficult, due to the network's immense heterogeneity. It can be impossible to gauge the generality of findings based on measurements of a handful of paths, yet logistically it has proven very difficult to obtain end-to-end measurements on larger scales.

A measurement study on the impact of routing events on end-to-end internet path performance

ACM SIGCOMM Computer Communication Review, 2006

Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation between routing dynamics and such performance degradation is poorly understood. In particular, how do routing changes result in degraded end-to-end path performance in the first place? How do factors such as topological properties, routing policies, and iBGP configurations affect the extent to which such routing events can cause performance degradation? Answers to these questions are critical for improving network performance.In this paper, we conduct extensive measurement that involves both controlled routing updates through two tier-1 ISPs and active probes of a diverse set of end-to-end paths on the Internet. We find that routing changes contribute to end-to-end packet loss significantly. Specifically, we study failover events in which a link failure leads to a routing change and recovery events in which a l...

Solving the Interdomain Routing Puzzle–Understanding Interdomain Routing Dynamics

2003

BGP, the Border Gateway Protocol, is the de facto standard protocol for performing interdomain routing on the Internet today. Its main function is to distribute reachability information across the Internet, serving as the "glue" that holds the Internet together. BGP allows flexible configuration of routing policies from each local network and scalable operation, both at the cost of global visibility leading to complex and hard to predict dynamic behavior. BGP's dynamic behavior has so far received relatively little attention in the research community, due to ill-understood operational practices as well as insufficient resources to perform experiments. This thesis combines controlled active measurement in a testbed environment as well as on the actual Internet, correlating routing traffic with the forwarding plane and analyzing the protocol in detail using simulations to expose problems of interdomain routing dynamics. This class of problems may be difficult to reason statically due to the interaction of protocol components and can be observed more easily during run time. They include reachability, forwarding behavior, ix 5.9 Overall percentage of suppressed signals due route flap damping for each Beacon and on a per peer basis for Cisco and Juniper.. .. .. .. .. .. .. .. .. .. . 5.10 Percentage of suppressed Beacon signals due to announcement and withdrawal. . 5.11 The inter-arrival time distribution for each of the three Beacons as seen from Ciscolike and Juniper-like routers. The vertical dotted lines are drawn at 30 second intervals.113 5.12 The inter-arrival time distribution for Cisco-like last hop routers, and Beacon 1. . 5.

Internet Traffic Engineering: History monitoring information featuring routing algorithms

As Internet evolves into a standard communications network, new techniques for the management of the available assets must be introduced. This paper discusses the mechanisms of exercising traffic engineering in IP networks. It provides a thorough analysis of the existent traffic engineering approaches and focuses on presenting the most recent proposals made in the specified area. The interesting point of the research efforts reviewed is that they all follow the growing trend of incorporating history monitoring information in route determination procedure. We finally conclude with the formulation of a history aware traffic engineering model.

A Framework for Measuring and Predicting the Impact of Routing Changes

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007

Routing dynamics heavily influence Internet data plane performance. Existing studies only narrowly focused on a few destinations and did not consider the predictability of the impact of routing changes on performance metrics such as reachability. In this work, we propose an efficient framework to capture coarse-grained but important performance degradation as a result of BGP routing events using lightweight probing. We deployed our framework across six vantage points for 11 weeks and found that the data plane experienced serious performance degradation in the form of reachability loss and forwarding loops following a significant fraction of updates affecting many destination prefixes and networks across all vantage points studied. Specifically, more than 39% of updates resulted in reachability loss, some lasting for more than 300 seconds, impacting more than 72% of probed prefixes and more than 35% of all the prefixes on the Internet. We identified that more than half of the prefixes have predictable routing behavior. Based on the stationarity of the correlation between routing changes and the data plane performance, we developed a model to accurately predict the severity of the impact due to routing changes. Such a model is directly helpful for making informed decisions for improved routing schemes such as overlay routing and backup path selection. Receive BGP updates from network X Send request to probe host X BGP analysis host Probe host X Receive request from BGP analysis host Update live IPs Probe dest.

Design and implementation of TCP data probes for reliable and metric-rich network path monitoring

Proceedings of the 2009 …, 2009

Monitoring network services and diagnosing their problems often require active probing methods. Current probing methods, however, are becoming unreliable, because of interferences from various middleboxes, and inadequate due to their limited path metrics support. In this paper, we present the design and implementation of OneProbe, a new TCP probing method for reliable and metric-rich path monitoring. We have implemented HTTP/OneProbe (i.e., OneProbe for HTTP) which sends TCP data probes containing legitimate HTTP requests to induce HTTP responses for path measurement. Since the probing method is based on TCP's basic data transmission mechanisms, OneProbe works correctly on all major operating systems and web server software, and on 93% of the 37,874 websites randomly selected from the Internet. We also successfully deployed HTTP/OneProbe to monitor a number of network paths for over a month and obtained interesting and useful measurement results.

Measuring the evolution of transport protocols in the internet

ACM SIGCOMM Computer Communication Review, 2005

In this paper we explore the evolution of both the Internet's most heavily used transport protocol, TCP, and the current network environment with respect to how the network's evolution ultimately impacts end-to-end protocols. The traditional end-to-end assumptions about the Internet are increasingly challenged by the introduction of intermediary network elements (middleboxes) that intentionally or unintentionally prevent or alter the behavior of end-to-end communications. This paper provides measurement results showing the impact of the current network environment on a number of traditional and proposed protocol mechanisms (e.g., Path MTU Discovery, Explicit Congestion Notification, etc.). In addition, we investigate the prevalence and correctness of implementations using proposed TCP algorithmic and protocol changes (e.g., selective acknowledgment-based loss recovery, congestion window growth based on byte counting, etc.). We present results of measurements taken using an a...

Investigating Characteristics of Internet Paths

ACM Transactions on Modeling and Performance Evaluation of Computing Systems

Interactive and multimedia applications depend on the stability of end-to-end paths for predictable performance and good quality of service. On the other hand, network providers depend on multiple paths to ensure fault tolerance and use load balancing between these paths to enhance the overall network throughput. In this study, we analyze path dynamics for both end-to-end paths and path segments within service providers’ networks using 2 months of measurement data from the RIPE Atlas platform, which collects path traces between a fixed set of source and destination pairs every 15 minutes. We observe that 78% of the end-to-end routes have at least two alternative Autonomous System (AS) paths with some end-to-end routes going through hundreds of different AS paths during the 2 months of analysis. While AS level paths are often prevalent for a day, there are considerable changes in the routing of the trace packets over the ASes for a longer duration of a month or longer. Analyzing end-...

End-to-end Internet Packet Dynamics

Computer Communication Review, 1997

We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end behaviors due to the different directions of the Internet paths, which often exhibit asymmetries. We characterize the prevalence of unusual network events such as out-of-order delivery and packet corruption; discuss a robust receiver-based algorithm for estimating "bottleneck bandwidth" that addresses deficiencies discovered in techniques based on "packet pair"; investigate patterns of packet loss, finding that loss events are not well-modeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and analyze variations in packet transit delays as indicators of congestion periods, finding that congestion periods also span a wide range of time scales. In x 3 we characterize unusual network behavior: out-of-order delivery, replication, and packet corruption. Then in x 4 we discuss a robust algorithm for estimating the "bottleneck" bandwidth that limits a connection's maximum rate. This estimation is crucial for subsequent analysis because knowing the bottleneck rate lets us determine when the closely-spaced TCP data packets used for our network probes are correlated with each other. (We note that the stream of ack packets returned by the TCP data receiver in general is not correlated, due to the small size and larger spacing of the acks.) Once we can determine which probes were correlated and which not, we then can turn to analysis of end-to-end Internet packet loss (x 5) and delay (x 6). In x 7 we briefly summarize our findings, a number of which challenge commonly-held assumptions about network behavior.

Impact of Hot-Potato Routing Changes in IP Networks

IEEE/ACM Transactions on Networking, 2008

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, a router selects the one with the closest egress point, based on the intradomain path cost. Under such hot-potato routing, an intradomain event can trigger BGP routing changes. To characterize the influence of hot-potato routing, we propose a technique for associating BGP routing changes with events visible in the intradomain protocol, and apply our algorithm to a tier-1 ISP backbone network. We show that (i) BGP updates can lag 60 seconds or more behind the intradomain event, (ii) the number of BGP path changes triggered by hot-potato routing has a nearly uniform distribution across destination prefixes, and (iii) the fraction of BGP messages triggered by intradomain changes varies significantly across time and router locations. We show that hot-potato routing changes lead to longer delays in forwarding-plane convergence, shifts in the flow of traffic to neighboring domains, extra externally-visible BGP update messages, and inaccuracies in Internet performance measurements. 1 To obtain up-to-date information about the size of routing tables, please reference http://www.cidr-report.org.