Inferring the average as path length of the Internet

Wang, Cun; Li, Zhengmin; Huang, Xiaotao; Zhang, Pei

doi:10.1109/icnidc.2016.7974603

Cited by 10 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the empirical study of Wang et al [51], the average length of AS_PATH on the Internet is about 3.9, and the longest path is about 20. When the average length of AS_PATH is four, the memory requirement of BGPsec_PATH attributes by APVAS became 20% compared to the conventional BGPsec.…”

Section: Consideration Based On Experimental Resultsmentioning

confidence: 99%

“…First, regarding the route advertisement in APVAS takes five minutes as described in Section 6.2, it is limited to when the length of AS_PATH is 20, which is the maximum length. Indeed, the number of such lengths of AS_PATH is quite few [51]. As described in Section 7.1, the average length of AS_PATH is about 3.9, and then the time for the convergence in APVAS is 83.8 seconds, according to Table 6.…”

Section: Computational Cost Of Signature Schemesmentioning

confidence: 97%

See 1 more Smart Citation

APVAS: Reducing the Memory Requirement of AS_PATH Validation by Introducing Aggregate Signatures into BGPsec

Junjie

Yanai

Takemura

et al. 2023

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

The BGPsec protocol, which is an extension of the border gateway protocol (BGP) for Internet routing known as BGPsec, uses digital signatures to guarantee the validity of routing information. However, the use of digital signatures in routing information on BGPsec causes a lack of memory in BGP routers, creating a gaping security hole in today's Internet. This problem hinders the practical realization and implementation of BGPsec. In this paper, we present APVAS (AS path validation based on aggregate signatures), a new protocol that reduces the memory consumption of routers running BGPsec when validating paths in routing information. APVAS relies on a novel aggregate signature scheme that compresses individually generated signatures into a single signature. Furthermore, we implement a prototype of APVAS on BIRD Internet Routing Daemon and demonstrate its efficiency on actual BGP connections. Our results show that the routing tables of the routers running BGPsec with APVAS have 20% lower memory consumption than those running the conventional BG-Psec. We also confirm the effectiveness of APVAS in the real world by using 800,000 routes, which are equivalent to the full route information on a global scale.

show abstract

Section: Consideration Based On Experimental Resultsmentioning

confidence: 99%

Section: Computational Cost Of Signature Schemesmentioning

confidence: 97%

APVAS: Reducing the Memory Requirement of AS_PATH Validation by Introducing Aggregate Signatures into BGPsec

Junjie

Yanai

Takemura

et al. 2023

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

“…We also tackle a more relaxed, 'realistic' case, which takes into account the current layout of the Internet and the users' behavior, which we describe as follows. According to the empirical study of Wang et al [14], the average path length between autonomous systems on the Internet is about 3.9 and the longest path is about 20. Now, we are to simulate real-life usage, with users accessing remote endpoints at random distributions over access providers, which we assume are less likely to change than the target endpoints.…”

Section: The Architecturementioning

confidence: 99%

UI dApps Meet Decentralized Operating Systems

Skowroński

Brzeziński

2022

Electronics

View full text Add to dashboard Cite

The advent of Ethereum opened up a pandora box of decentralized possibilities. While allowing for the replicated, decentralized computation of Turing-complete instructions, platforms such as Ethereum do not offer the possibility of direct, interactive, real-time processing of users’ inputs that could later affect the decentralized state machine. They cannot directly observe, replicate and authenticate users’ actions performed in real-time while presenting the results of these. They lack mechanics that would incentivize full-nodes to provide low-latency-constrained services to users in-between epochs of a decentralized state machine, thus pushing dApps’ developers towards hybrid architectures—ones employing centralized servers while not even considering certain applications, due to the aforementioned limitations. In this research paper, we explore our results of an attempt to create a ‘decentralized operating system’ user experience a reality. We propose an architecture which solves the problems of the responsiveness and finalization of multiple actions performed by users in real-time—without the need for users to pre-authenticate but after having presented a single, unitary consent to commit—through the hereby proposed Deferred Authentication mechanism. To allow for this, we employ an in-house developed #GridScript programming language, used by our decentralized state machine, along with a computer-vision-enabled and AI-aided mobile app (available for both iOS and Android). We introduce the concept of Decentralized Processing Threads (DPTs) and see how these enable fascinating possibilities. In addition, we look into how Access-Control-Lists (ACLs)-enabled, incentivized storage, incentivized Sybil-proof communication, embedded firewall apparatus, integrated off-the-chain payments, and crypto-incentivized off-the-chain storage aid such a system and thus render it as feasible. We highlight various interesting troubles we have encountered, such as state recovery after disconnects of the UI and the replication of its state across both nodes maintaining the network and web browsers. We depict ‘off-the-chain’ mechanics, which we use to reward for real-time services provided to users by nodes maintaining the network. We tackle crypto-incentivized WebRTC swarms not needing centralized servers for signaling. We look into a user-friendly approach to Non-Fungible Tokens (NFTs). The test-bed is readily available with multiple functional UI dApps already in place. Indeed, the paper presents UI and UX design decisions we have undertaken based on conclusions from statistical research results on a group of 50,341 volunteers over 4 years, which we have used to formulate what we codenamed as the Venice UI/UX design paradigm. We extend upon the notion of Token Pools to allow for the Sybil-proof incentivization of multiple-peers from a single data structure stored on the decentralized state machine.

show abstract

“…According to the empirical study of Wang et al [25], the average AS_PATH length on the Internet is about 3.9 and the longest path is about 20. When the average AS_PATH length is 4, the size of route attributes by APVAS became 80% less than the conventional BGPsec.…”

Section: Considerationmentioning

confidence: 99%

APVAS: Reducing Memory Size of AS\_PATH Validation by Using Aggregate Signatures

Junjie¹,

Yanai²,

Takemura³

et al. 2020

Preprint

View full text Add to dashboard Cite

The BGPsec protocol, which is an extension of the border gateway protocol (BGP), uses digital signatures to guarantee the validity of routing information. However, BGPsec's use of digital signatures in routing information causes a lack of memory in BGP routers and therefore creates a gaping security hole in today's Internet. This problem hinders the practical realization and implementation of BGPsec. In this paper, we present APVAS (AS path validation based on aggregate signatures), a new validation method that reduces memory consumption of BGPsec when validating paths in routing information. To do this, APVAS relies on a novel aggregate signature scheme that compresses individually generated signatures into a single signature in two ways, i.e., in sequential and interactive fashions. Furthermore, we implement a prototype of APVAS on BIRD Internet Routing Daemon and demonstrate its efficiency on actual BGP connections. Our results show that APVAS can reduce memory consumption by 80% in comparison with the conventional BGPsec.

show abstract

Inferring the average as path length of the Internet

Cited by 10 publications

References 9 publications

APVAS: Reducing the Memory Requirement of AS_PATH Validation by Introducing Aggregate Signatures into BGPsec

APVAS: Reducing the Memory Requirement of AS_PATH Validation by Introducing Aggregate Signatures into BGPsec

UI dApps Meet Decentralized Operating Systems

APVAS: Reducing Memory Size of AS\_PATH Validation by Using Aggregate Signatures

Contact Info

Product

Resources

About