FMTH0301/Rev.5.

3
Course Plan

Semester: VI Year: 2024-25

Course Title: Computer Networks - 2 Course Code: 23ECSC303
Total Contact hrs: 40 Hrs Duration of ESA:3 Hrs
ISA Marks: 50 ESA Marks:50
Lesson Plan Author: Dr. Meenaxi .M. Raikar, Mr.Anand S Meti, Mr. Date: 10-02-2025
Sandeep Kulkarni

Checked By: Dr. Vijayalakshmi M Date: 14-02-2025

Prerequisites: Computer Networks - 1 (19ECSC302)

Course Outcomes (COs):

At the end of the course the student should be able to:

1. Apply suitable routing algorithm to route the data in a given network topology.
2. Analyze various buffering strategies using queuing theory
3. Apply the data link layer functionalities and compare the various channel access mechanisms.
4. Describe various LAN standards and VLAN concepts for an IP based network.
5. Describe wireless and multimedia network characteristics along with mobility management.

1
 Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs)
Course Title: Computer Networks-2 Semester: VI

Course Code: 23ECSC303 Year: 2024-25

Course Outcomes (COs) / Program 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Outcomes (POs)

1. Apply suitable routing algorithm to H M

route the data in a given network
topology.

2. Analyze various buffering strategies H M M

using queuing theory

3. Apply the data link layer H M

functionalities and compare the
various channel access mechanisms.

4. Describe various LAN standards and H M

VLAN concepts for an IP based
network.

5. Describe wireless and multimedia H M M

network characteristics along with
mobility management.

Degree of compliance L: Low M: Medium H: High

2
 Competency addressed in the Course and corresponding Performance Indicators

Competency Performance Indicators Course Specific Performance

Indicator

1.4: Demonstrate competence 1.4.5 - Apply suitable network 1.4.5.1 - Apply suitable routing
in computer science concepts for data transmission. algorithms to determine the path
engineering knowledge. for data transmission.

1.4.5.2 - Apply mathematical

models for analyzing queue
performance in M/M/1, M/M/m,
and M/M/1/B system.

1.4.5.3 - Explain the Wi-Fi and

cellular network concepts for
different network scenarios.

1.4.5.4 - Explain the various

protocols in multimedia streaming.

2.2: Demonstrate an ability to 2.2.3 - Identify existing 2.2.3.1 - Demonstrate an ability to

formulate a solution plan and processes/solution methods for apply CRC and Hamming Code to
methodology for an solving the problem, including forming detect/correct errors in data
transmission.
engineering problem. justified approximations and
assumptions. 2.2.3.2 - Compare and contrast
ALOHA, CSMA/CD, and CSMA/CA
for different networking scenarios
3.3: Demonstrate an ability to 3.3.1 - Apply suitable criteria to select 3.3.1.1 - Demonstrate an ability to
select the optimal design optimal design solutions for further select optimal routing strategy
scheme for further development based on network requirements.
development

12.2 Demonstrate an ability to 12.2.2 Recognize the need and be able 12.2.2.1 - Examine the impact of
identify changing trends in to clearly explain why it is vitally Software-Defined Networking
engineering knowledge and important to keep current regarding (SDN) / 5G / IoT-based networking
on modern communication
practice new developments in the field.
systems.

12.2.2.2 - Evaluate advancements

in LAN, WLAN, cellular network
technologies, and 6G research
trends.
13.2: Demonstrate the 13.2.2 - Recognize the standards and 13.2.2.1 - Recognize the standards
knowledge required in the salient features of network for VLANs using the different
domain of network architectures network devices.
engineering to develop
computer based solutions. 13.2.5 - Analyze the performance of 13.2.5.1 - Analyze how queuing
network by choosing the appropriate mechanisms affect latency, jitter,
parameters and packet loss for the given
network scenario.
Eg: 1.2.3.4: Represents Program Outcome ‘1’, Competency ‘2’, Performance Indicators ‘3’ and Course Specific
Performance Indicators ‘4’.

3
 Course Content

Course Code: 23ECSC303 Course Title: Computer Networks-2

L-T-P : 3-0-0 Credits: 3 Tutorial/Practical: 2hrs/week
ISA Marks: 50 ESA Marks: 50 Total Marks: 100
Teaching Hrs: 40 Exam Duration: 3 hrs

Content Hrs
Unit – 1
Network Layer- Routing Algorithms

1 The Link-State (LS) Routing Algorithm, The Distance-Vector (DV) Routing Algorithm, 08hrs
Hierarchical Routing, Routing in the Internet, intra-AS Routing in the Internet: RIP, Intra-AS
Routing in the Internet: OSPF, Inter-AS Routing: BGP. Broadcast and Multicast Routing,
Broadcast Routing Algorithms.
Network Layer – Queuing theory

2 08hrs
Router structure, Buffering strategies: Input queuing, Output queuing, Application of queuing
theory for performance of queuing mechanisms: M/M/1 system, M/M/m system, M/M/1/B
system.
Unit – 2
Data Link Layer

Introduction to the Link Layer, Error-Detection and -Correction Techniques : Parity Checks,
3 Check summing Methods, Cyclic Redundancy Check (CRC)binary and polynomial, ,Hamming 08hrs
Code, Multiple Access Links and Protocols: Channel Partitioning Protocols, Random Access
Protocols: Aloha, Slotted Aloha, CSMA, CSMA/CD, CSMA/CA, Taking-Turns Protocols, The Link-
Layer Protocol for Cable Internet Access.
Switched Local Area Networks

4 08hrs
Link-Layer Addressing and ARP, Ethernet 802.3, Token ring 802.5, FDDI and LAN standards,
Link-Layer Switches, Virtual Local Area Networks (VLANs), Multiprotocol Label Switching
(MPLS)
Unit – 3
Wireless and Mobile Networks

5 04hrs
Wireless Links and Network Characteristics, 802.11 Wireless LANs, Architecture, MAC Protocol,
Frame, Mobility, Personal Area Networks: Bluetooth and Zigbee. Cellular Networks and
Internet Access, Mobility, Mobile IP, Managing Mobility in Cellular Network.

6 Multimedia Networking: Multimedia Networking Applications, Streaming Stored Video, Voice- 04hrs
over-IP, Protocols for Real-Time Conversational Applications.

4
Text Books (List of books as mentioned in the approved syllabus)

1. J. F. Kurose, K. W. Ross, “Computer Networking, A Top-Down Approach”, 8th Edition, Pearson Education,
2021.
2. Raj Jain, “Performance evaluation of computer systems”, Wiley, 1991.

References
1. Behrouz A. Forouzan , “Data Communications and Networking with TCPIP Protocol Suite”, 6th Edition ,
McGraw Hill, 2021
2. Larry Peterson, Bruce Davie “Computer networks : a systems approach”, 6th Edition, 2021.

5
 Evaluation Scheme
ISA Scheme

Assessment Weightage in Marks

ISA - 1 20
ISA - 2 20
Activity 10

Total 50

Activity Title: "Exploring Modern Networking Technologies – SDN / 5G / IoT / Wi-Fi 6 / 6G"

Objective:
Students will research, configure, and analyse modern networking technologies, emphasizing Software-Defined
Networking (SDN), 5G network slicing, IoT-based networking, Wi-Fi 6 optimizations, and emerging 6G
advancements.

Activity Structure:

1. Presentation (3M)

o Groups of students will explore recent advancements in SDN / 5G / IoT /Wi-Fi 6 / 6G.

o Each group will present findings on how these technologies impact modern communication
systems.

2. Hands-on Network Simulation (4M)

o SDN Lab: Configure and analyse SDN controllers using Mininet or ONOS.

o 5G/IoT Lab: Simulate a 5G network with IoT device connectivity in NS-3 or MATLAB.

o Wi-Fi 6 Lab: Configure a high-performance WLAN using Cisco Packet Tracer or GNS3.

3. Performance Analysis and Report (3M)

o Evaluate key performance metrics such as latency, bandwidth utilization, and network
efficiency in different setups.

o Submit a report comparing traditional networks with SDN / 5G / Wi-Fi 6.

6
 Course Unitization for Minor Exams and End Semester Assessment

No. of No. of No. of No. of

Topics / Chapters Teaching Questions Questions Questions Questions
Credits in Minor in Minor in Activity in ESA
Exam-1 Exam-2
Unit I
Chapter 1: Network Layer- Routing 8 1.5 - - 1.5
Algorithms

Chapter 2: Network Layer – Queuing 8 1.5 - - 1.5

theory

Unit II
Chapter 3: Data Link Layer 8 - 1.5 - 1.5

Chapter 4: Switched Local Area Networks 8 - 1.5 - 1.5

Unit III
Chapter 5: Wireless and Mobile Networks 4 - - - 1

Chapter 6: Multimedia Networking 4 - - - 1

Note
1. Each Question carries 20 marks and may consists of sub-questions.
2. Mixing of sub-questions from different chapters within a unit (only for Unit I and Unit II) is allowed in ISA I, II
and ESA
3. Answer 5 full questions of 20 marks each (two full questions from Unit I, II and one full questions from Unit
III) out of 8 questions in ESA.

7
 Course Assessment Plan

Course Title: Computer Networks-2

Code: 23ECSC303
Course outcomes (COs) Weightage in Assessment Methods
assessment ISA - 1 ISA - 2 Activity ESA
1. Apply suitable routing   
algorithm to route the data 20%
in a given network
topology.

2. Analyze various buffering   

strategies using queuing 20%
theory

3. Apply the data link layer   

functionalities and compare 20%
the various channel access
mechanisms.

4. Describe various LAN   

standards and VLAN
20%
concepts for an IP based
network.

5. Describe wireless and  

multimedia network 20%
characteristics along with
mobility management.

Weightage 20% 20% 10% 50%

8
Assessment Plan:

Sl.No Description Marks CO PO PI

1 Activity 10 Marks 1 12 12.2.2

Activity Rubrics:

Parameters Marks = 10M BL=L3 CO = 1, PO = 12.2.2

Excellent Average Poor

Understanding of Demonstrates thorough Shows basic Shows understanding of

Networking understanding of the recent understanding of most fundamental networking
Concepts trends in networking networking concepts but concepts, but may struggle
concepts and principles lacks depth in some areas with more advanced topics

Device Configures networking Can configure devices Able to perform basic

Configuration devices accurately and with guidance, but may device configurations
Proficiency efficiently, demonstrating make some errors or independently, but may
mastery of configuration require additional require occasional guidance
tasks assistance
Network Quickly identifies and Capable of diagnosing and Demonstrates basic
Troubleshooting resolves complex resolving common troubleshooting skills but
Skills networking issues using networking issues with may struggle with more
systematic troubleshooting moderate assistance complex problems
methods

Report submission Well-structured report with Report is somewhat Poorly structured, difficult
a logical flow, clear organized but lacks logical to follow, multiple
headings, and well- flow or has minor grammatical and formatting
formatted content. No formatting and errors.
grammatical errors. grammatical errors.

Date: 06.03.2025 Head, Dept of CSE

9
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 1. Network Layer - Routing Algorithms Planned Hours: 8 hrs
Learning Outcomes:-
At the end of the topic the student should be able to:

Topic Learning Outcomes COs BL CA Code

1. Apply suitable routing algorithms to determine the path for data 1 L3 1.4
transmission.
2. Discuss how a hierarchical organization of the Internet has made it 1 L2 1.4
possible to scale to millions of users.
3. Demonstrate an ability to select optimal routing strategy based on 1 L3 3.3
network requirements.
4. Describe the broadcast and multicast routing. 1 L2 3.3

Lesson Schedule
Class No. - Portion covered per hour
1. The Link-State (LS) Routing Algorithm.
2. The Link-State (LS) Routing Algorithm (continued).
3. The Distance-Vector (DV) Routing Algorithm.
4. The Distance-Vector (DV) Routing Algorithm (continued).
5. Hierarchical Routing.
6. Routing in the Internet, intra AS Routing in the Internet: RIP.
7. Intra-AS Routing in the Internet: OSPF and Inter-AS Routing: BGP.
8. Broadcast routing algorithms and Multicast routing algorithms
Review Questions
Sl.No. - Questions TLOs BL PI Code
1. Compare and contrast link-state and distance-vector routing algorithms 1 L3 1.4.5

2. Compare and contrast the advertisements used by RIP and OSPF. 3 L2 1.4.5

3. Consider the count-to-infinity problem in the distance vector routing. 1 L2 1.4.5

Will the count-to-infinity problem occur if we decrease the cost of a link? Why?
How about if we connect two nodes which do not have a link?
4. Describe how loops in paths can be detected in BGP. 3 L2 1.4.5

5. Consider the following network. With the indicated link costs, use 1 L3 3.3.1
Dijkstra’s shortest-path algorithm to compute the shortest path from x to all
network nodes.

10
6. Consider the network shown below, and assume that each node initially 1 L3 3.3.1
knows the costs to each of its neighbours. Consider the distance-vector algorithm
and show the distance table entries at node z.

7. Consider the network shown below. Suppose AS3 and AS2 are running 3 L3 3.3.1
OSPF for their intra-AS routing protocol. Suppose AS1 and AS4 are running RIP for
their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter-AS
routing protocol. Initially suppose there is no physical link between AS2 and AS4.
i. Router 3c learns about prefix x from which routing protocol: OSPF,
RIP,eBGP, or iBGP?
ii. Router 3a learns about x from which routing protocol?
iii. Router 1c learns about x from which routing protocol?
iv. Router 1d learns about x from which routing protocol?

11
8. Explain the different broadcast routing algorithms. 4 L2 1.4.5

9. Describe error reporting with example. 4 L2 1.4.5

10. What is the difference between a group-shared tree and a source-based 4 L2 1.4.5
tree in the context of multicast routing?
11. Explain the uncontrolled flooding mechanism for broadcasting. 4 L2 1.4.5

12. Describe the reverse path forwarding algorithm for broadcasting. 4 L2 1.4.5

13. Explain with diagram the Spanning-Tree Broadcast mechanism. 4 L2 1.4.5

12
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 2. Network Layer – Queuing theory Planned Hours: 8 hrs

Learning Outcomes:-
At the end of the topic the student should be able to:

Topic Learning Outcomes COs BL PI Code

1. Understand the buffering and serving system of a router. 2 L2 1.4

2. Analyze performance of different buffering strategies by applying 2 L3 13.2

queuing theory.
3. Analyze various buffering systems: M/M/1 system, M/M/1/B system, 2 L3 13.2
M/M/m system.
4. Application of queuing systems in real world problems. 2 L3 13.2

Lesson Schedule
Class No. - Portion covered per hour
1. Router structure, Buffering strategies: Input queuing and output queuing
2. Understanding basics of queuing theory for performance of queuing mechanisms
3. Deriving performance metrics for an M/M/1 system
4. Deriving performance metrics for an M/M/1/B system
5. Understanding M/M/m systems
6. Applying queuing theory to analyze performance of real world problems

Review Questions
Sl.No. - Questions TLOs BL PI Code
1. What do you understand by a queue? Give some important applications 1 L2 1.4.5
of queuing theory.
2. Explain various components of Kendall notation. 2 L2 1.4.5

3. Derive equations for expected waiting time and expected response time 3 L3 13.2.5
of the server in an M/M/1 system.
4. Derive equations for expected waiting time, expected service time, and 4 L3 13.2.5
blocking probability in an M/M/1/B system.
5. A Television repairman finds that the time spent on his jobs has an 6 L3 13.2.5
exponential distribution with mean 30 minutes. If he repairs the sets in the order
in which they come in, and if the arrivals of sets are approximately Poisson with
an average rate of 10 per 8 hours per day, what is the repairs man idle time each
day? Find the expected number of units in the system and in the queue?

13
6. A two channel waiting line with Poisson arrival has a mean arrival rate of 6 L3 13.2.5
50 per hour and exponential service with a mean service rate of 75 per hour for
each channel. Find (i) The probability of the empty system. (ii) The probability
that an arrival in the system will have to wait.
7. Arrivals to a router with single core processor are Poisson distributed 6 L3 13.2.5
with a rate of 20 per minute. The average time for a packet to get service is 2
seconds and this time is exponentially distributed. What would be the average
waiting time of a packet in the system, average length of packets in the queue,
and average response time?
8. A small railway ticket booking office has two counters – Counter 1 for 6 L3 13.2.5
enquiry and Counter 2 for ticket booking. Customer arrival is Poisson at 5 per
hour to the enquiry and 10 per hour to the ticket booking counter. Exponentially
distributed service time in each counter is 4 minutes per customer. Find the
average waiting time of a customer.
9. In the above problem, find by how much the average waiting time of a 5 L3 13.2.5
customer in the system reduces at Counter 1 (original enquiry counter) when the
office decides to go for pooling of resources – i.e. an arriving customer will get
enquiry or ticket booking facility at any of the counters.

14
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 3.Data Link Layer Planned Hours: 8 hrs

Learning Outcomes:-
At the end of the topic the student should be able to:

TLO's CO's BL CA Code

1. Explain importance of error detection and correction. 3 L2 1.4

2. Illustrate error detection and correction mechanism using different 3 L3 2.2

techniques.
3. Explain the Link-Layer Protocol for Cable Internet Access. 3 L2 1.4

4. Compare and contrast ALOHA, CSMA/CD, and CSMA/CA for different 3 L3 2.2
networking scenarios.

Lesson Schedule

Class No. - Portion covered per hour

1. Introduction to the Link Layer

2. Error-Detection and -Correction Techniques
3. Parity Checks, Check summing Methods
4. Cyclic Redundancy Check (CRC)
5. Hamming Code
6. Multiple Access Links and Protocols: Channel Partitioning Protocols
7. Random Access Protocols: Aloha, Slotted Aloha, CSMA, CSMA/CD, CSMA/CA, Taking-Turns Protocols
8. The Link-Layer Protocol for Cable Internet Access

Review Questions
Sr.No. - Questions TLO BL PI Code

1. What is CRC? Explain with an example. Generate check bits for the 2 L2 2.2.3
following information 1100 and generator polynomial 1011.
2. A bit stream 10011101 is transmitted using the standard CRC method. 2 L3 2.2.3
The generator polynomial is x3 + 1. Show the actual bit string transmitted.
Suppose the third bit from the left is inverted during transmission. Show that this
error is detected at the receivers end.
3. Distinguish between forward errors corrections versus error correction 2 L3 2.2.3
by retransmission.
4. Suppose the information portion of a packet contains 7 bytes consisting 2 L2 2.2.3
of the 8-bit unsigned binary ASCII representation of string “network” Compute
the Internet checksum for this data.( Note: ASCII for ‘a’ is 0x61)
5. Differentiate between pure ALOHA and slotted ALOHA. Justify how 4 L3 2.2.3
slotted ALOHA is better than pure ALOHA.
6. Create Hamming code for the data “1011010”. If the sixth bit is flipped 2 L3 2.2.3
during the transmission, explain how error correction can be performed using
15
Hamming code.
7. Consider a 4-bit message which is to be transmitted as a 7-bit code word 2 L3 2.2.3
by including three parity bits. In general, this would be called a (7,4)
code. Determine the Hamming code for the message 1101.
8. Consider a 4-bit message which is to be transmitted as a 7-bit code word 2 L3 2.2.3
by including three parity bits. In general, this would be called a (7,4)
code. Suppose the message 1100110 is sent and a single bit error occurs
such that the Hamming code word 1110110 is received. Identify the
position of the bit to be corrected using Hamming code correction
technique.
9. Determine the hamming code distance between the two code words 2 L3 2.2.3
below:
0000000
0000111
10. Find the minimum Hamming code distance between the below code 2 L3 2.2.3
words:
A - 0000000
B - 0000111
C - 0011001
D - 0011110
E - 0101010
F - 0101101
11. The frames generated by active users of a wireless channel follow 4 L3 2.2.3
Poisson’s distribution. If T represents the frame time and G represents the mean
number of transmissions per frame time, what is the
i. Probability of k transmission attempts per frame time?
ii. When is the probability that 0 frames are generated in the collision duration in
pure ALOHA?
iii. What is the throughput of the pure ALOHA?
iv. Determine the throughput if the channel is accessed using slotted ALOHA.
12. Suppose four active nodes—nodes A, B, C and D—are competing for access to 4 3 2.2.3
a channel using slotted ALOHA. Assume each node has an infinite number of
packets to send. Each node attempts to transmit in each slot with probability p.
The first slot is numbered slot 1, the second slot is numbered slot 2, and so on.
What is the probability that node A succeeds for the first time in slot 5?

i. What is the probability that some node (either A, B, C or D) succeeds in

slot 4?
ii. What is the probability that the first success occurs in slot 3?
iii. What is the efficiency of this four-node system?
13. Assume that there are 4 active nodes, each of which has an infinite supply of 4 L3 2.2.3
frames they want to transmit, and these frames have a constant size of L bits. If
two or more frames collide, then all nodes will detect the collision. Given a
probability of transmission p = 0.2, what is the maximum efficiency in case of
pure ALOHA?

14. Assume that there are 3 active nodes, each of which has an infinite supply of 4 L3 2.2.3
frames they want to transmit, and these frames have a constant size of L bits. If
two or more frames collide, then all nodes will detect the collision. Given a
probability of transmission p = 0.34, what is the maximum efficiency in case of

16
slotted ALOHA?

15. Consider the figure below, which shows the arrival of 7 messages for 4 L3 2.2.3
transmission at different multiple access wireless nodes at times

t = <0.6, 1.2, 2.2, 3.1, 3.7, 3.8, 4.9> and each transmission requires exactly one
time unit.

a. Suppose all nodes are implementing the Aloha protocol. For each message,
indicate the time at which each transmission begins. Separate each value with a
comma and no spaces.

b. Which messages transmit successfully? Write your answer as a comma

separated list with no spaces using the messages' numbers.

16. Consider the figure below, which shows the arrival of 11 messages for 4 L3 2.2.3
transmission at different multiple access wireless nodes at times

t = <0.3, 0.7, 0.8, 1.2, 1.4, 2.3, 2.6, 2.7, 3.1, 3.3, 4.6> and each transmission
requires exactly one time unit.

a. Suppose all nodes are implementing the Slotted Aloha protocol. For each
message, indicate the time at which each transmission begins. Separate each
value with a comma and no spaces.

b. Which messages transmit successfully? Write your answer as a comma

separated list with no spaces using the messages' numbers

17. Suppose that a packet’s payload consists of 10 eight-bit values (e.g., 2 L3 2.2.3
representing ten ASCII-encoded characters) shown below. (Here, we have
arranged the ten eight-bit values as five sixteen-bit values):

Fig 1

10000011 01110101

01001101 00011010

01110010 01110001

01101010 11101011

11001111 00010111

17
Fig 2

Both the payload and parity bits are shown. One of these bits is flipped.

10100100 10100110 0

10000001 01100010 1

00100110 11101011 1

11000100 11101110 1

11000000 10101000 1

00010111 01101001 0

Fig 3

Both the payload and parity bits are shown; Either one or two of the bits have
been flipped.

00001101 11011100 1

00111000 11110010 0

01100001 11101010 1

10110001 00011000 0

00110000 00001000 1

11010100 11011100 1

a. For fig 1, compute the two-dimensional parity bits for the 16 columns.
Combine the bits into one string

b. For fig 1, compute the two-dimensional parity bits for the 5 rows (starting from
the top). Combine the bits into one string

c. For fig 1, compute the parity bit for the parity bit row from question a. Assume
that the result should be even.

d. For fig 2, indicate the row and column with the flipped bit (format as: x,y),
assuming the top-left bit is 0,0

e. For fig 3, is it possible to detect and correct the bit flips? Yes or No

18. Explain importance of error detection and correction 1 2 1.4.5

19. Explain the Link-Layer Protocol for Cable Internet Access. 3 2 1.4.5

18
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 4.Switched Local Area Networks Planned Hours: 8 hrs

Learning Outcomes:-
At the end of the topic the student should be able to:

TLO's CO's BL CA Code

1. Explain the link layer addressing and Address Resolution Protocol (ARP). 4 L2 1.4

2. Recognize the standards for VLANs using the different network devices. 4 L3 13.2

3. Discuss the importance of MPLS in forwarding the packets. 4 L2 1.4

4. Describe the mechanism of data center networking for various 4 L2 1.4

applications.

Lesson Schedule

Class No. - Portion covered per hour

1. Link-Layer Addressing
2. Address Resolution Protocol (ARP)
3. Ethernet and LAN standards
4. Link-Layer Switches
5. Virtual Local Area Networks (VLANs)
6. Multiprotocol Label Switching (MPLS)
7. Data Center Networking
8. Retrospective: A Day in the Life of a Web Page Request
Review Questions
Sr.No. - Questions TLO BL PI Code

1 What are some of the possible services that a link-layer protocol can 1 L2 1.4.5
offer to the network layer? Which of these link-layer services have corresponding
services in IP? In TCP?
2 Suppose that N switches supporting K VLAN groups are to be connected 2 L2 1.4.5
via a trunk protocol. How many ports are needed to connect the switches? Justify
your answer.
3 Describe the drawbacks identified in the configuration of VLAN’s. 2 L2 1.4.5

4 Discuss the structure of Ethernet frame with an example. 2 L2 1.4.5

5 Discuss the MPLS header located between link- and network-layer 3 L2 1.4.5

6 Describe the frame structure of MPLS 3 L2 1.4.5

19
7 Describe the working of data center network with a hierarchical topology 4 L2 1.4.5

8 Discuss the properties of the link layer switching. 1 L2 1.4.5

9. Consider the figure below. The IP and MAC addresses are shown for nodes A, 2 L3 13.2.2
B, C and D, as well as for the router's interfaces.

Consider an IP datagram being sent from node C to node A.

1. What is the source mac address at point 6?

2. What is the destination mac address at point 6?

3. What is the source IP address at point 6?

4. What is the destination IP address at point 6?

5. Do the source and destination mac addresses change at point 4? Answer with
yes or no, and provide justification.

6. Do the source and destination mac addresses change at point 2? Answer with
yes or no, and provide justification.

7. What is the source mac address at point 2?

8. What is the destination mac address at point 2?

9. Do the source and destination mac addresses change at point 1? Answer with
yes or no, and provide justification.

10. Consider the LAN below consisting of 10 computers connected by two self- 2 L3 13.2.2
learning Ethernet switches. At t=0 the switch table entries for both switches are
empty. At t = 1, 2, 3, and 4, a source node sends to a destination node as shown
below, and the destination replies immediately (well before the next time step).

20
Assume that the following transmissions occur (the transmissions in reply occur
but are not shown in the list below):

t=1: G -> K

t=2: C -> L

t=3: I -> C

t=4: G -> C

Fill out the two switch tables and answer the questions below. Format your
answer as letter, number or 'n/a'

1. At t=1, what is the source entry for switch 1?

2. At t=1, what is the destination entry for switch 1?
3. At t=1, what is the source entry for switch 2?
4. At t=1, what is the destination entry for switch 2?
5. At t=2, what is the source entry for switch 1?
6. At t=2, what is the destination entry for switch 1?
7. At t=2, what is the source entry for switch 2?
8. At t=2, what is the destination entry for switch 2?
9. At t=3, what is the source entry for switch 1?
10. At t=3, what is the destination entry for switch 1?
11. At t=3, what is the source entry for switch 2?
12. At t=3, what is the destination entry for switch 2?
13. At t=4, what is the source entry for switch 1?
14. At t=4, what is the destination entry for switch 1?
15. At t=4, what is the source entry for switch 2?
16. At t=4, what is the destination entry for switch 2?

21
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 5. Wireless and Mobile networks Planned Hours: 4 hrs

Learning Outcomes:-
At the end of the topic the student should be able to:

TLO's CO's BL CA Code

1. Explain the wireless network characteristics and wireless network 5 L2 1.4

architecture.
2. Describe the IEEE standard protocols used in wireless communication. 5 L2 1.4

3. Discuss various protocol used in personal area networks. 5 L2 1.4

4. Describe the different characteristics of internet access in cellular 5 L2 1.4

networks.

Lesson Schedule

Class No. - Portion covered per hour

1. Wireless Links and Network Characteristics, 802.11 Wireless LANs.

2. Architecture 802.11 and MAC protocol, Frame, Mobility.
3. Personal Area Networks: Bluetooth and Zigbee.
4. Cellular Networks and Internet Access, Mobility, Mobile IP, Managing Mobility in Cellular Network.
Review Questions
Sr.No. - Questions TLO BL PI Code

1. What does it mean for a wireless network to be operating in 1 L2 1.4.5

“infrastructure mode?” If the network is not in infrastructure mode, what mode
of operation is it in, and what is the difference between that mode of operation
and infrastructure mode?
2. What are the differences between a master device in a Bluetooth 3 L3 1.4.5
network and a base station in an 802.11 network?
3. What is meant by a super frame in the 802.15.4 Zigbee standard? 3 L2 1.4.5

4. What are the differences between the following types of wireless 1 L2 1.4.5
channel impairments: path loss, multipath propagation, interference from other
sources?
5. What is the role of the anchor MSC in GSM networks? 3 L2 1.4.5

6. What are the purposes of the HLR and VLR in GSM networks? What 2 L2 1.4.5
elements of mobile IP are similar to the HLR and VLR?

22
 Chapter wise Plan

Course Code and Title: 23ECSC303 / Computer Networks-2

Chapter Number and Title: 6: Multimedia Networking Planned Hours: 4 hrs

Learning Outcomes:-
At the end of the topic the student should be able to:

Topic Learning Outcomes COs BL CA Code

1. Explain the different multimedia networking applications. 5 L2 1.4

2. Describe the different mechanisms for streaming stored videos. 5 L2 1.4

3. Discuss advantages of Voice over IP mechanism. 5 L2 1.4

4. Explain the various protocols for real-time conversational applications. 5 L2 1.4

Lesson Schedule

Class No. - Portion covered per hour

1. Multimedia Networking Applications

2. Streaming Stored Video
3. Voice-over-IP
4. Protocols for Real-Time Conversational Applications

.Review Questions

Sl.No. - Questions TLOs BL PI Code

1. What is the difference between end-to-end delay and packet jitter? 1 L2 1.4.5
What are the causes of packet jitter?
2. Why is a packet that is received after its scheduled play out time 3 L2 1.4.5
considered lost?
3. Describe the transmission rate of the stream by adding overhead. Does 3 L2 1.4.5
interleaving also increase the transmission rate? Justify
4. How are different RTP streams in different sessions identified by a 2 L2 1.4.5
receiver? How are different streams from within the same session identified?

23
 Model Question Paper for In Semester Assessment (ISA-1)
Course Code: 23ECSC303 Course Title: Computer Networks-2

Duration 75 Mins
Max. Marks 40
Note: Answer any 2 full Questions. Each full question carries 20 marks
Q.No Questions Marks CO BL PO PI
Code
Explain with diagram broadcast routing algorithm which prevents 6 1 L2 1 1.4.5
1a broadcast storms and completely avoids transmission of redundant
packets.

b Explain the following Kendall’s queuing model notations 6 2 L2 1 1.4.5

D/G/c/∞/∞/FCFS, M/M/m/∞/∞/LCFS and D/M/1/∞/∞.
Compare Link state and Distance vector routing algorithms. 8 1 L3 1 2.2.3

Consider the network shown in Figure 1. Distance vector routing is

used, and the following vectors have just come in to router C: from
B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3,
9, 0, 4). The cost of the links from C to B, D, and E, are 6, 3, and 5,
respectively. What is C’s new routing table? Give both the outgoing
link to use and the cost.
c

Figure 1 Network Topology

In a public telephone booth, the average arrival rate of callers is 15 6 2 L3 1 1.4.5

per hour. Each call, on average, lasts for 3 minutes. Assuming there
is only one phone in the booth, answer the following:
2a i. Calculate the expected number of callers in the booth at
any given time.
ii. Determine the proportion of time the booth is expected to
be idle.
Consider the network shown in Figure 2. With the indicated link 6 1 L3 1 3.3.1
b costs, use Dijkstra’s shortest-path algorithm to compute the
shortest path from u to all network nodes.

24
 Figure 2 Network Topology

In a supermarket, two cashiers handle sales at the counters. The 8 2 L3 1 2.2.3

service time for each customer follows an exponential distribution
with a mean of 4 minutes. Customers arrive at the counters in a
Poisson fashion at a rate of 10 per hour. Answer the following:
c i. Determine the expected percentage of idle time for each
cashier.
ii. Calculate the expected waiting time for a customer in the
system.
iii. Find the probability that a customer must wait for service.
Describe an example of M/M/1/B/∞ queuing model applied at the 6 2 L2 1 1.4.5
3a router. Write an expression for Ls, Lq, Ws and Wq for M/M/1/B/∞
model.
At Hubballi railway station, trains arrive at the yard every 10 6 2 L3 1 1.4.5
minutes, and the service time for each train is 25 minutes. The line
b capacity of the yard is 8 trains. Answer the following:
i. Determine the probability that the yard is empty.
ii. Calculate the average number of trains in the system.
Explain with diagram the effectiveness of hierarchical routing in 8 1 L3 1 3.3.1
c mitigating the burden on routers. Additionally, evaluate the
necessity of implementing hierarchical routing within the network
infrastructure of KLE Tech campus.

25
 Model Question Paper for In Semester Assessment (ISA-2)
Course Code: 23ECSC303 Course Title: Computer Networks-2

Duration 75 Mins
Max. Marks 40
Note: Answer any 2 full Questions. Each full question carries 20 marks
Q.No Questions Marks CO BL PO PI
Code
Consider a 4-character string "TEST". Each character is represented 6 3 L3 1 1.4.5
by its 7-bit ASCII value. Calculate the 2D parity bits (both row and
column parity bits) for error detection and correction.
1a Suppose a single bit error occurs in the fifth bit of the third row
(changing it from 0 to 1). Demonstrate how the parity bits can be
used for error detection and correction if a single bit error occurs.
Note: ASCII value of 'T' = 84, 'E' = 69 and 'S' = 83.

Given the data word 1010011110 and the generator is x4 + x2 +x +1. 6 3 L3 13 13.2.5
i. Show the generation of the code word at the sender site
b
using binary division.
ii. What is the syndrome at the receiver end if the data word
has an error in the 5th bit position counting from the right?
Describe the process by which a self-learning switch builds the switch 8 4 L3 2 2.2.3
forwarding table.
Consider the LAN in Fig 1, consisting of 10 computers connected by
two self-learning Ethernet switches. At t=0 the switch table entries
for both switches are empty. At t = 1, 2, and 3, a source node sends
to a destination node as shown below, and the destination replies
immediately. Assume that the following transmissions occur (the
transmissions in reply occur but are not shown in the list below):
t=1: B -> K
t=2: E -> J
t=3: H -> L
Fill out the two switch tables and answer the questions below.

Fig 3. Local Area Network Topology.

a) At t=1, determine the source and destination entry for switch 1
and switch 2.
b) At t=2, determine the source and destination entry for switch 1
and switch 2.
c) At t=3, determine the source and destination entry for switch 1
and switch 2.
26
2a Explain with diagram FDDI and Token Ring LAN standards. 6 4 L2 2 2.2.3

Briefly explain ARP. Why is an ARP query sent within a broadcast 6 4 L3 2 2.2.3
frame?
Consider the Fig 2. The IP and MAC addresses are shown for nodes A,
B, C and D, as well as for the router's interfaces. Consider an IP
datagram being sent from node A to node B.

Fig 4. Network Topology.

a) Determine the source and destination MAC address at point 1.

b) Determine the source and destination IP address at point 1.
c) Do the source and destination MAC addresses change at point
2? Justify.
d) Do the source and destination MAC addresses change at point
3? Answer with yes or no and provide justification.
Differentiate between the Slotted ALOHA and Pure ALOHA protocol. 8 3 L3 1 1.4.5
Consider the Fig 3, which shows the arrival of 5 messages for
transmission at different multiple access nodes at times t = <0.9, 1.2,
2.1, 3.1, 4.4> and each transmission requires exactly one time unit.

Fig 5. Multiple Access Protocol.

c
Suppose all nodes are implementing the Aloha protocol. For each
message, indicate the time at which each transmission begins. Which
messages transmit successfully? Write your answer using the
messages' numbers.
Suppose all nodes are implementing the Slotted Aloha protocol. For
each message, indicate the time at which each transmission begins.
Which messages transmit successfully? Write your answer using the
messages' numbers
3a Explain MPLS header format. With example describe the working of 6 4 L2 1 1.4.5
MPLS along with its forwarding table.
b Justify your answer “VLAN reduces Broadcasting”. 6 4 L2 1 1.4.5

What is Hamming code? Use the hamming code technique to 8 3 L3 13 13.2.2

c
calculate the code word for 1011101. If the fifth bit is flipped during
the transmission, explain how the receiver can do error correction.

27
 Model Question Paper for End Semester Assessment (ESA)
Course Code: 23ECSC303 Course Title: Computer Networks-2
Duration: 3hrs
Max. Marks 100
Note: : Answer Five Questions: Any two full questions from each Unit I & Unit II and one full question from
Unit III
UNIT
Q.N Questions Marks CO BL PO PI
o Code
1a Explain the Bellman-Ford algorithm with an example. 6 1 L2 1 1.4.5

Derive equations for expected waiting time, response time, number of 6 2 L2 1 1.4.5
b jobs waiting in a queue, and probability that a packet is dropped in an
M/M/1/B system.
i. A small railway ticket booking office has two counters – Counter 1 for 8 2 L3 1 2.2.3
enquiry and Counter 2 for ticket booking. Customer arrival is Poisson at
5 per hour to the enquiry and 10 per hour to the ticket booking
counter. Exponentially distributed service time in each counter is 4
c minutes per customer. Find the average waiting time of a customer.
ii. In the above problem, find by how much the average waiting time of
a customer in the system reduces at Counter 1 (original enquiry
counter) when the office decides to go for pooling of resources – i.e. an
arriving customer will get enquiry or ticket booking facility at any of the
counters.
Differentiate M/M/1 system, M/M/1/B, and M/M/m systems with 6 2 L3 1 1.4.5
2a respect to their working and their performances. Give appropriate
justification.
Consider the network topology illustrated in figure 1 and assume that 6 1 L3 1 3.3.1
each node initially knows the cost to each of its neighbors. Apply DV
algorithm to determine the distance table entries at each node.

2
b A B

3 8
C

Figure 1: Network Topology

What is the difference between a group-shared tree and a source- 8 1 L3 1 2.2.3

c based tree in the context of multicast routing? Explain with relevant
diagrams.

28
 What do you understand by a queue? Give some important 6 2 L2 1 1.4.5
3a
applications of queuing theory. Explain components used in Kendall’s
notation.
A two channel waiting line with Poisson arrival has a mean arrival rate 6 2 L3 1 1.4.5
b of 50 per hour and exponential service with a mean service rate of 75
per hour for each channel. Find (i) The probability of the empty system.
(ii) The probability that an arrival in the system will have to wait.
Write a link-state routing algorithm to calculate shortest path. Apply 8 1 L3 1 3.3.1
the same algorithm for the network topology illustrated in figure 2 and
compute the shortest path from w to all network nodes.

Figure 2: Network Topology

UNIT-II

Suppose the information portion of a packet contains 7-bit ASCII 6 3 L3 1 1.4.5

4a representation of string “data”. Compute the Internet checksum for
this data.
Note: ASCII value for ‘a’ is 61.
Given the data word 1010011110 and the generator is x4 + x2 +x +1. 6 3 L3 13 13.2.5
Show the generation of the code word at the sender site using binary
b
division.
What is the syndrome at the receiver end if the data word has an error
in the 5th bit position counting from the right?
Describe the process by which a self-learning switch builds the switch 8 4 L3 2 2.2.3
forwarding table.
Consider the LAN in Fig 1, consisting of 10 computers connected by two
self-learning Ethernet switches. At t=0 the switch table entries for both
switches are empty. At t = 1, 2, and 3, a source node sends to a
destination node as shown below, and the destination replies
c
immediately (well before the next time step). Assume that the
following transmissions occur (the transmissions in reply occur but are
not shown in the list below):
t=1: B -> K
t=2: E -> J
t=3: H -> L
Fill out the two switch tables and answer the questions below.

29
 Fig 6. Local Area Network Topology.
At t=1, determine the source and destination entry for switch 1.
At t=1, determine the source and destination entry for switch 2.
At t=2, determine the source and destination entry for switch 1.
At t=2, determine the source and destination entry for switch 2.
At t=3, determine the source and destination entry for switch 1.
At t=3, determine the source and destination entry for switch 2.
5a Explain with diagram FDDI and Token Ring LAN standards. 6 4 L2 2 2.2.3

i. Briefly explain ARP. Why is an ARP query sent within a 6 4 L3 2 2.2.3

broadcast frame?
ii. Consider the Fig 2. The IP and MAC addresses are shown for
nodes A, B, C and D, as well as for the router's interfaces.
Consider an IP datagram being sent from node A to node B.

Fig 7. Network Topology.

Determine the source and destination MAC address at point 1.

Determine the source and destination IP address at point 1.
Do the source and destination MAC addresses change at point 2?
Answer with yes or no and provide justification
Do the source and destination MAC addresses change at point 3?
Answer with yes or no and provide justification.
Differentiate between the Slotted ALOHA and Pure ALOHA protocol. 8 3 L3 1 1.4.5
c Consider the Fig 3, which shows the arrival of 5 messages for
transmission at different multiple access nodes at times t = <0.9, 1.2,
2.1, 3.1, 4.4> and each transmission requires exactly one time unit.

30
 Fig 8. Multiple Access Protocol.

a) Suppose all nodes are implementing the Aloha protocol. For each
message, indicate the time at which each transmission begins.
Which messages transmit successfully? Write your answer using
the messages' numbers
b) Suppose all nodes are implementing the Slotted Aloha protocol.
For each message, indicate the time at which each transmission
begins. Which messages transmit successfully? Write your answer
using the messages' numbers
6a Explain MPLS header format. With example describe the working of 6 4 L2 1 1.4.5
MPLS along with its forwarding table.
b Describe the working of data center network with a hierarchical 6 4 L2 1 1.4.5
topology.
Create Hamming code for the data “1011011”. If the fifth bit in the 8 3 L3 13 13.2.2
c
hamming code is flipped during the transmission, explain how error
correction can be performed.
UNIT III

What does it mean for a wireless network to be operating in 1.4.5

7a “infrastructure mode?” If the network is not in infrastructure mode,
10 5 L2 1
what mode of operation is it in, and what is the difference between
that mode of operation and infrastructure mode?

b What are the differences between a master device in a Bluetooth 1.4.5

10 5 L2 1
network and a base station in an 802.11 network?
What is the difference between end-to-end delay and packet jitter? 1.4.5
8a 10 5 L2 1
What are the causes of packet jitter?

Why is a packet that is received after its scheduled play out time
b 10 5 L2 1 1.4.5
considered lost?

31