Reduced Rate Switching in Optical Routers using Prediction Ritesh K. Madan, Yang Jiao EE384Y Course Project.

Slides:



Advertisements
Similar presentations
1 Maintaining Packet Order in Two-Stage Switches Isaac Keslassy, Nick McKeown Stanford University.
Advertisements

1 Scheduling Crossbar Switches Who do we chose to traverse the switch in the next time slot? N N 11.
Lecture 12. Emulating the Output Queue So far we have shown that it is possible to obtain the same throughput with input queueing as with output queueing.
EE 685 presentation Optimal Control of Wireless Networks with Finite Buffers By Long Bao Le, Eytan Modiano and Ness B. Shroff.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Discrete Time Markov Chains
High-Performance Networking Group Isaac Keslassy, Nick McKeown
Submitters: Erez Rokah Erez Goldshide Supervisor: Yossi Kanizo.
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.
Frame-Aggregated Concurrent Matching Switch Bill Lin (University of California, San Diego) Isaac Keslassy (Technion, Israel)
Towards Simple, High-performance Input-Queued Switch Schedulers Devavrat Shah Stanford University Berkeley, Dec 5 Joint work with Paolo Giaccone and Balaji.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
A Scalable Switch for Service Guarantees Bill Lin (University of California, San Diego) Isaac Keslassy (Technion, Israel)
Algorithm Orals Algorithm Qualifying Examination Orals Achieving 100% Throughput in IQ/CIOQ Switches using Maximum Size and Maximal Matching Algorithms.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
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.
Crossbar Switches Crossbar switches are an important general architecture for fast switches. 2 x 2 Crossbar Switches A general N x N crossbar switch.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
1 Comnet 2006 Communication Networks Recitation 5 Input Queuing Scheduling & Combined Switches.
The Concurrent Matching Switch Architecture Bill Lin (University of California, San Diego) Isaac Keslassy (Technion, Israel)
Scaling Internet Routers Using Optics Producing a 100TB/s Router Ashley Green and Brad Rosen February 16, 2004.
1 Architectural Results in the Optical Router Project Da Chuang, Isaac Keslassy, Nick McKeown High Performance Networking Group
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion MSM.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion The.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Statistical.
The Crosspoint Queued Switch Yossi Kanizo (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) and David Hay (Politecnico di Torino, Italy)
1 EE384Y: Packet Switch Architectures Part II Load-balanced Switches Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
Fundamental Complexity of Optical Systems Hadas Kogan, Isaac Keslassy Technion (Israel)
Maximum Size Matchings & Input Queued Switches Sundar Iyer, Nick McKeown High Performance Networking Group, Stanford University,
1 Achieving 100% throughput Where we are in the course… 1. Switch model 2. Uniform traffic  Technique: Uniform schedule (easy) 3. Non-uniform traffic,
1 Netcomm 2005 Communication Networks Recitation 5.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Maximal.
Analysis of Input Queueing More complex system to analyze than output queueing case. In order to analyze it, we make a simplifying assumption of "heavy.
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
Load Balancing and Switch Scheduling Xiangheng Liu EE 384Y Final Presentation June 4, 2003.
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.
Load Balanced Birkhoff-von Neumann Switches
EE 685 presentation Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks By Atilla Eryılmaz, Asuman Özdağlar, Devavrat.
Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic Michael J. Neely University of Southern California INFOCOM 2008, Phoenix,
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.
Enabling Class of Service for CIOQ Switches with Maximal Weighted Algorithms Thursday, October 08, 2015 Feng Wang Siu Hong Yuen.
Summary of switching theory Balaji Prabhakar Stanford University.
1 IK1500 Communication Systems IK1500 Anders Västberg
ISLIP Switch Scheduler Ali Mohammad Zareh Bidoki April 2002.
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.
Winter 2006EE384x1 EE384x: Packet Switch Architectures I a) Delay Guarantees with Parallel Shared Memory b) Summary of Deterministic Analysis Nick McKeown.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
Order Optimal Delay for Opportunistic Scheduling In Multi-User Wireless Uplinks and Downlinks Michael J. Neely University of Southern California
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
SNRC Meeting June 7 th, Crossbar Switch Scheduling Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University
Improving Matching algorithms for IQ switches Abhishek Das John J Kim.
Topics in Internet Research: Project Scope Mehreen Alam
Throughput of Internally Buffered Crossbar Switch Saturday, February 20, 2016 Mingjie Lin
Achieving Stability in a Network of IQ Switches Neha Kumar Shubha U. Nabar.
A Load Balanced Switch with an Arbitrary Number of Linecards I.Keslassy, S.T.Chuang, N.McKeown ( CSL, Stanford University ) Some slides adapted from authors.
Competitive Queueing Policies for QoS Switches Nir Andelman Yishay Mansour An Zhu TAUTAUStanford.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Input buffered switches (1)
scheduling for local-area networks”
Balaji Prabhakar Departments of EE and CS Stanford University
Intro to Deterministic Analysis
Stability Analysis of MNCM Class of Algorithms and two more problems !
Balaji Prabhakar Departments of EE and CS Stanford University
EE384Y: Packet Switch Architectures II
Optimal Control for Generalized Network-Flow Problems
Presentation transcript:

Reduced Rate Switching in Optical Routers using Prediction Ritesh K. Madan, Yang Jiao EE384Y Course Project

Outline Motivation for reduced rate switching A generalized architecture in optical switching Delay analysis for the architecture Motivate the choice of architecture and prediction Prediction using Least Mean Square Algorithm Convergence of prediction algorithm and stability Effectiveness of prediction through simulation results

Reduced Rate Switching Architectures Why? Using a optical switching element could use less power, simplify architecture But it takes a while to reconfigure (~  sec)

Reduced Rate Switching Architectures A switching element takes multiple time slots to change between configurations. During the transition, the switch can not transfer packets. time Decision Time MWM schedule based on current VOQ sizes Switch transfer packets based the schedule

Reduced Rate Switching Architectures A switching element takes multiple time slots to change between configurations. During the transition, the switch can not transfer packets. Multiple switches can be time multiplexed, so that for any time slot, one of switches can transfer packets. time Decision Time

A switching element takes multiple time slots to change between configurations. During the transition, the switch can not transfer packets. Multiple switches can be time multiplexed, so that for any time slot, one of switches can transfer packets. Or, keep a switching element in a configuration for more than one time slot, time Decision Time Burst Length Reduced Rate Switching Architectures

A switching element takes multiple time slots to change between configurations. During the transition, the switch can not transfer packets. Multiple switches can be time multiplexed, so that for any time slot, one of switches can transfer packets. Or, keep a switching element in a configuration for more than one time slot, so a less number of switches can be used. time Decision Time Burst Length Reduced Rate Switching Architectures

Architecture Choice Decision time = m Burst Length = k Number of switches needed = m/k+1 time Decision Time Burst Length Example m=8, k=4, need 3 switches: tt+mt+m+k How many switches should we use?

Effect of Burst Length Rapidly diminishing benefit of increasing the number of switches

Effect of Burst Length Rapidly diminishing benefit of increasing the number of switches Speedup does not help much Where is the delay coming from?

Where is the delay from? Bound on average delay can be obtained: –by method proposed by Devavrat et. al. 02. –Or by the drift analysis method proposed by Leonardi et. al. 01. For uniform i.i.d. traffic, the bound is:  is the load at a input, N is the number of inputs Does the average queue size really have a linear dependency on m + k ? time Decision Time Burst Length tt+mt+m+k

Key observation Decision time = m and Burst length = k has the accumulative effect of increasing the delay by ~ m + k : Decision time: VOQ’s that should be served m time slots ago are served now. Burst length: Effect of arrivals from t-k to t will not show up until time t. time Decision Time Burst Length tt+mt+m+kt-k arrivals

Key observation Decision time = m and Burst length = k has the accumulative effect of increasing the delay by ~ m + k How do we reduce the delay caused by the decision time and burst length, while using only 2 switches? time Decision Time Burst Length tt+mt+m+kt-k arrivals

Key observation Decision time = m and Burst length = k has the accumulative effect of increasing the delay by ~ m + k How do we reduce the delay caused by the decision time and burst length, while using only 2 switches? –Prediction! –Intuition: at time = t, correctly guessing the VOQ sizes at t + m eliminates the delay caused by the Decision Time time Decision Time Burst Length tt+mt+m+kt-k arrivals

Effect of prediction Prediction reduces the wait time for the queue that should be served.

To decide schedule for burst (n+1) –observe VOQ at beginning of burst n (decision instant) –predict arrivals during burst n –know departures during burst n –do MWM on time Decision Time Burst Length Scheduling Scheme burst nburst (n+1)

Adaptive Linear Prediction w i [n] are the weights at beginning of burst n are the arrivals to a single VOQ during burst n weights are adapted with time

Prediction Scheme z -1 Adaptive linear combiner with (L+1) weights Adaptive Linear Combiner with (L+1) weights + a[n] a[n-1] e[n] a pred [n+1] error signal for adaptation copy weights a[n] a pred [n]

Adaptation of weights using LMS … Error e[n] a[n-1] z -1 … a[n-L-1]a[n-2] a pred [n] (predicted value) a[n] (true value) w 0 [n-1] w 1 [n-1] w L [n-1]

Convergence of LMS For second order stationary arrivals, Convergence is guaranteed if Rate of convergence

Stability of Scheduling Algorithm Theorem 1: Under Bernoulli i.i.d. arrivals, MWM on predicted queue lengths gives 100% throughput for any decision time and burst length Proof: Decision time + burst length = m + k < infinity => Number of arrivals in m + k time slots is finite => For stationary arrivals the weight vector converges => Error in guessing the queue length is bounded => W MWM - W pred < C => 100% throughput

Simulation (6X6 Switch) with  =1333, a=0.5decision time = burst length =64