research-article

Free access

Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers

Authors:

Virajith Jalaparti,

Srikanth Kandula,

Brendan Lucier,

Ishai MenacheAuthors Info & Claims

SIGCOMM '16: Proceedings of the 2016 ACM SIGCOMM Conference

Pages 73 - 86

https://doi.org/10.1145/2934872.2934893

Published: 22 August 2016 Publication History

Abstract

Neither traffic engineering nor fixed prices (e.g., \$/GB) alone fully address the challenges of highly utilized inter-datacenter WANs. The former offers more service to users who overstate their demands and poor service overall. The latter offers no service guarantees to customers, and providers have no lever to steer customer demand to lightly loaded paths/times. To address these issues, we design and evaluate Pretium -- a framework that combines dynamic pricing with traffic engineering for inter-datacenter bandwidth. In Pretium, users specify their required rates or transfer sizes with deadlines, and a price module generates a price quote for different guarantees (promises) on these requests. The price quote is generated using internal prices (which can vary over time and links) which are maintained and periodically updated by Pretium based on history. A supplementary schedule adjustment module gears the agreed-upon network transfers towards an efficient operating point by optimizing time-varying operation costs. Experiments using traces from a large production WAN show that Pretium improves total system efficiency (value of routed transfers minus operation costs) by more than 3.5X relative to current usage-based pricing schemes, while increasing the provider profits by 2X.

Supplementary Material

MP4 File (p73.mp4)

Download
409.49 MB

References

[1]

Gurobi Optimization. http://www.gurobi.com/.

[2]

D. Applegate and E. Cohen. Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands. In ACM SIGCOMM, 2003.

Digital Library

[3]

K. J. Arrow and G. Debreu. Existence of an Equilibrium for a Competitive Economy. Econometrica: Journal of the Econometric Society, pages 265 – 290, 1954.

[4]

B. Awerbuch, Y. Azar, and A. Meyerson. Reducing Truth-telling Online Mechanisms to Online Optimization. In STOC, 2003.

Digital Library

[5]

M. Babaioff, S. Dughmi, R. Kleinberg, and A. Slivkins. Dynamic Pricing with Limited Supply. In EC, 2012.

Digital Library

[6]

M. F. Balcan, A. Blum, J. D. Hartline, and Y. Mansour. Reducing Mechanism Design to Algorithm Design via Machine Learning. J. of Computer and System Sciences, 74(8):1245 – 1270, 2008.

Digital Library

[7]

P. Bangera and S. Gorinsky. Economics of Traffic Attraction by Transit Providers. In Networking Conference, 2014 IFIP, pages 1–9, June 2014.

[8]

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In SODA, 2003.

Digital Library

[9]

C. Courcoubetis and R. Weber. Pricing Communication Networks: Economics, Technology and Modelling. Wiley Online Library, 2003.

Digital Library

[10]

E. Danna, A. Hassidim, H. Kaplan, A. Kumar, Y. Mansour, D. Raz, and M. Segalov. Upward Max Min Fairness. In INFOCOM, 2012.

[11]

E. Danna, S. Mandal, and A. Singh. A Practical Algorithm for Balancing the Max-Min Fairness and Throughput Objectives in Traffic Engineering. In INFOCOM, 2012.

[12]

N. R. Devanur and T. P. Hayes. The Adwords Problem: Online Keyword Matching with Budgeted Bidders Under Random Permutations. In EC, 2009.

Digital Library

[13]

J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based Mechanism for Lowest-cost Routing. Distributed Computing, 18(1):61–72, 2005.

Digital Library

[14]

B. Fortz and M. Thorup. Internet Traffic Engineering by Optimizing OSPF Weights in a Changing World. In INFOCOM, 2000.

[15]

P. B. Godfrey, M. Schapira, A. Zohar, and S. Shenker. Incentive Compatibility and Dynamics of Congestion Control. In ACM SIGMETRICS, 2010.

Digital Library

[16]

S. Ha, S. Sen, C. Joe-Wong, Y. Im, and M. Chiang. TUBE: Time-dependent Pricing for Mobile Data. In ACM SIGCOMM, 2012.

Digital Library

[17]

M. T. Hajiaghayi, R. Kleinberg, M. Mahdian, and D. C. Parkes. Online Auctions with Re-usable Goods. In EC, 2005.

Digital Library

[18]

C. Y. Hong et al. Achieving High Utilization with Software-Driven WAN. In ACM SIGCOMM, 2013.

Digital Library

[19]

J. Hsu, J. Morgenstern, R. M. Rogers, A. Roth, and R. Vohra. Do prices coordinate markets? CoRR, abs/1511.00925, 2015.

[20]

S. Jain et al. B4: Experience with a Globally-Deployed Software Defined WAN. In ACM SIGCOMM, 2013.

Digital Library

[21]

S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the Tightrope: Responsive Yet Stable Traffic Engineering. In ACM SIGCOMM, 2005.

Digital Library

[22]

S. Kandula, I. Menache, R. Schwartz, and S. R. Babbula. Calendaring for Wide Area Networks. In ACM SIGCOMM, 2014.

Digital Library

[23]

F. Kelly, A. Maulloo, and D. Tan. Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability. In Journal of the Operational Research Society, 1998.

[24]

N. Laoutaris, M. Sirivianos, X. Yang, and P. Rodriguez. Inter-datacenter Bulk Transfers with Netstitcher. In ACM SIGCOMM, 2011.

Digital Library

[25]

H. H. Liu et al. Traffic Engineering with Forward Fault Correction. In ACM SIGCOMM, 2014.

Digital Library

[26]

S. Low and D. Lapsley. Optimization Flow Control, I: Basic Algorithm and Convergence. In IEEE/ACM Transactions on Networking, Dec 1999.

Digital Library

[27]

R. T. B. Ma, D. M. Chiu, J. C. S. Lui, V. Misra, and D. Rubenstein. Internet Economics: The Use of Shapley Value for ISP Settlement. In IEEE/ACM Transactions on Networking, June 2010.

Digital Library

[28]

R. G. Michael and S. J. David. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H Freeman, 1979.

Digital Library

[29]

C. Raiciu et al. How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP. In NSDI, 2012.

Digital Library

[30]

S. Shenker, D. Clark, D. Estrin, and S. Herzog. Pricing in Computer Networks: Reshaping the Research Agenda. ACM SIGCOMM CCR, Apr. 1996.

Digital Library

[31]

V. Valancius, N. Feamster, R. Johari, and V. Vazirani. MINT: A Market for INternet Transit. In ACM CONEXT, 2008.

Digital Library

[32]

V. Valancius, C. Lumezanu, N. Feamster, R. Johari, and V. V. Vazirani. How Many Tiers?: Pricing in the Internet Transit Market. In ACM SIGCOMM, 2011.

Digital Library

[33]

H. Varian. Microeconomic Analysis. Norton International edition. W.W. Norton, 1992.

[34]

H. Zhang et al. Guaranteeing Deadlines for Inter-datacenter Transfers. In Eurosys, 2015.

Digital Library

[35]

L. Zhang, W. Wu, and D. Wang. The Effectiveness of Time Dependent Pricing in Controlling Usage Incentives in Wireless Data Network. In ACM SIGCOMM, 2013.

Digital Library

Cited By

Shiiba RKobayashi SAkashi OShirokura HFukuda K(2025)Verifying Network-level Properties for Large-scale Networks with Header Transformations in RealtimeJournal of Information Processing10.2197/ipsjjip.33.4133(41-54)Online publication date: 2025
https://doi.org/10.2197/ipsjjip.33.41
Dong XNie LLiu ZXiang Y(2025)Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local InformationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.350827536:2(197-211)Online publication date: Feb-2025
https://doi.org/10.1109/TPDS.2024.3508275
Li YMa XFu ZZhou AXu MWang S(2025)Rethinking Cost-Efficient VM Scheduling on Public Edge Platforms: A Service Provider’s PerspectiveIEEE Transactions on Mobile Computing10.1109/TMC.2024.348808224:3(1846-1858)Online publication date: Mar-2025
https://doi.org/10.1109/TMC.2024.3488082
Show More Cited By

Recommendations

Stable and efficient pricing for inter-domain traffic forwarding
SIGMETRICS '12: Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems

We address the question of strategic pricing of inter-domain traffic forwarding services provided by ISPs, which is also closely coupled with the question of how ISPs route their traffic towards their neighboring ISPs. Posing this question as a non-...
Inter-datacenter bulk transfers with netstitcher
SIGCOMM '11

Large datacenter operators with sites at multiple locations dimension their key resources according to the peak demand of the geographic area that each site covers. The demand of specific areas follows strong diurnal patterns with high peak to valley ...
Pricing for Revenue Maximization in Inter-DataCenter Networks
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
As more applications and businesses move to the cloud, pricing for inter-datacenter links has become an important problem. In this paper, we study revenue maximizing pricing from the perspective of a network provider in inter-datacenter networks. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '16: Proceedings of the 2016 ACM SIGCOMM Conference

August 2016

645 pages

ISBN:9781450341936

DOI:10.1145/2934872

General Chairs:
Marinho Barcellos
UFRGS
,
Jon Crowcroft
University of Cambridge
,
Program Chairs:
Amin Vahdat
Google
,
Sachin Katti
Stanford University

Copyright © 2016 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 the author(s) 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

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '16

Sponsor:

SIGCOMM

SIGCOMM '16: ACM SIGCOMM 2016 Conference

August 22 - 26, 2016

Florianopolis, Brazil

Acceptance Rates

SIGCOMM '16 Paper Acceptance Rate 39 of 231 submissions, 17%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
2,672
Total Downloads

Downloads (Last 12 months)153
Downloads (Last 6 weeks)26

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Shiiba RKobayashi SAkashi OShirokura HFukuda K(2025)Verifying Network-level Properties for Large-scale Networks with Header Transformations in RealtimeJournal of Information Processing10.2197/ipsjjip.33.4133(41-54)Online publication date: 2025
https://doi.org/10.2197/ipsjjip.33.41
Dong XNie LLiu ZXiang Y(2025)Slark: A Performance Robust Decentralized Inter-Datacenter Deadline-Aware Coflows Scheduling Framework With Local InformationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.350827536:2(197-211)Online publication date: Feb-2025
https://doi.org/10.1109/TPDS.2024.3508275
Li YMa XFu ZZhou AXu MWang S(2025)Rethinking Cost-Efficient VM Scheduling on Public Edge Platforms: A Service Provider’s PerspectiveIEEE Transactions on Mobile Computing10.1109/TMC.2024.348808224:3(1846-1858)Online publication date: Mar-2025
https://doi.org/10.1109/TMC.2024.3488082
Wang JZhao GXu HQiao CHuang H(2025)A cost-efficient traffic engineering framework with various pricing schemes in cloudsComputer Networks10.1016/j.comnet.2025.111090259(111090)Online publication date: Mar-2025
https://doi.org/10.1016/j.comnet.2025.111090
Namyar PArzani BBeckett RSegarra SRaj HKrishnaswamy UGovindan RKandula SVanbever LZhang I(2024)Finding adversarial inputs for heuristics using multi-level optimizationProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691877(927-949)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691877
Luan BXu ZLi JWu J(2024)Cost-Effective Dynamic Path Selection Method for Wide-Area Electricity Market2024 43rd Chinese Control Conference (CCC)10.23919/CCC63176.2024.10662853(1854-1859)Online publication date: 28-Jul-2024
https://doi.org/10.23919/CCC63176.2024.10662853
Alam QKolar VThottan M(2024)Towards AI/ML-Driven Network Traffic EngineeringProceedings of the 4th International Conference on AI-ML Systems10.1145/3703412.3703436(1-8)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3703412.3703436
Kataria BLNU PBothra RGandhi RBhattacherjee DPadmanabhan VAtov IRamakrishnan SChaturmohta SKotipalli CLiang RSueda KHe XHinton K(2024)Saving Private WAN: Using Internet Paths to Offload WAN Traffic in Conferencing ServicesProceedings of the ACM on Networking10.1145/36964042:CoNEXT4(1-22)Online publication date: 25-Nov-2024
https://dl.acm.org/doi/10.1145/3696404
Tian YLi ZLiu MMao JTyson GXie GVallina-Rodríguez NSuarez-Tángil GLevin DPelsser C(2024)Cost-Saving Streaming: Unlocking the Potential of Alternative Edge Node ResourcesProceedings of the 2024 ACM on Internet Measurement Conference10.1145/3646547.3689025(580-587)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3646547.3689025
Fatemipour BZhang ZSt-Hilaire M(2024)A Survey on Replica Transfer Optimization Schemes in Geographically Distributed Data CentersIEEE Transactions on Network and Service Management10.1109/TNSM.2024.343716521:6(6301-6317)Online publication date: Dec-2024
https://doi.org/10.1109/TNSM.2024.3437165
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Figures

Tables

Media

View Table of Conten