Scribd
Upload
9 views20 pages

Networking Architecture Overview Lecture

Computer networking

Uploaded by

Theophilus Oduro-Nyarko
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views20 pages

Networking Architecture Overview Lecture

Computer networking

Uploaded by

Theophilus Oduro-Nyarko
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

COE 475: Computer Networking

Lecture1: Computer Networking: An Overview


Lecture Objective
• Students should understand basic networking
terminology and concepts
– end systems
– access and core network
– protocols
– etc.
Computer Networks
• Computer networks can be described in two ways
– Hardware/software component description
– As an infrastructure that provides services to distributed
applications
Hardware/software description
Network edge
• end systems (hosts):
– run application programs
• e.g. Web, email
– at “edge of network”
Access networks
• Connecting end systems
to edge router
– residential access nets
• Dial-up, DSL, Cable
– institutional access
networks (school, company)
• Ethernet, Wi-Fi
– mobile access networks
Network Core
• mesh of interconnected
routers
• basically concerned with
– how is data moved through a
network of links and routers?
– circuit switching:
• Resources needed along a path
are reserved
– telephone network
– packet-switching:
• Resources needed along a path
are NOT reserved
Circuit Switching
End-to-end resources reserved
for information transfer
– dedicated resources: no sharing
• link bandwidth divided
– frequency division
– time division
• resource piece idle if not used
– guaranteed performance
– call setup required
Packet Switching
each end-to-end data stream divided into packets
– user A and user B packets share network resources
– each packet uses full link bandwidth
– resources used as needed
Packet Switching: Statistical Multiplexing
100 Mb/s
A Ethernet statistical multiplexing C

1.5 Mb/s
B
queue of packets
waiting for output
link

D E

Sequence of A & B packets doe not have fixed pattern,


bandwidth shared on demand  statistical multiplexing.
Computer Networks : a service view
• Software pieces running on
– different end systems need to send
data to each other
• end systems provide an Application
Programming Interface (API) that
– specifies how a software piece asks the
network to deliver data to a specific
destination software
• Computer networks viewed as
– communication infrastructure
• that provides services to distributed
applications:
– email, Web, VoIP, P2P file sharing
– communication services provided to
apps:
• reliable data delivery
• Throughput
• Timing
• security
Delay, Loss and Throughput
• Ideally we would like computer networks to be able to
move data
– as much as we want (throughput)
– instantaneously (no delay)
– without any loss (no packet loss)
• However, computer networks necessarily
– constrain throughput (amount of data per second that can be transferred)
– introduce delay
– lose packets
• There are many issues
– surrounding how to deal with these problems
How do loss and delay occur?
• If packet arrival rate to a link exceeds the output link
capacity
• packets are queued in router buffers
– to wait for turn of transmission
packet being transmitted

B
packets queued (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Four sources of packet delay
• 1. nodal processing: • 2. queuing
– check bit errors – time waiting at output link
– determine output link for transmission
• depends on congestion
level

transmission
A propagation

B
nodal
processing queuing
Delay in packet-switched networks
3. Transmission delay: 4. Propagation delay:
– R=link bandwidth (bps) – d = length of physical link
– L=packet length (bits) – s = propagation speed in
– time to send bits into link medium (~2x108 m/sec)
= L/R – propagation delay = d/s

transmission
A propagation

B
nodal
processing queuing
Nodal delay
d nodal d proc  d queue  d trans  d prop

• dproc = processing delay


– typically a few microsecs or less
• dqueue = queuing delay
– depends on congestion
• dtrans = transmission delay
– = L/R, significant for low-speed links
• dprop = propagation delay
– a few microsecs to hundreds of msecs
Packet loss
• buffer preceding link has finite capacity
• packet arriving to full queue dropped (aka lost)
• lost packet may be retransmitted by previous node, by
source end system, or not at all

buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost
Throughput
• throughput:
– rate (bits/time unit) at which bits are moved
between sender and receiver
– instantaneous:
• rate at given point in time
– average:
• rate over longer period of time
Network Protocols
• All activities in computer networks that
– involve two or more communicating remote entities is
• governed by a protocol
• Protocols
– control sending and receiving of messages
– define
• format and order of messages sent and received among network
entities
• actions taken on message transmission/receipt
Review Questions
• What do you understand by the term network protocol
• What are the five layers in the Internet protocol stack
– What are the principal responsibilities of each layer
• What is
– An application layer message
– A Transport layer segment
– A network layer datagram
– A link layer frame
• List the various delay components in a packet-switched network

You might also like