Achieving Stability in a Network of IQ Switches Neha Kumar Shubha U. Nabar.

Slides:



Advertisements
Similar presentations
1 Scheduling Crossbar Switches Who do we chose to traverse the switch in the next time slot? N N 11.
Advertisements

Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
Resource Allocation in Wireless Networks: Dynamics and Complexity R. Srikant Department of ECE and CSL University of Illinois at Urbana-Champaign.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
Modeling the Interactions of Congestion Control and Switch Scheduling Alex Shpiner Joint work with Isaac Keslassy Faculty of Electrical Engineering Faculty.
Nick McKeown CS244 Lecture 6 Packet Switches. What you said The very premise of the paper was a bit of an eye- opener for me, for previously I had never.
Towards Simple, High-performance Input-Queued Switch Schedulers Devavrat Shah Stanford University Berkeley, Dec 5 Joint work with Paolo Giaccone and Balaji.
Algorithm Orals Algorithm Qualifying Examination Orals Achieving 100% Throughput in IQ/CIOQ Switches using Maximum Size and Maximal Matching Algorithms.
Scheduling CS 215 W Keshav Chpt 9 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
Fast Matching Algorithms for Repetitive Optimization Sanjay Shakkottai, UT Austin Joint work with Supratim Deb (Bell Labs) and Devavrat Shah (MIT)
1 Input Queued Switches: Cell Switching vs. Packet Switching Abtin Keshavarzian Joint work with Yashar Ganjali, Devavrat Shah Stanford University.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion MSM.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion The.
Scheduling for maximizing throughput EECS, UC Berkeley Presented by Antonis Dimakis
CISS Princeton, March Optimization via Communication Networks Matthew Andrews Alcatel-Lucent Bell Labs.
1 EE384Y: Packet Switch Architectures Part II Load-balanced Switches Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
Scheduling in Delay Graphs with Applications to Optical Networks Isaac Keslassy (Stanford University), Murali Kodialam, T.V. Lakshman, Dimitri Stiliadis.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
COMP680E by M. Hamdi 1 Course Exam: Review April 17 (in-Class)
1 Achieving 100% throughput Where we are in the course… 1. Switch model 2. Uniform traffic  Technique: Uniform schedule (easy) 3. Non-uniform traffic,
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
Online Packet Switching Techniques and algorithms Yossi Azar Tel Aviv University.
Stability and Fairness of Service Networks Jean Walrand – U.C. Berkeley Joint work with A. Dimakis, R. Gupta, and J. Musacchio.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Scheduling.
Distributed Scheduling Algorithms for Switching Systems Shunyuan Ye, Yanming Shen, Shivendra Panwar
1 Scheduling Crossbar Switches Who do we chose to traverse the switch in the next time slot? N N 11.
Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York, Stony Brook.
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
September 27, Instabilities and Oscillations in Networks of Queues Matthew Andrews Bell Labs Joint work with Alex Slivkins (Cornell)
High Speed Stable Packet Switches Shivendra S. Panwar Joint work with: Yihan Li, Yanming Shen and H. Jonathan Chao New York State Center for Advanced Technology.
Engineering Jon Turner Computer Science & Engineering Washington University Coarse-Grained Scheduling for Multistage Interconnects.
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
March 29 Scheduling ?. What is Packet Scheduling? Decide when and what packet to send on output link 1 2 Scheduler flow 1 flow 2 flow n Buffer management.
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”
Abtin Keshavarzian Yashar Ganjali Department of Electrical Engineering Stanford University June 5, 2002 Cell Switching vs. Packet Switching EE384Y: Packet.
Stress Resistant Scheduling Algorithms for CIOQ Switches Prashanth Pappu Applied Research Laboratory Washington University in St Louis “Stress Resistant.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Guaranteed Smooth Scheduling in Packet Switches Isaac Keslassy (Stanford University), Murali Kodialam, T.V. Lakshman, Dimitri Stiliadis (Bell-Labs)
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
Packet Scheduling: SCFQ, STFQ, WF2Q Yongho Seok Contents Review: GPS, PGPS SCFQ( Self-clocked fair queuing ) STFQ( Start time fair queuing ) WF2Q( Worst-case.
Network teleology Damon Wischik
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet Scheduling.
Scheduling CS 218 Fall 02 - Keshav Chpt 9 Nov 5, 2003 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
Improving Matching algorithms for IQ switches Abhishek Das John J Kim.
Topics in Internet Research: Project Scope Mehreen Alam
Reduced Rate Switching in Optical Routers using Prediction Ritesh K. Madan, Yang Jiao EE384Y Course Project.
Energy Optimal Control for Time Varying Wireless Networks Michael J. Neely University of Southern California
Using Traffic Models in Switch Scheduling Hammad M. Saleem Imran Q. Sayed June 3rd, 2002.
BSnetworks.pptTKK/ComNet Research Seminar, SRPT Applied to Bandwidth Sharing Networks (to appear in Annals of Operations Research) Samuli Aalto.
Input buffered switches (1)
Providing QoS in IP Networks
1 Chapter 7 Network Flow Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 17 – Multimedia Transport Subsystem (Part 3) Klara Nahrstedt Spring 2011.
1 Flow-Aware Networking Introduction Concepts, graphics, etc. from Guide to Flow-Aware Networking: Quality-of-Service Architectures and Techniques for.
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
scheduling for local-area networks”
Trading Timeliness and Accuracy in Geo-Distributed Streaming Analytics
Packet Forwarding.
Capacity Allocation Paradox Isaac Keslassy
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Stability Analysis of MNCM Class of Algorithms and two more problems !
Capacity Allocation Paradox Isaac Keslassy
Scheduling Crossbar Switches
Presentation transcript:

Achieving Stability in a Network of IQ Switches Neha Kumar Shubha U. Nabar

Outline The Problem –Instability of LQF –Prior Work Fairness in Scheduling –Fair-LQF –Fair-MWM Stability of Networks –Single-Server Switches –AZ Counterexample –N x N Switches

The Problem Can we ensure stability in networks of IQ switches using a simple local and online scheduling policy?

LQF is Unstable [AZ ‘01] 1/30

Prior Work Longest-In-Network [AZ ‘01] –Frame-based, not local BvN based scheduling [MGLN ’03] –Requires prior knowledge of rates Approximate-OCF [MGLN ’03] –Involves rate estimation

Outline The Problem –Instability of LQF –Prior Work Fairness in Scheduling –Fair-LQF –Fair-MWM Stability of Networks –Single-Server Switches –AZ Counterexample –N x N Switches

Max-Min Fairness Given server capacity C and n flows with rates 1  n, rate allocation R = (r 1  r n ) is max-min fair iff 1.  n r i · C, r i · i 2. any r i can be increased only by reducing r j s.t. r j · r i

Fair-LQF [KPS ‘04] if (q_size > threshold) add q to congested list; m = # congested queues; while (m != 0) round-robin on congested; m--; m = # non-empty uncongested queues; while (m != 0) lqf on uncongested; m--;

Fair-MWM [KPS ‘04] if (voq_size > threshold) add voq to congested list; MWM-schedule unblocked voqs; for all i-j if (voq ij is matched & congested) n = # non-empty voq xj s; block voq ij for n cycles; else if (cycles ij > 0) cycles ij --;

Outline The Problem –Instability of LQF –Prior Work Fairness in Scheduling –Fair-LQF –Fair-MWM Stability of Networks –Single-Server Switches –AZ Counterexample –N x N Switches

Our Model: Traffic Arrivals for each flow satisfy SLLN lim n ! 1 A i (n)/n = i 8 i Arrivals are admissible If f x is the set of flows that go through port x, then  i 2 f x i < 1

Our Model: Flows A flow is a set of packets that traverse the same path within the network Per-Flow Queueing Deterministic Routing

Our Model: Stability A network of switches is rate stable if lim n ! 1 X n /n = lim n ! 1 1/n  i (A i – D i ) = 0 w.p.1 X n – queue lengths vector at time n D i – departure vector at time i A i - arrival vector at time i

Single-Server Switches Claim: Fair-LQF is stable

Proof (1) Lemma 1: For flow i at switch S, if lim n ! 1 A i (n)/n = i and i < 1/N then Fair-LQF ensures that lim n ! 1 D i (n)/n exists and is i regardless of other arrivals at S. Work in Progress

Proof (2) Consider flow i with smallest injection rate, that passes through switches S 1  S k From traffic model and Lemma 1, lim n ! 1 D i S1 (n)/n exists and is i

Proof (3) Observe that lim n ! 1 A i S2 (n)/n = lim n ! 1 D i S1 (n)/n = i Repeatedly applying Lemma 1, lim n ! 1 A i Sj (n)/n = lim n ! 1 D i Sj (n)/n = i 8j · k

Proof (4) Remove flow i from consideration Reduce service rates for S 1  S k accordingly Repeat above for reduced network while flows exist ▪

Fair-LQF on Counterexample 1/3

N x N Switches Claim: Fair-MWM is stable Work in Progress

Simulation Results

Fair-LQF vs LQF (1) LQF causes packets to grow unboundedly in system Number of packets stays bounded under Fair-LQF

Fair-LQF vs LQF (2) LQF causes packets to grow unboundedly in system Number of packets stays bounded under Fair-LQF

Fair-MWM vs MWM (1) Bad guys are punished As they ask for higher rates

Fair-MWM vs MWM (2) Good guys continue to get their fair share As bad guys grow in rate

Fair-MWM is MMF Intuition: Consider a frame-based algorithm where VOQs collect packets for T time slots. Each output independently does a MMF rate allocation. The VOQs drop all packets that cannot be scheduled. The rest of the packets are sent through. We believe that Fair-MWM does this online.