Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers

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.

[1]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[2]  Sergey Gorinsky,et al.  Economics of traffic attraction by transit providers , 2014, 2014 IFIP Networking Conference.

[3]  Deborah Estrin,et al.  Pricing in Computer Networks: Reshaping the Research Agenda , 2020, The Internet and Telecommunications Policy.

[4]  Sangtae Ha,et al.  TUBE: time-dependent pricing for mobile data , 2012, SIGCOMM '12.

[5]  Brighten Godfrey,et al.  Incentive compatibility and dynamics of congestion control , 2010, SIGMETRICS '10.

[6]  H. Varian.  Microeconomic analysis : answers to exercises , 1992 .

[7]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[8]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[9]  Vishal Misra,et al.  Internet Economics: The Use of Shapley Value for ISP Settlement , 2007, IEEE/ACM Transactions on Networking.

[10]  Yossi Azar,et al.  Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.

[11]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[12]  Costas Courcoubetis,et al.  Pricing communication networks - economics, technology and modelling , 2003, Wiley-Interscience series in systems and optimization.

[13]  Mohammad Taghi Hajiaghayi,et al.  Online auctions with re-usable goods , 2005, EC '05.

[14]  Moshe Babaioff,et al.  Dynamic Pricing with Limited Supply , 2011, ACM Trans. Economics and Comput..

[15]  S. Shenker,et al.  Pricing in computer networks: reshaping the research agenda , 1996, CCRV.

[16]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[17]  Arjun Singh,et al.  A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Costas Courcoubetis,et al.  Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization) , 2003 .

[19]  Ming Zhang,et al.  Guaranteeing deadlines for inter-datacenter transfers , 2015, EuroSys.

[20]  K. Arrow,et al.  EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .

[21]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Srikanth Kandula,et al.  Calendaring for wide area networks , 2015, SIGCOMM 2015.

[24]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[25]  Nick Feamster,et al.  How many tiers?: pricing in the internet transit market , 2011, SIGCOMM.

[26]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[27]  Mark Handley,et al.  How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP , 2012, NSDI.

[28]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[29]  Vijay Kumar,et al.  Online learning in online auctions , 2003, SODA '03.

[30]  Michael Sirivianos,et al.  Inter-datacenter bulk transfers with netstitcher , 2011, SIGCOMM.

[31]  Maria-Florina Balcan,et al.  Reducing mechanism design to algorithm design via machine learning , 2007, J. Comput. Syst. Sci..

[32]  Nick Feamster,et al.  MINT: a Market for INternet Transit , 2008, CoNEXT '08.

[33]  Justin Hsu,et al.  Do prices coordinate markets? , 2015, SECO.

[34]  Haim Kaplan,et al.  Upward Max Min Fairness , 2012, 2012 Proceedings IEEE INFOCOM.

[35]  Dan Wang,et al.  The effectiveness of time dependent pricing in controlling usage incentives in wireless data network , 2013, SIGCOMM.

[36]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[37]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[38]  Srikanth Kandula,et al.  Traffic engineering with forward fault correction , 2014, SIGCOMM.