Objective of This

Tutorial
u To understand basic technologies that
Overview of Internet comprise an Internet architecture
Architecture
u To understand unique features of an
Internet architecture
Jun Murai
Keio Univ.
jun@wide.ad.jp
2002/8/5
2002/8/5 11 2002/8/5
2002/8/5 22

KEYWORDS AGENDA
u Best Effort u Introduction
u Scalability u Core technologies of the Internet
u Security
u Operating technologies of the Internet
u Operation
u Communication media and Internet
u Autonomy
architectures
u Distributed
u Technologies for environmental
u Exponential Growth
application
u End System
u Application architecture

2002/8/5
2002/8/5 33 2002/8/5
2002/8/5 44

7-phase Model of OSI Role of each OSI Layer(1)

u Scale for protocol design u Physical layer(No.1 layer)
u Simple separation and independence of functions
Ø Supply of direct connection to physical
u Pseudo--communication between n-
Pseudo n-layers at end
system level media
u Intermediate system only relays data among one to u Data link layer(No.2 layer)
three layers Ø Controls information flow in a portion to a
Application Application
next system of path to the destination
Presentation Presentation
system
Session Session
Transport Transport u Network layer(No.3 layer)
Network Network Network Ø Establishment of connection between end
Data link Data link Data link systems
Physical
2002/8/5 Physical Physical 55 2002/8/5 66
2002/8/5 2002/8/5

1
 Hierarchical Protocols OSI Model and Internet
u Transmission side：
side：Each layer hands Architecture
data by adding its information to the
lower layer
u Reception side ：Each layer hands data Application
by eliminating its information to the Presentation Application
upper layer Data to transmit Session
Protocol overhead Transport TCP UDP
Network IP
Data link Network Interface
Information for
Physical Physical
each layer

2002/8/5
2002/8/5 77 2002/8/5
2002/8/5 88

Communication form VC vs. DG type

u Virtual circuit type u Virtual circuit u Data gram
Ø Transmission through a virtual pipe Ø Reliability Ø Reliability not
Ø Guarantee of order guaranteed
Ø Connection type Ø Order not
Ø Flow control
guaranteed
Ø Congestion control
Ø No flow control
u Data gram type Ø Re--transmission
Re
Ø No congestion
Ø Data is divided into smaller parts and Ø Billing by weight control
transmitted separately Ø No re-
re-transmission
Ø Connection-- less type
Connection Ø Fixed billing

2002/8/5
2002/8/5 99 2002/8/5
2002/8/5 10
10

Line Switching System Packet Switching

System

B B
A A

Communication to A∼C Communication to A∼C

B performs line switching C Data is divided into packets C
Telephone switcher B performs packet switching
2002/8/5
2002/8/5 11
11 2002/8/5
2002/8/5 12
12

2
 Network Protocol
u Network layer
Ø IP - Internet Protocol
Core Technologies of u Transport layer
the Internet Ø TCP - Transport Control Protocol

Application Application

TCP UDP TCP UDP

IP IP IP
Network Interface Network Interface Network Interface
Physical Physical Physical
2002/8/5
2002/8/5 13
13 2002/8/5
2002/8/5 14
14

Functions of IP IP Address
u Identification of host u ３２ｂｉ ｔaddress space(IPv4）
space(IPv4）
Ø 32bit identifier 
identifier −IP
−IP address u ID to connect to a TCP/IP network
Ø One and only ID in the world
u Determination of a route Ø No duplication allowed
Ø Determine a route from part of IP address Ø Identifies the user and the other party
u Relaying data u Structured address
Ø Serial relay system Ø Consists of a network address to indicate a
u Dividing data network and a host address to indicate a
host
Ø Too large data is divided and re-
re- structured Ø Flexible structure with net mask
Ø Determines a route from the
2002/8/5 15 2002/8/5
network portion 16
2002/8/5 15 2002/8/5 16

IP Address and Net mask IP Work Flow

３２ｂｉｔ
Receives
Receivesdata
datafrom
fromaanetwork
network
Ｉ
Ｐaddress １０１１１０１１１０１０１０１１００１１０１０１１００１１０１０
Ｐaddress interface
interface
３２ｂｉｔ

１１１１１１１１１１１１１１１１１１１１１１１ ０００００００００
Net mask NO
NO
２３ｂｉ
ｔ Determines
Determines toto whom
whom Destination
Destination is
is me？
me？
data
data shall
shall be
be relayed
relayed
３２ｂｉｔ
Network YES
YES
１０１１１０１１１０１０１０１１００１１０１００００００００００
part
２３ｂｉ
ｔ Relays
Relays to
to an
an appropriate
appropriate Relays
Relaystotothe
theupper
upperlayer
layer
３２ｂｉｔ network
network interface
interface Checking
Checkingthe
thedestination
destinationport
port##
Host part ０００００００００００００００００００００００ １１００１１０１０
2002/8/5 ２３ｂｉ
ｔ 17 2002/8/5 18
2002/8/5 17 2002/8/5 18

3
 IP Header ICMP
u Internet Control Message Protocol
u Includes information required for delivery u Compensates functions of IP
of data gram
Ø Non- reachable to the destination, flow
Non-
Ø Transmitter address control
Ø Recipient address Ø Reports an error instead of IP
Ø Data gram length, ｅｔｃ．．．．
u Appended to each data gram Application

Ø It is not a Virtual Circuit

TCP UDP
IP ICMP
Network Interface
Physical
2002/8/5
2002/8/5 19
19 2002/8/5
2002/8/5 20
20

ICMP Message type Route Control

u Which path shall be used？
used？
u Echo replay Ø To which route the target host is
u Destination Unreachable connected？
connected ？
u Source Quench u Route control table
u Redirect Ø Used for selecting and controlling a route
u Echo request Ø Table that summarizes information which
host connects to which route（
route（routing
u Datagram time exceed information）
information ）
u Datagram parameter problem Ø This does not include not all hosts
Ø Network part of IP address
Ø Default route
2002/8/5
2002/8/5 21
21 2002/8/5
2002/8/5 22
22

Sample routing table RIP

nr60: {2} % netstat -rn
Routing tables
Routing Information Protocol
Internet: u Seeks for an optimum route from the transmitter
Destination Gateway Flags Refs Use Interface side to the destination
default 203.178.140.1 UG 7 35972 ef1
127 127.0.0.1 UR 0 0 lo0 u Simply counts networks that must be passed
127.0.0.1 127.0.0.1 UH 0 0 lo0 between the transmitter side and the destination
133.27.12.129 203.178.140.1 UGHc 1 120 ef1
133.27.171/24 203.178.140.1 UG 0 0 ef1 u The optimum route is the one that has the least
202.0.73 203.178.140.1 UG 0 0 ef1 number of hops
202.0.73.96/27 203.178.140.1 UG 0 0 ef1
202.0.73.128/27 203.178.140.1 UG 0 0 ef1 Ø Delay, reject or reliability is not considered
202.0.73.236/30 203.178.140.1 UG 0 0 ef1
203.178.138.18/30 203.178.141.9 UG 0 0 e f0
u A simple cost calculation(trigonometric inequality)
203.178.139.64/27 203.178.140.1 UG 0 0 e f1 to determine an optimum route
203.178.139.96/27 203.178.140.1 UG 0 0 e f1
203.178.139.128/27 203.178.140.1 UG 0 0 ef1
2002/8/5
2002/8/5 23
23 2002/8/5
2002/8/5 24
24

4
 OSPF Transport Layer
Open Shortest Path Find
u Connects data reached to the machine with the
corresponding application
u Routers within a given site share a same u ＴＣＰ
database.
u ＵＤＰ
u A Shortest 
Shortest Path Tree is formed using Application

this information.
TCP UDP
u Copes flexibly to changes of a network IP
Network Interface
Physical

2002/8/5
2002/8/5 25
25 2002/8/5
2002/8/5 26
26

Port Number Sample Port Number

u Host-to –host delivery of data at the
Host-
Connected to port #80 of www.sfc.wide.ad.jp
network layer
u Identification of an application within the % telnet www.sfc.wide.ad.jp 80
same host Trying 203.178.140.3 ...
Connected to enterprise.sfc.wide.ad.jp.
Ø Application- based allocation is required
Application- Escape character is '^]'.
GET /index.html
within one host <!DOCTYPE HTML PUBLIC " -//W3C//DTD HTML 3.2//EN">
<HTML>
u Application identifier <HEAD>
<TITLE>Tokuda, Murai, Kusumoto &amp; Nakamura Laboratory</TITLE>
Ø Protocol（ＴＣＰ・ＵＤＰ）
Protocol（ <LINK REV=MADE HREF="mailto:www-admin@sfc.wide.ad.jp">
<META HTTP -EQUIV="Content-Type" CONTENT="text/html; charset=ISO-
Ø Port number（
number（unique to protocol）
protocol） 2022-JP">
</HEAD>
<BODY BGCOLOR="#D6AF85">
2002/8/5
2002/8/5 27
27 2002/8/5
2002/8/5 28
28

TCP
Transmission Control Protocol
u Performs data transmission controls
u Supply of Datagram type communication
Ø IP is a Datagram type communication
u Specific features include......
Ø Datagram type communication requires no new Ø Adds reliability to IP
functions Ø Virtual Circuit type communication
Ø Transport layer identifies applications Ø Error detection and error correction
Ø Identifier is sufficient for identification Ø Flow control
Ø Re--structuring of orders
Re
Ø Supplies data transmission interface

2002/8/5
2002/8/5 29
29 2002/8/5
2002/8/5 30
30

5
 End of Connection
Connection Start u Connection is ended with a FIN  Flag
Transmitter Recipient u Connection may be ended for each side

SYN SEQ=812 No ACK FIN SEQ=457

SEQ=812
SEQ=123
SEQ=789 ACK=458
SYN SEQ=123 ACK=813 SEQ=123
FIN SEQ=790
SEQ=813
ACK=124 SEQ=813 ACK=124 SEQ=458 ACK=791
ACK=813

2002/8/5
2002/8/5 31
31 2002/8/5
2002/8/5 32
32

Data Transmission Flow Control

u What is flow control？
control ？
u Guarantees data sequence with Sequence Number and
Acknowledge Number Ø Transmission to the recipient’
recipient’s capacity
u Next data is sent when ACK is returned Ø Transmission to the network’
network’s capacity
u Previous data is re-
re-transmitted if ACK is not returned u Mechanism for flow control
Ø Window system
SEQ=231 DATA u Determination of a window size
Ø Recipient determines the size appropriate for
SEQ=456 ACK=232 its capacity
SEQ=232 DATA Ø Transmitter determines the size by judging
network status
Ø Optimum value = Communication
2002/8/5
2002/8/5 33
33 2002/8/5
2002/8/5
route band* RTT 34
34

Window Control Slow Start

u To synchronize packet speed to be set to the
u System to determine a margin for delay network with that of ACK returned from the
u Limits number of packets to be sent other end
u Adds another window to the recipient’
recipient’s TCP
SEQ=238
SEQ=270 Ø Congestion window(cwnd)
４ SEQ=302 ４ u New connection established
SEQ=334
ACK=335 u Initializes congestion window into one segment
u Congestion window increases by one segment
each time ACK is received

2002/8/5
2002/8/5 35
35 2002/8/5
2002/8/5 36
36

6
Congestion control rule１
rule１：Judge from reply Congestion control rule2：
rule2：
Make traffic smaller when congested

Early reply→
reply→ less congested→
congested→transmit more Slow reply
reply→→congested
congested→→ transmit only
a small amount
2002/8/5
2002/8/5 37
37 2002/8/5
2002/8/5 38
38

Congestion control rule2：

rule2： Congestion control rule3：
rule3：
Make traffic smaller when congested Don’’t make haste even in light traffic
Don

No reply→
reply→congested
congested→→transmit only Early reply→
reply→ less congested→
congested→transmit slowly
a small amount
2002/8/5
2002/8/5 39
39 2002/8/5
2002/8/5 40
40

TCP Communication Model Operation Technology

u Change in window size u DNS
u To equilibrium via slow start u DHCP
u Equilibriumー
Equilibrium ーPackets are lost at a u Quality assurance
constant interval
u Security technology

2002/8/5
2002/8/5 41
41 2002/8/5
2002/8/5 42
42

7
 Names & IP Address DNS
u Computer is suited to handle numerical data
Domain Name System
Ø Computers only require addresses u Manages host names (Ex: mail0.sfc.keio.ac.jp) &
u Man is not good at handling numerical data IP addresses(Ex: 133.200.113.5) mapping
Ø Distributed database of host names & IP
Ø Names are easier to handle than numerical
addresses
data
Ø Has information on all hosts in the world
u Names
Ø May be searched from anywhere in the world
Ø Host names (Ex：
(Ex：mail0 )
Ø Management of hierarchical master information
Ø Organization names （Ex
Ex：
：sfc.keio.ac.jp) Ø Server：
Server ：Data form and how to respond
Ø Client：
Client：Contact information and how to contact

Structure of ＤＮＳ DHCP

u Dynamic Host Configuration Protocol
u RFC2131
ｊ
ｐ ｅｄｕ u Protocol to automatically structure host
mainly to be dynamically
Needs
Needsconnection
connection
ａｄ ａｃ ｃｍｕ ｓｔａｎｆｏｒｄ DHCP
to
toNetwork
Network
DHCP Server
Server
DHCPDISCOVER
DHCPDISCOVER

ｗｉｄｅ ｋｅｉ
ｏ ｊ
ａｉｓ
ｔ ｃｓ ｌｅｌａｎｄ ｓｒ DHCPOFFER
DHCPOFFER DHCP
DHCP Client
Client
DHCPREQUEST
DHCPREQUEST
DHCPACK
DHCPACK
ｓｆ
ｃ ｍａｇ Notifies
Notifies network
network addresses,
addresses, etc.
etc.
2002/8/5
2002/8/5 46
46

QoS Intelligence
Quality of Service
toward outside
End system-
system- oriented End
u Quality End Edge system-
system- oriented
Ø Guarantee of “ reachability
reachability””
Ø Guarantee of band width
Ø Guarantee of delay
u Priority-- based control
Priority Core Core
routers routers

Edge Edge

2002/8/5
2002/8/5 47
47 2002/8/5
2002/8/5 48
48

8
 Causes of slow Internet Causes of slow Internet
u Delay in reply u Delay in reply
Ø The other party is slow Ø The other party is slow
Ø Route is slow in the middle of it Ø Route is slow in the middle of it
u When the other party is slow u When the other party is slow
Ø The other party is overloaded Ø The other party is overloaded
Ø Too many accesses Ø Too many accesses
Ø Insufficient process capacity Ø Insufficient process capacity
u When route is slow in the middle u When route is slow in the middle
Ø Overflow is occurring in some queue Ø Overflow is occurring in some queue
2002/8/5
2002/8/5 49
49 2002/8/5
2002/8/5 50
50

Differentiated Service Random Early Detection

u Conventional Internet （RED
RED） ）
Ø Best effort Explicit Congestion Notification
Efforts are made to reach
Ø
（ECN
ECN） ）
Ø No load on the core system
u Service guarantee system If
If congestion
congestion reaches
reaches here‥
here‥
Ø Guarantees contracted services
Ø Greater load on the core system u Discard some pieces of data
u Future Internet u Mark some pieces of data
Ø Best effort＋
effort＋DiffServe Ø End system detects it
Ø Supply prioritized services without Ø Process speed decreases
putting load on the core system
2002/8/5
2002/8/5 51
51 2002/8/5
2002/8/5 52
52

Priority Service Premium Service

Discard those with Another queue

lower priorities！
priorities！ based on priority
2002/8/5
2002/8/5 53
53 2002/8/5
2002/8/5 54
54

9
 RED
Random Early Detection
u Technology to guarantee transmission of
traffics with higher priority by decreasing Communication media
congestion by delaying less prioritized and Internet
traffics when loads on the router
increases architecture
u Marks or rejects packets in queue
according to their priorities

2002/8/5
2002/8/5 55
55 2002/8/5
2002/8/5 56
56

10