Xiangtong Qi The Hong Kong University of Science and Technology

Slides:



Advertisements
Similar presentations
Secondary Market with Transmission Capacities ČEPS, a.s. 11/2006.
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 17 Auction-based.
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Truthful Spectrum Auction Design for Secondary Networks Yuefei Zhu ∗, Baochun Li ∗ and Zongpeng Li † ∗ Electrical and Computer Engineering, University.
Big Data + SDN SDN Abstractions. The Story Thus Far Different types of traffic in clusters Background Traffic – Bulk transfers – Control messages Active.
Wei Dong 1 Joint work with Swati Rallapalli 1, Rittwik Jana 2, Lili Qiu 1, K. K. Ramakrishnan 2, Leonid V. Razoumov 2, Yin Zhang 1, Tae Won Cho 2 1 The.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
Can Congestion Control and Traffic Engineering be at Odds? Jiayue He, Mung Chiang, Jennifer Rexford Princeton University November 30 th, 2006.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Virtual Layer 2: A Scalable and Flexible Data-Center Network Work with Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Parantap Lahiri,
Automatic Run-time Adaptation in Virtual Execution Environments Ananth I. Sundararaj Advisor: Peter A. Dinda Prescience Lab Department of Computer Science.
Traffic Engineering With Traditional IP Routing Protocols
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
Network Bandwidth Allocation (and Stability) In Three Acts.
Rethinking Traffic Management: Using Optimization Decomposition to Derive New Architectures Jennifer Rexford Princeton University Jiayue He, Ma’ayan Bresler,
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.
Path Protection in MPLS Networks Using Segment Based Approach.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Path selection Packet scheduling and multipath Sebastian Siikavirta and Antti aalto.
Efficiency Loss in a Network Resource Allocation Game Paper by: Ramesh Johari, John N. Tsitsiklis [ Informs] Presented by: Gayatree Ganu.
An Online Procurement Auction for Power Demand Response in Storage-Assisted Smart Grids Ruiting Zhou †, Zongpeng Li †, Chuan Wu ‡ † University of Calgary.
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
Auction Pricing of Network Access for North American Railways Steven Harrod University of Dayton ©2012.
Vic Liu Liang Xia Zu Qiang Speaker: Vic Liu China Mobile Network as a Service Architecture draft-liu-nvo3-naas-arch-01.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Algorithmic, Game-theoretic and Logical Foundations
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Software Defined Networking BY RAVI NAMBOORI. Overview  Origins of SDN.  What is SDN ?  Original Definition of SDN.  What = Why We need SDN ?  Conclusion.
SDN challenges Deployment challenges
Multi-layer software defined networking in GÉANT
Examples based on draft-cheng-supa-applicability-00.txt
Multipath TCP and the Resource Pooling Principle
Constraint-Based Routing
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
Chapter 15: Networking Services Design Optimization
Managing the performance of multiple radio Multihop ESS Mesh Networks.
TCP Congestion Control
CS 425 / ECE 428 Distributed Systems Fall 2017 Nov 16, 2017
Chapter 8 – Processor Scheduling
Algorithmic Game Theory and Internet Computing
On-Time Network On-chip
th IEEE International Conference on Sensing, Communication and Networking Online Incentive Mechanism for Mobile Crowdsourcing based on Two-tiered.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
ExaO: Software Defined Data Distribution for Exascale Sciences
Multi-hop Coflow Routing and Scheduling in Data Centers
L12. Network optimization
Operating systems Process scheduling.
CPU SCHEDULING.
Networked Real-Time Systems: Routing and Scheduling
Congestion Control (from Chapter 05)
SRPT Applied to Bandwidth Sharing Networks
Market Oriented Programming
Market Oriented Programming
Congestion Control Reasons:
7. Ford-Fulkerson Algorithm with multiple optimal solutions
Congestion Control (from Chapter 05)
A pre-alpha accounting architecture
Self-Managed Systems: an Architectural Challenge
Congestion Control (from Chapter 05)
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Towards Predictable Datacenter Networks
Presentation transcript:

Xiangtong Qi The Hong Kong University of Science and Technology Intent-based Network Resource Intelligent Reconfiguration: Mechanism Design Xiangtong Qi The Hong Kong University of Science and Technology

What is Intent? Examples of Intent “I want to set up a flow from A to B with a bandwidth of 400M” “I want add 100M bandwidth to my flow” “I want the utilization rate below 40% for all links” Intents may be described in terms of Network Resource, Constraints, Criteria, Instructions From ONOS project How to manage these intents?

An Abstract View of Intent Network Resources (Bandwidth, Service, IP Address, etc.) Intent Management System Network Operator Network Users Fact Resource never enough to satisfy all users Challenge High flexibility Gaming behavior Solution Mechanism for effective resource allocation Question Conflict resolution Effectiveness Fairness

Mechanism Design: A suit of integrated Solutions Network Operator Optimization Resource utilization System stability Fairness Individual service level Game Theory User 1 User 2 User 3

Example of Network Traffic Control Capacity = 100M for all links Intent 1 Setting up a flow of 100M from A to B C A B D Intent 2 Setting up a flow of 100M from C to D

Optimization for System Effectiveness B A C D Both intents are installed Total resource consumption is minimized Network load is balanced

Underlying the Optimization C A B D Time-varying multi-commodity network flow Automatically generating solutions Tailored-made optimization algorithms Demo Users’ intents: flow adjustment Operator’s intent: load balancing

If Intent 1 is submitted earlier, … C A B D Shortest Path for Intent 1, rejecting Intent 2? A longer path for Intent 1, waiting for Intent 2? C A B D

Game-Theoretic Analysis For fairness Priority-based solution Round-robin solution Market-oriented solution (pricing, bidding, auction) For effectiveness Ensuring truth telling Incentivizing traffic smoothing …

Mechanism for Intent Management Optimization Multiple objectives Forward looking Robust Automatic recovery Game theoretical analysis Effectiveness Fairness Truth telling Sustainability

Intent of My Talk: Objectives Thanks