The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.

Slides:



Advertisements
Similar presentations
Peering and Financial Settlements An overview of the financial basis of interconnection within the Internet.
Advertisements

A Shapley Value Perspective on Internet Economics Paris Networking Workshop 2009 Vishal Misra Department of Computer Science Columbia University Joint.
1 Strategic choice of financing systems in regulated and interconnected industries Anna BassaniniJerome Pouyet Rome & IDEICREST-LEI & CERAS-ENPC
Sharing the Cost of Multicast Transmissions J. Feigenbaum, C. Papadimitriou, S. Shenker Hong Zhang, CIS620, 4/24.
Employing Agent-based Models to study Interdomain Network Formation, Dynamics & Economics Aemen Lodhi (Georgia Tech) 1 Workshop on Internet Topology &
Internet Economics: the use of Shapley value for ISP settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
1/27 Evaluating Potential Routing Diversity for Internet Failure Recovery *Chengchen Hu, + Kai Chen, + Yan Chen, *Bin Liu *Tsinghua University, + Northwestern.
Analysis of peering strategy adoption by transit providers in the Internet Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia.
1 Interdomain Routing and Games Hagay Levin, Michael Schapira and Aviv Zohar The Hebrew University.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
1 Algorithmic Game Theoretic Perspectives in Networking Dr. Liane Lewin-Eytan.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
Interconnecting Eyeballs to Content: A Shapley Value Perspective on ISP Peering and Settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John.
Internet Economics: the use of Shapley value for ISP settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
1 Internet Path Inflation Xenofontas Dimitropoulos.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Distributed Algorithms for Secure Multipath Routing
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.
Traffic Engineering With Traditional IP Routing Protocols
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
Dept. of Computer Science & Engineering The Chinese University of Hong Kong 1 Interaction of Overlay Networks: Properties and Control Professor John C.S.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
On Cooperative Settlement Between Content, Transit and Eyeball ISPs Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Interdomain Routing as Social Choice Ronny R. Dakdouk, Semih Salihoglu, Hao Wang, Haiyong Xie, Yang Richard Yang Yale University IBC ’ 06.
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization Sam C.M. Lee, Joe W.J. Jiang, John C.S. Lui The Chinese University of Hong.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
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
University of Massachusetts, Amherst 1 On the Evaluation of AS Relationship Inferences Jianhong Xia and Lixin Gao Department of Electrical and Computer.
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Inter-domain Routing Outline Border Gateway Protocol.
Interconnection, Peering, and Settlements Geoff Huston.
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
Efficiency Loss in a Network Resource Allocation Game Paper by: Ramesh Johari, John N. Tsitsiklis [ Informs] Presented by: Gayatree Ganu.
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
NWEN 402 – Peering & Exchange T With material from Geoff Huston, Andy Linton & Valerie Schaeffer.
Policies for Peering and Internet Exchanges AFIX Technical Workshop Session 8.
A Value-based Framework for Internet Peering Agreements Amogh Dhamdhere (CAIDA) with Constantine Dovrolis (Georgia Tech) Pierre Francois.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
Economic Incentives in Information- Centric Networking: Implications for Protocol Design and Public Policy Group Members: Muhammad Kamran Siddique Adel.
0 HKIX Hong Kong Internet eXchange Cheng, Che-Hoo Computer Services Center The Chinese University of Hong Kong
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Price Differentiation in the Kelly Mechanism Richard Ma Advanced Digital Sciences Center, Illinois at Singapore School of Computing, National University.
Price Differentiation in the Kelly Mechanism Richard Ma School of Computing, National University of Singapore Advanced Digital Sciences Center, Illinois.
Network Economics and ISP Settlement Problems Tianbai Ma Department of Electrical Engineering Columbia University.
CS 447 Networks and Data Communication Department of Computer Science Southern Illinois University Edwardsville Fall, 2015 Dr. Hiroshi Fujinoki
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Analysis of peering strategy adoption by transit providers in the Internet Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia.
1 Merit Network: Connecting People and Organizations Since 1966 Business Continuity A Networking Perspective Bob Stovall Merit Annual Meeting June 22 &
Employing Agent-based Models to study Interdomain Network Formation, Dynamics & Economics Aemen Lodhi (Georgia Tech) 1 Workshop on Internet Topology &
Revenue Sharing among ISPs in Two-Sided Markets Yuan Wu, Hongseok Kim, Prashanth H. Hande, Muan Chiang, Danny H.K. Tsang Published at IEEE Infocom 2011.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
Internet Strucure Internet structure: network of networks Question: given millions of access ISPs, how to connect them together? access.
Caching Games between Content Providers and Internet Service Providers
ISP Settlement Problems: a New Angle via Network Economics
T Network Application Frameworks and XML Additional material: On networks Sasu Tarkoma.
The Internet: A System of Interconnected Autonomous Systems
Economic incentives for fair and efficient ISP settlements
Amogh Dhamdhere (CAIDA/UCSD) Constantine Dovrolis (Georgia Tech)
Fixing the Internet: Think Locally, Impact Globally
Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Presentation transcript:

The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University of Hong Kong Vishal Misra, Dan Rubenstein Columbia University

Outline ISP Practices and Associated Problems Profit Sharing and Shapley Value Shapley Mechanism and Incentive Properties Future work

What is an Internet Service Provider (ISP)? The Internet is composed of Autonomous Systems (ASes). An ISP is a business entity. –Might comprise multiple ASes. –Provide Internet access. –Objective: maximize profits. ISP

Eyeball ISPs –Provide Internet access to customers: –Place Large investment in infrastructure. –E.g. AT&T, Verizon … Content ISPs –Provide contents via the Internet. –Serve customers like: Transit ISPs –Tier 1 ISPs: global connectivity of the Internet. –Provide transit services for other ISPs. –Cover a large geographic area. Different classes of players

Service DifferentiationInformation Neutrality Net Neutrality Debate: Whether or not to provider Service Differentiation? Network Balkanization: De-peering between ISPs ISP Settlement Problems: a Macro Perspective How to appropriately share profits among ISP? Transit Eyeball Transit zero-dollar peering Content Providers

Three levels of decisions Interconnecting decision E Routing decisions R (via BGP) Bilateral financial settlements  Shortest Path Routing Hot-potato Routing Source Destination Peering relationship Customer/provider relationship Provider ISP Customer ISP Settlement  affects E, R provider charges, customer might want to save money Interconnection withdrawal Route change ISP Practices: a Micro Perspective

Consider a PC market with only one operating system provider and one micro-processor provider. Egalitarian profit sharing: How to share profit? -- the baseline case

Symmetry: two micro-processor providers obtain the same profit. Efficiency: summation of three companies’ profit equal V. Balanced Contribution: How to share profit? -- more players

The unique solution (Shapley value) that satisfies Efficiency Symmetry and Balanced Contribution: How to share profit? -- eyeball and content ISPs

Intuitions and explanations –The more of the same kind provide substitutions. –The less of a kind can obtain more leverage. Results and implications of ISP profit sharing Each ISP’s profit is –Inversely proportional to the number of ISPs of its type. –Proportional to the number of ISPs of the opposite type.

Recall: three levels of decisions Interconnecting decision E Routing decisions R Bilateral financial settlements  Peering relationship Customer/provider relationship Provider ISP Customer ISP Settlement  affects E, R The Shapley value settlements  (E,R)(E,R) $$$ $$  collects revenue from customers  redistributes profits to ISPs E, R follow from  A clean-slate multilateral settlement

Local decisions: E i,R i EiEi RiRi Given:   Objective: to maximize   i (E,R) Each ISP makes local interconnecting and routing decisions. Individual ISP’s selfish behavior

Assumptions: –Aggregate Profit = Total Revenue – Total Routing Cost. –Profits are distributed via the Shapley value solution. –Fixed interconnecting topology. –ISPs locally decide routes to maximize their profits. Theorem (Incentive for routing): Any ISP maximizes its profit by locally minimizing the global routing cost. –Implication: ISPs adapt to global min-cost routes. Corollary (Nash Equilibrium): Any global min cost routing decision is a Nash equilibrium for the set of all ISPs. –Implication: global min-cost routes are stable. Surprise: Selfish local behavior coincides with global optimal solution! Incentive results -- optimal routing

Incentive results -- interconnecting Assumptions: –Aggregate Profit = Total Revenue – Total Routing Cost. –Profits are distributed via the Shapley value solution. –For any topology, ISPs use global min-cost routes. –ISPs locally decide interconnections to maximize their profits. Theorem (Incentive for interconnecting): Both interconnecting ISPs have non-decreasing profits. –Implication: ISPs have incentive to interconnect. –Does not mean: All pairs of ISPs should be connected. Redundant links might not reduce routing costs. Sunk cost is not considered.

Summary Ideal profit-sharing solution – the Shapley value –Efficiency, Symmetry and Balanced Contribution. –Additivity, Strong Monotonicity, Dummy … –Close-form solution for eyeball/content ISPs. ISP incentives under the Shapley value solution –Incentive to use global optimal routes. –Incentive to interconnect.

Future Work and New Results Include Transit ISPs General Internet Topology Implications for Bilateral Agreements among ISPs