University Institute of Engineering

DEPARTMENT OF COMPUTER SCIENCE

& ENGINEERING
Bachelor of Engineering (Computer Science & Engineering)
Subject Name:Computer Network
Subject Code: 21CSH-256/ 21ITH-256

DISCOVER . LEARN . EMPOWER

 Syllabus
UNIT-I
Introduction: Introduction to network, types of transmission technologies, Network Categories: LAN, MAN, WAN (Wireless /Wired),
Network Software: Concept of Layers, Protocols, interfaces and services. Reference Models: OSI, TCP/IP and comparison, Concept of
Topologies.
Physical Layer: Bit rate, Baud rate, Bandwidth, Transmission Impairments: Attenuation, Distortion, Noise; Data rate limits: Nyquist
formula, Shannon Formula, Modulation & modems; Transmission Modes, Multiplexing: Frequency Division, Time Division, Wavelength
Division; Transmission Media: Twisted pair, coaxial, fiber optics, Wireless Transmission (radio, microwave & infrared);Message
switching, Circuit Switching & Packet Switching.
UNIT-II
Data Link Layer: Design issues, Error Detection & Correction; Flow control & Error Control; Sliding Window Protocols, ARQ: Stop &
Wait , Go Back n, Selective Repeat ; Examples of DLL protocols – HDLC, PPP; Medium Access Sub layer: Channel Allocation; Random
Access: ALOHA, CSMA protocols; Controlled Access: Polling, Reservation, Token Passing; Examples of IEEE
standards(802.2,802.3,802.4, 802.5), Basics of Wi-Fi(802.11).Network Layer: Design issues, Logical Addressing: IPv4 & IPv6; Packet
Formats & their comparison IPv4 & IPv6; Routing Algorithms: Distance Vector, Link State
UNIT-III
Network Layer(Continue): Congestion Control: Principles of congestion control; Congestion prevention policies, Leaky bucket & Token
Bucket Algorithms.
Transport Layer: Services provided to upper layers, Elements of Transport protocols. Addressing, Flow Control & buffering; Example
Transport protocols: TCP, SCTCP & UDP.
Application Layer and Network Security: Domain Name System, Simple Network Management Protocol, Electronic Mail, World Wide
Web, Basics of authentication, Public and Private Key Cryptography, Digital Signatures and Certificates, Firewalls.
Multiple Access
 The Channel Allocation Problem
Channel allocation is a process in which a single channel is divided and
allotted to multiple users in order to carry user specific tasks.
•If there are N number of users and channel is divided into N equal-sized sub channels,
Each user is assigned one portion.
•If the number of users are less and don’t vary at times, than Frequency Division
Multiplexing can be used as it is a simple and efficient channel bandwidth allocating
technique.
• Static Channel Allocation in LANs and MANs
• It is the classical or traditional approach of allocating a single channel among multiple
competing users. If there are N users, the bandwidth is divided into N equal sized portions
each user being assigned one portion. since each user has a private frequency band, there
is no interface between users.
• Dynamic Channel Allocation in LANs and MANs(continued…)
 Dynamic Channel Allocation in LANs and MANs
Possible assumptions include:
• Station Model:
Assumes that each of N stations independently
produce frames. The probability of producing a
packet in the interval ID t where I is the
constant arrival rate of new frames.
• Single Channel Assumption:
In this allocation all stations are equivalent and
can send and receive on that channel.
• Collision Assumption:
If two frames overlap in time-wise, then that’s
collision. Any collision is an error, and both
frames must re transmitted. Collisions are only
possible error.
• Time can be divided into Slotted or Continuous.
• Stations can sense a channel is busy before
they try it.
Protocol Assumption:
• N independent stations.
• A station is blocked untill its generated
frame is transmitted.
• probability of a frame being generated in
a period of length Dt is IDt where I is the
arrival rate of frames.
• Only a single Channel available.
• Time can be either: Continuous or slotted.
• Carrier Sense: A station can sense if a
channel is already busy before
transmission.
• No Carrier Sense: Time out used to sense
loss data.
 RANDOM ACCESS

In random access or contention methods, no station is superior to

another station and none is assigned the control over another. No station
permits, or does not permit, another station to send. At each instance, a
station that has data to send uses a procedure defined by the protocol to
make a decision on whether or not to send.
Topics discussed in this section:

ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision Detection
Carrier Sense Multiple Access with Collision Avoidance
ALOHA Network
Frames in Pure ALOHA
ALOHA Protocol
ALOHA: Vulnerable Time
ALOHA: Throughput
• Assume number of stations trying to transmit follow Poisson
Distribution
• The throughput for pure ALOHA is
S = G × e−2G
where G is the average number of frames requested per frame-time
• The maximum throughput
• Smax = 0.184 when G= 1/2
Example
• A pure ALOHA network transmits 200-bit frames on a shared channel
of 200 kbps. What is the throughput if the system (all stations
together) produces
• 1000 frames per second
• 500 frames per second
• 250 frames per second
Slotted ALOHA
Slotted ALOHA: Vulnerable Time
Slotted ALOHA: Throughput
• The throughput for Slotted ALOHA is

S = G × e−G

where G is the average number of frames requested per frame-time

• The maximum throughput
• Smax = 0.368 when G= 1
Example
• A Slotted ALOHA network transmits 200-bit frames on a shared
channel of 200 kbps. What is the throughput if the system (all stations
together) produces
• 1000 frames per second
• 500 frames per second
• 250 frames per second
CSMA
• Carrier Sense Multiple Access
• "Listen before talk"
• Reduce the possibility of collision
• But cannot completely eliminate it
Collision in CSMA

C
CSMA: Vulnerable Time
Persistence Methods
• What a station does when channel is idle or busy
Persistence Methods
CSMA/CD
• Carrier Sense Multiple Access with Collision Detection
• Station monitors channel while sending a frame
Energy Levels
CSMA/CD: Minimum Frame Size

• Each frame must be large enough for a sender to detect a collision

• Worst case scenario:
• "A" is transmitting
• "D" starts transmitting just before A's signal arrives
A B C D

Long enough to
hear colliding signal
from D
Example
• A CSMA/CD network has a bandwidth of 10 Mbps. If the maximum
propagation time is 25.6 μs, what is the minimum size of the frame?
CSMA/CD: Flow Diagram
 CONTROLLED ACCESS

In controlled access, the stations consult one another to find which

station has the right to send. A station cannot send unless it has been
authorized by other stations. We discuss three popular controlled-access
methods.

Topics discussed in this section:

Reservation
Polling
Token Passing
Reservation access method
Select and poll functions in polling access method
Logical ring and physical topology in token-passing access method
References
• https://www.tutorialspoint.com/multiple-access-protocols-in-comput
er-networks
• https://www.studytonight.com/post/random-access-protocols-aloha-
csma-csmaca-and-csmacd
• http://highered.mheducation.com/sites/0072967757/student_view0/
chapter12/powerpoint_slides.html
• Data Communications and Networking Book by Behrouz A. Forouzan