Professional Documents
Culture Documents
Ch1-Overview of Networking Basics
Ch1-Overview of Networking Basics
Networking basics
Course Objective
A strong foundation of basic networking concepts is
fundamental to a successful career in information
technology. Networking technologies underlie all IT
activities and a strong comprehension of the hardware
and protocols used to create networks is essential to
future success.
Absenteeism
More than 3 absences not allowed to enter the
exam.
Absence in a quiz could not retake the quiz.
Define a network.
Classify networks.
List major ressource sharing functions of the network.
Describe the applications requirements from the
network
Understand the characteristics of a network
Branch
Office Floor 2
Server Farm
ISDN
Telecommuter Floor 1
Remote Campus
Network Topology
Network topology defines the structure of the network.
Physical topology, which is the actual layout of the wire or media.
Logical topology, which defines how the media is accessed by the
hosts for sending data.
The logical topology of a network is how the hosts communicate
across the medium.
The two most common types of logical topologies are broadcast and
token passing.
Network Resource Sharing
Telecommunication
networks
Circuit-switched Packet-switched
networks networks
• Types of Multiplexing
Example: 4 users
FDM
Frequency
time
TDM
Frequency
time
Synchronous TDM
Time slot
Transmission period
Synchronous TDM with empty time slots
Asynchronous TDM
b- Packet Switching
1.5 Mb/s
B
queue of packets
waiting for output
link
D E
Sequence of A & B packets does not have fixed pattern
statistical multiplexing.
Packet Switching
• The goal of packet switching is to move packets through routers
from source to destination
-- Datagram Approach
-- Virtual Circuits Approach
Packet Switching - Datagram
Packet Switching - Datagram
• Datagram Approach:
-- Each packet is treated independently
-- No reference to packets that have gone before
-- Each node chooses next node on path using destination address
-- Packets with same destination address may not follow same route
-- Packets may arrive out of sequence, may be lost
-- It is up to receiver to re-order packets and recover from lost packets
-- No Call setup
-- For an exchange of a few packets, datagram quicker
Analogy: driving, asking directions
Packet Switching – Virtual Circuits
Call set up
Flexibility
Reliability
• Path • Route
– A dedicated path is – No dedicated path is
established between two established. Only a route
devices for the duration is defined. Each switch
of session. creates an entry in its
routing table for the
• Reserved Resources duration of virtual
circuit
– The link (multiplexed /
not multiplexed) that • Shared Links
makes the path are – The link that makes a
dedicated, and cannot route can be shared by
be used by other other connections
connections
Network Components
Bandwidth is finite
the bandwidth of a modem is limited to about 56 kbps by
both the physical properties of twisted-pair phone wires and
by modem technology
Bandwidth is not free
For WAN connections bandwidth is purchased from a
service provider
A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per
minute with each frame carrying an average of 10,000 bits. What is the throughput of this
network?
Solution
We can calculate the throughput as
What is the propagation time if the distance between the two points is 12,000 km?
Assume the propagation speed to be 2.4 × 108 m/s in cable.
Solution
We can calculate the propagation time as
The example shows that a bit can go over the Atlantic Ocean in only 50 ms if there is a
direct cable between the source and the destination.
Example 3
What are the propagation time and the transmission time for a 2.5-kbyte message (an e-
mail) if the bandwidth of the network is 1 Gbps? Assume that the distance between the
sender and the receiver is 12,000 km and that light travels at 2.4 × 108 m/s.
Solution
We can calculate the propagation and transmission time as shown on the next slide:
Example 3
Note that in this case, because the message is short and the bandwidth is high, the
dominant factor is the propagation time, not the transmission time. The transmission time
can be ignored.
Example 4
What are the propagation time and the transmission time for a 5-Mbyte message (an
image) if the bandwidth of the network is 1 Mbps? Assume that the distance between the
sender and the receiver is 12,000 km and that light travels at 2.4 × 108 m/s.
Solution
We can calculate the propagation and transmission times as shown on the next slide.
Example 4 (continued)
Note that in this case, because the message is very long and the bandwidth is not very
high, the dominant factor is the transmission time, not the propagation time. The
propagation time can be ignored.
Characteristics of a Network
Speed: Speed is a measure of how fast data is
transmitted over the network. A more precise term
would be data rate.
Multiplexing (sharing)
Shared use of a single communication channel
Existing networks (interconnection)
The Design Goals of the Internet
• Interconnection/Multiplexing (packet switching)
• Resilience/Survivability (fate sharing)
• Heterogeneity Decreasing
• Different types of services Priority
• Different types of networks
• Distributed management
“This set of goals might seem to be nothing more than a
• Cost effectiveness checklist of all the desirable network features. It is
important to understand that these goals are in order of
• Ease of attachment importance, and an entirely different network
architecture would result if the order were
• Accountability changed.”
Packet Switching
• No connection setup
• Forwarding based on destination address in packet
• Efficient sharing of resources
• The Internet is a Datagram network
Decisions:
• Network provides minimal functionality
• “Narrow waist”
email WWW phone... Applications
SMTP HTTP RTP...
TCP UDP…
IP
ethernet PPP…
192.168.1.51 68.211.6.120:50878
Home
Internet
Network 192.168.1.52 68.211.6.120:50879
Goal #2: Survivability
Many examples:
Addressing (MAC, IP, E-mail)
Though this was recently threatened.
Naming (DNS)
1. Internet Address
2. Age (TTL)
3. Checksum to protect header
Data Header
payload
01000111100010101001110100011001 header
What’s next?