Computer Networks: A Systems Approach, 5e

Larry L. Peterson and Bruce S. Davie

Chapter 1
Foundation

Copyright 2010, Elsevier Inc. All rights Reserved

Chapter 1

Problems
How to build a scalable network that will support
different applications?
What is a computer network?
How is a computer network different from other
types of networks?
What is a computer network architecture?

Chapter 1

Website for Book

Go to http://www.mkp.com and search

for the authors name: Peterson. Click
on the book link then go to the Web
Enhanced section.
The site contains links to most of the
slides and the C source code for the
material in the book.
3

Chapter 1

Grade Policy

Grading

Class Tests 3 at 15%

Homework approx 10 at 2%
Final Exam
Lab experiment reports

45%
20%
20%
15%

Each student is expected to do his/her own work, homework assignments are not team efforts in this class. Late assignments will be
sub-ject to a grade penalty of at least 10%. Work more than two
classes late will be graded at 0%.

Chapter 1

Chapter Outline
Applications
Requirements
Network Architecture
Implementing Network Software
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
Introducing some key elements in implementing
Network Software
Define key metrics that will be used to evaluate
the performance of computer network

Chapter 1

Applications
Most people know about the Internet (a
computer network) through applications

World Wide Web

Email
Online Social Network
Streaming Audio Video
File Sharing
Instant Messaging

Chapter 1

Example of an application

A multimedia application including video-conferencing

8

URL

Hyper Text Transfer Protocol

TCP

Uniform resource locater

http://www.cs.princeton.edu/~llp/index.html

HTTP

Chapter 1

Application Protocol

Transmission Control Protocol

17 messages for one URL request

6 to find the IP (Internet Protocol) address

3 for connection establishment of TCP
4 for HTTP request and acknowledgement

Request: I got your request and I will send the data

Reply: Here is the data you requested; I got the data

4 messages for tearing down TCP connection

Application Programmer

List the services that his application needs: delay

bounded delivery of data

Network Designer

Chapter 1

Requirements

Design a cost-effective network with sharable

resources

Network Provider

List the characteristics of a system that is easy to

manage

10

Need to understand the

following terminologies

Scale
Link
Nodes
Point-to-point
Multiple access
Switched Network

(a)
(b)

Chapter 1

Connectivity

Circuit Switched
Packet Switched

Packet, message
Store-and-forward

Point-to-point
Multiple access
11

Terminologies (contd.)

(a)

Chapter 1

Connectivity
Cloud
Hosts
Switches
internetwork
Router/gateway
Host-to-host connectivity
Address
Routing
Unicast/broadcast/multicast

(b)

(a)
(b)

A switched network
Interconnection of networks
12

Circuit switching: carry bit streams

Chapter 1

Strategies
original telephone network

Packet switching: store-and-forward

messages

Internet

13

Address: byte-string that identifies a node

Chapter 1

Addressing and Routing

usually unique

Routing: process of forwarding messages to

the destination node based on its address
Types of addresses

unicast: node-specific
broadcast: all nodes on the network
multicast: some subset of nodes on the network

14

Resource: links and

nodes
How to share a link?

Multiplexing
De-multiplexing
Synchronous Time-division
Multiplexing

Multiplexing multiple logical flows

over a single physical link

Chapter 1

Cost-Effective Resource Sharing

Time slots/data
transmitted in
predetermined slots

15

FDM: Frequency Division

Multiplexing
Statistical Multiplexing

A switch multiplexing packets from

multiple sources onto one shared
link

Chapter 1

Cost-Effective Resource Sharing

Data is transmitted based

on demand of each flow.
What is a flow?
Packets vs. Messages
FIFO, Round-Robin,
Priorities (Quality-ofService (QoS))
Congested?

LAN, MAN, WAN

SAN (System Area
Networks

16

Chapter 1

Asynchronous TDM

Only three lines actively sending data

17

Chapter 1

Support for Common Services

Logical Channels

Application-to-Application communication path or a

pipe

Process communicating over an

abstract channel

18

Chapter 1

Common Communication Patterns

Client/Server
Two types of communication channel

Request/Reply Channels
Message Stream Channels

19

Network should hide the errors

Bits are lost

Chapter 1

Reliability

Bit errors (1 to a 0, and vice versa)

Burst errors several consecutive errors

Packets are lost (Congestion)

Links and Node failures
Messages are delayed
Messages are delivered out-of-order
Third parties eavesdrop

20

Chapter 1

Network Architecture

Example of a layered network system

Use abstractions to hide complexity

Abstraction naturally leads to layering
Alternative abstractions at each layer
21

Chapter 1

Network Architecture

Layered system with alternative abstractions available at a given layer

22

Chapter 1

Protocols

Protocol defines the interfaces between the

layers in the same system and with the layers of
peer system
Building blocks of a network architecture
Each protocol object has two different interfaces

service interface: operations on this protocol

peer-to-peer interface: messages exchanged with
peer

Term protocol is overloaded

specification of peer-to-peer interface

module that implements this interface
23

Chapter 1

Interfaces

Service and Peer Interfaces

24

Chapter 1

Protocol Graph

Example of a protocol graph

nodes are the protocols and links the depends-on relation

25

Chapter 1

Encapsulation

High-level messages are encapsulated inside of low-level messages

26

Chapter 1

OSI Architecture

The OSI 7-layer Model

OSI Open Systems Interconnection

27

Physical Layer

Handles the transmission of raw bits over a communication link

Data Link Layer

Chapter 1

Description of Layers

Collects a stream of bits into a larger aggregate called a frame

Network adaptor along with device driver in OS implement the
protocol in this layer
Frames are actually delivered to hosts

Network Layer

Handles routing among nodes within a packet-switched network

Unit of data exchanged between nodes in this layer is called a
packet

The lower three layers are implemented on all network nodes

28

Chapter 1

Description of Layers

Transport Layer

Session 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

Implements a process-to-process channel

Unit of data exchanges in this layer is called a message

Concerned about the format of data exchanged between peers

Application Layer

Standardize common type of exchanges

The transport layer and the higher layers typically run only on endhosts and not on the intermediate switches and routers
29

Chapter 1

ISO Example

30

Internet Protocol Graph

Chapter 1

Internet Architecture

Alternative view of the

Internet architecture. The
Network layer shown here
is sometimes referred to as
the sub-network or link
layer.
31

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

32

Chapter 1

Application Programming Interface

Interface exported by the network

Since most network protocols are implemented (those in
the high protocol stack) in software and nearly all
computer systems implement their network protocols as
part of the operating system, when we refer to the
interface exported by the network, we are generally
referring to the interface that the OS provides to its
networking subsystem
The interface is called the network Application
Programming Interface (API)

33

Socket Interface was originally provided by the

Berkeley distribution of Unix
- Now supported in virtually all operating systems

Each protocol provides a certain set of services,

and the API provides a syntax by which those
services can be invoked in this particular OS

Chapter 1

Application Programming Interface (Sockets)

34

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

The interface defines operations for

Creating a socket
Attaching a socket to the network
Sending and receiving messages through the socket
Closing the socket

35

Socket Family

Chapter 1

Socket
PF_INET denotes the Internet family
PF_UNIX denotes the Unix pipe facility
PF_PACKET denotes direct access to the network
interface (i.e., it bypasses the TCP/IP protocol stack)

Socket Type

SOCK_STREAM is used to denote a byte stream

SOCK_DGRAM is an alternative that denotes a
message oriented service, such as that provided by
UDP

36

Chapter 1

Creating a Socket
int sockfd = socket(address_family, type, protocol);

The socket number returned is the socket descriptor for

the newly created socket

int sockfd = socket (PF_INET, SOCK_STREAM, 0);

int sockfd = socket (PF_INET, SOCK_DGRAM, 0);

The combination of PF_INET and SOCK_STREAM implies TCP

37

Chapter 1

Client-Serve Model with TCP

Server

Passive open
Prepares to accept connection, does not actually establish a
connection

Server invokes
int bind (int socket, struct sockaddr *address,
int addr_len)
int listen (int socket, int backlog)
int accept (int socket, struct sockaddr *address,
int *addr_len)

38

Chapter 1

Client-Serve Model with TCP

Bind

Binds the newly created socket to the specified address i.e. the
network address of the local participant (the server)
Address is a data structure which combines IP and port

Listen

Defines how many connections can be pending on the specified

socket

39

Chapter 1

Client-Serve Model with TCP

Accept

Carries out the passive open

Blocking operation

Does not return until a remote participant has established a

connection

When it does, it returns a new socket that corresponds to the

new established connection and the address argument
contains the remote participants address

40

Chapter 1

Client-Serve Model with TCP

Client

Application performs active open

It says who it wants to communicate with

Client invokes
int connect (int socket, struct sockaddr *address,
int addr_len)

Connect

Does not return until TCP has successfully established a

connection at which application is free to begin sending data
Address contains remote machines address

41

Chapter 1

Client-Serve Model with TCP

In practice

The client usually specifies only remote participants

address and lets the system fill in the local
information
Whereas a server usually listens for messages on a
well-known port
A client does not care which port it uses for itself, the
OS simply selects an unused one

42

Chapter 1

Client-Serve Model with TCP

Once a connection is established, the application
process invokes two operation
int send (int socket, char *msg, int msg_len,
int flags)
int recv (int socket, char *buff, int buff_len,
int flags)

43

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>

Chapter 1

Example Application: Client

#define SERVER_PORT 5432

#define MAX_LINE 256
Iint main(int argc, char * argv[])
{
FILE *fp;
struct hostent *hp;
struct sockaddr_in sin;
char *host;
char buf[MAX_LINE];
int s;
int len;
if (argc==2) {
host = argv[1];
}
else {
fprintf(stderr, "usage: simplex-talk host\n");
exit(1);
}

44

26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

/* translate host name into peers IP address */

hp = gethostbyname(host);
if (!hp) {
fprintf(stderr, "simplex-talk: unknown host: %s\n", host);
exit(1);
}
/* build address data structure */
bzero((char *)&sin, sizeof(sin));
sin.sin_family = AF_INET;
bcopy(hp->h_addr, (char *)&sin.sin_addr, hp->h_length);
sin.sin_port = htons(SERVER_PORT);
/* active open */
if ((s = socket(PF_INET, SOCK_STREAM, 0)) < 0) {
perror("simplex-talk: socket");
exit(1);
}
if (connect(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) {
perror("simplex-talk: connect");
close(s);
exit(1);
}
/* main loop: get and send lines of text */
while (fgets(buf, sizeof(buf), stdin)) {
buf[MAX_LINE-1] = \0;
len = strlen(buf) + 1;
send(s, buf, len, 0);
}
}

Chapter 1

Example Application: Client-Cont.

45

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#define SERVER_PORT 5432
#define MAX_PENDING 5
#define MAX_LINE 256

Chapter 1

Example Application: Server

int main()
{
struct sockaddr_in sin;
char buf[MAX_LINE];
int len;
int s, new_s;
/* build address data structure */
bzero((char *)&sin, sizeof(sin));
sin.sin_family = AF_INET;
sin.sin_addr.s_addr = INADDR_ANY;
sin.sin_port = htons(SERVER_PORT);
/* setup passive open */
if ((s = socket(PF_INET, SOCK_STREAM, 0)) < 0) {
perror("simplex-talk: socket");
exit(1);
}

46

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

if ((bind(s, (struct sockaddr *)&sin, sizeof(sin))) < 0) {

perror("simplex-talk: bind");
exit(1);
}
listen(s, MAX_PENDING);
/* wait for connection, then receive and print text */
while(1) {
if ((new_s = accept(s, (struct sockaddr *)&sin, &len)) < 0) {
perror("simplex-talk: accept");
exit(1);
}
while (len = recv(new_s, buf, sizeof(buf), 0))
fputs(buf, stdout);
close(new_s);
}

Chapter 1

Example Application: Server

47

Chapter 1

Protocol Implementation Issues

Process Models

Process-per-protocol

Process-per-message

48

Chapter 1

Message Buffers

49

Chapter 1

Performance Measures

Bandwidth-Common Usage: the physical

width of the available frequency band.

Example: Voice channel = 300-3300Hz = 3000

Hz
Example: Ethernet = 10Mbps or 100s/bit

Throughput-Common Usage: the measured

performance of a system.

Example: an FTP connection over Ethernet

2Mbps due to round trip delays and packetizing
effects.
50

Chapter 1

Bandwidth

Bits transmitted at a particular bandwidth can be regarded as

having some width:
(a) bits transmitted at 1Mbps (each bit 1 s wide);
(b) bits transmitted at 2Mbps (each bit 0.5 s wide).

51

Chapter 1

Performance
Latency = Propagation + transmit + queue
Propagation = distance/relative speed of light
Transmit = size/bandwidth
One bit transmission => propagation is important
Large bytes transmission => bandwidth is important

52

Chapter 1
53

Chapter 1

Bits and Bytes

A common error is to confuse the b in Mb with the B

in MB. The difference is that b usually stands for
binary bit and B usually stands for Byte(8 bits)
Unfortunately, we routinely use both terms in networking design specifications. A 10 Mbps network,
such as Ethernet, will have a clock rate at the
transmitter of 10MHz. Typical file transfer rates are
given in KBps where we mean kilobytes per second.
54

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
55

Chapter 1

Delay X Bandwidth
Relative importance of bandwidth and latency
depends on application

For large file transfer, bandwidth is critical

For small messages (HTTP, NFS, etc.), latency is
critical
Variance in latency (jitter) can also affect some
applications (e.g., audio/video conferencing)

56

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

57

Infinite bandwidth

Chapter 1

Delay X Bandwidth
RTT dominates
Throughput = TransferSize / TransferTime
TransferTime = RTT + 1/Bandwidth x
TransferSize

Its all relative

1-MB file to 1-Gbps link looks like a 1-KB

packet to 1-Mbps link

58

Chapter 1

Relationship between bandwidth and latency

A 1-MB file would fill the 1-Mbps link 80 times,

but only fill the 1-Gbps link 1/12 of one time

59

Chapter 1

Summary

We have identified what we expect from a computer

network
We have defined a layered architecture for computer
network that will serve as a blueprint for our design
We have discussed the socket interface which will be
used by applications for invoking the services of the
network subsystem
We have discussed two performance metrics using which
we can analyze the performance of computer networks

60