Design and management of Noncooperative Communication Networks Ariel Orda Dept. of Electrical Engineering Technion – Israel Institute of Technology.

Slides:



Advertisements
Similar presentations
All rights reserved © 2006, Alcatel Grid Standardization & ETSI (May 2006) B. Berde, Alcatel R & I.
Advertisements

Capacity Allocation in Networks Under Noncooperative Elastic Users Instructor: Ishai Menache Eliron Amir Winter 2006.
Cs/ee 143 Communication Networks Routing Misc Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech.
Price Of Anarchy: Routing
Network layer -- May Network layer Computer Networks.
Introduction to Network Mathematics (3) - Simple Games and applications Yuedong Xu 16/05/2012.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
Noam Nisan, Michael Schapira, Gregory Valiant, and Aviv Zohar.
Balázs Sziklai Selfish Routing in Non-cooperative Networks.
1 Algorithmic Game Theoretic Perspectives in Networking Dr. Liane Lewin-Eytan.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Achieving Network Optima Using Stackelberg Routing Strategies Yannis A. Korilis, Member, IEEE Aurel A. Lazar, Fellow, IEEE & Ariel Orda, Member IEEE IEEE/ACM.
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
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.
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
Autonomous Target Assignment: A Game Theoretical Formulation Gurdal Arslan & Jeff Shamma Mechanical and Aerospace Engineering UCLA AFOSR / MURI.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
Dept. of Computer Science & Engineering The Chinese University of Hong Kong 1 Interaction of Overlay Networks: Properties and Control Professor John C.S.
Worst-case Equilibria Elias Koutsoupias and Christos Papadimitriou Presenter: Yishay Mansour Tight Bounds for Worst-case Equilibria Artur Czumaj and Berthold.
Distributed Computing with Adaptive Heuristics Michael Schapira Princeton Innovations in Computer Science 09 January 2011 Partially supported by NSF Aaron.
11 Quantifying Benefits of Traffic Information Provision under Stochastic Demand and Capacity Conditions: A Multi-day Traffic Equilibrium Approach Mingxin.
1 Caching Game Dec. 9, 2003 Byung-Gon Chun, Marco Barreno.
On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.
Elliot Anshelevich Department of Computer Science Interests: Design and analysis of algorithms, especially for large decentralized networks. Strategic.
Transportation Logistics Professor Goodchild Spring 2011.
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
Network Routing Problem r Input: m network topology, link metrics, and traffic matrix r Output: m set of routes to carry traffic A B C D E S1S1 R1R1 R3R3.
1 Quantifying Trade-Offs in Networks and Auctions Tim Roughgarden Stanford University.
Transportation Logistics Professor Goodchild Spring 2009.
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees Dean H.Lorenz and Ariel Orda Department of Electrical Engineering Technion –
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Internet Infrastructure and Pricing. Internet Pipelines Technology of the internet enables ecommerce –Issues of congestion and peak-load pricing –Convergence.
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
1 Congestion Pricing and Queuing Theory Giovanni Andreatta and Guglielmo Lulli Dip. di Matematica Pura ed Applicata - Università di Padova.
Eran Hanany IDF general headquarters OR ( ) TAU Industrial Engineering dept. (2004-) Visited Northwestern U. (2 yrs), UBC (1 yrs) Main research.
Minimum-Delay Load-Balancing Through Non-Parametric Regression F. Larroca and J.-L. Rougier IFIP/TC6 Networking 2009 Aachen, Germany, May 2009.
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.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
Some network flow problems in urban road networks Michael Zhang Civil and Environmental Engineering University of California Davis.
Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists By Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern Presentation by Avner May 12/10/08.
The Effectiveness of Stackelberg strategies and Tolls for Network Congestion Games Chaitanya Swamy University of Waterloo.
Role of incentives in networks CS 653, Fall 2010.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Supernetworks: Paradoxes, Challenges, and New Opportunities Anna Nagurney John F. Smith Memorial Professor The Virtual Center for Supernetworks.
Investment and market structure in industries with congestion Ramesh Johari November 7, 2005 (Joint work with Gabriel Weintraub and Ben Van Roy)
Computing and Approximating Equilibria: How… …and What’s the Point? Yevgeniy Vorobeychik Sandia National Laboratories.
1 Intrinsic Robustness of the Price of Anarchy Tim Roughgarden Stanford University.
Benjamin Heydecker JD (Puff) Addison Centre for Transport Studies UCL Dynamic Modelling of Road Transport Networks.
Network Congestion Games
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
SUPPLY CHAIN MANAGEMENT SYSTEMS Part I. 7-2 LEARNING OUTCOMES 1.List and describe the components of a typical supply chain 2.Define the relationship between.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
Network teleology Damon Wischik
1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.
Lecture Network layer -- May Congestion control Algorithms.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Assignment. Where are we? There are four scopes 1. Logit 2. Assignment Today! 3. LUTI 4. Other models and appraisal.
CEE 320 Fall 2008 Route Choice CEE 320 Steve Muench.
Complex Systems in Industrial Mathematics Dr Robert Leese Smith Institute Bath Institute for Complex Systems 31 January 2005.
Prepared for 16th TRB National Transportation Planning Applications Conference Outline Gap Value in Simulation-Based Dynamic Traffic Assignment (DTA) Models:
Rutgers Intelligent Transportation Systems (RITS) Laboratory
Aspiration-based Learning
Numerical Studies on Braess-like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems By Said Fathy El-Zoghdy, Hisao Kameda, and.
Presentation transcript:

Design and management of Noncooperative Communication Networks Ariel Orda Dept. of Electrical Engineering Technion – Israel Institute of Technology

Ariel Orda, Dept. of EE, Technion2 Queuing systems (early work) [Leeman, 1964] It is a bit surprising that in a capitalist economy, applied queuing theory limits itself to recommendations of administrative measures for the reduction of queues. One might have expected to observe such an approach in a planned economy but not in an economy in which prices and markets play so large a role. [Kleinrock, 1967] Optimum Bribing for Queue Position [Naor, 1969] Queue imposes admission fee, customers join/balk. Individual decision deviates from socially preferred one. Implicit investigation of equilibrium behavior. [Adiri & Yechiali, 1974] Optimal Priority-Purchasing and Pricing Decisions in Queues

Ariel Orda, Dept. of EE, Technion3 Transportation networks (early work) Highly individualized Each driver makes their own route choices [Wardrop, 1952] Equilibrium principle: the journey time on all routes actually used are equal, and less than those … on any unused route. System Optimum principle: The average journey time is minimum. 1 st principle analogous to Nash ’ s Equilibrium [1950]: A flow pattern is a Nash equilibrium if no individual decision maker on the network can change to a less costly route. [Beckmann, McGuire, and Winsten, 1956] Existence and uniqueness of Wardrop (Nash) equilibrium through transformation [Dafermos and Sparrow, 1969,1971] Equilibration algorithms Tolls that guarantee that the user-optimized and system-optimized solutions coincide.

Ariel Orda, Dept. of EE, Technion4 Early motivation in communication networks System-wide optimization demands coordination/cooperation among components. Impractical in large-scale networks: Large size  prohibitive delays. Many components  lot of information. Variability/dynamics  frequent global changes. Heterogeneity of users  different goals. No single administration (internetworking).

Ariel Orda, Dept. of EE, Technion5 Early motivation in communication networks (cont.) Alternative Approach: Decentralized control decisions by network components (users). Each user optimizes its performance. Research methodology: Game Theory. Network operating points: Nash equilibria.

Ariel Orda, Dept. of EE, Technion6 More recent motivation in communication networks Deregulation and privatization  competitive behavior among telecom operators. Intelligence pushed to the edges of the network  possibility for intelligent yet selfish decisions. Ad hoc networks: “ hosts ” are also “ nodes/routers ”. Increased interest due to the Internet boom.

Ariel Orda, Dept. of EE, Technion7 “Architecting Noncooperative Networks” Motivation: Noncooperative equilibria are inefficient and lead to suboptimal network performance. Goal: Given the noncooperative character of network control, devise design and management rules, so that the overall network performance is improved.  Architect the operating points (Nash equilibria) so that they exhibit certain desirable properties. Methodology: Provisioning phase: network resource configuration. Run time phase: control part of the traffic, employ pricing mechanisms. a tility functions: just monotonic in the link flows. Parallel links: Nash equilibrium exists but is not unique. Dynamic convergence by best-reply moves from any initial profile. General-topology networks: Bottleneck-type cost functions: above results extended. Additive cost functions: Nash equilibrium need not exist.

Ariel Orda, Dept. of EE, Technion8 Motivation – the Braess Paradox The Braess Paradox [Braess, 1969]: Increasing capacity leads to performance degradation of all users. Observed in networks of various kinds: transportation networks [Dafermos & Nagurney, 1984] electrical circuits [Cohen & Horwitz, 1991] mechanical networks of strings and springs, hydraulic systems queuing networks (infinite population) [Cohen & Kelly, 1990] distributed computation systems [Glance & Hogg, 1995] telecommunication networks (finite population) [Korilis, Lazar & Orda, 1995; Cohen & Jeffries, 1997]

Ariel Orda, Dept. of EE, Technion9 The Braess Paradox (cont.)