Cell Format. Housekeeping. Segmentation and Reassembly AAL 3/4

Similar documents
Cell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets

HWP2 Application level query routing HWP1 Each peer knows about every other beacon B1 B3

Router Construction. Workstation-Based. Switching Hardware Design Goals throughput (depends on traffic model) scalability (a function of n) Outline

Packet Switching. Hongwei Zhang Nature seems to reach her ends by long circuitous routes.

Packet Switching. Guevara Noubir Fundamentals of Computer Networks. Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann

Packet Switching - Asynchronous Transfer Mode. Introduction. Areas for Discussion. 3.3 Cell Switching (ATM) ATM - Introduction

Asynchronous. nous Transfer Mode. Networks: ATM 1

Administrivia. Homework on class webpage If you are having problems following me in class (or doing the homework problems), please buy the textbook

Internetworking Part 1

ATM Technology in Detail. Objectives. Presentation Outline

Lesson 3 Network technologies - Controlling

Switching and Forwarding

1997, Scott F. Midkiff 1

Research paper Measured Capacity of an Ethernet: Myths and Reality

! Cell streams relating to different media types are multiplexed together on a statistical basis for transmission and switching.

Lecture 22 Overview. Last Lecture. This Lecture. Next Lecture. Internet Applications. ADSL, ATM Source: chapter 14

BROADBAND AND HIGH SPEED NETWORKS

ATM. Asynchronous Transfer Mode. these slides are based on USP ATM slides from Tereza Carvalho. ATM Networks Outline

ATM networks. C. Pham Université de Pau et des Pays de l Adour LIUPPA Laboratory

Chapter 3 Packet Switching

Module 10 Frame Relay and ATM

Chapter 10. Circuits Switching and Packet Switching 10-1

ATM Introduction. The Grand Unification 2005/03/11. (C) Herbert Haas

The Network Layer and Routers

Figure 10.1 Cell switching principles: (a) routing schematic; (b) VP routing; (c) VC routing.

ATM Switches. Switching Technology S ATM switches

A T M. Cell Switched Technology. not SMDS. Defacto Standard Multimedia capable Use with SONET or SDH. Fixed Length - 53 bytes. DigiPoints Volume 1

Module 10 Frame Relay and ATM

Packet Switching Techniques

ATM. Asynchronous Transfer Mode. (and some SDH) (Synchronous Digital Hierarchy)

Switching and Forwarding - continued

Switching and Forwarding - continued

Master Course Computer Networks IN2097

Unit_2 The Telephone Network. Shikha Sharma RCET,Bhilai 1

IV. PACKET SWITCH ARCHITECTURES

ATM Networks: An Overview

Asynchronous Transfer Mode

Introduction. ATM Technology. What is ATM? Agenda

Appendix 5 - ATM Technology in Detail

Basic concept of ATM communication

ATM Networks. Raj Jain

Part 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross

Packet Switching. Packet Switching (CSE 573S) Packet Switching Methods. Packet Switching. Ken Wong Washington University

Telematics Chapter 7: MPLS

ATM Asynchronous Transfer Mode revisited

Router Architectures

Explore some common protocols. Telephone network protocols. Traditional digital transmission. Digital Communications II

CPEG 514. Lecture 11 Asynchronous Transfer Mode (ATM) CPEG 514

Switching Hardware. Spring 2015 CS 438 Staff, University of Illinois 1

Bandwidth-on-Demand up to very high speeds. Variety of physical layers using optical fibre, copper, wireless. 3BA33 D.Lewis

DigiPoints Volume 1. Leader Guide. Module 12 Asynchronous Transfer Mode. Summary. Outcomes. Objectives. Prerequisites

Asynchronous Transfer Mode (ATM) ATM concepts

Internet Multicast Routing

Label Switching. The idea. Add a small label (sometimes called a tag ) on the front of a packet and route the packet based on the label. cs670.

BROADBAND AND HIGH SPEED NETWORKS

CompSci 356: Computer Network Architectures. Lecture 7: Switching technologies Chapter 3.1. Xiaowei Yang

WAN Technologies (to interconnect IP routers) Mario Baldi

Switched Multimegabit Data Service (SMDS)

Switched Multimegabit Data Service

Routers: Forwarding EECS 122: Lecture 13

CISC452 Telecommunications Systems. Lesson 6 Frame Relay and ATM

Published IEEE Network, September This original version reconstructed December 2005.

Routers: Forwarding EECS 122: Lecture 13

Distributed Queue Dual Bus

Introduction to Communications Part One: Physical Layer Switching

ATM Logical Connections: VCC. ATM Logical Connections: VPC

Introduction to ATM Technology

This Lecture. BUS Computer Facilities Network Management X.25. X.25 Packet Switch. Wide Area Network (WAN) Technologies. X.

Chapter 15 Computer and Multimedia Networks

NETWORK PARADIGMS. Bandwidth (Mbps) ATM LANS Gigabit Ethernet ATM. Voice, Image, Video, Data. Fast Ethernet FDDI SMDS (DQDB)

BROADBAND AND HIGH SPEED NETWORKS

MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture

Packet Switch Architectures Part 2

Wireless Networks. Communication Networks

Ethernet Switches (more)

EECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture

Packet Switching. Packet Switching What Issues Will We Focus On? COMP Jasleen Kaur. September 2, Networked and Distributed Systems

ECE 697J Advanced Topics in Computer Networks

Asynchronous Transfer Mode (ATM) Broadband ISDN (B-ISDN)

cs144 Midterm Review Fall 2010

Routers Technologies & Evolution for High-Speed Networks

Protocol Architecture (diag) Computer Networks. ATM Connection Relationships. ATM Logical Connections

Switching and Forwarding Reading: Chapter 3 1/30/14 1

PRODUCT SUMMARY. SARA-Lite SAR for AAL Type 0/5 with UBR Traffic, Frame Relay and LANE Support INTRODUCTION

William Stallings Data and Computer Communications 7 th Edition. Chapter 11 Asynchronous Transfer Mode

Chapter 3. Underlying Technology. TCP/IP Protocol Suite 1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai

Virtual Link Layer : Fundamentals of Computer Networks Bill Nace

BROADBAND PACKET SWITCHING TECHNOLOGIES

TOC: Switching & Forwarding

TOC: Switching & Forwarding

COMP9332 Network Routing & Switching

Network Services and Applications. MAP-TELE 2007/08 José Ruela

Knockout Switches. HIGH PERFORMANCE SWITCHES AND ROUTERS Wiley H. JONATHAN CHAO and BIN LIU Instructor: Mansour Rousta Zadeh

ATM Quality of Service (QoS)

Computer Facilities and Network Management BUS3150 Tutorial - Week 13

Outline. Circuit Switching. Circuit Switching : Introduction to Telecommunication Networks Lectures 13: Virtual Things

Chapter 4 Network Layer: The Data Plane

CMSC 417 Project Implementation of ATM Network Layer and Reliable ATM Adaptation Layer

Transcription:

Housekeeping 1 st Project Handout ue Friday Oct 5 Quiz: Friday Sept 21 Material covered so far 1 st Test October 12 Cell Format User-Network Interface (UNI) 4 8 16 3 1 GFC VPI VCI Type CLP 8 HEC (CRC-8) host-to-switch format GFC: Generic Flow Control (still being defined) VCI: Virtual Circuit Identifier VPI: Virtual Path Identifier Type: management, congestion control, AAL5 (later) CLP Cell Loss Priority HEC: Header Error Check (CRC-8) 384 (48 bytes) Payload Network-Network Interface (NNI) switch-to-switch format GFC becomes part of VPI field Fall 2001 9/11 CptS/EE 555 1 Fall 2001 9/11 CptS/EE 555 2 Segmentation and Reassembly ATM Adaptation Layer (AAL) AAL 1 and 2 designed for applications that need guaranteed rate (eg, voice, video) AAL 3/4 designed for packet data AAL 5 is an alternative standard for packet data AAL 3/4 Convergence Sublayer Protocol ata Unit (CS-PU) 8 8 16 < 64 KB 0 24 8 8 16 CPI Btag BASize User data Pad 0 Etag Len AAL AAL CPI: commerce part indicator (version field) Btag/Etag:beginning and ending tag BAsize: hint on amount of buffer space to allocate Length: size of whole PU ATM ATM Fall 2001 9/11 CptS/EE 555 3 Fall 2001 9/11 CptS/EE 555 4

Cell Format AAL5 40 2 4 10 352 (44 bytes) 6 10 ATM header Type SEQ MI Payload Length CRC-10 CS-PU Format < 64 KB 0 47 bytes 16 16 32 Type BOM: beginning of message COM: continuation of message EOM end of message SEQ: sequence of number MI: message id Length: number of bytes of PU in this cell ata Pad Reserved CRC-32 pad so trailer always falls at end of ATM cell Length: size of PU (data only) CRC-32 (detects missing or misordered cells) Cell Format end-of-pu bit in Type field of ATM header Len Fall 2001 9/11 CptS/EE 555 5 Fall 2001 9/11 CptS/EE 555 6 Workstation-Based Switch Construction Aggregate bandwidth 1/2 of the I/O bus bandwidth capacity shared among all hosts connected to switch example: 800Mbps bus can sup 8 T3 s Outline Switch Fabrics IP Routers Extensible (Active) Routers Packets-per-second must be able to switch small packets 100,000 packets-persecond is achievable eg, 64-byte packets implies 512Mbps Main memory I/O bus Interface 1 Interface 2 Interface 3 Fall 2001 9/11 CptS/EE 555 7 Fall 2001 9/11 CptS/EE 555 8

Fall 2001 9/11 CptS/EE 555 11 Fall 2001 9/11 CptS/EE 555 12 Switching Hardware esign Goals throughput (depends on traffic model) Scaling (how does the number of components grow as a function of n the number of s) Ports circuit management (eg, map VCIs, route datagrams) buffering (input and/or output) Fabric as simple as possible because that s where the most circuits are sometimes do buffering (internal) Fabric Buffering Wherever contention is possible input (contend for fabric) internal (contend for output ) output (contend for link) Head-of-Line Blocking input buffering 1 2 2 Switch Port 1 Port 2 Fall 2001 9/11 CptS/EE 555 9 Fall 2001 9/11 CptS/EE 555 10 Crossbar Switches Example crossbar Concentrator select l of n packets Complexity: n 2 Knockout Switch s 1 2 3 4 s

Fall 2001 9/11 CptS/EE 555 15 Fall 2001 9/11 CptS/EE 555 16 Buffer Knockout Switch (cont) (a) Self-Routing Fabrics Banyan Network constructed from simple 2 x 2 switching elements self-routing header attached to each packet elements arranged to route based on this header no collisions if input packets sorted into ascending order complexity: n log 2 n 001 011 001 (b) 110 111 011 (c) 110 Fall 2001 9/11 CptS/EE 555 13 Fall 2001 9/11 CptS/EE 555 14 111 Self-Routing Fabrics (cont) Batcher Network switching elements sort two numbers some elements sort into ascending (clear) some elements sort into descending (shaded) elements arranged to implement merge sort complexity: n log 2 2 n Common esign: Batcher-Banyan Switch High-Speed IP Router Switch (possibly ATM) Line Cards + Forwarding Engines link interface router lookup (input) common IP path (input) packet queue (output) Network Processor routing protocol(s) exceptional cases

High-Speed Router Alternative esign Routing software w/ router OS Routing Buffer memory Crossbar Switch Fall 2001 9/11 CptS/EE 555 17 Fall 2001 9/11 CptS/EE 555 18