Wide area networks: packet switching and congestion

Similar documents
Routing in packet-switching networks

William Stallings Data and Computer Communications. Chapter 10 Packet Switching

Chapter 10. Circuits Switching and Packet Switching 10-1

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network

William Stallings Data and Computer Communications 7 th Edition. Chapter 10 Circuit Switching and Packet Switching

Internet Architecture and Protocol

Circuit Switching and Packet Switching

Wireless Networks. Communication Networks

Lecture (04 & 05) Packet switching & Frame Relay techniques Dr. Ahmed ElShafee

Lecture (04 & 05) Packet switching & Frame Relay techniques

BROADBAND AND HIGH SPEED NETWORKS

Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer

Packet Switching Networks. Dr. Indranil Sen Gupta Packet Switching Networks Slide 1

Lecture (05) Network interface Layer media & switching II

Introduction. The fundamental purpose of data communications is to exchange information between user's computers, terminals and applications programs.

DC Assignment III. Communication via circuit switching implies that there is a dedicated communication path between two stations.

Communication Networks

Data and Computer Communications

Introduction to Wireless Networking ECE 401WN Spring 2008

Lecture 7. Network Layer. Network Layer 1-1

Basics (cont.) Characteristics of data communication technologies OSI-Model

Introduction to Internetworking

Resource Allocation and Queuing Theory

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control

Routing Strategies. Fixed Routing. Fixed Flooding Random Adaptive

Layer 3: Network Layer. 9. Mar INF-3190: Switching and Routing

Data & Computer Communication

Network Layer Enhancements

Internetwork Protocols

UNIT IV TRANSPORT LAYER

Quality of Service (QoS)

CS 457 Networking and the Internet. Network Overview (cont d) 8/29/16. Circuit Switching (e.g., Phone Network) Fall 2016 Indrajit Ray

General comments on candidates' performance

Course 6. Internetworking Routing 1/33

Lecture #6 Multiplexing and Switching

Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP

ELC 537 Communication Networks

ECE 333: Introduction to Communication Networks Fall 2001

Quality of Service. Traffic Descriptor Traffic Profiles. Figure 24.1 Traffic descriptors. Figure Three traffic profiles

Switching and Forwarding - continued

Switching and Forwarding - continued

Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.

Chapter 4 Network Layer

CMSC 332 Computer Networks Network Layer

The Network Layer and Routers

Lecture 02 Chapter 10: Circuit Switching and Packet Switching

OSI Transport Layer. Network Fundamentals Chapter 4. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1

Chapter 4. Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, sl April 2009.

Internetworking Terms. Internet Structure. Internet Structure. Chapter 15&16 Internetworking. Internetwork Structure & Terms

ET4254 Communications and Networking 1

CSE 3214: Computer Network Protocols and Applications Network Layer

Introduction to Communications Part One: Physical Layer Switching

Improving QOS in IP Networks. Principles for QOS Guarantees

2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching.

Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access

Internetworking Part 1

Optical Packet Switching

UDP Traffic Management

HW3 and Quiz. P14, P24, P26, P27, P28, P31, P37, P43, P46, P55, due at 3:00pm with both soft and hard copies, 11/11/2013 (Monday) TCP), 20 mins

Lecture (08, 09) Routing in Switched Networks

Lecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.

INTRODUCTORY COMPUTER

Internet Protocols (chapter 18)

SIMULATION FRAMEWORK MODELING

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Concept Questions Demonstrate your knowledge of these concepts by answering the following questions in the space provided.

BROADBAND AND HIGH SPEED NETWORKS

Switching / Forwarding

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11

Sharing Bandwidth Fairly During Congestion

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

ETSF05/ETSF10 Internet Protocols Routing on the Internet

CEN445 Network Protocols & Algorithms. Network Layer. Prepared by Dr. Mohammed Amer Arafah Summer 2008

The Network Layer. Antonio Carzaniga. April 22, Faculty of Informatics University of Lugano Antonio Carzaniga

Computer Networks. Instructor: Niklas Carlsson


Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Basic Concepts In Computer Networking

UNIT- 2 Physical Layer and Overview of PL Switching

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues

Introduction to Networking

Lecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Chapter 6. The Protocol TCP/IP. Introduction to Protocols

fair-queue aggregate-limit

Resource Guide Implementing QoS for WX/WXC Application Acceleration Platforms

Key Network-Layer Functions

Tutorial 9 : TCP and congestion control part I

ETSF05/ETSF10 Internet Protocols. Routing on the Internet

Switching and Forwarding

Transport Layer Protocols TCP

CHAPTER-2 IP CONCEPTS

What is the fundamental purpose of a communication system? Discuss the communication model s elements.

Part Two dealt with the transfer of data between devices that are directly

COMPUTER NETWORK Model Test Paper

William Stallings Data and Computer Communications 7 th Edition. Chapter 12 Routing

Chapter 10 Switching in Data Networks. School of Information Science and Engineering, Shandong University Associate Prof.

Alternate Routing Diagram

Chapter 12. Routing and Routing Protocols 12-1

CSE3213 Computer Network I

Connectionless and Connection-Oriented Protocols OSI Layer 4 Common feature: Multiplexing Using. The Transmission Control Protocol (TCP)

Transcription:

Wide area networks: packet switching and congestion Packet switching ATM and Frame Relay Congestion Circuit and Packet Switching Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection is idle Data rate is fixed Both ends must operate at the same rate Packet Switching designed for data resources allocated as required idle time does not generate any overhead data rate can vary 1

Basic Operation Data transmitted in small packets Typically 1000 octets Longer messages split into series of packets Each packet contains a portion of user data plus some control info Control info Routing (addressing) info Packets are received, stored briefly (buffered) and past on to the next node Store and forward Use of Packets 2

Advantages Line efficiency Single node to node link can be shared by many packets over time Packets queued and transmitted as fast as possible Data rate conversion Each station connects to the local node at its own speed Nodes buffer data if required to equalize rates Packets are accepted even when network is busy Delivery may slow down Priorities can be used Switching Technique Station breaks long message into packets Packets sent one at a time to the network Packets handled in two ways Datagram Virtual circuit 3

Datagram Each packet treated independently Packets can take any practical route Packets may arrive out of order Packets may go missing Up to receiver to re-order packets and recover from missing packets (implies end-to-end error correction) Virtual Circuit Preplanned route established before any packets sent Call request and call accept packets establish connection (handshake) Each packet contains a virtual circuit identifier instead of destination address No routing decisions required for each packet Clear request to drop circuit Not a dedicated path 4

Virtual Circuits v Datagram Virtual circuits Network can provide sequencing and error control Packets are forwarded more quickly No routing decisions to make Less reliable Loss of a node loses all circuits through that node Datagram No call setup phase Better if few packets More flexible Routing can be used to avoid congested parts of the network Event Timing 5

External and Internal Operation Packet switching - datagrams or virtual circuits Interface between station and network node Connection oriented Station requests logical connection (virtual circuit) All packets identified as belonging to that connection & sequentially numbered Network delivers packets in sequence External virtual circuit service e.g. X.25 Different from internal virtual circuit operation Connectionless Packets handled independently External datagram service Different from internal datagram operation Combinations (1) External virtual circuit, internal virtual circuit Dedicated route through network External virtual circuit, internal datagram Network handles each packet separately Different packets for the same external virtual circuit may take different internal routes Network buffers at destination node for re-ordering 6

Combinations (2) External datagram, internal datagram Packets treated independently by both network and user External datagram, internal virtual circuit External user does not see any connections External user sends one packet at a time Network sets up logical connections Routing Complex, crucial aspect of packet switched networks Characteristics required Correctness Simplicity Robustness Stability Fairness Optimality Efficiency Rather a lot! 7

Costing of Routes Link cost depends on link speed (raw) link latency link queue size When and where are routing decisions taken? When On a Packet or virtual circuit basis Where Distributed Made by each node Centralized at Source 8

Network Information Source and Update Timing Routing decisions usually based on knowledge of network (not always) Distributed routing Nodes use local knowledge May collect info from adjacent nodes May collect info from all nodes on a potential route Central routing Collect info from all nodes Update timing When is network info held by nodes updated Fixed - never updated Adaptive - regular updates 9