1. Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008

2. Agenda Introduction Current implementations Problems with current implementation Project scope Dune’s color-aware algorithm NS-2

3. Introduction Switches with multiple flows.  Packets arrive at several ports are colored (GREEN and YELLOW)  Congestion on some of the ports.  Packets are dropped. Requirements:  Yellow packets are dropped before green.  No bandwidth loss.

4. Situation today Congestion control algorithms  Drop-Tail  RED  Weighted fair queueing  Choke packet No consideration of colors

5. Project Scope Implement Dune’s algorithm for color- aware switch Provide an experimental platform (based on NS-2) for further exploration

6. Color Aware Algorithm

7. Color Aware Algorithm 2 Each input holds Test Parameters Table per color. Each input and output hold Max-Q-Size for all inputs that are mapped to the same output. Central Agent is called called to maintain Max-Q-Size updated both in egress and ingress. When a packed is evaluated for enque, a RED-like test vs. Max-Q- Size of destination port is performed. The packed is dropped or accepted depending on Test Parameters. Each output sends Credit Grant Messages with Max-Q-Size to all non-empty inputs that are mapped to him.

8. Network Simulator 2 A software for simulating networks Written in C++/OTCL Open source Event-driven

9. Network Simulator 2 (cont.)

10. NS-2: mode of work Create the event scheduler [Turn on tracing] Create network Setup routing Insert errors Create transport connection Create traffic Transmit application-level data

11. The End Thanks for your attention!