Trade-offs in optimizing the cache deployments of CDNs

Hasan, S. S.; Gorinsky, Sergey; Dovrolis, Constantine; Sitaraman, Ramesh K.

doi:10.1109/infocom.2014.6847969

Cited by 66 publications

(38 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The Internet structure is highly important for network accountability [4], multihoming [2], routing security [32], traffic delivery economics [10,11], and various problems in content delivery via overlay systems [14,26,36,38,40,47,50,63,67]. By clarifying the Internet structure, our study of remote peering enables further advances in these and other significant practical domains.…”

Section: Related Workmentioning

confidence: 99%

Remote Peering

Castro

Cardona

Gorinsky

et al. 2014

Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies

Self Cite

View full text Add to dashboard Cite

The trend toward more peering between networks is commonly conflated with the trend of Internet flattening, i.e., reduction in the number of intermediary organizations on Internet paths. Indeed, direct peering interconnections bypass layer-3 transit providers and make the Internet flatter. This paper studies an emerging phenomenon that separates the two trends: we present the first systematic study of remote peering, an interconnection where remote networks peer via a layer-2 provider. Our measurements reveal significant presence of remote peering at IXPs (Internet eXchange Points) worldwide. Based on ground truth traffic, we also show that remote peering has a substantial potential to offload transit traffic. Generalizing the empirical results, we analytically derive conditions for economic viability of remote peering versus transit and direct peering. Because remote-peering services are provided on layer 2, our results challenge the traditional reliance on layer-3 topologies in modeling the Internet economic structure. We also discuss broader implications of remote peering for reliability, security, accountability, and other aspects of Internet research.

show abstract

Section: Related Workmentioning

confidence: 99%

Remote Peering

Castro

Cardona

Gorinsky

et al. 2014

Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

“…Admittedly it remains to be seen what role CDNs will play in the future. Also, there is considerable prior work on algorithms and deployment of caching [17][18]. Since our focus is elsewhere, we rely on a basic and early model of caching [19].…”

Section: Introductionmentioning

confidence: 99%

Consortiums of ISP-Content Providers Formed by Nash Bargaining for Internet Content Delivery

Mitra

Sridhar

2019

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

The formation of consortiums of a broadband access Internet Service Provider (ISP) and multiple Content Providers (CP) is considered for large-scale content caching. The consortium members share costs from operations and investments in the supporting infrastructure. Correspondingly, the model's cost function includes marginal and fixed costs; the latter has been important in determining industry structure. Also, if Net Neutrality regulations permit, additional network capacity on the ISP's last mile may be contracted by the CPs. The number of subscribers is determined by a combination of users' price elasticity of demand and Quality of Experience. The profit generated by a coalition after pricing and design optimization determines the game's characteristic function. Coalition formation is by a bargaining procedure due to Okada (1996) based on random proposers in a non-cooperative, multi-player game-theoretic framework. A necessary and sufficient condition is obtained for the Grand Coalition to form, which bounds subsidies from large to small contributors. Caching is generally supported even under Net Neutrality regulations. The Grand Coalition's profit matches upper bounds. Numerical results illustrate the analytic results.

show abstract

“…Therefore, inter-AS routes in the Internet are typically congruent with the business relations among the ASes [27]. (ii) to control effective neighbor selection in P2P networks [26]; (iii) to leverage the quality of VoIP services and reduce the traffic overhead [36]; (iv) to develop techniques for passive network delay estimation [25]; (v) to optimize server deployment in content delivery networks [18]; (vi) to analyze failures and determine reliability bottlenecks in the Internet [10]; and (vii) to generate synthetic network topologies [2].…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, a significant drawback in many studies is simplifying the AS-level topology map of the Internet into an undirected graph, and then using the hop distance as a means to find the shortest paths between ASes [2,6,18,26,36]. Although such an approach facilitates the discovery of the shortest paths between ASes for practical purposes, the derived conclusions might be greatly misleading.…”

Section: Introductionmentioning

confidence: 99%

Policy-Preferred Paths in AS-level Internet Topology Graphs

Tozal

2018

tag

View full text Add to dashboard Cite

Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, and then using the hop distance as a means to find the shortest paths between the ASes. A less significant drawback is restricting the shortest paths to only valley-free paths. Both approaches usually inflate the number of paths between ASes; introduce erroneous paths that do not conform to economic policies; and generate symmetric paths, which in reality is not a rule. As a result, the derived conclusions might be greatly misleading. In this study we introduce a single-destination, policy-preferred path enumeration algorithm which discovers policy consistent paths from all ASes to a destination AS in an edge-labeled, finite, directed graph representing the Internet topology. Considering that our algorithm's run time complexity is the same as Dijkstra's shortest paths algorithm, we believe that the proposed algorithm will notably enhance the future works that leverage AS-to-AS paths in Internet topology graphs.

show abstract

Trade-offs in optimizing the cache deployments of CDNs

Cited by 66 publications

References 25 publications

Remote Peering

Remote Peering

Consortiums of ISP-Content Providers Formed by Nash Bargaining for Internet Content Delivery

Policy-Preferred Paths in AS-level Internet Topology Graphs

Contact Info

Product

Resources

About