TCOM 601 (Advanced Network, Modeling and Analysis) Instructor: Saswati Sarkar Course Web Page:

Slides:



Advertisements
Similar presentations
1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
Advertisements

TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
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.
High-Performance Networking Group Isaac Keslassy, Nick McKeown
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.
Worst-case Fair Weighted Fair Queueing (WF²Q) by Jon C.R. Bennett & Hui Zhang Presented by Vitali Greenberg.
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 12 noon Thursday 10:30 am – 12 noon.
Logistics: –My office hours: T, Th 4-5pm or by appointment –Class Web page:
Making Parallel Packet Switches Practical Sundar Iyer, Nick McKeown Departments of Electrical Engineering & Computer Science,
Networks: Congestion Control1 Congestion Control.
1 Performance Results The following are some graphical performance results out of the literature for different ATM switch designs and configurations For.
1 Comnet 2006 Communication Networks Recitation 5 Input Queuing Scheduling & Combined Switches.
Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Course.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction Event Algebra (Sec )
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 12 noon Thursday 10:30 am – 12 noon.
EE 122: Router Design Kevin Lai September 25, 2002.
CS 268: Lecture 12 (Router Design) Ion Stoica March 18, 2002.
Data Communication and Networks
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction (Sec )
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,
Data Communication and Networks Lecture 0 Administrivia September 8, 2005.
CSE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Dimosthenes Anthomelidis
1 ATM Switching: An Overview Carey Williamson Department of Computer Science University of Calgary.
1 Netcomm 2005 Communication Networks Recitation 5.
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
4: Network Layer4b-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from.
1 IP routers with memory that runs slower than the line rate Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford.
Buffer Management for Shared- Memory ATM Switches Written By: Mutlu Apraci John A.Copelan Georgia Institute of Technology Presented By: Yan Huang.
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case Abhay K. Parekh, Member, IEEE, and Robert.
General information CSE : Probabilistic Analysis of Computer Systems
1 Copyright © Monash University ATM Switch Design Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University
ECEN4533 Data Communications Lecture #2125 February 2013 Dr. George Scheets n Read 11.4 n Problems: Chapter 11.2, 4, & 5 n Quiz #2, 25 March (Live) < 1.
Router Architecture Overview
Univ. of TehranAdv. topics in Computer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
COMP5416 Advanced Network Technologies
Outlines Received due 13 March 30 %. NO CLASS Week of March (Spring Break)
1 Performance Guarantees for Internet Routers ISL Affiliates Meeting April 4 th 2002 Nick McKeown Professor of Electrical Engineering and Computer Science,
Stress Resistant Scheduling Algorithms for CIOQ Switches Prashanth Pappu Applied Research Laboratory Washington University in St Louis “Stress Resistant.
EE 401 Control Systems Analysis and Design Course Overview and Introduction Monday 26 Aug 2013 EE 401: Control Systems Analysis and Design Slide 1 of 10.
Software Systems Engineering Rob Oshana Southern Methodist University EMIS 7312.
CSE 5346 – Networks II: High Performance Networks and Quality of Service Spring 2016 Mike O’Dell Senior Lecturer 1.
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
1 Buffering Strategies in ATM Switches Carey Williamson Department of Computer Science University of Calgary.
Advances in Cloud Computing CIS6930/CIS4930
The Fork-Join Router Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford University
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Input buffered switches (1)
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
1 Building big router from lots of little routers Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford University.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
scheduling for local-area networks”
Instructor Materials Chapter 6: Quality of Service
Probabilistic Analysis of Computer Systems
Topics discussed in this section:
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Empirically Characterizing the Buffer Behaviour of Real Devices
Queue Management Jennifer Rexford COS 461: Computer Networks
Addressing: Router Design
Chapter 4: Network Layer
Chapter 3 Part 3 Switching and Bridging
Packet Switching (basics)
What’s “Inside” a Router?
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Course Information EECS 2031 Fall 2016.
Chapter 3 Part 3 Switching and Bridging
Chapter 4: Network Layer
Presentation transcript:

TCOM 601 (Advanced Network, Modeling and Analysis) Instructor: Saswati Sarkar Course Web Page:

Timings Class Monday: 4:30-7:30, 212 Moore Instructor Office Hours: 2:30-4:30, Monday, 360 Moore (can schedule meetings other times by appointment)

Reference Materials Class Notes, Papers referred in the class

Prerequisites TCOM 501

Grading Homeworks once every month (40 % of the grade) 2 weeks time for each Term Project: 2 (60 % of the grade) individual Consultation allowed but no copying

Course Content Switching: Input queueing, Output Queueing, Shared memory, Combined input/output queueing. Maximum throughput in input queued switches, emulating output queueing with input queueing via speedup. Building larger switches: ClOS networks, banyan networks etc. Markov decision process and application in resource allocation (memory,bandwidth allocation). Buffer Management: Pushout, Threshold, Random Early Detection, Sharing mechanisms, (Complete partitioning, complete sharing, hybrids), coupling buffer management and scheduling.

Course Content Traffic Management and Call Admission: Traffic characterization, Traffic shaping, Admission control, Statistical multiplexing, Effective Bandwidth. Scheduling : Fair queueing, Rate controlled service disciplines. TCP modeling