COP 5611 Operating Systems Spring 2010

Slides:



Advertisements
Similar presentations
Network Delays, Statistical Multiplexing
Advertisements

Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
Data Communications and Networking
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
CS 5565 Network Architecture and Protocols
COP 4600 Operating Systems Fall 2010
(Ownership, Service Paradigm, Measures of Performance)
Point-to-Point Network Switching
CS 5565 Network Architecture and Protocols
A Taxonomy of Communication Networks
COP 5611 Operating Systems Spring 2010
6 Transport Layer Computer Networks Tutun Juhana
CS 5565 Network Architecture and Protocols
Shared, Multi-Hop Networks
COT 5611 Operating Systems Design Principles Spring 2014
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
CGS 3763 Operating Systems Concepts Spring 2013
Lecture 10 Internet QoS Basic concepts Networking hardware.
COP 4600 Operating Systems Fall 2010
COT 5611 Operating Systems Design Principles Spring 2014
Network Layer Functions
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
COT 5611 Operating Systems Design Principles Spring 2014
COT 5611 Operating Systems Design Principles Spring 2012
COT 4600 Operating Systems Fall 2010
William Stallings Data and Computer Communications
CGS 3763 Operating Systems Concepts Spring 2013
COT 5611 Operating Systems Design Principles Spring 2014
COT 5611 Operating Systems Design Principles Spring 2014
COP 4600 Operating Systems Fall 2010
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
CGS 3763 Operating Systems Concepts Spring 2013
COP 5611 Operating Systems Spring 2010
COP 5611 Operating Systems Spring 2010
CGS 3763 Operating Systems Concepts Spring 2013
Congestion Control (from Chapter 05)
COP 5611 Operating Systems Spring 2010
COP 4600 Operating Systems Fall 2010
COT 5611 Operating Systems Design Principles Spring 2012
COT 4600 Operating Systems Fall 2010
COT 5611 Operating Systems Design Principles Spring 2012
CGS 3763 Operating Systems Concepts Spring 2013
University of Houston Datacom II Lecture 1B Review Dr Fred L Zellner
Circuit Switching Packet Switching Message Switching
Congestion Control (from Chapter 05)
Network Architecture for Cyberspace
Lecture 7 Exercise 7 1. Explain what are the connection-oriented communication and the connectionless communication. Give some examples for each of the.
Congestion Control (from Chapter 05)
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Optical communications & networking - an Overview
COT 6200 Quantum Computing Fall 2010
Congestion Control (from Chapter 05)
L9: Intro Network Systems
Congestion Control (from Chapter 05)
COT 5611 Operating Systems Design Principles Spring 2012
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
CGS 3763 Operating Systems Concepts Spring 2013
COT 4600 Operating Systems Fall 2009
Data Communications Spring, 2019
COT 5611 Operating Systems Design Principles Spring 2012
CGS 3763 Operating Systems Concepts Spring 2013
COT 5611 Operating Systems Design Principles Spring 2014
Presentation transcript:

COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM

Lecture 9 Reading Assignment: Chapter 7 from the online textbook HW1 due today. Remember: A progress report for the project is due on every Monday till week 12. Last time: Thread coordination and scheduling Multi-level memories I/O bottleneck Today: Network properties Layering Data link layer Next time Network layer 2 2 2 2 2

Properties of Networks Physical limitations: Speed of light  finite communication latency Hostile environments Limited channel capacity  limited bandwidth Channels are shared - multiplexed Why: Support any-to-any communication Share costs How Isochronous multiplexing – scheduled access TDM FDM Asynchronous multiplexing

Communication channels are multiplexed

Data flow on an isochronous link

A data communication network

Asynchronously multiplexed link

Communication Continuous versus bursty The old phone network versus data networks Human versus computer communication Connection-oriented versus connectionless communication Packet-forwarding networks Routing problem Delays

Packet forwarding (store and forward) networks

Problems in packet forwarding networks Delay Propagation delay Transmission delay Processing delay Queuing delay Resources are finite and a worst case design is not feasible  heavy tail distributions of resource needs Buffer overflow and discarded packets Adaptive rate modulated by information regarding network congestion Timers and packet retransmission Duplicate packets

Queuing delays versus utilization.