CS2105

An Awesome Introduction to
Computer Networking

CS2105

Lecture 1

Ooi Wei Tsang

AS6 05-14
ooiwt@comp.nus.edu.sg

CS2105

Lecture 1

Oce Hour
Monday 4-6pm

CS2105

Lecture 1

CS2105

Lecture 1

CS2105

Lecture 1

CS2105

Lecture 1

2 programming assignments
1 written assignment
9 problem sets
4 practical exercises

CS2105

Lecture 1

Important Dates
Midterm: 10 March 2014
Final Exam: 30 April 2014

CS2105

Lecture 1

Midterm & Final are

Semi-Open Book
(one double-sided A4 crib sheet
allowed)

CS2105

Lecture 1

Slides to be posted 1-2 days

before the lecture

CS2105

Lecture 1

10

Slides = Notes

CS2105

Lecture 1

11

You are expected to take notes

during lecture

CS2105

Lecture 1

12

You are expected to read the

assigned readings

CS2105

Lecture 1

13

No model answer will be

posted

CS2105

Lecture 1

14

``No mercy'' policy against

plagiarism

CS2105

Lecture 1

17

``No mercy'' policy against

voilation of naming
convention

CS2105

Lecture 1

18

http://blog.nus.edu.sg/
cs2105

CS2105

Lecture 1

19

Check for updates frequently

and
subscribe via email or RSS

CS2105

Lecture 1

20

Use your real name when

commenting online

CS2105

Lecture 1

21

Screencast will be posted

CS2105

Lecture 1

22

You need an SoC UNIX account.

Get one here:
https://mysoc.nus.edu.
sg/~newacct/

CS2105

Lecture 1

23

Questions?

CS2105

Lecture 1

24

CS2105 Lecture 1

Introduction
14 January, 2014

CS2105

Lecture 1

25

CS2105 Lecture 1

Introduction
14 January, 2014

.
.

After this class, you are expected to:

understand the basic terms, including host, packet, protocol,
throughput, bottleneck link, store-and-forward, and autonomous
system.
know about the logical (the five layers) and physical architecture (as a
network of ASes) of the Internet.
know about the pros and cons of packet switching versus circuit
switching.
understand the dierent components of end-to-end delay and their
relations to bandwidth, packet size, distance, propagation speed, and
queue size.

The complexity involved in

engineering the Internet will
make your head explode, but
this one incredibly simple trick
keeps the complexity
manageable.
CS2105

Lecture 1

27

What is CS2105
about?

CS2105

Lecture 1

28

Concepts and principles

behind computer networking
Introduction to networked
application programming

CS2105

Lecture 1

29

The Internet is a network of

connected computing devices.

CS2105

Lecture 1

30

Hosts or end systems

996,230,757
as of July 2013

CS2105

Lecture 1

33

996,230,757
as of July 2013

.
.

Data obtained from Internet Systems

Consortium: http://www.isc.org/
solutions/survey/history

The hosts run distributed

applications

CS2105

Lecture 1

35

Web: browsers, Web servers

WoW: clients, game servers
Skype: clients, supernodes
BitTorrent: peers, trackers

CS2105

Lecture 1

36

Applications
exchange messages and
communicate according to
protocols

CS2105

Lecture 1

37

Protocol: the type and order of

messages exchanged and the
actions taken after messages
are sent or received

CS2105

Lecture 1

38

Examples:
HTTP, SMTP, FTP, TCP

CS2105

Lecture 1

39

The hosts access the Internet

through access network

CS2105

Lecture 1

40

WiFi, Ethernet, 3G, LTE, DSL,

Cable, Fiber, Dial-Up, Satellite

CS2105

Lecture 1

41

WiFi, Ethernet, 3G, LTE, DSL,

Cable, Fiber, Dial-Up, Satellite

.
.

You can read up more about these dierent

access network technologies in Section 1.2.1.
We will cover Ethernet and WiFi in more
details in CS2105.

Hosts can communicate over

dierent physical media

CS2105

Lecture 1

43

twisted pair

coaxial cable

fiber optic

Consider two hosts connected

directly through a physical medium

CS2105

Lecture 1

45

The hosts communicate by sending

information to each other.

CS2105

Lecture 1

46

Information can be represented by a

sequence of bits -- 0 or 1.

CS2105

Lecture 1

47

Modulation/Demodulation:
Conversion between bits and
signals

CS2105

Lecture 1

48

Error Detection/Correction:
Ensuring that bits are received
correctly

CS2105

Lecture 1

49

Packetization/Segmentation:
Dividing data into chunks
(called packets) so that only
errornous packets need to be
retransmitted.
CS2105

Lecture 1

50

Consider multiple hosts connected

through a shared physical medium

CS2105

Lecture 1

51

Addressing:
Identify the source and
destination

CS2105

Lecture 1

52

Medium access control:

Regulate who sends

CS2105

Lecture 1

53

Consider multiple hosts connected

through intermediate packet
switches, which store and forward
the packets.

CS2105

Lecture 1

54

The Internet is a packet

switching network

CS2105

Lecture 1

56

Packet switching:
Resources used on demand;
best eort services

CS2105

Lecture 1

57

Circuit switching:
Resources are reserved,
guaranteeing services

CS2105

Lecture 1

58

Packet vs. Circuit Switching:

Which is more ecient?

CS2105

Lecture 1

59

Packet vs. Circuit Switching:

Which is more ecient?

.
.

Details about packet switching and circuit

switching is explained in Sections 1.3.1 and
1.3.2

Who owns the intermediate

packet switches on the
Internet?

CS2105

Lecture 1

61

The Internet is a
``network-of-networks'',
organized into autonomous
systems (AS), each is owned by
an organization.
CS2105

Lecture 1

63

The Internet is a
``network-of-networks'',
organized into autonomous
systems (AS), each is owned by
an organization.

.
.

To learn more about the architecture of the

Internet, read Section 1.3.3. The Internet
topology figure is taken from
http://www.caida.org/research/
topology/as_core_network/

traceroute

CS2105

Lecture 1

65

traceroute

.
.

You can also try to traceroute from other

locations on the Internet at
http://www.traceroute.org

Routing: Decide which

path/route to take

CS2105

Lecture 1

67

Reliability: Recover from

packet losses

CS2105

Lecture 1

68

Link Rate/Bandwidth:
How many bits can be
``pushed'' onto a link per unit
time.

CS2105

Lecture 1

69

Delay:
Time between send and
receive

CS2105

Lecture 1

70

To send a packet in a packet switch

network, for each link in the path
1. transmit packet onto the link as
bits
2. propagate bits to next node
3. store and process the packet
4. wait to be transmitted
CS2105

Lecture 1

71

End-to-end packet delay consists of:

1. transmission delay
2. propagation delay
3. processing delay
4. queueing delay

CS2105

Lecture 1

72

.
CS2105

Lecture 1

73

Throughput:
How many bits can be
communicated per unit time.

CS2105

Lecture 1

74

Multiple applications can run on each

host

CS2105

Lecture 1

75

Demultiplexing: Determine
which packet belongs to which
application

CS2105

Lecture 1

76

Many issues to consider, to support

dierent applications running on
large number of hosts through
dierent access technology and
physical media.

CS2105

Lecture 1

77

Layering:
Common CS trick to deal with
large and complex systems

CS2105

Lecture 1

79

Each layer provides a service;

Simple interfaces btwn layers;
Hide details from each other.

CS2105

Lecture 1

80

Each layer provides a service;

Simple interfaces btwn layers;
Hide details from each other.

.
.

The five layers of the Internet are described in

Section 1.5.

.
Application
Transport
Network
Link
Physical
CS2105

Lecture 1

82

Applications (or processes)

treat the Internet as a black
box, sending and receiving
messages through a socket.

CS2105

Lecture 1

83

Transport layer
provides process-to-process
message delivery services.

CS2105

Lecture 1

84

TCP
reliable, in-order delivery, with
congestion and flow control

CS2105

Lecture 1

85

UDP
best-eort delivery

CS2105

Lecture 1

86

Network layer
host-to-host delivery

CS2105

Lecture 1

87

Link layer
node-to-node delivery

CS2105

Lecture 1

88

Physical layer
``bits over physical media''

CS2105

Lecture 1

89