Professional Documents
Culture Documents
Computer Networks
Spring 2016
Mark P. Mahon
342E Information Sciences & Technology Building
Class: T,R 9:45 11:00 371 Willard Bldg
Office Hours: Thursday, 1:30-3:30
Course Outline
Overview of Computer Networks
Data Communication Protocols (Internet used as a case study)
Topics In Networking
Course Style
Lectures
Homeworks
Papers
Grading
Mid Term: 40% of grade
Final: 55% of grade
Attendance: 5% of grade
Syllabus (tentative)
DATE
Tu, 1/12
TOPIC
ASSIGNMENT*
READING
Introduction (Chapt. 1)
Chapt. 1: 3, 18, 23
3-5
Th, 1/14
Tu, 1/19
Th, 1/21
Tu, 1/26
Th, 1/28
Tu, 2/2
Th, 2/4
Tu, 2/9
Class canceled
Th, 2/11
6-8
6-8
Tu, 2/16
Th, 2/18
Tu, 2/23
Th, 2/25
Tu, 3/1
Chapt. 5: 9, 20, 25
10 - 14
Th, 3/3
Tu, 3/8
Spring Break
Th, 3/10
Spring Break
Tu, 3/15
Mid-Terms
Th, 3/17
Mid-Terms
Tu, 3/22
Th, 3/24
Tu, 3/29
Chapt. 8: 8, 12
15
Th, 3/31
Tu, 4/5
Formal Methods
21
Net Coding
18-20
Network Utility
Maximization
16-17
Th, 4/7
Tu, 4/12
Th, 4/14
Tu, 4/19
Th, 4/21
Tu, 4/26
Th, 4/28
Chapter 1
Problems
Generality General purpose HW. No specific data types & range of apps
Specialized Networks
Terminal
Telecom
Cable
6
Chapter 1
Chapter Outline
Applications
Requirements
Network Architecture
Performance
Chapter 1
Chapter Goal
Exploring the requirements that different applications and different
communities place on the computer network
Introducing the idea of network architecture
Define key metrics that will be used to evaluate the performance
of computer network (QoS)
Chapter 1
Applications
Most people know about the Internet (a computer network)
through applications
TCP
HTTP
Chapter 1
Application Protocol
10
Chapter 1
Requirements
Application Programmer
Network Designer
List the services that his application needs: guaranteed delivery, delay
bounded delivery, mobility, etc.
Design a cost-effective network with sharable resources: efficient
utilization of resources, fairness, performance, etc.
Network Provider
11
Chapter 1
Connectivity
Scale
Link
Nodes
Point-to-point
Multiple access
Switched Network
(a)
(b)
Packet, message
Store-and-forward
Point-to-point
Multiple access
12
switch (S&F)
Terminologies (contd.)
(a)
net1
Router/GW
Chapter 1
Connectivity
Cloud
Hosts
Switches
internetwork
Router/gateway
Host-to-host connectivity
Address
Routing
Unicast/broadcast/multicast
net2
(b)
(a)
(b)
A switched network
Interconnection of networks
13
Circuit Switching
Dedicated communications path established for the duration of the conversation
Requires out-of-band control to establish a connection before communication
Service characteristics
Packet Switching
Small chunks (packets) of data at a time
Packets passed from node to node between source and destination
Service Characteristics
Multiplexing
De-multiplexing
Synchronous Time-division
Multiplexing
Chapter 1
Time slots/data
transmitted in
predetermined slots
17
Chapter 1
18
Network Classifications
By Geography
By Transmission Media
By Switching Technology
Token Ring
Chapter 1
25
Chapter 1
Request/Reply Channels
Message Stream Channels
26
Chapter 1
Reliability
27
Chapter 1
Network Architecture
28
Chapter 1
Network Architecture
29
Chapter 1
Protocols
30
Chapter 1
Interfaces
31
Chapter 1
Protocols
Protocol Specification: prose, pseudo-code, state transition
diagram
Interoperable: when two or more protocols that implement the
specification accurately
IETF: Internet Engineering Task Force
32
Chapter 1
Protocol Graph
33
Chapter 1
Encapsulation
Address information
Error-detecting code
Protocol control
34
Chapter 1
OSI Architecture
Layer 7
Layer 7
Layer 6
Layer 6
Layer 5
Layer 5
Layer 4
Layer 4
Layer 3
Layer 3
Layer 3
Layer 3
Layer 2
Layer 2
Layer 2
Layer 2
Layer 1
Layer 1
Layer 1
Layer 1
35
Physical Layer
Chapter 1
Description of Layers
Network Layer
36
Transport Layer
Provides a name space that is used to tie together the potentially different transport
streams that are part of a single application
Presentation Layer
Session Layer
Chapter 1
Description of Layers
Application Layer
The transport layer and the higher layers typically run only on end-hosts and not on the
intermediate switches and routers
37
Chapter 1
Internet Architecture
Chapter 1
Internet Architecture
Defined by IETF
Three main features
Does not imply strict layering. The application is free to bypass the defined transport
layers and to directly use IP or other underlying networks
An hour-glass shape wide at the top, narrow in the middle and wide at the bottom. IP
serves as the focal point for the architecture
In order for a new protocol to be officially included in the architecture, there needs to be
both a protocol specification and at least one (and preferably two) representative
implementations of the specification
39
Chapter 1
40
Chapter 1
41
What is a socket?
Chapter 1
Socket
The point where a local application process attaches to the network
An interface between an application and the network
An application creates the socket
Creating a socket
Attaching a socket to the network
Sending and receiving messages through the socket
Closing the socket
42
Bandwidth
Chapter 1
Performance
Width of the frequency band
Number of bits per second that can be transmitted over a communication link
43
Chapter 1
Bandwidth
44
Chapter 1
Performance
Latency = Propagation + transmit + queue
Propagation = distance/speed of light
Transmit = size/bandwidth
One bit transmission => propagation is important
Large bytes transmission => bandwidth is important
45
Chapter 1
Delay X Bandwidth
We think the channel between a pair of processes as a hollow pipe
Latency (delay) length of the pipe and bandwidth the width of the pipe
Delay of 50 ms and bandwidth of 45 Mbps
50 x 10-3 seconds x 45 x 106 bits/second
2.25 x 106 bits = 280 KB data.
Network as a pipe
46
Chapter 1
Delay X Bandwidth
Relative importance of bandwidth and latency depends on
application
47
Chapter 1
Delay X Bandwidth
How many bits the sender must transmit before the first bit
arrives at the receiver if the sender keeps the pipe full
Takes another one-way latency to receive a response from the
receiver
If the sender does not fill the pipesend a whole delay
bandwidth products worth of data before it stops to wait for a
signalthe sender will not fully utilize the network
48
Infinite bandwidth
Chapter 1
Delay X Bandwidth
RTT dominates
Throughput = TransferSize / TransferTime
TransferTime = RTT + 1/Bandwidth x TransferSize
1-MB file to 1-Gbps link looks like a 1-KB packet to 1-Mbps link
49
Chapter 1
50