Technische universiteit eindhoven 1 Problem 16: Design-space Exploration Jeroen Voeten, Bart Theelen Eindhoven University of Technology Embedded Systems.

Slides:

Advertisements

Similar presentations

CprE 458/558: Real-Time Systems

Advertisements

Ch. 12 Routing in Switched Networks

DISTRIBUTED MULTIMEDIA SYSTEMS

An Analytical Study of Low Delay Multi-tree-based Overlay Multicast György Dán and Viktória Fodor School of Electrical Engineering KTH, Royal Institute.

A Switch-Based Approach to Starvation in Data Centers Alex Shpiner and Isaac Keslassy Department of Electrical Engineering, Technion. Gabi Bracha, Eyal.

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

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.

TCP transfers over high latency/bandwidth network & Grid TCP Sylvain Ravot

Technische universiteit eindhoven 4 September 2002www.ics.ele.tue.nl/~btheelen1 B.D. Theelen Architecture Design of a Scalable Single-Chip Multi-Processor.

Technische universiteit eindhoven November 2000Ad Verschueren and Bart Theelen1 The Multi Micro Processor Eindhoven.

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.

ATM( Asynchronous Transfer Mode) SWITCHING Group 1

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.

Quality of Service Requirements

1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.

1 ELEN 602 Lecture 18 Packet switches Traffic Management.

NETWORK LAYER. CONGESTION CONTROL In congestion control we try to avoid traffic congestion. Traffic Descriptor Traffic descriptors are qualitative values.

Giuseppe Bianchi Basic switching concepts circuit switching message switching packet switching.

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.

Making Parallel Packet Switches Practical Sundar Iyer, Nick McKeown Departments of Electrical Engineering & Computer Science,

Buffer Sizing for Congested Internet Links Chi Yin Cheung Cs 395 Advanced Networking.

Crossbar Switches Crossbar switches are an important general architecture for fast switches. 2 x 2 Crossbar Switches A general N x N crossbar switch.

April 10, HOL Blocking analysis based on: Broadband Integrated Networks by Mischa Schwartz.

Network based System on Chip Part A Performed by: Medvedev Alexey Supervisor: Walter Isaschar (Zigmond) Winter-Spring 2006.

1 ENTS689L: Packet Processing and Switching Buffer-less Switch Fabric Architectures Buffer-less Switch Fabric Architectures Vahid Tabatabaee Fall 2006.

Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.

2001/09/12Chin-Kai Wu, CS, NTHU1 Dynamic Resource Management Considering the Real Behavior of Aggregate Traffic José R. Gallardo, Dimitrios Makrakis, and.

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.

April 10, HOL Blocking analysis based on: Broadband Integrated Networks by Mischa Schwartz.

TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at

Hardware Design of High Speed Switch Fabric IC. Overall Architecture.

CSE QoS in IP. CSE Improving QOS in IP Networks Thus far: “making the best of best effort”

ATM SWITCHING. SWITCHING A Switch is a network element that transfer packet from Input port to output port. A Switch is a network element that transfer.

TO p. 1 Spring 2006 EE 5304/EETS 7304 Internet Protocols Tom Oh Dept of Electrical Engineering Lecture 9 Routers, switches.

1 Copyright © Monash University ATM Switch Design Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University

Time Parallel Simulations II ATM Multiplexers and G/G/1 Queues.

Link Scheduling & Queuing COS 461: Computer Networks

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

Outlines Received due 13 March 30 %. NO CLASS Week of March (Spring Break)

Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.

Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.

Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”

Case Study: The Abacus Switch CS Goals and Considerations Handles cell relay (fixed-size packets) Can be modified to handle variable-sized packets.

Shared Memory switches Masoud Sabaei Assistant professor Computer Engineering and Information Technology Department, Amirkabir University of Technology.

Network teleology Damon Wischik

What is the Speed of the Internet? Internet Computing KUT Youn-Hee Han.

ECEN4533 Data Communications Lecture #1818 February 2013 Dr. George Scheets n Problems: 2011 Exam #1 n Corrected Design #1 u Due 18 February (Live) u 1.

Spring 2000CS 4611 Router Construction Outline Switched Fabrics IP Routers Extensible (Active) Routers.

Switching. Circuit switching Message switching Packet Switching – Datagrams – Virtual circuit – source routing Cell Switching – Cells, – Segmentation.

Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.

Providing QoS in IP Networks

1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.

Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.

Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.

Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for data flow In Computer Networks Resource: Fayez Gebali, Analysis.

Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.

Section 5.4 Flow Models, Optimal Routing, and Topological Design p.1.

scheduling for local-area networks”

Congestion Control in Data Networks and Internets

QoS & Queuing Theory CS352.

Topics discussed in this section:

Constraint-Based Routing

Empirically Characterizing the Buffer Behaviour of Real Devices

Buffer Management in a Switch

TCP Congestion Control at the Network Edge

2014 session 1 TELE4642: Network Performance Week 12 Review

Intro to Deterministic Analysis

CSCD 433/533 Advanced Networks

Presentation transcript:

technische universiteit eindhoven 1 Problem 16: Design-space Exploration Jeroen Voeten, Bart Theelen Eindhoven University of Technology Embedded Systems Institute Packet-switch case

technische universiteit eindhoven 2 I/O Bus Links Network Adaptors Bus Arbiter I/O Ports Packet switch

technische universiteit eindhoven 3 Specification A second-generation 4 x 4 switch Fixed-sized packets of 25 bytes long Link bandwidth 10 Mbps in both input and output direction ( packets per second) Incoming traffic per link: idle periods alternated with bursts packets in a burst have the same destination packet destination is homogeneously distributed (1 … 4) traffic stream characterized with load and average burst-size parameters; average burst-size is 10 packets Packets entering a full queue are lost Bus-arbitration: round robin (one complete packet per turn & work-conserving)

technische universiteit eindhoven 4 Minimize Total buffer capacities (in packets) Bus capacity (in packets per second) Maximize load that can be dealt with Requirements Average packet delay at most 200 s Packet loss probability at most 0.01 Optimization Criteria and Requirements