Internet Sibilla: utilizing DNS for delay estimation service (original) (raw)
Related papers
2009
ABSTRACT Internet-wide services and applications depend on accurate information about the internal network state to deliver good performance to end-users. However, today's Internet does not provide such information explicitly and a number of systems have been recently proposed and implemented to provide a shared measurement infrastructure for distributed applications [1–4]. The goal of this work is to demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates ...
Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements
2010 Proceedings IEEE INFOCOM, 2010
Abstract Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) ...
Scalable and systematic Internet-wide path and delay estimation from existing measurements
Computer Networks, 2011
Internet-wide services and applications depend on accurate information about the internal network state to deliver good performance to end-users. However, today's Internet does not provide such information explicitly and a number of systems have been recently proposed and implemented to provide a shared measurement infrastructure for distributed applications. The goal of this work is to demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The key idea behind scaling measurements to the size of the Internet is to take advantage of the known underlying structure of the network.
Intersection Characteristics of End-to-End Internet Paths and Trees
13TH IEEE International Conference on Network Protocols (ICNP'05), 2005
This paper focuses on understanding the scale and the distribution of "state overhead" (briefly load) that is incurred on the routers by various value-added network services, e.g., IP multicast and IP traceback. This understanding is essential to developing appropriate mechanisms and provisioning resources so that the Internet can support such value-added services in an efficient and scalable manner. We mainly consider the number of end-to-end paths or trees intersecting at a router to represent the amount of state overhead at that router. Hence, we analyze the router-level intersection characteristics of end-to-end Internet paths or trees to approximate the state overhead distribution in the Internet. For the reliability of our analysis, a representative, end-to-end router-level Internet map is essential. Although several maps are available, they are at best insufficient for our analysis. Therefore, in the first part of our work, we exert a measurement study to obtain a large size end-to-end router-level map conforming to our constraints. In the second part, we conduct various experiments using our map and shed some light on the scale and distribution of state overhead of value-added Internet services in both unicast and multicast environments.
Measurements on delay and hop-count of the internet
1998
To nd out how big the Internet is, we measured the round-trip delays and hop-counts from a UCLA host computer to a randomly selected set of three thousand Internet hosts around the world. Our results show that over 90% of these hosts in continental US are within 18 hops from UCLA, and the round-trip delays to 90% of these hosts are less than 153ms. There seems no strong correlation between the delay and hop-count, although the average delay increases with hop-count. Measurements to international hosts show that the delay and hop-count strongly depend on the countries the hosts locate. Physical distances and link speeds are the most important factors that determine the round-trip delay.
Towards Expeditious and Unswerving Routing to Corroborate Nascent Internet
2009
The internet is now-a-days experiencing a stress due to some inherent problems with the main interdomain routing protocol, boarder gateway protocol (BGP), the amount of time it takes to converge, number of update message exchanged followed by a failure to stabilize, the amount of time required to get a valid alternate path following the failure, the way size of routing table increasing, and security issues like integrity and privacy of routing tables and routing updates exchanged among the routers, are of our primary concern. In our proposed research work we plan to address aforementioned issues related to internet routing specially in boarder gateway protocol to enable BGP to offer expeditious unswerving routing to corroborate nascent internet. We plan to make some changes in the design of boarder gateway protocol and may introduce addition of extra features in BGP to help support above mentioned objective.
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-...
2009 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities and Workshops, 2009
There is a long line of research on measuring the Quality of Service (QoS) path characteristics of the Internet, such as available bandwidth, path capacity, packets reordering, delay and jitter. Most of the measurement techniques are based on active probing using pairs or trains of packets. The packets are either transmitted back-to-back or at a desired spacing (e.g., to achieve a certain rate). In most cases, one-way active probing techniques are preferred over round trip measurements as they gather less measurement noise.
Towards DisNETPerf: a Distributed Internet Paths Performance Analyzer
2015
For more than 25 years now, traceroute has demonstrated its supremacy for network-path measurement, becoming the most widely used Internet path diagnosis tool today. A major limitation of traceroute when the destination is not controllable by the user is its inability to measure reverse paths, i.e., the path from a destination back to the source. Proposed techniques to address this issue rely on IP address spoong, which might lead to security concerns. In this paper we introduce and evaluate DisNETPerf, a new tool for locating probes that are the closest to a distant server. Those probes are then used to collect data from the server point-of-view to the service user for path performance monitoring and troubleshooting purposes. We propose two techniques for probe location, and demonstrate that the reverse path can be measured with very high accuracy in certain scenarios.