In this paper, we introduce a framework to observe RPKI relying parties (i.e., those that fetch RPKI data from the distributed repository) and present insights into this ecosystem for the first time. Our longitudinal study of data gathered from three RPKI certification authorities (AFRINIC, APNIC, and our own CA) identifies different deployment models of relying parties and (surprisingly) prevalent inconsistent fetching behavior that affects Internet routing robustness. Our results reveal nearly 90% of relying parties are unable to connect to delegated publication points under certain conditions, which leads to erroneous invalidation of IP prefixes and likely widespread loss of network reachability.

Despite the predicted exhaustion of unallocated IPv4 addresses between 2012 and 2014, it remains unclear how many current clients can use its successor, IPv6, to access the Internet. We propose a refinement of previous measurement studies that mitigates intrinsic measurement biases, and demonstrate a novel web-based technique using Google ads to perform IPv6 capability testing on a wider range of clients. After applying our sampling error reduction, we find that 6% of world-wide connections are from IPv6-capable clients, but only 1--2% of connections preferred IPv6 in dual-stack (dual-stack failure rates less than 1%). Except for an uptick around IPv6-day 2011 these proportions were relatively constant, while the percentage of connections with IPv6-capable DNS resolvers has increased to nearly 60%. The percentage of connections from clients with native IPv6 using happy eyeballs has risen to over 20%.

Abstract In the development of computer networks, the trend towards open systems interconnection is creating the need for standard protocols. The transport level protocols published by ECMA and ISO are supported by the Department of Industry as ‘intercept’ standards to be adopted by the computing community as a whole. This paper presents the published standards interpreted as a set of state transition diagrams. This reinterpretation is a necessary prerequisite to the method of implementation which is based on a finite state automaton. We summarize the advantages of a software ‘funnel machine’ to effect the state transitions during the execution of the transport protocol server. The same analysis and design technique has been used successfully to implement network and link protocol handlers. We recommend its adoption on a variety of machines in any programming language to ensure a relatively short development period and to achieve compatability among the different classes: 0, 1, 2, 3 and 4, of the transport protocol.