research-article

Quantifying the benefits of joint content and network routing

Authors:

Vytautas Valancius,

Alex C. SnoerenAuthors Info & Claims

SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

Pages 243 - 254

https://doi.org/10.1145/2465529.2465762

Published: 17 June 2013 Publication History

Abstract

Online service providers aim to provide good performance for an increasingly diverse set of applications and services. One of the most effective ways to improve service performance is to replicate the service closer to the end users. Replication alone, however, has its limits: while operators can replicate static content, wide-scale replication of dynamic content is not always feasible or cost effective. To improve the latency of such services many operators turn to Internet traffic engineering. In this paper, we study the benefits of performing replica-to-end-user mappings in conjunction with active Internet traffic engineering. We present the design of PECAN, a system that controls both the selection of replicas ("content routing") and the routes between the clients and their associated replicas ("network routing"). We emulate a replicated service that can perform both content and network routing by deploying PECAN on a distributed testbed. In our testbed, we see that jointly performing content and network routing can reduce round-trip latency by 4.3% on average over performing content routing alone (potentially reducing service response times by tens of milliseconds or more) and that most of these gains can be realized with no more than five alternate routes at each replica.

References

[1]

Chrome software updates: Courgette. http://dev.chromium.org/developers/design-documents/software-updates-courgette. URL retrieved April 2013.

[2]

Cisco Performance Routing (PfR). http://www.cisco.com/en/US/products/ps8787/products_ios_protocol_option_home.html.URL retrieved April 2013.

[3]

Internap. http://www.internap.com/. URL retrieved April 2013.

[4]

node.js. http://nodejs.org. URL retrieved April 2013.

[5]

PECAN measurement dataset. https://sites.google.com/site/pecanrouting/. URL retrieved April 2013.

[6]

Transit Portal. http://tp.gtnoise.net. URL retrieved April 2013.

[7]

V8 JavaScript engine. http://code.google.com/p/v8/. URL retrieved April 2013.

[8]

Marissa Mayer at Web 2.0. http://glinden.blogspot.com/2006/11/marissa-mayer-at-web-20.html,Nov. 2006. URL retrieved April 2013.

[9]

A. Akella, B. Maggs, S. Seshan, and A. Shaikh. On the performance benefits of multihoming route control. IEEE/ACM Transactions on Networking, 16(1), Feb. 2008.

Digital Library

[10]

A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. A measurement-based analysis of multihoming. In Proc. ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003.

Digital Library

[11]

A. Akella, J. Pang, B. Maggs, S. Seshan, and A. Shaikh. A comparison of overlay routing and multihoming route control. In Proc. ACM SIGCOMM, Portland, OR, Aug. 2004.

Digital Library

[12]

A. Akella, S. Seshan, and A. Shaikh. Multihoming performance benefits: An experimental evaluation of practical enterprise strategies. In Proc. USENIX Annual Technical Conference, Boston, MA, June 2004.

Digital Library

[13]

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), pages 131--145, Banff, Canada, Oct. 2001.

Digital Library

[14]

M. Andrews, B. Shepherd, A. Srinivasan, P. Winkler, and F. Zane. Clustering and server selection using passive monitoring. In Proc. IEEE INFOCOM, New York, NY, June 2002.

[15]

S. Bhattacharjee, M. H. Ammar, E. W. Zegura, V. Shah, and Z. Fei. Application layer anycasting. In Proc. IEEE INFOCOM, Kobe, Japan, Apr. 1997.

Digital Library

[16]

R. Bush, O. Maennel, M. Roughan, and S. Uhlig. Internet optometry: Assessing the broken glasses in Internet reachability. In Proc. Internet Measurement Conference, Chicago, Illinois, Oct. 2009.

Digital Library

[17]

T. Callahan, M. Allman, and V. Paxson. A longitudinal view of HTTP traffic. In Passive & Active Measurement (PAM), Zurich, Switzerland, Apr. 2010.

Digital Library

[18]

J. Chu et al. Increasing TCP's Initial Window. Internet Engineering Task Force, Feb. 2013. http://tools.ietf.org/pdf/draft-ietf-tcpm-initcwnd-08.pdf. URL retrieved April 2013.

[19]

D. Farinacci, V. Fuller, D. Oran, and D. Meyer. Locator/ID Separation Protocol (LISP). Internet Engineering Task Force, Apr. 2008. Internet Draft (http://tools.ietf.org/html/draft-farinacci-lisp-07). Work in progress, expires October 2008.

[20]

D. K. Goldenberg, L. Qiu, H. Xie, Y. R. Yang, and Y. Zhang. Optimizing cost and performance for multihoming. In Proc. ACM SIGCOMM, pages 79--92, Portland, OR, Aug. 2004.

Digital Library

[21]

F. Guo, J. Chen, W. Li, and T. Chiueh. Experiences in building a multihoming load balancing system. In Proc. IEEE INFOCOM, Hong Kong, Mar. 2004.

[22]

C. Huang, N. Holt, A. Wang, A. Greenberg, jin Li, and K. W. Ross. A DNS reflection method for global traffic management. In Proc. USENIX Annual Technical Conference, Boston, MA, June 2010.

Digital Library

[23]

W. Jiang, R. Zhang-Shen, J. Rexford, and M. Chiang. Cooperative content distribution and traffic engineering in an ISP network. In Proc. ACM SIGMETRICS, Seattle, WA, June 2009.

Digital Library

[24]

E. Katz-Bassett, C. Scott, D. R. Choffnes, I. Cunha, V. Valancius, N. Feamster, H. V. Madhyastha, T. Anderson, and A. Krishnamurthy. LIFEGUARD: practical repair of persistent route failures. In Proc. ACM SIGCOMM, Helsinki, Finland, Aug. 2012.

Digital Library

[25]

C. Killian, M. Vrable, A. C. Snoeren, A. Vahdat, and J. Pasquale. Brief announcement: The overlay network content distribution problem. In Proc. ACM PODC, Las Vegas, NV, 2005.

Digital Library

[26]

R. Krishnan, H. V. Madhyastha, S. Jain, S. Srinivasan, A. Krishnamurthy, T. Anderson, and J. Gao. Moving beyond end-to-end path information to optimize CDN performance. In Proc. Internet Measurement Conference, 2009.

Digital Library

[27]

S. Lee, Z.-L. Zhang, and S. Nelakuditi. Exploiting as hierarchy for scalable route selection in multi-homed stub networks. In Proc. Internet Measurement Conference, Taormina, Italy, Oct. 2004.

Digital Library

[28]

G. Linden. Make data useful. https://sites.google.com/site/glinden/Home/StanfordDataMining.2006-11-28.ppt. URL retrieved April 2013.

[29]

MaxMind GeoIP Country. http://www.maxmind.com/app/geolitecountry.URL retrieved April 2013.

[30]

N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. OpenFlow: Enabling innovation in campus networks. ACM Computer Communications Review, Apr. 2008.

Digital Library

[31]

G. Miller. Overlay routing networks (Akarouting). http://www-math.mit.edu/~steng/18.996/lecture9.ps. URL retrieved April 2013.

[32]

M. Motiwala, M. Elmore, N. Feamster, and S. Vempala. Path Splicing. In Proc. ACM SIGCOMM, Seattle, WA, Aug. 2008.

Digital Library

[33]

J. Pang, A. Akella, A. Shaikh, E. Krishnamurthy, and S. Seshan. On the responsiveness of DNS-based network control. In Proc. Internet Measurement Conference, Taormina, Italy, Oct. 2004.

Digital Library

[34]

S. Radhakrishnan, Y. Cheng, J. Chu, A. Jain, and B. Raghavan. TCP fast open. In Proc. CoNEXT, Dec. 2011.

Digital Library

[35]

B. Raghavan and A. C. Snoeren. A system for authenticated policy-compliant routing. In Proc. ACM SIGCOMM, Portland, OR, Aug. 2004.

Digital Library

[36]

Adaptive Networking Software. http://198.152.212.23/css/Products/P0345.URL retrieved April 2013.

[37]

S. Savage, T. Anderson, et al. Detour: A Case for Informed Internet Routing and Transport. IEEE Micro, 19(1):50--59, Jan. 1999.

Digital Library

[38]

S. Seshan, M. Stemm, and R. Katz. A Network Measurement Architecture for Adaptive Applications. In Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar. 2000.

[39]

A. Sharma, A. Venkataramani, and R. Sitaraman. Distributing content simplifies ISP traffic engineering. In Proc. ACM SIGMETRICS, Pittsburgh, PA, June 2013.

Digital Library

[40]

SPDY: An experimental protocol for a faster web. http://www.chromium.org/spdy/spdy-whitepaper. URL retrieved April 2013.

[41]

S. Sundaresan, W. de Donato, N. Feamster, R. Teixeira, S. Crawford, and A. Pescape. Broadband Internet Performance: A View from the Gateway. http://www.ietf.org/proceedings/85/slides/slides-85-irtfopen-2.pptx. URL retrieved April 2013.

[42]

M. B. Tariq, A. Zeitoun, V. Valancius, N. Feamster, and M. Ammar. Answering "What-if" Deployment and Configuration Question s with WISE. In Proc. ACM SIGCOMM, Seattle, WA, Aug. 2008.

Digital Library

[43]

S. Uhlig and O. Bonaventure. Designing bgp-based outbound traffic engineering techniques for stub ases. ACM Computer Communications Review, 34:89--106, Oct. 2004.

Digital Library

[44]

H. Wang, H. Xie, L. Qiu, A. Silberschatz, and Y. Yang. Optimal ISP subscription for Internet multihoming: Algorithm design and implication analysis. In Proc. IEEE INFOCOM, Miami, FL, Mar. 2005.

[45]

P. Wendell, J. Jiang, J. Rexford, and M. Freedman. DONAR: Decentralized server selection for cloud services. In Proc. ACM SIGCOMM, August/September 2010.

Digital Library

[46]

W. Xu and J. Rexford. MIRO: Multi-path Interdomain ROuting. In Proc. ACM SIGCOMM, Pisa, Italy, Aug. 2006.

Digital Library

[47]

X. Yang, D. Wetherall, and T. Anderson. Source selectable path diversity via routing deflections. In Proc. ACM SIGCOMM, Pisa, Italy, Aug. 2006.

Digital Library

[48]

M. Yu, W. Jiang, H. Li, and I. Stoica. Tradeoffs in CDN designs for throughput oriented traffic. In Proc. CoNEXT, Dec. 2012.

Digital Library

Cited By

Xie TThakkar SHe TMcDaniel PBurke Q(2023)Joint Caching and Routing in Cache Networks With Arbitrary TopologyIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327672434:8(2237-2250)Online publication date: Aug-2023
https://doi.org/10.1109/TPDS.2023.3276724
Xie TThakkar SHe TMcDaniel PBurke Q(2022)Joint Caching and Routing in Cache Networks with Arbitrary Topology2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS54860.2022.00015(56-66)Online publication date: Jul-2022
https://doi.org/10.1109/ICDCS54860.2022.00015
Apostolaki MSingla AVanbever L(2021)Performance-Driven Internet Path SelectionProceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)10.1145/3482898.3483366(41-53)Online publication date: 11-Oct-2021
https://dl.acm.org/doi/10.1145/3482898.3483366
Show More Cited By

Index Terms

Quantifying the benefits of joint content and network routing
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

Quantifying the benefits of joint content and network routing
Performance evaluation review

Online service providers aim to provide good performance for an increasingly diverse set of applications and services. One of the most effective ways to improve service performance is to replicate the service closer to the end users. Replication alone, ...
Routing and content delivery for in-network caching enabled IP network
Abstract
Information-Centric Networking (ICN) has been recently recognized as a promising future Internet paradigm by providing content-oriented functionality and in-network caching characteristic rather than relying on overlay or end-to-end communication ...
Secure content delivery in information-centric networks: design, implementation, and analyses
ICN '13: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking

In this paper, we propose a novel secure content delivery framework, for an information-centric network, which will enable content providers (e.g., Netflix and Youtube) to securely disseminate their content to legitimate users via content distribution ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

June 2013

406 pages

ISBN:9781450319003

DOI:10.1145/2465529

General Chair:
Mor Harchol-Balter
Carnegie Mellon University, USA
,
Program Chairs:
John Douceur
Microsoft Research, USA
,
Jun Xu
Georgia Institute of Technology, USA

ACM SIGMETRICS Performance Evaluation Review Volume 41, Issue 1
Performance evaluation review
June 2013
385 pages
ISSN:0163-5999
DOI:10.1145/2494232
Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMETRICS '13

Sponsor:

SIGMETRICS

SIGMETRICS '13: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems

June 17 - 21, 2013

PA, Pittsburgh, USA

Acceptance Rates

SIGMETRICS '13 Paper Acceptance Rate 54 of 196 submissions, 28%;

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
416
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Xie TThakkar SHe TMcDaniel PBurke Q(2023)Joint Caching and Routing in Cache Networks With Arbitrary TopologyIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.327672434:8(2237-2250)Online publication date: Aug-2023
https://doi.org/10.1109/TPDS.2023.3276724
Xie TThakkar SHe TMcDaniel PBurke Q(2022)Joint Caching and Routing in Cache Networks with Arbitrary Topology2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS54860.2022.00015(56-66)Online publication date: Jul-2022
https://doi.org/10.1109/ICDCS54860.2022.00015
Apostolaki MSingla AVanbever L(2021)Performance-Driven Internet Path SelectionProceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)10.1145/3482898.3483366(41-53)Online publication date: 11-Oct-2021
https://dl.acm.org/doi/10.1145/3482898.3483366
Fonseca OCunha IFazzion EMeira WSilva BFerreira RKatz-Bassett E(2021)Identifying Networks Vulnerable to IP SpoofingIEEE Transactions on Network and Service Management10.1109/TNSM.2021.306148618:3(3170-3183)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3061486
Li YGuo DCao XLyu FChen H(2021)DeepDelivery: Leveraging Deep Reinforcement Learning for Adaptive IoT Service Delivery2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)10.1109/IWQOS52092.2021.9521360(1-6)Online publication date: 25-Jun-2021
https://doi.org/10.1109/IWQOS52092.2021.9521360
Schlinker BArnold TCunha IKatz-Bassett EMohaisen AZhang Z(2019)PEERINGProceedings of the 15th International Conference on Emerging Networking Experiments And Technologies10.1145/3359989.3365414(51-67)Online publication date: 3-Dec-2019
https://dl.acm.org/doi/10.1145/3359989.3365414
Calder MSchröder MGao RStewart RPadhye JMahajan RAnanthanarayanan GKatz-Bassett ESeshan SBanerjee S(2018)OdinProceedings of the 15th USENIX Conference on Networked Systems Design and Implementation10.5555/3307441.3307484(501-517)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.5555/3307441.3307484
Bhattacherjee DAqeel WBozkurt IAguirre AChandrasekaran BGodfrey PLaughlin GMaggs BSingla A(2018)Gearing up for the 21st century space raceProceedings of the 17th ACM Workshop on Hot Topics in Networks10.1145/3286062.3286079(113-119)Online publication date: 15-Nov-2018
https://dl.acm.org/doi/10.1145/3286062.3286079
Arnold TSchlinker BCunha ÍKatz-Bassett E(2018)Controlling Real Cloud Experiments from BGP to the Server (and Back)Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos10.1145/3234200.3234247(123-125)Online publication date: 7-Aug-2018
https://dl.acm.org/doi/10.1145/3234200.3234247
Xie RJia X(2018)Data Transfer Scheduling for Maximizing Throughput of Big-Data Computing in Cloud SystemsIEEE Transactions on Cloud Computing10.1109/TCC.2015.24648086:1(87-98)Online publication date: 1-Jan-2018
https://doi.org/10.1109/TCC.2015.2464808
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents