CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer.

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
Using Edge-To-Edge Feedback Control to Make Assured Service More Assured in DiffServ Networks K.R.R.Kumar, A.L.Ananda, Lillykutty Jacob Centre for Internet.
Two-Market Inter-domain Bandwidth Contracting
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Quality of Service Issues in Multi-Service Wireless Internet Links George Xylomenos and George C. Polyzos Department of Informatics Athens University of.
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #11 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
Source-Adaptive Multilayered Multicast Algorithms for Real- Time Video Distribution Brett J. Vickers, Celio Albuquerque, and Tatsuya Suda IEEE/ACM Transactions.
High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Congestion Pricing Overlaid on Edge-to-Edge Congestion Control Murat Yuksel, Shivkumar Kalyanaraman and Anuj Goel Rensselaer Polytechnic Institute, Troy,
Pricing Granularity for Congestion-Sensitive Pricing Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem, shivkuma}
Generalized Processing Sharing (GPS) Is work conserving Is a fluid model Service Guarantee –GPS discipline can provide an end-to-end bounded- delay service.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
CS 268: Differentiated Services Ion Stoica February 25, 2003.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
1 Auction or Tâtonnement – Finding Congestion Prices for Adaptive Applications Xin Wang Henning Schulzrinne Columbia University.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
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,
Streaming Video Gabriel Nell UC Berkeley. Outline Scalable MPEG-4 video – Layered coding method – Integrated transport-decoder buffer model RAP streaming.
Price Discovery at Network Edges G. S. Arora, M. Yuksel, S. Kalyanaraman, T. Ravichandran and A. Gupta Rensselaer Polytechnic Institute, Troy, NY.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
CS 268: Lecture 11 (Differentiated Services) Ion Stoica March 6, 2001.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
Internet Infrastructure and Pricing. Internet Pipelines Technology of the internet enables ecommerce –Issues of congestion and peak-load pricing –Convergence.
IEEE Global Internet, April Contract-Switching Paradigm for Internet Value Flows and Risk Management Murat Yuksel University.
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
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.
Wolfgang EffelsbergUniversity of Mannheim1 Differentiated Services for the Internet Wolfgang Effelsberg University of Mannheim September 2001.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 A TCP Friendly Traffic Marker for IP Differentiated Services Feroz Azeem, Shiv Kalyanaraman,
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”
Florida State UniversityZhenhai Duan1 BCSQ: Bin-based Core Stateless Queueing for Scalable Support of Guaranteed Services Zhenhai Duan Karthik Parsha Department.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
Differentiated Services IntServ is too complex –More focus on services than deployment –Functionality similar to ATM, but at the IP layer –Per flow QoS.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Queue Scheduling Disciplines
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Providing QoS in IP Networks
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
Achievable Service Differentiation with Token Bucket Marking for TCP S. Sahu, D.Towsley University of Massachusetts P. Nain INRIA C. Diot Sprint Labs V.
Instructor Materials Chapter 6: Quality of Service
Corelite Architecture: Achieving Rated Weight Fairness
Internet Economics perspective on Accounting & Billing
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Columbia University in the city of New York
Elasticity Considerations for Optimal Pricing of Networks
Advanced Computer Networks
EE 122: Lecture 18 (Differentiated Services)
EE 122: Differentiated Services
Presentation transcript:

CNDS 2001, Phoenix, AZ Simulating the Smart Market Pricing Scheme on Differentiated- Services Architecture Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY

CNDS 2001, Phoenix, AZ Outline Literature development : –Internet pricing –congestion-sensitive pricing –the smart market pricing scheme Issues on deploying the smart market on diff-serv Adaptation of the smart market to diff-serv Packet-based simulation of the smart market Simulation experiments Summary and future work

CNDS 2001, Phoenix, AZ Three Basic Pricing Strategies Flat-rate pricing: –fixed price for a time period, F where F>0 Usage-based pricing: –plus fixed price for unit amount of traffic, F+T where F>=0 and T>0 Congestion-sensitive pricing: –plus varying price based upon congestion level of the network, F+T+C where F>=0, T>=0 and C>=0

CNDS 2001, Phoenix, AZ Congestion-Sensitive Pricing A way of controlling user’s traffic demand and hence, a way of controlling network congestion Better resource (bandwidth) allocation Fairness The only possible way of achieving network and economic efficiency simultaneously Level of congestion-sensitivity: The more opportunity for price variations, the more opportunity for employing congestion-sensitivity on the price. Problems: –Users don’t like price fluctuations! –Each price change must be fed back to the user before it could be applied, i.e. hard to implement in a wide area network.

CNDS 2001, Phoenix, AZ The Smart Market Proposed by MacKie-Mason and Varian in 1993 as a possible congestion-sensitive pricing scheme for the Internet. Imposes a price-per-packet that reflects incremental congestion costs. Users make auction by assigning a “bid” value to each packet before sending into the network. The routers maintain a threshold (cutoff) value and pass only the packets with enough bid value. They give priority to the packets with higher bid! The cutoff values changes dynamically according to the level of congestion at that router. The price for each packet is the highest cutoff value it passed through, i.e. market-clearing price.

CNDS 2001, Phoenix, AZ The Smart Market (cont’d) Why is the smart market important? –The first congestion-sensitive pricing scheme –Designed for the smallest granularity level (i.e. packet or even possibly bits) and hence, represents the highest possible congestion-sensitivity for a network –Ideal scheme from an economic perspective because of its pure congestion-sensitivity FOCUS: –To what extent the smart market is deployable, especially on diff- serv architecture? –How to adapt it to diff-serv? –Can we develop a packet-based simulation of the smart market?

CNDS 2001, Phoenix, AZ Deployment on Diff-Serv? What is diff-serv? –A standard architecture for the Internet: complex operations at network edges (i.e. edge routers (ERs)) simple operations in network core (i.e. interior routers (IRs)) Expected to be choice of ISPs and bandwidth providers Protocols for Service Level Agreement (SLA) are already available Possible to make congestion-based pricing at the edges

CNDS 2001, Phoenix, AZ Deployment on Diff-Serv? (cont’d) Too much theoretically defined. Assumes immediate communication of the clearing-price, that is impossible in a wide area network. No guaranteed service because packets can be dropped based upon their bids. Packet reordering at the core is required. Bidding can be done at the edges, but clearing has to be done in the core. Sensitivity and compatibility of parameters in the formulas.

CNDS 2001, Phoenix, AZ Adaptation to Diff-Serv For data plane packets: –ERs: write the bid value (b) to the packet header and then send the packet into the core –IRs: maintain a priority queue, sorted according to packets’ bids if b<T, drop the packet if b>=T, update the packet’s clearing-price field and forward it For control plane packets: –ERs and IRs maintain a time interval (τ) which is greater than round-trip time (RTT) to operate. –Hence, the customers are fed back with the current price and their account information at every τ.

CNDS 2001, Phoenix, AZ Adaptation to Diff-Serv (cont’d) –ERs and customers: Ingress ER sends a “probe” packet to the network core at every τ to find out the current clearing-price of the network. Egress ER responds to the probe packet by a “feedback” packet that includes current clearing-price and bill to the customer. set the bids of control packets to the maximum bid value (limitation-- bids must be bound to a range) Ingress ER informs the customer about his bill and the current clearing-price. Customers adjust their bids and traffic based upon the bill, the clearing-price, and his budget. –IRs: update the threshold (T) value at every τ update control packets’ clearing-price field too

CNDS 2001, Phoenix, AZ Packet-Based Simulation Issues: –What must be the customer model? –How to set the cutoff value (T) at IRs? –How to handle parameter sensitivity and compatibility?

CNDS 2001, Phoenix, AZ Customer Model Smart market says that each customer should maximize {u(x) - D(Y) - px} or {u(x,D) - px} with respect to x, where –x is the number of packets to send –u() is the utility of the customer –Y is the utilization of the network –D is the delay experienced by the customer –p is the current clearing-price of a packet for the network Smart market also says that the value of x for maximization can be found by equating the clearing-price to marginal utility, i.e. p = ∂u(x,D) / ∂x

CNDS 2001, Phoenix, AZ Customer Model (cont’d) So, what is an accurate utility function for the customer? –model for the indifference curves between x and D: x = (aD + b)^2, where a and b are constants –utility function: u(x,D) = x^(1/2) – aD –p = u’(x,D) = 1 / 2x^(1/2) –x = 1 / 4p^2  number of packets to send in the next interval! If customer’s budget is not enough for that value of x, then she/he lowers it to x = Budget / p.

CNDS 2001, Phoenix, AZ Cutoff Value, T Smart market says that the Irs should adjust the cutoff value such that T = n/K * D’(Y), where n is the number of customers and K is the capacity of the network. We assumed n/K to be constant for simplicity. IRs update T by calculating D’(Y) at the end of each interval, τ. IRs maps T values to [0,1], and hence loose accuracy… Steady state cutoff value, T, for different customer budgets

CNDS 2001, Phoenix, AZ Simulation Experiments Customers send CBR UDP traffic through their corresponding ERs. Packet size is 1000bytes. Bottleneck capacity is 1Mbps and propagation delay is 10ms. All other links are with 100Mbps capacity and 1ms of propagation delay. RTT is 24ms. The time interval τ is 0.4s = 400ms. Configuration of the experimental network

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Network efficiency: –bottleneck queue length –bottleneck utilization –packet drop rate Economic efficiency: –volume (rate) allocations to customers –steady-state cutoff value List of the experiments

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Bottleneck utilization and cutoff in Experiment 1.

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Bottleneck queue length in Experiment 1

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Bottleneck utilization and cutoff in Experiment 4

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Bottleneck queue length in Experiment 4

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Volume allocations to customers Experiment 1

CNDS 2001, Phoenix, AZ Simulation Experiments (cont’d) Volume allocations to customers Experiment 4

CNDS 2001, Phoenix, AZ Summary We proposed some major changes to implement the smart market on diff-serv with UDP flows. We developed a simulator for the smart market comparable to simulators of possible new pricing schemes for the Internet. We observed that: –the smart market meets all economic efficiency goals by pricing the bandwidth accurately and allocating the bottleneck volume to the customers proportional to their budgets. –but it fails to fully meet network efficiency goals, because it cannot utilize the bottleneck very well, although it is able to control congestion with low bottleneck queue length and drop rate.

CNDS 2001, Phoenix, AZ Future Work a thorough investigation of difficulties in implementing the smart market on TCP flows consideration of multiple diff-serv domain case the smart market’s behavior on bursty traffic patterns