Pricing Granularity for Congestion-Sensitive Pricing Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem, shivkuma}

Slides:



Advertisements
Similar presentations
Balaji Prabhakar Active queue management and bandwidth partitioning algorithms Balaji Prabhakar Departments of EE and CS Stanford University
Advertisements

Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
FIND PI Meeting, November Value Flows and Risk Management Architecture for Future Internet Murat Yuksel University of Nevada.
FIND PI Meeting, April Contract-Switching: Value Flows in Inter-Domain Routing Murat Yuksel University of Nevada – Reno Reno, NV Aparna Gupta, Koushik.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
Quantifying Overprovisioning vs. Class-of-Service: Informing the Net Neutrality Debate Murat Yuksel (University of Nevada – Reno) K.
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer.
1 Value of Supporting Class-of- Service in IP Backbones Murat Yuksel (University of Nevada – Reno) K. K. Ramakrishnan (AT&T Labs Research)
1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: Prob/Stat Shiv Kalyanaraman:
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
Jayasri Akella Error Analysis of Multi-Hop Free-Space Optical Communication Jayasri Akella, Murat Yuksel, Shiv Kalyanaraman Department of Electrical, Computer.
An Implementation Framework for Trajectory-Based Routing in Ad Hoc Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer,
Congestion Pricing Overlaid on Edge-to-Edge Congestion Control Murat Yuksel, Shivkumar Kalyanaraman and Anuj Goel Rensselaer Polytechnic Institute, Troy,
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Measuring Queuing and System Delay Using Click Modular Router By Caroline Williams.
Variance Reduction Techniques
1 TCOM 501: Networking Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yannis A. Korilis.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4670: Computer Communications Netwoks Exam 2: Solutions Time: 75 min (strictly enforced)
A Strategy for Implementing Smart Market Pricing Scheme on Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
Price Discovery at Network Edges G. S. Arora, M. Yuksel, S. Kalyanaraman, T. Ravichandran and A. Gupta Rensselaer Polytechnic Institute, Troy, NY.
Trajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer, and Systems.
Elasticity Considerations for Optimal Pricing of Networks Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem, shivkuma}
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Dynamic Process Allocation in Apache Server Yu Cai.
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 TCP (Part II) Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
Not All Microseconds are Equal: Fine-Grained Per-Flow Measurements with Reference Latency Interpolation Myungjin Lee †, Nick Duffield‡, Ramana Rao Kompella†
IEEE Global Internet, April Contract-Switching Paradigm for Internet Value Flows and Risk Management Murat Yuksel University.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Particle Filtering in Network Tomography
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 A TCP Friendly Traffic Marker for IP Differentiated Services Feroz Azeem, Shiv Kalyanaraman,
Huirong Fu and Edward W. Knightly Rice Networks Group Aggregation and Scalable QoS: A Performance Study.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
1 A paper by Yi-Bing Lin IEEE Transactions on Mobile Computing Vol. 4, No. 2, March/April ’05 Presented by Derek Pennington Per-User Checkpointing For.
Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.
Simulation & Confidence Intervals COMP5416 Advanced Network Technologies.
1 OUTPUT ANALYSIS FOR SIMULATIONS. 2 Introduction Analysis of One System Terminating vs. Steady-State Simulations Analysis of Terminating Simulations.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Review Session Jehan-François Pâris. Agenda Statistical Analysis of Outputs Operational Analysis Case Studies Linear Regression.
Generalized Multicast Congestion Control (GMCC) Jiang Li, Shiv Kalyanaraman Rensselaer Polytechnic Institute Troy, NY, USA Jiang is now with Howard University.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1-1 Source-Based Multicast Congestion Control P. Thapliyal, Sidhartha, S.Kalyanaraman Rensselaer.
Delay-based Congestion Control for Multipath TCP Yu Cao, Mingwei Xu, Xiaoming Fu Tsinghua University University of Goettingen.
Corelite Architecture: Achieving Rated Weight Fairness
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman
Elasticity Considerations for Optimal Pricing of Networks
Uncooperative Flow Control
Presentation transcript:

Pricing Granularity for Congestion-Sensitive Pricing Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem,

Outline Congestion-sensitive pricing: “pricing interval” defined… Implementation issues Dynamics of congestion pricing Analytical models Discussion of analytical models Simulation experiments Summary

Congestion-Sensitive Pricing What is congestion pricing?: Increase the price when congestion, decrease when no congestion. A way of controlling user’s traffic demand and hence, a way of controlling network congestion Since congestion is dynamically variant, it is necessary to update the price at some time-scale, what we call “pricing interval”. So, length of pricing interval (i.e. pricing granularity) is a key implementation issue for congestion pricing..

Implementation Issues Users do not like price fluctuations: Users want “larger” pricing intervals for convenience… Congestion control is better with more frequent price updates: Providers need “smaller” pricing intervals for better control of congestion. Users want prior (or apriori) pricing: Provider has to undertake overhead of communicating the new price before it is applied. This overhead is more practical for “larger” pricing intervals. So, what is the best value for pricing intervals in order to keep it as large as possible while maintaining a reasonable control of congestion?

Dynamics of Congestion Pricing Provider employs pricing interval T. Provider observes the congestion level c, and advertises a price p. What is the steady-state dynamics? That is, how do p and c behave relative to each other?

Dynamics of Congestion Pricing (cont’d) Congestion measure c vs. congestion-sensitive price p T 1 > T 2   c 1 >  c 2,  p 1 >  p 2 There is an optimum price p* If p and c are more correlated, then apparently control is finer.. So, correlation between p and c should represent level of control over congestion!!

Analytical Models Let: T be the length of pricing intervals r be the # of observations in a pricing interval t be the length of observation intervals, i.e. T=rt c ij be the queue length at the end of j th observation interval of i th pricing interval. m ij and k ij be the # of arrivals and # of departures in j th observation interval of i th pricing interval.

Analytical Models (cont’d) Assume that: the customer has a fixed budget and generates traffic according to a continuous time stationary counting process, A(  ).  >= 0, with first and second moments of 1 and 2 respectively.. The packets leave the network according to a continuous time stationary counting process, B(  ),  >= 0, with first and second moments of  1 and  2 respectively.. packet drops in the network core are negligible. Congestion pricing algorithm calculates the price in i th pricing interval by p i = a(t,r) c (i-1)r

Analytical Models (cont’d) Conditioned correlation between p and c in n pricing intervals: We first write c ij and p i in terms of m ij and k ij. Then, we write each of the conditioned expectations above in terms of m ij and k ij. To get the final model, we need to relax the condition on m and k:

Analytical Models (cont’d) This relaxation is complicated!! Model-I: Assume B(  ) is independent from A(  ). Model-II: Consider the system as M/M/1, i.e. B(  ) and A(  ) are Poisson. We did find a closed form expression, but it is too long.. It is available as a Maple file.

Model Discussion The correlation degrades at most inversely proportional to an increase in T. Increase in traffic variances degrades the correlation. Increase in mean of incoming traffic degrades correlation.

Experiments We used Dynamic Capacity Contracting (DCC) as the congestion pricing scheme. It uses short-term contracts which corresponds to the pricing interval in our model. 5 customers using a 1Mb/s bottleneck link. We took the bottleneck queue as the congestion measure c, and the price advertised to the customers as p. The observation interval is 80ms, i.e. the bottleneck queue is sampled at every 80ms.

Experiments (cont’d) Control on congestion degrades less than linearly..

Experiments (cont’d) Control on congestion degrades when mean of incoming traffic increases!!

Experiments (cont’d) Control on congestion degrades when traffic variance increases..

Experiments (cont’d) Control on congestion vanishes at around 10r, i.e. 40RTTs in our experiment or 2-3secs in general..

Summary Length of pricing intervals is a key issue for deployment of congestion pricing. Correlation between p and c represents level of control achieved over congestion by pricing. We developed two approximate models for the correlation between p and c, and validated by simulation experiments. We observed that: the correlation is effected by various statistics about the incoming or outgoing traffic. the correlation vanishes when the pricing interval is about 40 RTT.

Questions, Ideas? THANK YOU!