How Much? For What? Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley.

Slides:



Advertisements
Similar presentations
Market Enabling Network Architecture NSF FIND PI Meeting Arlington, VA June 27, 2007 John Musacchio Assistant Professor Technology and Information Management.
Advertisements

Network Economics -- Lecture 1: Pricing of communication services Patrick Loiseau EURECOM Fall 2012.
Packet Video TCP Video Streaming to Bandwidth-Limited Access Links Puneet Mehra and Avideh Zakhor Video and Image Processing Lab University of California,
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
1 Algorithmic Game Theoretic Perspectives in Networking Dr. Liane Lewin-Eytan.
Competitive Cyber-Insurance and Network Security Nikhil Shetty Galina Schwartz Mark Felegyhazi Jean Walrand EECS, UC-BerkeleyWEIS 2009 Presentation.
A SLA Framework for QoS Provisioning and Dynamic Capacity Allocation Rahul Garg (IBM India Research Lab), R. S. Randhawa (Stanford University), Huzur Saran.
Presented by Scott Kristjanson CMPT-820 Multimedia Systems Instructor: Dr. Mohamed Hefeeda 1 Cross-Layer Wireless Multimedia.
“ Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks ”
On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (
Competitive Cyber-Insurance and Network Security Nikhil Shetty Galina Schwartz Mark Felegyhazi Jean Walrand EECS, UC-BerkeleyTRUST 2009 Presentation.
Xavier León PhD defense
UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
EECS 122 Communications Networks Department of Electrical Engineering and Computer Sciences University of California Berkeley Slides: K. Fall, K. Lai,
Charge-Sensitive TCP and Rate Control Richard J. La Department of EECS UC Berkeley November 22, 1999.
Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
Service Differentiated Peer Selection An Incentive Mechanism for Peer-to-Peer Media Streaming Ahsan Habib, Member, IEEE, and John Chuang, Member, IEEE.
Pricing What Can Pricing Do In Wireless Networks? Jianning Mai and Lihua Yuan
UCB Implementing QoS Jean Walrand EECS. UCB Outline What? Bandwidth, Delay Where? End-to-End, Edge-to-Edge, Edge-to-End, Overlay Mechanisms Access Control.
Game Theory and Pricing of Internet Services Jean Walrand (with Linhai He & John Musacchio)
Future Research Directions Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Base Station Association Game in Multi-cell Wireless Network Libin Jiang, Shyam Parekh, Jean Walrand.
Issues in Pricing Internet Services Linhai He & Jean Walrand Dept of EECS, U.C. Berkeley March 8, 2004.
1 Auction or Tâtonnement – Finding Congestion Prices for Adaptive Applications Xin Wang Henning Schulzrinne Columbia University.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Algorithms, Games and the Internet Christos H. Papadimitriou UC Berkeley
A P2P file distribution system ——BitTorrent Fan Bin Sep,25,2004.
Network Neutrality 4/21/20111Harvard Bits. 4/21/2011Harvard Bits2.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley
Quality of Service for Flows in Ad-Hoc Networks SmartNets Research Group Dept of EECS, UC Berkeley NMS PI Meeting, Nov 2004.
UCB Communication Networks: Big Picture Jean Walrand U.C. Berkeley
Smart Networks Project University of California, Berkeley DARPA NMS PI Meeting Miami, Jan 21-23, 2004.
How Bad is Selfish Routing A survey on existing models for selfish routing Professor John Lui, David Yau and Dah-Ming Qiu presented by Joe W.J. Jiang
1 Models of Effort. 2 The Principal-Agent Problem Human Resource Management is a separate field of study today. But, we in economics have a take on the.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Smart Networks Project UC Berkeley / Cisco May 27, 2003.
SUSTAINABLE ENERGY REGULATION AND POLICY-MAKING FOR AFRICA Module 14 Energy Efficiency Module 14: DEMAND-SIDE MANAGEMENT.
Network Management and Internet Pricing S. Raghavan J. Bailey The Robert H. Smith School of Business University of Maryland.
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
Introduction to Economics. What is Economics? Economics is the study of how to allocate (spread/distribute) scarce resources among competing wants and.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Paris Metro Pricing for QoS in Wireless Networks An SAIC Company Ravi Jain, Tracy Mullen and Rob Hausman April 19, 2001
Lectures 4 & 5 September 13 & 18, 2012 The Market: How it Actually Works.
A P2P file distribution system ——BitTorrent Pegasus Team CMPE 208.
Pricing in Non-cooperative Dynamic Games Lillian Ratliff, Sam Coogan, Daniel Calderone 20 August 2012.
Future Internet Architecture Panel Discussion 2006 Broadnets Conference San Jose October 4, 2006 John Musacchio Assistant Professor Technology and Information.
Atanu Dey March 22 nd, 2012 Instituto Thomas Jefferson, Queretaro.
RAdio resource Management and Optimization 134 Sinchon-Dong, Seodaemun-Gu, Seoul, , Korea Phone :
Network Architecture: Design Philosophies IS250 Spring 2010 John Chuang
Integration of WiMAX and WiFi Optimal Pricing for Bandwidth Sharing Dusit Niyato and Ekram Hossain, TRLabs and University of Manitoba IEEE Communications.
Jean Walrand – NSF – April 24-25, 20031/5 Economic Mechanisms Grand Challenge: Design economic mechanisms that provide incentives for increasing the utility.
Networks and Games Christos H. Papadimitriou UC Berkeley christos.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
Consumer Behavior & Utility Maximization ECO 2023 Chapter 7 Fall 2007 Created by: M. Mari.
NC STATE UNIVERSITY / MCNC Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves  S. Felix Wu  Fengmin Gong DARPA.
Economic Way of Thinking By: Mr. Hinsvark Information from: AP Economics Teacher Resource Manual NCEE.
Probability in EECS Jean Walrand – EECS – UC Berkeley.
Theme 1: Introduction to markets and market failure
System Control based Renewable Energy Resources in Smart Grid Consumer
Theme 1: Introduction to markets and market failure
Christos H. Papadimitriou UC Berkeley
Communication Networks
Communication Networks
Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Presentation transcript:

How Much? For What? Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley

Collaborators Venkat Anantharam (UCB) Linhai He (BCG) Rahul Jain (IBM) John Musacchio (UCSD) Shyam Parekh (Lucent) Galina Schwartz (UCB) Pravin Varaiya (UCB)

Theme Importance of Economic considerations in the design and operations of networks PHY LINK IP TCP/UDP HTTP, RTP, ….

Choices Utilities Alice615 Bob810 Ted1613

Model of behavior: Choices  Utility Agents are rational:  they maximize their utility

Rational?

Why?

Utility of user 1 for activity level x 1 Disutility due to congestion Network effect: Utility of one user depends on the choices of other users, through congestion. Example: n users sharing a network

Slope = 1 Selfish Social planner Slope = n Selfish users over-consume. They neglect their impact on others, and they all hurt each other! Selfish users over-consume. They neglect their impact on others, and they all hurt each other!

“Freedom in a commons brings ruin to all.” [Hardin, 1968] “Freedom in a commons brings ruin to all.” [Hardin, 1968] Tragedy of the Commons

What to do? Access control (ramp metering, …)  May stop wrong users  Pricing  “Price of Anarchy” Selfish behavior hurts all

Pricing may improve the net utility of all the users by reducing over- consumption and, consequently, congestion. Suitable price depends on n  congestion pricing Pricing may improve the net utility of all the users by reducing over- consumption and, consequently, congestion. Suitable price depends on n  congestion pricing Slope = 1 + p Pricing Social planner Selfish

QoS by Pricing Cheap, but crowded First class, comfort because of price

Free Wi-Fi 1 st Class Wi-Fi

URGENT REAL TIME BEST EFFORT H Priority M L Example: Pricing Class 10kByte/s 400 minutes/month 1kByte/s 2000 minutes/month Why?  Users will like it  Increases revenues

 Pricing is a good idea: Differentiates services Increases the net utility of users Increases provider’s revenues

How to price? p1p1 p2p2 A B H L Two users Alice & Bob Two classes H & L

How to price? P1P1 p2p2 A B H L HL H L B A p 1 = 4, p 2 = 1 14 – 4 = 10 Alice’s utility of low delay = 14

How to price? P1P1 p2p2 A B H L HL H L B A p 1 = 4, p 2 = 1 14 – 4 = 10 5 – 1 = 4 Alice’s utility of long delay = 5

How to price? P1P1 p2p2 A B H L HL H L B A 9 – 4 = 5 p 1 = 4, p 2 = 1 14 – 4 = 10 5 – 1 = 4 9 – 1 = 8 Alice’s utility of medium delay = 9

How to price? P1P1 p2p2 A B H L HL H L B A 9 – 4 = 5 p 1 = 4, p 2 = 1 14 – 4 = 10 5 – 1 = 4 9 – 1 = 8 9 – 4 = 5 5 – 1 = 4 14 – 4 = 10 9 – 1 = 8

How to price? P1P1 p2p2 A B H L HL H L B A 5 p 1 = 4, p 2 = Alice’s choices:

How to price? P1P1 p2p2 A B H L HL H L B A 5 p 1 = 4, p 2 = Bob’s choices:

How to price? P1P1 p2p2 A B H L HL H L B A p 1 = 4, p 2 = Resulting choices: 5 5 Prisoner's Dilemma

 Pricing is a good idea, but prices must be well designed

Revenue Allocation

Incentives for - good service - network upgrades - competition

Revenue Allocation Bad incentives: Each provider chooses its price  may gain by being bottleneck

Revenue Allocation Better scheme: Agree on sharing Optimize total price

 Pricing improves network Controls congestion Improves users’ utility Increases revenues But, prices must be well designed  Revenue allocation Among network and content providers If poorly planned  perverse effects

When to upgrade network? Freerider effect  May postpone upgrade Suitable revenue allocations prevent this effect

Conclusions Network Devices “Physics” Measure  Algorithms  Control Users “Economics” Choice Prices Utility Essential, but less developed!

Conclusions Agents make choices based on utility Suitable pricing improves network Appropriate revenue allocation mechanism is critical Economic issues are an essential part of the network design: Protocol mechanisms for  Providing choice  Pricing/Billing  Revenue allocation

Thank you!