Escolar Documentos
Profissional Documentos
Cultura Documentos
Stan Kurkovsky
Network layer
transport segment from sending to
receiving host
on sending side encapsulates
segments into datagrams
on rcving side, delivers segments
to transport layer
network layer protocols in every
host, router
Router examines header fields in
all IP datagrams passing through it
application
transport
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
network
data link
physical
application
transport
network
data link
physical
Stan Kurkovsky
0100
0101
0111
1001
3
2
2
1
packets header
0111
Routing algorithms
analogy: process of
getting through single
interchange
1
3 2
Stan Kurkovsky
Stan Kurkovsky
Network
Architecture
Internet
Service
Model
Guarantees ?
Congestion
Bandwidth Loss Order Timing feedback
ATM
CBR
ATM
VBR
ATM
ABR
ATM
UBR
constant
rate
guaranteed
rate
guaranteed
minimum
none
no
no
no
yes
yes
yes
yes
yes
yes
no
yes
no
no (inferred
via loss)
no
congestion
no
congestion
yes
no
yes
no
no
Stan Kurkovsky
Stan Kurkovsky
Virtual circuits
source--tosource
to-dest path behaves much like telephone circuit
performanceperformance-wise
network actions along sourcesource-toto-dest path
call setup, teardown for each call before data can flow
each packet carries VC identifier (not destination host address)
every router on sourcesource-dest path maintains state for each passing
connection
link, router resources (bandwidth, buffers) may be allocated to VC
A VC consists of:
1. Path from source to destination
2. VC numbers, one number for each link along path
3. Entries in forwarding tables in routers along path
Forwarding table
VC number
22
12
32
interface
number
Forwarding table in
northwest router:
Incoming interface
Incoming VC #
1
2
3
1
12
63
7
97
Outgoing interface
Outgoing VC #
3
1
2
3
22
18
17
87
application
transport 5. Data flow begins
network 4. Call connected
data link 1. Initiate call
physical
data link
physical
Stan Kurkovsky
Datagram networks
no call setup at network layer
routers: no state about endend-toto-end connections
no networknetwork-level concept of connection
application
transport
network
data link 1. Send data
physical
application
transport
2. Receive data network
data link
physical
Stan Kurkovsky
Forwarding table
Link Interface
otherwise
Stan Kurkovsky
Link Interface
0
1
2
3
Examples
DA
DA:: 11001000 00010111 00010110
00010110 10100001
DA
DA:: 11001000 00010111 00011000
00011000 10101010
Stan Kurkovsky
Internet
ATM
Stan Kurkovsky