Computer Communication Networks

B.
TECH ELECTRONICS AND

COMMUNICATION ENGINEERING
U20ECCJ09/ COMPUTER COMMUNICATION

NETWORKS
COURSE FILE
1.VISION AND MISSION OF THE INSTITUTE
The Vision of the University:

Bharath Institute of Higher Education & Research (BIHER) envisions and constantly strives to
provide an excellent academic and research ambience for students and members of the faculties to
inherit professional competence along with human dignity and transformation of community to keep
pace with the global challenges so as to achieve holistic development.
The Mission of the University
To develop as a Premier University for Teaching, Learning,

University Mission
(UM1) Research and Innovation on par with leading global universities.
To impart education and training to students for creating a better

University Mission
(UM2) society with ethics and morals.
To foster an interdisciplinary approach in education, research and

University Mission
(UM3) innovation by supporting lifelong professional development,
enriching knowledge banks through scientific research, promoting
best practices and innovation, industry driven and institute-oriented
cooperation, globalization and international initiatives.
To develop as a multi-dimensional institution contributing

University Mission
(UM4) immensely to the cause of societal advancement through spread of
literacy, an ambience that provides the best of international
exposures, provide health care, enrich rural development and most
importantly impart value-based education.
To establish benchmark standards in professional practice in the

University Mission
(UM5) fields of innovative and emerging areas in engineering,
management, medicine, dentistry, nursing, physiotherapy and allied
sciences.
To imbibe human dignity and values through personality

University Mission
(UM6) development and social service activities.
BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

Bharath Institute Of Higher Education and Research (BIHER)IQAC/ACAD/005
2.Vision and Mission of the Department
The Vision of the Department:

Department of Electronics and Communication Engineering envisions with innovation in
academics to inherit the professional competence along with cognitive skills and research ability
to meet industrial standards and to cater the societal needs by embedding in teaching and learning
The Mission of the Department
To inherit the professional competence among the Electronics and

School/Departm
Communication Engineering students.
ent Mission(M1)
To enable the students to develop cognitive skills to meet the

School/Departme
multidimensional technological problems of current environment.
nt Mission(M2)
To establish the learning environment to enable the students to meet the

School/Departme
industrial standards.
nt Mission(M3)
To inculcate the faculty and students to enrich research in societal needs.
School/Departm
ent Mission(M4)

3.PROGRAM EDUCATIONAL OBJECTIVES(POs)
Programme Educational Objects (PEO)
PREPARATION
PEO1
To offer students with strong foundation in Electronics and Communication
Engineering required framing, analyzing, and understanding the fundamental concepts
essential to observe, resolve and evaluate the multidimensional engineering problems
and prepare them to meet industry, higher education and Research
CORE COMPETENCE
PEO2
To apply circuit analysis, design, hardware & assembly language programming skills,
to find, solve, and analyze electronics and communication engineering problems,
experimental evaluation, decision making along with cognitive knowledge and be able
to adapt this knowledge in industry, higher education and research.
PROFESSIONALISM
PEO3
To develop an attitude for life-long learning and adapt new ideas as the electronics
and communication engineering evolves. To offer broaden knowledge and establish
themselves as creative professionals.
SKILL
PEO4
To provide a learning environment to become innovators / scientists with good
technical, cognitive skills to become an efficient technical team-member and team
leader with innovative ideas required for industrial development and research.
ETHICS
PEO5
To possess leadership qualities with ethical value to work efficiently in diverse teams,
societal needs, promote and practice ethical standards.

3.PROGRAM EDUCATIONAL OBJECTIVES(POs)
Programme Educational Objects (PEO)
PREPARATION
PEO1
To offer students with strong foundation in Electronics and Communication
Engineering required framing, analyzing, and understanding the fundamental concepts
essential to observe, resolve and evaluate the multidimensional engineering problems
and prepare them to meet industry, higher education and Research
CORE COMPETENCE
PEO2
To apply circuit analysis, design, hardware & assembly language programming skills,
to find, solve, and analyze electronics and communication engineering problems,
experimental evaluation, decision making along with cognitive knowledge and be able
to adapt this knowledge in industry, higher education and research.
PROFESSIONALISM
PEO3
To develop an attitude for life-long learning and adapt new ideas as the electronics
and communication engineering evolves. To offer broaden knowledge and establish
themselves as creative professionals.
SKILL
PEO4
To provide a learning environment to become innovators / scientists with good
technical, cognitive skills to become an efficient technical team-member and team
leader with innovative ideas required for industrial development and research.
ETHICS
PEO5
To possess leadership qualities with ethical value to work efficiently in diverse teams,
societal needs, promote and practice ethical standards.

4.PROGRAM OUTCOMES(POs)
Programme Outcomes
Engineering Knowledge: Apply the knowledge of mathematics, science, and
PO1
engineering fundamentals for understanding the domain of Electronics and
Communication Engineering
Problem Analysis: Identify, formulate, review research literature, and analyze

PO2
complex engineering problems reaching substantiated conclusions using first principles
of mathematics, natural sciences and engineering sciences.
Design/Development of Solutions: Design solutions for complex Electronics and

PO3
Communication System, component or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental Considerations.
Conduct Investigations of Complex Problems: Use research-based knowledge and

PO4
research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions for complex problems.
Modern Tool Usage: Create, select, and apply appropriate techniques, resources, and
PO5
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations
The Engineer and Society: Apply reasoning informed by the contextual knowledge to
PO6
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
Environment and Sustainability: Understand the impact of the professional

PO7
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities
PO8
and norms of the engineering practice.
Individual and Team Work: Function effectively as an individual, and as a member

PO9
or leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with

PO10
the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
Project Management and Finance: Demonstrate knowledge and understanding of the

PO11
engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments
Life-long Learning: Recognize the need for, and have the preparation and ability to
PO12
engage in independent and lifelong learning in the broadest context of technological
change.
(** PO – Based on Accreditation Agency /UGC)

CO-PO MAPPING
List of PSOs:
PSO 1 : Design, specify, test and evaluate modern electronic systems that perform analog and digitaloperations
using integrated circuits.
PSO2:Design, analyse the concepts in the field of wireless communication, networking with relatedapplications
and to develop solutions for problems of social relevance
PSO3:Design, specify, test, evaluate and analyse the concepts of digital signal processor andapplications in the
field of image processing ,VLSI and Embedded Systems

Profile of an Individual Course
PART A- INTRODUCTION OF THE COURSE
Introduction to the Course:

The technologies related to data communication and networking may be the fastest growing in
today’s culture. This course helps the students to understand the analysis and performance
evaluation of computer through an understanding of their architectures and protocols and also it
helps in the context of current internet solutions of TCP, IP and future open problems and possible
solutions.
Course Course Course Title L T P C

Code Category 2 0 2 3
COMPUTER COMMUNICATION Pre-requisite:
U20ECCJ09 PC
NETWORKS U20ECCJ05
Name Of the Course
Dr.F.Vincy Lloyd Contact Hrs: 60
Coordinator:
Course Offering
ECE/School of Electrical Engineering Total Marks :100
Department/School:
Course Objective and Summary

 The students of ECE will be able to acquire knowledge on basics of data communications
and networking, and the protocols used in the internet, in particular by using the protocol
layering of the internet and TCP/IP protocol suite.
 This course also gives the important concepts and techniques related to data
communication and enable students to maintain and troubleshoot computer networks
through the practical of the course.
Course Outcomes (Cos)

Blooms
CO Description Taxonomy
Level
Understand the protocols and services of computer communication
CO1 2
networks.
CO2 Apply the random access and channelization concepts. 3
CO3 Outline the Wired and Wireless LAN Concepts. 2
Identify the basic network configurations and standards associated
CO4 3
with each network.
Explain the protocols and functions associated with the transport
CO5 2
layer services.
CO6 Implement the Protocols in the computer networks by using
B
appropriate tools.
Mapping / Alignment of Cos with PO & PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
- - - - - - - - - 3
CO1 3 1 3 2 2
- - - - - - - - - 3
CO2 3 2 2 2 3
- - - - - - - - - 2
CO3 3 2 3 - 2
- - - - - - - - - 3
CO4 3 3 2 3 3
- - - - - - - - - 3
CO5 3 2 2 - 3
- - - - - - - - 3
CO6 2 2 3 3 3 3
(Tick mark or level of correlation: 3-High, 2-Medium, 1-Low)
PART B- Content of the Course
TOTAL HOURS: 30
UNIT 1 INTRODUCTION TO DATA COMMUNICATIONS 6
Components-Data Representation-Data Flow, NETWORKS: Distributed Processing- Network
Criteria-Physical Structures-Network Models-Categories of Networks, Inter connection of
Networks- Internetwork, Internet: Protocols-Standards-Standards Organizations.
UNIT 2 MULTIPLE ACCESS CONTROL 6

RANDOM ACCESS: ALOHA- Carrier Sense Multiple Access(CSMA)-Carrier Sense Multiple
Access with Collision Detection(CSMAlCD)- Carrier Sense Multiple Access with Collision
Avoidance (CSMAlCA), CONTROLLED ACCESS: Reservation- Token Passing,
CHANNELIZATION: Frequency-Division Multiple Access (FDMA)- Time-Division Multiple
Access (TDMA)- Code-Division Multiple Access (CDMA).
UNIT 3 WIRED A N D WIRELESS LANS 6

WIRED LANS: Ethernet, Ethernet Protocol: IEEE802- Data Link Layer- Physical Layer,
STANDARD ETHERNET: MAC Sub layer- Physical Layer, CHANGES IN THE STANDARD:
Bridged Ethernet Switched Ethernet-Full-Duplex Ethernet, FAST ETHERNET: MAC Sub layer-
Physical Layer
WIRELESS LANS: IEEE 802.11- Architecture- MAC Sub layer- Addressing Mechanism- Physical
Layer. BLUETOOTH: Architecture
UNIT 4 NETWORK LAYER PROTOCOLS 6

Internet Protocol (IP): Datagram Format- Fragmentation-Options- Security of IPv4 Datagrams,
ICMPv4: Messages- Debugging Tools- Mobile IP: Addressing- Agents- Three Phases- Inefficiency
in Mobile IP, Unicast Routing: Introduction- Routing Algorithms- Distance Vector Routing- Link
State Routing- Path vector routing, Unicast Routing Protocol: Internet Structure- Routing
Information Protocol- Open Shortest Path First- and Border Gateway Protocol Version 4.
UNIT 5 TRANSPORT LAYER 6

Introduction: Transport Layer Services- Connectionless and Connection Oriented Protocols,
Transport Layer Protocols: Simple protocol- Stop and wait protocol- Go-Back-N Protocol-
Selective repeat protocol, User Datagram Protocol: User Datagram- UDP Services- UDP
Applications, Transmission Control Protocol: TCP Services- TCP Features- Segment- Connection-
State Transition diagram.
LIST OF EXPERIMENTS TOTAL HOURS:30

1. PC to PC Communication Parallel Communication using 8-bit parallel cable Serial
communication using RS 232C.
2. Ethernet LAN protocol: To create scenario and study the performance of CSMA/CD
protocol through simulation
3. Token bus and token ring protocols: To create scenario and study the performance of token
bus and token ring protocols through simulation
4. Wireless LAN protocols: To create scenario and study the performance of network with
CSMA / CA protocol and compare with CSMA/CD protocols
5. Implementation and study of stop and wait protocol
6. Implementation and study of Go Back-N and selective repeat protocols
7. Implementation of distance vector routing algorithm
8. Implementation of Link state routing algorithm
9. Implementation of Data encryption and decryption
10. Transfer of files from PC to PC using Windows / Unix socket processing
2. Alignment of topics of the courses with COs
S.No Summary of Course Content Hrs Alignment Teaching

to COs Tools
Used
Module I - INTRODUCTION TO DATA COMMUNICATION
1 Components- Data Representation, Data Flow. 1 CO1 T1
2 Networks: Distributed Processing, Network Criteria Physical 1 CO1 T1
Structures.
3 Network Models, Categories of Networks. 1 CO1 T1
4 Inter connection of Networks, Internetwork 1 CO1 T2
5 Internet : Protocols and Standards 1 CO1 T1
6 Standards Organizations 1 CO1 T2
Module II- MULTIPLE ACCESS CONTROL
7 Random Access: ALOHA, CSMA 1 CO2 T1
8 CSMA/CD, CSMA/CA 1 CO2 T1
9 Controlled Access: Reservation, Token Passing. 1 CO2 T1
10 Frequency-Division Multiple Access (FDMA) 1 CO2 T2
11 Time-Division Multiple Access (TDMA) 1 CO2 T1
12 Code-Division Multiple Access (CDMA). 1 CO2 T1
Module III WIRED AND WIRELESS LANS WIRED LANS
13 WIRED LANS: Ethernet, Ethernet Protocol: IEEE802- Data
1 CO3 T1
Link Layer- Physical Layer
14 STANDARD ETHERNET: MAC Sub layer- Physical Layer 1 CO3 T1
15 CHANGES IN THE STANDARD: Bridged Ethernet Switched CO3 T1
1
Ethernet-Full-Duplex Ethernet
16 FAST ETHERNET: MAC Sub layer- Physical Layer 1 CO3 T2
17 WIRELESS LANS: IEEE 802.11- Architecture- MAC Sub layer-
1
Addressing Mechanism- Physical Layer. CO3 T2
18 .BLUETOOTH: Architecture 1 CO3 T1
Module IV NETWORK LAYER PROTOCOLS
19 Internet Protocol (IP): Datagram Format- Fragmentation-Options 1 CO4 T1
20 Security of IPv4 Datagrams, ICMPv4: Messages- Debugging Tools 1 CO4 T1
21 Mobile IP: Addressing- Agents- Three Phases- Inefficiency in CO4 T1
1
Mobile IP
22 Unicast Routing: Introduction- Routing Algorithms- Distance CO4 T2
1
Vector Routing
23 Link State Routing- Path vector routing. Unicast Routing Protocol: CO4 T1
1
Internet Structure
24 Open Shortest Path First and Border Gateway Protocol Version 4. 1 CO4 T1
Module V TRANSPORT LAYER
25 Introduction: Transport Layer Services- Connectionless and CO5 T1
1
Connection Oriented Protocols
26 Transport Layer Protocols: Simple protocol- Stop and wait protocol 1 CO5 T1
27 Go-Back-N Protocol- Selective repeat protocol 1 CO5 T1
28 User Datagram Protocol: User Datagram- UDP Services 1 CO5 T1
29 Transmission Control Protocol: TCP Features 1 CO5 T1
30 Segment- Connection- State Transition diagram 1 CO5 T1
LIST OF EXPERIMENTS
31 To study PC to PC Communication Parallel Communication using
8-bit parallel cable Serial communication using RS 232C. 3 CO6 T3
32 Ethernet LAN protocol: To create scenario and study the

3 CO6
performance of CSMA/CD protocol through simulation T3
33 Token bus and token ring protocols: To create scenario and study
the performance of token bus and token ring protocols through 3 CO6 T3
simulation.
34 Wireless LAN protocols: To create scenario and study the
performance of network with CSMA / CA protocol and compare 3 CO6 T3
with CSMA/CD protocols.
35 To implement and study stop and wait protocol 3 CO6 T3
36 To implement and study Go back-N and selective repeat protocols 3 CO6 T3
37 To implement distance vector routing algorithm 3 CO6 T3
38 To Implement Link state routing algorithm 3 CO6 T3
39 To implement Data encryption and decryption 3 CO6 T3
40 To transfer files from PC to PC using Windows / Unix socket T3
3 CO6
processing
Assignment Topics
Proposed
S.No Topic CO’s Completed Date BT level
Date
Develop the Routing Information Protocol
1 CO4 3
Explain the TCP services.
2 CO5 2
3. Lesson Plan/ Topic assigned with COs, teaching tools used
Ref Propos Compl

Hou Teaching BT
Topic CO ere ed eted
r Tool level
nce Date Date
Module I - INTRODUCTION TO DATA COMMUNICATION
1 List the Components, Representations, Data Flow. CO1 R1 T1 2
Understand Networks: Distributed Processing, Network
2 CO1 R1 T1 2
Criteria Physical Structures.
3 Illustrate network models, Categories of Networks. CO1 R1 T1 2
4 Compare Inter connection of Networks, CO1 R1 T2 2
5 Outline Protocols and Standards CO1 R1 T1 2
6 Internetwork
Explain Standards Organizations CO1 R1 T2 2
Module II- MULTIPLE ACCESS CONTROL
7 Explain Random Access: ALOHA, CSMA CO2 R2 T1 2
8 Develop CSMA/CD, CSMA/CA CO2 R2 T1 3
9 Apply Controlled Access: Reservation, Token Passing. CO2 R2 T1 3
10 Utilize Frequency-Division Multiple Access (FDMA) CO2 R2 T2 3
11 Make use of Time-Division Multiple Access (TDMA) CO2 R2 T1 2
Utilize Code-Division Multiple Access (CDMA). CO2
12 R2 T1 3
Module III - WIRED AND WIRELESS LANS WIRED LANS
Explain Ethernet and Ethernet Protocol, IEEE802-
13 CO3 R3 T1 2
Data Link Layer- Physical Layer
Outline Standard Ethernet: MAC Sub Layer- Physical
14 CO3 R3 T1 2
Layer
Illustrate Changes in the standards: Bridged Ethernet
15 CO3 R3 T1 2
Switched Ethernet-Full-Duplex Ethernet
Explain Fast Ethernet: MAC Sub layer- Physical Layer
16 CO3 R3 T2 2
Outline Wireless LANs: IEEE 802.11- Architecture-
17 MAC Sub layer- Addressing Mechanism CO3 R3 T2 2
Physical Layer.
18 .Explain Bluetooth Architecture CO3 R3 T1 2
Module IV- NETWORK LAYER PROTOCOLS
Utilize Internet Protocol (IP): Datagram Format- CO4
19 R3 T1 3
Fragmentation-Options
Explain Security of IPv4 Datagrams, ICMPv4: Messages- CO4
20 R3 T1 2
Debugging Tools
Utilize Mobile IP: Addressing- Agents- Three Phases- CO4
21 R3 T1 3
Inefficiency in Mobile IP
Explain Unicast Routing: Introduction- Routing Algorithms-CO4
22 R3 T2 2
Distance Vector Routing
Develop Link State Routing- Path vector routing. CO4
23 R3 T1 3
Unicast Routing Protocol: Internet Structure
Make use of Open Shortest Path First and Border Gateway CO4
24 R3 T1 3
Protocol Version 4.
Module V- TRANSPORT LAYER
Explain Introduction: Transport Layer Services-
25 CO5 R3 T1 2
Connectionless and Connection Oriented Protocols
Classify Transport Layer Protocols: Simple protocol- Stop and
CO5
26 R3 T1 2
wait protocol
27 Illustrate Go-Back-N Protocol- Selective repeat protocol CO5 R3 T1 2
Explain User Datagram Protocol: User Datagram- UDP CO5
28 R3 T1 2
Services
29 Outline Transmission Control Protocol: TCP Features CO5 R3 T1 2
30 Explain Segment- Connection- State Transition diagram CO5 R3 T1 2
LIST OF EXPERIMENTS
Perform PC to PC Communication Parallel Communication
33 using 8-bit parallel cable Serial communication using RS CO6 R4 T3 B
232C.
Demonstrate Ethernet LAN protocol and study the T3
36 CO6 B
performance of CSMA/CD protocol through simulation R4
Demonstrate Token bus and token ring protocols study the T3
39 performance of token bus and token ring protocols through CO6 R4 B
simulation.
Demonstrate Wireless LAN protocols and study the T3
42 performance of network with CSMA / CA protocol and CO6 R4 B
compare with CSMA/CD protocols.
45 Implement and study stop and wait protocol CO6 R4 T3 B
Implement and study Go back-N and selective repeat R4 T3
48 CO6 B
protocols
51 Implement distance vector routing algorithm CO6 R4 T3 B
54 Implement Link state routing algorithm CO6 R4 T3 B
57 Implement Data encryption and decryption CO6 R4 T3 B
Perform the transfer of files from PC to PC using Windows / R4 T3
60 Unix socket processing CO6 B
Reference
Description
Code
Computer Networks, James J Kurose, Keith W Ross, Pearson Education, 2013, ISBN:
R1
0-273-76896-4
Introduction to Data Communication and Networking, Wayarles Tomasi, Pearson
R2
Education, 2007, ISBN:0130138282
Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth
R3
Edition, Morgan Kaufmann Publishers Inc., 2012.
William Stallings, Data and Computer Communications, Tenth Edition, Pearson
R4
Education, 2013.
R5 Computer Communication Networks Manual
Teaching Tool used:
Type Code Teaching Tool Used

T1 Black Board
T2 Power point Presentation
T3 Practical and Models
Part C- Assessment and Evaluation
Assessment Pattern:
There are 4 Continuous Learning Assessment (CLA) for the subject and for CLA 1 for 30 marks,
CLA 2 for 30 Marks and CLA3 for 30 Marks and CLA 4 for 10 Marks.
CO WEIGHTAGE
CO’s Weightage (Theory) Weightage (Lab)

CO1 20%
CO2 20%
CO3 20%
CO4 20%
CO5 20%
CO6 100%
Syllabus for Assessment (Theory):
CLA 1 portions will be Unit 1 and first half part of Unit 2
CLA 2 portions will be Unit 2 second half and Unit 3
CLA 3 portions will Unit 4 and Unit 5
CLA 4 will be assignments.
Continuous Learning Assessment (CLA) - Weightages (50%) THEORY
Tests (Mark) CLA 4

CO’s
CLA 1 CLA 2 CLA 3 Assignments (mark)
CO1 20
CO2 10 10
CO3 20
CO4 15 05
CO5 15 05
Continuous Learning Assessment (CLA) - Weightages (50%) LAB
Tests (Mark) CLA 4

CO’s Observation and Viva
CLA 1 CLA 2 CLA 3
verse(mark)
CO6 30 30 30 10
Final Examination – Weightage 50%
Theory
CO’s Marks (Theory)

CO1 20
CO2 20
CO3 20
CO4 20
CO5 20
Final Examination – Weightage 50%

Lab
CO’s Marks(Lab) Record and Viva Voce

(marks)
CO6 80 20
Evaluation Summary (Theory and Lab):
Total
TOTAL
EXAMS Marks WEIGHTAGE
MARKS
split up
Continuous Internal Assessment
Theory 100
(CLA 1,CLA 2,CLA 3, CLA 4) 50% of Average
Continuous internal Assessment Lab 100 Marks
100
(CLA 1,CLA 2,CLA 3, CLA 4)
End Semester Exam theory 100
End Semester Lab Exam 100 50% of Average
Part D – Learning Resources
TEXT BOOK:
1. Data Communications and Networking, Forouzan, 5th Edition, McGraw Hill, 2016 ISBN:
1-25-906475-3
2. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall,
2014.
REFERENCES:
1. Computer Networks, James J Kurose, Keith W Ross, Pearson Education, 2013, ISBN: 0-
273-76896-4
2. Introduction to Data Communication and Networking, Wayarles Tomasi, Pearson
Education, 2007, ISBN:0130138282
3. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth
Edition, Morgan Kaufmann Publishers Inc., 2012.
4. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
ONLINE RESOURCES:
1. https://onlinecourses.nptel.ac.in/noc22_cs19/preview
2. https://www.udemy.com/course/learning-computer-communication-and-networking-
fundamentals/
3. https://www.tutorialspoint.com/data_communication_computer_network/index.htm
1
U20ECCJ09
COMPUTER COMMUNICATION NETWORKS
COURSE MATERIAL
2
UNIT 1
INTRODUCTION TO DATA COMMUUNICATION
Components-Data Representation-Data Flow, NETWORKS: Distributed Processing-
Network Criteria-Physical Structures-Network Models-Categories of Networks, Inter connection of
Networks- Internetwork, Internet: Protocols-Standards-Standards Organizations
1.0 INTRODUCTION
This chapter provides an introduction to Computer networks and covers

fundamental topics like data, information to the definition of
communication and computer networks.
The main objective of data communication and networking is to enable
seamless exchange of data between any two points in the world.
This exchange of data takes place over a computer network.
1.1 DATA & INFORMATION
Data refers to the raw facts that are collected while information
refers to processed data that enables us to take decisions.
Ex. When result of a particular test is declared it contains dataof all
students, when you find the marks you have scored you have the
information that lets you know whether you have passed or failed.
The word data refers to any information which is presented in a form
that is agreed and accepted upon by is creators and users.
1.2 DATA COMMUNICATION
Data Communication is a process of exchanging data or information

In case of computer networks this exchange is done between two
devices over a transmission medium.
This process involves a communication system which is made up of
hardware and software. The hardware part involves the sender and
receiver devices and the intermediate devices through which the data
passes. The software part involves certain rules which specify what is
to be communicated, how it is to be communicated and when. It is also
called as a Protocol.
The following sections describes the fundamentalcharacteristics that
are important for the effective working ofdata communication process
and is followed by the componentsthat make up a data communications
system.
1.2.1 Characteristics of Data Communication

3
The effectiveness of any data communications system dependsupon

the following four fundamental characteristics:
4
1. Delivery: The data should be delivered to the correct destination and

correct user.
2. Accuracy: The communication system should deliver the data
accurately, without introducing any errors. The data may get corrupted
during transmission affecting the accuracy of the delivered data.
3. Timeliness: Audio and Video data has to be delivered in a timely
manner without any delay; such a data delivery is called real time
transmission of data.
4. Jitter: It is the variation in the packet arrival time. Uneven Jitter may
affect the timeliness of data being transmitted.
1.2.2 Components of Data Communication
A Data Communication system has five components asshown in

the diagram below:
Fig. Components of a Data Communication System
1. Message
Message is the information to be communicated by the sender tothe
receiver.
2. Sender
The sender is any device that is capable of sending the data(message).
3. Receiver
The receiver is a device that the sender wants to communicate thedata
(message).
4. Transmission Medium
It is the path by which the message travels from sender to receiver.It can
be wired or wireless and many subtypes in both.
5
5. Protocol
It is an agreed upon set or rules used by the sender and receiver to
communicate data.
A protocol is a set of rules that governs data communication. A
Protocol is a necessity in data communications without which the
communicating entities are like two persons trying to talk to each
other in a different language without know the other language.
1.3 DATA REPRESENTATION
Data is collection of raw facts which is processed to deduceinformation.
There may be different forms in which data may be represented. Some of

the forms of data used in communications are as follows:
1. Text
Text includes combination of alphabets in small case as wellas
upper case.
It is stored as a pattern of bits. Prevalent encoding system :
ASCII, Unicode
2. Numbers
Numbers include combination of digits from 0 to 9.
It is stored as a pattern of bits. Prevalent encoding system :
ASCII, Unicode
3. Images
―An image is worth a thousand words‖ is a very famous saying.
In computers images are digitally stored.
A Pixel is the smallest element of an image. To put it in simple terms,
a picture or image is a matrix of pixel elements.
The pixels are represented in the form of bits. Depending upon the type
of image (black n white or color) each pixel would require different
number of bits to represent the value of a pixel.
The size of an image depends upon the number of pixels (also called
resolution) and the bit pattern used to indicate the value of each pixel.
Example: if an image is purely black and white (two color) each pixel
can be represented by a value either 0 or 1, so an image made up of 10
x 10 pixel elements would require only 100 bits in memory to be stored.
On the other hand an image that includes gray may require 2 bits to
represent every pixel value (00 - black, 01 – dark gray, 10
6
– light gray, 11 –white). So the same 10 x 10 pixel image wouldnow

require 200 bits of memory to be stored.
Commonly used Image formats : jpg, png, bmp, etc
4. Audio
Data can also be in the form of sound which can be recordedand
broadcasted. Example: What we hear on the radio is a source of data
or information.
Audio data is continuous, not discrete.
5. Video
Video refers to broadcasting of data in form of picture or movie
1.4 DATA FLOW
wo devices communicate with each other by sending and receiving

data. The data can flow between the two devices in the following ways.
1. Simplex
2. Half Duplex
3. Full Duplex
1.4.1 Simplex
Figure: Simplex mode of communication
In Simplex, communication is unidirectional

Only one of the devices sends the data and the other oneonly
receives the data.
Example: in the above diagram: a cpu send data while a
monitor only receives data.
1.4.2 Half Duplex

7
Figure: Half Duplex Mode of Communication
In half duplex both the stations can transmit as well as receivebut not
at the same time.
When one device is sending other can only receive and vice-versa
(as shown in figure above.)
Example: A walkie-talkie.
1.4.3 Full Duplex
Figure: Full Duplex Mode of Communication
In Full duplex mode, both stations can transmit and receiveat the
same time.
Example: mobile phones
1.5 COMPUTER NETWORK
Computer Networks are used for data communications
Definition:
A computer network can be defined as a collection of nodes. A node
can be any device capable of transmitting or receiving data.
The communicating nodes have to be connected by communication
links.
A Compute network should ensure

reliability of the data communication process, should c
security of the data
8
performance by achieving higher throughput and smallerdelay

times
1.5.1 Categories of Network

Networks are categorized on the basis of their size. Thethree basic
categories of computer networks are:
A. Local Area Networks (LAN) is usually limited to a few kilometers

of area. It may be privately owned and could be a network inside
an office on one of the floor of a building or a LAN could be a
network consisting of the computers ina entire building.
B. Wide Area Network (WAN) is made of all the networks in a

(geographically) large area. The network in the entire state of
Maharashtra could be a WAN
C. Metropolitan Area Network (MAN) is of size between LAN &

WAN. It is larger than LAN but smaller than WAN. It may
comprise the entire network in a city like Mumbai.
1.6 PROTOCOL
A Protocol is one of the components of a data communications

system. Without protocol communication cannot occur. The sending
device cannot just send the data and expect the receiving device to
receive and further interpret it correctly.
When the sender sends a message it may consist of text, number,

images, etc. which are converted into bits and grouped into blocks
to be transmitted and often certain additional information called
control information is also added to help the receiver interpret the
data.
For successful communication to occur, the sender and receiver

must agree upon certain rules called protocol.
A Protocol is defined as a set of rules that governs data

communications.
A protocol defines what is to be communicated, how it is to be

communicated and when it is to be communicated.
1.6.1 Elements of a Protocol

There are three key elements of a protocol:
9
A. Syntax
It means the structure or format of the data.
It is the arrangement of data in a particular order.
B. Semantics
It tells the meaning of each section of bits andindicates
the interpretation of each section.
It also tells what action/decision is to be taken basedon
the interpretation.
C. Timing
It tells the sender about the readiness of the receiver to
receive the data
It tells the sender at what rate the data should be sentto the
receiver to avoid overwhelming the receiver.
1.7 STANDARDS IN NETWORKING
Standards are necessary in networking to ensure interconnectivity

and interoperability between various networking hardware and
software components.
Without standards we would have proprietary products creating

isolated islands of users which cannot interconnect.
1.7.1 Concept of Standard

Standards provide guidelines to product manufacturers and vendors
to ensure national and international interconnectivity.
Data communications standards are classified into two categories:
1. De facto Standard
o These are the standards that have been traditionallyused
and mean by fact or by convention
o These standards are not approved by any organizedbody
but are adopted by widespread use.
2. De jure standard
o It means by law or by regulation.
o These standards are legislated and approved by an
body that is officially recognized.
10
1.7.2 Standard Organizations in field of Networking
oStandards are created by standards creation committees, forums,
and government regulatory agencies.
oExamples of Standard Creation Committees :

1. International Organization for Standardization(ISO)
2. International Telecommunications Union
–Telecommunications Standard
(ITU-T)
3. American National Standards Institute (ANSI)
4. Institute of Electrical & Electronics Engineers
(IEEE)
5. Electronic Industries Associates (EIA)
o Examples of Forums
1. ATM Forum
2. MPLS Forum
3. Frame Relay Forum
o Examples of Regulatory Agencies:

1. Federal Communications Committee (FCC)
1.8 REVIEW QUESTIONS
1. Differentiate between data & information. What are the different

forms in which data can be represented?
2. What are the characteristics of data communication?
3. What are the components of a data communication system?
4. Define computer network and categorize.
5. Explain protocols in details
1.9 REFERENCES
1. Data Communication & Networking – Behrouz Forouzan

11
2.1 INTRODUCTION
In the study of computer networks it is essential to study the way

our networks work. Computer networks are operated by network models;
most prominently the OSIRM and the TCP/ IP Model. This chapter gives
the understanding of the OSI reference model.
2.2 CONCEPT OF LAYERED TASK
i. The main objective of a computer network is to be able to transfer

the data from sender to receiver. This task can be done by breaking
it into small sub tasks, each of which are well defined.
ii. Each subtask will have its own process or processes to do and will
take specific inputs and give specific outputs to the subtask before
or after it. In more technical terms we can callthese sub tasks as
layers.
iii. In general, every task or job can be done by dividing it into sub task
or layers. Consider the example of sending a letter where the sender
is in City A and receiver is in city B.
iv. The process of sending letter is shown below:
Fig: Concept of layer task: sending a letter
v. The above figure shows

12
a. Sender, Receiver & Carrier
b. Hierarchy of layers
vi. At the sender site, the activities take place in the following
descending order:
a. Higher Layer: The sender writes the letter along with the sender
and receivers address and put it in an envelope and drop it in the
mailbox.
b. Middle Layer: The letter is picked up by the post man and
delivered to the post office
c. Lower Layer: The letters at the post office are sorted and are
ready to be transported through a carrier.
vii. During transition the letter may be carried by truck, plane or ship or
a combination of transport modes before it reaches the destination
post office.
viii. At the Receiver site, the activities take place in the following
ascending order:
a. Lower Layer: The carrier delivers the letter to the
destination post office
b. Middle Layer: After sorting, the letter is delivered to the
receivers mail box
c. Higher Layer: The receiver picks up the letter, opens the
envelope and reads it.
ix. Hierarchy of layers: The activities in the entire task are organized
into three layers. Each activity at the sender or receiver side occurs
in a particular order at the hierarchy.
x. The important and complex activities are organized into the Higher
Layer and the simpler ones into middle and lower layer.
2.3 OPEN SYSTEMS INTER CONNECTION

REFERENCE MODEL (OSIRM )
2.3.1 Introduction to OSI Model & its layers

The Open Systems Interconnection (OSI) Model was developed
by International Organization for Standardization (ISO).
ISO is the organization, OSI is the model
It was developed to allow systems with different platformsto
communicate with each other. Platform could mean hardware,
software or operating system.
It is a network model that defines the protocols for network
communications.
It is a hierarchical model that groups its processes into layers. It
has 7 layers as follows: (Top to Bottom)
2.3.1.1 Application Layer
2.3.1.2 Presentation Layer
2.3.1.3 Session Layer
13
2.3.1.4 Transport Layer
2.3.1.5 Network Layer
2.3.1.6 Data Link Layer
2.3.1.7 Physical Layer
Each layer has specific duties to perform and has to co-
operate with the layers above and below it.
2.3.2 Layered Architecture of OSI Model
The OSI model has 7 layers each with its own dedicated task.
A message sent from Device A to Device B passes has to pass

through all layers at A from top to bottom then all layersat B from
bottom to top as shown in the figure below.
At Device A, the message is sent from the top layer i.eApplication

Layer A then all the layers till it reaches its physical layer and then
it is transmitted through thetransmission medium.
At Device B, the message received by the physical layer passes

through all its other layers and moves upwards till it reaches its
Application Layer.
Fig: Flow of Data from Device A to Device B through variouslayers
As the message travels from device A to device B, it may pass

through many intermediate nodes. These intermediate nodes usually
involve only the first three layers of the OSI model as shown below.
14
Fig: Data Transfer through Intermediate nodes
The Data Link layer determines the next node where the message is
supposed to be forwarded and the network layer determines the final
recipient.
2.3.3 Communication & Interfaces
For communication to occur, each layer in the sending device adds

its own information to the message it receives from the layer just
above it and passes the whole package to the layer just below it.
Each layer in the receiving device removes the information added at
the corresponding layer and sends the obtained data to the layer
above it.
Every Layer has its own dedicated function or services and is

different from the function of the other layers.
On every sending device, each layer calls upon the service offered
by the layer below it.
On every receiving device, each layer calls upon the service offered
by the layer above it.
Between two devices, the layers at corresponding levels

communicate with each other .i.e layer 2 at receiving end can
communicate and understand data from layer 2 of sending end.
This is called peer –to – peer communication.
For this communication to be possible between every two adjacent

layers there is an interface. An interface defines theservice that a
layer must provide. Every layer has an interface to the layer above
and below it as shown in the figure below
15
Fig: Communication & Interfaces in the OSI model
2.3.4 Encapsulation of Data
Fig: Encapsulation
16
As shown in the figure above the data at layer 7 i.e the Application
layer along with the header added at layer 7 is given to layer 6, the
Presentation layer. This layer adds Its header and passed the whole
package to the layer below.
The corresponding layers at the receiving side removes the

corresponding header added at that layer and sends theremaining
data to the above layer.
The above process is called encapsulation
2.3.5 Description of Layers in the OSI Model

4.3.5.1 Physical Layer
I. The Physical Layer provides a standardized interface tophysical
transmission media, including :
a. Mechanical specification of electrical connectorsand
cables, for example maximum cable length
b. Electrical specification of transmission line
c. Bit-by-bit or symbol-by-symbol delivery
II. On the sender side, the physical layer receives the data fromData
Link Layer and encodes it into signals to be transmitted onto the
medium. On the receiver side, the physical layer receives the signals
from the transmission medium decodesit back into data and sends
it to the Data Link Layer as shown in the figure below:
Fig: Transmission of data to and from Physical Layer
III. Interface
The Physical Layer defines the characteristics of interfaces
between the devices & transmission medium.
17
IV. Representation of bits

The physical layer is concerned with transmission of signals from
one device to another which involves converting data (1‘s & 0‘s)
into signals and vice versa. It is not concernedwith the meaning
or interpretation of bits.
V. Data rate
The physical layer defines the data transmission rate i.e.number of
bits sent per second. It is the responsibility of the physical layer to
maintain the defined data rate.
VI. Synchronization of bits

To interpret correct and accurate data the sender and receiver have
to maintain the same bit rate and also have synchronized clocks.
VII. Line configuration

The physical layer defines the nature of the connection .i.e. apoint
to point link, or a multi point link.
VIII. Physical Topology

The physical layer defines the type of topology in which the device
is connected to the network. In a mesh topology it uses a multipoint
connection and other topologies it uses a point to point connection
to send data.
IX. Transmission mode

The physical layer defines the direction of data transfer between the
sender and receiver. Two devices can transfer the data in simplex,
half duplex or full duplex mode
X. Main responsibility of the physical layer

Transmission of bits from one hop to the next.
2.3.5.2 Data Link Layer

2.3.5.2.1 The Data Link layer adds reliability to the physical layer by
providing error detection and correction mechanisms.
2.3.5.2.2 On the sender side, the Data Link layer receives the data from
Network Layer and divides the stream of bits into fixed size
manageable units called as Frames and sends it to the physical
layer. On the receiver side, the data link layer receives the stream
of bits from the physical layer and regroups them into frames
and sends them to the Network layer. This process is called
Framing. It is shown in the figure below:
18
Fig: Data Link Layer: The process of Framing
2.3.5.2.3 Physical Addressing (inside / outside sendersnetwork)

2.3.5.2.3.1 The Data link layer appends the physical address
in the header of the frame before sending it to physical layer.
2.3.5.2.3.2 The physical address contains the address of the

sender and receiver.
2.3.5.2.3.3 In case the receiver happens to be on the same

physical network as the sender; the receiver is at only one
hop from the sender and the receiver address contains the
receiver‘s physical address.
2.3.5.2.3.4 In case the receiver is not directly connected to the
sender, the physical address is the address of the next node
where the data is supposed to be delivered.
2.3.5.2.4 Flow control

2.3.5.2.4.1 The data link layer makes sure that the
sender sends the data at a speed at which the receiver
can receive it else if there is an overflow at the
receiver side the data will be lost.
2.3.5.2.4.2 The data link layer imposes flow control

mechanism over the sender and receiver to avoid
overwhelming of the receiver.
2.3.5.2.5 Error control

2.3.5.2.5.1 The data link layer imposes error control
mechanism to identify lost or damaged frames,
duplicate frames and then retransmit them.
2.3.5.2.5.2 Error control information is present in the
trailer of a frame.
19
2.3.5.2.6 Access Control

2.3.5.2.6.1 The data link layer imposes access control
mechanism to determine which device has right to
send data in an multipoint connection scenario.
2.3.5.2.7 Main Responsibility

i. The main responsibility of the data link layer is hop to hop
transmission of frames.
2.3.5.3 Network Layer

I. The network layer makes sure that the data is delivered to the
receiver despite multiple intermediate devices.
II. The network layer at the sending side accepts data from the transport
layer, divides it into packets, adds addressing information in the
header and passes it to the data link layer. At the receiving end the
network layer receives the frames sent by data link layer, converts
them back into packets, verifies the physical address (verifies if the
receiver address matches with its own address) and the send the
packets to the transport layer.
Fig: Network Layer
III. The network layer is responsible for source to destination of delivery

of data. Hence it may have to route the data through multiple
networks via multiple intermediate devices. In order to achieve this
the network layer relies on two things:
a. Logical Addressing
b. Routing
IV. Logical Addressing

The network layer uses logical address commonly knownas IP
address to recognize devices on the network.
20
An IP address is a universally unique address which enables the

network layer to identify devices outside the sender‘s network.
The header appended by the network layer contains the actual
sender and receiver IP address.
At every hop the network layer of the intermediate node check

the IP address in the header, if its own IP address does not match
with the IP address of the receiver found in the header, the
intermediate node concludes that it is not the final node but an
intermediate node and passes the packet to the data link layer
where the data is forwarded to the next node.
V. Routing
VI. The network layer divides data into units called packets of
equal size and bears a sequence number for rearranging on the
receiving end.
Each packet is independent of the other and may travel using

different routes to reach the receiver hence may arrive out of
turn at the receiver.
Hence every intermediate node which encounters a packet tries

to compute the best possible path for the packet. The best
possible path may depend on several factors such as congestion,
number of hops, etc
This process of finding the best path is called as Routing.

It is done using routing algorithms.
VI. The Network layer does not perform any flow control or error
control
VII. Main Responsibility

The main responsibility of Network Layer is
transmission of packets from source to destination
2.3.5.4 Transport Layer

2.3.5.4.1 A logical address at network layer facilitates the
transmission of data from source to destination device. But
the source and the destination both may be having multiple
processes communicating with each other. Hence it is
important to deliver the data not only from the sender to the
receiver but from the correct process on the sender to the
correct process on the receiver. The transport layer takes care
of process to process delivery of data and makes sure that it
is intact and in order.
21
2.3.5.4.2 At the sending side, the transport layer receives

data from the session layer, divides it into units called
segments and sends it to the network layer. At the receiving
side, the transport layer receives packets from the network
layer, converts and arranges into proper sequence of
segments and sends it to the session layer.
Fig: Transport Layer
2.3.5.4.3 To ensure process to process delivery the

transport layer makes use of port address to identify the data
from the sending and receiving process. A Port Address is the
name or label given to a process. It is a
16 bit address. Ex. TELNET uses port address 23,HTTP uses
port address 80. Port address is also called as Service Point
Address
2.3.5.4.4 The data can be transported in a connection

oriented or connectionless manner. If the connection is
connection oriented then all segments are received in order
else they are independent of each other and are received out
of order and have to be rearranged.
2.3.5.4.5 The Transport layer is responsible for

segmentation and reassembly of the message into segments
which bear sequence numbers. This numbering enables the
receiving transport layer to rearrange the segments in proper
order.
2.3.5.4.6 Flow Control & Error control: the transport

layer alsocarries out flow control and error control functions;
but unlike data link layer these are end to end rather than node
to node.
22

The main responsibility of the transport layer isprocess
to process delivery of the entire message.
2.3.5.5 Session Layer
2.3.5.5.1 The session layer establishes a session between
the communicating devices called dialog and synchronizes
their interaction. It is the responsibility ofthe session layer
to establish and synchronize thedialogs. It is also called the
network dialog controller.
2.3.5.5.2 The session layer at the sending side accepts data

from the presentation layer adds checkpoints to it called syn
bits and passes the data to the transport layer. At the
receiving end the session layer receives data from the
transport layer removes the checkpoints inserted previously
and passes the data to the presentation layer.
2.3.5.5.3 The checkpoints or synchronization points is a

way of informing the status of the data transfer. Ex. A
checkpoint after first 500 bits of data will ensure that those
500 bits are not sent again in case ofretransmission at 650th
bit.
2.3.5.5.4 Main responsibility of session layer is

dialogcontrol and synchronizatoin
2.3.5.6 Presentation Layer

I. The communicating devices may be having different platforms. The
presentation layer performs translation, encryption and compression
of data.
23
II. The presentation layer at sending side receives the datafrom the
application layer adds header which contains information related to
encryption and compression and sends it to the session layer. At
the receiving side, the presentation layer receives data from the
session layer decompresses and decrypts the data as required and
translates it back as per the encoding scheme used at the receiver.
Fig : Presentation Layer
III. Translation
The sending and receiving devices may run on different platforms
(hardware, software and operating system). Henceit is important that
they understand the messages that are used for communicating.
Hence a translation service may be required which is provided by
the Presentation layers
IV. Compression
Compression ensures faster data transfer. The data compressed at
sender has to be decompressed at the receiving end, both performed
by the Presentation layer.
V. Encryption
It is the process of transforming the original message tochange its
meaning before sending it. The reverse process called decryption
has to be performed at the receiving end to recover the original
message from the encrypted message.
VI. Main responsibility

The main responsibility of the Presentation layer is translation,
compression and encryption.
2.3.5.7 Application Layer

2.3.5.7.1 The application layer enables the user to
communicate its data to the receiver by providing
24
certain services. For ex. Email is sent using X.400

service.
Fig : Application Layer
2.3.5.7.2 X500 is a directory service used to provide information and

access to distributed objects
2.3.5.7.3 X400 is services that provides basis for mail storage and
forwarding
2.3.5.7.4 FTAM (File transfer, access and management) provides

access to files stored on remote computers and mechanism
for transfer and manage them locally.

Main Responsibility of Application layer is to provide
access to network resources.
2.4 SUMMARY
The responsibilities of the 7 layers of OSI model can be

summarized as follows:
1. Application Layer : To provide the users access to network

resources
2. Presentation Layer: To provide the functions of translation,
encryption and compression.
3. Session Layer: To establish, manage and terminate sessions
25
4. Transport Layer: To provide process to process delivery of

message
5. Network Layer: To provide source to destination delivery of
packets.
6. Datalink Layer: To provide hop to hop delivery of frames
7. Physical Layer: To transmit data over a bit stream from one hop to the
next and provide electrical and mechanical specification.
2.5 REVIEW QUESTIONS
1. Explain the concept of layered task.

2. What is the OSI model? List its layers and explain their
responsibility in exactly one line.
3. Explain how the communication takes place between layersof
OSI model.
4. Write a short note on encapsulation of data in OSI model.
5. Differentiate between the working of Data link layer, Network
layer and Transport layer.
2.6 REFERENCE & FURTHER READING
Data Communication & Networking – Behrouz Forouzan

26
UNIT II
MULTIPLE ACCESS CONTROL
RANDOM ACCESS: ALOHA- Carrier Sense Multiple Access(CSMA)-Carrier Sense Multiple Access
with Collision Detection(CSMAlCD)- Carrier Sense Multiple Access with Collision Avoidance
(CSMAlCA), CONTROLLED ACCESS: Reservation- Token Passing. CHANNELIZATION:
Frequency-Division Multiple Access (FDMA)- Time-Division Multiple Access (TDMA)- Code-Division
Multiple Access (CDMA).
Multiple access protocol- ALOHA, CSMA, CSMA/CA and CSMA/CD
Data Link Layer
The data link layer is used in a computer network to transmit the data between two devices or nodes. It
divides the layer into parts such as data link control and the multiple access resolution/protocol. The
upper layer has the responsibility to flow control and the error control in the data link layer, and hence it is
termed as logical of data link control. Whereas the lower sub-layer is used to handle and reduce the
collision or multiple access on a channel. Hence it is termed as media access control or the multiple access
resolutions.
Data Link Control
A data link control is a reliable channel for transmitting data over a dedicated link using various techniques
such as framing, error control and flow control of data packets in the computer network.
What is a multiple access protocol?
When a sender and receiver have a dedicated link to transmit data packets, the data link control is enough
to handle the channel. Suppose there is no dedicated path to communicate or transfer the data between two
devices. In that case, multiple stations access the channel and simultaneously transmits the data over the
channel. It may create collision and cross talk. Hence, the multiple access protocol is required to reduce
the collision and avoid crosstalk between the channels.
For example, suppose that there is a classroom full of students. When a teacher asks a question, all the
students (small channels) in the class start answering the question at the same time (transferring the data
simultaneously). All the students respond at the same time due to which data is overlap or data lost.
Therefore it is the responsibility of a teacher (multiple access protocol) to manage the students and make
them one answer.
Following are the types of multiple access protocol that is subdivided into the different process as:
27
A. Random Access Protocol
In this protocol, all the station has the equal priority to send the data over a channel. In random access
protocol, one or more stations cannot depend on another station nor any station control another station.
Depending on the channel's state (idle or busy), each station transmits the data frame. However, if more
than one station sends the data over a channel, there may be a collision or data conflict. Due to the collision,
the data frame packets may be lost or changed. And hence, it does not receive by the receiver end.
Following are the different methods of random-access protocols for broadcasting frames on the channel.
o Aloha
o CSMA
o CSMA/CD
o CSMA/CA
ALOHA Random Access Protocol
It is designed for wireless LAN (Local Area Network) but can also be used in a shared medium to
transmit data. Using this method, any station can transmit data across a network simultaneously when a
data frameset is available for transmission.
Aloha Rules
1. Any station can transmit data to a channel at any time.

2. It does not require any carrier sensing.
3. Collision and data frames may be lost during the transmission of data through multiple stations.
4. Acknowledgment of the frames exists in Aloha. Hence, there is no collision detection.
5. It requires retransmission of data after some random amount of time.
28
Pure Aloha
Whenever data is available for sending over a channel at stations, we use Pure Aloha. In pure Aloha,
when each station transmits data to a channel without checking whether the channel is idle or not, the
chances of collision may occur, and the data frame can be lost. When any station transmits the data frame
to a channel, the pure Aloha waits for the receiver's acknowledgment. If it does not acknowledge the
receiver end within the specified time, the station waits for a random amount of time, called the backoff
time (Tb). And the station may assume the frame has been lost or destroyed. Therefore, it retransmits the
frame until all the data are successfully transmitted to the receiver.
1. The total vulnerable time of pure Aloha is 2 * Tfr.

2. Maximum throughput occurs when G = 1/ 2 that is 18.4%.
3. Successful transmission of data frame is S = G * e ^ - 2 G.
As we can see in the figure above, there are four stations for accessing a shared channel and transmitting
data frames. Some frames collide because most stations send their frames at the same time. Only two
29
frames, frame 1.1 and frame 2.2, are successfully transmitted to the receiver end. At the same time, other
frames are lost or destroyed. Whenever two frames fall on a shared channel simultaneously, collisions
can occur, and both will suffer damage. If the new frame's first bit enters the channel before finishing the
last bit of the second frame. Both frames are completely finished, and both stations must retransmit the
data frame.
Slotted Aloha
The slotted Aloha is designed to overcome the pure Aloha's efficiency because pure Aloha has a very
high possibility of frame hitting. In slotted Aloha, the shared channel is divided into a fixed time interval
called slots. So that, if a station wants to send a frame to a shared channel, the frame can only be sent at
the beginning of the slot, and only one frame is allowed to be sent to each slot. And if the stations are
unable to send data to the beginning of the slot, the station will have to wait until the beginning of the slot
for the next time. However, the possibility of a collision remains when trying to send a frame at the
beginning of two or more station time slot.
1. Maximum throughput occurs in the slotted Aloha when G = 1 that is 37%.

2. The probability of successfully transmitting the data frame in the slotted Aloha is S = G * e ^ - 2
G.
3. The total vulnerable time required in slotted Aloha is Tfr.
CSMA (Carrier Sense Multiple Access)
It is a carrier sense multiple access based on media access protocol to sense the traffic on a channel
(idle or busy) before transmitting the data. It means that if the channel is idle, the station can send data to
the channel. Otherwise, it must wait until the channel becomes idle. Hence, it reduces the chances of a
collision on a transmission medium.
CSMA Access Modes

30
1-Persistent: In the 1-Persistent mode of CSMA that defines each node, first sense the shared channel
and if the channel is idle, it immediately sends the data. Else it must wait and keep track of the status of
the channel to be idle and broadcast the frame unconditionally as soon as the channel is idle.
Non-Persistent: It is the access mode of CSMA that defines before transmitting the data, each node must
sense the channel, and if the channel is inactive, it immediately sends the data. Otherwise, the station
must wait for a random time (not continuously), and when the channel is found to be idle, it transmits the
frames.
P-Persistent: It is the combination of 1-Persistent and Non-persistent modes. The P-Persistent mode
defines that each node senses the channel, and if the channel is inactive, it sends a frame with
a P probability. If the data is not transmitted, it waits for a (q = 1-p probability) random time and
resumes the frame with the next time slot.
O- Persistent: It is an O-persistent method that defines the superiority of the station before the
transmission of the frame on the shared channel. If it is found that the channel is inactive, each station
waits for its turn to retransmit the data.
CSMA/ CD
It is a carrier sense multiple access/ collision detection network protocol to transmit data frames. The
CSMA/CD protocol works with a medium access control layer. Therefore, it first senses the shared
31
channel before broadcasting the frames, and if the channel is idle, it transmits a frame to check whether
the transmission was successful. If the frame is successfully received, the station sends another frame. If
any collision is detected in the CSMA/CD, the station sends a jam/ stop signal to the shared channel to
terminate data transmission. After that, it waits for a random time before sending a frame to a channel.
CSMA/ CA
It is a carrier sense multiple access/collision avoidance network protocol for carrier transmission of
data frames. It is a protocol that works with a medium access control layer. When a data frame is sent to a
channel, it receives an acknowledgment to check whether the channel is clear. If the station receives only
a single (own) acknowledgments, that means the data frame has been successfully transmitted to the
receiver. But if it gets two signals (its own and one more in which the collision of frames), a collision of
the frame occurs in the shared channel. Detects the collision of the frame when a sender receives an
acknowledgment signal.
Following are the methods used in the CSMA/ CA to avoid the collision:
Interframe space: In this method, the station waits for the channel to become idle, and if it gets the
channel is idle, it does not immediately send the data. Instead of this, it waits for some time, and this time
period is called the Interframe space or IFS. However, the IFS time is often used to define the priority of
the station.
Contention window: In the Contention window, the total time is divided into different slots. When the
station/ sender is ready to transmit the data frame, it chooses a random slot number of slots as wait time.
If the channel is still busy, it does not restart the entire process, except that it restarts the timer only to
send data packets when the channel is inactive.
Acknowledgment: In the acknowledgment method, the sender station sends the data frame to the shared
channel if the acknowledgment is not received ahead of time.
Carrier Sense Multiple Access (CSMA)
This method was developed to decrease the chances of collisions when two or more stations start
sending their signals over the data link layer. Carrier Sense multiple access requires that each station first
check the state of the medium before sending.
Vulnerable Time:
Vulnerable time = Propagation time (Tp)
32
The persistence methods can be applied to help the station take action when the channel is busy/idle.
1. Carrier Sense Multiple Access with Collision Detection (CSMA/CD):
In this method, a station monitors the medium after it sends a frame to see if the transmission was
successful. If successful, the transmission is finished, if not, the frame is sent again.
33
In the diagram, starts sending the first bit of its frame at t1 and since C sees the channel idle at t2, starts
sending its frame at t2. C detects A’s frame at t3 and aborts transmission. A detects C’s frame at t4 and
aborts its transmission. Transmission time for C’s frame is, therefore, t3-t2 and for A’s frame is
t4-t1
So, the frame transmission time (Tfr) should be at least twice the maximum propagation time
(Tp). This can be deduced when the two stations involved in a collision are a maximum distance apart.
Process: The entire process of collision detection can be explained as follows:
Throughput and Efficiency: The throughput of CSMA/CD is much greater than pure or slotted
ALOHA.
 For the 1-persistent method, throughput is 50% when G=1.
 For the non-persistent method, throughput can go up to 90%.

34
 2. Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) –
The basic idea behind CSMA/CA is that the station should be able to receive while transmitting to detect
a collision from different stations. In wired networks, if a collision has occurred then the energy of the
received signal almost doubles, and the station can sense the possibility of collision. In the case of
wireless networks, most of the energy is used for transmission, and the energy of the received signal
increases by only 5-10% if a collision occurs. It can’t be used by the station to sense collision.
Therefore CSMA/CA has been specially designed for wireless networks.
These are three types of strategies:
1. InterFrame Space (IFS): When a station finds the channel busy it senses the channel again, when
the station finds a channel to be idle it waits for a period of time called IFS time. IFS can also be
used to define the priority of a station or a frame. Higher the IFS lower is the priority.
2. Contention Window: It is the amount of time divided into slots. A station that is ready to send frames
chooses a random number of slots as wait time.
3. Acknowledgments: The positive acknowledgments and time-out timer can help guarantee a
successful transmission of the frame.
Characteristics of CSMA/CA :
1. Carrier Sense: The device listens to the channel before transmitting, to ensure that it is not currently
in use by another device.
2. Multiple Access: Multiple devices share the same channel and can transmit simultaneously.
3. Collision Avoidance: If two or more devices attempt to transmit at the same time, a collision occurs.
CSMA/CA uses random backoff time intervals to avoid collisions.
4. Acknowledgment (ACK): After successful transmission, the receiving device sends an ACK to
confirm receipt.
5. Fairness: The protocol ensures that all devices have equal access to the channel and no single device
monopolizes it.
6. Binary Exponential Backoff: If a collision occurs, the device waits for a random period of time
before attempting to retransmit. The backoff time increases exponentially with each retransmission
attempt.
7. Interframe Spacing: The protocol requires a minimum amount of time between transmissions to
allow the channel to be clear and reduce the likelihood of collisions.
8. RTS/CTS Handshake: In some implementations, a Request-To-Send (RTS) and Clear-To-Send
(CTS) handshake is used to reserve the channel before transmission. This reduces the chance of
collisions and increases efficiency.
9. Wireless Network Quality: The performance of CSMA/CA is greatly influenced by the quality of
the wireless network, such as the strength of the signal, interference, and network congestion.
10. Adaptive Behavior: CSMA/CA can dynamically adjust its behavior in response to changes in
network conditions, ensuring the efficient use of the channel and avoiding congestion.
Overall, CSMA/CA balances the need for efficient use of the shared channel with the need to avoid
collisions, leading to reliable and fair communication in a wireless network.
35
Process: The entire process of collision avoidance can be explained as follows:

36
Types of CSMA Access Modes:
There are 4 types of access modes available in CSMA. It is also referred as 4 different types of CSMA
protocols which decide the time to start sending data across shared media.
1. 1-Persistent: It senses the shared channel first and delivers the data right away if the channel is idle.
If not, it must wait and continuously track for the channel to become idle and then broadcast the
frame without condition as soon as it does. It is an aggressive transmission algorithm.
2. Non-Persistent: It first assesses the channel before transmitting data; if the channel is idle, the node
transmits data right away. If not, the station must wait for an arbitrary amount of time (not
continuously), and when it discovers the channel is empty, it sends the frames.
3. P-Persistent: It consists of the 1-Persistent and Non-Persistent modes combined. Each node observes
the channel in the 1Persistent mode, and if the channel is idle, it sends a frame with a P probability.
If the data is not transferred, the frame restarts with the following time slot after waiting for a (q = 1-
p probability) random period.
4. O-Persistent: A supervisory node gives each node a transmission order. Nodes wait for their time
slot according to their allocated transmission sequence when the transmission medium is idle.
Advantages of CSMA:
1. Increased efficiency: CSMA ensures that only one device communicates on the network at a time,
reducing collisions and improving network efficiency.
2. Simplicity: CSMA is a simple protocol that is easy to implement and does not require complex
hardware or software.
3. Flexibility: CSMA is a flexible protocol that can be used in a wide range of network environments,
including wired and wireless networks.
4. Low cost: CSMA does not require expensive hardware or software, making it a cost-effective
solution for network communication.
Disadvantages of CSMA:
1. Limited scalability: CSMA is not a scalable protocol and can become inefficient as the number of
devices on the network increases.
2. Delay: In busy networks, the requirement to sense the medium and wait for an available channel
can result in delays and increased latency.
3. Limited reliability: CSMA can be affected by interference, noise, and other factors, resulting in
unreliable communication.
4. Vulnerability to attacks: CSMA can be vulnerable to certain types of attacks, such as jamming
and denial-of-service attacks, which can disrupt network communication.
37
Comparison of various protocols:
Transmission Collision detection

Protocol Efficiency Use cases
behavior method
Low-traffic
Pure Sends frames No collision
Low networks
ALOHA immediately detection
Better than Low-traffic

Slotted Sends frames at No collision
pure networks
ALOHA specific time slots detection
ALOHA
Monitors medium after

Collision detection Wired networks
sending a frame,
CSMA/CD by monitoring High with moderate to
retransmits if
transmissions high traffic
necessary
Wireless
Monitors medium Collision avoidance
networks with
while transmitting, through random
CSMA/CA High moderate to high
adjusts behavior to backoff time
traffic and high
avoid collisions intervals
error rates
B. Controlled Access Protocol
In controlled access, the stations seek information from one another to find which station has the right
to send. It allows only one node to send at a time, to avoid the collision of messages on a shared
medium. The three controlled-access methods are:
1. Reservation
2. Polling
3. Token Passing
Reservation
 In the reservation method, a station needs to make a reservation before sending data.
 The timeline has two kinds of periods:
1. Reservation interval of fixed time length
2. Data transmission period of variable frames.
 If there are M stations, the reservation interval is divided into M slots, and each station has o ne slot.
 Suppose if station 1 has a frame to send, it transmits 1 bit during the slot 1. No other station is
allowed to transmit during this slot.
 In general, i th station may announce that it has a frame to send by inserting a 1 bit into i th slot.
After all N slots have been checked, each station knows which stations wish to transmit.
 The stations which have reserved their slots transfer their frames in that order.
 After data transmission period, next reservation interval begins.
 Since everyone agrees on who goes next, there will never be any collisions.
38
The following figure shows a situation with five stations and a five-slot reservation frame. In the first
interval, only stations 1, 3, and 4 have made reservations. In the second interval, only station 1 has
made a reservation.
Advantages of Reservation:
 The main advantage of reservation is high rates and low rates of data accessing time of the
respective channel can be predicated easily. Here time and rates are fixed.
 Priorities can be set to provide speedier access from secondary.
 Predictable network performance: Reservation-based access methods can provide predictable
network performance, which is important in applications where latency and jitter must be
minimized, such as in real-time video or audio streaming.
 Reduced contention: Reservation-based access methods can reduce contention for network
resources, as access to the network is pre-allocated based on reservation requests. This can improve
network efficiency and reduce packet loss.
 Quality of Service (QoS) support: Reservation-based access methods can support QoS
requirements, by providing different reservation types for different types of traffic, such as voice,
video, or data. This can ensure that high-priority traffic is given preferential treatment over lower-
priority traffic.
 Efficient use of bandwidth: Reservation-based access methods can enable more efficient use of
available bandwidth, as they allow for time and frequency multiplexing of different reservation
requests on the same channel.
 Support for multimedia applications: Reservation-based access methods are well-suited to
support multimedia applications that require guaranteed network resources, such as bandwidth and
latency, to ensure high-quality performance.
Disadvantages of Reservation:
 Highly trust on controlled dependability.
 Decrease in capacity and channel data rate under light loads; increase in turn-around time.

Polling
 Polling process is similar to the roll-call performed in class. Just like the teacher, a controller sends
a message to each node in turn.
 In this, one acts as a primary station(controller) and the others are secondary stations. All data
exchanges must be made through the controller.
 The message sent by the controller contains the address of the node being selected for granting
access.
 Although all nodes receive the message the addressed one responds to it and sends data if any. If
there is no data, usually a “poll reject”(NAK) message is sent back.
 Problems include high overhead of the polling messages and high dependence on the reliability of
the controller.
39
Advantages of Polling:
 The maximum and minimum access time and data rates on the channel are fixed predictable.
 It has maximum efficiency.
 It has maximum bandwidth.
 No slot is wasted in polling.
 There is assignment of priority to ensure faster access from some secondary.
Disadvantages of Polling:
 It consume more time.
 Since every station has an equal chance of winning in every round, link sharing is biased.
 Only some station might run out of data to send.
 An increase in the turnaround time leads to a drop in the data rates of the channel under low loads.
Efficiency Let T poll be the time for polling and T t be the time required for transmission of data. Then,
Efficiency = Tt/(Tt + Tpoll)
Token Passing
 In token passing scheme, the stations are connected logically to each other in form of ring and
access to stations is governed by tokens.
 A token is a special bit pattern or a small message, which circulate from one station to the next in
some predefined order.
 In Token ring, token is passed from one station to another adjacent station in the ring whereas
incase of Token bus, each station uses the bus to send the token to the next station in some
predefined order.
 In both cases, token represents permission to send. If a station has a frame queued for transmission
when it receives the token, it can send that frame before it passes the token to the next station. If it
has no queued frame, it passes the token simply.
 After sending a frame, each station must wait for all N stations (including itself) to send the token
to their neighbours and the other N – 1 stations to send a frame, if they have one.
 There exists problems like duplication of token or token is lost or insertion of new station, removal
of a station, which need be tackled for correct and reliable operation of this scheme.
40
Performance of token ring can be concluded by 2 parameters:-

1. Delay, is a measure of time between when a packet is ready and when it is delivered. So, the
average time (delay) required to send a token to the next station = a/N.
2. Throughput, which is a measure of successful traffic.
Throughput, S = 1/(1 + a/N) for a<1
and
S = 1/{a(1 + 1/N)} for a>1.
where N = number of stations
a = Tp/Tt
(Tp = propagation delay and Tt = transmission delay)
Advantages of Token passing:
 It may now be applied with routers cabling and includes built-in debugging features like protective
relay and auto reconfiguration.
 It provides good throughput when conditions of high load.
Disadvantages of Token passing:
 Its cost is expensive.
 Topology components are more expensive than those of other, more widely used standard.
 The hardware element of the token rings are designed to be tricky. This implies that you should
choose on manufacture and use them exclusively.
Unlock the Power of Placement Preparation!
C. Channelization Protocols
It is a channelization protocol that allows the total usable bandwidth in a shared channel to be shared
across multiple stations based on their time, distance and codes. It can access all the stations at the same
time to send the data frames to the channel.
41
Following are the various methods to access the channel based on their time, distance and codes:
1. FDMA (Frequency Division Multiple Access)

2. TDMA (Time Division Multiple Access)
3. CDMA (Code Division Multiple Access)
1. Frequency Division Multiple Access (FDMA) : FDMA is a type of channelization protocol. In this
bandwidth is divided into various frequency bands. Each station is allocated with band to send data and
that band is reserved for particular station for all the time which is as follows :
Figure – FDMA
The frequency bands of different stations are separated by small band of unused frequency and that
unused frequency bands are called as guard bands that prevents the interference of stations. It is like
access method in data link layer in which data link layer at each station tells its physical layer to make
a band pass signal from the data passed to it. The signal is created in the allocated band and there is no
physical multiplexer at the physical layer.
2. Time Division Multiple Access (TDMA) : TDMA is the channelization protocol in which
bandwidth of channel is divided into various stations on the time basis. There is a time slot given to
each station, the station can transmit data during that time slot only which is as follows :
42
Figure – TDMA
Each station must aware of its beginning of time slot and the location of the time slot. TDMA requires
synchronization between different stations. It is type of access method in the data link layer. At each
station data link layer tells the station to use the allocated time slot.
3. Code Division Multiple Access (CDMA) : In CDMA, all the stations can transmit data
simultaneously. It allows each station to transmit data over the entire frequency all the time. Multiple
simultaneous transmissions are separated by unique code sequence. Each user is assigned with a unique
code sequence.
Figure – CDMA
43
In the above figure, there are 4 stations marked as 1, 2, 3 and 4. Data assigned with respective stations
as d1, d2, d3 and d4 and the code assigned with respective stations as c1, c2, c3 and c4.
 Orthogonal Frequency Division Multiple Access (OFDMA) – In OFDMA the available

bandwidth is divided into small subcarriers in order to increase the overall performance, Now the
data is transmitted through these small subcarriers. it is widely used in the 5G technology.
Advantages:
 Increase in efficiency
 High data rates
 Good for multimedia traffic
Disadvantages:
 Complex to implement
 High peak to power ratio
 Spatial Division Multiple Access (SDMA) – SDMA uses multiple antennas at the transmitter and
receiver to separate the signals of multiple users that are located in different spatial directions. This
technique is commonly used in MIMO (Multiple-Input, Multiple-Output) wireless communication
systems.
Advantages :
 Frequency band uses effectively
 The overall signal quality will be improved
 The overall data rate will be increased
Disadvantages :
 It is complex to implement
 It require the accurate information about the channel
Difference between FDMA, CDMA and TDMA :

FDMA TDMA CDMA
FDMA stands for Frequency TDMA stands for Time CDMA stands for Code
Division Multiple Access. Division Multiple Access. Division Multiple Access.
In this, sharing of bandwidth In this, only the sharing of In this, there is sharing of both
among different stations takes time of satellite i.e. bandwidth and time among
place. transponder takes place. different stations takes place.
There is no need of any There is no need of any

Codeword is necessary.
codeword. codeword.
In this, there is only need of

In this, guard time of the
guard bands between the In this, both guard bands and
adjacent slots are
adjacent channels are guard time are necessary.
necessary.
necessary.
Synchronization is not Synchronization is Synchronization is not

required. required. required.
44
FDMA TDMA CDMA
The rate of data is

The rate of data is low. The rate of data is high.
medium.
Mode of data transfer is Mode of data transfer is Mode of data transfer is digital
continuous signal. signal in bursts. signal.
It is little flexible. It is moderate flexible. It is highly flexible.

45
UNIT III
WIRED A N D WIRELESS LANS
WIRED LANS: Ethernet, Ethernet Protocol: IEEE802- Data Link Layer- Physical Layer, STANDARD
ETHERNET: MAC Sub layer- Physical Layer, CHANGES IN THE STANDARD: Bridged Ethernet
Switched Ethernet-Full-Duplex Ethernet. WIRELESS LANS: IEEE 802.11- Architecture- MAC Sub
layer- Addressing Mechanism- Physical Layer. BLUETOOTH: Architecture.
ETHERNET:
What is Ethernet?
Ethernet is the most widely used LAN technology and is defined under IEEE standards 802.3. The reason
behind its wide usability is that Ethernet is easy to understand, implement, and maintain, and allows low-
cost network implementation. Also, Ethernet offers flexibility in terms of the topologies that are allowed.
Ethernet generally uses a bus topology. Ethernet operates in two layers of the OSI model, the physical
layer and the data link layer. For Ethernet, the protocol data unit is a frame since we mainly deal with
DLLs. In order to handle collisions, the Access control mechanism used in Ethernet is CSMA/CD.
Although Ethernet has been largely replaced by wireless networks, wired networking still uses Ethernet
more frequently. Wi-Fi eliminates the need for cables by enabling users to connect their smartphones or
laptops to a network wirelessly. The 802.11ac Wi-Fi standard offers faster maximum data transfer rates
when compared to Gigabit Ethernet. However, wired connections are more secure and less susceptible
to interference than wireless networks. This is the main justification for why so many companies and
organizations continue to use Ethernet.
There are different types of Ethernet networks that are used to connect devices and transfer data.
Let’s discuss them in simple terms:
1. Fast Ethernet: This type of Ethernet network uses cables called twisted pair or CAT5. It can transfer
data at a speed of around 100 Mbps (megabits per second). Fast Ethernet uses both fiber optic and twisted
pair cables to enable communication. There are three categories of Fast Ethernet: 100BASE-TX,
100BASE-FX, and 100BASE-T4.
2. Gigabit Ethernet: This is an upgrade from Fast Ethernet and is more common nowadays. It can
transfer data at a speed of 1000 Mbps or 1 Gbps (gigabit per second). Gigabit Ethernet also uses fiber
optic and twisted pair cables for communication. It often uses advanced cables like CAT5e, which can
transfer data at a speed of 10 Gbps.
3.10-Gigabit Ethernet: This is an advanced and high-speed network that can transmit data at a speed of
10 gigabits per second. It uses special cables like CAT6a or CAT7 twisted-pair cables and fiber optic
cables. With the help of fiber optic cables, this network can cover longer distances, up to around 10,000
meters.
4. Switch Ethernet: This type of network involves using switches or hubs to improve network
performance. Each workstation in this network has its own dedicated connection, which improves the
speed and efficiency of data transfer. Switch Ethernet supports a wide range of speeds, from 10 Mbps to
10 Gbps, depending on the version of Ethernet being used.
Key Features of Ethernet
1. Speed: Ethernet is capable of transmitting data at high speeds, with current Ethernet standards
supporting speeds of up to 100 Gbps.
2. Flexibility: Ethernet is a flexible technology that can be used with a wide range of devices and
operating systems. It can also be easily scaled to accommodate a growing number of users and
devices.
46
3. Reliability: Ethernet is a reliable technology that uses error-correction techniques to ensure that
data is transmitted accurately and efficiently.
4. Cost-effectiveness: Ethernet is a cost-effective technology that is widely available and easy to
implement. It is also relatively low-maintenance, requiring minimal ongoing support.
5. Interoperability: Ethernet is an interoperable technology that allows devices from different
manufacturers to communicate with each other seamlessly.
6. Security: Ethernet includes built-in security features, including encryption and authentication, to
protect data from unauthorized access.
7. Manageability: Ethernet networks are easily managed, with various tools available to help network
administrators monitor and control network traffic.
8. Compatibility: Ethernet is compatible with a wide range of other networking technologies, making
it easy to integrate with other systems and devices.
9. Availability: Ethernet is a widely available technology that can be used in almost any setting, from
homes and small offices to large data centers and enterprise-level networks.
10. Simplicity: Ethernet is a simple technology that is easy to understand and use. It does not require
specialized knowledge or expertise to set up and configure, making it accessible to a wide range of
users.
11. Standardization: Ethernet is a standardized technology, which means that all Ethernet devices and
systems are designed to work together seamlessly. This makes it easier for network administrators
to manage and troubleshoot Ethernet networks.
12. Scalability: Ethernet is highly scalable, which means it can easily accommodate the addition of
new devices, users, and applications without sacrificing performance or reliability.
13. Broad compatibility: Ethernet is compatible with a wide range of protocols and technologies,
including TCP/IP, HTTP, FTP, and others. This makes it a versatile technology that can be used in
a variety of settings and applications.
14. Ease of integration: Ethernet can be easily integrated with other networking technologies, such as
Wi-Fi and Bluetooth, to create a seamless and integrated network environment.
15. Ease of troubleshooting: Ethernet networks are easy to troubleshoot and diagnose, thanks to a
range of built-in diagnostic and monitoring tools. This makes it easier for network administrators to
identify and resolve issues quickly and efficiently.
16. Support for multimedia: Ethernet supports multimedia applications, such as video and audio
streaming, making it ideal for use in settings where multimedia content is a key part of the user
experience.Ethernet is a reliable, cost-effective, and widely used LAN technology that offers high-
speed connectivity and easy manageability for local networks.
Advantages of Ethernet
Speed: When compared to a wireless connection, Ethernet provides significantly more speed. Because
Ethernet is a one-to-one connection, this is the case. As a result, speeds of up to 10 Gigabits per second
(Gbps) or even 100 Gigabits per second (Gbps) are possible.
Efficiency: An Ethernet cable, such as Cat6, consumes less electricity, even less than a wifi
connection. As a result, these ethernet cables are thought to be the most energy-efficient.
Good data transfer quality: Because it is resistant to noise, the information transferred is of high
quality.
Baud rate = 2* Bit rate
Ethernet LANs consist of network nodes and interconnecting media, or links.
The network nodes can be of two types:
Data Terminal Equipment (DTE): Media, Generally, DTEs are the end devices that convert the user
information into signals or reconvert the received signals. DTE devices are: personal computers,
workstations, file servers or print servers also referred to as end stations. These devices are either the
source or the destination of data frames. The data terminal equipment may be a single piece of
equipment or multiple pieces of equipment that are interconnected and perform all the required
functions to allow the user to communicate. A user can interact with DTE or DTE may be a user.
47
Data Communication Equipment (DCE):- DCEs are the intermediate network devices that receive
and forward frames across the network. They may be either standalone devices such as repeaters,
network switches, or routers, or maybe communications interface units such as interface cards and
modems. The DCE performs functions such as signal conversion, coding, and maybe a part of the DTE
or intermediate equipment.
Disadvantages of Ethernet
Distance limitations: Ethernet has distance limitations, with the maximum cable length for a standard
Ethernet network being 100 meters. This means that it may not be suitable for larger networks that require
longer distances.
Bandwidth sharing: Ethernet networks share bandwidth among all connected devices, which can result
in reduced network speeds as the number of devices increases.
Security vulnerabilities: Although Ethernet includes built-in security features, it is still vulnerable to
security breaches, including unauthorized access and data interception.
Complexity: Ethernet networks can be complex to set up and maintain, requiring specialized knowledge
and expertise.
Compatibility issues: While Ethernet is generally interoperable with other networking technologies,
compatibility issues can arise when integrating with older or legacy systems.
Cable installation: Ethernet networks require the installation of physical cables, which can be time-
consuming and expensive to install.
Physical limitations: Ethernet networks require physical connections between devices, which can limit
mobility and flexibility in network design.
Basic frame format which is required for all MAC implementation is defined in IEEE 802.3 standard.
Though several optional formats are being used to extend the protocol’s basic capability. Ethernet frame
starts with Preamble and SFD, both work at the physical layer. Ethernet header contains both the Source
and Destination MAC address, after which the payload of the frame is present. The last field is CRC
which is used to detect the error. Now, let’s study each field of basic frame format.
Ethernet (IEEE 802.3) Frame Format:
1. PREAMBLE – Ethernet frame starts with a 7-Bytes Preamble. This is a pattern of alternative 0’s
and 1’s which indicates starting of the frame and allow sender and receiver to establish bit
synchronization. Initially, PRE (Preamble) was introduced to allow for the loss of a few bits due to
signal delays. But today’s high-speed Ethernet doesn’t need Preamble to protect the frame bits.
PRE (Preamble) indicates the receiver that frame is coming and allow the receiver to lock onto the
data stream before the actual frame begins.
2. Start of frame delimiter (SFD) – This is a 1-Byte field that is always set to 10101011. SFD
indicates that upcoming bits are starting the frame, which is the destination address. Sometimes
SFD is considered part of PRE, this is the reason Preamble is described as 8 Bytes in many places.
The SFD warns station or stations that this is the last chance for synchronization.
48
3. Destination Address – This is a 6-Byte field that contains the MAC address of the machine for
which data is destined.
4. Source Address – This is a 6-Byte field that contains the MAC address of the source machine. As
Source Address is always an individual address (Unicast), the least significant bit of the first byte is
always 0.
5. Length – Length is a 2-Byte field, which indicates the length of the entire Ethernet frame. This 16-
bit field can hold a length value between 0 to 65534, but length cannot be larger than 1500 Bytes
because of some own limitations of Ethernet.
6. Data – This is the place where actual data is inserted, also known as Payload. Both IP header and
data will be inserted here if Internet Protocol is used over Ethernet. The maximum data present may
be as long as 1500 Bytes. In case data length is less than minimum length i.e. 46 bytes, then
padding 0’s is added to meet the minimum possible length.
7. Cyclic Redundancy Check (CRC) – CRC is 4 Byte field. This field contains a 32-bits hash code
of data, which is generated over the Destination Address, Source Address, Length, and Data field.
If the checksum computed by destination is not the same as sent checksum value, data received is
corrupted.
8. VLAN Tagging – The Ethernet frame can also include a VLAN (Virtual Local Area Network) tag,
which is a 4-byte field inserted after the source address and before the EtherType field. This tag
allows network administrators to logically separate a physical network into multiple virtual
networks, each with its own VLAN ID.
9. Jumbo Frames – In addition to the standard Ethernet frame size of 1518 bytes, some network
devices support Jumbo Frames, which are frames with a payload larger than 1500 bytes. Jumbo
Frames can increase network throughput by reducing the overhead associated with transmitting a
large number of small frames.
10. Ether Type Field – The EtherType field in the Ethernet frame header identifies the protocol carried
in the payload of the frame. For example, a value of 0x0800 indicates that the payload is an IP
packet, while a value of 0x0806 indicates that the payload is an ARP (Address Resolution Protocol)
packet.
11. Multicast and Broadcast Frames – In addition to Unicast frames (which are sent to a specific
destination MAC address), Ethernet also supports Multicast and Broadcast frames. Multicast frames
are sent to a specific group of devices that have joined a multicast group, while Broadcast frames
are sent to all devices on the network.
12. Collision Detection – In half-duplex Ethernet networks, collisions can occur when two devices
attempt to transmit data at the same time. To detect collisions, Ethernet uses a Carrier Sense
Multiple Access with Collision Detection (CSMA/CD) protocol, which listens for activity on the
network before transmitting data and backs off if a collision is detected.
IEEE Project 802

. In 1985, the Computer Society of the IEEE started a project, called Project 802, to set standards
to enable intercommunication among equipment from a variety of manufacturers. Project 802 does not
seek to replace any part of the OSI model or TCP/IP protocol suite. Instead, it is a way of specifying
functions of the physical layer and the data-link layer of major LAN protocols. The relationship of the
802 Standard to the TCP/IP protocol suite is shown in Figure 13.1. The IEEE has subdivided the data-link
layer into two sublayers: logical link control (LLC) and media access control (MAC). IEEE has also
created several physical-layer standards for different LAN protocols.
Logical Link Control (LLC) Earlier we discussed data link control. We said that data link control
handles framing, flow control, and error control. In IEEE Project 802, flow control, error control, and part
of the framing duties are collected into one sublayer called the logical link control (LLC). Framing is
handled in both the LLC sublayer and the MAC sublayer. The LLC provides a single link-layer control
49
protocol for all IEEE LANs. This means LLC protocol can provide interconnectivity between different
LANs because it makes the MAC sublayer transparent.
Changes In The Standard

The 10-Mbps Standard Ethernet has gone through several changes before moving to the higher data rates.
These changes actually opened the road to the evolution of the Ethernet to become compatible with other
high-data-rate LANs.
1. Bridged Ethernet
The first step in the Ethernet evolution was the division of a LAN by bridges. Bridges have two effects on
an Ethernet LAN: They raise the bandwidth and they separate collision domains.
Raising the Bandwidth
In an unbridged Ethernet network, the total capacity (10 Mbps) is shared among all stations with a frame
to send; the stations share the bandwidth of the network. If only one station has frames to send, it benefits
from the total capacity (10 Mbps). But if more than one station needs to use the network, the capacity is
shared. For example, if two stations have a lot of frames to send, they probably alternate in usage. When
one station is sending, the other one refrains from sending.
50
A bridge divides the network into two or more networks. Bandwidth-wise, each network is independent. a
network with 12 stations is divided into two networks, each with 6 stations. Now each network has a
capacity of 10 Mbps. The 10-Mbps capacity in each segment is now shared between 6 stations (actually 7
because the bridge acts as a station in each segment), not 12 stations. In a network with a heavy load, each
station theoretically is offered 10/6 Mbps instead of 10/12 Mbps, assuming that the traffic is not going
through the bridge
Separating Collision Domains

Another advantage of a bridge is the separation of the collision domain. The collision domain becomes
much smaller and the probability of collision is reduced tremendously. Without bridging, 12 stations
contend for access to the medium; with bridging only 3 stations contend for access to the medium
2. Switched Ethernet
The idea of a bridged LAN can be extended to a switched LAN. Instead of having two to four networks.
The bandwidth is shared only between the station and the switch (5 Mbps each). In addition, the collision
domain is divided into N domains. A layer 2 switch is an N-port bridge with additional sophistication that
allows faster handling of the packets. Evolution from a bridged Ethernet to a switched Ethernet was a big
step that opened the way to an even faster Ethernet.
51
3. Full-Duplex Ethernet
One of the limitations of 10Base5 and l0Base2 is that communication is half-duplex, a station can either
send or receive, but may not do both at the same time. The next step in the evolution was to move from
switched Ethernet to full-duplex switched Ethernet. The full-duplex mode increases the capacity of each
domain from 10 to 20 Mbps.
IEEE 802.11 Architecture

The IEEE 802.11 standard, commonly known as Wi-Fi, outlines the architecture and defines the MAC
and physical layer specifications for wireless LANs (WLANs). Wi-Fi uses high-frequency radio waves
instead of cables for connecting the devices in LAN. Given the mobility of WLAN nodes, they can move
unrestricted within the network coverage zone. The 802.11 structure is designed to accommodate mobile
stations that participate actively in network decisions. Furthermore, it can seamlessly integrate with 2G,
3G, and 4G networks.
The Wi-Fi standard represents a set of wireless LAN standards developed by the Working Group of IEEE
LAN/MAN standards committee (IEEE 802). The term 802.11x is also used to denote the set of
standards. Various specifications and amendments include 802.11a, 802.11b, 802.11e, 802.11g, 802.11n
etc.
Station: Stations (STA) comprise all devices and equipment that are connected to the wireless LAN. It
can be of two types:
52
 Wireless Access Point (WAP): WAPs or simply access points (AP) are wireless routers that bridge
connections for base stations.
 Client: Examples include computers, laptops, printers, and smartphones.
Access Point: It is a device that can be classified as a station because of its functionalities and acts as a
connection between wireless medium and distributed systems.
Distribution System: A system used to interconnect a set of BSSs and integrated LANs to create an
ESS.
Frame: It is a MAC protocol data unit.
SSID (Service Set Identifier): It’s the network name for a particular WLAN. All-access points and
devices on a specific WLAN must use the same SSID to communicate.
SDU: It is a data unit that acts as an input to each layer. These can be fragmented or aggregated to form
a PDU.
PDU: It is a data unit projected as an output to communicate with the corresponding layer at the other
end. They contain a header specific to the layer.
Network Interface Controller: It is also known as network interface card. It is a hardware component
that connects devices to the network.
Portal: Serves as a gateway to other networks
IEEE 802.11 Architecture and Services

In the year 1990, IEEE 802.11 Committee formed a new working group, the IEEE 802.11 standard which
defines protocols for Wireless Local Area Networks (WLANs). Just like how Ethernet provides services
for wired media, IEEE 802.11 architecture is designed to provide features for wireless networks.
An AP supports both wired and wireless connections. The 802.11 standard calls the upstream wired
network the distribution system (DS). The AP bridges the wireless and wired L2 Ethernet frames,
allowing traffic to flow from the wired to the wireless network and vice versa. Each wireless network
has a unique SSID.
The 802.11 architecture provides some basic services for WLANs whose implementation is supported
by MAC layer:
Basic Service Set
The Basic Service Set configuration consists of a group of stations and relies on an Access Point (AP),
which serves as a logical hub. Stations from different BSSs interact through the AP, which functions as
a bridge, linking multiple WLAN cells or channels.
Operating Modes
Depending upon the mode of operation, BSS can be categorized into the following types:
 Infrastructure BSS: Communication between stations takes place through access points. The AP
and its associated wireless clients define the coverage area and form the BSS.
53
Infrastructure BSS
 Independent BSS – Supports mutual communication between wireless clients. An ad-hoc network
is spontaneously created and does not support access to wired networks.
Independent BSS
Independent Basic Service Set

In the IBSS configuration, also referred to as independent configuration or ad-hoc network, no single
node is required to act as a server. The stations communicate directly with one another in a peer-to-peer
basis. Generally, IBSS covers a limited area instead of a large network. Typically covering a specific
area, IBSS is used for specific, short-term purposes with a limited number of nodes.
Extended Service Set
ESS connects multiple BSSs and consists of several BSS cells, which can be interlinked through wired
or wireless backbones known as a distributed system. Multiple cells use the same channel to boost
aggregate throughput to network. The equipment outside of the ESS, the ESS and all of its mobile stations
comprise a single MAC layer network where all stations are virtually stationary. Thus, all stations within
the ESS appear stationary from an outsider’s perspective.
Other components include:
 Distribution System (DS): Links APs within the ESS.
54
 Portal: Serves as a gateway to other networks.
Architecture for IEEE 802.11 Configuration
 Roaming: In an environment with multiple access points (like a large office building or campus), a
device can move from the range of one AP to another and still maintain its connection. This is
possible due to the underlying architecture of the IEEE 802.11 standard which allows for roaming
between APs.
 Authentication and Association: Before a station can send or receive data frames on a WLAN, it
needs to establish its identity with an AP. This process is called authentication. After
authentication, the station then establishes a data link-layer connection with the AP through a
process called association.
IEEE 802.11 Mac Frame
MAC layer provides functionality for several tasks like control medium access, can also offer support
for roaming, authentication, and power conservation. The basic services provided by MAC are the
mandatory asynchronous data service and optional time-bounded service. IEEE 802.11 defines two
MAC sub-layers:-
1. Distributed Coordination Function (DCF) – DCF uses CSMA/CA as access method as wireless
LAN can’t implement CSMA/CD. It only offers asynchronous service.
2. Point Coordination Function (PCF) – PCP is implemented on top of DCF and mostly used for
time-service transmission. It uses a centralized, contention-free polling access method. It offers
both asynchronous and time-bounded service.
55
MAC Frame: The MAC layer frame consists of 9 fields. The following figure shows the basic
structure of an IEEE 802.11 MAC data frame along with the content of the frame control field.
 Frame Control(FC) – It is 2 bytes long field which defines type of frame and some control
information. Various fields present in FC are:
1. Version: It is a 2 bit long field which indicates the current protocol version which is fixed to be
0 for now.
2. Type: It is a 2 bit long field which determines the function of frame i.e management(00),
control(01) or data(10). The value 11 is reserved.
3. Subtype: It is a 4 bit long field which indicates sub-type of the frame like 0000 for association
request, 1000 for beacon.
4. To DS: It is a 1 bit long field which when set indicates that destination frame is for
DS(distribution system).
5. From DS: It is a 1 bit long field which when set indicates frame coming from DS.
6. More frag (More fragments): It is 1 bit long field which when set to 1 means frame is
followed by other fragments.
7. Retry: It is 1-bit long field, if the current frame is a retransmission of an earlier frame, this bit
is set to 1.
8. Power Mgmt (Power management): It is 1-bit long field that indicates the mode of a station
after successful transmission of a frame. Set to 1 the field indicates that the station goes into
power-save mode. If the field is set to 0, the station stays active.
9. More data: It is 1-bit long field that is used to indicate receiver that a sender has more data to
send than the current frame. This can be used by an access point to indicate to a station in
power-save mode that more packets are buffered or it can be used by a station to indicate to an
access point after being polled that more polling is necessary as the station has more data ready
to transmit.
10. WEP: It is 1 bit long field which indicates that the standard security mechanism of 802.11 is
applied.
11. Order: It is 1 bit long field, if this bit is set to 1 the received frames must be processed in strict
order.
 Duration/ID – It is 4 bytes long field which contains the value indicating the period of time in
which the medium is occupied( in µs).
 Address 1 to 4 – These are 6 bytes long fields which contain standard IEEE 802 MAC addresses
(48 bit each). The meaning of each address depends on the DS bits in the frame control field.
56
 SC (Sequence control) – It is 16 bits long field which consists of 2 sub-fields, i.e., Sequence
number (12 bits) and Fragment number (4 bits). Since acknowledgement mechanism frames may be
duplicated hence, a sequence number is used to filter duplicate frames.
 Data – It is a variable length field which contain information specific to individual frames which is
transferred transparently from a sender to the receiver(s).
 CRC (Cyclic redundancy check) – It is 4 bytes long field which contains a 32 bit CRC error
detection sequence to ensure error free frame.
features of the IEEE 802.11 MAC frame :
Frame Control Field: The frame control field contains information about the type of frame, the data
rate, and the power management status.
Duration Field: The duration field specifies the length of time that the channel will be occupied by the
transmission.
Address Fields: The address fields specify the source and destination MAC addresses of the Wi-Fi
devices involved in the communication.
Sequence Control Field: The sequence control field is used to identify and manage the transmission
sequence of the frames.
Frame Body: The frame body contains the actual data being transmitted between Wi-Fi devices, such
as IP packets, TCP segments, or UDP datagrams.
Frame Check Sequence: The frame check sequence (FCS) is used to check the integrity of the data
transmitted in the frame and to detect any transmission errors.
Management, Control, and Data Frames: The IEEE 802.11 MAC frame defines three types of
frames: management frames, control frames, and data frames. Management frames are used for
network management, control frames are used for coordination between Wi-Fi devices, and data frames
are used for the transmission of actual data.
Fragmentation: The IEEE 802.11 MAC frame supports fragmentation, which allows large data
packets to be divided into smaller fragments for transmission.
Acknowledgments: The IEEE 802.11 MAC frame uses acknowledgments to confirm the successful
transmission of frames and to request the retransmission of any frames that were not successfully
received.
Advantages of IEEE 802.11 Architecture
 Fault Tolerance: The centralized architecture minimizes the bottlenecks and introduces resilience
in the WLAN equipment.
 Flexible Architecture: Supports both temporary smaller networks and larger, more permanent
ones.
 Prolonged Battery Life: Efficient power-saving protocols extend mobile device battery life
without compromising network connections.
Disadvantages of IEEE 802.11 Architecture
 Noisy Channels: Due to reliance on radio waves, signals may experience interference from nearby
devices.
 Greater Bandwidth and Complexity: Due to necessary data encryption and susceptibility to
errors, WLANs need more bandwidth than their wired counterparts.
 Speed: Generally, WLANs offer slower speeds compared to wired LANs.
57
Applications of IEEE 802.11 Architecture
 Home Networking: Connecting devices, laptops, smart TVs, speakers, gaming consoles etc.
 Wi-Fi Hotspots: Free or paid internet access to visitors in coffee shops, hotels, airports, malls and
restaurants.
 Connectivity in Campus: Provide internet access in university, colleges, schools or corporate
campuses.
system (From DS =0). The frame is going from one station in a BSS to another without passing through
the distribution system. The ACK frame should be sent to the original sender. The addresses are shown in
Figure
58
 Case 2: 01 In this case, To DS = 0 and From DS = 1. This means that the frame is coming from a
distribution system (From DS = 1). The frame is coming from an AP and going to a station. The
ACK should be sent to the AP. The addresses are as shown in Figure 14.9. Note that address 3
contains the original sender of the frame (in another BSS)
 Case 3: 10 In this case, To DS =1 and From DS = O. This means that the frame is going to a
distribution system (To DS = 1). The frame is going from a station to an AP. The ACK is sent to
the original station. The addresses are as shown in Figure 14.9. Note that address 3 contains the
final destination of the frame (in another BSS).
 Case 4:11 In this case, To DS =1 and From DS =1. TIus is the case in which the distribution
system is also wireless. The frame is going from one AP to anotherAP in a wireless distribution
system. We do not need to define addresses if the distribution system is a wired LAN because the
frame in these cases has the format of a wired LAN frame (Ethernet, for example). Here, we need
four addresses to define the original sender, the final destination, and two intermediate APs.
BLUETOOTH
Bluetooth is universal for short-range wireless voice and data communication. It is a Wireless Personal
Area Network (WPAN) technology and is used for exchanging data over smaller distances. This
technology was invented by Ericson in 1994. It operates in the unlicensed, industrial, scientific, and
medical (ISM) band from 2.4 GHz to 2.485 GHz. Maximum devices that can be connected at the same
time are 7. Bluetooth ranges up to 10 meters. It provides data rates up to 1 Mbps or 3 Mbps depending
upon the version. The spreading technique that it uses is FHSS (Frequency-hopping spread spectrum). A
Bluetooth network is called a piconet and a collection of interconnected piconets is called scatternet.
What is Bluetooth?
Bluetooth simply follows the principle of transmitting and receiving data using radio waves. It can be
paired with the other device which has also Bluetooth but it should be within the estimated
59
communication range to connect. When two devices start to share data, they form a network called
piconet which can further accommodate more than five devices.
Points to remember for Bluetooth:
 Bluetooth Transmission capacity 720 kbps.
 Bluetooth is Wireless.
 Bluetooth is a Low-cost short-distance radio communications standard.
 Bluetooth is robust and flexible.
 Bluetooth is cable replacement technology that can be used to connect almost any device to any other
device.
 The basic architecture unit of Bluetooth is a piconet.
Bluetooth Architecture:
The architecture of Bluetooth defines two types of networks:

1. Piconet
2. Scatternet
Piconet:
Piconet is a type of Bluetooth network that contains one primary node called the master node
and seven active secondary nodes called slave nodes. Thus, we can say that there is a total of 8 active
nodes which are present at a distance of 10 meters. The communication between the primary and
secondary nodes can be one-to-one or one-to-many. Possible communication is only between the
master and slave; Slave-slave communication is not possible. It also has 255 parked nodes, these are
secondary nodes and cannot take participation in communication unless it gets converted to the active
state.
Scatternet:
It is formed by using various piconets. A slave that is present in one piconet can act as master or we
can say primary in another piconet. This kind of node can receive a message from a master in one
piconet and deliver the message to its slave in the other piconet where it is acting as a master. This type
of node is referred to as a bridge node. A station cannot be mastered in two piconets.
60
Bluetooth protocol stack:
1. Radio (RF) layer: It specifies the details of the air interface, including frequency, the use of
frequency hopping and transmit power. It performs modulation/demodulation of the data into RF
signals. It defines the physical characteristics of Bluetooth transceivers. It defines two types of
physical links: connection-less and connection-oriented.
2. Baseband Link layer: The baseband is the digital engine of a Bluetooth system and is equivalent
to the MAC sublayer in LANs. It performs the connection establishment within a piconet,
addressing, packet format, timing and power control.
3. Link Manager protocol layer: It performs the management of the already established links which
includes authentication and encryption processes. It is responsible for creating the links, monitoring
their health, and terminating them gracefully upon command or failure.
4. Logical Link Control and Adaption (L2CAP) Protocol layer: It is also known as the heart of the
Bluetooth protocol stack. It allows the communication between upper and lower layers of the
Bluetooth protocol stack. It packages the data packets received from upper layers into the form
expected by lower layers. It also performs segmentation and multiplexing.
5. Service Discovery Protocol (SDP) layer: It is short for Service Discovery Protocol. It allows
discovering the services available on another Bluetooth-enabled device.
6. RF comm layer: It is a cabal replacement protocol. It is short for Radio Frontend Component. It
provides a serial interface with WAP and OBEX. It also provides emulation of serial ports over the
logical link control and adaption protocol(L2CAP). The protocol is based on the ETSI standard TS
07.10.
61
7. OBEX: It is short for Object Exchange. It is a communication protocol to exchange objects
between 2 devices.
8. WAP: It is short for Wireless Access Protocol. It is used for internet access.
9. TCS: It is short for Telephony Control Protocol. It provides telephony service. The basic function
of this layer is call control (setup & release) and group management for the gateway serving
multiple devices.
10. Application layer: It enables the user to interact with the application.
Types of Bluetooth
Various types of Bluetooth are available in the market nowadays. Let us look at them.
 In-Car Headset: One can make calls from the car speaker system without the use of mobile phones.
 Stereo Headset: To listen to music in car or in music players at home.
 Webcam: One can link the camera with the help of Bluetooth with their laptop or phone.
 Bluetooth-equipped Printer: The printer can be used when connected via Bluetooth with mobile
phone or laptop.
 Bluetooth Global Positioning System (GPS): To use GPS in cars, one can connect their phone with
car system via Bluetooth to fetch the directions of the address.
Advantage:
 It is a low-cost and easy-to-use device.

 It can also penetrate through walls.
 It creates an Ad-hoc connection immediately without any wires.
 It is used for voice and data transfer.
Disadvantages:
 It can be hacked and hence, less secure.

 It has a slow data transfer rate: of 3 Mbps.
 It has a small range: 10 meters.
 Bluetooth communication does not support routing.
 The issues of handoffs have not been addressed.
Applications:
 It can be used in laptops, and in wireless PCs, printers.

 It can be used in wireless headsets, wireless PANs, and LANs.
 It can connect a digital camera wirelessly to a mobile phone.
 It can transfer data in terms of videos, songs, photographs, or files from one cell phone to another
cell phone or computer.
 It is used in the sectors of Medical health care, sports and fitness, Military.
62
UNIT IV
NETWORK LAYER PROTOCOLS
Internet Protocol (IP): Datagram Format- Fragmentation-Options- Security of IPv4 Datagrams,

ICMPv4: Messages- Debugging Tools- Mobile IP: Addressing- Agents- Three Phases- Inefficiency in
Mobile IP, Unicast Routing: Introduction- Routing Algorithms- Distance Vector Routing- Link State
Routing- Path vector routing, Unicast Routing Protocol: Internet Structure- Routing Information Protocol.
IPv4 Datagram Header Size of the header is 20 to 60 bytes.
IPv4 Datagram Header
VERSION: Version of the IP protocol (4 bits), which is 4 for IPv4

HLEN: IP header length (4 bits), which is the number of 32 bit words in the header. The minimum
value for this field is 5 and the maximum is 15.
Type of service: Low Delay, High Throughput, Reliability (8 bits)
Total Length: Length of header + Data (16 bits), which has a minimum value 20 bytes and the
maximum is 65,535 bytes.
Identification: Unique Packet Id for identifying the group of fragments of a single IP datagram (16
bits)
Flags: 3 flags of 1 bit each : reserved bit (must be zero), do not fragment flag, more fragments flag
(same order)
Fragment Offset: Represents the number of Data Bytes ahead of the particular fragment in the
particular Datagram. Specified in terms of number of 8 bytes, which has the maximum value of 65,528
bytes.
Time to live: Datagram’s lifetime (8 bits), It prevents the datagram to loop through the network by
restricting the number of Hops taken by a Packet before delivering to the Destination.
Protocol: Name of the protocol to which the data is to be passed (8 bits)
Header Checksum: 16 bits header checksum for checking errors in the datagram header
Source IP address: 32 bits IP address of the sender
Destination IP address: 32 bits IP address of the receiver
Option: Optional information such as source route, record route. Used by the Network administrator
to check whether a path is working or not.
Fragmentation is done by the network layer when the maximum size of datagram is greater than
maximum size of data that can be held in a frame i.e., its Maximum Transmission Unit (MTU). The
network layer divides the datagram received from the transport layer into fragments so that data flow is
63
not disrupted.
 Since there are 16 bits for total length in IP header so, the maximum size of IP datagram = 216 – 1 =
65, 535 bytes.
 It is done by the network layer at the destination side and is usually done at routers.
 Source side does not require fragmentation due to wise (good) segmentation by transport layer i.e.
instead of doing segmentation at the transport layer and fragmentation at the network layer, the
transport layer looks at datagram data limit and frame data limit and does segmentation in such a
way that resulting data can easily fit in a frame without the need of fragmentation.
 Receiver identifies the frame with the identification (16 bits) field in the IP header. Each fragment
of a frame has the same identification number.
 Receiver identifies the sequence of frames using the fragment offset(13 bits) field in the IP header
 Overhead at the network layer is present due to the extra header introduced due to fragmentation.
THE NEED OF FRAGMENTATION AT NETWORK LAYER:
Fragmentation at the Network Layer is a process of dividing a large data packet into smaller pieces,
known as fragments, to improve the efficiency of data transmission over a network. The need for
fragmentation at the network layer arises from several factors:
1.Maximum Transmission Unit (MTU): Different networks have different Maximum Transmission
Unit (MTU) sizes, which determine the maximum size of a data packet that can be transmitted over that
network. If the size of a data packet exceeds the MTU, it needs to be fragmented into smaller fragments
that can be transmitted over the network.
2.Network Performance: Large data packets can consume a significant amount of network resources
and can cause congestion in the network. Fragmentation helps to reduce the impact of large data
packets on network performance by breaking them down into smaller fragments that can be transmitted
more efficiently.
3.Bandwidth Utilization: Large data packets may consume a significant amount of network
bandwidth, causing other network traffic to be slowed down. Fragmentation helps to reduce the impact
of large data packets on network bandwidth utilization by breaking them down into smaller fragments
that can be transmitted more efficiently.
Fragmentation at the network layer is necessary in order to ensure efficient and reliable
transmission of data over communication networks.
1.Large Packet Size: In some cases, the size of the packet to be transmitted may be too large for the
underlying communication network to handle. Fragmentation at the network layer allows the large
packet to be divided into smaller fragments that can be transmitted over the network.
2.Path MTU: The Maximum Transmission Unit (MTU) of a network defines the largest packet size
that can be transmitted over the network. Fragmentation at the network layer allows the packet to be
divided into smaller fragments that can be transmitted over networks with different MTU values.
3.Reliable Transmission: Fragmentation at the network layer increases the reliability of data
transmission, as smaller fragments are less likely to be lost or corrupted during transmission.
Fields in IP header for fragmentation –
 Identification (16 bits) – use to identify fragments of the same frame.

 Fragment offset (13 bits) – use to identify the sequence of fragments in the frame. It generally
indicates a number of data bytes preceding or ahead of the fragment.
64
Maximum fragment offset possible = (65535 – 20) = 65515
{where 65535 is the maximum size of datagram and 20 is the minimum size of IP header}
So, we need ceil(log 265515) = 16 bits for a fragment offset but the fragment offset field has only 13
bits. So, to represent efficiently we need to scale down the fragment offset field by 2 16/213 = 8
which acts as a scaling factor. Hence, all fragments except the last fragment should have data in
multiples of 8 so that fragment offset ∈ N.
 More fragments (MF = 1 bit) – tells if more fragments are ahead of this fragment i.e. if MF = 1,
more fragments are ahead of this fragment and if MF = 0, it is the last fragment.
 Don’t fragment (DF = 1 bit) – if we don’t want the packet to be fragmented then DF is set i.e. DF
= 1.
INTERNET CONTROL MESSAGE PROTOCOL (ICMP)
internet Control Message Protocol (ICMP) is a network layer protocol used to diagnose communication
errors by performing an error control mechanism. Since IP does not have an inbuilt mechanism for
sending error and control messages. It depends on Internet Control Message Protocol(ICMP) to
provide error control.
ICMP is used for reporting errors and management queries. It is a supporting protocol and is used by
network devices like routers for sending error messages and operations information. For example, the
requested service is not available or a host or router could not be reached.
Uses of ICMP
ICMP is used for error reporting if two devices connect over the internet and some error occurs, So, the
router sends an ICMP error message to the source informing about the error. For Example, whenever a
device sends any message which is large enough for the receiver, in that case, the receiver will drop the
message and reply back ICMP message to the source.
Another important use of ICMP protocol is used to perform network diagnosis by making use of
traceroute and ping utility. We will discuss them one by one.
Traceroute: Traceroute utility is used to know the route between two devices connected over the
internet. It routes the journey from one router to another, and a traceroute is performed to check network
issues before data transfer.
Ping: Ping is a simple kind of traceroute known as the echo-request message, it is used to measure the
time taken by data to reach the destination and return to the source, these replies are known as echo-
replies messages.
How Does ICMP Work?
ICMP is the primary and important protocol of the IP suite, but ICMP isn’t associated with any transport
layer protocol (TCP or UDP) as it doesn’t need to establish a connection with the destination device
before sending any message as it is a connectionless protocol.
The working of ICMP is just contrasting with TCP, as TCP is a connection-oriented protocol whereas
ICMP is a connectionless protocol. Whenever a connection is established before the message sending,
both devices must be ready through a TCP Handshake.
ICMP packets are transmitted in the form of datagrams that contain an IP header with ICMP data. ICMP
datagram is similar to a packet, which is an independent data entity.
65
ICMP Packet Format
ICMP header comes after IPv4 and IPv6 packet header.
ICMPv4 Packet Format
In the ICMP packet format, the first 32 bits of the packet contain three fields:
Type (8-bit): The initial 8-bit of the packet is for message type, it provides a brief description of the
message so that receiving network would know what kind of message it is receiving and how to respond
to it. Some common message types are as follows:
 Type 0 – Echo reply
 Type 3 – Destination unreachable
 Type 5 – Redirect Message
 Type 8 – Echo Request
 Type 11 – Time Exceeded
 Type 12 – Parameter problem
Code (8-bit): Code is the next 8 bits of the ICMP packet format, this field carries some additional
information about the error message and type.
Checksum (16-bit): Last 16 bits are for the checksum field in the ICMP packet header. The checksum is
used to check the number of bits of the complete message and enable the ICMP tool to ensure that
complete data is delivered.
The next 32 bits of the ICMP Header are Extended Header which has the work of pointing out the
problem in IP Message. Byte locations are identified by the pointer which causes the problem message
and receiving device looks here for pointing to the problem.
The last part of the ICMP packet is Data or Payload of variable length. The bytes included in IPv4 are
576 bytes and in IPv6, 1280 bytes.
ICMP in DDoS Attacks
In Distributed DOS (DDoS) attacks, attackers provide so much extra traffic to the target, so that it cannot
provide service to users. There are so many ways through which an attacker executes these attacks, which
are described below.
Ping of Death Attack
Whenever an attacker sends a ping, whose size is greater than the maximum allowable size, oversized
packets are broken into smaller parts. When the sender re-assembles it, the size exceeds the limit which
causes a buffer overflow and makes the machine freeze. This is simply called a Ping of Death Attack.
Newer devices have protection from this attack, but older devices did not have protection from this attack.
ICMP Flood Attack

66
Whenever the sender sends so many pings that the device on whom the target is done is unable to handle
the echo request. This type of attack is called an ICMP Flood Attack. This attack is also called a ping
flood attack. It stops the target computer’s resources and causes a denial of service for the target
computer.
Smurf Attack
Smurf Attack is a type of attack in which the attacker sends an ICMP packet with a spoofed source IP
address. These type of attacks generally works on older devices like the ping of death attack.
Types of ICMP Messages
Type Code Description
0 – Echo Reply 0 Echo reply
0 Destination network unreachable
1 Destination host unreachable
2 Destination protocol unreachable

3 – Destination
Unreachable
3 Destination port unreachable
4 Fragmentation is needed and the DF flag set
5 Source route failed
0 Redirect the datagram for the network
1 Redirect datagram for the host
5 – Redirect Message
Redirect the datagram for the Type of Service and
2
Network
3 Redirect datagram for the Service and Host
8 – Echo Request 0 Echo request

67
Type Code Description
9 – Router Advertisement 0
Use to discover the addresses of operational routers
10 – Router Solicitation 0
0 Time to live exceeded in transit

11 – Time Exceeded
1 Fragment reassembly time exceeded.
0 The pointer indicates an error.
12 – Parameter Problem 1 Missing required option
2 Bad length
13 – Timestamp 0 Used for time synchronization
14 – Timestamp Reply 0 Reply to Timestamp message
Source Quench Message

A source quench message is a request to decrease the traffic rate for messages sent to the host destination)
or we can say when receiving host detects that the rate of sending packets (traffic rate) to it is too fast it
sends the source quench message to the source to slow the pace down so that no packet can be lost.
Source Quench Message

68
ICMP will take the source IP from the discarded packet and inform the source by sending a source quench
message. The source will reduce the speed of transmission so that router will be free from congestion.
Source Quench Message with Reduced Speed
When the congestion router is far away from the source the ICMP will send a hop-by-hop source quench
message so that every router will reduce the speed of transmission.
Parameter Problem
Whenever packets come to the router then the calculated header checksum should be equal to the received
header checksum then only the packet is accepted by the router.
Parameter Problem
If there is a mismatch packet will be dropped by the router.

ICMP will take the source IP from the discarded packet and inform the source by sending a parameter
problem message.
Time Exceeded Message

69
Time Exceeded Message
When some fragments are lost in a network then the holding fragment by the router will be dropped then
ICMP will take the source IP from the discarded packet and informs the source, of discarded datagram
due to the time to live field reaching zero, by sending the time exceeded message.
Destination Un-reachable
The destination is unreachable and is generated by the host or its inbound gateway to inform the client
that the destination is unreachable for some reason.
Destination Un-reachable
There is no necessary condition that only the router gives the ICMP error message time the destination
host sends an ICMP error message when any type of failure (link failure, hardware failure, port failure,
etc) happens in the network.
Redirection Message
70
Redirect requests data packets are sent on an alternate route. The message informs a host to update its
routing information (to send packets on an alternate route).
Example: If the host tries to send data through a router R1 and R1 sends data on a router R2 and there
is a direct way from the host to R2. Then R1 will send a redirect message to inform the host that there
is the best way to the destination directly through R2 available. The host then sends data packets for the
destination directly to R2.
The router R2 will send the original datagram to the intended destination.
But if the datagram contains routing information then this message will not be sent even if a better
route is available as redirects should only be sent by gateways and should not be sent by Internet hosts.
Mobile Internet Protocol (or Mobile IP)
Mobile IP is a communication protocol (created by extending Internet Protocol, IP) that allows the
users to move from one network to another with the same IP address. It ensures that the communication
will continue without the user’s sessions or connections being dropped.
Terminologies:
1. Mobile Node (MN) is the hand-held communication device that the user carries e.g. Cell phone.
2. Home Network is a network to which the mobile node originally belongs as per its assigned IP
address (home address).
3. Home Agent (HA) is a router in-home network to which the mobile node was originally connected
4. Home Address is the permanent IP address assigned to the mobile node (within its home network).
5. Foreign Network is the current network to which the mobile node is visiting (away from its home
network).
6. Foreign Agent (FA) is a router in a foreign network to which the mobile node is currently
connected. The packets from the home agent are sent to the foreign agent which delivers them to
the mobile node.
7. Correspondent Node (CN) is a device on the internet communicating to the mobile node.
8. Care-of Address (COA) is the temporary address used by a mobile node while it is moving away
from its home network.
9. Foreign agent COA, the COA could be located at the FA, i.e., the COA is an IP address of the FA.
The FA is the tunnel end-point and forwards packets to the MN. Many MN using the FA can share
this COA as a common COA.
71
10. Co-located COA, the COA is co-located if the MN temporarily acquired an additional IP address
which acts as COA. This address is now topologically correct, and the tunnel endpoint is at the MN.
Co-located addresses can be acquired using services such as DHCP.
Mobile IP
Working:
The correspondent node sends the data to the mobile node. Data packets contain the correspondent
node’s address (Source) and home address (Destination). Packets reach the home agent. But now
mobile node is not in the home network, it has moved into the foreign network. The foreign agent sends
the care-of-address to the home agent to which all the packets should be sent. Now, a tunnel will be
established between the home agent and the foreign agent by the process of tunneling.
Tunneling establishes a virtual pipe for the packets available between a tunnel entry and an endpoint. It
is the process of sending a packet via a tunnel and it is achieved by a mechanism called encapsulation.
Now, the home agent encapsulates the data packets into new packets in which the source address is the
home address and destination is the care-of-address and sends it through the tunnel to the foreign agent.
Foreign agent, on another side of the tunnel, receives the data packets, decapsulates them, and sends
them to the mobile node. The mobile node in response to the data packets received sends a reply in
response to the foreign agent. The foreign agent directly sends the reply to the correspondent node.
Key Mechanisms in Mobile IP:
1. Agent Discovery: Agents advertise their presence by periodically broadcasting their agent
advertisement messages. The mobile node receiving the agent advertisement messages observes
whether the message is from its own home agent and determines whether it is in the home network
or foreign network.
2. Agent Registration: Mobile node after discovering the foreign agent sends a registration request
(RREQ) to the foreign agent. The foreign agent, in turn, sends the registration request to the home
agent with the care-of-address. The home agent sends a registration reply (RREP) to the foreign
agent. Then it forwards the registration reply to the mobile node and completes the process of
registration.
72
3. Tunneling: It establishes a virtual pipe for the packets available between a tunnel entry and an
endpoint. It is the process of sending a packet via a tunnel and it is achieved by a mechanism called
encapsulation. It takes place to forward an IP datagram from the home agent to the care-of-address.
Whenever the home agent receives a packet from the correspondent node, it encapsulates the packet
with source address as home address and destination as care-of-address.
Route Optimization in Mobile IP:
The route optimization adds a conceptual data structure, the binding cache, to the correspondent node.
The binding cache contains bindings for the mobile node’s home address and its current care-of-
address. Every time the home agent receives an IP datagram that is destined to a mobile node currently
away from the home network, it sends a binding update to the correspondent node to update the
information in the correspondent node’s binding cache. After this, the correspondent node can directly
tunnel packets to the mobile node. Mobile IP is provided by the network providers.
Unicast Routing – Link State Routing
Unicast means the transmission from a single sender to a single receiver. It is a point-to-point
communication between the sender and receiver. There are various unicast protocols such as TCP, HTTP,
etc.
 TCP is the most commonly used unicast protocol. It is a connection-oriented protocol that relies on
acknowledgment from the receiver side.
 HTTP stands for HyperText Transfer Protocol. It is an object-oriented protocol for communication.
Unicast Routing
Major Protocols of Unicast Routing
1. Distance Vector Routing: Distance-Vector routers use a distributed algorithm to compute their
routing tables.
2. Link-State Routing: Link-State routing uses link-state routers to exchange messages that allow
each router to learn the entire network topology.
3. Path-Vector Routing: It is a routing protocol that maintains the path that is updated dynamically.
Link State Routing

73
Link state routing is the second family of routing protocols. While distance-vector routers use a
distributed algorithm to compute their routing tables, link-state routing uses link-state routers to exchange
messages that allow each router to learn the entire network topology. Based on this learned topology,
each router is then able to compute its routing table by using the shortest path computation.
Link state routing is a technique in which each router shares the knowledge of its neighborhood with
every other router i.e. the internet work. The three keys to understand the link state routing algorithm.
1. Knowledge about the neighborhood: Instead of sending its routing table, a router sends the
information about its neighborhood only. A router broadcast its identities and cost of the directly
attached links to other routers.
2. Flooding: Each router sends the information to every other router on the internetwork except its
neighbors. This process is known as flooding. Every router that receives the packet sends the copies
to all the neighbors. Finally each and every router receives a copy of the same information.
3. Information Sharing: A router send the information to every other router only when the change
occurs in the information.
Link state routing has two phase:
1. Reliable Flooding: Initial state– Each node knows the cost of its neighbors. Final state- Each node
knows the entire graph.
2. Route Calculation: Each node uses Dijkstra’ s algorithm on the graph to calculate the optimal
routes to all nodes. The link state routing algorithm is also known as Dijkstra’s algorithm which is
used to find the shortest path from one node to every other node in the network.
3.
Features of Link State Routing Protocols
 Link State Packet: A small packet that contains routing information.

 Link-State Database: A collection of information gathered from the link-state packet.
 Shortest Path First Algorithm (Dijkstra algorithm): A calculation performed on the database
results in the shortest path
 Routing Table: A list of known paths and interfaces.

Calculation of Shortest Path
To find the shortest path, each node needs to run the famous Dijkstra algorithm. Let us understand how
can we find the shortest path using an example.
Illustration
To understand the Dijkstra Algorithm, let’s take a graph and find the shortest path from the source to all
nodes.
Note: We use a boolean array sptSet[] to represent the set of vertices included in SPT. If a
value sptSet[v] is true, then vertex v is included in SPT, otherwise not. Array dist[] is used to store the
shortest distance values of all vertices.
Consider the below graph and src = 0.
74
Shortest Path Calculation – Step 1
STEP 1: The set sptSet is initially empty and distances assigned to vertices are {0, INF, INF, INF, INF,
INF, INF, INF} where INF indicates infinite. Now pick the vertex with a minimum distance value. The
vertex 0 is picked and included in sptSet. So sptSet becomes {0}. After including 0 to sptSet, update the
distance values of its adjacent vertices. Adjacent vertices of 0 are 1 and 7. The distance values of 1 and
7 are updated as 4 and 8.
The following subgraph shows vertices and their distance values. Vertices included in SPT are included
in GREEN color.
STEP 2: Pick the vertex with minimum distance value and not already included in SPT (not in sptSET).
The vertex 1 is picked and added to sptSet. So sptSet now becomes {0, 1}. Update the distance values of
adjacent vertices of 1. The distance value of vertex 2 becomes 12.
75
Vertex 7 is picked. So sptSet now becomes {0, 1, 7}. Update the distance values of adjacent vertices of
7. The distance value of vertex 6 and 8 becomes finite (15 and 9 respectively).
Vertex 6 is picked. So sptSet now becomes {0, 1, 7, 6}. Update the distance values of adjacent vertices
of 6. The distance value of vertex 5 and 8 are updated.
We repeat the above steps until sptSet includes all vertices of the given graph. Finally, we get the
following Shortest Path Tree (SPT).
76
Characteristics of Link State Protocol

 It requires a large amount of memory.
 Shortest path computations require many CPU circles.
 If a network uses little bandwidth; it quickly reacts to topology changes
 All items in the database must be sent to neighbors to form link-state packets.
 All neighbors must be trusted in the topology.
 Authentication mechanisms can be used to avoid undesired adjacency and problems.
 No split horizon techniques are possible in the link-state routing.
 OSPF Protocol
Protocols of Link State Routing
1. Open Shortest Path First (OSPF)
2. Intermediate System to Intermediate System (IS-IS)
Open Shortest Path First (OSPF): Open Shortest Path First (OSPF) is a unicast routing protocol
developed by a working group of the Internet Engineering Task Force (IETF). It is an intradomain routing
protocol. It is an open-source protocol. It is similar to Routing Information Protocol (RIP). OSPF is a
classless routing protocol, which means that in its updates, it includes the subnet of each route it knows
about, thus, enabling variable-length subnet masks. With variable-length subnet masks, an IP network
can be broken into many subnets of various sizes. This provides network administrators with extra
network configuration flexibility. These updates are multicasts at specific addresses (224.0.0.5 and
224.0.0.6). OSPF is implemented as a program in the network layer using the services provided by the
Internet Protocol. IP datagram that carries the messages from OSPF sets the value of the protocol field
to 89. OSPF is based on the SPF algorithm, which sometimes is referred to as the Dijkstra algorithm.
Intermediate System to Intermediate System (IS-IS): Intermediate System to Intermediate System is
a standardized link-state protocol that was developed as the definitive routing protocol for the OSI Model.
IS-IS uses System ID to identify a router on the network. IS-IS doesn’t require IP connectivity between
the routers as updates are sent via CLNS instead of IP.
Distance Vector Routing (DVR) Protocol
A distance-vector routing (DVR) protocol requires that a router inform its neighbors of topology
changes periodically. Historically known as the old ARPANET routing algorithm (or known as
Bellman-Ford algorithm).
Bellman Ford Basics – Each router maintains a Distance Vector table containing the distance between
itself and ALL possible destination nodes. Distances,based on a chosen metric, are computed using
information from the neighbors’ distance vectors.
Distance Vector Algorithm –
77
1. A router transmits its distance vector to each of its neighbors in a routing packet.
2. Each router receives and saves the most recently received distance vector from each of its
neighbors.
3. A router recalculates its distance vector when:
 It receives a distance vector from a neighbor containing different information than before.
 It discovers that a link to a neighbor has gone down.
The DV calculation is based on minimizing the cost to each destination
Dx(y) = Estimate of least cost from x to y
C(x,v) = Node x knows cost to each neighbor v
Dx = [Dx(y): y ? N ] = Node x maintains distance vector
Node x also maintains its neighbors' distance vectors
– For each neighbor v, x maintains Dv = [Dv(y): y ? N ]
Note –
 From time-to-time, each node sends its own distance vector estimate to neighbors.
 When a node x receives new DV estimate from any neighbor v, it saves v’s distance vector and it
updates its own DV using B-F equation:
 Dx(y) = min { C(x,v) + Dv(y), Dx(y) } for each node y ? N
Example – Consider 3-routers X, Y and Z as shown in figure. Each router have their routing table.
Every routing table will contain distance to the destination nodes.
Consider router X , X will share it routing table to neighbors and neighbors will share it routing table to
it to X and distance from node X to destination will be calculated using bellmen- ford equation.
Dx(y) = min { C(x,v) + Dv(y)} for each node y ? N
As we can see that distance will be less going from X to Z when Y is intermediate node(hop) so it will
be update in routing table X.
78
Similarly for Z also –

79
Finally the routing table for all –
Advantages of Distance Vector routing –

 It is simpler to configure and maintain than link state routing.
Disadvantages of Distance Vector routing –
 It is slower to converge than link state.
 It is at risk from the count-to-infinity problem.
 It creates more traffic than link state since a hop count change must be propagated to all
routers and processed on each router. Hop count updates take place on a periodic basis, even
if there are no changes in the network topology, so bandwidth-wasting broadcasts still occur.
 For larger networks, distance vector routing results in larger routing tables than link state
since each router must know about all other routers. This can also lead to congestion on
WAN links.
Path Vector Routing Protocol
 A path vector protocol is essentially a distance vector protocol that does not rely on the distance to
destination to guarantee a loop-free path but instead relies on the analysis of the path itself.
 It is typically deployed in environments where it is difficult to guarantee a consistent metric
(distance) across the routing domain. The path is accumulated at each router, and carried in each
advertisement, so that any router receiving it can validate the loop-free path before propagating
the information. BGP4 is the best example of an RP using this technology.
 The main drawback is the size of the advertisements, which grow with the number of hops. As far
as IPv6 is concerned, BGP4, enhanced with multiprotocol extensions, remains the path vector RP
of choice for exchanging IPv6 routes between autonomous systems.
80
It is the initial table for each speaker node in a system made four ASs. Here Node A1 is
the speaker node for AS1, B1 for AS2, C1 for AS3 and D1 for AS4, Node A1 creates an initial
table that shows A1 to A5 and these are located in AS1, it can be reached through it
A speaker in an autonomous system shares its table with immediate neighbours ,here Node
A1 share its table with nodes B1 and C1 , Node C1 share its table with nodes A1,B1 and D1 ,
Node B1 share its table with nodes A1 and C1 , Node D1 share its table with node C1
If router A1 receives a packet for nodes A3 , it knows that the path is in AS1,but if it
receives a packet for D1,it knows that the packet should go from AS1,to AS2 and then to AS3
,then the routing table shows that path completely on the other hand if the node D1 in AS4
receives a packet for node A2,it knows it should go through AS4,AS3,and AS1,
FUNCTIONS
 PREVENTION OF LOOP T
he creation of loop can be avoided in path vector routing .A router receives a message it
checks to see if its autonomous system is in the path list to the destination if it is looping is
involved and the message is ignored
 POLICY ROUTING
When a router receives a messages it can check the path, if one of the autonomous system
listed in the path against its policy, it can ignore its path and destination it does not update its
routing table with this path or it does not send the messages to its neighbours.
 OPTIMUM PATH
A path to a destination that is the best for the organization that runs the autonomous
system
81
BORDER GATEWAY PROTCOL (BGP)
It first introduced in 1989, Is an interdomain routing protocol using path vector routing. It
has three versions
1. STUB AS
2. . MULTHIHOMED AS
3. 3. TRANSIT AS
Routing Information Protocol (RIP)
Routing Information Protocol (RIP) is a dynamic routing protocol that uses hop count as a routing
metric to find the best path between the source and the destination network. It is a distance-vector routing
protocol that has an AD value of 120 and works on the Network layer of the OSI model. RIP uses port
number 520.
Hop Count
Hop count is the number of routers occurring in between the source and destination network. The path
with the lowest hop count is considered as the best route to reach a network and therefore placed in the
routing table. RIP prevents routing loops by limiting the number of hops allowed in a path from source
and destination. The maximum hop count allowed for RIP is 15 and a hop count of 16 is considered as
network unreachable.
Features of RIP
1. Updates of the network are exchanged periodically.
2. Updates (routing information) are always broadcast.
3. Full routing tables are sent in updates.
4. Routers always trust routing information received from neighbor routers. This is also known
as Routing on rumors.
RIP versions:
There are three versions of routing information protocol – RIP Version1, RIP Version2, and RIPng.
RIP v1 RIP v2 RIPng
Sends update as broadcast Sends update as multicast Sends update as multicast
Multicast at FF02::9 (RIPng

can only run on IPv6
Broadcast at 255.255.255.255 Multicast at 224.0.0.9
networks)
Doesn’t support authentication Supports authentication of

–
of updated messages RIPv2 update messages
Classless protocol updated

Classful routing protocol Classless updates are sent
supports classful
82
RIP v1 is known as Classful Routing Protocol because it doesn’t send information of subnet mask in its
routing update.
RIP v2 is known as Classless Routing Protocol because it sends information of subnet mask in its
routing update.
>> Use debug command to get the details :

# debug ip rip
>> Use this command to show all routes configured in router, say for router R1 :
R1# show ip route
>> Use this command to show all protocols configured in router, say for router R1 :
R1# show ip protocols
Configuration :
Consider the above-given topology which has 3-routers R1, R2, R3. R1 has IP address 172.16.10.6/30
on s0/0/1, 192.168.20.1/24 on fa0/0. R2 has IP address 172.16.10.2/30 on s0/0/0, 192.168.10.1/24 on
fa0/0. R3 has IP address 172.16.10.5/30 on s0/1, 172.16.10.1/30 on s0/0, 10.10.10.1/24 on fa0/0.
Configure RIP for R1 :
R1(config)# router rip
R1(config-router)# network 192.168.20.0
R1(config-router)# version 2
R1(config-router)# no auto-summary
Note: no auto-summary command disables the auto-summarisation. If we don’t select any auto-
summary, then the subnet mask will be considered as classful in Version 1.
Configuring RIP for R2:
Similarly, Configure RIP for R3 :
83
RIP timers:
 Update timer: The default timing for routing information being exchanged by the routers operating
RIP is 30 seconds. Using an Update timer, the routers exchange their routing table periodically.
 Invalid timer: If no update comes until 180 seconds, then the destination router considers it invalid.
In this scenario, the destination router mark hop counts as 16 for that router.
 Hold down timer: This is the time for which the router waits for a neighbor router to respond. If the
router isn’t able to respond within a given time then it is declared dead. It is 180 seconds by default.
 Flush time: It is the time after which the entry of the route will be flushed if it doesn’t respond within
the flush time. It is 60 seconds by default. This timer starts after the route has been declared invalid
and after 60 seconds i.e time will be 180 + 60 = 240 seconds.
Note that all these times are adjustable. Use this command to change the timers :
R1(config-router)# timers basic
R1(config-router)# timers basic 20 80 80 90
Normal utilization of RIP:
1. Small to medium-sized networks: RIP is normally utilized in little to medium-sized networks that
have moderately basic directing prerequisites. It is not difficult to design and requires little support,
which goes with it a famous decision for little organizations.
2. Legacy organizations: RIP is as yet utilized in some heritage networks that were set up before
further developed steering conventions were created. These organizations may not merit the
expense and exertion of overhauling, so they keep on involving RIP as their directing convention.
3. Lab conditions: RIP is much of the time utilized in lab conditions for testing and learning
purposes. A basic convention is not difficult to set up, which pursues it a decent decision for
instructive purposes.
4. Backup or repetitive steering: In certain organizations, RIP might be utilized as a reinforcement
or excess directing convention, on the off chance that the essential steering convention falls flat or
encounters issues. RIP isn’t generally so productive as other directing conventions, however, it very
well may be helpful as a reinforcement if there should be an occurrence of crisis.
Advantages of RIP :
 Simplicity: RIP is a relatively simple protocol to configure and manage, making it an ideal choice
for small to medium-sized networks with limited resources.
 Easy implementation: RIP is easy to implement, as it does not require much technical expertise to
set up and maintain.
 Convergence: RIP is known for its fast convergence time, meaning that it can quickly adapt to
changes in network topology and route packets efficiently.
 Automatic updates: RIP automatically updates routing tables at regular intervals, ensuring that the
most up-to-date information is being used to route packets.
 Low bandwidth overhead: RIP uses a relatively low amount of bandwidth to exchange routing
information, making it an ideal choice for networks with limited bandwidth.
 Compatibility: RIP is compatible with many different types of routers and network devices,
making it easy to integrate into existing networks
.
Disadvantages of RIP :
84
 Limited scalability: RIP has limited scalability, and it may not be the best choice for larger
networks with complex topologies. RIP can only support up to 15 hops, which may not be sufficient
for larger networks.
 Slow convergence: While RIP is known for its fast convergence time, it can be slower to converge
than other routing protocols. This can lead to delays and inefficiencies in network performance.
 Routing loops: RIP can sometimes create routing loops, which can cause network congestion and
reduce overall network performance.
 Limited support for load balancing: RIP does not support sophisticated load balancing, which
can result in suboptimal routing paths and uneven network traffic distribution.
 Security vulnerabilities: RIP does not provide any native security features, making it vulnerable to
attacks such as spoofing and tampering.
 Inefficient use of bandwidth: RIP uses a lot of bandwidth for periodic updates, which can be
inefficient in networks with limited bandwidth.
85
UNIT 5
TRANSPORT LAYER
Introduction: Transport Layer Services- Connectionless and Connection Oriented Protocols, Transport
Layer Protocols: Simple protocol- Stop and wait protocol- Go-Back-N ProtocolSelective repeat protocol,
User Datagram Protocol: User Datagram- UDP Services- UDP Applications, Transmission Control
Protocol: TCP Services- TCP Features- Segment- Connection
Both Connection-oriented service and Connection-less service are used for the connection
establishment between two or more two devices. These types of services are offered by the network
layer.
Connection-oriented service is related to the telephone system. It includes connection establishment
and connection termination. In a connection-oriented service, the Handshake method is used to
establish the connection between sender and receiver.
Connection-less service is related to the postal system. It does not include any connection
establishment and connection termination. Connection-less Service does not give a guarantee of
reliability. In this, Packets do not follow the same path to reach their destination.
86
Difference between Connection-oriented and Connection-less Services:
S.NO Connection-oriented Service Connection-less Service
Connection-oriented service is related to Connection-less service is related to

1. the telephone system. the postal system.
Connection-oriented service is preferred Connection-less Service is preferred

2. by long and steady communication. by bursty communication.
Connection-oriented Service is Connection-less Service is not

3. necessary. compulsory.
Connection-less Service is not

Connection-oriented Service is feasible.
4. feasible.
In connection-oriented Service, In connection-less Service,

5. Congestion is not possible. Congestion is possible.
Connection-oriented Service gives the Connection-less Service does not

6. guarantee of reliability. give a guarantee of reliability.
In connection-oriented Service, Packets In connection-less Service, Packets

7. follow the same route. do not follow the same route.
Connection-oriented services require a Connection-less Service requires a

8. bandwidth of a high range. bandwidth of low range.
Ex: TCP (Transmission Control

Ex: UDP (User Datagram Protocol)
9. Protocol)
Connection-oriented requires Connection-less Service does not

10. authentication. require authentication.
STOP AND WAIT PROTOCOL
 Used in Connection-oriented communication.

 It offers error and flows control
 It is used in Data Link and Transport Layers
 Stop and Wait for ARQ mainly implements the Sliding Window Protocol concept with Window
Size 1
87
Useful Terms:
 Propagation Delay: Amount of time taken by a packet to make a physical journey from one router
to another router.
Propagation Delay = (Distance between routers) / (Velocity of propagation)
 RoundTripTime (RTT) = Amount of time taken by a packet to reach the receiver + Time taken by
the Acknowledgement to reach the sender
 TimeOut (TO) = 2* RTT
 Time To Live (TTL) = 2* TimeOut. (Maximum TTL is 255 seconds)
Simple Stop and Wait
Sender:
Rule 1) Send one data packet at a time.
Rule 2) Send the next packet only after receiving acknowledgement for the previous.
Receiver:
Rule 1) Send acknowledgement after receiving and consuming a data packet.
Rule 2) After consuming packet acknowledgement need to be sent (Flow Control)
Problems :
88
1. Lost Data
2. Lost Acknowledgement:
3. Delayed Acknowledgement/Data: After a timeout on the sender side, a long-delayed

acknowledgement might be wrongly considered as acknowledgement of some other recent packet.
89
Stop and Wait for ARQ (Automatic Repeat Request)
The above 3 problems are resolved by Stop and Wait for ARQ (Automatic Repeat Request) that does
both error control and flow control.
1. Time Out:
90
2. Sequence Number (Data)
3. Delayed Acknowledgement:
This is resolved by introducing sequence numbers for acknowledgement also.
Working of Stop and Wait for ARQ:

1) Sender A sends a data frame or packet with sequence number 0.
2) Receiver B, after receiving the data frame, sends an acknowledgement with sequence number 1 (the
sequence number of the next expected data frame or packet)
There is only a one-bit sequence number that implies that both sender and receiver have a buffer for
one frame or packet only.
91
Characteristics of Stop and Wait ARQ:

 It uses a link between sender and receiver as a half-duplex link
 Throughput = 1 Data packet/frame per RTT
 If the Bandwidth*Delay product is very high, then they stop and wait for protocol if it is not so
useful. The sender has to keep waiting for acknowledgements before sending the processed next
packet.
 It is an example of “Closed Loop OR connection-oriented “ protocols
 It is a special category of SWP where its window size is 1
 Irrespective of the number of packets sender is having stop and wait for protocol requires only 2
sequence numbers 0 and 1
Constraints:
Stop and Wait ARQ has very less efficiency , it can be improved by increasing the window size. Also ,
for better efficiency , Go back N and Selective Repeat Protocols are used.
The Stop and Wait ARQ solves the main three problems but may cause big performance issues as the
sender always waits for acknowledgement even if it has the next packet ready to send. Consider a
situation where you have a high bandwidth connection and propagation delay is also high (you are
connected to some server in some other country through a high-speed connection). To solve this
92
problem, we can send more than one packet at a time with a larger sequence number. We will be
discussing these protocols in the next articles.
So Stop and Wait ARQ may work fine where propagation delay is very less for example LAN
connections but performs badly for distant connections like satellite connections.
Advantages of Stop and Wait ARQ :
 Simple Implementation: Stop and Wait ARQ is a simple protocol that is easy to implement in both
hardware and software. It does not require complex algorithms or hardware components, making it
an inexpensive and efficient option.
 Error Detection: Stop and Wait ARQ detects errors in the transmitted data by using checksums or
cyclic redundancy checks (CRC). If an error is detected, the receiver sends a negative
acknowledgment (NAK) to the sender, indicating that the data needs to be retransmitted.
 Reliable: Stop and Wait ARQ ensures that the data is transmitted reliably and in order. The
receiver cannot move on to the next data packet until it receives the current one. This ensures that
the data is received in the correct order and eliminates the possibility of data corruption.
 Flow Control: Stop and Wait ARQ can be used for flow control, where the receiver can control the
rate at which the sender transmits data. This is useful in situations where the receiver has limited
buffer space or processing power.
 Backward Compatibility: Stop and Wait ARQ is compatible with many existing systems and
protocols, making it a popular choice for communication over unreliable channels.
Disadvantages of Stop and Wait ARQ :
 Low Efficiency: Stop and Wait ARQ has low efficiency as it requires the sender to wait for an
acknowledgment from the receiver before sending the next data packet. This results in a low data
transmission rate, especially for large data sets.
 High Latency: Stop and Wait ARQ introduces additional latency in the transmission of data, as the
sender must wait for an acknowledgment before sending the next packet. This can be a problem for
real-time applications such as video streaming or online gaming.
 Limited Bandwidth Utilization: Stop and Wait ARQ does not utilize the available bandwidth
efficiently, as the sender can transmit only one data packet at a time. This results in underutilization
of the channel, which can be a problem in situations where the available bandwidth is limited.
 Limited Error Recovery: Stop and Wait ARQ has limited error recovery capabilities. If a data
packet is lost or corrupted, the sender must retransmit the entire packet, which can be time-
consuming and can result in further delays.
 Vulnerable to Channel Noise: Stop and Wait ARQ is vulnerable to channel noise, which can
cause errors in the transmitted data. This can result in frequent retransmissions and can impact the
overall efficiency of the protocol.
Go-Back-N
What is Go-Back-N ARQ?
In Go-Back-N ARQ, N is the sender's window size. Suppose we say that Go-Back-3, which means that the
three frames can be sent at a time before expecting the acknowledgment from the receiver.
It uses the principle of protocol pipelining in which the multiple frames can be sent before receiving the
acknowledgment of the first frame. If we have five frames and the concept is Go-Back-3, which means that
the three frames can be sent, i.e., frame no 1, frame no 2, frame no 3 can be sent before expecting the
acknowledgment of frame no 1.
93
In Go-Back-N ARQ, the frames are numbered sequentially as Go-Back-N ARQ sends the multiple frames
at a time that requires the numbering approach to distinguish the frame from another frame, and these
numbers are known as the sequential numbers.
The number of frames that can be sent at a time totally depends on the size of the sender's window. So, we
can say that 'N' is the number of frames that can be sent at a time before receiving the acknowledgment
from the receiver.
If the acknowledgment of a frame is not received within an agreed-upon time period, then all the frames
available in the current window will be retransmitted. Suppose we have sent the frame no 5, but we didn't
receive the acknowledgment of frame no 5, and the current window is holding three frames, then these
three frames will be retransmitted.
The sequence number of the outbound frames depends upon the size of the sender's window. Suppose the
sender's window size is 2, and we have ten frames to send, then the sequence numbers will not be
1,2,3,4,5,6,7,8,9,10. Let's understand through an example.
o N is the sender's window size.

o If the size of the sender's window is 4 then the sequence number will be 0,1,2,3,0,1,2,3,0,1,2, and
so on.
The number of bits in the sequence number is 2 to generate the binary sequence 00,01,10,11.
Working of Go-Back-N ARQ
Suppose there are a sender and a receiver, and let's assume that there are 11 frames to be sent. These frames
are represented as 0,1,2,3,4,5,6,7,8,9,10, and these are the sequence numbers of the frames. Mainly, the
sequence number is decided by the sender's window size. But, for the better understanding, we took the
running sequence numbers, i.e., 0,1,2,3,4,5,6,7,8,9,10. Let's consider the window size as 4, which means
that the four frames can be sent at a time before expecting the acknowledgment of the first frame.
Step 1: Firstly, the sender will send the first four frames to the receiver, i.e., 0,1,2,3, and now the sender is
expected to receive the acknowledgment of the 0th frame.
94
Let's assume that the receiver has sent the acknowledgment for the 0 frame, and the receiver has
successfully received it.
The sender will then send the next frame, i.e., 4, and the window slides containing four frames (1,2,3,4).
The receiver will then send the acknowledgment for the frame no 1. After receiving the acknowledgment,
the sender will send the next frame, i.e., frame no 5, and the window will slide having four frames (2,3,4,5).
95
Now, let's assume that the receiver is not acknowledging the frame no 2, either the frame is lost, or the
acknowledgment is lost. Instead of sending the frame no 6, the sender Go-Back to 2, which is the first
frame of the current window, retransmits all the frames in the current window, i.e., 2,3,4,5.
96
Important points related to Go-Back-N ARQ:

o In Go-Back-N, N determines the sender's window size, and the size of the receiver's window is
always 1.
o It does not consider the corrupted frames and simply discards them.
o It does not accept the frames which are out of order and discards them.
o If the sender does not receive the acknowledgment, it leads to the retransmission of all the current
window frames.
Let's understand the Go-Back-N ARQ through an example.
Example 1: In GB4, if every 6th packet being transmitted is lost and if we have to spend 10 packets then
how many transmissions are required?
Solution: Here, GB4 means that N is equal to 4. The size of the sender's window is 4.
Step 1: As the window size is 4, so four packets are transferred at a time, i.e., packet no 1, packet no 2,
packet no 3, and packet no 4.
97
Step 2: Once the transfer of window size is completed, the sender receives the acknowledgment of the first
frame, i.e., packet no1. As the acknowledgment receives, the sender sends the next packet, i.e., packet no
5. In this case, the window slides having four packets, i.e., 2,3,4,5 and excluded the packet 1 as the
acknowledgment of the packet 1 has been received successfully.
Step 3: Now, the sender receives the acknowledgment of packet 2. After receiving the acknowledgment
for packet 2, the sender sends the next packet, i.e., packet no 6. As mentioned in the question that every
6th is being lost, so this 6th packet is lost, but the sender does not know that the 6th packet has been lost.
98
Step 4: The sender receives the acknowledgment for the packet no 3. After receiving the acknowledgment
of 3rd packet, the sender sends the next packet, i.e., 7th packet. The window will slide having four packets,
i.e., 4, 5, 6, 7.
Step 5: When the packet 7 has been sent, then the sender receives the acknowledgment for the packet no
4. When the sender has received the acknowledgment, then the sender sends the next packet, i.e., the
8th packet. The window will slide having four packets, i.e., 5, 6, 7, 8.
99
Step 6: When the packet 8 is sent, then the sender receives the acknowledgment of packet 5. On receiving
the acknowledgment of packet 5, the sender sends the next packet, i.e., 9 th packet. The window will slide
having four packets, i.e., 6, 7, 8, 9.
Step 7: The current window is holding four packets, i.e., 6, 7, 8, 9, where the 6 th packet is the first packet
in the window. As we know, the 6th packet has been lost, so the sender receives the negative
acknowledgment NAK(6). As we know that every 6th packet is being lost, so the counter will be restarted
from 1. So, the counter values 1, 2, 3 are given to the 7th packet, 8th packet, 9th packet respectively.
100
Step 8: As it is Go-BACK, so it retransmits all the packets of the current window. It will resend 6, 7, 8, 9.
The counter values of 6, 7, 8, 9 are 4, 5, 6, 1, respectively. In this case, the 8 th packet is lost as it has a 6-
counter value, so the counter variable will again be restarted from 1.
101
Step 9: After the retransmission, the sender receives the acknowledgment of packet 6. On receiving the
acknowledgment of packet 6, the sender sends the 10th packet. Now, the current window is holding four
packets, i.e., 7, 8, 9, 10.
Step 10: When the 10th packet is sent, the sender receives the acknowledgment of packet 7. Now the current
window is holding three packets, 8, 9 and 10. The counter values of 8, 9, 10 are 6, 1, 2.
102
Step 11: As the 8th packet has 6 counter value which means that 8th packet has been lost, and the sender
receives NAK (8).
Step 12: Since the sender has received the negative acknowledgment for the 8 th packet, it resends all the
packets of the current window, i.e., 8, 9, 10.
103
Step 13: The counter values of 8, 9, 10 are 3, 4, 5, respectively, so their acknowledgments have been
received successfully.
Selective Repeat ARQ
It is also known as Sliding Window Protocol and used for error detection and control in the data link layer.
In the selective repeat, the sender sends several frames specified by a window size even without the need
to wait for individual acknowledgement from the receiver as in Go-Back-N ARQ. In selective repeat
protocol, the retransmitted frame is received out of sequence.
In Selective Repeat ARQ only the lost or error frames are retransmitted, whereas correct frames are
received and buffered.
The receiver while keeping track of sequence numbers buffers the frames in memory and sends NACK for
only frames which are missing or damaged. The sender will send/retransmit a packet for which NACK is
received.
Example
Given below is an example of the Selective Repeat ARQ −
Explanation
Step 1 − Frame 0 sends from sender to receiver and set timer.

104
Step 2 − Without waiting for acknowledgement from the receiver another frame, Frame1 is sent by sender
by setting the timer for it.
Step 3 − In the same way frame2 is also sent to the receiver by setting the timer without waiting for previous
acknowledgement.
Step 4 − Whenever sender receives the ACK0 from receiver, within the frame 0 timer then it is closed and
sent to the next frame, frame 3.
Step 5 − whenever the sender receives the ACK1 from the receiver, within the frame 1 timer then it is
closed and sent to the next frame, frame 4.
Step 6 − If the sender doesn’t receive the ACK2 from the receiver within the time slot, it declares timeout
for frame 2 and resends the frame 2 again, because it thought the frame2 may be lost or damaged.
User Datagram Protocol
User Datagram Protocol (UDP) is a Transport Layer protocol. UDP is a part of the Internet Protocol
suite, referred to as UDP/IP suite. Unlike TCP, it is an unreliable and connectionless protocol. So,
there is no need to establish a connection prior to data transfer. The UDP helps to establish low-latency
and loss-tolerating connections establish over the network.The UDP enables process to process
communication.
Though Transmission Control Protocol (TCP) is the dominant transport layer protocol used with most
of the Internet services; provides assured delivery, reliability, and much more but all these services cost
us additional overhead and latency. Here, UDP comes into the picture. For real-time services like
computer gaming, voice or video communication, live conferences; we need UDP. Since high
performance is needed, UDP permits packets to be dropped instead of processing delayed packets.
There is no error checking in UDP, so it also saves bandwidth.
User Datagram Protocol (UDP) is more efficient in terms of both latency and bandwidth.
UDP Header –
UDP header is an 8-bytes fixed and simple header, while for TCP it may vary from 20 bytes to 60
bytes. The first 8 Bytes contains all necessary header information and the remaining part consist of
data. UDP port number fields are each 16 bits long, therefore the range for port numbers is defined
from 0 to 65535; port number 0 is reserved. Port numbers help to distinguish different user requests or
processes.
105
1. Source Port: Source Port is a 2 Byte long field used to identify the port number of the source.
2. Destination Port: It is a 2 Byte long field, used to identify the port of the destined packet.
3. Length: Length is the length of UDP including the header and the data. It is a 16-bits field.
4. Checksum: Checksum is 2 Bytes long field. It is the 16-bit one’s complement of the one’s
complement sum of the UDP header, the pseudo-header of information from the IP header, and the
data, padded with zero octets at the end (if necessary) to make a multiple of two octets.
Notes – Unlike TCP, the Checksum calculation is not mandatory in UDP. No Error control or flow
control is provided by UDP. Hence UDP depends on IP and ICMP for error reporting. Also UDP
provides port numbers so that is can differentiate between users requests.
Applications of UDP:
 Used for simple request-response communication when the size of data is less and hence there is
lesser concern about flow and error control.
 It is a suitable protocol for multicasting as UDP supports packet switching.
 UDP is used for some routing update protocols like RIP(Routing Information Protocol).
 Normally used for real-time applications which can not tolerate uneven delays between sections of
a received message.
 UDP is widely used in online gaming, where low latency and high-speed communication is
essential for a good gaming experience. Game servers often send small, frequent packets of data to
clients, and UDP is well suited for this type of communication as it is fast and lightweight.
 Streaming media applications, such as IPTV, online radio, and video conferencing, use UDP to
transmit real-time audio and video data. The loss of some packets can be tolerated in these
applications, as the data is continuously flowing and does not require retransmission.
 VoIP (Voice over Internet Protocol) services, such as Skype and WhatsApp, use UDP for real-time
voice communication. The delay in voice communication can be noticeable if packets are delayed
due to congestion control, so UDP is used to ensure fast and efficient data transmission.
 DNS (Domain Name System) also uses UDP for its query/response messages. DNS queries are
typically small and require a quick response time, making UDP a suitable protocol for this
application.
 DHCP (Dynamic Host Configuration Protocol) uses UDP to dynamically assign IP addresses to
devices on a network. DHCP messages are typically small, and the delay caused by packet loss or
retransmission is generally not critical for this application.
 Following implementations uses UDP as a transport layer protocol:
 NTP (Network Time Protocol)
 DNS (Domain Name Service)
 BOOTP, DHCP.
 NNP (Network News Protocol)
 Quote of the day protocol
 TFTP, RTSP, RIP.
106
 The application layer can do some of the tasks through UDP-
 Trace Route
 Record Route
 Timestamp
 UDP takes a datagram from Network Layer, attaches its header, and sends it to the user. So, it
works fast.
 Actually, UDP is a null protocol if you remove the checksum field.
1. Reduce the requirement of computer resources.
2. When using the Multicast or Broadcast to transfer.
3. The transmission of Real-time packets, mainly in multimedia applications.
Advantages of UDP:
1. Speed: UDP is faster than TCP because it does not have the overhead of establishing a connection
and ensuring reliable data delivery.
2. Lower latency: Since there is no connection establishment, there is lower latency and faster response
time.
3. Simplicity: UDP has a simpler protocol design than TCP, making it easier to implement and manage.
4. Broadcast support: UDP supports broadcasting to multiple recipients, making it useful for
applications such as video streaming and online gaming.
5. Smaller packet size: UDP uses smaller packet sizes than TCP, which can reduce network congestion
and improve overall network performance.
Disadvantages of UDP:
1. No reliability: UDP does not guarantee delivery of packets or order of delivery, which can lead to
missing or duplicate data.
2. No congestion control: UDP does not have congestion control, which means that it can send packets
at a rate that can cause network congestion.
3. No flow control: UDP does not have flow control, which means that it can overwhelm the receiver
with packets that it cannot handle.
4. Vulnerable to attacks: UDP is vulnerable to denial-of-service attacks, where an attacker can flood a
network with UDP packets, overwhelming the network and causing it to crash.
5. Limited use cases: UDP is not suitable for applications that require reliable data delivery, such as
email or file transfers, and is better suited for applications that can tolerate some data loss, such as
video streaming or online gaming.
UDP PSEUDO HEADER:
 the purpose of using a pseudo-header is to verify that the UDP packet has reached its correct
destination
 the correct destination consist of a specific machine and a specific protocol port number within that
machine
107
UDP pseudo header
UDP pseudo header details:

 the UDP header itself specify only protocol port number.thus , to verify the destination UDP on the
sending machine computes a checksum that covers the destination IP address as well as the UDP
packet.
 at the ultimate destination, UDP software verifies the checksum using the destination IP address
obtained from the header of the IP packet that carried the UDP message.
 if the checksum agrees, then it must be true that the packet has reached the intended destination
host as well as the correct protocol port within that host.
User Interface:
A user interface should allow the creation of new receive ports, receive operations on the receive ports
that returns the data octets and an indication of source port and source address, and an operation that
allows a datagram to be sent, specifying the data, source and destination ports and address to be sent.
IP Interface:
 the UDP module must be able to determine the source and destination internet address and the
protocol field from internet header
 one possible UDP/IP interface would return the whole internet datagram including the entire
internet header in response to a receive operation
 such an interface would also allow the UDP to pass a full internet datagram complete with header to
the IP to send. the IP would verify certain fields for consistency and compute the internet header
checksum.
 The IP interface allows the UDP module to interact with the network layer of the protocol stack,
which is responsible for routing and delivering data across the network.
 The IP interface provides a mechanism for the UDP module to communicate with other hosts on the
network by providing access to the underlying IP protocol.
 The IP interface can be used by the UDP module to send and receive data packets over the network,
with the help of IP routing and addressing mechanisms.
 The IP interface provides a level of abstraction that allows the UDP module to interact with the
network layer without having to deal with the complexities of IP routing and addressing directly.
 The IP interface also handles fragmentation and reassembly of IP packets, which is important for
large data transmissions that may exceed the maximum packet size allowed by the network.
 The IP interface may also provide additional services, such as support for Quality of Service (QoS)
parameters and security mechanisms such as IPsec.
 The IP interface is a critical component of the Internet Protocol Suite, as it enables communication
between hosts on the internet and allows for the seamless transmission of data packets across the
network.
108
Transmission Control Protocol (TCP)

TCP (Transmission Control Protocol) is one of the main protocols of the Internet protocol suite. It lies
between the Application and Network Layers which are used in providing reliable delivery services. It is
a connection-oriented protocol for communications that helps in the exchange of messages between
different devices over a network. The Internet Protocol (IP), which establishes the technique for sending
data packets between computers, works with TCP.
TCP/IP Layer
Working of TCP
To make sure that each message reaches its target location intact, the TCP/IP model breaks down the
data into small bundles and afterward reassembles the bundles into the original message on the
opposite end. Sending the information in little bundles of information makes it simpler to maintain
efficiency as opposed to sending everything in one go.
After a particular message is broken down into bundles, these bundles may travel along multiple routes
if one route is jammed but the destination remains the same.
109
We can see that the message is being broken down, then reassembled from a different order at the
destination
For example, When a user requests a web page on the internet, somewhere in the world, the server
processes that request and sends back an HTML Page to that user. The server makes use of a protocol
called the HTTP Protocol. The HTTP then requests the TCP layer to set the required connection and
send the HTML file.
Now, the TCP breaks the data into small packets and forwards it toward the Internet Protocol (IP)
layer. The packets are then sent to the destination through different routes.
The TCP layer in the user’s system waits for the transmission to get finished and acknowledges once
all packets have been received.
Features of TCP/IP
Some of the most prominent features of Transmission control protocol are

1. Segment Numbering System
 TCP keeps track of the segments being transmitted or received by assigning numbers to each and
every single one of them.
 A specific Byte Number is assigned to data bytes that are to be transferred while segments are
assigned sequence numbers.
 Acknowledgment Numbers are assigned to received segments.
2. Connection Oriented
 It means sender and receiver are connected to each other till the completion of the process.
 The order of the data is maintained i.e. order remains same before and after transmission.
3. Full Duplex
 In TCP data can be transmitted from receiver to the sender or vice – versa at the same time.
 It increases efficiency of data flow between sender and receiver.
4. Flow Control
 Flow control limits the rate at which a sender transfers data. This is done to ensure reliable delivery.
 The receiver continually hints to the sender on how much data can be received (using a sliding
window)
5. Error Control
 TCP implements an error control mechanism for reliable data transfer
110
 Error control is byte-oriented
 Segments are checked for error detection
 Error Control includes – Corrupted Segment & Lost Segment Management, Out-of-order segments,
Duplicate segments, etc.
6. Congestion Control
 TCP takes into account the level of congestion in the network
 Congestion level is determined by the amount of data sent by a sender
Advantages
 It is a reliable protocol.
 It provides an error-checking mechanism as well as one for recovery.
 It gives flow control.
 It makes sure that the data reaches the proper destination in the exact order that it was sent.
 Open Protocol, not owned by any organization or individual.
 It assigns an IP address to each computer on the network and a domain name to each site thus making
each device site to be distinguishable over the network.
Disadvantages
 TCP is made for Wide Area Networks, thus its size can become an issue for small networks with low
resources.
 TCP runs several layers so it can slow down the speed of the network.
 It is not generic in nature. Meaning, it cannot represent any protocol stack other t han the TCP/IP
suite. E.g., it cannot work with a Bluetooth connection.
 No modifications since their development around 30 years ago.
Services and Segment structure in TCP
The Transmission Control Protocol is the most common transport layer protocol. It works together
with IP and provides a reliable transport service between processes using the network layer service
provided by the IP protocol.
The various services provided by the TCP to the application layer are as follows:
1. Process-to-Process Communication –
TCP provides a process to process communication, i.e, the transfer of data that takes place between
individual processes executing on end systems. This is done using port numbers or port addresses.
Port numbers are 16 bits long that help identify which process is sending or receiving data on a
host.
2. Stream oriented –
This means that the data is sent and received as a stream of bytes(unlike UDP or IP that divides the
bits into datagrams or packets). However, the network layer, that provides service for the TCP,
sends packets of information not streams of bytes. Hence, TCP groups a number of bytes together
into a segment and adds a header to each of these segments and then delivers these segments to the
network layer. At the network layer, each of these segments is encapsulated in an IP packet for
transmission. The TCP header has information that is required for control purposes which will be
discussed along with the segment structure.
3. Full-duplex service –
This means that the communication can take place in both directions at the same time.
111
4. Connection-oriented service –
Unlike UDP, TCP provides a connection-oriented service. It defines 3 different phases:
 Connection establishment
 Data transfer
 Connection termination
5. Reliability –
TCP is reliable as it uses checksum for error detection, attempts to recover lost or corrupted packets
by re-transmission, acknowledgement policy and timers. It uses features like byte number and
sequence number and acknowledgement number so as to ensure reliability. Also, it uses congestion
control mechanisms.
6. Multiplexing –
TCP does multiplexing and de-multiplexing at the sender and receiver ends respectively as a
number of logical connections can be established between port numbers over a physical
connection.
Byte number, Sequence number and Acknowledgement number:

All the data bytes that are to be transmitted are numbered and the beginning of this numbering is
arbitrary. Sequence numbers are given to the segments so as to reassemble the bytes at the receiver end
even if they arrive in a different order. The sequence number of a segment is the byte number of the
first byte that is being sent. The acknowledgement number is required since TCP provides full-duplex
service. The acknowledgement number is the next byte number that the receiver expects to receive
which also provides acknowledgement for receiving the previous bytes.
Example:
In this example we see that A sends acknowledgement number1001, which means that it has received
data bytes till byte number 1000 and expects to receive 1001 next, hence B next sends data bytes
starting from 1001. Similarly, since B has received data bytes till byte number 13001 after the first data
112
transfer from A to B, therefore B sends acknowledgement number 13002, the byte number that it
expects to receive from A next.
TCP Segment structure –
A TCP segment consists of data bytes to be sent and a header that is added to the data by TCP as
shown:
The header of a TCP segment can range from 20-60 bytes. 40 bytes are for options. If there are no
options, a header is 20 bytes else it can be of upmost 60 bytes.
Header fields:
 Source Port Address –

A 16-bit field that holds the port address of the application that is sending the data segment.
 Destination Port Address –

A 16-bit field that holds the port address of the application in the host that is receiving the data
segment.
 Sequence Number –
A 32-bit field that holds the sequence number, i.e, the byte number of the first byte that is sent in
that particular segment. It is used to reassemble the message at the receiving end of the segments
that are received out of order.
 Acknowledgement Number –
A 32-bit field that holds the acknowledgement number, i.e, the byte number that the receiver
113
expects to receive next. It is an acknowledgement for the previous bytes being received
successfully.
 Header Length (HLEN) –

This is a 4-bit field that indicates the length of the TCP header by a number of 4-byte words in the
header, i.e if the header is 20 bytes(min length of TCP header), then this field will hold 5 (because 5
x 4 = 20) and the maximum length: 60 bytes, then it’ll hold the value 15(because 15 x 4 = 60).
Hence, the value of this field is always between 5 and 15.
 Control flags –
These are 6 1-bit control bits that control connection establishment, connection termination,
connection abortion, flow control, mode of transfer etc. Their function is:
 URG: Urgent pointer is valid
 ACK: Acknowledgement number is valid( used in case of cumulative acknowledgement)
 PSH: Request for push
 RST: Reset the connection
 SYN: Synchronize sequence numbers
 FIN: Terminate the connection
 Window size –
This field tells the window size of the sending TCP in bytes.
 Checksum –
This field holds the checksum for error control. It is mandatory in TCP as opposed to UDP.
 Urgent pointer –
This field (valid only if the URG control flag is set) is used to point to data that is urgently required
that needs to reach the receiving process at the earliest. The value of this field is added to the
sequence number to get the byte number of the last urgent byte.
TCP Connection –
TCP is connection-oriented. A TCP connection is established by a 3-way handshake.
TCP 3-Way Handshake Process
This could also be seen as a way of how TCP connection is established. Before getting into the details,
let us look at some basics. TCP stands for Transmission Control Protocol which indicates that it does
something to control the transmission of the data in a reliable way.
The process of communication between devices over the internet happens according to the
current TCP/IP suite model(stripped out version of OSI reference model). The Application layer is a
top pile of a stack of TCP/IP models from where network referenced applications like web browsers on
the client-side establish a connection with the server. From the application layer, the information is
transferred to the transport layer where our topic comes into the picture. The two important protocols of
this layer are – TCP, UDP(User Datagram Protocol) out of which TCP is prevalent(since it provides
reliability for the connection established). However, you can find an application of UDP in querying
the DNS server to get the binary equivalent of the Domain Name used for the website.
114
TCP provides reliable communication with something called Positive Acknowledgement with Re-
transmission(PAR). The Protocol Data Unit(PDU) of the transport layer is called a segment. Now a
device using PAR resend the data unit until it receives an acknowledgement. If the data unit received at
the receiver’s end is damaged(It checks the data with checksum functionality of the transport layer that
is used for Error Detection), the receiver discards the segment. So the sender has to resend the data unit
for which positive acknowledgement is not received. You can realize from the above mechanism that
three segments are exchanged between sender(client) and receiver(server) for a reliable TCP
connection to get established. Let us delve into how this mechanism works :
 Step 1 (SYN): In the first step, the client wants to establish a connection with a server, so it sends a
segment with SYN(Synchronize Sequence Number) which informs the server that the client is
likely to start communication and with what sequence number it starts segments with
 Step 2 (SYN + ACK): Server responds to the client request with SYN-ACK signal bits set.
Acknowledgement(ACK) signifies the response of the segment it received and SYN signifies with
what sequence number it is likely to start the segments with
 Step 3 (ACK): In the final part client acknowledges the response of the server and they both
establish a reliable connection with which they will start the actual data transfer
115
TEXT BOOK:
1. Data Communications and Networking, Forouzan, 5th Edition, McGraw Hill, 2016 ISBN: 1-25-
906475-3
2. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
REFERENCES:
1. Computer Networks, James J Kurose, Keith W Ross, Pearson Education, 2013, ISBN: 0-273-
76896-4
2. Introduction to Data Communication and Networking, Wayarles Tomasi, Pearson Education,
2007, ISBN:0130138282
3. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
4. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education, 2013.
ONLINE RESOURCES:
1. https://www.udemy.com/course/learning-computer-communication-and-networking-fundamentals/ -
Introduction to Computer Networks
2. https://www.tutorialspoint.com/data_communication_computer_network/index.htm - Computer
Networks
3. https://onlinecourses.nptel.ac.in/noc22_cs19/preview- Computer Networks and Internet Protocol
Department of Electronics and Communication Engineering
CONTINUOUS LEARNING ASSESSMENTI

U20ECCJ09/ COMPUTER COMMUNICATION NETWORKS
Date : 18-04-2023
Year / Semester : III / VI
Duration : 1 Hour
Instructions : Read the question carefully and answer.
PART A (05*02= 10 Marks)
Answer all the questions
Blooms
Q No. Question Weightage CO
Level
1 What is mean by data communication? 02 CO1 1
2 Why are protocols needed? 02 CO1 1
What are the three criteria necessary for an effective and efficient CO2 1
3 02
network?
4 What are the features of ALOHA. 02 CO2 1
5 Explain Multiple Access Control. 02 CO2 2
PART B (02*04= 08 Marks)

Answer Either (a) Or (b) from Each Questions
Blooms
Q.No. Question Weightage CO
Level
a.Explain the Characteristics of Data Communication Systems. 04 CO1 2
6
(OR) b.Compare Simplex, Half Duplex and Full Duplex. 04 CO1 2
a.Explain in detail about Token passing. 04 CO2 2

7
(OR) b.Explain the Characteristics of TDMA. 04 CO2 2
PART C (01*12= 12 Marks)

Answer any oneQuestion
Q.No. Question Weightage CO Blooms
Level
a.Explain in detail about Network Topology. 12 CO1 2
8
(OR) b. Describe the layers of OSI Models. 12 CO1 2
Assessment Summary:
Total
COs Remember Understand Apply Analyse Evaluate Create
(30)
CO1 4 16 20
CO2 4 6 10
Bharath Institute Of Higher Education and Research (BIHER) IQAC/ACAD/008

CONTINUOUS LEARNING ASSESSMENT I
ANSWER KEY
PART A
1. What is mean by data communication?
Data communications (DC) is the process of using computing and communication
technologies to transfer data from one place to another, or between participating parties.
2. Why are protocols needed?
In networking, a protocol is a set of rules for formatting and processing data. Network protocols are like a
common language for computers. The computers within a network may use vastly different software and
hardware; however, the use of protocols enables them to communicate with each other regardless.
3. What are the three criteria necessary for an effective and efficient network?
The most important criteria are performance, reliability, and security. Performance of the network
depends on the number of users, type of transmission medium, the capabilities of the connected h/w, and
the efficiency of the s/w
4. What are the features of ALOHA
 Devices can transmit data whenever they have a message to send.
 If two or more devices transmit simultaneously, their messages will collide and be corrupted.
 Devices that detect a collision will wait for a random amount of time before trying to transmit
again.
5. Explain Multiple Access Control.

The data connection control layer is sufficient if there is a dedicated link present between the sender and
the receiver, but numerous stations can access the channel at once if there isn't. Therefore, it is necessary
to use several access protocols to reduce collision and prevent crosstalk.
PART B
6(a).. Explain the Characteristics of Data Communication Systems
four fundamental characteristics: delivery, accuracy, timeliness, and jitter.

 Delivery. The system must deliver data to the correct destination. Data must be received by the
intended device or user and only by that device or user.
 Accuracy. The system must deliver the data accuracy. Data that have been altered in transmission
and left uncorrected are unusable.
 Timeliness. The system must deliver data in a timely manner. Data delivered late are useless. In
the case of video and audio, timely delivery means delivering data as they are produced, in the
same order that they are produced, and without significant delay. This kind of delivery is called
real-time transmission.
 Jitter. Jitter refers to the variation in the packet arrival time. It is the uneven delay in the delivery
of audio or video packets. For example, let us assume that video packets are sent every 30 ms. If
some of the packets arrive with 30-ms delay and others with 40-ms delay, an uneven quality in the
video is the result.
6.(b) Compare Simplex, Half Duplex and Full Duplex.
parameters Simplex Half Duplex Full Duplex
Half Duplex mode is a Full Duplex mode is a

Simplex mode is a uni-
The direction of two-way directional two-way directional
directional
communication communication but one communication
communication.
at a time. simultaneously.
In simplex mode, In Half Duplex mode, In Full Duplex mode,

Sender and Sender can send the Sender can send the data Sender can send the data
Receiver data but that sender and also can receive the and also can receive the
can’t receive the data. data but one at a time. data simultaneously.
Usage of one channel Usage of one channel Usage of two channels

Channel usage for the transmission of for the transmission of for the transmission of
data. data. data.
The simplex mode The Half Duplex mode Full Duplex provides
provides less provides less better performance than
Performance
performance than half performance than full simplex and half duplex
duplex and full duplex. duplex. mode.
The Half-Duplex
Simplex utilizes the involves lesser The Full-Duplex doubles
Bandwidth
maximum of a single utilization of single the utilization of
Utilization
bandwidth. bandwidth at the time of transmission bandwidth.
transmission.
It is suitable for those It is suitable for those

It is suitable for those
transmissions when transmissions when there
transmissions when
there is requirement of is requirement of
Suitable for there is requirement of
sending data in both sending and receiving
full bandwidth for
directions, but not at the data simultaneously in
delivering data.
same time. both directions.
Example of simplex Example of half duplex

Example of full duplex
Examples mode are: Keyboard mode is: Walkie-
mode is: Telephone.
and monitor. Talkies.
7(a). Explain in detail about Token passing.
 In token passing scheme, the stations are connected logically to each other in form of ring and
access to stations is governed by tokens.
 A token is a special bit pattern or a small message, which circulate from one station to the next in
some predefined order.
 In Token ring, token is passed from one station to another adjacent station in the ring whereas in
case of Token bus, each station uses the bus to send the token to the next station in some predefined
order.
 In both cases, token represents permission to send. If a station has a frame queued for transmission
when it receives the token, it can send that frame before it passes the token to the next station. If it
has no queued frame, it passes the token simply.
 After sending a frame, each station must wait for all N stations (including itself) to send the token
to their neighbours and the other N – 1 stations to send a frame, if they have one.
 There exist problems like duplication of token or token is lost or insertion of new station, removal
of a station, which need be tackled for correct and reliable operation of this scheme.
Performance of token ring can be concluded by 2 parameters: -

1. Delay, is a measure of time between when a packet is ready and when it is delivered. So, the
average time (delay) required to send a token to the next station = a/N.
2. Throughput, which is a measure of successful traffic.
7(b). Explain the Characteristics of TDMA.
 Time Division Multiple Access (TDMA) is a complex technology, because it requires an accurate
synchronization between the transmitter and the receiver. TDMA is used in digital mobile radio
systems. The individual mobile stations cyclically assign a frequency for the exclusive use of a
time interval.
 In most of the cases, the entire system bandwidth for an interval of time is not assigned to a
station. However, the frequency of the system is divided into sub-bands, and TDMA is used for
the multiple access in each sub-band. Sub-bands are known as carrier frequencies. The mobile
system that uses this technique is referred as the multi-carrier systems.
 In the following example, the frequency band has been shared by three users. Each user is
assigned definite timeslots to send and receive data. In this example, user ‘B’ sends after
user ‘A,’ and user ‘C’ sends thereafter. In this way, the peak power becomes a problem and larger
by the burst communication.
PART C
8(a). Explain in detail about Network Topology.
The term physical topology refers to the way in which a network is laid out physically. Two or
more devices connect to a link; two or more links form a topology. The topology of a network is
the geometric representation of the relationship of all the links and linking devices (usually called
nodes) to one another. There are four basic topologies possible: mesh, star, bus, and ring
MESH:
A mesh topology is the one where every node is connected to every other node in the network.
A mesh topology can be a full mesh topology or a partially connected mesh topology. In a full
mesh topology, every computer in the network has a connection to each of the other computers in
that network. The number of connections in this network can be calculated using the following
formula (n is the number of computers in the network): n(n-1)/2 In a partially connected mesh
topology, at least two of the computers in the network have connections to multiple other
computers in that network. It is an inexpensive way to implement redundancy in a network. In the
event that one of the primary computers or connections in the network fails, the rest of the
network continues to operate normally. Advantages of a mesh topology
 Can handle high amounts of traffic, because multiple devices can transmit data simultaneously.
 A failure of one device does not cause a break in the network or transmission of data
.  Adding additional devices does not disrupt data transmission between other devices.
Disadvantages of a mesh topology
 The cost to implement is higher than other network topologies, making it a less desirable option.
 Building and maintaining the topology is difficult and time consuming.
 The chance of redundant connections is high, which adds to the high costs and potential for
reduced efficiency.
STAR:
A star network, star topology is one of the most common network setups. In this configuration,
every node connects to a central network device, like a hub, switch, or computer. The central
network device acts as a server and the peripheral devices act as clients. Depending on the type of
network card used in each computer of the star topology, a coaxial cable or a RJ-45 network cable
is used to connect computers together.
Advantages of star topology
 Centralized management of the network, through the use of the central computer, hub, or switch
 Easy to add another computer to the network.
 If one computer on the network fails, the rest of the network continues to function normally.
 The star topology is used in local-area networks (LANs), High-speed LANs often use a star
topology with a central hub.
Disadvantages of star topology
 Can have a higher cost to implement, especially when using a switch or router as the central
network device.
 The central network device determines the performance and number of nodes the network can
handle
.  If the central computer, hub, or switch fails, the entire network goes down and all computers
are disconnected from the network
BUS:
a line topology, a bus topology is a network setup in which each computer and network device are
connected to a single cable or backbone.
Advantages of bus topology
 It works well when you have a small network.
 It's the easiest network topology for connecting computers or peripherals in a linear fashion.
 It requires less cable length than a star topology.
Disadvantages of bus topology
 It can be difficult to identify the problems if the whole network goes down.
 It can be hard to troubleshoot individual device issues.
 Bus topology is not great for large networks.
 Terminators are required for both ends of the main cable.
 Additional devices slow the network down.
 If a main cable is damaged, the network fails or splits into two.
RING:
A ring topology is a network configuration in which device connections create a circular data
path. In a ring network, packets of data travel from one device to the next until they reach their
destination. Most ring topologies allow packets to travel only in one direction, called a
unidirectional ring network. Others permit data to move in either direction, called bidirectional.
The major disadvantage of a ring topology is that if any individual connection in the ring is
broken, the entire network is affected. Ring topologies may be used in either local area networks
(LANs) or wide area networks (WANs).
Advantages of ring topology
 All data flows in one direction, reducing the chance of packet collisions.
 A network server is not needed to control network connectivity between each workstation.
 Data can transfer between workstations at high speeds.
 Additional workstations can be added without impacting performance of the network.
Disadvantages of ring topology
 All data being transferred over the network must pass through each workstation on the network,
which can make it slower than a star topology.
 The entire network will be impacted if one workstation shuts down.
 The hardware needed to connect each workstation to the network is more expensive than
Ethernet cards and hubs/switches.
8(b). Describe the layers of OSI Models.
Introduction to OSI Model & its layers

The Open Systems Interconnection (OSI) Model was developed
by International Organization for Standardization (ISO).
ISO is the organization, OSI is the model
It was developed to allow systems with different platforms to
communicate with each other. Platform could mean hardware,
software or operating system.
It is a network model that defines the protocols for network
communications.
It is a hierarchical model that groups its processes into layers. It
has 7 layers as follows: (Top to Bottom)
1. Application Layer
2. Presentation Layer
3. Session Layer
4. Transport Layer
5. Network Layer
6. Data Link Layer
7. Physical Layer
Each layer has specific duties to perform and has to co-
operate with the layers above and below it.
Description of Layers in the OSI Model

1. Physical Layer
I. The Physical Layer provides a standardized interface tophysical
transmission media, including :
a. Mechanical specification of electrical connectorsand
cables, for example maximum cable length
b. Electrical specification of transmission line
c. Bit-by-bit or symbol-by-symbol delivery
II. On the sender side, the physical layer receives the data fromData
Link Layer and encodes it into signals to be transmitted onto the
medium. On the receiver side, the physical layer receives the signals
from the transmission medium decodesit back into data and sends
it to the Data Link Layer as shown in the figure below:
Fig: Transmission of data to and from Physical Layer
III. Interface
The Physical Layer defines the characteristics of interfaces
between the devices & transmission medium.
IV. Representation of bits
The physical layer is concerned with transmission of signals from
one device to another which involves converting data (1‘s & 0‘s)
into signals and vice versa. It is not concernedwith the meaning
or interpretation of bits.
V. Data rate
The physical layer defines the data transmission rate i.e.number of
bits sent per second. It is the responsibility of the physical layer to
maintain the defined data rate.
VI. Synchronization of bits

To interpret correct and accurate data the sender and receiver have
to maintain the same bit rate and also have synchronized clocks.
VII. Line configuration

The physical layer defines the nature of the connection .i.e. apoint
to point link, or a multi point link.
VIII. Physical Topology

The physical layer defines the type of topology in which the device
is connected to the network. In a mesh topology it uses a multipoint
connection and other topologies it uses a point to point connection
to send data.
IX. Transmission mode

The physical layer defines the direction of data transfer between the
sender and receiver. Two devices can transfer the data in simplex,
half duplex or full duplex mode
X. Main responsibility of the physical layer

Transmission of bits from one hop to the next.
2. Data Link Layer

I. The Data Link layer adds reliability to the physical layer by
providing error detection and correction mechanisms.
II. On the sender side, the Data Link layer receives the data from
Network Layer and divides the stream of bits into fixed size
manageable units called as Frames and sends it to the physical
layer. On the receiver side, the data link layer receives the stream
of bits from the physical layer and regroups them into frames
and sends them to the Network layer. This process is called
Framing. It is shown in the figure below:
Fig: Data Link Layer: The process of Framing
III. Physical Addressing (inside / outside sendersnetwork)

a. The Data link layer appends the physical address in the
header of the frame before sending it to physical layer.
b. The physical address contains the address of the sender and

receiver.
c. In case the receiver happens to be on the same physical

network as the sender; the receiver is at only one hop from
the sender and the receiver address contains the receiver‘s
physical address.
d. In case the receiver is not directly connected to the sender,
the physical address is the address of the next node where
the data is supposed to be delivered.
IV. Flow control

a. The data link layer makes sure that the sender sends the
data at a speed at which the receiver can receive it else if
there is an overflow at the receiver side the data will be
lost.
b. The data link layer imposes flow control mechanism over

the sender and receiver to avoid overwhelming of the
receiver.
V. Error control
a. The data link layer imposes error control mechanism to
identify lost or damaged frames, duplicate frames and then
retransmit them.
b. Error control information is present in the trailer of a
frame.
VI. Access Control
a. The data link layer imposes access control mechanism to
determine which device has right to send data in an
multipoint connection scenario.

i. The main responsibility of the data link layer is hop to hop
transmission of frames.
3. Network Layer
I. The network layer makes sure that the data is delivered to the
receiver despite multiple intermediate devices.
II. The network layer at the sending side accepts data from the transport
layer, divides it into packets, adds addressing information in the
header and passes it to the data link layer. At the receiving end the
network layer receives the frames sent by data link layer, converts
them back into packets, verifies the physical address (verifies if the
receiver address matches with its own address) and the send the
packets to the transport layer.
Fig: Network Layer
III. The network layer is responsible for source to destination of delivery

of data. Hence it may have to route the data through multiple
networks via multiple intermediate devices. In order to achieve this
the network layer relies on two things:
a. Logical Addressing
b. Routing
IV. Logical Addressing

The network layer uses logical address commonly knownas IP
address to recognize devices on the network.
An IP address is a universally unique address which enables the
network layer to identify devices outside the sender‘s network.
The header appended by the network layer contains the actual
sender and receiver IP address.
At every hop the network layer of the intermediate node check

the IP address in the header, if its own IP address does not match
with the IP address of the receiver found in the header, the
intermediate node concludes that it is not the final node but an
intermediate node and passes the packet to the data link layer
where the data is forwarded to the next node.
V. Routing
VI. The network layer divides data into units called packets of
equal size and bears a sequence number for rearranging on the
receiving end.
Each packet is independent of the other and may travel using

different routes to reach the receiver hence may arrive out of
turn at the receiver.
Hence every intermediate node which encounters a packet tries

to compute the best possible path for the packet. The best
possible path may depend on several factors such as congestion,
number of hops, etc
This process of finding the best path is called as Routing.

It is done using routing algorithms.
VI. The Network layer does not perform any flow control or error
control

The main responsibility of Network Layer is
transmission of packets from source to destination
4. Transport Layer
I. A logical address at network layer facilitates the transmission
of data from source to destination device. But the source and
the destination both may be having multiple processes
communicating with each other. Hence it is important to
deliver the data not only from the sender to the receiver but
from the correct process on the sender to the correct process
on the receiver. The transport layer takes care of process to
process delivery of data and makes sure that it is intact and in
order.
II. At the sending side, the transport layer receives data from the
session layer, divides it into units called segments and sends
it to the network layer. At the receiving side, the transport
layer receives packets from the network layer, converts and
arranges into proper sequence of segments and sends it to the
session layer.
Fig: Transport Layer
III. To ensure process to process delivery the transport layer

makes use of port address to identify the data from the
sending and receiving process. A Port Address is the name or
label given to a process. It is a
16 bit address. Ex. TELNET uses port address 23,HTTP uses
port address 80. Port address is also called as Service Point
Address
IV. The data can be transported in a connection oriented or

connectionless manner. If the connection is connection
oriented then all segments are received in order else they are
independent of each other and are received out of order and
have to be rearranged.
V. The Transport layer is responsible for segmentation and

reassembly of the message into segments which bear
sequence numbers. This numbering enables the receiving
transport layer to rearrange the segments in proper order.
VI. Flow Control & Error control: the transport layer also
carries out flow control and error control functions; but unlike
data link layer these are end to end rather than node to node.
The main responsibility of the transport layer isprocess
to process delivery of the entire message.
5. Session Layer
I. The session layer establishes a session between the
communicating devices called dialog and synchronizes their
interaction. It is the responsibility of the session layer to
establish and synchronize the dialogs. It is also called the
network dialog controller.
II. The session layer at the sending side accepts data from the
presentation layer adds checkpoints to it called syn bits and
passes the data to the transport layer. At the receiving end
the session layer receives data from the transport layer
removes the checkpointsinserted previously and passes the
data to the presentation layer.
III. The checkpoints or synchronization points is a way of

informing the status of the data transfer. Ex. A checkpoint
after first 500 bits of data will ensure that those 500 bits are
not sent again in case ofretransmission at 650th bit.
IV. Main responsibility of session layer is dialogcontrol

and synchronizatoin
6. Presentation Layer
I. The communicating devices may be having different platforms. The
presentation layer performs translation, encryption and compression
of data.
II. The presentation layer at sending side receives the datafrom the
application layer adds header which contains information related to
encryption and compression and sends it to the session layer. At
the receiving side, the presentation layer receives data from the
session layer decompresses and decrypts the data as required and
translates it back as per the encoding scheme used at the receiver.
Fig : Presentation Layer
III. Translation
The sending and receiving devices may run on different platforms
(hardware, software and operating system). Henceit is important that
they understand the messages that are used for communicating.
Hence a translation service may be required which is provided by
the Presentation layers
IV. Compression
Compression ensures faster data transfer. The data compressed at
sender has to be decompressed at the receiving end, both performed
by the Presentation layer.
V. Encryption
It is the process of transforming the original message tochange its
meaning before sending it. The reverse process called decryption
has to be performed at the receiving end to recover the original
message from the encrypted message.
VI. Main responsibility

The main responsibility of the Presentation layer is translation,
compression and encryption.
7. Application Layer
I. The application layer enables the user to
communicate its data to the receiver by providing
certain services. For ex. Email is sent using X.400
service.
Fig : Application Layer
II. X500 is a directory service used to provide

information and access to distributed objects
III. X400 is services that provides basis for mail

storage and forwarding
IV. FTAM (File transfer, access and

management) provides access to files stored on
remote computers and mechanism for transfer
and manage them locally.
V. Main Responsibility
Main Responsibility of Application layer is to
provideaccess to network resources.
CONTINUOUS LEARNING ASSESSMENT II

Date : 18.05.2023
Duration : 1 Hour
Blooms
Level
1 What is meant by CSMA/CD? 02 CO2 1
2 Define Controlled Access and list three protocols in this category. 02 CO2 1
3 List the method used in CSMA to sense the channel. 02 CO2 1
4 Sketch the format of 802.3 MAC frame. 02 CO3 1
5 What is the function of L2CAP? 02 CO3 1

Blooms
Level
6 Write Short notes about Polling. 04 CO2 2
(OR) Write short notes of CSMA method. 04 CO2 2
Explain the three categories of frames for IEEE 802.11 04 CO3 2

7
(OR) Distinguish between Unicast, Multicast and Broad cast transmission. 04 CO3 2

Answer any one Question
Level
a. Explain in detail about IEEE 802.11 Architecture with neat sketch. 12 CO3 2
8
(OR) b. Describe about IEEE 802.15 Architecture with neat sketch 12 CO3 2
Assessment Summary:
Total
(30)
CO2 6 4 10
CO3 4 16 20
Staff Name
Prepared by Ms.G.JeyalakshmiI, Ms. P.Vanithamani, Signature
Ms. B.Pearly
HoD
Verified by Signature
Dr.H.UMMAHABIBA


Date : 18.05.2023
Duration : 1 Hour
Blooms
Level
1 What is meant by CSMA/CD? 02 CO2 1
2 Define Controlled Access and list three protocols in this category. 02 CO2 1
3 List the method used in CSMA to sense the channel. 02 CO2 1
4 Sketch the format of 802.3 MAC frame. 02 CO3 1
5 What is the function of L2CAP? 02 CO3 1

Blooms
Level
6 Write Short notes about Polling. 04 CO2 2
(OR) Write short notes of CSMA method. 04 CO2 2
Explain the three categories of frames for IEEE 802.11 04 CO3 2

7
(OR) Distinguish between Unicast, Multicast and Broad cast transmission. 04 CO3 2

Level
a. Explain in detail about IEEE 802.11 Architecture with neat sketch. 12 CO3 2
8
(OR) b. Describe about IEEE 802.15 Architecture with neat sketch 12 CO3 2
Assessment Summary:
Total
(30)
CO2 6 4 10
CO3 4 16 20
Staff Name
Prepared by Ms.G.JeyalakshmiI, Ms. P.Vanithamani, Signature
Ms. B.Pearly
HoD
Dr.H.UMMAHABIBA

ANSWER KEY
PART A
1. What is meant by CSMA/CD?
Carrier-sense multiple access with collision detection (CSMA/CD) is a medium
access control (MAC) method used most notably in early Ethernet technology for
local area networking. It uses carrier-sensing to defer transmissions until no other
stations are transmitting.
2. Define Controlled Access and list three protocols in this category

In controlled access, the stations seek information from one another to find which
station has the right to send. It allows only one node to send at a time, to avoid the collision
of messages on a shared medium. The three controlled-access methods are:
1. Reservation
2. Polling
3. Token Passing
. 3. List the method used in CSMA to sense the channel.
1-Persistent, Non-Persistent, P-Persistent, and O-Persistent are the three access

methods of CSMA. In the 1-Persistent method of the CSMA, if the station finds the
medium idle then the station will immediately send the data frame with 1- probability.
4. Sketch the format of 802.3 MAC frame.
5.What is the function of L2CAP?

Logical Link Controller and Adaptation Protocol. In Bluetooth, the Logical Link
Controller and Adaptation Protocol functions include: higher level protocol
multiplexing, conveying of quality of service information and controlling packet
segmentation and reassembly.
Part B
6 (a). Write Short notes about Polling.
Polling
 Polling process is similar to the roll-call performed in class. Just like the teacher, a
controller sends a message to each node in turn.
 In this, one acts as a primary station(controller) and the others are secondary stations.
All data exchanges must be made through the controller.
 The message sent by the controller contains the address of the node being selected for
granting access.
 Although all nodes receive the message the addressed one responds to it and sends data
if any. If there is no data, usually a “poll reject”(NAK) message is sent back.
 Problems include high overhead of the polling messages and high dependence on the
reliability of the controller.
Advantages of Polling:
 The maximum and minimum access time and data rates on the channel are fixed
predictable.
 It has maximum efficiency.
 It has maximum bandwidth.
 No slot is wasted in polling.
 There is assignment of priority to ensure faster access from some secondary.
Disadvantages of Polling:
 It consume more time.
 Since every station has an equal chance of winning in every round, link sharing
is biased.
 Only some station might run out of data to send.
 An increase in the turnaround time leads to a drop in the data rates of the channel under
low loads.
Efficiency Let Tpoll be the time for polling and T t be the time required for transmission of
data. Then,
Efficiency = Tt/(Tt + Tpoll)
6(b). Write short notes of CSMA method.
CSMA (Carrier Sense Multiple Access)
It is a carrier sense multiple access based on media access protocol to sense the traffic on a
channel (idle or busy) before transmitting the data. It means that if the channel is idle, the
station can send data to the channel. Otherwise, it must wait until the channel becomes idle.
Hence, it reduces the chances of a collision on a transmission medium.
CSMA Access Modes
1-Persistent: In the 1-Persistent mode of CSMA that defines each node, first sense the shared
channel and if the channel is idle, it immediately sends the data. Else it must wait and keep
track of the status of the channel to be idle and broadcast the frame unconditionally as soon as
the channel is idle.
Non-Persistent: It is the access mode of CSMA that defines before transmitting the data, each
node must sense the channel, and if the channel is inactive, it immediately sends the data.
Otherwise, the station must wait for a random time (not continuously), and when the channel
is found to be idle, it transmits the frames.
P-Persistent: It is the combination of 1-Persistent and Non-persistent modes. The P-Persistent

mode defines that each node senses the channel, and if the channel is inactive, it sends a frame
with a P probability. If the data is not transmitted, it waits for a (q = 1-p probability) random
time and resumes the frame with the next time slot.
O- Persistent: It is an O-persistent method that defines the superiority of the station before the
transmission of the frame on the shared channel. If it is found that the channel is inactive, each
station waits for its turn to retransmit the data.
7(a). Explain the three categories of frames for IEEE 802.11
Three 802.11 frame types, which also have multiple subtype frames
 Management frames
 Control frames
 Data frames
Management frames
 802.11 management frames make up a majority of the frame types in a WLAN.

 Management frames are used by wireless stations to join and leave the basic service set
(BSS).
 Another name for an 802.11 management frame is Management MAC Protocol Data
Unit (MMPDU).
 Information fields are fixed-length fields in the body of a management frame
 Information elements are variable in length
Control Frames
 802.11 control frames assist with the delivery of the data frames
 Control frames are transmitted at one of the basic rates
 Control frames are also used to:
 clear the channel
 acquire the channel
 provide unicast frame acknowledgments
 They contain only header information
Data Frames
 Most 802.11 data frames carry the actual data that is passed down from the higher-layer
protocols.
 The layer 3 – 7 MSDU payload is normally encrypted for data privacy reasons.
 Some 802.11 data frames carry no MSDU payload at all but do have a specific MAC
control purpose within a BSS.
 Any data frames that do not carry an MSDU payload are not encrypted because a layer 3
– 7 data payload does not exist.
 The simple data frame has MSDU upper-layer information encapsulated in the frame
body.
 The integration service that resides in access points and WLAN controllers takes the
MSDU payload of a simple data frame and transfers the MSDU into 802.3 Ethernet
frames.
 Null function frames are sometimes used by client stations to inform the AP of changes
in Power Save status.
7(b). Distinguish between Unicast, Multicast and Broad cast transmission
Feature Unicast Broadcast Multicast
A communication
A communication A communication
where a message is
where a message is where a message is
Definition sent from one sender
sent from one sender sent from one sender
to a group of
to one receiver. to all receivers.
receivers
Data is sent to all

Data is sent to a Data is sent to a
Transmission recipients in a
single recipient group of recipients
network
Uses a unique Uses a special Uses a special

Addressing
destination address broadcast address multicast address
Not all devices may Not all devices may

Delivery Guaranteed delivery be interested in the be interested in the
data data
Generates the least Generates the most
Network Generates moderate
amount of network amount of network
Traffic network traffic
traffic traffic
Less secure because Moderately secure

More secure because
data is sent to all because data is sent to
Security data is sent to a
devices in the a specific group of
specific recipient
network devices
DHCP requests, ARP Video streaming,

Examples Email, file transfer
requests online gaming
Destination Single receiver All receivers Grop of receivers
Bandwidth
Moderate High Moderate
usage
Latency Low High Moderate
8(a).. Explain in detail about IEEE 802.11 Architecture with neat sketch.
Basic Service Set

The Basic Service Set configuration consists of a group of stations and relies on an Access
Point (AP), which serves as a logical hub. Stations from different BSSs interact through the
AP, which functions as a bridge, linking multiple WLAN cells or channels.
Operating Modes
Depending upon the mode of operation, BSS can be categorized into the following types:
 Infrastructure BSS: Communication between stations takes place through access
points. The AP and its associated wireless clients define the coverage area and form the
BSS.
Infrastructure BSS
 Independent BSS – Supports mutual communication between wireless clients. An ad-

hoc network is spontaneously created and does not support access to wired networks.
Independent BSS
Independent Basic Service Set

In the IBSS configuration, also referred to as independent configuration or ad-hoc network,
no single node is required to act as a server. The stations communicate directly with one
another in a peer-to-peer basis. Generally, IBSS covers a limited area instead of a large
network. Typically covering a specific area, IBSS is used for specific, short-term purposes
with a limited number of nodes.
Extended Service Set
ESS connects multiple BSSs and consists of several BSS cells, which can be interlinked
through wired or wireless backbones known as a distributed system. Multiple cells use the
same channel to boost aggregate throughput to network. The equipment outside of the ESS,
the ESS and all of its mobile stations comprise a single MAC layer network where all stations
are virtually stationary. Thus, all stations within the ESS appear stationary from an outsider’s
perspective.
Other components include:
 Distribution System (DS): Links APs within the ESS.
 Portal: Serves as a gateway to other networks.
Architecture for IEEE 802.11 Configuration
 Roaming: In an environment with multiple access points (like a large office building or
campus), a device can move from the range of one AP to another and still maintain its
connection. This is possible due to the underlying architecture of the IEEE 802.11
standard which allows for roaming between APs.
 Authentication and Association: Before a station can send or receive data frames on a
WLAN, it needs to establish its identity with an AP. This process is called
authentication. After authentication, the station then establishes a data link-layer
connection with the AP through a process called association.
8(b). Describe about IEEE 802.15 Architecture with neat sketch

The architecture of LR-WPAN Device:
IEEE 802.15.4
Types of devices in IEEE 802.15.4 Technology
IEEE 802.15.4 technology includes various types of devices that can be used for wireless
communication and networking. These devices are −
 Coordinator − This device is responsible for initiating the PAN (Personal Area
Network) and managing the network.
 Full Function Device (FFD) − This device has the ability to act as a coordinator or a
router, and can also host other devices.
 Reduced Function Device (RFD) − A device that can only communicate with FFDs,
but not capable of hosting other devices or working as a coordinator.
 Sensor Node − This device includes sensor modules for monitoring physical
parameters such as temperature, humidity, pressure, etc., and transmit data wirelessly
to the receiver.
 Actuator Node − This device receives information sent by the controller node and
performs actions accordingly to control actuators such as motors, pumps, valves, etc.
 Gateway Node − A bridge between different networks to exchange data using different
protocols such as Wi-Fi or Ethernet.
 Repeater Node − A device that retransmits data packets from one node to another in
order to extend the range of network coverage.
These different types of devices offer versatile options for creating industrial applications using
IEEE 802.15.4 technology, ranging from monitoring physical parameters to controlling
electrical appliances remotely via wireless networks.
Advantages of IEEE 802.15.4:
IEEE 802.15.4 has the following advantages:

 cheap cost
 long battery life,
 Quick installation
 simple
 extensible protocol stack
Disadvantages of IEEE 802.15.4:
IEEE 802.15.4’s drawbacks include:

 IEEE 802.15.4 causes interference and multipath fading.
 doesn’t employ a frequency-hopping approach.
 unbounded latency
 interference susceptibility
Applications of IEEE 802.15.4:
IEEE 802.15.4 Applications:

 Wireless sensor networks in the industry
 Building and home automation
 Remote controllers and interacting toys
 Automotive networks
CONTINUOUS LEARNING ASSESSMENT III

Date : 15.06.2023
Duration : 1 Hour
Blooms
Level
1 Define IPv4 address 2 CO4 1
2 What is Internet Control Message Protocol 2 CO4 1
3 List the three types of addresses in TCP/IP. 2 CO5 1
4 Write the function of transport layer. 2 CO5 1
5 What are the advantages of using UDP over TCP? 2 CO5 1

Blooms
Level
6 Explain about stop and wait protocol? 4 CO5 2
(OR) Describe about UDP Application. 4 CO5 2
Describe about TCP Features. 4 CO5 2

7
(OR) Design piggy bagging in go-back N? 4 CO5 2

Level
Explain in detail about IPV4 Datagram format. 12 CO4 2
8
(OR) Explain in detail about distance vector routing with neat diagram. 12 CO4 2
Assessment Summary:
Total
(30)
CO4 4 12 16
CO5 6 8 14
Staff Name
Mrs. JEYA LAKSHMI,
Prepared by Signature
Mrs. P. VANITHAMAIN
Ms. B. PEARLY
HoD
Dr.H.UMMAHABIBA

CONTINUOUS LEARNING ASSESSMENT III
ANSWER KEY
PART A
1. Define IPv4 address
IP stands for Internet Protocol and v4 stands for Version Four (IPv4). IPv4 was
the primary version brought into action for production within the ARPANET in
1983.
IP version four addresses are 32-bit integers which will be expressed in decimal
notation.
Example- 192.0.2.126 could be an IPv4 address.
2. What is Internet Control Message Protocol?

The Internet Control Message Protocol (ICMP) is a network layer protocol used by
network devices to diagnose network communication issues. ICMP is mainly used to
determine whether or not data is reaching its intended destination in a timely manner.
3. List the three types of addresses in TCP/IP.

CP/IP supports three classes of Internet addresses: Class A, Class B, and Class C. The
different classes of Internet addresses are designated by how the 32 bits of the address
are allocated. The particular address class a network is assigned depends on the size
of the network.
4. Write the function of transport layer.

The transport layer provides a logical communication between application processes
running on different hosts. Although the application processes on different hosts are
not physically connected, application processes use the logical communication
provided by the transport layer to send the messages to each other.
5. What are the advantages of using UDP over TCP?
Advantages of UDP
 It does not require any connection for sending or receiving data.
 Broadcast and Multicast are available in UDP.
 UDP can operate on a large range of networks.
 UDP has live and real-time data.
 UDP can deliver data if all the components of the data are not complete.
PART B
6(a) Explain about stop and wait protocol?
top and wait means, whatever the data that sender wants to send, he sends the data to the
receiver. After sending the data, he stops and waits until he receives the acknowledgment from
the receiver. The stop and wait protocol is a flow control protocol where flow control is one of
the services of the data link layer.
It is a data-link layer protocol which is used for transmitting the data over the noiseless
channels. It provides unidirectional data transmission which means that either sending or
receiving of data will take place at a time. It provides flow-control mechanism but does not
provide any error control mechanism.
The idea behind the usage of this frame is that when the sender sends the frame then he waits
for the acknowledgment before sending the next frame.
Primitives of Stop and Wait Protocol
The primitives of stop and wait protocol are:
Sender side
Rule 1: Sender sends one data packet at a time.
Rule 2: Sender sends the next packet only when it receives the acknowledgment of the previous
packet.
Therefore, the idea of stop and wait protocol in the sender's side is very simple, i.e., send one
packet at a time, and do not send another packet before receiving the acknowledgment.
Receiver side
Rule 1: Receive and then consume the data packet.
Rule 2: When the data packet is consumed, receiver sends the acknowledgment to the sender.
Therefore, the idea of stop and wait protocol in the receiver's side is also very simple, i.e.,
consume the packet, and once the packet is consumed, the acknowledgment is sent. This is
known as a flow control mechanism.
Working of Stop and Wait protocol

The above figure shows the working of the stop and wait protocol. If there is a sender and
receiver, then sender sends the packet and that packet is known as a data packet. The sender
will not send the second packet without receiving the acknowledgment of the first packet. The
receiver sends the acknowledgment for the data packet that it has received. Once the
acknowledgment is received, the sender sends the next packet. This process continues until all
the packet are not sent. The main advantage of this protocol is its simplicity but it has some
disadvantages also. For example, if there are 1000 data packets to be sent, then all the 1000
packets cannot be sent at a time as in Stop and Wait protocol, one packet is sent at a time.
6(b). Describe about UDP Application.
User Datagram Protocol (UDP) is a Transport Layer protocol. UDP is a part of the Internet
Protocol suite, referred to as UDP/IP suite. Unlike TCP, it is an unreliable and
connectionless protocol. So, there is no need to establish a connection prior to data
transfer. The UDP helps to establish low-latency and loss-tolerating connections establish
over the network.The UDP enables process to process communication.
Though Transmission Control Protocol (TCP) is the dominant transport layer protocol used
with most of the Internet services; provides assured delivery, reliability, and much more but
all these services cost us additional overhead and latency. Here, UDP comes into the picture.
For real-time services like computer gaming, voice or video communication, live
conferences; we need UDP. Since high performance is needed, UDP permits packets to be
dropped instead of processing delayed packets. There is no error checking in UDP, so it also
saves bandwidth.
User Datagram Protocol (UDP) is more efficient in terms of both latency and bandwidth.
UDP Header –
UDP header is an 8-bytes fixed and simple header, while for TCP it may vary from 20 bytes
to 60 bytes. The first 8 Bytes contains all necessary header information and the remaining
part consist of data. UDP port number fields are each 16 bits long, therefore the range for port
numbers is defined from 0 to 65535; port number 0 is reserved. Port numbers help to
distinguish different user requests or processes.
1. Source Port: Source Port is a 2 Byte long field used to identify the port number of the
source.
2. Destination Port: It is a 2 Byte long field, used to identify the port of the destined
packet.
3. Length: Length is the length of UDP including the header and the data. It is a 16 -bits
field.
4. Checksum: Checksum is 2 Bytes long field. It is the 16-bit one’s complement of the
one’s complement sum of the UDP header, the pseudo-header of information from the
IP header, and the data, padded with zero octets at the end (if necessary) to make a
multiple of two octets.
Notes – Unlike TCP, the Checksum calculation is not mandatory in UDP. No Error control
or flow control is provided by UDP. Hence UDP depends on IP and ICMP for error
reporting. Also UDP provides port numbers so that is can differentiate between users
requests.
7(a). Describe about TCP Features.
Features of TCP/IP
Some of the most prominent features of Transmission control protocol are

1. Segment Numbering System
 TCP keeps track of the segments being transmitted or received by assigning numbers to
each and every single one of them.
 A specific Byte Number is assigned to data bytes that are to be transferred while segments
are assigned sequence numbers.
 Acknowledgment Numbers are assigned to received segments.
2. Connection Oriented
 It means sender and receiver are connected to each other till the completion of the process.
 The order of the data is maintained i.e. order remains same before and after transmission.
3. Full Duplex
 In TCP data can be transmitted from receiver to the sender or vice – versa at the same
time.
 It increases efficiency of data flow between sender and receiver.
4. Flow Control
 Flow control limits the rate at which a sender transfers data. This is done to ensure reliable
delivery.
 The receiver continually hints to the sender on how much data can be received (using a
sliding window)
5. Error Control
 TCP implements an error control mechanism for reliable data transfer
 Error control is byte-oriented
 Segments are checked for error detection
 Error Control includes – Corrupted Segment & Lost Segment Management, Out-of-order
segments, Duplicate segments, etc.
6. Congestion Control
 TCP takes into account the level of congestion in the network
 Congestion level is determined by the amount of data sent by a sender
7(b). Design piggy bagging in go-back N?
Piggybacking: A preferable solution would be to use each channel to transmit the frame
(front and back) both ways, with both channels having the same capacity. Assume that A and
B are users. Then the data frames from A to B are interconnected with the acknowledgment
from A to B. and can be identified as a data frame or acknowledgment by checking the sort
field in the header of the received frame.
One more improvement can be made. When a data frame arrives, the receiver waits and does
not send the control frame (acknowledgment) back immediately. The receiver waits until its
network layer moves to the next data packet.
Acknowledgment is associated with this outgoing data frame. Thus the acknowledgment
travels along with the next data frame. Working of PiggybackingWorking of Piggybacking
As we can see in the figure, we can see with piggybacking, a single message (ACK +
DATA) over the wire in place of two separate messages. Piggybacking improves the
efficiency of the bidirectional protocols.
 If Host A has both acknowledgment and data, which it wants to send, then the data frame
will be sent with the ack field which contains the sequence number of the frame.
 If Host A contains only one acknowledgment, then it will wait for some time, then in the
case, if it finds any data frame, it piggybacks the acknowledgment, otherwise, it will send
the ACK frame.
 If Host A left with only a data frame, then it will add the last acknowledgment to it. Host
A can send a data frame with an ack field containing no acknowledgment bit.
PART C
8(a). Explain in detail about IPV4 Datagram format.
IPv4 Datagram Header Size of the header is 20 to 60 bytes.
IPv4 Datagram Header
VERSION: Version of the IP protocol (4 bits), which is 4 for IPv4

HLEN: IP header length (4 bits), which is the number of 32 bit words in the header. The
minimum value for this field is 5 and the maximum is 15.
Type of service: Low Delay, High Throughput, Reliability (8 bits)
Total Length: Length of header + Data (16 bits), which has a minimum value 20 bytes and
the maximum is 65,535 bytes.
Identification: Unique Packet Id for identifying the group of fragments of a single IP
datagram (16 bits)
Flags: 3 flags of 1 bit each : reserved bit (must be zero), do not fragment flag, more
fragments flag (same order)
Fragment Offset: Represents the number of Data Bytes ahead of the particular fragment in
the particular Datagram. Specified in terms of number of 8 bytes, which has the maximum
value of 65,528 bytes.
Time to live: Datagram’s lifetime (8 bits), It prevents the datagram to loop through the
network by restricting the number of Hops taken by a Packet before delivering to the
Destination.
Protocol: Name of the protocol to which the data is to be passed (8 bits)
Header Checksum: 16 bits header checksum for checking errors in the datagram header
Source IP address: 32 bits IP address of the sender
Destination IP address: 32 bits IP address of the receiver
Option: Optional information such as source route, record route. Used by the Network
administrator to check whether a path is working or not.
8(b). Explain in detail about distance vector routing with neat diagram.
Distance Vector Algorithm –

1. A router transmits its distance vector to each of its neighbors in a routing packet.
2. Each router receives and saves the most recently received distance vector from each of
its neighbors.
3. A router recalculates its distance vector when:
 It receives a distance vector from a neighbor containing different information than
before.
 It discovers that a link to a neighbor has gone down.
The DV calculation is based on minimizing the cost to each destination
Dx(y) = Estimate of least cost from x to y
C(x,v) = Node x knows cost to each neighbor v
Dx = [Dx(y): y ? N ] = Node x maintains distance vector
Node x also maintains its neighbors' distance vectors
– For each neighbor v, x maintains Dv = [Dv(y): y ? N ]
Note –
 From time-to-time, each node sends its own distance vector estimate to neighbors.
 When a node x receives new DV estimate from any neighbor v, it saves v’s distance
vector and it updates its own DV using B-F equation:
 Dx(y) = min { C(x,v) + Dv(y), Dx(y) } for each node y ? N
Example – Consider 3-routers X, Y and Z as shown in figure. Each router have their
routing table. Every routing table will contain distance to the destination nodes.
Consider router X , X will share it routing table to neighbors and neighbors will share it
routing table to it to X and distance from node X to destination will be calculated using
bellmen- ford equation.
Dx(y) = min { C(x,v) + Dv(y)} for each node y ? N
As we can see that distance will be less going from X to Z when Y is intermediate
node(hop) so it will be update in routing table X.
Similarly for Z also –
Finally the routing table for all –
Advantages of Distance Vector routing –

 It is simpler to configure and maintain than link state routing.
Disadvantages of Distance Vector routing –
 It is slower to converge than link state.
 It is at risk from the count-to-infinity problem.
 It creates more traffic than link state since a hop count change must be
propagated to all routers and processed on each router. Hop count updates take
place on a periodic basis, even if there are no changes in the network topology,
so bandwidth-wasting broadcasts still occur.
 For larger networks, distance vector routing results in larger routing tables than
link state since each router must know about all other routers. This can also lead
to congestion on WAN links.
Note – Distance Vector routing uses UDP(User datagram protocol) for transportation.
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
QUESTION BANK
U20ECCJ09– COMPUTER COMMUNICATIONNETWORK
Bloom’s
Q.No Question Weightage CO
Level
UNIT 1 INTRODUCTION TO DATA COMMUNICATIONS
PART – A
1 Define computer Networks. 2 CO1 R
2 Define Simplex, Half-Duplex and Full-Duplex. 2 CO1 R
3 Why are protocols needed? 2 CO1 R
4 List out the advantages of star topology. 2 CO1 R
What are the components of Analog Communication
5 2 CO1 R
system.
6 Compare Analog and Digital Communication. 2 CO1 R
7 Define Data Communication. 2 CO1 R
8 How would you define and calculate Bandwidth? 2 CO1 R
9 Identify the need for MODEM in Data Communication 2 CO1 R
10 Define Bit Rate and Bit Length. 2 CO1 R
PART – B
What are the different types of networks? Explain in
1 4 CO1 U
detail.
Explain the different types of network topologies. Write 4
2 CO1 U
each of its advantages and disadvantages.
Explain the various network performance parameters in 4
3 CO1 U
detail.
4 Explain the types of transmission modes. 4 CO1 U
Explain the major component of a packet switch and their 4
5 CO1 R
functions.
6 Write short notes on Pulse Code Modulation (PCM). 4 CO1 U
7 Explain the different Data transmission modes. 4 CO1 U
Analyze the working techniques of Amplitude 4
8 CO1 R
Modulation.
Discuss the importance of the Non-Return-to-Zero (NRZ) 4
9 CO1 R
technique.
What are the following methods involved in the process 4
10 of Digital-to-analog conversion for Amplitude Shift CO1 U
Keying(ASK)
PART – C
Draw the OSI network architecture and explain the 12
1 CO1 U
functionalities of every layer in detail.
Explain in detail about TCP/IP protocol suite with neat 12
2 CO1 U
diagram?
Explain in detail about network dependent and network 12
3 CO1 U
independent layers of OSI reference model.
4 Classify the different Data Transmission Modes available 12 CO1 U
for transmission of data from one device to another.

Analyze the characteristics of Analog and Digital Signals 12
5 CO1 U
in detail.
Exemplify the use of PCM and DM Techniques for 12
6 CO1 U
converting Analog signals to Digital form.
Analyze the operation of Analog Communication System 12
7 CO1 U
and mention its merits and demerits.
Explain the Shielded twisted pair (STP) and Unshielded 12
8 CO1 U
twisted pair (UTP).
Interpret the major functions performed by the layers of 12
9 CO1 U
the ISO - OSI Reference model.
Interpret the Unipolar, Polar and Bipolar Line Coding 12
10 CO1 U
techniques with suitable examples.
UNIT 2 MULTIPLE ACCESS CONTROL

PART – A
1 What is CSMA? 2 CO2 R
2 Explain CSMA/CD 2 CO2 R
3 Mention some of the physical properties of Ethernet 2 CO2 R
4 What is the role of VCI? 2 CO2 R
5 What do you mean by error control? 2 CO2 R
6 What are the functions of bridges? 2 CO2 R
7 What is the size of Ethernet address? 2 CO2 R
8 What is the advantage of FDDI over a basic token ring? 2 CO2 R
9 List any two functions which a bridge cannot perform? 2 CO2 R
10 Mention the function of hub 2 CO2 R
PART – B
1 Explain the working of Aloha Protocol 4 CO2 U
Explain the working of carrier sense multiple access 4
2 CO2 U
protocol
3 How a Token Ring LAN does operate? Discuss 4 CO2 U
List and briefly discuss the two different basic 4
4 transmission technologies that can be used to set up CO2 U
wireless LAN’s
5 Explain the working of Slotted Aloha Protocol 4 CO2 R
6 Explain the working of Hubs 4 CO2 U
7 Explain the working of Switches 4 CO2 U
8 Explain the working of Ethernet 4 CO2 R
9 Explain the CSMA/CA protocol 4 CO2 R
10 Explain the Wireless LAN protocol 4 CO2 U
PART – C
1 Explain the CSMA/CD algorithms of Ethernet 12 CO2 U

Explain in details about the access method and frame 12

2 CO2 U
format used in Ethernet and token ring.
Name the four basic network topologies and explain 12
3 CO2 U
them giving all the relevant features
Explain the frame format, operation and ring 12
4 CO2 U
maintenance feature of IEEE 802.5 MAC protocol
5 Explain in details the types of bridges 12 CO2 U
6 Explain in detail about Aloha and Slotted Aloha protocol 12 CO2 U
Briefly discuss the two different basic transmission 12
7 CO2 U
technologies
8 Briefly discuss about IEEE 802 standard 12 CO2 U
9 Briefly discuss about LAN protocol 12 CO2 U
10 Briefly discuss about Network connecting devices 12 CO2 U
UNIT 3
WIRED A N D WIRELESS LANS
PART – A
What are the two sub layers of Data link Layer in
1 2 CO3 R
Ethernet?
2 Write the function of SFD. 2 CO3 R
3 What is NIC? 2 CO3 R
Bridge have some effects on Ethernet LAN, what are
4 2 CO3 R
they?
5 What is Full duplex Switched Ethernet? 2 CO3 R
6 What are the 3 types of station in IEEE 802.11? 2 CO3 R
7 Write the function of DCF. 2 CO3 R
8 What is ESS? 2 CO3 R
9 What is a beacon frame? 2 CO3 R
10 List out the types of spread spectrum? 2 CO3 R
PART – B
1 Explain the characteristics of Standard Ethernet. 4 CO3 U
2 Explain about Hidden station problem 4 CO3 U
3 Draw the neat sketch of Ethernet frame format. 4 CO3 U
Distinguish between Unicast, Multicast and Broadcast 4
4 CO3 U
transmission.
5 Explain the categories of frame in IEEE 802.11. 4 CO3 U
6 Write short notes on Exposed station problem. 4 CO3 U
7 Write short notes on Piconet with neat diagram 4 CO3 U
8 Write short notes on IEEE 802.11 FHSS. 4 CO3 U
9 Write about Scatternet in detail with diagram 4 CO3 U
10 List and explain the inter-frame spacing. 4 CO3 U
PART – C

1 Explain with neat sketch of Ethernet frame format. 12 CO3 U

2 Explain the Architecture of IEEE 80.11 with neat sketch. 12 CO3 U
Briefly discuss about Exposed and Hidden station 12
3 CO3 U
problem.
4 Explain the Architecture of Bluetooth with neat diagram. 12 CO3 U
Briefly discuss about MAC sub layers in IEEE 802.11 12
5 CO3 U
standard.
6 Explain MAC layer frame format of IEEE 802.11. 12 CO3 U
7 Discuss about IEEE802.11 FHSS and DSSS. 12 CO3 U
U
UNIT IVNETWORK LAYER PROTOCOLS

PART – A
List the difference between circuit switching and Packet
1 2 CO4 R
switching.
2 What are the different kinds of Multicast Routing? 2 CO4 R
3 Discuss the class field in IP address. 2 CO4 R
4 What is meant by circuit switching? 2 CO4 R
5 What is multicasting? 2 CO4 R
6 What is a hostid and netid? 2 CO4 R
7 How does a netid differ from a network address? 2 CO4 R
8 What is the purpose of subnetting? 2 CO4 R
9 Define Masking 2 CO4 R
What is the difference between boundary level masking
10 2 CO4 R
and non-boundary level masking.
PART – B
1 Explain in detail packet switching 4 CO4 U
2 Explain in detail about IPV4 4 CO4 U
3 Explain in detail Datagram network 4 CO4 U
4 Explain in detail about Slow start Mechanism 4 CO4 U
5 Explain briefly about NetId and hostId 4 CO4 U
6 Explain in detail Virtual circuit network 4 CO4 U
Explain in detail about Multiplicative increase 4
7 CO4 U
mechanism
8 Explain Broadcast routing with an example 4 CO4 U
Explain in detail about Multiplicative decrease 4
9 CO4 U
mechanism

10 Mention the limitations of link state routing algorithm 4 CO4 U

PART – C
Explain shortest path algorithm with a suitable 12
1 CO4 U
illustration.
2 Explain the distance vector routing algorithm 12 CO4 U
Mention the limitations of distance vector routing 12
3 CO4 U
algorithm
Explain the building and distribution of link state 12
4 CO4 U
packets in link state routing algorithm
Explain link state routing and discuss its advantages over 12
5 CO4 U
distance vector routing
6 Explain in detail packet switching 12 CO4 U
7 Explain in details Datagram approach 12 CO4 U
8 Explain in details IP addressing methods 12 CO4 U
9 Discuss about congestion control techniques 12 CO4 U
10 Explain in detail about Multicast Routing 12 CO4 U
UNIT VTRANSPORT LAYER

PART – A
What are the services provided by transport layer
1 2 CO5 R
protocol?
What is the difference between network service and
2 2 CO5 R
transport service?
List some of the Quality of service parameters of
3 2 CO5 R
transport layer
4 What are the functions of transport layers? 2 CO5 R
5 What is transport entity? 2 CO5 R
6 What is segmentation? 2 CO5 R
7 What is the purpose of sequence control? 2 CO5 R
8 How transport layer performs Duplication control? 2 CO5 R
What are the service primitives in simple transport
9 2 CO5 R
protocol?
10 What is the methods to improve QoS? 2 CO5 R
PART – B
1 Explain the services offered by Transport layer 4 CO5 U
2 Explain the services offered by UDP 4 CO5 U
3 Explain the services offered by TCP 4 CO5 U
4 Draw and explain UDP datagram 4 CO5 U
5 Draw and explain TCP header 4 CO5 R
Explain briefly about connection establishment in TCP 4
6 CO5 U
Connection

7 Discuss the various issues of transport layer in details 4 CO5 U

8 Explain briefly about Data Transfer in TCP Connection 4 CO5 R
9 Discuss about congestion control 4 CO5 R
Explain briefly about Connection Termination in TCP 4
10 CO5 U
Connection
PART – C
1 Explain a congestion control algorithm. 12 CO5 U
2 Explain the duties of Transport layer 12 CO5 U
3 Explain the TCP transmission policy, Congestion control 12 CO5 U
4 Explain the TCP header and working of the TCP protocol 12 CO5 U
Explain the various fields of TCP header with the help of 12
5 CO5 U
a neat diagram
Explain the various steps that are followed in releasing a 12
6 CO5 U
TCP connection
Explain the three way handshake protocol to establish 12
7 CO5 U
the transport level connection
8 Discuss about congestion control in frame relay 12 CO5 U
9 Discuss the various issues of transport layer in details 12 CO5 U
10 Discuss the techniques to improve QoS 12 CO5 U

2/8/24, 12:00 PM Camu - Your Campus
Bharath Institute of Science and Technology (CBCS) - BIHER
Attendance Summary Subjectwise %

17-Mar-2023 To 30-Jun-2023 | B.Tech | B.Tech-Electronics and Communication Engineering |
2022-2023 | School of Electrical Sciences | EVEN | B | VANITHAMANI P | U20ECCJ09 -
Computer Communication Networks
Student attendance percentage (%) ( No. of period attended by the student for the month (A) / No. of period attendance taken for the month (T) ).
U20ECCJ09
Overall
Roll No. Student Name (65)
Total no. of periods
(65)
% (A/T) % (A/T)
U20EC072 KONERU LIKHITH 91 (53/58) 91 (53/58)

U20EC074 KOTTE SRINIVASA RAO 69 (40/58) 69 (40/58)
U20EC075 KUNCHAPU ARUNA 83 (48/58) 83 (48/58)

U20EC076 LAGA GOPICHAND 67 (39/58) 67 (39/58)
U20EC077 LAKKAKULA BHARATH 91 (58/64) 91 (58/64)
U20EC078 LAKSHMISETTY 98 (57/58) 98 (57/58)
NARESH
U20EC079 LANKA MANICHANDRA 100 (58/58) 100 (58/58)
U20EC080 LAVANUR 76 (44/58) 76 (44/58)
DHARANISWARA
REDDY
U20EC081 LINGALA SIVA 88 (51/58) 88 (51/58)
SHANKAR
U20EC082 LINGA REDDY MUKESH 86 (50/58) 86 (50/58)
REDDY
U20EC083 LOKA VIVEK REDDY 86 (50/58) 86 (50/58)
U20EC084 MADANALA KARTHIK 81 (47/58) 81 (47/58)
U20EC085 MADU VENKATA 76 (44/58) 76 (44/58)
PAVANSAI
U20EC086 MANAMASI ANIL 79 (46/58) 79 (46/58)
U20EC087 MANAMASI 86 (50/58) 86 (50/58)
JAGADEESH
U20EC088 MANCHALA ASHOK 79 (46/58) 79 (46/58)
KUMAR REDDY
U20EC089 MANDATI YASWANTH 84 (49/58) 84 (49/58)
U20EC091 A MANIDEEP 88 (51/58) 88 (51/58)
U20EC092 MANNALA DEVENDRA 78 (45/58) 78 (45/58)
VARAPRASAD
U20EC093 MARELLA VISHNU 74 (43/58) 74 (43/58)
U20EC094 MARKA SIDDU 67 (39/58) 67 (39/58)
U20EC095 MIDDE 89 (17/19) 89 (17/19)
VENKATESWARARAO
U20EC096 MOLAKA SRI 76 (44/58) 76 (44/58)
RAVEENDRA
U20EC097 MORUSU JITHENDRA 84 (49/58) 84 (49/58)
U20EC098 MOTHUKURI CHARAN 76 (44/58) 76 (44/58)
SANKAR
U20EC099 MOVVA SWECHHA 83 (48/58) 83 (48/58)
BHAVANI
U20EC100 MUMMA REDDY 83 (48/58) 83 (48/58)
THARUN TEJA
U20EC101 MYLA RAMU 78 (43/55) 78 (43/55)
U20EC102 NAGABHAIRU 97 (63/65) 97 (63/65)
VENKATAPAVANKUMAR
U20EC103 NAGOTHI THRISHA 95 (62/65) 95 (62/65)

Printed By Printed On 08-Feb-2024
umamaheshwari.ece+cbcs@bharath
univ.ac.in
https://camu.in/index#/stusubjattper 1/3
U20ECCJ09
Overall
(65)
% (A/T) % (A/T)
U20EC104 NAGULAPALLY DINESH 76 (44/58) 76 (44/58)
U20EC105 NAKIRTHA AKSHAY 69 (40/58) 69 (40/58)

U20EC106 NALLAPATI AKHIL 94 (61/65) 94 (61/65)
U20EC107 NANDIKONDA SRINIVAS 88 (57/65) 88 (57/65)
REDDY
U20EC108 NANNURI SISINDRI 88 (57/65) 88 (57/65)
U20EC109 NAVEEN K 82 (53/65) 82 (53/65)
U20EC110 NEERATI VIVEKANANDA 69 (40/58) 69 (40/58)
U20EC111 NELLURI SAI YAGNESH 94 (61/65) 94 (61/65)
U20EC112 NUNE SHIVATEJA 84 (49/58) 84 (49/58)

U20EC113 NUVVALA SHIVANI 89 (58/65) 89 (58/65)
U20EC114 PAPINENI SAI GOPI 100 (65/65) 100 (65/65)
U20EC115 PARIMI SUNIL 90 (18/20) 90 (18/20)
U20EC116 PASUPULETI GANESH 83 (48/58) 83 (48/58)
U20EC117 PATAN MOHAMMAD 79 (46/58) 79 (46/58)
SHAHID
U20EC118 PATHURI KARTHIK 72 (47/65) 72 (47/65)
U20EC119 PATNANA KISHORE 76 (44/58) 76 (44/58)
KUMAR
U20EC120 PEECHU DEEPAK 74 (43/58) 74 (43/58)
REDDY
U20EC121 PEETLA SURENDRA 84 (49/58) 84 (49/58)
U20EC122 PENTYALA RANJITH 72 (42/58) 72 (42/58)
U20EC123 PIKKILI 71 (17/24) 71 (17/24)
VENKATARAMANA
U20EC125 POTUNURU 78 (45/58) 78 (45/58)
SASIKUMAR
U20EC126 PULLALAREVU 84 (49/58) 84 (49/58)
VISHNUVARDHAN
REDDY
U20EC127 PUSAPATI 66 (38/58) 66 (38/58)
GOVARDHANACHARI
U20EC128 RAKESH Y 81 (47/58) 81 (47/58)
U20EC129 RAMIREDDY 78 (45/58) 78 (45/58)
NARENDRA REDDY
U20EC130 RANGISHETTI GANESH 67 (39/58) 67 (39/58)
U20EC131 REGULA NAGARAJU 76 (44/58) 76 (44/58)

U20EC132 SAMMIDI SAI VINAY 92 (54/59) 92 (54/59)
REDDY
U20EC133 SANDIREDDY VENKATA 85 (17/20) 85 (17/20)
SAI
U20EC134 SANNAMURI MADHURI 98 (57/58) 98 (57/58)
U20EC135 SARNALA UMAPAVAN 79 (46/58) 79 (46/58)
U20EC136 SEELAM LIKITH REDDY 79 (46/58) 79 (46/58)
U20EC137 SETTIPALLI 84 (49/58) 84 (49/58)

VENKATACHARANKUMA
R REDDY
U20EC138 SHAIK ASHRAF 84 (49/58) 84 (49/58)
U20EC139 SHAIK JANPASHA 93 (54/58) 93 (54/58)
U20EC140 SHAIK CHAND PASHA 90 (52/58) 90 (52/58)
univ.ac.in
U20ECCJ09
Overall
(65)
% (A/T) % (A/T)
U20EC141 SHAIK MASTAN BASHA 71 (41/58) 71 (41/58)

univ.ac.in
FEEDBACK ANALYSIS (2022-23 EVEN SEMESTER)
FACULTYWISE SUMMARY
Faculty Name Ms.P. VANITHAMANI, Asst. Prof /ECE

Class and Section III / B
Number of Students 68
No. of Students preferred to study again 18
U20ECCJ09 COMPUTER COMMUNICATION NETWORKS/ SECTION B
5 4.9
4.8 4.8 4.8 4.8 4.8 4.8 4.8
4.8 4.7
4.6
4.6
4.4
1 2 3 4 5 6 7 8 9 10
SCHOOL OF ELECTRICAL ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING , SEMESTER V, Batch- 2020
CONTINUOUS LEARNING ASSESSMENT - I MARK ANALYSIS - U20ECCT09 -COMPUTER COMMUNICATION NETWORKS
Q.No 1 2 3 4 5 6 7 8
DESCRIPTIVE
CO 1 1 1 1 2 2 2 1
Blooms Level 2 2 2 2 2 2 2 2
S.No MAX MARKS
2 2 2 2 2 4 4 12
REG. NO
1 U20EC001 1 2 2 2 2 4 4 10
2 U20EC002 0 2 0 0 2 3 3 10
3 U20EC003 0 0 0 0 1 3 2 10
4 U20EC004 0 0 0 0 0 3 2 11
5 U20EC005 0 0 0 0 0 4 4 11
6 U20EC006 0 0 0 0 0 4 4 11
7 U20EC007 0 0 0 0 0 4 4 10
8 U20EC008 0 0 0 0 0 4 4 11
9 U20EC009 0 0 2 0 0 3 3 9
10 U20EC010 0 2 2 0 0 3 3 10
11 U20EC011 0 2 2 0 2 4 3 11
12 U20EC013 0 2 2 0 2 3 3 9
13 U20EC014 0 2 2 0 2 3 3 9
14 U20EC015 0 2 2 0 2 1 3 10
15 U20EC016 0 2 2 0 2 4 4 9
16 U20EC017 0 2 2 0 2 3 2 11
17 U20EC019 0 2 2 0 2 4 4 9
18 U20EC020 0 2 2 0 1 2 2 8
19 U20EC021 0 2 2 0 1 3 3 9
20 U20EC022 0 2 1 0 1 3 3 7
21 U20EC023 0 0 1 0 1 3 3 7
22 U20EC024 0 0 1 0 1 3 3 9
23 U20EC025 0 0 1 0 1 3 4 11
24 U20EC026 2 0 2 0 1 3 3 9
25 U20EC027 2 0 1 0 2 4 4 11
26 U20EC028 2 0 2 0 2 3 4 11
27 U20EC029 2 2 2 0 2 2 2 10
28 U20EC030 2 2 2 0 2 4 4 10
29 U20EC032 1 1 0 0 1 3 3 10
30 U20EC033 1 1 0 0 2 2 3 10
31 U20EC035 1 1 0 0 2 2 2 10
32 U20EC036 2 2 0 0 1 2 2 11
33 U20EC037 2 2 0 0 2 4 4 11
34 U20EC038 2 1 0 1 2 4 4 11
35 U20EC039 1 1 0 1 1 4 4 11
36 U20EC040 2 1 0 2 2 3 3 9
37 U20EC041 1 1 0 2 2 4 4 11
38 U20EC042 1 1 0 1 2 1 1 11
39 U20EC043 2 2 0 2 2 4 4 10
40 U20EC044 1 1 0 1 1 2 3 10
41 U20EC045 2 2 0 2 2 2 2 11
42 U20EC046 2 2 0 2 2 2 3 8
43 U20EC047 2 2 0 2 1 2 2 9
44 U20EC048 1 1 0 2 2 3 2 10
45 U20EC049 1 1 0 1 1 4 3 10
46 U20EC050 2 1 0 1 1 3 3 9
47 U20EC052 1 1 0 1 1 2 2 11
48 U20EC053 2 2 0 1 2 2 2 11
49 U20EC054 2 1 0 1 1 3 4 11
50 U20EC055 2 2 0 2 2 4 2 7
51 U20EC056 2 2 0 2 2 2 4 11
52 U20EC057 2 2 0 2 2 2 1 11
53 U20EC058 2 2 0 2 1 2 2 7
54 U20EC059 2 2 0 1 1 3 3 10
55 U20EC060 1 1 0 2 2 4 4 11
56 U20EC061 2 2 0 2 2 3 3 10
57 U20EC062 1 1 0 1 1 2 1 7
58 U20EC064 1 1 0 2 2 4 4 11
59 U20EC065 2 2 0 2 1 4 3 11
60 U20EC066 2 2 2 2 2 3 2 11
61 U20EC067 2 2 2 2 2 4 4 11
62 U20EC068 1 1 1 1 1 1 3 8
63 U20EC069 0 0 1 1 1 2 2 8
64 U20EC070 1 2 2 2 2 4 4 10
65 U20EC071 1 1 1 2 2 3 3 10
66 U20EC072 2 2 1 1 1 3 2 10
67 U20EC074 2 2 2 2 2 3 2 11
68 U20EC075 2 2 2 2 2 4 4 11
69 U20EC076 1 2 1 1 1 4 4 11
70 U20EC077 2 2 2 1 1 4 4 10
71 U20EC078 2 1 1 1 2 4 4 11
72 U20EC079 2 2 1 1 1 3 3 9
73 U20EC080 2 2 2 1 2 3 3 10
74 U20EC081 2 2 2 2 2 4 3 11
75 U20EC082 2 2 1 2 2 3 3 9
76 U20EC083 1 1 2 2 2 3 3 9
77 U20EC084 2 2 2 2 2 1 3 10
78 U20EC085 2 2 2 2 2 4 4 9
79 U20EC086 2 2 2 2 2 3 2 11
80 U20EC087 2 2 2 2 2 4 4 9
81 U20EC088 2 2 2 2 2 4 4 7
82 U20EC089 2 2 2 2 2 4 4 8
83 U20EC091 2 2 2 2 2 4 4 12
84 U20EC092 2 2 2 2 2 3 3 8
85 U20EC093 2 2 2 2 1 3 3 10
86 U20EC094 1 1 1 1 2 3 3 11
87 U20EC095 2 2 2 2 1 3 3 9
88 U20EC096 2 2 2 1 1 3 4 9
89 U20EC097 2 2 2 2 1 3 3 10
90 U20EC098 2 2 2 2 1 4 3 10
91 U20EC099 2 1 1 1 2 4 4 11
92 U20EC100 1 1 1 2 1 4 4 11
93 U20EC101 2 2 2 1 1 3 3 10
94 U20EC102 2 2 2 2 2 4 4 11
95 U20EC103 2 2 2 2 2 4 4 12
96 U20EC104 2 2 2 1 1 3 3 9
97 U20EC105 1 1 1 2 2 3 3 11
98 U20EC106 2 2 2 2 2 4 4 12
99 U20EC107 2 2 2 2 2 4 4 10
100 U20EC108 2 2 2 2 2 4 4 12
101 U20EC109 2 2 2 2 2 4 4 12
102 U20EC110 2 2 2 2 1 3 3 7
103 U20EC111 2 2 2 2 1 2 1 10
104 U20EC112 2 2 2 2 2 4 4 12
105 U20EC113 2 2 2 2 2 4 4 12
106 U20EC114 2 2 2 2 2 4 4 12
107 U20EC115 2 2 2 2 2 4 4 8
108 U20EC116 2 1 1 1 1 3 3 10
109 U20EC117 2 2 2 2 1 3 3 11
110 U20EC118 1 1 1 1 2 4 4 11
111 U20EC119 2 2 2 2 2 4 3 9
112 U20EC120 2 2 2 2 2 3 3 11
113 U20EC121 1 1 1 1 1 4 4 11
114 U20EC122 2 2 2 1 2 3 3 10
115 U20EC123 2 2 1 1 1 3 2 11
116 U20EC125 2 2 2 2 1 3 3 10
117 U20EC126 2 1 1 1 2 4 4 11
118 U20EC127 1 1 1 1 1 3 3 11
119 U20EC128 2 2 2 2 2 3 3 10
120 U20EC129 2 2 2 2 2 3 3 10
121 U20EC130 2 2 2 2 2 3 3 10
122 U20EC131 2 1 1 1 2 2 4 9
123 U20EC132 2 2 2 2 2 4 4 12
124 U20EC133 2 2 2 1 1 3 3 8
125 U20EC134 2 2 2 2 2 4 4 12
126 U20EC135 2 2 1 1 2 2 2 10
127 U20EC136 2 1 1 1 1 4 3 9
128 U20EC137 2 2 2 2 2 4 4 10
129 U20EC138 2 2 2 2 2 4 4 10
130 U20EC139 2 2 2 2 2 4 3 9
131 U20EC140 2 2 2 2 2 3 3 11
132 U20EC141 2 2 2 2 2 3 3 11
133 U20EC142 2 2 2 2 1 3 3 11
134 U20EC143 2 2 2 2 2 3 3 10
135 U20EC144 2 2 2 2 2 4 4 12
136 U20EC145 2 2 2 2 2 4 4 12
137 U20EC146 2 2 2 2 2 4 4 12
138 U20EC147 2 2 2 2 2 4 4 12
139 U20EC148 2 2 2 2 2 3 3 10
140 U20EC149 2 2 2 2 1 3 3 11
141 U20EC150 2 2 2 2 2 3 3 10
142 U20EC151 2 2 2 2 2 4 4 12
143 U20EC152 2 2 2 2 2 4 4 12
144 U20EC153 2 2 2 2 2 4 3 9
145 U20EC154 2 2 2 2 1 3 3 11
146 U20EC156 2 2 2 2 2 4 4 12
147 U20EC158 2 2 2 2 2 4 4 10
148 U20EC159 2 2 2 2 2 4 4 10
149 U20EC160 2 2 2 2 2 4 4 10
150 U20EC161 2 2 2 2 2 4 4 12
151 U20EC162 2 2 2 2 2 4 4 12
152 U20EC163 2 2 2 2 2 4 4 12
153 U20EC165 2 2 2 2 2 4 4 12
154 U20EC168 2 2 2 2 2 4 4 12
155 U20EC169 2 2 2 2 2 4 4 12
156 U20EC170 2 2 2 2 1 3 3 9
157 U20EC171 2 2 2 2 1 3 3 9
158 U20EC172 2 2 2 2 1 3 3 9
159 U20EC173 2 2 2 2 2 4 4 12
160 U20EC174 2 2 2 2 2 4 4 10
161 U20EC175 1 1 1 1 1 4 4 11
162 U20EC176 1 1 1 1 1 3 3 11
163 U20EC178 2 2 2 2 2 4 4 12
164 U20EC179 2 2 2 2 2 4 4 12
165 U20EC180 2 2 2 2 2 4 4 12
166 U20EC181 2 2 2 2 2 4 4 12
167 U20EC182 2 2 2 2 2 4 4 12
168 U20EC183 2 2 1 1 1 2 2 9
169 U20EC184 2 2 2 2 2 4 4 10
170 U20EC185 2 2 2 2 2 4 4 12
171 U20EC701 2 2 2 2 2 4 4 12
172 U20EC702 2 1 1 1 1 3 3 10
173 U20EC703 1 1 1 1 1 4 4 11
174 U20EC704 2 2 2 2 1 3 3 7
175 U20EC705 2 2 2 2 2 4 4 12
176 U20EC706 2 2 2 2 2 4 4 10
177 U20EC707 2 2 2 2 2 4 4 10
178 U20EC708 2 2 2 2 2 4 4 8
179 U20EC709 2 2 2 2 2 4 4 10
180 U20EC710 2 2 2 2 2 4 4 10
181 U20EC711 2 2 2 2 2 4 4 10
182 U20EC712 1 1 1 1 1 3 4 11
183 U20EC713 2 2 2 2 2 4 4 12
184 U20EC714 2 2 2 2 1 4 4 10
185 U20EC715 2 2 2 2 2 3 2 11
186 U20EC716 2 2 1 1 1 4 4 11
187 U20EC717 2 1 2 2 2 4 4 11
188 U20EC718 2 2 2 2 2 4 4 11
189 U20EC719 2 1 2 2 2 4 4 11
190 U20EC721 2 1 2 2 2 4 4 11
191 U20EC722 2 2 2 2 2 4 4 11
192 U20EC723 2 2 2 2 2 4 4 12
193 U20EC724 2 2 2 2 2 4 4 12
194 U20EC725 2 2 2 2 2 4 4 12
195 U20EC726 2 1 1 1 1 3 3 10
196 U20EC727 1 1 1 1 1 4 4 11
197 U20EC728 2 2 2 2 1 3 3 7
198 U20EC729 2 2 2 2 2 4 4 12
199 U20EC730 2 2 2 2 2 4 4 10
200 U20EC731 2 2 2 2 2 4 4 10
201 U20EC732 2 2 2 2 2 4 4 8
202 U20EC733 2 2 2 2 2 4 4 10
203 U20EC734 2 2 2 2 2 4 4 10
204 U20EC735 2 2 2 2 2 4 4 10
205 U20EC736 1 1 1 1 1 3 4 11
Attempts 205 205 205 205 205 205 205 205

Scores above 50% 182 191 167 173 198 201 201 205
attainment 0.8879 0.9318 0.8147 0.844 0.9659 0.9805 0.9805 1
CONTINUOUS LEARNING ASSESSMENT - II MARK ANALYSIS - U20ECCT09 -COMPUTER COMMUNICATION NETWORKS
Q.No 1 2 3 4 5 6 7 8
DESCRIPTIVE
CO 2 3 3 3 3 2 2 3
Blooms Level 2 2 2 2 2 2 2 2
MAX MARKS
S.No
2 2 2 2 2 4 4 12
REG.NO.
1 U20EC001 2 1 0 1 1 4 4 11
2 U20EC002 2 2 2 2 1 3 4 7
3 U20EC003 2 2 2 2 2 2 4 12
4 U20EC004 2 2 2 2 2 2 4 10
5 U20EC005 2 2 2 2 2 2 4 10
6 U20EC006 2 2 2 2 2 4 4 10
7 U20EC007 2 2 2 2 2 4 4 10
8 U20EC008 2 2 2 2 2 4 4 10
9 U20EC009 2 2 2 2 2 4 4 10
10 U20EC010 0 1 2 2 2 4 4 10
11 U20EC011 0 2 2 2 2 4 4 10
12 U20EC013 0 2 2 2 2 4 4 10
13 U20EC014 0 2 2 2 2 4 4 10
14 U20EC015 0 2 2 2 2 4 4 10
15 U20EC016 0 1 2 2 2 4 2 10
16 U20EC017 0 2 2 2 2 4 2 10
17 U20EC019 0 1 2 2 2 4 2 10
18 U20EC020 0 1 2 2 2 4 2 10
19 U20EC021 0 2 2 2 2 4 4 10
20 U20EC022 0 2 2 2 2 4 4 10
21 U20EC023 0 2 2 2 2 4 4 10
22 U20EC024 0 2 2 2 2 4 4 10
23 U20EC025 0 1 2 2 2 4 3 10
24 U20EC026 0 1 2 2 2 4 0 10
25 U20EC027 0 2 2 2 2 4 0 10
26 U20EC028 0 2 2 2 2 4 0 10
27 U20EC029 0 2 2 2 2 4 0 10
28 U20EC030 0 2 2 2 2 4 0 10
29 U20EC032 0 2 2 2 2 4 0 10
30 U20EC033 0 2 2 2 2 4 0 10
31 U20EC035 0 2 2 2 2 4 0 10
32 U20EC036 0 2 2 0 2 4 0 10
33 U20EC037 0 1 2 0 2 3 0 10
34 U20EC038 0 1 2 0 2 4 0 10
35 U20EC039 0 1 2 0 2 4 0 10
36 U20EC040 0 1 2 0 2 3 0 10
37 U20EC041 0 1 2 0 2 4 0 10
38 U20EC042 0 1 2 0 2 1 0 10
39 U20EC043 0 2 2 0 2 4 0 10
40 U20EC044 0 1 2 0 2 2 0 10
41 U20EC045 0 2 2 0 2 2 0 10
42 U20EC046 0 2 2 0 2 2 0 10
43 U20EC047 0 2 2 0 2 2 0 10
44 U20EC048 0 1 2 0 2 3 0 10
45 U20EC049 0 1 2 0 2 4 0 10
46 U20EC050 0 1 2 0 2 4 0 10
47 U20EC052 0 1 2 0 2 4 0 10
48 U20EC053 0 2 2 0 2 4 0 10
49 U20EC054 0 1 2 0 2 4 0 10
50 U20EC055 0 2 2 0 2 4 2 10
51 U20EC056 0 2 2 0 2 4 4 10
52 U20EC057 0 2 2 0 2 4 1 10
53 U20EC058 0 2 2 0 2 4 2 10
54 U20EC059 0 2 2 0 2 2 3 10
55 U20EC060 0 1 2 0 2 0 4 10
56 U20EC061 0 2 2 0 2 0 3 10
57 U20EC062 0 1 2 0 2 0 1 10
58 U20EC064 0 1 2 0 2 0 4 10
59 U20EC065 0 2 2 0 2 0 3 10
60 U20EC066 0 2 2 0 2 0 2 10
61 U20EC067 0 2 2 0 2 0 4 10
62 U20EC068 0 1 2 0 1 0 3 10
63 U20EC069 0 0 2 1 1 1 2 10
64 U20EC070 0 2 2 0 2 1 4 10
65 U20EC071 0 1 2 0 2 1 3 10
66 U20EC072 0 2 2 0 1 1 2 10
67 U20EC074 0 2 2 0 2 1 2 10
68 U20EC075 0 2 2 0 2 1 4 10
69 U20EC076 0 2 2 0 1 1 4 10
70 U20EC077 0 2 2 0 1 1 4 10
71 U20EC078 0 1 2 0 2 4 4 11
72 U20EC079 0 2 2 0 1 3 3 11
73 U20EC080 0 2 2 0 2 3 3 11
74 U20EC081 0 2 2 0 2 4 3 11
75 U20EC082 0 2 2 0 2 3 3 11
76 U20EC083 0 1 2 0 2 3 3 11
77 U20EC084 0 2 2 0 2 4 3 11
78 U20EC085 0 2 2 0 2 4 4 11
79 U20EC086 0 2 2 0 2 3 2 11
80 U20EC087 0 2 2 0 2 4 4 11
81 U20EC088 0 2 2 0 2 4 4 11
82 U20EC089 0 2 2 0 2 4 4 11
83 U20EC091 0 2 2 0 2 4 4 11
84 U20EC092 0 2 2 0 2 3 3 11
85 U20EC093 0 2 2 0 1 3 3 11
86 U20EC094 0 1 2 0 2 3 3 11
87 U20EC095 0 2 2 0 1 2 2 11
88 U20EC096 0 2 2 0 2 2 4 11
89 U20EC097 0 1 2 0 2 2 4 11
90 U20EC098 0 1 2 1 1 2 4 11
91 U20EC099 0 1 2 2 2 2 3 11
92 U20EC100 0 1 2 2 0 2 4 11
93 U20EC101 0 1 2 1 2 2 4 11
94 U20EC102 0 2 2 2 2 2 4 11
95 U20EC103 0 1 2 1 1 2 3 11
96 U20EC104 0 2 2 2 2 2 2 11
97 U20EC105 0 2 2 2 2 2 3 11
98 U20EC106 0 2 2 2 1 2 2 11
99 U20EC107 0 1 2 2 2 2 2 11
100 U20EC108 0 1 2 1 1 2 3 11
101 U20EC109 0 1 2 1 1 2 3 11
102 U20EC110 0 1 2 1 1 2 2 11
103 U20EC111 0 2 2 1 2 2 2 11
104 U20EC112 0 1 2 1 1 2 4 11
105 U20EC113 0 2 2 2 2 2 2 11
106 U20EC114 0 2 2 2 2 2 4 11
107 U20EC115 0 2 2 2 2 2 1 11
108 U20EC116 0 2 2 2 1 2 2 11
109 U20EC117 0 2 2 1 1 2 3 11
110 U20EC118 0 1 2 2 2 2 4 11
111 U20EC119 0 2 2 2 2 3 3 11
112 U20EC120 0 1 2 1 1 2 1 11
113 U20EC121 0 1 2 2 2 4 4 11
114 U20EC122 0 2 2 2 1 4 3 11
115 U20EC123 0 2 2 2 2 3 2 11
116 U20EC125 0 2 2 2 2 4 4 11
117 U20EC126 1 1 2 1 1 1 3 11
118 U20EC127 0 0 2 1 1 2 2 11
119 U20EC128 1 2 2 2 2 4 4 11
120 U20EC129 1 1 2 2 2 3 3 11
121 U20EC130 1 2 2 2 2 3 3 11
122 U20EC131 1 1 2 1 2 2 4 11
123 U20EC132 1 2 2 2 2 4 4 11
124 U20EC133 1 2 2 1 1 3 3 11
125 U20EC134 1 2 2 2 2 4 4 11
126 U20EC135 1 2 2 1 2 2 2 10
127 U20EC136 1 1 2 1 1 4 3 9
128 U20EC137 0 2 2 2 2 4 2 10
129 U20EC138 0 2 2 2 2 4 4 10
130 U20EC139 0 2 2 2 2 4 3 9
131 U20EC140 0 2 2 2 2 3 3 11
132 U20EC141 0 2 2 2 2 3 3 11
133 U20EC142 0 2 2 2 1 3 3 11
134 U20EC143 0 2 2 2 2 3 3 10
135 U20EC144 0 2 2 2 2 4 4 12
136 U20EC145 0 2 2 2 2 4 4 12
137 U20EC146 0 2 2 2 2 4 4 12
138 U20EC147 0 2 2 2 2 4 4 12
139 U20EC148 0 2 2 2 2 3 3 10
140 U20EC149 0 2 2 2 1 3 3 11
141 U20EC150 0 2 2 2 2 3 3 10
142 U20EC151 0 2 2 2 2 4 4 12
143 U20EC152 0 2 2 2 2 4 4 12
144 U20EC153 0 2 2 2 2 4 3 9
145 U20EC154 0 2 2 2 1 3 3 11
146 U20EC156 0 2 2 2 2 4 4 12
147 U20EC158 0 2 2 2 2 4 4 10
148 U20EC159 0 2 2 2 2 4 4 10
149 U20EC160 0 2 2 2 2 4 4 10
150 U20EC161 0 2 2 2 2 4 4 12
151 U20EC162 0 2 2 0 2 4 4 12
152 U20EC163 0 2 2 0 2 4 4 12
153 U20EC165 0 2 2 0 2 4 4 12
154 U20EC168 0 2 2 0 2 4 4 12
155 U20EC169 0 2 2 0 2 4 4 12
156 U20EC170 0 2 2 0 1 3 3 9
157 U20EC171 0 2 2 0 1 3 3 9
158 U20EC172 0 2 2 0 1 3 3 9
159 U20EC173 0 2 2 0 2 4 4 12
160 U20EC174 0 2 2 0 2 4 4 10
161 U20EC175 0 1 1 0 1 4 4 11
162 U20EC176 0 1 1 0 1 3 3 11
163 U20EC178 0 2 2 0 2 4 4 12
164 U20EC179 0 2 2 0 2 4 4 12
165 U20EC180 0 2 2 0 2 4 4 12
166 U20EC181 0 2 2 0 2 4 4 12
167 U20EC182 0 2 2 0 2 4 4 12
168 U20EC183 0 2 1 0 1 2 2 9
169 U20EC184 0 2 2 0 2 4 4 10
170 U20EC185 0 2 2 0 2 4 4 12
171 U20EC701 0 2 2 2 2 4 4 12
172 U20EC702 0 1 1 1 1 3 3 10
173 U20EC703 0 1 1 1 1 4 4 11
174 U20EC704 0 0 2 2 1 3 3 7
175 U20EC705 0 0 2 0 2 4 4 12
176 U20EC706 0 0 2 0 2 4 4 10
177 U20EC707 0 0 2 0 2 4 4 10
178 U20EC708 0 0 2 0 2 4 4 8
179 U20EC709 0 0 2 0 2 4 4 10
180 U20EC710 0 0 2 0 2 4 4 10
181 U20EC711 0 0 2 0 2 4 4 10
182 U20EC712 0 0 1 0 1 3 4 11
183 U20EC713 0 0 2 0 2 4 4 12
184 U20EC714 0 0 2 0 1 4 4 10
185 U20EC715 0 0 2 0 2 3 2 11
186 U20EC716 1 0 1 0 1 4 4 11
187 U20EC717 1 0 2 0 2 4 4 11
188 U20EC718 1 0 2 0 2 4 4 11
189 U20EC719 1 0 2 0 2 4 4 11
190 U20EC721 1 1 2 0 2 4 4 11
191 U20EC722 1 2 2 2 2 4 4 11
192 U20EC723 1 2 2 2 2 4 4 12
193 U20EC724 1 2 2 2 2 4 4 12
194 U20EC725 1 2 2 2 2 4 4 12
195 U20EC726 1 1 1 1 1 3 3 10
196 U20EC727 1 1 1 1 1 4 4 11
197 U20EC728 2 2 2 2 1 3 3 7
198 U20EC729 0 2 2 2 2 4 4 12
199 U20EC730 0 2 2 2 2 4 4 10
200 U20EC731 0 2 2 2 2 4 4 10
201 U20EC732 0 2 2 2 2 4 4 8
202 U20EC733 0 2 2 2 2 4 4 10
203 U20EC734 0 2 2 2 2 4 4 10
204 U20EC735 0 2 2 2 2 4 4 10
205 U20EC736 0 1 1 1 1 3 4 11
Attempts 205 205 205 205 205 205 205 205

Scores above 50% 31 187 204 112 204 187 175 205
attainment 0.1513 0.9122 0.9952 0.5464 0.9952 0.9122 0.8537 1
CONTINUOUS LEARNING ASSESSMENT - III MARK ANALYSIS - U20ECCT09 -COMPUTER COMMUNICATION NETWORKS
Q.No 1 2 3 4 5 6 7 8
DESCRIPTIVE
CO 4 4 5 5 5 5 5 4
Blooms Level 2 2 2 2 2 2 2 3
MAX MARKS
S.No
2 2 2 2 2 4 4 12
REG.NO.
1 U20EC001 1 1 2 2 2 3 3 7
2 U20EC002 0 2 0 0 0 3 3 8
3 U20EC003 0 2 0 0 0 3 2 7
4 U20EC004 0 2 0 0 0 2 2 8
5 U20EC005 0 2 0 0 0 4 4 8
6 U20EC006 0 2 0 0 0 4 4 8
7 U20EC007 0 2 0 0 0 3 2 8
8 U20EC008 0 0 0 0 0 4 2 8
9 U20EC009 0 0 0 0 0 3 2 8
10 U20EC010 0 0 0 0 2 3 2 7
11 U20EC011 0 0 0 0 2 4 2 8
12 U20EC013 0 0 0 2 2 3 2 8
13 U20EC014 0 0 0 0 2 3 2 8
14 U20EC015 0 0 0 0 2 1 2 8
15 U20EC016 0 0 0 0 2 4 2 8
16 U20EC017 0 0 0 0 2 3 2 7
17 U20EC019 0 0 0 0 2 4 2 7
18 U20EC020 0 0 0 0 2 2 2 7
19 U20EC021 0 0 0 0 2 2 2 7
20 U20EC022 0 0 0 0 2 2 2 8
21 U20EC023 0 0 0 0 2 2 2 8
22 U20EC024 0 0 0 0 2 2 2 8
23 U20EC025 0 0 0 0 2 2 2 8
24 U20EC026 0 0 0 0 2 2 3 8
25 U20EC027 0 0 0 0 2 2 4 8
26 U20EC028 0 0 0 0 2 2 4 8
27 U20EC029 0 0 0 0 2 2 2 8
28 U20EC030 0 0 0 0 2 2 4 8
29 U20EC032 0 0 0 0 2 2 3 8
30 U20EC033 0 0 0 0 2 2 3 8
31 U20EC035 0 0 0 0 2 2 1 8
32 U20EC036 0 0 0 2 2 2 2 8
33 U20EC037 0 0 0 0 2 2 4 8
34 U20EC038 0 0 0 0 2 2 4 8
35 U20EC039 0 0 0 0 1 2 4 8
36 U20EC040 0 0 0 0 2 2 3 8
37 U20EC041 0 0 0 0 2 2 4 8
38 U20EC042 0 0 0 0 2 2 1 8
39 U20EC043 0 0 0 0 2 2 4 8
40 U20EC044 0 0 0 0 1 2 3 8
41 U20EC045 0 0 0 0 2 2 2 8
42 U20EC046 0 0 0 0 2 2 3 8
43 U20EC047 0 0 0 0 1 2 2 8
44 U20EC048 0 0 0 0 2 2 1 8
45 U20EC049 0 0 0 0 0 2 1 8
46 U20EC050 0 0 0 0 0 2 3 8
47 U20EC052 0 0 0 0 0 2 2 8
48 U20EC053 0 0 0 0 0 2 2 8
49 U20EC054 0 0 0 0 0 2 4 8
50 U20EC055 0 0 0 0 0 2 2 8
51 U20EC056 0 0 0 0 0 2 4 11
52 U20EC057 2 0 0 0 0 2 1 11
53 U20EC058 2 0 0 0 0 2 2 7
54 U20EC059 2 0 0 0 0 3 3 10
55 U20EC060 1 0 0 0 0 4 4 11
56 U20EC061 2 0 0 0 0 3 3 10
57 U20EC062 1 0 0 0 0 2 1 7
58 U20EC064 1 0 0 0 0 4 4 11
59 U20EC065 2 0 0 0 2 4 3 11
60 U20EC066 2 0 0 0 2 3 2 11
61 U20EC067 2 0 0 0 2 4 4 11
62 U20EC068 1 0 0 0 2 1 3 8
63 U20EC069 0 0 1 1 1 2 2 8
64 U20EC070 2 0 0 0 2 4 4 11
65 U20EC071 2 0 0 0 2 3 3 11
66 U20EC072 1 0 0 0 2 2 4 11
67 U20EC074 1 0 0 0 2 2 4 11
68 U20EC075 2 0 0 0 2 2 4 12
69 U20EC076 2 0 0 0 2 2 4 8
70 U20EC077 2 0 0 0 2 2 4 12
71 U20EC078 2 0 0 0 2 2 4 12
72 U20EC079 2 0 0 0 1 2 4 12
73 U20EC080 2 0 0 0 2 2 2 7
74 U20EC081 2 0 0 0 0 2 2 11
75 U20EC082 2 0 0 0 0 2 4 7
76 U20EC083 2 0 0 0 0 2 4 12
77 U20EC084 2 0 0 0 0 2 3 9
78 U20EC085 1 0 0 0 0 2 4 11
79 U20EC086 2 0 0 0 0 2 4 12
80 U20EC087 2 0 0 0 0 2 4 12
81 U20EC088 2 0 0 0 0 2 4 7
82 U20EC089 2 0 0 0 0 2 4 8
83 U20EC091 2 0 0 0 0 2 4 12
84 U20EC092 2 0 0 0 0 2 3 8
85 U20EC093 2 0 0 0 0 2 3 10
86 U20EC094 1 0 0 0 0 2 3 11
87 U20EC095 2 0 0 0 0 2 3 9
88 U20EC096 2 0 0 0 0 2 4 9
89 U20EC097 2 0 0 0 0 3 3 10
90 U20EC098 2 2 0 0 0 4 3 10
91 U20EC099 2 2 0 0 0 4 4 11
92 U20EC100 2 2 0 0 0 4 4 11
93 U20EC101 2 2 0 0 0 3 3 10
94 U20EC102 2 2 0 0 0 4 4 11
95 U20EC103 2 2 0 0 0 4 4 12
96 U20EC104 2 2 0 0 0 3 3 9
97 U20EC105 2 2 0 0 0 3 3 11
98 U20EC106 2 2 0 0 0 4 4 12
99 U20EC107 2 2 0 0 0 4 4 10
100 U20EC108 2 2 0 0 0 4 4 12
101 U20EC109 2 2 0 0 0 4 4 12
102 U20EC110 2 2 0 0 0 3 3 7
103 U20EC111 2 2 0 0 0 2 1 10
104 U20EC112 2 2 0 0 2 4 4 12
105 U20EC113 2 2 0 0 2 4 4 12
106 U20EC114 2 2 0 0 2 4 4 12
107 U20EC115 2 2 0 0 2 4 4 8
108 U20EC116 2 2 0 0 1 3 3 10
109 U20EC117 2 2 0 0 1 3 3 11
110 U20EC118 2 2 0 0 2 4 4 11
111 U20EC119 0 2 0 0 2 4 3 9
112 U20EC120 0 2 0 0 2 3 3 11
113 U20EC121 0 2 0 0 1 4 4 11
114 U20EC122 0 2 0 0 2 3 3 10
115 U20EC123 0 2 0 0 1 3 2 11
116 U20EC125 0 2 0 0 1 3 3 10
117 U20EC126 0 2 0 0 2 4 4 11
118 U20EC127 0 2 0 0 1 3 3 11
119 U20EC128 0 2 0 0 2 3 3 10
120 U20EC129 0 2 0 0 2 3 3 10
121 U20EC130 0 2 0 0 2 3 3 10
122 U20EC131 0 2 0 0 2 2 4 9
123 U20EC132 0 2 0 0 2 4 4 12
124 U20EC133 0 2 0 0 1 3 3 8
125 U20EC134 2 2 0 2 2 4 4 12
126 U20EC135 2 2 0 1 2 2 2 10
127 U20EC136 2 1 0 1 1 4 3 9
128 U20EC137 2 2 0 2 0 4 4 10
129 U20EC138 2 2 0 2 0 4 4 10
130 U20EC139 2 2 0 2 0 4 3 9
131 U20EC140 2 2 0 2 0 3 3 11
132 U20EC141 2 2 0 2 0 3 3 11
133 U20EC142 2 2 0 2 0 3 3 11
134 U20EC143 2 2 0 2 0 3 3 10
135 U20EC144 2 2 0 2 0 4 4 12
136 U20EC145 2 2 0 2 0 4 4 12
137 U20EC146 2 2 0 2 0 4 4 12
138 U20EC147 2 2 0 2 0 4 4 12
139 U20EC148 2 2 0 2 0 3 3 10
140 U20EC149 2 2 0 2 0 3 3 11
141 U20EC150 2 2 0 2 0 3 3 10
142 U20EC151 2 2 0 2 0 4 4 12
143 U20EC152 2 2 0 2 0 4 4 12
144 U20EC153 2 2 0 2 0 4 3 9
145 U20EC154 2 2 0 2 0 3 3 11
146 U20EC156 2 2 0 2 0 4 4 12
147 U20EC158 2 2 0 2 0 4 4 10
148 U20EC159 2 2 0 2 0 4 4 10
149 U20EC160 2 2 0 2 0 4 4 10
150 U20EC161 2 2 0 0 0 4 4 12
151 U20EC162 2 2 0 0 0 4 4 12
152 U20EC163 2 2 0 2 0 4 4 12
153 U20EC165 2 2 0 2 0 4 4 12
154 U20EC168 2 2 0 2 0 4 4 12
155 U20EC169 2 2 0 2 0 4 4 12
156 U20EC170 2 2 0 2 0 3 3 9
157 U20EC171 2 2 0 2 0 3 3 9
158 U20EC172 0 2 0 2 0 3 3 9
159 U20EC173 0 2 0 2 0 4 4 12
160 U20EC174 0 2 0 2 0 4 4 10
161 U20EC175 0 1 0 1 0 4 4 11
162 U20EC176 0 1 0 1 0 3 3 11
163 U20EC178 0 2 0 2 0 4 4 12
164 U20EC179 0 2 0 2 0 4 4 12
165 U20EC180 0 2 2 2 0 4 4 12
166 U20EC181 0 2 2 2 0 4 4 12
167 U20EC182 0 2 2 2 0 4 4 12
168 U20EC183 0 2 1 1 0 2 2 9
169 U20EC184 0 2 2 2 0 4 4 10
170 U20EC185 0 2 2 2 0 4 4 12
171 U20EC701 0 2 2 2 0 4 4 12
172 U20EC702 0 2 2 2 0 4 4 12
173 U20EC703 0 2 2 2 0 4 4 12
174 U20EC704 0 2 1 1 0 3 3 10
175 U20EC705 0 1 0 1 0 3 4 11
176 U20EC706 0 2 0 2 0 4 4 12
177 U20EC707 0 2 0 2 0 4 4 10
178 U20EC708 0 2 0 2 0 4 4 12
179 U20EC709 0 2 0 2 0 4 4 10
180 U20EC710 0 2 0 2 0 4 3 9
181 U20EC711 0 2 0 1 0 3 3 11
182 U20EC712 0 1 0 1 0 4 4 11
183 U20EC713 0 2 0 2 0 4 4 12
184 U20EC714 0 2 0 2 0 4 4 10
185 U20EC715 0 2 0 2 0 3 2 11
186 U20EC716 0 2 0 1 0 2 4 11
187 U20EC717 0 1 0 1 0 2 2 11
188 U20EC718 0 2 0 1 0 2 2 11
189 U20EC719 0 1 0 1 0 2 2 11
190 U20EC721 0 1 0 1 0 2 2 11
191 U20EC722 0 2 0 1 0 2 2 11
192 U20EC723 0 2 0 1 0 2 2 12
193 U20EC724 0 2 0 1 0 2 2 12
194 U20EC725 0 2 0 0 0 2 2 12
195 U20EC726 0 1 0 0 0 2 2 10
196 U20EC727 0 1 0 0 0 2 2 11
197 U20EC728 0 2 0 0 0 2 2 7
198 U20EC729 0 2 0 0 0 2 2 12
199 U20EC730 0 2 0 0 0 2 2 10
200 U20EC731 0 2 0 0 1 2 2 10
201 U20EC732 0 2 0 0 1 2 2 8
202 U20EC733 0 2 0 0 1 2 2 10
203 U20EC734 0 2 0 0 1 2 2 10
204 U20EC735 0 2 0 0 1 2 2 10
205 U20EC736 0 1 0 0 1 2 2 11
Attempts 205 205 205 205 205 205 205 205

Scores above 50% 92 123 12 71 81 203 198 205
attainment 0.4488 0.6 0.0586 0.3464 0.3952 0.9903 0.9659 1
DEPARTMENT OF ECE , SEMESTER V, Batch- 2020
ASSIGNMENT MARK ANALYSIS - U20ECCT09 -COMPUTER COMMUNICATION NETWORKS
Q.No 1 2
DESCRIPTIVE
CO 4 5
Blooms Level 2 2
S.No MAX MARKS

5 5
REG.NO.
1 U20EC001 5 5
2 U20EC002 5 5
3 U20EC003 5 5
4 U20EC004 5 5
5 U20EC005 5 5
6 U20EC006 5 5
7 U20EC007 5 5
8 U20EC008 5 5
9 U20EC009 5 5
10 U20EC010 5 5
11 U20EC011 5 5
12 U20EC013 5 5
13 U20EC014 5 5
14 U20EC015 5 5
15 U20EC016 5 5
16 U20EC017 5 5
17 U20EC019 5 5
18 U20EC020 5 5
19 U20EC021 5 5
20 U20EC022 5 5
21 U20EC023 5 5
22 U20EC024 5 5
23 U20EC025 5 5
24 U20EC026 5 5
25 U20EC027 5 5
26 U20EC028 5 5
27 U20EC029 5 5
28 U20EC030 5 5
29 U20EC032 5 5
30 U20EC033 5 5
31 U20EC035 5 5
32 U20EC036 5 5
33 U20EC037 5 5
34 U20EC038 5 5
35 U20EC039 5 5
36 U20EC040 5 5
37 U20EC041 5 5
38 U20EC042 5 5
39 U20EC043 5 5
40 U20EC044 5 5
41 U20EC045 5 5
42 U20EC046 5 5
43 U20EC047 5 5
44 U20EC048 5 5
45 U20EC049 5 5
46 U20EC050 5 5
47 U20EC052 5 5
48 U20EC053 5 5
49 U20EC054 5 5
50 U20EC055 5 5
51 U20EC056 5 5
52 U20EC057 5 5
53 U20EC058 5 5
54 U20EC059 5 5
55 U20EC060 5 5
56 U20EC061 5 5
57 U20EC062 5 5
58 U20EC064 5 5
59 U20EC065 5 5
60 U20EC066 5 5
61 U20EC067 5 5
62 U20EC068 5 5
63 U20EC069 5 5
64 U20EC070 5 5
65 U20EC071 5 5
66 U20EC072 5 5
67 U20EC074 5 5
68 U20EC075 5 5
69 U20EC076 5 5
70 U20EC077 5 5
71 U20EC078 5 5
72 U20EC079 5 5
73 U20EC080 5 5
74 U20EC081 5 5
75 U20EC082 5 5
76 U20EC083 5 5
77 U20EC084 5 5
78 U20EC085 5 5
79 U20EC086 5 5
80 U20EC087 5 5
81 U20EC088 5 5
82 U20EC089 5 5
83 U20EC091 5 5
84 U20EC092 5 5
85 U20EC093 5 5
86 U20EC094 5 5
87 U20EC095 5 5
88 U20EC096 5 5
89 U20EC097 5 5
90 U20EC098 5 5
91 U20EC099 5 5
92 U20EC100 5 5
93 U20EC101 5 5
94 U20EC102 5 5
95 U20EC103 5 5
96 U20EC104 5 5
97 U20EC105 5 5
98 U20EC106 5 5
99 U20EC107 5 5
100 U20EC108 5 5
101 U20EC109 5 5
102 U20EC110 5 5
103 U20EC111 5 5
104 U20EC112 5 5
105 U20EC113 5 5
106 U20EC114 5 5
107 U20EC115 5 5
108 U20EC116 5 5
109 U20EC117 5 5
110 U20EC118 5 5
111 U20EC119 5 5
112 U20EC120 5 5
113 U20EC121 5 5
114 U20EC122 5 5
115 U20EC123 5 5
116 U20EC125 5 5
117 U20EC126 5 5
118 U20EC127 5 5
119 U20EC128 5 5
120 U20EC129 5 5
121 U20EC130 5 5
122 U20EC131 5 5
123 U20EC132 5 5
124 U20EC133 5 5
125 U20EC134 5 5
126 U20EC135 5 5
127 U20EC136 5 5
128 U20EC137 5 5
129 U20EC138 5 5
130 U20EC139 5 5
131 U20EC140 5 5
132 U20EC141 5 5
133 U20EC142 5 5
134 U20EC143 5 5
135 U20EC144 5 5
136 U20EC145 5 5
137 U20EC146 5 5
138 U20EC147 5 5
139 U20EC148 5 5
140 U20EC149 5 5
141 U20EC150 5 5
142 U20EC151 5 5
143 U20EC152 5 5
144 U20EC153 5 5
145 U20EC154 5 5
146 U20EC156 5 5
147 U20EC158 5 5
148 U20EC159 5 5
149 U20EC160 5 5
150 U20EC161 5 5
151 U20EC162 5 5
152 U20EC163 5 5
153 U20EC165 5 5
154 U20EC168 5 5
155 U20EC169 5 5
156 U20EC170 5 5
157 U20EC171 5 5
158 U20EC172 5 5
159 U20EC173 5 5
160 U20EC174 5 5
161 U20EC175 5 5
162 U20EC176 5 5
163 U20EC178 5 5
164 U20EC179 5 5
165 U20EC180 5 5
166 U20EC181 5 5
167 U20EC182 5 5
168 U20EC183 5 5
169 U20EC184 5 5
170 U20EC185 5 5
171 U20EC701 5 5
172 U20EC702 5 5
173 U20EC703 5 5
174 U20EC704 5 5
175 U20EC705 5 5
176 U20EC706 5 5
177 U20EC707 5 5
178 U20EC708 5 5
179 U20EC709 5 5
180 U20EC710 5 5
181 U20EC711 5 5
182 U20EC712 5 5
183 U20EC713 5 5
184 U20EC714 5 5
185 U20EC715 5 5
186 U20EC716 5 5
187 U20EC717 5 5
188 U20EC718 5 5
189 U20EC719 5 5
190 U20EC721 5 5
191 U20EC722 5 5
192 U20EC723 5 5
193 U20EC724 5 5
194 U20EC725 5 5
195 U20EC726 5 5
196 U20EC727 5 5
197 U20EC728 5 5
198 U20EC729 5 5
199 U20EC730 5 5
200 U20EC731 5 5
201 U20EC732 5 5
202 U20EC733 5 5
203 U20EC734 5 5
204 U20EC735 5 5
205 U20EC736 5 5
Attempts 205 205

Scores above 50% 205 205
attainment 1 1
CONTINUOUS LEARNING ASSESSMENT - III MARK ANALYSIS - U20ECCT09 -COMPUTER COMMUNICATION NETWORKS
Q.No 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
DESCRIPTIVE
CO 1 1 2 2 3 3 4 4 5 5 1 2 3 4 5 1 2 3 4 5
Blooms Level 2 1 1 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 3 2
MAX MARKS
S.No
2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 12 12 12 12
REG.NO.
1 U20EC001 2 2 2 2 1 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
2 U20EC002 2 2 2 2 1 2 2 2 2 2 3 3 3 4 4 10 10 8 9 10
3 U20EC003 2 2 2 2 1 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
4 U20EC004 2 2 2 2 1 2 2 2 2 2 4 4 3 3 4 10 10 10 10 10
5 U20EC005 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 10
6 U20EC006 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 12
7 U20EC007 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
8 U20EC008 2 2 2 2 2 2 2 2 2 2 4 4 4 3 3 10 10 10 10 10
9 U20EC009 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 10 10 10
10 U20EC010 2 2 2 2 2 2 2 2 1 1 3 3 3 3 3 10 10 10 11 10
11 U20EC011 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
12 U20EC013 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
13 U20EC014 2 2 2 2 2 2 2 2 2 2 4 4 4 4 3 9 9 9 10 10
14 U20EC015 1 1 1 1 1 1 2 2 2 2 4 4 4 4 4 12 10 12 10 10
15 U20EC016 2 2 2 1 1 1 1 2 2 2 3 4 4 4 4 12 10 12 10 10
16 U20EC017 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
17 U20EC019 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 10
18 U20EC020 1 1 1 1 1 1 1 2 2 2 4 4 4 4 4 12 10 12 10 10
19 U20EC021 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 11 11
20 U20EC022 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 11 10
21 U20EC023 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 9 10
22 U20EC024 2 2 2 2 2 2 1 1 2 2 4 4 4 4 4 9 10 10 10 10
23 U20EC025 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
24 U20EC026 2 2 2 2 2 2 2 2 2 2 4 3 4 3 3 9 10 10 10 10
25 U20EC027 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
26 U20EC028 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
27 U20EC029 2 2 2 2 2 2 2 2 2 2 4 4 3 3 3 9 10 10 10 10
28 U20EC030 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 8 8 8
29 U20EC032 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 8 8 8 8
30 U20EC033 2 2 2 2 2 2 2 2 2 2 4 3 3 3 3 10 10 10 10 10
31 U20EC035 2 2 2 2 2 2 2 2 2 2 4 4 3 3 3 9 10 10 10 10
32 U20EC036 2 2 2 1 1 1 1 1 1 1 3 3 4 4 4 9 10 10 10 10
33 U20EC037 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 12 11 10 10
34 U20EC038 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 10 10 10
35 U20EC039 2 1 1 1 1 1 1 2 2 2 4 4 4 4 4 9 10 10 10 10
36 U20EC040 1 1 1 1 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
37 U20EC041 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 11 12 10
38 U20EC042 1 1 1 1 1 1 1 1 1 1 2 2 2 2 3 6 6 6 6 6
39 U20EC043 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 12 12 12 11
40 U20EC044 2 2 2 2 2 2 2 2 2 2 4 3 4 3 4 9 12 9 7 6
41 U20EC045 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 12 10
42 U20EC046 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
43 U20EC047 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
44 U20EC048 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 11 12 12
45 U20EC049 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
46 U20EC050 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 7 10 10 9
47 U20EC052 2 2 2 2 2 2 2 2 2 2 4 3 3 4 4 9 7 8 8 10
48 U20EC053 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 5 10 10 10
49 U20EC054 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 7 10 6 10
50 U20EC055 2 2 1 1 1 2 2 2 2 2 4 4 2 4 4 9 10 10 10 10
51 U20EC056 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 12 12 12 10
52 U20EC057 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 12 10
53 U20EC058 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 9 12 10
54 U20EC059 2 2 2 1 1 2 2 2 2 1 4 4 4 4 4 8 10 10 7 10
55 U20EC060 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 10
56 U20EC061 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 12 10 11 10
57 U20EC062 2 2 2 2 2 2 2 2 2 2 3 4 4 4 4 9 10 10 10 10
58 U20EC064 2 2 2 1 2 2 2 2 2 2 4 2 4 2 4 6 0 6 7 10
59 U20EC065 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 9
60 U20EC066 2 2 2 2 2 2 2 2 2 2 3 4 4 4 4 10 10 12 10 12
61 U20EC067 1 1 1 2 1 2 1 1 2 2 4 3 3 4 4 9 8 6 2 4
62 U20EC068 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 10
63 U20EC069 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
64 U20EC070 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 12 10
65 U20EC071 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 11 10 12
66 U20EC072 2 2 2 2 2 2 2 2 2 2 4 2 2 3 4 9 5 6 10 7
67 U20EC074 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
68 U20EC075 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
69 U20EC076 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 8 10 10 10
70 U20EC077 2 1 1 1 1 1 1 1 1 1 1 1 2 2 4 1 3 7 4 5
71 U20EC078 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 12 12 10 12
72 U20EC079 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 12 10 11
73 U20EC080 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 10 10
74 U20EC081 2 2 2 2 2 2 2 2 2 2 4 1 2 4 4 9 10 10 10 10
75 U20EC082 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 12 12
76 U20EC083 2 2 2 2 2 2 2 2 2 2 4 2 2 2 2 9 10 10 10 10
77 U20EC084 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 12 11 10
78 U20EC085 2 2 2 1 2 2 1 1 1 1 3 3 3 3 4 9 10 10 10 10
79 U20EC086 2 2 2 2 2 2 2 2 2 2 2 2 3 1 4 12 9 10 10 10
80 U20EC087 2 2 2 2 1 2 1 1 2 1 2 4 2 2 2 12 10 12 11 10
81 U20EC088 2 2 2 2 1 1 1 2 2 2 4 4 4 4 4 9 10 10 10 10
82 U20EC089 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 10 10 10
83 U20EC091 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 11 7 5 12
84 U20EC092 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 11 10 10
85 U20EC093 2 2 2 2 2 2 2 2 2 2 3 4 4 4 4 9 10 10 10 10
86 U20EC094 2 2 2 2 1 2 1 1 1 1 3 3 3 3 3 9 10 10 10 8
87 U20EC095 2 2 1 1 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
88 U20EC096 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 9 5 10 4 6
89 U20EC097 2 2 2 2 2 2 2 2 2 2 4 2 4 4 4 9 10 10 10 10
90 U20EC098 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 10 10 10 10
91 U20EC099 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 5 5
92 U20EC100 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 12 12 10 10
93 U20EC101 2 2 2 2 2 2 2 2 2 2 4 3 3 1 4 9 10 10 10 10
94 U20EC102 2 2 2 2 2 2 2 2 2 2 3 2 2 2 4 9 10 10 10 10
95 U20EC103 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 11 11 11 11
96 U20EC104 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 12 11 11 11
97 U20EC105 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 9 10 10 10 10
98 U20EC106 2 2 2 2 2 2 2 1 1 1 4 4 4 4 4 9 10 10 10 10
99 U20EC107 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
100 U20EC108 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 12 12 10
101 U20EC109 2 2 2 2 2 2 1 1 1 1 3 3 3 3 3 9 10 10 10 10
102 U20EC110 1 1 1 1 1 1 2 1 2 2 4 4 4 4 4 9 10 10 10 10
103 U20EC111 2 2 2 2 2 2 2 2 2 2 1 2 2 3 4 9 10 10 10 10
104 U20EC112 2 2 1 1 1 1 1 1 1 2 3 3 3 3 3 9 10 10 10 10
105 U20EC113 2 1 1 1 1 1 1 1 2 2 3 3 3 3 3 9 9 10 10 10
106 U20EC114 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
107 U20EC115 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 10 10 10 10 10
108 U20EC116 2 2 2 1 1 1 1 1 1 1 3 3 3 4 3 9 10 10 10 10
109 U20EC117 1 1 1 1 1 1 1 1 1 1 4 3 3 3 3 9 9 8 8 9
110 U20EC118 2 2 2 2 2 2 2 1 1 1 3 3 3 3 3 9 9 9 9 10
111 U20EC119 1 1 1 1 1 1 1 2 2 2 4 4 4 4 4 9 9 9 9 9
112 U20EC120 1 1 1 1 1 1 1 1 1 1 4 4 4 4 4 9 10 10 10 10
113 U20EC121 2 2 2 2 1 1 1 1 1 1 3 3 3 3 3 9 9 9 9 9
114 U20EC122 2 2 2 2 1 1 1 1 1 1 3 3 3 3 4 9 10 10 10 10
115 U20EC123 1 1 1 1 1 1 1 1 1 1 4 3 3 3 3 9 9 9 9 10
116 U20EC125 2 1 1 2 2 2 1 1 1 1 3 3 3 3 3 7 7 7 7 7
117 U20EC126 2 1 1 1 1 1 2 2 2 2 3 3 3 3 3 8 8 8 8 8
118 U20EC127 2 2 2 1 1 1 1 1 3 4 4 4 4 4 4 9 10 10 10 10
119 U20EC128 2 2 1 1 1 1 1 1 1 1 3 3 3 3 3 7 7 7 7 7
120 U20EC129 2 1 1 1 1 1 1 1 2 2 4 4 4 4 4 9 10 10 10 10
121 U20EC130 1 1 1 1 1 1 1 1 1 2 3 3 3 4 4 9 10 10 10 10
122 U20EC131 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 9 9 9 9 9
123 U20EC132 2 2 2 1 1 1 1 1 2 2 3 3 3 3 4 9 10 10 10 10
124 U20EC133 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 11 11 11
125 U20EC134 2 2 2 1 1 1 1 1 1 1 3 3 3 2 3 7 7 7 7 7
126 U20EC135 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 11 10 10
127 U20EC136 2 2 2 2 2 2 2 2 2 2 4 3 4 4 3 9 9 9 9 9
128 U20EC137 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 9 8 8
129 U20EC138 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
130 U20EC139 2 2 2 2 2 2 1 2 1 1 3 3 3 3 3 9 9 9 10 10
131 U20EC140 2 2 1 1 1 1 2 2 2 2 4 4 4 4 4 9 10 10 10 10
132 U20EC141 2 1 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
133 U20EC142 2 2 2 2 2 2 2 2 2 2 4 3 3 3 3 6 6 6 6 6
134 U20EC143 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 9 9 10 10 10
135 U20EC144 2 2 2 2 2 2 1 1 1 3 3 3 3 3 3 9 10 10 10 10
136 U20EC145 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
137 U20EC146 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
138 U20EC147 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
139 U20EC148 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 8 9 9 9
140 U20EC149 2 2 2 2 2 2 2 2 2 2 4 4 3 3 3 9 9 9 10 10
141 U20EC150 2 2 2 2 2 2 1 1 1 1 3 3 4 4 4 9 9 9 10 10
142 U20EC151 1 1 1 1 1 1 2 2 2 2 4 4 3 4 4 9 9 9 10 10
143 U20EC152 1 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 11 11 10
144 U20EC153 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
145 U20EC154 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 8 8 8
146 U20EC156 2 2 2 2 2 2 2 1 1 1 3 3 3 3 3 9 9 9 10 10
147 U20EC158 2 2 2 2 2 1 1 1 1 2 4 4 4 4 4 9 9 9 10 10
148 U20EC159 2 2 2 2 2 2 2 2 2 2 4 4 4 3 3 9 9 9 10 10
149 U20EC160 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
150 U20EC161 1 1 1 1 1 1 1 1 1 3 3 3 3 3 4 9 9 9 10 10
151 U20EC162 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 9 9 10 10
152 U20EC163 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 9 9 10 10
153 U20EC165 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
154 U20EC168 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 9 10 10
155 U20EC169 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 9 10
156 U20EC170 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
157 U20EC171 2 2 2 2 2 2 2 2 2 2 4 4 3 3 3 9 9 9 10 10
158 U20EC172 2 2 2 2 2 2 2 2 1 1 3 2 1 1 1 9 9 9 10 10
159 U20EC173 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 4 5 9 10 10
160 U20EC174 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
161 U20EC175 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 10 10 10
162 U20EC176 2 2 2 2 2 1 1 1 1 1 3 3 3 3 3 9 9 9 10 10
163 U20EC178 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 9 9 9 10 10
164 U20EC179 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 8 9 10 10
165 U20EC180 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 9 10
166 U20EC181 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 10 10 10
167 U20EC182 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
168 U20EC183 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 7 8 9 10
169 U20EC184 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 9 9
170 U20EC185 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
171 U20EC701 2 2 2 2 1 1 1 1 1 1 3 3 3 3 3 9 9 9 10 10
172 U20EC702 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 9 8 8 8 8
173 U20EC703 2 1 1 1 1 1 1 1 1 1 3 3 3 3 3 9 9 9 10 8
174 U20EC704 2 2 2 2 2 2 2 2 2 2 4 4 4 3 3 9 9 9 9 9
175 U20EC705 2 2 2 2 2 2 2 2 2 2 4 3 3 4 4 9 9 9 10 10
176 U20EC706 2 2 2 2 2 2 2 2 2 2 3 4 4 4 4 9 9 9 10 10
177 U20EC707 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
178 U20EC708 2 2 2 2 2 2 2 2 2 2 4 3 3 3 4 9 9 9 10 10
179 U20EC709 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 9 9 9 9 10
180 U20EC710 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 10 10 10
181 U20EC711 2 2 2 2 2 2 2 2 2 2 4 4 3 3 4 9 9 9 9 9
182 U20EC712 2 2 2 2 2 2 2 2 2 2 4 3 3 3 3 9 9 9 10 10
183 U20EC713 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
184 U20EC714 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 11 10
185 U20EC715 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
186 U20EC716 2 2 2 2 2 2 2 2 2 2 3 3 3 4 4 9 9 9 10 10
187 U20EC717 2 2 2 2 2 2 2 2 2 1 4 4 4 4 4 9 9 9 10 10
188 U20EC718 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
189 U20EC719 2 2 2 2 2 2 1 1 1 1 4 4 4 4 4 9 9 9 10 10
190 U20EC721 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 10 10 10 10
191 U20EC722 2 2 2 2 2 2 2 1 1 1 3 3 3 3 4 10 10 10 10 9
192 U20EC723 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 12 11 11 10 10
193 U20EC724 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 10 10 10 10
194 U20EC725 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 10 10 10 10
195 U20EC726 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 9 9 10 10
196 U20EC727 2 2 2 2 2 2 2 2 1 1 3 3 3 3 3 9 9 9 10 10
197 U20EC728 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 10 10 10
198 U20EC729 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 9 9
199 U20EC730 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 9 9 9 10 10
200 U20EC731 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 11 11 11 10 10
201 U20EC732 2 2 2 2 2 2 2 2 2 2 4 4 4 3 3 9 9 9 10 10
202 U20EC733 2 2 2 2 2 2 2 2 2 2 4 3 4 3 10 10 10 10 9 10
203 U20EC734 2 2 2 2 2 2 2 2 2 2 4 3 4 4 4 9 9 9 9 9
204 U20EC735 2 2 2 2 2 2 2 2 2 2 4 4 4 4 4 10 11 11 10 10
205 U20EC736 2 2 2 2 2 2 2 2 2 2 4 3 3 3 3 9 9 9 9 9
Attempts 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205 205
Scores above 50% 202 202 202 202 202 202 202 202 202 202 200 200 201 199 201 202 198 204 199 201
attainment 0.9854 0.9854 0.9854 0.9854 0.9854 0.9854 0.9854 0.9854 0.9854 0.9854 0.9757 0.9757 0.9805 0.9708 0.9805 0.9854 0.9659 0.9952 0.9708 0.9805
Exit survey
Q.No 1 2 3 4 5
CO 1 2 3 4 5
Max. Marks
5 5 5 5 5
REG. NO Course Outcome Bloom's
1 U20EC001 5 5 5 4 4 Level of
2 U20EC002 5 5 5 4 4 Target the CO
3 U20EC003 5 5 5 4 4 CO1 0.85 2
4 U20EC004 5 5 5 4 4 CO2 0.85 3
5 U20EC005 5 5 5 4 4 CO3 0.85 2
6 U20EC006 5 5 5 4 4 CO4 0.85 3
7 U20EC007 5 5 5 4 4 CO5 0.85 2
8 U20EC008 5 5 5 4 4 CO6 0.85 3
9 U20EC009 5 5 5 4 4
10 U20EC010 5 5 5 4 4
11 U20EC011 4 5 5 5 5
12 U20EC013 5 5 5 4 4
13 U20EC014 5 5 5 4 4
14 U20EC015 5 5 5 4 4
15 U20EC016 5 5 5 4 4
16 U20EC017 5 5 5 4 4
17 U20EC019 4 5 5 5 5
18 U20EC020 5 5 5 4 4
19 U20EC021 5 5 4 5 5
20 U20EC022 5 4 5 5 4
21 U20EC023 5 5 5 4 4
22 U20EC024 4 5 5 5 5
23 U20EC025 5 5 5 4 4
24 U20EC026 5 5 5 4 4
25 U20EC027 5 5 5 4 4
26 U20EC028 5 5 5 4 4
27 U20EC029 5 4 5 5 4
28 U20EC030 5 5 5 4 4
29 U20EC032 4 5 5 5 5
30 U20EC033 5 5 5 4 4
31 U20EC035 5 5 5 4 4
32 U20EC036 5 5 5 4 4
33 U20EC037 5 5 5 4 4
34 U20EC038 4 5 5 5 5
35 U20EC039 5 5 5 4 4
36 U20EC040 5 5 5 4 4
37 U20EC041 5 5 5 4 4
38 U20EC042 5 5 5 4 4
39 U20EC043 5 5 5 4 4
40 U20EC044 5 5 5 4 4
41 U20EC045 5 5 5 4 4
42 U20EC046 5 4 5 5 4
43 U20EC047 5 5 5 4 4
44 U20EC048 4 5 5 5 5
45 U20EC049 5 5 5 4 4
46 U20EC050 5 5 5 4 4
47 U20EC052 5 5 5 4 4
48 U20EC053 5 5 5 4 4
49 U20EC054 5 5 5 4 4
50 U20EC055 5 5 5 4 4
51 U20EC056 5 5 5 4 4
52 U20EC057 5 4 5 5 4
53 U20EC058 5 5 5 4 4
54 U20EC059 4 5 5 5 5
55 U20EC060 5 5 5 4 4
56 U20EC061 5 5 5 4 4
57 U20EC062 5 5 5 4 4
58 U20EC064 5 5 5 4 4
59 U20EC065 5 5 5 4 4
60 U20EC066 5 5 5 4 4
61 U20EC067 5 5 5 4 4
62 U20EC068 5 4 5 5 4
63 U20EC069 5 5 5 4 4
64 U20EC070 4 5 5 5 5
65 U20EC071 5 5 5 4 4
66 U20EC072 5 5 5 4 4
67 U20EC074 5 5 5 4 4
68 U20EC075 5 5 5 4 4
69 U20EC076 5 5 5 4 4
70 U20EC077 5 5 5 4 4
71 U20EC078 5 5 5 4 4
72 U20EC079 5 4 5 5 4
73 U20EC080 5 5 5 4 4
74 U20EC081 4 5 5 5 5
75 U20EC082 5 5 5 4 4
76 U20EC083 5 5 5 4 4
77 U20EC084 5 5 5 4 4
78 U20EC085 5 5 5 4 4
79 U20EC086 5 5 5 4 4
80 U20EC087 5 5 5 4 4
81 U20EC088 5 5 5 4 4
82 U20EC089 5 4 5 5 4
83 U20EC091 5 5 5 4 4
84 U20EC092 4 5 5 5 5
85 U20EC093 5 5 5 4 4
86 U20EC094 5 5 5 4 4
87 U20EC095 5 5 5 4 4
88 U20EC096 5 5 5 4 5
89 U20EC097 4 5 5 5 5
90 U20EC098 5 5 5 4 5
91 U20EC099 5 5 5 4 4
92 U20EC100 5 5 5 4 4
93 U20EC101 5 5 5 4 5
94 U20EC102 5 5 5 4 4
95 U20EC103 5 5 5 4 5
96 U20EC104 5 5 5 4 4
97 U20EC105 5 4 5 5 5
98 U20EC106 5 5 5 4 5
99 U20EC107 4 5 5 5 5
100 U20EC108 4 5 5 5 5
101 U20EC109 5 5 5 4 5
102 U20EC110 5 5 5 4 4
103 U20EC111 5 5 5 4 4
104 U20EC112 5 5 5 4 5
105 U20EC113 5 5 5 4 4
106 U20EC114 5 5 5 4 5
107 U20EC115 5 5 5 4 4
108 U20EC116 5 4 5 5 5
109 U20EC117 5 5 5 4 5
110 U20EC118 4 5 5 5 5
111 U20EC119 4 5 5 5 5
112 U20EC120 5 5 5 4 5
113 U20EC121 5 5 5 4 4
114 U20EC122 5 5 5 4 4
115 U20EC123 5 5 5 4 5
116 U20EC125 5 5 5 4 4
117 U20EC126 5 5 5 4 5
118 U20EC127 5 5 5 4 4
119 U20EC128 5 4 5 5 5
120 U20EC129 5 5 5 4 5
121 U20EC130 4 5 5 5 5
122 U20EC131 4 5 5 5 5
123 U20EC132 5 5 5 4 5
124 U20EC133 5 5 5 4 4
125 U20EC134 5 5 5 4 4
126 U20EC135 5 5 5 4 5
127 U20EC136 5 5 5 4 4
128 U20EC137 5 5 5 4 5
129 U20EC138 5 5 5 4 4
130 U20EC139 5 4 5 5 5
131 U20EC140 5 5 5 4 5
132 U20EC141 4 5 5 5 5
133 U20EC142 4 5 5 5 5
134 U20EC143 5 5 5 4 5
135 U20EC144 5 5 5 4 4
136 U20EC145 5 5 5 4 4
137 U20EC146 5 5 5 4 5
138 U20EC147 5 5 5 4 4
139 U20EC148 5 5 5 4 5
140 U20EC149 5 5 5 4 4
141 U20EC150 4 5 5 5 5
142 U20EC151 5 5 5 4 5
143 U20EC152 5 5 5 4 4
144 U20EC153 5 5 5 4 4
145 U20EC154 5 5 5 4 5
146 U20EC156 5 5 5 4 4
147 U20EC158 5 5 5 4 5
148 U20EC159 5 5 5 4 4
149 U20EC160 5 4 5 5 5
150 U20EC161 5 5 5 4 5
151 U20EC162 4 5 5 5 5
152 U20EC163 5 5 5 4 5
153 U20EC165 5 5 5 4 5
154 U20EC168 5 5 5 4 5
155 U20EC169 5 5 5 4 5
156 U20EC170 5 5 5 4 5
157 U20EC171 5 5 5 4 5
158 U20EC172 5 5 5 4 5
159 U20EC173 5 5 5 4 5
160 U20EC174 5 5 5 4 5
161 U20EC175 5 5 5 4 5
162 U20EC176 5 5 5 4 5
163 U20EC178 5 5 5 4 5
164 U20EC179 5 5 5 4 5
165 U20EC180 5 5 5 4 5
166 U20EC181 5 5 5 4 5
167 U20EC182 5 5 5 4 5
168 U20EC183 5 5 5 4 5
169 U20EC184 5 5 5 4 5
170 U20EC185 5 5 5 4 5
171 U20EC701 5 5 5 4 5
172 U20EC702 5 5 5 4 5
173 U20EC703 5 5 5 4 5
174 U20EC704 5 5 5 4 5
175 U20EC705 5 5 5 4 5
176 U20EC706 5 5 5 4 5
177 U20EC707 5 5 5 4 5
178 U20EC708 5 5 5 5 5
179 U20EC709 5 5 5 5 5
180 U20EC710 5 5 5 5 5
181 U20EC711 5 5 5 5 5
182 U20EC712 5 5 5 5 5
183 U20EC713 5 5 5 5 4
184 U20EC714 5 5 5 5 5
185 U20EC715 5 5 5 5 5
186 U20EC716 5 5 5 5 5
187 U20EC717 5 4 5 5 4
188 U20EC718 5 5 5 5 5
189 U20EC719 5 5 5 5 5
190 U20EC721 5 5 5 4 5
191 U20EC722 5 5 5 5 5
192 U20EC723 5 5 5 5 5
193 U20EC724 5 4 5 5 5
194 U20EC725 5 5 5 5 5
195 U20EC726 5 5 5 5 5
196 U20EC727 5 5 5 4 5
197 U20EC728 5 5 5 5 5
198 U20EC729 5 5 5 5 5
199 U20EC730 5 5 5 5 5
200 U20EC731 5 5 4 5 5
201 U20EC732 5 5 5 5 5
202 U20EC733 5 5 5 5 5
203 U20EC734 5 5 5 5 5
204 U20EC735 5 4 5 5 5
205 U20EC736 5 5 5 5 5
Attempts 205 205 205 205 205

Scores above 50% 205 205 205 205 205
attainment 1 1 1 1 1
Course Outcome Continous Internal Evaluation (50)
First Mid Second ThirdMid Assignme

Bloom's
(30) Mid (30) (30) nt (10)
Level of
the CO Avg. Avg. Avg. Avg.
Attaineme Distribution Attainmen
Target Distribution% Blooms Bloom Attainment Distribution% Bloom Distribution% Bloom
nt % t
Level Level Level Level
CO1 0.85 2 67% 2 0.8957 FALSE
CO2 0.85 3 33% 2 0.9757 33% 2 0.6391 FALSE
CO3 0.85 2 67% 2 0.8898 FALSE
CO4 0.85 3 53% 3 0.683 50% 2
CO5 0.85 2 47% 2 0.5513 50% 2
CO6 0.85 3 FALSE
100%
90%
80%
70%
% Attainment
60%
50%
40%
30%
20%
10%
0%
1 2 3 4 5 6
Course Outcome
Semester End (50) Final Attainment (100)
Avg. Direct Indirect overall
Final
Average of CIE (100) Bloom Attainmen Attainmen attainmen
Exam
Level t t t
CIE Avg. Avg. Course
Attainmen Attainmen Attainmen overall Attainment
DistributionC Blooms Bloom exit Target%
t t t Distribution% %
O% Level Level survey
17.40% 2 0.7166 20% 2 0.983 18.70% 2 85% 1 0.88 88 85
17.40% 2 0.646 20% 2 0.9781 18.70% 81% 1 0.8504 85.04 85
17.40% 2 0.7119 20% 2 0.9867 18.70% 2 85% 1 0.88 88 85
1 24.79% 3 0.7464 20% 2 0.9781 22.40% 3 86% 1 0.8904 89.04 85
1 23.05% 2 0.6411 20% 2 0.983 21.60% 2 81% 1 0.8504 85.04 85
2 1 0.85 88 85
90
89.04
89
88 88 88
88
%Attainment
87
86
85.04 85.04
85
84
83
82
1 2 3 4 5 6
Course Outcome

Computer Communication Networks

Uploaded by

Copyright:

Available Formats

Computer Communication Networks

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Computer Communication Networks

Uploaded by

Copyright:

Available Formats

B.

TECH ELECTRONICS AND

U20ECCJ09/ COMPUTER COMMUNICATION

The Vision of the University:

The Mission of the University

To develop as a Premier University for Teaching, Learning,

To impart education and training to students for creating a better

To foster an interdisciplinary approach in education, research and

To develop as a multi-dimensional institution contributing

To establish benchmark standards in professional practice in the

To imbibe human dignity and values through personality

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

The Vision of the Department:

To inherit the professional competence among the Electronics and

To enable the students to develop cognitive skills to meet the

To establish the learning environment to enable the students to meet the

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

Programme Educational Objects (PEO)

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

Programme Educational Objects (PEO)

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

Problem Analysis: Identify, formulate, review research literature, and analyze

Design/Development of Solutions: Design solutions for complex Electronics and

Conduct Investigations of Complex Problems: Use research-based knowledge and

Environment and Sustainability: Understand the impact of the professional

Individual and Team Work: Function effectively as an individual, and as a member

Communication: Communicate effectively on complex engineering activities with

Project Management and Finance: Demonstrate knowledge and understanding of the

(** PO – Based on Accreditation Agency /UGC)

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY

PART A- INTRODUCTION OF THE COURSE

Introduction to the Course:

Course Course Course Title L T P C

Course Objective and Summary

Course Outcomes (Cos)

Mapping / Alignment of Cos with PO & PSO

PART B- Content of the Course

UNIT 2 MULTIPLE ACCESS CONTROL 6

UNIT 3 WIRED A N D WIRELESS LANS 6

UNIT 4 NETWORK LAYER PROTOCOLS 6

UNIT 5 TRANSPORT LAYER 6

LIST OF EXPERIMENTS TOTAL HOURS:30

S.No Summary of Course Content Hrs Alignment Teaching

32 Ethernet LAN protocol: To create scenario and study the

3. Lesson Plan/ Topic assigned with COs, teaching tools used

Ref Propos Compl

Teaching Tool used:

Type Code Teaching Tool Used

Part C- Assessment and Evaluation

CO’s Weightage (Theory) Weightage (Lab)

Tests (Mark) CLA 4

Continuous Learning Assessment (CLA) - Weightages (50%) LAB

Tests (Mark) CLA 4

CO’s Marks (Theory)

Final Examination – Weightage 50%

CO’s Marks(Lab) Record and Viva Voce

COMPUTER COMMUNICATION NETWORKS

This chapter provides an introduction to Computer networks and covers

1.1 DATA & INFORMATION