Anatomy of a large european IXP

Ager, Bernhard; Chatzis, Nikolaos; Feldmann, Anja; Sarrar, Nadi; Uhlig, Steve; Willinger, Walter

doi:10.1145/2342356.2342393

Cited by 224 publications

(142 citation statements)

References 40 publications

Supporting

Mentioning

138

Contrasting

Order By: Relevance

“…support might not be crucial at this time because according to a recent study, HTTPS is <5% of all web traffic [1].…”

Section: Challenges and Future Workmentioning

confidence: 96%

“…relays supporting 500 000 daily users. 1 Moreover, Tor is popular among BitTorrent users who, while representing a small fraction of the overall users, consume a large fraction of the overall bandwidth [7]. Finally, some delays are inherent in anonymous routing, as paths traverse relays scattered around the world to better hide the true origin of a connection.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

POSTER: PnP

Nguyen

Gong

Das

et al. 2013

Proceedings of the 2013 ACM SIGSAC Conference on Computer &Amp; Communications Security - CCS '13

View full text Add to dashboard Cite

Tor is a widely used network for anonymous communication. Its users frequently experience large communication delays, due to the high user-to-relay ratio, the bandwidth-intensive BitTorrent transfers of a small fraction of the user base, and the inherent latencies from routing traffic through multiple relay hops scattered around the world. These delays significantly degrade the user experience of web browsing, a dominant use of Tor.Improving web browsing performance of Tor has been a subject of much research. Targeting the network and transport layers, prior work includes proposals to throttle bandwidth-intensive connections or to prioritize interactive traffic such as web browsing. We attack the problem at the application layer, noting that a typical web page consists of multiple resources, each of which requires a one-round-trip HTTP request-response cycle to load in the browser. Thus, for a page with many resources, these round trips are a major contributor to the page load time. We investigate PnP (for Prefetchand-Push), where the Tor exit prefetches resources of the web page a client is visiting and pushes them to the client. Our experiments show a significant reduction in page load times as well as higher client's privacy from web page fingerprinting by a local attacker.

show abstract

“…support might not be crucial at this time because according to a recent study, HTTPS is <5% of all web traffic [1].…”

Section: Challenges and Future Workmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

POSTER: PnP

Nguyen

Gong

Das

et al. 2013

Proceedings of the 2013 ACM SIGSAC Conference on Computer &Amp; Communications Security - CCS '13

View full text Add to dashboard Cite

show abstract

“…• The type of content popularity handled by the network will alter the optimal deployment. Demand that is more uniformly distributed is better handled by pushing caches into the core (e.g., an Internet Exchange Point [41]) to better aggregate requests. For highly skewed demands, caches must be pushed to the edge.…”

Section: Summary Of Findingsmentioning

confidence: 99%

Design and Evaluation of the Optimal Cache Allocation for Content-Centric Networking

Wang

Tyson

et al. 2016

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Content-Centric Networking (CCN) is a promising framework to rebuild the Internet's forwarding substrate around the concept of content. CCN advocates ubiquitous in-network caching to enhance content delivery, and thus each router has storage space to cache frequently requested content. In this work, we focus on the cache allocation problem, namely, how to distribute the cache capacity across routers under a constrained total storage budget for the network. We first formulate this problem as a content placement problem and obtain the optimal solution by a two-step method. We then propose a suboptimal heuristic method based on node centrality, which is more practical in dynamic networks with frequent content publishing. We investigate through simulations the factors that affect the optimal cache allocation, and perhaps more importantly we use a real-life Internet topology and video access logs from a large scale Internet video provider to evaluate the performance of various cache allocation methods. We observe that network topology and content popularity are two important factors that affect where exactly should cache capacity be placed. Further, the heuristic method comes with only a very limited performance penalty compared to the optimal allocation. Finally, using our findings, we provide recommendations for network operators on the best deployment of CCN caches capacity over routers.

show abstract

“…In this regard, the fact that adds to the difficulty of countering route leaks using vantage points is the secrecy of the routing policies among ASes. Although several attempts have been made for inferring the relationships and the policies among ASes (see, e.g., [4], [5], [6]), more recent works are currently questioning the accuracy of these techniques [7]. This is mainly due to the fact that the knowledge base for inferring the AS relationships and their corresponding export policies is limited to the routing information available at the data collection points.…”

Section: Introductionmentioning

confidence: 99%

“…This is mainly due to the fact that the knowledge base for inferring the AS relationships and their corresponding export policies is limited to the routing information available at the data collection points. In particular, the increase in the number of Internet Exchange Points (IXPs) and their role in the recent "flattening" of the Internet topology, makes that a large fraction of AS relationships cannot be discovered using these data collection points [7].…”

Section: Introductionmentioning

confidence: 99%

Route leak detection using real-time analytics on local BGP information

Siddiqui

Montero

Yannuzzi

et al. 2014

2014 IEEE Global Communications Conference

View full text Add to dashboard Cite

A route leak can be defined as a security gap that occurs due to the infringement of the routing policies that any two Autonomous Systems (ASes) have agreed upon. Route leaks are seemingly simple, but hard to resolve since the ASes keep their routing policies confidential. Indeed, the traditional palliatives, such as the utilization of route filters, are no longer used by a large number of ASes, given the high administrative burden that they entail. Other alternatives, like BGP monitoring tools, not only require third party information gathered at multiple vantage points, but also they become impotent in many cases, due to their limited view of the interdomain routing state. In this paper, we propose a different approach, which allows to autonomously detect the occurrence of route leaks by solely inspecting the BGP information available at the AS. Our main contributions can be summarized as follows. First, we propose a self-contained Route Leak Detection (RLD) technique, which is based on real-time analytics on the Route Information Bases (RIBs) of the border routers of an AS. Second, we introduce Benign Fool Back (BFB), "a harmless bluff" that can substantially improve the success rate of the RLD technique. Third, we show through exhaustive simulations that our technique can detect route leak incidents in various scenarios with high success rate. In addition, our solution has the following practical advantages: a) no reliance on third party information (e.g., on vantage points); b) no changes required to control-plane protocols (e.g., to BGP); and c) allows non-invasive integration (e.g., using SDN).

show abstract

Anatomy of a large european IXP

Cited by 224 publications

References 40 publications

POSTER: PnP

POSTER: PnP

Design and Evaluation of the Optimal Cache Allocation for Content-Centric Networking

Route leak detection using real-time analytics on local BGP information

Contact Info

Product

Resources

About