INFORMATION TECHNOLOGY-IT1

SEMESTER I

Discipline: INFORMATION TECHNOLOGY

Stream : IT1
 INFORMATION TECHNOLOGY-IT1

CODE COURSE NAME CATEGORY L T P CREDIT

MATHEMATICAL FOUNDATION DISCIPLINE 3 0 0 3
221TIT100
FOR NETWORKS AND SECURITY CORE

Preamble: The students are expected to learn fundamentals of mathematical concepts used to design
and analyse network and security protocols. These concepts will help them to develop network and
security models and analyse them before being used in various applications.

Course Outcomes: After the completion of the course the student will be able to

CO 1 Apply the fundamental mathematical concepts in Symmetric-Key cryptography (Level : Apply)

CO 2 Apply the fundamental mathematical concepts in Asymmetric- Key cryptography (Level : Apply)

CO 3 Apply the fundamental concepts in graph theory (Level : Apply)

CO 4 Identify an appropriate probability distribution and solve problems related to a given discrete or
continuous random variable and use its properties to calculate probabilities. (Level : Apply)

CO 5 Solve statistics such as the mean and variance of common probability distributions (Level : Apply)

CO 6 Solve queueing theory problems along with the stochastic processes techniques useful for
modelling queueing systems and queueing networks (Level : Apply)

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1 √ √ √ √ √ √
CO 2 √ √ √ √ √ √
CO 3 √ √ √ √ √
CO 4 √ √ √ √ √
CO 5 √ √ √ √ √ √

CO 6 √ √ √ √ √ √
 INFORMATION TECHNOLOGY-IT1
Assessment Pattern

Bloom’s Category End Semester Examination

Apply 100%
Analyse 0%
Evaluate 0%
Create 0%

Mark distribution

Total Marks CIE ESE ESE Duration

100 40 60 2.5 hours

Continuous Internal Evaluation (CIE) Pattern:

Micro project/Course based project: 20 Marks

Course-based task/Seminar/Quiz: 10 Marks

Test paper (one only): 10 Marks

The project shall be done individually. Group projects are not permitted. The test paper shall
include a minimum of 80% of the syllabus.

End Semester Examination Pattern: The End-Semester Examination shall be conducted by the
University. There shall be two parts; Part A and Part B. Part A shall contain five (numerical) questions
(such questions shall be useful in the testing of knowledge, skills, comprehension, application,
analysis, synthesis, evaluation, and understanding of the students), with one question from each
module, having five marks for each question. Students shall answer all questions. Part B shall contain
seven questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical knowledge,
derivations, problem-solving, and quantitative evaluation), with at least one question from each
module, of which, the student shall answer any five. Each question shall carry seven marks
 INFORMATION TECHNOLOGY-IT1
MODEL QUESTION PAPER FOR END-SEMESTER EXAMINATION

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Each question carries 5 marks)

1. a. Find the multiplicative inverse of 11 in Z26? (2 Marks)

b. In GF(24), find the inverse of (x2+1) modulo (x4+x+1) (3 Marks)

2. Does the number 561 pass the Miller-Rabin test? (5 Marks)

3. In a given connected weighted graph G, suppose there exists an edge es whose weight is smaller than
that of any other in G. Prove that every shortest spanning tree in G must contain es.
(5 Marks)

4. Let X and Y be independent random variables, each havingan exponential distribution with parameter
a. Find the density function of Z = X + Y. (5 marks)

5. Consider a small post office in a village where on the average 70 customers arrive according to a
Poisson process during a day. Let us assume that the service times are exponentially distributed with
rate 10 clients per hour and the office operates 10 hours daily. Find the mean queue length, and the
probability that the number of waiting customer is greater than 2. What is the mean waiting time and
the probability that the waiting time is greater than 20 minutes?
(5 Marks)

PART B (Answer any five questions. Each question carries 7 marks)

6. a. Find the particular and general solutions to the equation 21x + 14y = 35 (4 Marks)

b. Using the Euclidean algorithm, find the Greatest Common Divisor of the following pairs of

integers:

a. 88 and 220

b. 401 and 700 (3 Marks)

7. a. Use the trial division algorithm to find the factors of 1233 (3 Marks)

b. Find xin4 ≡ 3𝑥 (𝑚𝑜𝑑 7) (4 Marks)

8. Calculate 1722 mod 21 using square-and-multiply algorithm (7 marks)

9. a. In a graph G let 𝑝1 and 𝑝2 be two different paths between two givenvertices. Prove that 𝑝1 ⊕ 𝑝2 is

a circuit or a set of circuits in G. (5 Marks)

b. Is the graph Gꞌ a subgraph of G?

 INFORMATION TECHNOLOGY-IT1

(2 Marks)

10. Let X be the continuous random variable with density function 𝑓 defined by

0 𝑓𝑜𝑟 𝑥 < 1
𝑓 (𝑥 ) = { 1
𝑓𝑜𝑟 𝑥 ≥ 1
𝑥2

Analyse the existence of higher order moments. (7 Marks)

11. Let X and Y be independent random variables, each having an exponential distribution with parameter
a. Find the density function. (7 Marks)

12. 14. Traffic to a message switching centre for one of the outgoing communication lines arrives in a
random pattern at an average rate of 240 messages per minute. The line has a transmission rate of 800
characters per second. The message length distribution (including control characters) is approximately
exponential with an average length of 176 characters. Calculate the principal statistical measures of
system performance assuming that a very large number of message buffers are provided. What is the
probability that 10 or more messages are waiting to be transmitted?
(7 marks)
 INFORMATION TECHNOLOGY-IT1
SYLLABUS

Module I: Mathematics of Cryptography I (6 Hours)

Greatest common divisor- GCD, Euclidean algorithm Fundamental theorem of arithmetic, Linear Diophantine
Equations, Integer arithmetic, Modular arithmetic, Matrices, Linear congruences, Algebraic structures, GF(2n)
Fields

Module II: Mathematics of Cryptography II (10 Hours)

Prime numbers, Fermat’s and Euler’s Theorem, Generating Primes, Primality Testing: Deterministic
algorithms, Probabilistic algorithms, Quadratic Congruences- Quadratic Residues, The Legendre Symbol,
Quadratic Reciprocity, The Jacobi Symbol, Factorization: Factorization methods- Trial division method, Fermat
method, Pollard p-1 method, Pollard Rho method, Exponentiation and Logarithm: Square-and -multiply
algorithm, Discrete Logarithm, Solution to modular logarithm using Discrete Logs

Module III: Graph Theory and Applications (8 Hours)

What is a Graph? Application of Graphs, Finite and Infinite Graphs, Incidence and Degree, Isolated Vertex,
Pendant Vertex, and Null Graph. PATHS AND CIRCUITS – Isomorphism, Subgraphs, Walks, Paths, and
Circuits, Connected Graphs, Disconnected Graphs, and Components, Euler Graphs, Operations on Graphs,
More on Euler Graphs, Hamiltonian Paths and Circuits, The Travelling Salesman Problem, Trees And
Fundamental Circuits – Trees, Properties of Trees, Pendant Vertices in a Tree, Distance and Centers in a Tree,
Rooted and Binary Trees, On Counting Trees, Spanning Trees, Fundamental Circuits, Finding All Spanning
Trees of a Graph, Spanning Trees in a Weighted Graph.

Module IV: Random Variables and Distributions (8 Hours)

The Concept of a Random Variable – Introduction, Distribution and Density Functions, Specific Random
Variables, Conditional Distributions, Asymptotic Approximations for Binomial Random Variable, Functions of
One Random Variable - The Random Variable g(x), The Distribution of g(x), Mean and Variance, Moments,
Characteristic Functions, Two Random Variables - Bivariate Distributions, One Function of Two Random
Variables, Two Functions of Two Random Variables, Joint Moments, Joint Characteristic Functions,
Conditional Distributions, Conditional Expected Values.

Module V: Queuing Models (8 Hours)

General concepts, Arrival pattern, service pattern, Queue Disciplines, FIFO Queuing systems, M/M/1, M/M/c,
M/M/∞, M/G/1, M/M/m/m Markov models, non-Markov models, Network queues, Burke’s theorem, Jackson’s
theorem.

Reference Books
1. Behrouz A. Fourouzan, Debdeep Mukhopadhyay “ Cryptography and Network Security”, Second Edition,
Tata McGrawHill Education

2. Thomas Koshy, “Elementary Number Theory with Applications” Second Edition, Elsevier Science, 2007

3. Judith L. Gersting, “Mathematical Structures for Computer Science - Discrete Mathematics and Its
Applications”, 7e, W. H. Freeman and Company, 2014

4. Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics”, 5th edition, Pearson, 2018

5. Arnold O. Allen, “Probability, Statistics, and Queuing Theory with Computer Science Applications”,
Elsevier Inc, 1990

6. eth H. Rosen, “Elementary Number Theory and its Applications” Addison-Wesley Publishing
Company,1986
 INFORMATION TECHNOLOGY-IT1
7. Nitis Mukhopadhyay, “Probability and Statistical Inference”, Library of Congress Cataloging-in-
Publication Data, Marcel Dekker, Inc. 2000

8. Gary Haggard, John Schlipf, Sue Whitesides, “Discrete Mathematics for Computer Science”, Thomson
Brooks/Cole, 2006.

9. K.S. Trivedi, “Probability and Statistics with Reliability, Queueing and Computer Science Applications”,
John Wiley and Sons, 2nd edition, 2002.

10. J.F. Shortle, J.M. Thompson, D. Gross and C.M. Harris, Fundamentals of Queueing Theory, 5th Edition,
Wiley, 2018

COURSE PLAN

No Topic No. of Lectures

1 Mathematics of Cryptography I

1.1 Greatest common divisor- GCD, Euclidean algorithm Fundamental 1 Hour

theorem of arithmetic, Linear Diophantine Equations
1.2 Linear Diophantine Equations 1 Hour
1.3 Integer arithmetic, Modular arithmetic, Matrices, Linear congruences 1 Hour

1.4 Matrices, Linear congruences 1 Hour

1.5 Algebraic structures 1 Hour

1.6 GF(2n) Fields 1 Hour
2 Mathematics of Cryptography II
2.1 Prime numbers, Fermat’s Theorem 1 Hour

2.2 Euler’s Theorem, Generating Primes 1 Hour

2.3 Primality Testing: Deterministic algorithms 1 Hour

2.4 Probabilistic algorithms 1 Hour
2.5 Quadratic Congruences- Quadratic Residues, The Legendre Symbol 1 Hour
2.6 Quadratic Reciprocity, The Jacobi Symbol 1 Hour
2.7 Factorization: Factorization methods- Trial division method 1 Hour
2.8 Fermat method, Pollard p-1 method, Pollard Rho method 1 Hour
2.9 Exponentiation and Logarithm: Square-and -multiply algorithm 1 Hour
2.10 Discrete Logarithm, Solution to modular logarithm using Discrete Logs 1 Hour

3 Graph Theory and Applications

3.1 Introduction - What is a Graph? Application of Graphs, Finite and 1 Hour
Infinite Graphs, Incidence and Degree, Isolated Vertex, Pendant Vertex,
and Null Graph.
3.2 Paths and Circuits – Isomorphism, Subgraphs, A Puzzle With 1 Hour
Multicolored Cubes, Walks, Paths, and Circuits
3.3 Connected Graphs, Disconnected Graphs, and Components, Euler 1 Hour
Graphs, Operations On Graphs, More on Euler Graphs
3.4 Hamiltonian Paths and Circuits, The Traveling Salesman Problem 1 Hour
3.5 Trees And Fundamental Circuits – Trees, Properties of Trees, Pendant 1 Hour
Vertices in a Tree
 INFORMATION TECHNOLOGY-IT1
3.6 Distance and Centers in a Tree, Rooted and Binary Trees, On Counting 1 Hour
Trees

3.7 Spanning Trees, Fundamental Circuits, Finding All Spanning Trees of a 2 Hours
Graph, Spanning Trees in a Weighted Graph
4 Random Variables and Distributions
4.1 The Concept of a Random Variable – Introduction, Distribution and 1 Hour
Density Functions, Specific Random Variables
4.2 Conditional Distributions, Asymptotic Approximations for Binomial 1 Hour
Random Variable
4.3 Functions of One Random Variable - The Random Variable g(x) 1 Hour
4.4 The Distribution of g(x) 1 Hour
4.5 Mean and Variance, Moments, Characteristic Functions 1 Hour
4.6 Two Random Variables - Bivariate Distributions 1 Hour
4.7 One Function of Two Random Variables, Two Functions of Two 1 Hour
Random Variables
4.8 Joint Moments, Joint Characteristic Functions, Conditional 1 Hour
Distributions, Conditional Expected Values
5 Queuing Models
5.1 General concepts, Arrival pattern, service pattern 1 Hour
5.2 Queue Disciplines, FIFO Queuing systems 1 Hour
5.3 M/M/1, M/M/c 1 Hour
5.4 M/M/∞, M/G/1 1 Hour
5.5 M/M/m/m and other Markov models, 1 Hour
5.6 Non-Markov models 1 Hour
5.7 Network queues. 1 Hour
5.8 Burke’s theorem, Jackson’s theorem 1 Hour
 CODE COURSE NAME CATEGORY L T P CREDIT
ADVANCED COMPUTER ION TECHNOLOGY-IT1
INPFROORGMRAATM
221TIT001 3 0 0 3
NETWORKS CORE 1

Preamble: The students are expected to understand and analyze the protocols used in various
layers of the network stack.

Course Outcomes: After the completion of the course the student will be able to

CO 1 Explain the working of application layer protocols.(Level: Understand)

CO 2 Analyze the transport protocols used on the internet. (Level: Analyze)
CO 3 Describe IPv6, multicast, and flow-based routing protocols. (Level: Understand)
CO 4 Analyze the protocols used in the link layer.(Level: Analyze)
CO 5 Apply error detection and error correcting codes.(Level: Apply)
CO 6 Summarize network management and transport and network services for multimedia
applications.(Level: Understand)

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor’s program

PO4: An ability to apply stream knowledge to design or develop solutions for real-world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.

PO6: An ability to engage in life-long learning for the design and development related to the
stream-related problems taking into consideration sustainability, societal, ethical and
environmental aspects

PO7: An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.
 INFORMATION TECHNOLOGY-IT1
Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1
CO 2
CO 3
CO 4
CO 5
CO 6

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 80
Analyse 20
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

Continuous Internal Evaluation Pattern:

Micro project/Course based project: 20 Marks

Course-based task/Seminar/Quiz: 10 Marks

Test paper (one only): 10 Marks

The project shall be done individually. Group projects are not permitted. The test paper
shallinclude a minimum of 80% of the syllabus.
End Semester Examination Pattern:

There shall be two parts; Part A and Part B. Part A shall contain five (numerical) questions
(such questions shall be useful in the testing of knowledge, skills, comprehension,
application, analysis, synthesis, evaluation, and understanding of the students), with one
question from each module, having five marks for each question. Students shall answer all
questions. Part B shall contain seven questions (such questions shall be useful in the testing
of overall achievement and maturity of the students in a course, through long answer
questions relating to theoretical/practical knowledge, derivations, problem-solving, and
quantitative evaluation), with at least one question frIoNmFO
eaR
chMm
AoTdIO
ulN
e, T
oE
fC
wHhiN
chO, LthOeGstYu-dIeTn1t
shall answer any five. Each question shall carry seven marks.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What are the components in a content distribution network?

2. When an HTTP server initiates a close() at its end of a connection, it must then wait in TCP
state FIN WAIT 2 for the client to close the other end. What mechanism within
the TCP protocol could help an HTTP server deal with non-cooperative or poorly
implemented clients that don’t close from their end?

3.Explain the message structure of SOAP

Course Outcome 2 (CO2)

1. Assuming that loss occurs during the first slow-start and that the file transfer is long
enough, obtain the duration of the second slow-start and the number of packets transmitted
during it.

2.Derive the packet throughput if the TCP receiver returns a cumulative ACK for every bth
packet.

3.Explain the features of datagram congestion control protocol

Course Outcome 3(CO3):

1. What is MPLS?

2.Explain the format of route table entry in a RIPng message

3.How do routers that use reverse path multicasting learn about the location of group
members?

Course Outcome 4 (CO4):

1. Derive the expression to compute the throughput of unslotted ALOHA

2. For a time-slotted network, where the slots are small compared with the packet lengths,
consider the following variation of slotted Aloha. When a node has a packet to transmit, it
begins transmission at the beginning of a slot. If there was no collision in the first slot, then it
has captured the next X − 1 slots, where X is the packet transmission time and all other
stations will defer. If there was a collision in the first slot, then the node makes a randomized
retransmission attempt (as in slotted Aloha) and continues to do so until it succeeds. All nodes
will know of the end of transmission of this packet when they sense the channel idle again. If
slotted Aloha with an adaptive protocol were to yield a throughput of η when the packet
length is equal to the slot length, what would be the throughput of this network? Note the
similarities with the CSMA/CD protocol.
 INFORMATION TECHNOLOGY-IT1
3. Show that for unslotted CSMA/CD, the maximum interval of time over which a
transmitting node can hear a collision is 2β, where β is the propagation delay.

Course Outcome 5 (CO5):

1. Show that the final parity check in a horizontal and vertical parity check code, if taken as
the modulo 2 sum of all the data bits, is equal to the modulo 2 sum of the horizontal parity
checks and also equal to the modulo 2 sum of the vertical parity checks.

2. Let g(D) = D4 + D2 + D + I, and let s(D) = D3 + D + I. Find the remainder when

D4 s(D) is divided by g(D), using modulo 2 arithmetic.

3. Explain how error correction is done by hamming codes

Course Outcome 6 (CO6):

1. List the disadvantages of UDP streaming

2. What is the role of a SIP registrar?

3. Explain the RTP packet header fields

Model Question Paper
INFORMATION TECHNOLOGY-IT1
A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY
M.TECH DEGREE EXAMINATION
……SEMESTER
Branch:

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Each question carries 5 marks)

1. What is the difference between persistent HTTP with pipelining and persistent HTTP
without pipelining? Which of the two is used by HTTP/1.1?

2. How does TCP prevent a fast transmitter from flooding a slow receiver that has
limited storage?

3. Explain the features of multicast routing

4. Compare pure ALOHA and slotted ALOHA

5. List the audio and video file formats supported by RTP

PART B (Answer any five questions. Each question carries 7 marks)

6. Explain the working of DNS

7. Explain DCCP in detail

8. What are the measures taken by TCP to control congestion?

9. Prove that the maximum throughput for pure ALOHA is 1

2𝑒

10. Explain the encoding and decoding of low-density parity codes

11. What is MPLS? What are the advantages of MPLS routing over conventional routing?

12. Explain the standard SNMP model in detail.

 Syllabus
INFORMATION TECHNOLOGY-IT1
Module I: Introduction (7 Hours)

Computer Networks and Internet – Network edge, network core, Delay, loss, and throughput
in packet-switched networks, protocol layers, and their service model. Application Layer –
Principles of network applications – network application architectures, process
communication, Web and HTTP, FTP, Email – SMTP, MIME, POP3, IMAP, DNS, Custom
application protocols (WSDL, SOAP), Generic application protocol (REST), Overlay
networks – routing overlays, Peer-to-peer applications(P2P file distribution, BitTorrent,
distributed hash tables), content distribution networks

Module II: Transport Layer (8 Hours)

Internet’s adaptive window protocol TCP: slow start and congestion avoidance, receiver
buffer and cumulative ACKs, packet loss recovery and congestion control, single connection:
analysis with buffer overflow (analysis of slow start phase, short transfer throughput, slow
start: evolution after buffer overflow, analysis of the congestion avoidance phase, congestion
avoidance: evolution after buffer overflow, congestion avoidance: timeout based recovery),
Stochastic model for a wide area TCP connection, TCP with Explicit Feedback (RED and
ECN), Stream control transmission protocol, datagram congestion control

Module III: Network Layer (10 Hours)

Introduction, datagram networks and virtual circuits, Internet Protocol: Forwarding, IPv4 and
IPv6 addressing, Routing algorithms, Routing in the Internet – RIPng, Changes in OSPF to
support IPv6, BGP multiprotocol extensions for IPv6,Multicast forwarding and routing
information, basic multicast forwarding paradigms, Consequences of TRPF, Multicast trees,
reverse path multicasting, Multicast routing protocols: distance vector multicast routing
protocol and tunneling, Core based trees, protocol independent multicast, Traffic Engineering
– ECMP, Modifying path costs, routing IP flows, service-based routing, dynamic traffic
engineering, routing extensions for traffic engineering, MPLS

Module IV: Link Layer (8 Hours)

Introduction to the link layer, Error detection –single parity checks, horizontal and vertical
parity checks, parity check codes, cyclic redundancy checks, Error correction techniques –
Hamming codes, binary convolutional codes, Reed Solomon codes, Low-density parity-check
codes, Multi-access communication: Stability, maximum throughput, and delay analysis
using Markov chain - slotted multi-access and the ALOHA system, unslotted ALOHA,
CSMA slotted ALOHA, CSMA unslotted ALOHA. Switched LANs, Link virtualization, data
center networking

Module V: Multimedia Networking & Network Management (7 Hours)

Multimedia networking applications – properties of video, properties of audio, types of

multimedia network applications, Streaming stored video – UDP streaming, HTTP streaming,
prefetching video, client application buffer and TCP buffers, analysis of video streaming,
early termination and repositioning the video, Adaptive streaming, and DASH, Case studies:
Netflix, YouTube, Voice over IP, Protocols for real-ItN
imFeOcRoM
nvAeT
rsIaOtiN
onTalEC
apHpN
licOatLioOnG
s:YR
-ITTP1,
SIP, Network support for multimedia applications, Infrastructure for network management,
SNMP

Reference Books

1. James F. Kurose, Keith W. Ross, “Computer networking: a top-down approach”, 6th

ed., Pearson.
2. Larry Peterson and Bruce S Davis “Computer Networks :A System Approach” 5 th
edition , Elsevier -2014
3. Dimitri P. Bertsekas, Robert G. Gallager, “Data Networks”, 2nd Edition, Prentice Hall
4. Anurag Kumar, D. Manjunath, Joy Kuri, “Communication Networking : An
Analytical Approach”, Morgan Kaufman Publishers
5. Oliver C Ibe, “Fundamentals of data communication networks”, 1st edition, Wiley
6. Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols and
Architecture” 6th Edition, PHI – 2014
7. Ranjan Bose, “Information theory, coding, and cryptography”, 3rd Edition, Mc Graw
Hill
8. W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison Wesley, 1994.

Course Plan

No. of
No Topic Lectures
(40) Hours
1 Introduction 7 Hours
Computer Networks and Internet – network edge, network core,
1.1 delay, loss, and throughput in packet switched networks, 1
protocol layers and their service model.

Application Layer – principles of network applications –

1.2 network application architectures, process communication, web 2
and HTTP, FTP

Email – SMTP, MIME, POP3, IMAP, DNS, custom application

1.3 protocols (WSDL, SOAP), generic application protocol (REST) 2

Overlay networks – routing overlays, peer-to-peer applications

1.4 (P2P file distribution, BitTorrent, distributed hash tables), 1

1.5 Content distribution networks 1

2 Transport Layer8 Hours
Internet’s adaptive window protocol TCP: slow start and
2.1 congestion avoidance, receiver buffer and cumulative ACKs, 2
packet loss recovery and congestion control
2.2 Single connection: analysis with buffer overflow (analysis of 2
 slow start phase, short transfer throughput, slow start: evolution
after buffer overflow, analysis of the conIN geFstOioRnMaAvToiIO ncTe EC HNOLOGY-IT1
daN
phase, congestion avoidance: evolution after buffer overflow,
congestion avoidance: timeout-based recovery)
2.3 Stochastic model for a wide area TCP connection 1
2.4 TCP with Explicit Feedback (RED and ECN) 1
Stream control transmission protocol, datagram congestion
2.5 2
control
3 Network Layer10 Hours
3.1 Introduction, datagram networks and virtual circuits 1
3.2 Internet Protocol: Forwarding, IPv4 and IPv6 addressing 2
Routing algorithms, Routing in the Internet – RIPng, Changes in
3.3 2
OSPF to support IPv6, BGP multiprotocol extensions for IPv6
Multicast forwarding and routing information, basic multicast
3.4 forwarding paradigms, Consequences of TRPF, Multicast trees, 1
reverse path multicasting
Multicast routing protocols: distance vector multicast routing
3.5 protocol and tunnelling, Core based trees, protocol-independent 1
multicast
Traffic Engineering – ECMP, Modifying path costs, routing IP
3.6 flows, service-based routing, dynamic traffic engineering, 2
routing extensions for traffic engineering
3.7 MPLS 1
4 Link Layer 8 Hours
Introduction to the link layer, Error detection –single parity
4.1 checks, horizontal and vertical parity checks, parity check codes, 1
cyclic redundancy checks
Error correction techniques – Hamming codes, binary
4.2 convolutional codes, Reed Solomon codes, Low density parity 2
check codes
Multi-access communication: Stability, maximum throughput,
and delay analysis using Markov chain - slotted multi-access and
4.3 2
the ALOHA system, unslotted ALOHA, CSMA slotted ALOHA,
CSMA unslotted ALOHA.
4.4 Switched LANs 1
4.5 Link virtualization, data center networking 2
5 Multimedia Networking & Network Management 7 Hours
Multimedia networking applications – properties of video,
5.1 properties of audio, types of multimedia network applications, 1
Streaming stored video – UDP streaming

HTTP streaming, prefetching video, client application buffer and

5.2 TCP buffers, analysis of video streaming, early termination and 2
repositioning the video, Adaptive streaming and DASH
5.3 Case studies: Netflix, You Tube 1
 Voice over IP, Protocols for real time conversational applications
5.4 INFORMATION TECHNOL1OGY-IT1
: RTP, SIP
5.5 Network support for multimedia applications 1
5.6 Infrastructure for network management, SNMP 1
 INFORMATION TECHNOLOGY-IT1

CODE: COURSE NAME: CATEGORY L T P CREDIT

PROGRAM
221TIT002 TOPICS IN SECURITY 3 0 0 3
CORE 2

Preamble: This course is intended for students to have a deeper knowledge of selected topics in
network security, system security, and cryptography. The first two modules of the course cover
the Symmetric-key and Asymmetric-key cryptosystems in depth. The third module deals with
Cryptographic schemes that provide Integrity and Authentication.The fourth module discusses
the practical applications of security schemes in computer networks and network applications.
The last module deals with Operating system security and database system security.

Course Outcomes:

After the completion of the course, the student will be able to:

Examine the mathematical principles behind modern symmetric-key

CO 1 cryptosystems and compare various symmetric-key distribution methods.
(Level:Analyze)

Examine the mathematical principles behind asymmetric-key cryptosystems and

CO 2 cryptographic commitment schemes, and compare various asymmetric-key
distribution methods. (Level: Analyze)

Contrast modern hash functions, MACs, and Digital Signature Schemes and their
CO 3
security strength, and apply them in appropriate contexts.(Level: Apply)

Describe the security schemesemployable in modern networks and network

CO 4
applications and apply them in appropriate contexts.(Level:Apply)

Examinethe security requirements of, and the security threats to Operating

CO 5 Systems and Database Systems, and identify appropriate access control policies.
(Level: Analyze)

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1 √ √ √ √
 INFORMATION TECHNOLOGY-IT1

CO 2 √ √ √ √

CO 3 √ √ √ √

CO 4 √ √ √ √ √ √

CO 5 √ √ √ √ √ √

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 80%

Analyze 20%

Evaluate 0%

Create 0%

Mark distribution

Total Marks CIE ESE ESE Duration

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions(for both internal and end-semester examinations)
 INFORMATION TECHNOLOGY-IT1

Continuous Internal Evaluation (CIE) Pattern:

Micro project/Course based project: 20 Marks

Course-based task/Seminar/Quiz: 10 Marks

Test paper (one only): 10 Marks

The project shall be done individually. Group projects are not permitted. The test paper shall
include a minimum of 80% of the syllabus.

End Semester Examination (ESE) Pattern:

The End-Semester Examination shall be conducted by the University. There shall be two parts;
Part A and Part B. Part A shall contain five(numerical) questions (such questions shall be useful
in the testing of knowledge, skills, comprehension, application, analysis, synthesis, evaluation,
and understanding of the students), with one question from each module, having five marks for
each question. Students shall answer all questions. Part B shall contain seven questions (such
questions shall be useful in the testing of overall achievement and maturity of the students in a
course, through long answer questions relating to theoretical/practical knowledge, derivations,
problem-solving, and quantitative evaluation), with at least one question from each module, of
which, the student shall answer any five. Each question shall carry seven marks.

Model Question Paper

A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY

M. TECH DEGREE EXAMINATION
……SEMESTER
Branch:

MODEL QUESTION PAPER FOR END-SEMESTER EXAMINATION

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Five marks each)

1. Suppose that two parties Alice and Bob wish to set up a common secret key between
themselves using the Diffie-Hellman key exchange technique. They agree on 7 as the
modulus and 3 as the primitive root. Alice chooses 2 and Bob chooses 5 as their
respective secrets. Find the secret key that will be established between Alice and Bob.
2. Prove that Pedersen Commitment Scheme satisfies binding property and hiding property.
3. Show how the AES block cipher can be used to build a 128-bit hash function. Comment
on its security
 INFORMATION TECHNOLOGY-IT1

4. Describe any five of the major cloud-specific security threats, and countermeasures for
them.
5. Compare the security provided by Fence registers and Base/Bound registers in Operating
Systems.

PART B

(Answer any five questions. Seven marks each)

6. Let the following state matrix be input to the MixColumn transformation of AES (Values
are in hexadecimal form). Find the resultant state matrix.
63 𝐸𝐵 9𝐹 𝐴0
2𝐹
� 93 92 𝐶0 �
𝐴𝐹 𝐶7 𝐴𝐵 30
𝐴2 20 𝐶𝐵 2𝐵
7. Suppose Alice and Bob use El-Gamal Cryptosystem with a common prime q = 71 and a
primitive root α = 7.
(a) If Bob has public key YB = 3 and Alice chose the random integer k = 2, what is the
ciphertext corresponding to the plaintext M = 30?
(b) If Alice now chooses a different value of k so that the encoding of M = 30 is C =
(59, C2), what is the integer C2?
8. Describe the requirements of an ideal hash function. Consider the following hash
function. Messages are in the form of a sequence ofnumbers in Zn (M = (a1, a2, …, at)).
The hash value h is calculated asℎ(𝑀) = ∑𝑡𝑖𝑖=1 𝑎𝑖𝑖 for some predefined value n. What
requirements of an ideal hash function are satisfied by h? Justify your answer.
9. Consider the following threats to Web security and describe how each one is countered
by a particular feature of TLS.
(a) Brute-Force Cryptanalysis attack: An exhaustive search of the key space for a
conventional encryption algorithm.
(b) Replay attack: TLS handshake messages replayed
(c) Man-in-the-Middle attack: An attacker interposes during the key exchange, acting
as the client to the server and as the server to the client.
(d) Password sniffing: Passwords in HTTP or other application traffic are
eavesdropped.
(e) IP spoofing: Uses forged IP addresses to fool a host into accepting bogus data.
(f) IP hijacking: An active, authenticated connection between two hosts is disrupted
and the attacker takes the place of one of the hosts.
(g) SYN flooding: An attacker sends TCP SYN messages to request a connection but
does not respond to the final message to establish the connection fully. The
attacked TCP module typically leaves the “half-open connection” around for a
few minutes. Repeated TCP SYN can clog the TCP module.
 INFORMATION TECHNOLOGY-IT1

10. Consider two Operating Systems OS1 and OS2. OS1 has all its security features
implemented as part of the kernel. OS2 has all its security features implemented in a
‘Security Kernel’ (which is isolated from the rest of the kernel). Compare and contrast the
two Operating System implementations with respect to security.
11. Explain the steps in the signing process and verification process for the El-Gamal digital
signature scheme. For implementing the El-Gamal digital signature scheme between
them, Alice and Bob select a common prime q = 19 and a primitive root α = 10. Compute
Alice’s key pairs. Suppose Alice wants to sign a message with the hash value m = 14.
Explain how the signing and verification steps are done in this case at Alice’s side and
Bob’s side respectively.
12. Alice and Bob use an Elliptic Curve Cryptosystem with parameters E11(1, 6) and G = (2,
7). Bob’s private key is nB = 7.Find Bob’s public key.

***

Syllabus

Module I: Introduction, Symmetric-Key Cryptography: (9 Hours)

Security Goals and Attacks threatening them, Symmetric-key Cryptography v/s Asymmetric-key
(Public-key) Cryptography, Block cipher v/s Stream Cipher, Cryptanalysis, AES Mathematical
Background, AES, XTS-AES mode of operation, Format Preserving Encryption, Symmetric-key
Management and Distribution - KDC, Distribution using Asymmetric-key cryptosystems, Diffie-
Hellman Key Exchange Protocol – Anonymous and Ephemeral (with Mathematical
Background).

Module II: Public-Key Cryptography: (8 Hours)

Factorization Problem, Discrete Logarithm Problem, RSA Cryptosystem, El-Gamal

Cryptosystem, Elliptic Curve Arithmetic, Elliptic Curve Cryptosystem, Cryptographic
Commitment - Pedersen Commitment, Distribution of Public Keys - Public-key Certificates,
PKI.

Module III: Integrity and Authentication: (8 Hours)

Cryptographic hash functions, Secure Hash Function - SHA3, Message Authentication Codes –
HMAC, CMAC, Digital Signatures - El-Gamal Digital Signature, Schnorr Digital Signature,
DSA, RSA-PSS.
 INFORMATION TECHNOLOGY-IT1

Module IV: Network Security and Internet Security: (8 Hours)

IP Security – ESP, Security Association, TLS overview, HTTPS, SSH, Network Access Control –
Elements, Enforcement methods, EAP, Cloud Security – Elements, Risks, and Countermeasures,
Data protection, Cloud Security as a Service.

Module V: Operating System Security and Database System Security: (7 Hours)

Security features in OS, Security in the design of OS, Rootkit, Access Control - Role-based and
Procedure oriented, Security requirements of Databases, Reliability and Integrity, Database
Disclosure.

Reference Books

1. Cryptography and Network Security, Principles and Practice, William Stallings, 7th Edition

2. Cryptography and Network Security, Forouzan and Mukhopadhyay, 3rd Edition

3. Security in Computing, Pfleeger, Pfleeger and Margulies, 5th Edition

4. Introduction to Modern Cryptography, Katz and Lindell, 3rd Edition

Course Plan

No. of Lectures
No Topic
(40 Hours)

1 Introduction, Symmetric-Key Cryptography(9 Hours)

1.1 Security Goals and Attacks threatening them, Symmetric-key

Cryptography v/s Asymmetric-key (Public-key) 2
Cryptography, Block cipher v/s Stream Cipher, Cryptanalysis

1.2 AES Mathematical Background 1

1.3 AES 2

1.4 XTS-AES mode of operation 1

1.5 Format Preserving Encryption 1

1.6 Symmetric-key Management and Distribution, KDC,

1
Distribution using Asymmetric-key cryptosystems.
 INFORMATION TECHNOLOGY-IT1

1.7 Diffie-Hellman Key Exchange Protocol – Anonymous and

1
Ephemeral (with Mathematical Background).

2 Public-Key Cryptography(8 Hours)

2.1 Factorization Problem, Discrete Logarithm Problem. 1

2.2 RSA Cryptosystem 1

2.3 El-Gamal Cryptosystem 1

2.4 Elliptic Curve Arithmetic 1

2.5 Elliptic Curve Cryptosystem 2

2.3 Cryptographic Commitment, Pedersen Commitment. 1

2.4 Distribution of Public Keys, Public-key Certificates, PKI. 1

3 Integrity and Authentication(8 Hours)

3.1 Cryptographic hash functions 1

3.2 Secure Hash Function - SHA3 2

3.3 Message Authentication Codes – HMAC, CMAC 1

3.4 Digital Signatures, El-Gamal Digital Signature 1

3.5 Schnorr Digital Signature 1

3.6 DSA 1

3.7 RSA-PSS 1

4 Network Security and Internet Security(8 Hours)

4.1 IP Security – ESP, Security Association. 2

4.2 TLS overview, HTTPS, SSH. 2

4.3 Network Access Control – Elements, Enforcement methods,

2
EAP

4.4 Cloud Security – Elements, Risks and Countermeasures, Data

2
protection, Cloud Security as a Service
 INFORMATION TECHNOLOGY-IT1

5 Operating System Security and Database System Security (7 Hours)

5.1 Security features in OS, Security in the design of OS, Rootkit. 3

5.2 Access Control - Role-based and Procedure oriented. 1

5.3 Security requirements of Databases, Reliability and Integrity,

3
Database Disclosure.
 INFORMATION TECHNOLOGY-IT1

CODE COURSE NAME: CATEGORY L T P CREDIT

ADVANCED LABORATORY
221L1T100 0 0 2 1
NETWORKING LAB 1

Preamble: This course will cover different experiments on advanced network programming
and will provide the students with an environment to work on network simulation tools. This
helps students to develop and implement protocols and evaluate their performance.

Course Outcomes: After the completion of the course, the student will be able to

CO 1 Implement various network protocols for LAN and Internet (Level: Apply)

Implement and analyze the performance of various network protocols(Level:

CO 2
Analyze)

CO 3 Implement and evaluate different network routing protocols. (Level: Apply)

Simulate and compare the performance of various routing protocols, congestion

CO 4
control mechanisms, and wireless networks.(Level: Analyze)

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1 ✓ ✓
✓ ✓

CO 2 ✓ ✓ ✓ ✓
✓

CO 3 ✓ ✓ ✓
✓ ✓

CO 4 ✓ ✓ ✓
✓ ✓
 INFORMATION TECHNOLOGY-IT1

Continuous Internal Evaluation Pattern:

CIE: 100%

Attendance : 10%

Preparation and Completion of Experiment by the Student : 60%

Final Assessment : 30%

Syllabus and Course Plan

No Topic No. of Hours

1 Experiments on Network Programming using C/Java

Implementation of ARP and improvisation of protocol by

1.1 2 Hrs
resolving various security problems involved in it.

Implementation of Remote Command Execution with the

1.2 various scenarios such as Remote File copy, Remote 2 Hrs
Distribution etc.

Program to integrate Link State and Distance Vector Routing

1.3 2 Hrs
Protocols.

Implement a protocol which ensures reliable

QoS to transfer a file across a network and
1.4 2 Hrs
measure its performance in comparison with
TCP.

Implementation of network protocol used on the Internet or

1.5 local area networks to provide a bidirectional interactive 2 Hrs
communications facility.

Implement a protocol for Authenticated Routing in LAN

1.6 2 Hrs
networks.

2 Network Simulation and Performance Evaluation Using Simulator

2.1 Simulation and Performance Comparison of various Routing 2 Hrs

 INFORMATION TECHNOLOGY-IT1
Protocols.

2.2 Simulation of Wireless Networks (Eg: Wifi, Adhocetc). 2 Hrs

Simulation and Performance Comparison of different

2.3 2 Hrs
congestion control mechanisms for TCP/IP protocols.

Reference Books

1. W. Richard Stevens, “UNIX Network Programming”, PHI , Eastern Economy Edition

2. J.F. Kurose and K.W. Ross, Computer Networking: A Top-Down Approach Featuring
Internet,3/e, Pearson Education, 2005.
3. Using Java2 Platform – Joseph Weber (AWL)
4. Douglas E.Comer, Hands on Networking with Internet Technologies, Pearson Education.
5. Network and System Security, edited by John R. Vacca
 INFORMATION TECHNOLOGY-IT1

SEMESTER I
PROGRAM ELECTIVE I
 INFORMATION TECHNOLOGY-IT1
CODE COURSE NAME CATEGORY L T P CREDIT
NETWORK ROUTING PROGRAM
221EIT100 3 0 0 3
PROTOCOLS ELECTIVE I

Preamble: The students are expected to understand the architectures and routing protocols
used in different types of networks

Course Outcomes: After the completion of the course the student will be able to

Bloom’s
CO
Course Outcome (CO) Category
No.
Level
Apply shortest path and widest path routing algorithms in Level 3:
CO 1
communication network routing. Apply
Level 4 :
CO 2 Design single and multi-commodity network flow problems
Analyze
Level 2 :
CO 3 Describe IP routing protocols & the routing protocols used in PSTN
Understand
Explain the routing protocols used in high-speed and mobile Level 2 :
CO 4
networks Understand
Level 3:
CO 5 Apply the routing protocols for ad hoc networks
Apply

Program Outcomes ( PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor’s program

PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.
 PO6: An ability to engage in life-long learning for the design and development related to the
stream related problems taking into considerationINsFuOstaRinMaA
biTliItO
y,NsoTcE
ieC
taH
l, N
etO
hiLcO
al G
anYd-IT1
environmental aspects

PO7: An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1
CO 2
CO 3
CO 4
CO 5

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 80
Analyse 20
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)

Continuous Internal Evaluation Pattern:

Evaluation shall only be based on application, analysis or design based questions (for both
internal and end semester examinations).
Continuous Internal Evaluation: 40 marks
INFORMATION TECHNOLOGY-IT1
i. Preparing a review article based on peer reviewed original publications (minimum 10
publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.

There will be two parts; Part A and Part B.

Part A will contain 5 numerical/short answer questions with 1 question from each module,
having 5 marks for each question. Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks

Total duration of the examination will be 150 minutes.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.

For example if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. In what ways, are the Bellman-Ford algorithm and the distance vector algorithm different?

2. Develop a specialized k-shortest paths algorithm, given that a path cannot consist of more
than two links.

3.What is the difference between minimum hop routing and shortest path routing?

Course Outcome 2 (CO2)

1. Consider a four-node ring network where nodes are connected as follows: 1-2-3-4-1.
Assume that demand volume between 1 and 3 is 25, between 2 and 4 is 30, and between 2
and 3 is 10. Capacity on each link is 50.
(a) Formulate an optimization problem in which the goal is to maximize free capacity
availability. Determine the optimal INfFloOwRMATfIoO
r N TEtC
hiH
s NOLO
obGjeYcti
-IvTe1.
(b) Formulate an optimization problem in which the goal is to load balance the network.
Determine the optimal flow for this objective.

2.Consider a four-node network in which nodes are numbered 1, 2, 3, 4. All nodes are
directly connected to each other except that there is no link between nodes 1 and 2. Link
capacities are given as follows: 30 on link 1-3, 5 on link 1-4, 15 on link 2-3, 10 on link 2-4,
and 10 on link 3-4. Demand volumes are given to be 15 for pair 1:2, 20 for pair 1:3, and 10
for pair 2:3.
Formulate the load balancing optimization problem, and determine the optimal solution.

Course Outcome 3(CO3):

1. Why do some routing protocols message identification at above the transport layer while
some other do so directly over the IP layer?

2.For a given IP address, how would you find out its home AS number?

3.Explain how hierarchical routing works

Course Outcome 4 (CO4):

1. Describe deflection routing? Explain how buffers can reduce deflection probability

2. With a neat diagram explain the mobile network architecture

3. Explain DARPA packet radio network

Course Outcome 5 (CO5):

1. What are the characteristics of MANET?

2. Compare and contrast DSDV and AODV

3. Explain DSR with an example

Model Question Paper
INFORMATION TECHNOLOGY-IT1
A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY
M.TECH DEGREE EXAMINATION
……SEMESTER
Branch:

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Each question carries 5 marks)

1. What are the main differences between shortest path routing and widest path routing?

2. Explain the basic principle behind a path vector protocol through a simple illustration

3. What is crankback?

4. What are the routing modes in packet level routing of PLANET?

5. TORA builds and maintains a DAG rooted at a destination. Why?

PART B (Answer any five questions. Each question carries 7 marks)

6. Consider the network topology given below: Assume that the links have the following
bandwidth: 1-2: 1, 1-4: 1, 2-3: 2, 2-4: 2, 3-4: 1, 3-5: 1, 3-6: 4-5: 2; 4-6: 3; 5-6: 2.
Determine the widest paths from node 6 to all the other nodes.

7. Explain the packet header of EIGRP

8. Explain how real time network routing works

9. Discuss about the different implementation strategy of PNNI routing in ATM

10. Explain about Cluster head Gateway Switch Routing

11. Describe the routing algorithms used for large sized packet radio networks
 12. What are the different optimization techniques used in dynamic source routing
protocol? INFORMATION TECHNOLOGY-IT1

Syllabus

Module I (7 Hours)

Router architecture, Network topology architecture, Network management architecture,

Public switched telephone network (PSTN), Routing algorithms: Shortest path and widest
path – Bellman ford algorithm and distance vector approach (centralized view, distributed
view), Dijkstra’s algorithm – centralized and distributed approach, Comparison of the
Bellman-Ford Algorithm and Dijkstra’s Algorithm, Shortest Path Computation with
Candidate Path Caching, Widest Path Computation with Candidate Path Caching, Widest
path algorithm, k-shortest path algorithm.

Module II (8 Hours)

Path vector routing protocol: Basic principle, link failure case, path vector with path caching,
node failure case, Network flow modeling: Single commodity network flow, Multi
commodity network flow: Three node example, general formulation, IP routing: IGRP –
packet formats, computing composite metric, EIGRP, Route redistribution, IS-IS – Key
features, comparison with OSPF.

Module III (7 Hours)

Internet routing architecture – current architectural view of the Internet, Allocation of IP

prefixes and AS number, Policy-based routing, Implications of traffic engineering, Internet
routing instabilities, Routing in the PSTN – Hierarchical routing, Limitations of hierarchical
routing, Dynamic routing, Real-time network routing, Dynamic routing and its relation to
other routing – dynamic routing and link state protocol, Path Selection in Dynamic Routing
in Telephone Networks and IP Routing

Module IV (8 Hours)

High Speed Networks -Routing in optical networks-The optical layer, Node Designs,
Network design and operation, Optical layer cost tradeoffs, Routing in ATM networks-ATM
address structure, ATM Routing, PNNI protocol, Routing in the PLANET network and
Deflection Routing. MOBILE NETWORKS - Routing in Cellular Mobile Radio
communication networks, Mobile Network Architecture. Mobility and Routing in Cellular
Digital Packet Data (CDPD) network, Packet Radio Routing- DARPA packet radio network,
Routing algorithms for small, medium and large sized packet radio networks.

Module V (10 Hours)

Internet-based mobile ad-hoc networking, communication strategies, routing algorithms,

Table-driven routing –Destination Sequenced Distance vector (DSDV), Source initiated on-
demand routing –Dynamic Source Routing (DSR). Ad-hoc On-demand Distance Vector
(AODV), Hierarchical based routing, Cluster head Gateway Switch Routing (CGSR) and
temporally-Ordered Routing Algorithm (TORA), Quality of Service.
Reference Books
INFORMATION TECHNOLOGY-IT1
1. DeepankarMedhi, Karthikeyan Ramasamy, “Network Routing Algorithms, Protocols, and
Architecture, ”, The Morgan Kaufmann Series in Networking.

2. M. Steen strub, “Routing in Communication networks”, PH International, NY, 1995.

3. William Stallings, “ISDN & Broadband ISDN with Frame Relay & ATM”, PHI, ND,
2004.

4. Behrouz A Forouzan, “Data Communications and Networking”, 3rd Edition, TMH, 2004

5. William Stallings, “High Speed Networks TCP/IP and ATM Design Principles”, Prentice
HallInternational, 1998.

6. Mohammad Ilyas, “The Handbook of Ad hoc Wireless Networks”, CRC Press, 2002

7. Vijay K.Garg, “Wireless Network Evolution: 2G to 3G”, Pearson Education, ND, 2003.

8. Rajiv Ramaswami and Kumar N.Sivarajan, “Optical Networks”, Morgan Kaufmann

Publishers,1998.

9. SumitKasera and Pankaj sethi, “ATM Networks”, TMH Publishing Co. Ltd, ND,2001.

Course Plan

No. of
No Topic Lectures (40
Hours)
1 Network Routing : Basics and Foundations 7 Hours
1.1 Router architecture, Network topology architecture, Network
management architecture, Public switched telephone network 1
(PSTN)
1.2 Routing algorithms : Shortest path and widest path – Bellman
ford algorithm and distance vector approach (centralised view, 1
distributed view)
1.3 Dijkstra’s algorithm – centralised and distributed approach 1
1.4 Comparison of the Bellman–Ford Algorithm and Dijkstra’s
1
Algorithm
1.5 Shortest Path Computation with Candidate Path Caching 1
1.6 Widest Path Computation with Candidate Path Caching 1
1.7 Widest path algorithm, k-shortest path algorithm 1
2 Network flow modeling& IP routing 8 Hours
2.1 Path vector routing protocol : Basic principle, link failure case,
1
path vector with path caching, node failure case
2.2 Network flow modeling: Single commodity network flow 1
2.3 Multi commodity network flow: Three node example, general
2
formulation
2.4 IP routing : IGRP – packet formats, computing composite
2
metric, EIGRP, Route redistribution INFORMATION TE CHNOLOGY-IT1
2.5 IP routing : IGRP – packet formats, computing composite
1
metric, EIGRP, Route redistribution
2.6 IS-IS – Key features, comparison with OSPF 1
3 Internet routing architecture & Routing in the PSTN 7 Hours
3.1 Internet routing architecture – current architectural view of the
1
Internet, Allocation of IP prefixes and AS number
3.2
Policy based routing, Implications of traffic engineering, 2
Internet routing instabilities
3.2 Routing in the PSTN – Hierarchical routing, limitations of
2
hierarchical routing, Dynamic routing
3.3 Real time network routing, Dynamic routing and its relation to
other routing - dynamic routing and link state protocol, Path
2
Selection in Dynamic Routing in Telephone Networks and IP
Routing
4 High speed and Mobile Network Routing 9 Hours
4.1 HIGH SPEED NETWORKS -Routing in optical networks-The
optical layer, Node Designs, Network design and operation, 1
Optical layer cost tradeoffs

4.2 Routing in ATM networks-ATM address structure, ATM

Routing, PNNI protocol 2

4.3 Routing in the PLANET network and Deflection Routing. 1

4.4 MOBILE NETWORKS - Routing in Cellular Mobile Radio
1
Communication networks, Mobile Network Architecture.
4.5 Mobility and Routing in Cellular Digital Packet Data (CDPD)
1
network
4.6 Packet Radio Routing- DARPA packet radio network 1
4.7 Routing algorithms
2
for small, medium and large sized packet radio networks.
5 Ad hoc Networks 9 Hours
5.1 Internet-basedmobile ad-hoc networking, communication
1
strategies, routing algorithms
5.2 Table-driven routing –Destination Sequenced Distance vector
1
(DSDV)
5.3 Source initiated on-demand routing - Dynamic Source Routing
2
(DSR).
5.4 Ad-hoc On-demandDistance Vector (AODV), Hierarchical
2
based routing
5.5 Cluster head Gateway Switch Routing (CGSR) and temporally-
2
Ordered Routing Algorithm (TORA)
5.6 Quality of Service. 1
 INFORMATION TECHNOLOGY-IT1
CODE COURSE NAME CATEGORY L T P CREDIT
WIRELESS AND AD HOC PROGRAM
221EIT001 3 0 0 3
NETWORKS ELECTIVE I

Preamble: The students are expected to understand the basic concepts of wireless
communication, ad hoc networks, and sensor networks

Course Outcomes: After the completion of the course the student will be able to

Bloom's
CO Category
Course Outcomes (CO)
No. Level
Identify the characteristics of wireless communication systems and Level2:
CO 1
cellular systems Understand
Level 2:
CO 2 Explain the operation of wireless internet
Understand
Level4:
CO 3 Analyze the MAC and routing protocols used in ad hoc networks
Analyse
Level 2:
CO 4 Explain the transport and security protocols for ad hoc networks
Understand
Level 2:
CO 5 Explain the fundamental concepts of wireless sensor networks
Understand

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.
 INFORMATION TECHNOLOGY-IT1
PO6: An ability to engage in life-long learning for the design and development related to the
stream related problems taking into consideration sustainability, societal, ethical and
environmental aspects

PO7: An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1
CO 2
CO 3
CO 4
CO 5

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 80
Analyse 20
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

 INFORMATION TECHNOLOGY-IT1
Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.

There will be two parts; Part A and Part B.

Part A will contain 5 numerical/short answer questions with 1 question from each module,
having 5 marks for each question. Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks

Total duration of the examination will be 150 minutes.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.

For example if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Illustrate with necessary expressions how frequency reuse helps in increasing cellular
capacity

2. Examine the features of scattering. Why does it occur?

3.What are the factors that influence small scale fading?

Course Outcome 2 (CO2)

1. Explain wireless application protocol stack

2. What is co-located care of address?

3.Briefly discuss about agent discovery in Mobile IP

Course Outcome 3(CO3):

1. Explain the features of MACAW protocol

 INFORMATION TECHNOLOGY-IT1
2.Compare DSR protocol and AODV protocol

3. Analyze DSDV routing protocol in detail

Course Outcome 4 (CO4):

1. What are the network security requirements for mobile ad hoc networks?

2. What is the impact of the failure of proxy nodes in Split TCP?

3. How feedback based TCP improves network performance?

Course Outcome 5 (CO5):

1. What are the issues and challenges in designing wireless sensor networks?

2. Define localization

3. Explain the features of self-organizing MAC

 INFORMATION TECHNOLOGY-IT1
Model Question Paper

A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY

M.TECH DEGREE EXAMINATION
……SEMESTER
Branch:

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Each question carries 5 marks)

1. A spectrum of 30 MHz is allocated to a wireless FDD cellular

system which uses two 25 KHz simplex channels to provide full duplex voice and
control channels, compute the number of channels available per cell. Compute the
number of channels available per cell if it uses 4-cell reuse.

2. What are the advantages of I-TCP?

3. Explain the issues in designing routing protocols for ad hoc networks

4. How does TCP bus sender probe the congestion in network?

5. Write the properties and the main design challenges of data dissemination protocols in
a wireless sensor network.

PART B (Answer any five questions. Each question carries 7 marks)

6. “In practice fast fading only occurs for very low data rate (communications)”. Justify.

7. Explain multichannel CSMA MAC protocol

8. Consider the network given below. Here ‘S’ is source node and ‘D’ is
target node. Illustrate the process of route discovery, route reply, data
delivery and route caching using DSR.

9. Explain ad hoc TCP in detail

 INFORMATION TECHNOLOGY-IT1
10. Explain CSMA based MAC protocols for wireless sensor networks

11. What is triangular routing?

12. Compare the data gathering methods used in wireless sensor networks

Syllabus

Module I: Introduction (8 Hours)

Introduction to wireless communication systems: Evolution of mobile radio communications,

Mobile radio systems around the world, Example of wireless communication systems,
Modern wireless communication systems: 2G, 3G, 4G and 5G, Wireless local loop, Wireless

local area networks, Bluetooth and personal area networks, The Cellular Concept: Frequency
reuse, channel assignment and handoff strategies, Interference and system capacity, trunking
and grade of service, Improving coverage and capacity in cellular systems, Signal
Propagation – path loss of radio signals, additional signal propagation effects, multipath
propagation. Spread spectrum – Direct sequence spread spectrum, Frequency-hopping spread
spectrum, Medium access control – motivation for a specialized MAC, SDMA, FDMA,
TDMA

Module II: Wireless Internet and Adhoc Wireless Networks (8 Hours)

Wireless Internet – introduction, Mobile IP, TCP in wireless domain, Wireless Application
Protocol – model, protocol stack. Ad hoc wireless networks – introduction, issues in ad hoc
wireless networks, MAC protocols for ad hoc wireless networks – introduction, issues in
designing a MAC protocol for ad hoc wireless networks, classification of MAC protocols.
MAC Protocols – MACAW, Distributed packet reservation multiple access protocol,
distributed priority scheduling and medium access in ad hoc networks, multi-channel CSMA
MAC protocol

Module III: Routing Protocols for Ad hoc wireless networks (8 Hours)

Introduction, issues in designing a routing protocol for ad hoc wireless networks,

classification of routing protocols, Table driven routing protocols – destination sequenced
distance vector routing protocol, wireless routing protocol, On-demand routing protocols –
dynamic source routing protocol, AODV, Hybrid routing protocols: core extraction
distributed ad hoc routing protocol, zone routing protocols, Power-aware routing protocols

Module IV: Transport and Security protocols for ad hoc wireless networks (8 Hours)

Transport layer – design issues, classification of transport layer solutions, TCP over ad hoc
wireless networks – Feedback based TCP, TCP with explicit link failure notification, TCP
Bus, Ad hoc TCP, Split TCP, Application controlled transport protocol, ad hoc transport
 INFORMATION TECHNOLOGY-IT1
protocol, Security in Ad hoc wireless networks, network security requirements, issues and
challenges in security provisioning, network security attacks

Module V: Wireless Sensor Networks (8 Hours)

Introduction, applications of sensor networks, comparison with ad hoc wireless networks,

issues and challenges in designing a sensor network, Sensor network architecture – layered
architecture, clustered architecture, Data dissemination – flooding, gossiping, rumor routing,
sequential assignment routing, directed diffusion, sensor protocols for information via
negotiation, geographic hash table, Data gathering – direct transmission, power-efficient
gathering for sensor information systems, binary scheme, chain based three-level scheme,
MAC protocols for sensor networks – Self-organizing MAC, Hybrid TDMA/FDMA, CSMA
based MAC protocols, Location discovery – indoor localization, sensor network localization

Reference Books

1. Theodore S Rappaport, “Wireless Communications: Principles and Practice”, 2nd edition,

Pearson

2. C. Siva Ram Murthy, B.S. Manoj, “Ad hoc Wireless Networks: Architectures and
Protocols”, Pearson Education

3. Jochen Schiller, “Mobile Communications”, 2nd Edition, Pearson

Course Contents and Lecture Schedule

No. of
No Topic Lectures (40
Hours)
1 Introduction 8 Hours
Introduction to wireless communication systems: Evolution of
mobile radio communications,Mobile radio systems around the
1.1 1
world. Example of wireless communication systems.
Modern wireless communication systems: 2G, 3G, 4G and 5G.
Wireless local loop, Wirelesslocal area networks, Bluetooth and
1.2 2
personal area networks.
The Cellular Concept: Frequency reuse, channel assignment and
1.3 1
handoff strategies
Interference and system capacity, trunking and grade of service.
1.4 1
Improving coverage andcapacity in cellular systems.
Signal Propagation – path loss of radio signals, additional signal
1.5 1
propagation effects, multi path propagation
Spread spectrum – Direct sequence spread spectrum, Frequency-
1.6 1
hopping spread spectrum
Medium access control – motivation for a specialized MAC,
1.7 1
SDMA, FDMA, TDMA
 INFORMATION TECHNOLOGY-IT1
2 Wireless Internet and Adhoc Wireless Networks 8 Hours
2.1 Wireless Internet – introduction, Mobile IP 1
2.2 TCP in wireless domain 1
2.3 Wireless Application Protocol – model, protocol stack 1
Ad hoc wireless networks – introduction, issues in ad hoc
2.4 2
wireless networks
MAC protocols for ad hoc wireless networks – introduction,
2.5 issues in designing a MAC protocol for ad hoc wireless 2
networks, classification of MAC protocols
MAC Protocols – MACAW, Distributed packet reservation
multiple access protocol, distributed priority scheduling and
2.6 1
medium access in ad hoc networks, multi-channel CSMA MAC
protocol
3 Routing Protocols for Ad hoc wireless networks 8 Hours
Introduction, issues in designing a routing protocol for ad hoc
3.1 1
wireless networks, classification of routing protocols
Table driven routing protocols – destination sequenced distance
3.2 2
vector routing protocol, wireless routing protocol
On-demand routing protocols – dynamic source routing
3.3 2
protocol, AODV
Hybrid routing protocols: core extraction distributed ad hoc
3.4 2
routing protocol, zone routing protocols
3.5 Power-aware routing protocols 1
4 Transport and Security protocols for ad hoc wireless networks 8 Hours
Transport layer – design issues, classification of transport layer
4.1 2
solutions
TCP over ad hoc wireless networks – Feedback-based TCP, TCP
4.2 2
with explicit link failure notification, TCP Bus
Ad hoc TCP, Split TCP, Application controlled transport
4.3 2
protocol, ad hoc transport protocol
Security in Ad hoc wireless networks, network security
4.4 requirements, issues and challenges in security provisioning, 2
network security attacks
5 Wireless Sensor Networks 8 Hours
Introduction, applications of sensor networks, comparison with
5.1 ad hoc wireless networks, issues and challenges in designing a 1
sensor network
Sensor network architecture – layered architecture, clustered
5.2 2
architecture
Data dissemination – flooding, gossiping, rumor routing,
5.3 sequential assignment routing, directed diffusion, sensor 2
protocols for information via negotiation, geographic hash table
5.4 Data gathering – direct transmission, power-efficient gathering 1
 INFORMATION TECHNOLOGY-IT1
for sensor information systems, binary scheme, chain-based
three-level scheme
MAC protocols for sensor networks – Self-organizing MAC,
5.5 1
Hybrid TDMA/FDMA, CSMA-based MAC protocols
Location discovery – indoor localization, sensor network
5.6 1
localization
 INFORMATION TECHNOLOGY-IT1

CODE: COURSE NAME: CATEGORY L T P CREDIT

CLOUD COMPUTING PROGRAM

221EIT002 3 0 0 3
AND SECURITY ELECTIVE I

Preamble: The syllabus is designed with the view of preparing the students capable of
understanding the security aspects of cloud computing. The students will get to know about the
cloud architecture, vulnerabilities and threats occurring in various cloud systems and methods to
secure the same.

Course Outcomes: Upon completion, the student will be able to

CO 1 Apply the basics of virtualization to implement virtual machines(Cognitive

Level: Apply)

Apply the fundamentals of cloud computing and its architecture for

CO 2
implementing cloud services.(Cognitive level: Apply)

CO 3 Deploy an application in cloud.(Cognitive level: Apply)

Analyse the security issues and challenges faced in a given cloud environment
CO 4
and implement appropriate security measures(Cognitive level: Apply)

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on

complex engineering activities by interacting with the engineering fraternity and with
society at large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization
of the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program
 INFORMATION TECHNOLOGY-IT1
PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.

PO6: An ability to engage in life-long learning for the design and development related to
the stream related problems taking into consideration sustainability, societal, ethical
and environmental aspects

PO7: An ability to develop cognitive load management skills related to project

management and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1

CO 2

CO 3

CO 4
 INFORMATION TECHNOLOGY-IT1

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 100%

Analyse

Evaluate

Create

Mark distribution

Total Marks CIE ESE ESE Duration

100 40 60 2.5 hours

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.
There will be two parts; Part A and Part B.
 INFORMATION TECHNOLOGY-IT1
Part A will contain 5 numerical/short answer questions with 1 question from each module, having
5 marks for each question. Students should answer all questions. Part B will contain 7 questions
(such questions shall be useful in the testing of overall achievement and maturity of the students
in a course, through long answer questions relating to theoretical/practical knowledge,
derivations, problem solving and quantitative evaluation), with minimum one question from each
module of which student should answer any five. Each question can carry 7 marks
Total duration of the examination will be 150 minutes.
Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.
For example if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Demonstrate how you will a Configure a VM instance using virtual box in your local
machine and allocate CPU, memory and storage space as per a specified requirement.
2. Illustrate the steps to perform VM migration.
3. A degree of caution is advised when launching a server virtualization. Clarify this
statement by stating the drawbacks of the same.

Course Outcome 2 (CO2):

1. With the help of examples, differentiate between SaaS, PaaS and IaaS?
2. To meet the requirements of a single organization, which one out of the private, public
and hybrid cloud providers, is recommended? Why?
3. How will you classify massive systems? Explain.

Course Outcome 3 (CO3):

1. “OpenNebula and OpenStack serve different needs”. Justify this statement.

2. Demonstrate the challenges in designing and developing a cloud application, with the
help of an example.
3. How is OpenStack used in a cloud environment?

Course Outcome 4 (CO4):

1. Given an e-healthcare application deployed in cloud. Identify the challenges faced and
the security objectives to be achieved.
2. How is security provided to data at various stages in the context of the cloud?
3. How virtualization supports disaster recovery?
 INFORMATION TECHNOLOGY-IT1

Model Question Paper:

QP CODE: Reg No:

Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

221EIT002

CLOUD COMPUTING AND SECURITY

Max. Marks : 60 Duration: 2.5 hrs

PART A

Answer All Questions. Each Question Carries 5 Marks

1. Give the steps to install a virtual machine. (5)
2. In which scenario, users can opt IaaS, PaaS and SaaS? Find suitable
(5)
application for each.
3. How inter-cloud resource management is performed?
(5)

4. Among openNebula and openStack, which is suited best for enterprise cloud
(5)
computing?
5. Why is it harder to establish security in the cloud? (5)
(5x5=25)
Part B
(Answer any five questions. Each question carries 7 marks)
6. (7)
How is memory virtualization implemented? Provide necessary examples
and diagrams wherever necessary.

7. (7)
Illustrate the steps to perform live VM migration.
 INFORMATION TECHNOLOGY-IT1
8. (7)
Depict the cloud architecture. Explain the same with the help of an example
application.

9. (7)
Explain PaaS model for cloud computing. With a neat diagram, write about
Google App Engine for PaaS applications.

10. (7)
Consider a restaurant application on the cloud that has serverless apps
connecting to a backend NoSQL database. There are two types of users in
the application - manager (who manages the catalog) and customer (who
views the catalog). There are separate serverless functions for the users.
During development, you need to create a set of roles that can define what
operations are permitted on the NoSQL database by the serverless
functions. In addition, the entire application and the data should be secured.
Propose solutions for the following.

a) What permissions are required for the role assigned to manager function?

b) What permissions are required for the role assigned to customer

function?

c) How can you ensure application security?

d) How can you ensure data security?

e) How can you create an auditable trail of modifications to the database?

11. (7)
Explain Security Architecture Design in cloud.

12. (7)
Explain the life cycle of Secure software Development (SecSDLC).
 INFORMATION TECHNOLOGY-IT1
Syllabus

Module I:

Introduction to component virtualization: Basics of Virtualization - Types of Virtualization -

Implementation Levels of Virtualization -Virtualization of CPU, Memory, I/O Devices – Virtual
clusters and resource management- Desktop Virtualization – Server Virtualization- Storage
Virtualization – Network Virtualization.

Module II: Introduction to Cloud Computing: System Models for Distributed and Cloud
Computing - NIST Cloud Computing Reference Architecture - Features of Cloud Computing –
Cloud Services – IaaS, PaaS, SaaS – Cloud service Providers – Public, Private and Hybrid
Clouds.

Module III: Architectural Design of Compute and Storage Clouds – Layered Cloud Architecture
Development – Design Challenges - Inter Cloud Resource Management – Resource Provisioning
and Platform Deployment – Global Exchange of Cloud Resources.

Module IV: Parallel and Distributed Programming Paradigms – Map Reduce, Hadoop
Library from Apache – Mapping Applications - Programming Support – EC2, Google App
Engine, Amazon AWS - Cloud Software Environments - Eucalyptus, Open Nebula, OpenStack.

Security in the cloud: Overview – Cloud Security Challenges- Software-as-a-Service Security –

Security Governance – Risk Management.

Module V:SecSDLC-Security Monitoring – Security Architecture Design – Data Security –

Application Security. VM security. Cloud Security Architecture: Trusted cloud, Identity and
access management, Access control in cloud, Autonomic security, protection, self-healing.
Firewalls-Web application firewall.

Reference Books

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud Computing, From
Parallel Processing to the Internet of Things”, 1sted. ,Morgan Kaufmann Publishers.

2. John W.Rittinghouse and James F.Ransome, “Cloud Computing: Implementation,

Management, and Security”, CRC Press, 2010.

3. Tim Mather, S. Kumaraswamy and S. Latif, “Cloud Security and Privacy: An

EnterprisePerspective on Risks and Compliance”, O’Reilly Media, 2009.

4. Ronald L. Krutz Russell Dean Vines “Cloud Security: A Comprehensive Guide to

SecureCloud Computing”, Wiley ,2010.
 INFORMATION TECHNOLOGY-IT1
5. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing, A Practical Approach”,
TMH, 2009.

6. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in

the Cloud” O'Reilly, 2009.

7. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and
Processes”, Elsevier/Morgan Kaufmann, 2005.

8. Katarina Stanoevska-Slabeva, Thomas Wozniak, Santi Ristol, “Grid and Cloud Computing –
A Business Perspective on Technology and Applications”, Springer, 2010.

Course Contents and Lecture Schedule

No. of Lectures
No Topic
(40)

Introduction to component virtualization: 8 Hours

1

Basics of Virtualization – Types of Virtualization

1.1 1 hour

Implementation Levels of Virtualization

1.2 1 hour

Virtualization of CPU, Memory, I/O Devices

1.3 1 hour

Virtual clusters and resource management

1.4 1 hour

Live VM migration steps

1.5 1 hour

Migration of memory, files and network resources

1.6 1 hour

Desktop Virtualization –Server Virtualization Storage

1.7 Virtualization 1 hour

Network Virtualization
1.8 1 hour

Introduction to Cloud Computing 6 Hours

2
 INFORMATION TECHNOLOGY-IT1

System Models for Distributed and Cloud Computing

2.1 1 hour

NIST Cloud Computing Reference Architecture

2.2 1 hour

Features of Cloud Computing

2.3 1 hour

Cloud Services – IaaS, PaaS, SaaS

2.4 1 hour

Cloud service Providers – Public

2.5 1 hour

Cloud service Providers – Private and Hybrid Clouds. 1 hour

2.6

3 Architectural Design of Compute and Storage Clouds 6 Hours

Architectural Design of Compute and Storage Clouds

3.1 1 hour

Layered Cloud Architecture Development

3.2 1 hour

3.3 Design Challenges 1 hour

Inter Cloud Resource Management

3.4 1 hour

Resource Provisioning and Platform Deployment

3.5 1 hour

3.6 Global Exchange of Cloud Resources. 1 hour

4 Paradigms and Environments 10 Hours

Parallel and Distributed Programming Paradigms – Map

4.1 Reduce 1 hour

4.2 Twister and Iterative MapReduce 1 hour

Hadoop Library from Apache – Mapping Applications –

4.3 Programming Support 1 hour

4.4 Google App Engine 1 hour

 INFORMATION TECHNOLOGY-IT1

4.5 Amazon AWS 1 hour

4.6 Cloud Software Environments – Eucalyptus 1 hour

4.7 Open Nebula, OpenStack. 1 hour

4.8 Security in the cloud-overview 1 hour

4.9 Cloud security challenges 1 hour

Software-as-a-Service Security – Security Governance –

4.10 1 hour
Risk Management

5 Cloud security 10 Hours

5.1 Secure Software Development Lifecycle 1 hour

5.2 Security Monitoring 1 hour

5.3 Security Architecture Design 1 hour

5.4 Data Security – Application Security. VM security 1 hour

5.5 Cloud Security Architecture: Trusted cloud, 1 hour

5.6 Identity and access management, 1 hour

5.7 Access control in cloud, RBAC 1 hour

5.8 Autonomic security, protection, self-healing. 1 hour

5.9 Firewalls 1 hour

5.10 Web application firewall. 1 hour

 CODE COURSE NAME INAFTOERGMOARTYION LTE C
C THNPOLO
CG YD
RE -IT
IT1
PROGRAM
221EIT003 ETHICAL HACKING 3 0 0 3
ELECTIVE I

Preamble: The students are expected to understand the basic concepts of Ethical Hacking
and Penetration testing.

Course Outcomes: After the completion of the course the student will be able to

CO 1 Perform system security vulnerability testing

CO 2 Learn various hacking methods
CO 3 Perform system vulnerability exploit attacks
CO 4 Produce a security assessment report
CO 5 Recognize tools and methods to carry out penetration testing.

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1:An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2:An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3:An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor’s program

PO4:An ability to apply stream knowledge to design or develop solutions for real-world
problems by following the standards

PO5:An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tools to model, analyze and solve practical engineering problems.

PO6:An ability to engage in lifelong learning for the design and development related to the
stream-related problems taking into consideration sustainability, societal, ethical, and
environmental aspects

PO7:An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.
 Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 INFORMA5TION P
PO TOEC6HNOLP
OOG7Y-IT1
CO 1
CO 2
CO 3
CO 4
CO 5

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 80
Analyse 20
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)

Continuous Internal Evaluation Pattern:

The evaluation shall only be based on application, analysis or design-based questions (for both
internal and end-semester examinations).

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer-reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include a minimum of 80% of the syllabus.

 INFORMATION TECHNOLOGY-IT1

Course-based task/test paper questions shall be useful in the testing of knowledge, skills,
comprehension, application, analysis, synthesis, evaluation, and understanding of the students.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.

There will be two parts; Part A and Part B.

Part A will contain 5 numerical/short answer questions with 1 question from each module,
having 5 marks for each question. Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem-solving and quantitative evaluation), with a minimum of one
question from each module of which student should answer any five. Each question can carry
7 marks

The total duration of the examination will be 150 minutes.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.

For example, if the average end-semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.
Model Question Paper INFORMATION TECHNOLOGY-IT1

A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY

M.TECH DEGREE EXAMINATION
……SEMESTER
Branch:

Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Each question carries 5 marks)

1. Explain the terms Threat, Vulnerability, and Risk.

2. What are the different methods for managing insider threats?
3. What do you mean by ‘Vulnerability Scanner’? Draw the scanner and briefly explain
4. Explain in detail computer fraud classification according to the data processing
model?
5. Is there any method to demonstrate whether network infrastructure is adequate or not?
Justify your answer.

PART B (Answer any five questions. Each question carries 7 marks)

6. Being an expert in hacking, you are asked to analyze the free, open-source software
beingused to run FTP services on a server. You noticed that there is an excessive
numberoffgets() and gets() on the source code. These C++ functions do not check
bounds. Whatkind of attack is this program susceptible to? Comment on your
recommendation toprevent this attack.
7. Explain the type of attack facedby the stack data structure. Also, explain the uses of
two pointers used in a stack.
8. Illustrate how SQL injection attacks are done by attackers.
9. Discuss some architecture strategies for fraud prevention with respect to computer
network-enabled system
10. Explain IT infrastructure.
11. An attacker uses a distributed group of computers to shut down a single machine or
network making it inaccessible to its intended users? Explain the attack with the help
of a neatdiagram. What are the ways to prevent this attack?
12. Illustrate the process involved in understanding the inherent risk profile of a business
with relevant tables and assumptions
 Syllabus INFORMATION TECHNOLOGY-IT1

Module I: (8 Hours)

Introduction: CIA Triads, Hacking Impact, The Hacker Framework: Planning the test, Sound
operations,Reconnaissance, Enumeration, Vulnerability Analysis, Exploitation,Final
Analysis, and Deliverable.Integration Information Security Models: Computer Security,
NetworkSecurity, Service Security, Application Security.Security Architecture Information
Security Program: The Process ofInformation Security, Component Parts of Information
SecurityProgram, Risk Analysis, and Ethical Hacking.

Module II: (8 Hours)

The Business Perspective: Business Objectives, Security Policy,Previous Test Result.

Business Challenges Planning for a Controlled Attack: InherentLimitations Imposed
Limitations, Timing Everything, Attack Type,Source Point, Required Knowledge, Multi-
Phased Attack, Teaming
and Attack Structure, Engagement Planner, The Right SecurityConsultant, The Tester,
Logistics, Intermediates, Law Enforcement.

Module III: (8 Hours)

Preparing for a Hack: Technical Preparation, Managing theEngagement, Reconnaissance:

Social Engineering, Physical Security, and InternetReconnaissance.

Module IV: (8 Hours)

Enumeration: Enumeration Techniques, Soft Objective, LookingAround or Attack, Elements

of Enumeration.Preparing for the Next Phase Exploitation: Intuitive Testing, Evasion,Threads
and Groups, Operating Systems, Password Crackers, Rootkits,Applications, Wardialing,
Network, Services, and Areas of Concern

Module V: (8 Hours)

Deliverable: The Deliverable, The Document, Overall Structure,Aligning

Findings.Presentation Integration: Integrating the Results, Integration Summary,Mitigation,
Defense Planning, Incident Management, Security Policy

Reference Books
1. Hacking: The Art of Exploitation Jon Erikson 2nd edition

2. The Basics of Hacking and Penetration Testing Patrick Engebretson 2nd edition

3.The Hacker Playbook 2 Peter Kim 1st edition

4. Penetration Testing Georgia Weldman 1st edition.

5. The Web Application Hacker’s Handbook DafyddStuttard 2nd edition.

6. Staurt McClure, Joel Scambray and George INKFuO rtzR, M“AHTaIcOkN

ingTEECxH
poNsO
edLONGeY
tw-IoTr1
k
SecuritySecrets &Solutions”, Tata McGraw-Hill Publishers,2010 (6th Edition)
7. Bensmith and Brian Komer,”Microsoft Windows Security Resource Kit”, Prentice Hall
ofIndia,2010

Syllabus and Course Plan(For 3 credit courses, the content can be for 40 hrs, and for 2
credit courses, the content can be for 26 hrs. The audit course in the third semester can have
content for 30 hours).

No. of
No Topic Lectures
(40 Hours)
1 Module 1 8 Hours
1.1 Introduction: CIA Triads, Hacking Impact. 2
The Hacker Framework: Planning the test, Sound Operations,
Reconnaissance, Enumeration, Vulnerability Analysis,
1.2 2
Exploitation,
Final Analysis, and Deliverable.
Integration Information Security Models: Computer Security,
1.3 Network 2
Security, Service Security, Application Security
Security Architecture Information Security Program: The
Process of
1.4 2
Information Security, Component Parts of Information
SecurityProgram, Risk Analysis, and Ethical Hacking
2 Module 2 9 Hours
The Business Perspective: Business Objectives, Security Policy,
2.1 2
Previous Test Result
Business Challenges Planning for a Controlled Attack: Inherent
2.2 2
Limitations Imposed Limitations,
Timing Everything, Attack Type,
2.3 1
Source Point, Required Knowledge, Multi-Phased Attack
2.4 Teamingand Attack Structure, Engagement Planner, 2
The Right SecurityConsultant, The Tester, Logistics,
2.5 2
Intermediates, Law Enforcement.
3 Module 3 7 Hours
3.1 Preparing for a Hack: Technical Preparation, 1
3.2 Managing theEngagement 2
3.3 Reconnaissance: Social Engineering 2
Physical Security, and Internet
3.4 2
Reconnaissance.
4 Module 4 8 Hours
4.1 Enumeration: Enumeration Techniques, Soft Objective, 1
4.2 LookingAround or Attack, Elements of Enumeration. 2
Preparing for the Next Phase Exploitation: Intuitive Testing,
4.3 INFORMATION TECHNOLOGY-IT1
2
Evasion,
Threads and Groups, Operating Systems,
4.4 Password Crackers, Rootkits,Applications 2
4.5 Wardialing, Network, Services and Areas of Concern. 1
5 Module 5 8 Hours
Deliverable: The Deliverable, The Document, Overall Structure,
5.1 2
Aligning Findings
Presentation Integration: Integrating the Results, Integration
5.2 2
Summary
5.3 Mitigation, Defense Planning 2
5.4 Incident Management, Security Policy 2
 INFORMATION TECHNOLOGY-IT1
CODE COURSE NAME CATEGORY L T P CREDIT
SOFTWARE DEFINED PROGRAM
221EIT004 3 0 0 3
NETWORKS ELECTIVE 1

Preamble: The modern computer network has evolved into a complex beast that is
challenging to manage and that struggles to scale to the requirements of some of today’s
environments. SDN represents a new approach that attempts to address these weaknesses of
the current paradigm. This course introduces a highly scalable and centralized network
control SDN architecture introduced that is better suited to the extremely large networks
prevalent in today’s mega scale data centers.

Course Outcomes: After the completion of the course the student will be able to

CO 1 Explain the evolution of networking technology (Level: Understand)

Analyse the basic components of a Software Defined Networking system, their roles,
CO 2
and how they interact with one another(Level: Analyze)
Identify alternative SDN technologies that propose SDN solutions(Level:
CO 3
Understand)
Analyse the specific shortcomings that exist in data center networks today and
CO 4 identify the technologies that can be employed in the data centers with the advent of
SDN(Level: Analyze)
CO 5 Examine the applicability of SDN in various domains(Level: Apply)

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.
 INFORMATION TECHNOLOGY-IT1
PO6: An ability to engage in life-long learning for the design and development related to the
stream related problems taking into consideration sustainability, societal, ethical and
environmental aspects

PO7: An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1
CO 2
CO 3
CO 4
CO 5

Assessment Pattern

Bloom’s Category End Semester Examination

Apply 70%-80%
Analyse 20%-30%
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

Continuous Internal Evaluation: 40 marks

i) Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii) Course based task / Seminar/ Data collection and interpretation : 15 marks

iii) Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

 INFORMATION TECHNOLOGY-IT1
End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.

There will be two parts: Part A and Part B.
Part A will contain 5 numerical/short answer questions with 1 question from each module,
having 5 marks for each question. Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks.
Total duration of the examination will be 150 minutes.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.
For example, if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Explain the traditional switching architecture.

2. What are the new requirements emerging from the technological advances taking place
now in data center environments. How it is changing the traditional switching
architecture?

Course Outcome 2 (CO2)

1. What are the functionalities of a SDN controller? Demonstrate the working of SDN
Controller.

2. Explain how an SDN devices communicate. Illustrate the working using a software
switch. How it is different from a hardware switch?

Course Outcome 3(CO3):

1. “Open SDN is often depicted as a single controller responsible for overseeing the
operation of the entire network”, What is its main disadvantage? What are the alternative
solutions available to over this disadvantage?

2. Explain how legacy APIs can be used to implement SDN?

 INFORMATION TECHNOLOGY-IT1
Course Outcome 4 (CO4):

1. What are the demands of Data centers on the capacity of network components? Suggest
two the methods to overcome these demands.

2. Explain the stateless transport tunnelling. How is it used for network virtualization?

Course Outcome 5 (CO5):

1. Simulate SDN applied on a WAN.

2. What are the characteristics of a campus network? Demonstrate how SDN can be applied
to on a campus network.

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: 221EIT004

Course Name: SOFTWARE DEFINED NETWORKS

Max. Marks : 60 Duration: 2.5 Hours

PART A

Answer All Questions. Each Question Carries 5 Marks(5x5=25 Marks)

1. Explain traditional switch architecture. Analyse how it affects the modern

networking applications.
2. Demonstrate how moving the control plane off the switching device and onto a
centralized controller improves forwarding of incoming packet?
3. What are the limitations of Open SDN implementations? Identify alternative
solutions available.
4. Inspect the SDN implementation of through SDN via Opening Up the Device.
5. Distinguish the between two general styles of SDN applications, based on
communication between the switch and the controller.
 INFORMATION TECHNOLOGY-IT1
Part B
(Answer any five questions. Each question carries 7 marks)
6. Illustrate the evolution of switches and control planes that has culminated in a (7)
fertile playing field for SDN.
7. Explain the fundamental characteristics of SDN. (7)

8. Demonstrate the communication between the controller and the device using (7)
OpenFlow protocol.
9. Using a Suitable example, explain SDN implemented via hypervisor-based (7)
overlay technology.
10. What is multipath routing? What are the technologies are available in order to (7)
achieve multipath routing?
11. From a data center's perspective, how is multitenancy achieved in SDN via (7)
Overlays, Open SDN and SDN via APIs?
12. How is SDN applied to service providers and carrier networks? Give an (7)
example.

Syllabus

Module 1: Why SDN?

Introduction - Basic Packet-Switching Terminology, Historical background, The Modern
Data Center, traditional Switch Architecture, Autonomous and Dynamic Forwarding Tables,
Can We Increase the Packet- Forwarding IQ, Open Source and Technological Shifts,
Evolution of Switches and Control Planes, Cost, SDN Implications forResearch and
Innovation, DataCenter Innovation, Data Center Needs, Genesis of SDN – TheEvolution of
Networking Technology, Forerunners of SDN, Software DefinedNetworking is Born
Sustaining SDN Interoperability ,Open Source Contributions, Legacy Mechanisms Evolve
Toward SDN, Network Virtualization

Module 2: How SDN Works?

Fundamental Characteristics of SDN,SDN Operation, SDN Devices, SDNController, SDN
Applications, Alternate SDN Methods, Open Flow Overview, Basics, Additions, Limitations.

Module 3: Alternative Definitions of SDN

Potential Drawbacks ofOpen SDN, SDN via APIs, SDN via Hypervisor-Based Overlays,
SDN via Opening Up the Device, Network Functions Virtualization, Alternatives Overlap
and Ranking.

Module 4: SDN in Data Centers

Data Center Definition, Data Center Demands, Tunneling Technologies for the Data Center,
Path Technologies inthe Data Center, Ethernet Fabrics in the Data Center, SDN Use Cases in
 INFORMATION TECHNOLOGY-IT1
the Data Center, Comparison of OpenSDN, Overlays and APIs in the Data Center, Real-
World Data Center Implementations.

Module 5: Application of SDN

Implementations of SDN in Other Environments - Wide Area Networks,Service Provider and
Carrier Networks, Campus Networks, Hospitality Networks, Mobile Networks,In-Line,
Network Functions, Optical Networks, SDN vs. P2P/Overlay Networks Players in the SDN
Eco-system, SDN Applications - Application Types, Using Floodlight for Training Purposes,
A Simple Reactive Java Application, Controller Considerations, Network Device
Considerations, Offloading Flows in the Data Center, Access Control for the Campus

Reference Books

1. Paul Goransson and Chuck Black, ―Software Defined Networks: A Comprehensive

Approach, Second Edition, Morgan Kaufmann, 2014.
2. Thomas D. Nadeau, Ken Gray, ―SDN: Software Defined Networks, O'Reilly Media,
2013.
3. Siamak Azodolmolky, ―Software Defined Networking with Open Flow, Packet
Publishing, 2013.
4. Cheng Sheng, Jie Bai, Qi Sun, “Sofware-Defned Wide Area Network Architectures and
Technologies”, CRC Press, 2021
5. Dijiang Huang, Ankur Chowdhary, Sandeep Pisharody, “Software-DefinedNetworking
andSecurityfrom Theory to Practice”, CRC Press 2019.

Course Plan

No. of
No Topic Lectures
40 Hours
1 Why SDN? (9 Hours)
Introduction - Basic Packet-Switching Terminology, Historical
1.1 2 Hours
background, The Modern Data Center, traditional Switch Architecture
Autonomous and Dynamic Forwarding Tables, Can We Increase the
1.2 2 Hours
Packet- Forwarding IQ, Open Source and Technological Shifts
Evolutioann of Switches and Control Planes, Cost, SDN Implications
1.3 2 Hours
forResearch d Innovation,DataCenter Innovation, Data Center Needs
Genesis of SDN – TheEvolution of Networking Technology,
1.4 1 Hour
Forerunners of SDN
1,5 Software DefinedNetworking is Born Sustaining SDN Interoperability 1 Hour
Open-Source Contributions, LegacyMechanisms Evolve Toward SDN,
1.6 1 Hour
Network Virtualization
2 How SDN Works?(7 Hours)
2.1 Fundamental Characteristics of SDN,SDN Operation, SDN Devices 2 hours
 INFORMATION TECHNOLOGY-IT1
2.2 SDNController 2 Hours
2.3 SDN Applications, Alternate SDN Methods 1 Hour
2.4 OpenFlow Overview, Basics,Additions, Limitations. 2 Hours
3 Alternative Definitions of SDN(8 Hours)
3.1 Potential Drawbacks ofOpen SDN, SDN via APIs 2 Hours
3.2 SDN via Hypervisor-Based Overlays 2 Hours
3.3 SDN via Opening Up the Device 2 Hours
3.4 Network Functions Virtualization, Alternatives Overlap and Ranking 2 Hours
4 SDN in Data Centers(8 Hours)
Data Center Definition, Data CenterDemands, Tunneling Technologies
4.1 2 Hours
for the Data Center
4.2 Path Technologies inthe Data Center 1 Hour
4.3 Ethernet Fabrics in the Data Center 2 Hours
4.4 SDN Use Cases in the Data Center 1 Hour
Comparison of OpenSDN, Overlays and APIs in the Data Center, Real-
4.5 2 Hours
World Data CenterImplementations.
5 Application of SDN(8 Hours)
Implementations SDN in Other Environments - Wide Area
5.1 2 Hours
Networks,Service Provider and Carrier Networks
5.2 Campus Networks,HospitalityNetworks,MobileNetworks, 2 Hours
In-Line, NetworkFunctions,OpticalNetworks,SDN vs. P2P/Overlay
5.3 2 Hours
NetworksPlayers in the SDN Eco-system
SDN Applications - Application Types, Using Floodlight for Training
Purposes, A Simple Reactive Java Application, Controller
5.4 2 Hours
Considerations, Network Device Considerations, Offloading Flows in
the Data Center, Access Control for the Campus
 CODE COURSE NAME CATEGORY L T P CREDIT
INTRUSION DETECTION AND IP
NRFO
OGRR
MA TION TECHNOLOGY-IT1
AM
221EIT005 3 0 0 3
PREVENTION SYSTEMS ELECTIVE I

Preamble: The students are expected to understand the intrusion detection tools and techniques in
order to provide security in a network.

Course Outcomes: After the completion of the course, the student will be able to

CO 1 Explain the possible attacks in computer networks (Level : Understand)

CO 2 Describe the principles and techniques in intrusion detection (Level: Understand)
CO 3 Analyse data collection for host-based and network-based IDSs (Level: Analyse)
Use various protocol analyzers and Network Intrusion Detection Systems as security
CO 4
tools to detect network attacks and troubleshoot network problems. (Level : Apply)
CO 5 Understand intrusion infrastructure (Level: Understand)

Program Outcomes ( PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3: An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.

PO6: An ability to engage in life-long learning for the design and development related to the
stream related problems taking into consideration sustainability, societal, ethical and
environmental aspects

PO7: An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.
 INFORMATION TECHNOLOGY-IT1
Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1
CO 2
CO 3
CO 4
CO 5

Assessment Pattern

Bloom’s Category End Semester Examination

Understand 50 %
Apply 30 %
Analyse 20 %
Evaluate
Create

Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern: INFORMATION TECHNOLOGY-IT1

The end semester examination will be conducted by the respective College.

There will be two parts; Part A and Part B.
Part A will contain 5 numerical/short answer questions with 1 question from each module,
having 5 marks for each question. Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks
Total duration of the examination will be 150 minutes.
Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.
For example if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.

Course Level Assessment Questions

Course Outcome 1 (CO1):

1. What type of attack is privilege escalation?

2. What kind of attack methods are used in a network?

3. How to prevent Mitnick attack?

Course Outcome 2 (CO2)

1.What are the methods of anomaly detection?

2.What is hybrid-based intrusion detection system?

3. Do routers play a role in intrusion detection? Explain

Course Outcome 3(CO3):

1. What is the significance of TCP dump filters?

2.What type of data is collected by intrusion detection systems?

3.What does a host-based IDS monitor?

Course Outcome 4 (CO4):

1. How protocol analyzer provide security to the network?

2.Write the format of snort options

 INFORMATION TECHNOLOGY-IT1
Course Outcome 5 (CO5):

1. Compare centralized and distributed intrusion detection systems

2. How can you prevent Mitnick attack?

3. How can you differentiate automated and manual response?

Model Question Paper

QP CODE:

Reg No:

Name: PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: .............

Course Name: INTRUSION DETECTION AND PREVENTION SYSTEMS

Max. Marks : 60 Duration: 2.5

Hours

PART A

Answer All Questions. Each Question Carries 5 Marks

1. Do routers play a role in intrusion detection? Explain.

2. Write the function of packet-filtering devices.
3. What is meant by Host-based IDS?
4. What is TCPdump filter?
5. How to prevent Mitnick attack? (5x5=25)
Part B
(Answer any five questions. Each question carries 7 marks)
6. (a) (4)
Differentiate Denial of Service and Distributed denial of Service attacks.
(b) Explain Buffer Overflow Attacks (3)
7. (a) Explain smurf attack . (5)
(b) What is DNS resolution Process? (2)
8. Compare centralized and distributed intrusion detection systems (7)
9. Discuss about Snort Rules. (7)
INFORMATION TECHNOLOGY-IT1
10 Write notes on Architectural issues. (7)
11 (a) What is quantitative risk assessment? (3)
(b) Explain threat assessment and analysis. (4)
12 Discuss about Automated responses. (7)

Syllabus

Module 1: Introduction

Network Attacks: Attack taxonomies, Probes, Privilege Escalation Attacks, Denial of Service
and distributed Denial of service attacks, Worms attack, Routing attacks Detection approaches
– Anomaly detection -Misuse detection - specification based detection – hybrid detection

Module 2: TCP/IP

IP concepts, Introduction to TCPdump and TCP Fragmentation, ICMP Stimulus and

Response, DNS Packet Dissection using TCPdump, Examining IP header fields Examining
embedded protocol Header fields, Real world Analysis

Module 3: Data Collection

Data Collection for Host-Based IDSs- Audit Logs, System Call Sequences Data Collection for
Network-Based IDSs- SNMP, Packets, Limitations of Network -Based IDSs, Data Collection
for Application- Based IDSs, Data Collection for Application -Integrated IDSs, Hybrid Data
Collection

Module 4: Filters/Rules for Network Monitoring

Writing TCPdump filters, Introduction to Snort Rules, Snort Rules -Part II, Detection of
Intelligent Gathering

Module 5: Intrusion Infrastructure

Mitnick attack, Architectural issues, Organizational issues, Automated and manual response,
Business case for Intrusion Detection, Future directions

Reference Books

1. Ali A. Ghorbani, Wei Lu, “Network Intrusion Detection and Prevention: Concepts and
Techniques”, Springer, 2010

2. Stephen Northcutt, Judy Novak, “Network Intrusion Detection and Prevention”, New
Riders Publishing , 2002
3. Carl Enrolf, Eugene Schultz, Jim Mellander, “Intrusion detection and Prevention”,
McGraw Hill, 2004 INFORMATION TECHNOLOGY-IT1

3. Paul E. Proctor, “The Practical Intrusion Detection Handbook “,Prentice Hall , 2001.

4. Ankit Fadia and Mnu Zacharia, “Intrusion Alert”, Vikas Publishing house Pvt., Ltd, 2007.

5. Earl Carter, Jonathan Hogue, “Intrusion Prevention Fundamentals”, Pearson Education,

2006.

Course Plan

Topic No. of
No
Lectures (40 )
1 Module 1: Introduction 6 Hours
Network Attacks: Attack taxonomies, Probes, Privilege Escalation
1.1 2 Hour
Attacks,
Denial of Service and distributed Denial of service attacks, Worms
1.2 2 Hour
attack, Routing attacks
Detection approaches – Anomaly detection -Misuse detection -
1.3 2 Hours
specification based detection – hybrid detection
2 Module 2: TCP/IP 10 Hours
2.1 IP concepts, Introduction to TCPdump and TCP 2 Hour
2.2 Fragmentation, ICMP 2 Hours
2.3 Stimulus and Response, DNS 2 Hours
2.4 Packet Dissection using TCPdump, Examining IP header fields 2 Hours
2.5 Examining embedded protocol Header fields, Real world Analysis 2 Hours
3 Module 3: Data Collection 8 Hours
Data Collection for Host-Based IDSs- Audit Logs, System Call
3.1 2 Hour
Sequences
Data Collection for Network-Based IDSs- SNMP, Packets,
3.2 2 Hour
Limitations of Network -Based IDSs
3.3 Data Collection for Application- Based IDSs 2 Hour
Data Collection for Application -Integrated IDSs, Hybrid Data
3.4 2 Hours
Collection
4 Module 4: Filters/Rules for Network 8 Hours
4.1 Writing TCPdump filters 2 Hours
4.2 Introduction to Snort Rules 2 Hours
4.3 Snort Rules -Part II 2 Hours

4.4 Detection of Intelligent Gathering 2 Hours

5 Module 5: Intrusion Infrastructure 8 Hours
5.1 Mitnick attack, Architectural issues 2 Hours
5.2 Organizational issues 2 Hours
5.3 Automated and manual response INFORMATION TECHNOL2OHGoY
ur-sIT1

5.4 Business case for Intrusion Detection, Future directions 2 Hours

 INFORMATION TECHNOLOGY-IT1

SEMESTER I
PROGRAM ELECTIVE II
 INFORMATION TECHNOLOGY-IT1
CODE COURSE NAME CATEGORY L T P CREDIT
WEB TECHNOLOGIES AND PROGRAM
221EIT006 3 0 0 3
WEB SECURITIES ELECTIVE 2

Preamble: This course helps the learner to understand the fundamental ideas of Web
Application Development using HTML5, CSS3, JavaScript and detailed knowledge about
server-side programming using PHP and Frameworks.

Course Outcomes: After the completion of the course the student will be able to:

Demonstrate an understanding in web application development using HTML and

CO 1
CSS3 (Cognitive Knowledge Level: Apply)
Implement web applications using client-side scripting (Cognitive Knowledge
CO 2
Level: Apply)
Implement web applications using server-side scripting
CO 3
(Cognitive Knowledge Level: Apply)
Implement session management and object-oriented programming using PHP.
CO 4
(Cognitive Knowledge Level: Apply)
Understand the principles of web security and encoding schemes (Cognitive
CO 5
Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
CO 1 ✓ ✓ ✓ ✓ ✓ ✓ ✓

CO 2 ✓ ✓ ✓ ✓ ✓ ✓ ✓

CO 3 ✓ ✓ ✓ ✓ ✓ ✓ ✓

CO 4 ✓ ✓ ✓ ✓ ✓ ✓ ✓

CO 5 ✓ ✓ ✓ ✓ ✓ ✓ ✓

Assessment Pattern

Bloom’s Category End Semester Examination

Understand 20%
Apply 80%
Analyse
Evaluate
Create
 INFORMATION TECHNOLOGY-IT1
Mark distribution

Total ESE
CIE ESE
Marks Duration

100 40 60 2.5 hours

Continuous Internal Evaluation: 40 marks

Preparing a review article based on peer reviewed

Original publications (minimum 10 15 marks

Publications shall be referred):

Course based task/Seminar/Data 15 marks

Collection and interpretation:

Test paper, 1 no.: 10 marks

Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern: 60 marks

The end semester examination will be conducted by the respective College. There will be two
parts; Part A and Part B. Part A will contain 5 numerical/short answer questions with 1
question from each module, having 5 marks for each question (such questions shall be useful
in the testing of knowledge, skills, comprehension, application, analysis, synthesis, evaluation
and understanding of the students).Students should answer all questions. Part B will contain 7
questions (such questions shall be useful in the testing of overall achievement and maturity of
the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly. For example if the average end semester mark % for
a core course is 40, then the maximum eligible mark % for an elective course is 40+20 = 60
%.
 INFORMATION TECHNOLOGY-IT1
Syllabus

Module – 1 (8 hours)

Introduction: Web essentials – Clients – Servers – Communications – Mark-up Languages –

HTML 5 – XHTML – Style sheets – CSS3.

Module – 2 (8 hours)

Client-side Scripting: Client-side Scripting using JavaScript – Syntax – Control Structures –

Arrays and Objects – In-built objects-Host Objects: Browsers and the DOM

Module: 3 (7 hours)

Server-side Scripting: Introduction to PHP – Variables – Control Structures – Syntax –

Arrays – Built-in Arrays – Form Processing-Object Oriented PHP.

Module: 4 (8 hours)

Database Applications: PHP with MySQL – mysql interface – MySQLi interface – Object
Oriented Version of MySQLi

Module: 5 (8 hours)

Introduction to security testing Fundamentals - HTTP – Client-side scripting - Server-side

scripting, Basic observation - observing live request headers, observing live post data,
highlighting and detecting JavaScript events. Web oriented data encoding – working with
base-36, base-64, URL encoded and HTML entity data.
 INFORMATION TECHNOLOGY-IT1
Model Question Paper

A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY

M.TECH DEGREE EXAMINATION
……SEMESTER
Branch:
Time: 2½ Hours, Maximum marks: 60

PART A (Answer all questions. Five marks each)

1. List all of the generic Internet top-level domains

2. Differentiate between MySQL and MySQLi

3. List out the features of Security Testing

4. Explain the usage of switch case statement in PHP with example

5. Write JavaScript code that will create an Object with a property named color having a
String value of red

PART B(Answer any five questions. Seven marks each)

6. Write a style sheet that will cause the li elements within any ol element to be
numbered in an outline style: the top-level li elements should use uppercase Roman
numerals, the next level uppercase letters, the next level lowercase Roman numerals,
then lowercase letters, and finally decimal numerals at the fifth level

7. What is the purpose of the HTML title attribute (not element)? Describe a scenario in
which this attribute might be particularly helpful to a Web site user

8. Assume that you are adding JavaScript code to an HTML document that contains a
form with a submit button. You did not modify any of the HTML or add an event
listener for the click event on this button, and yet the button stopped working after
you added your code to the document. Give at least two possible explanations.

9. Contrast the IE6 and DOM approaches to modifying an intrinsic event attribute,
giving at least one advantage of each approach over the other.

10. Write in detail about PHP sessions

11. Explain aggregate functions in MySQL with example

12. How Live Request Headers are observed with Firebug

13. Describe in a detailed way different types of Web oriented data encoding techniques

.
 INFORMATION TECHNOLOGY-IT1
Syllabus and Course Plan

No Topic No. of
Lectures
Module – 1 (8 hours)

1.1 Introduction: Web essentials 2

1.2 Clients – Servers – Communications 2
1.3 Mark-up Languages – HTML 5 – XHTML 2
1.4 Style sheets – CSS3 2
Module – 2 (8 hours)

2.1 Client Side Scripting using JavaScript – Syntax 2

2.2 Control Structures – Arrays and Objects 2
2.3 In-built objects 2
2.4 Host Objects: Browsers and the DOM 2
Module: 3 (8 hrs)

3.1 Server-side Scripting: Introduction to PHP 2

3.2 Variables – Control Structures – Syntax 2
3.3 Arrays – Built-in Arrays – Form Processing 2
3.4 Object Oriented PHP 2
Module: 4 (8 hrs)

4.1 Database Applications: PHP with MySQL 3

4.2 mysql interface 2
4.3 MySQLi interface 2
4.4 Object Oriented Version of MySQLi 1
Module: 5 (8 hrs)

5.1 Introduction to security testing Fundamentals - HTML - HTTP 2

5.2 Client-side scripting - Server-side scripting 2
5.3 Basic observation observing live request headers, observing live post
2
data, highlighting and detecting JavaScript events.
5.4 Web oriented data encoding – working with base36, base 64, URL
2
encoded and HTML entity data.
 INFORMATION TECHNOLOGY-IT1
Reference Books

1. Jeffrey C Jackson, ―Web Technology – A Computer Science Perspective‖, Pearson

Education, 2007.

2. Brian P Hogan, ―HTML5 and CSS3: Develop with Tomorrow's Standards Today‖,
Pragmatic Bookshelf, 2010.

3. W Jason Gilmore, ―Beginning PHP and MySQL: From Novice to Professional‖,

Apress, 2010.

4. Paco Hope, Ben Walther, ―Web Security Testing Cookbook: Systematic Techniques
to Find Problems Fast‖, O'REILLY media, 2009.
 INFORMATION TECHNOLOGY-IT1
CODE COURSE NAME CATEGORY L T P CREDIT

IOT ARCHITECTURE PROGRAM

221EIT007 3 0 0 3
AND PROTOCOLS ELECTIVE 2

Preamble: The syllabus is designed with the view of preparing the students capable of
understanding different architectures, protocols, and security aspects of Internet of Things.

The students will get to know about the IoT Architectures, protocols and security systems, and
methods to secure the same.

Course Outcomes: Upon completion, the student will be able to

Apply the basic design and architecture of IoT to real-world problems.

CO 1
(Cognitive Level: Apply)

Identify Data link layer, network layer and transport layer protocols for IoT.
CO 2
(Cognitive level: Apply)

Identify session layer and application layer protocols for IoT.

CO 3
(Cognitive level: Apply)

Implement novel Internet of Things applications.

CO 4
(Cognitive level: Apply)

Analyze the security issues and challenges in IoT, choose Security and Privacy
CO5 algorithms, and implement appropriate security measures
(Cognitive level: Apply)

Program Outcomes (PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1: An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2: An ability to communicate effectively, write and present technical reports on

complex engineering activities by interacting with the engineering fraternity and with
society at large.
 PO3: An ability to demonstrate a degree of masterIyNoFvOeR
r tM
heAaTrIeO
aNas TpE
erCtH
heNsO
peLcO
iaG
lizYa-tIiT
on1
of the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

PO4: An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5: An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyze and solve practical engineering problems.

PO6: An ability to engage in life-long learning for the design and development related to
the stream related problems taking into consideration sustainability, societal, ethical
and environmental aspects

PO7: An ability to develop cognitive load management skills related to project

management and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1

CO 2

CO 3

CO 4

CO5
 INFORMATION TECHNOLOGY-IT1
Assessment Pattern

Bloom’s Category End Semester Examination

Apply 100%

Analyse

Evaluate

Create

Mark distribution

Total Marks CIE ESE ESE Duration

100 40 60 2.5 hours

Continuous Internal Evaluation Pattern:

Evaluation shall only be based on application, analysis or design based questions (for both internal
and end semester examinations).

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

 INFORMATION TECHNOLOGY-IT1

Course based task/test paper questions shall be useful in the testing of knowledge, skills,
comprehension, application, analysis, synthesis, evaluation and understanding of the students.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College.
There will be two parts; Part A and Part B.
Part A will contain 5 numerical/short answer questions with 1 question from each module, having
5 marks for each question. Students should answer all questions. Part B will contain 7 questions
(such questions shall be useful in the testing of overall achievement and maturity of the students
in a course, through long answer questions relating to theoretical/practical knowledge,
derivations, problem solving and quantitative evaluation), with minimum one question from each
module of which student should answer any five. Each question can carry 7 marks
Total duration of the examination will be 150 minutes.
Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly.
For example if the average end semester mark % for a core course is 40, then the maximum
eligible mark % for an elective course is 40+20 = 60 %.
 INFORMATION TECHNOLOGY-IT1
Model Question Paper:

QP CODE: Reg No:

Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

221EIT007

IoT Architectures and Protocols

Max. Marks : 60 Duration: 2.5 hrs

PART A

Answer All Questions. Each Question Carries 5 Marks

1. Explain any two challenges and its solution to implement smart charging of (5)
vehicles.
2. In which scenario, users can opt 6LoWPAN and RPL? Find suitable (5)
application.
3. Why HTTP is not suitable for IoT applications? (5)
4. What is the basic difference between the IoT network and Wireless Sensor (5)
Network?

5. Why Light weight cryptographic algorithms are used to establish security in (5)
IoT? (5x5=25)
Part B
(Answer any five questions. Each question carries 7 marks)
6. (7)
Develop a physical design.for smart parking in IoT systems
 INFORMATION TECHNOLOGY-IT1
7. (7)
Depict the IoT reference architecture. Explain the same with the help of neat
diagram.

8. (7)
Illustrate the role of data protocol MQTT and CoAP in IoT.

9. (7)
In which scenario users can opt WiFi, Bluetooth and Zigbee? Find suitable
application.

10. (7)
How IOT deployment is done in Raspberry Pi /Arduino/Equivalent
platform? Provide necessary examples and diagrams wherever necessary

11. (7)
Describe the technologies that enable IoT .How to create a new mote using
cooja simulator?

12. (7)
Explain the Homomorphic Encryption Schemes and Key Agreement in IoT
security.

Syllabus

Module I:Architecture for IoT

Architectural approach towards the future Internet of Things- Definitions and Functional
Requirements, Possible Architecture for the Future Internet of Things.Characteristics of IoT -
Challenges and Issues - Physical Design of IoT, Logical Design of IoT , Software Design-
Control Units,IoT Functional Blocks.IETF Architecture for IoT, IoT Reference Architecture.
Examples of IoT infrastructure,

Module II:IoT protocols –DDL,NWL,TL

IoT Data Link Layer & Network Layer Protocols PHY/MAC Layer (3GPP MTC, IEEE 802.11,
IEEE 802.15), Wireless HART, Z Wave, WiFi, Bluetooth Low Energy, Zigbee Smart Energy,
Network Layer-IPv4,IPv6, 6LoWPAN, DHCP, ICMP, RPL, CORPL, CARP, IoT Transport
Layer Protocols: -TCP, MPTCP, UDP, DCCP, TLS, DTLS

Module III:

IoT protocols-Session Layer,Application Layer andService LayerIoT Session Layer Protocols

andApplication Layer Protocols-: CoAP, XMPP, AMQP, MQTT,DDS, IoT Service Layer
Protocols & Security Protocols: -M2M, OMA, BIB
NFF,O
IPR
SM
ecATVIP
ONN, TsEeC
cuH
reNODLNOSG
, YS-eITcu1re
HTTP, HTTPS

Module IV:

Technologies behind IoT,Four pillars of IoT paradigm, - RFID, Wireless Sensor Networks,
SCADA (Supervisory Control and Data Acquisition), M2M - IoT Enabling Technologies -
BigData Analytics, Cloud Computing, Embedded Systems.

Programming the microcontroller for IoT:-Working principles of sensors – IoT deployment for
Raspberry Pi /Arduino/Equivalent platform – Reading from Sensors, Communication:
Connecting microcontroller with mobile devices –communication through Bluetooth, wifi, and
USB - Contiki OS- Cooja Simulator.

Module V:

Security and Privacy in the IoT, Security Issues in the IoT, Security Mechanisms -Traditional vs
Lightweight security- Symmetric-key LWC Algorithms- Public-key (Asymmetric) LWC
Algorithms- Lightweight Cryptographic Hash Functions. Homomorphic Encryption Schemes,
Key Agreement, Distribution, and Security Bootstrapping.Case studies: IoT for smart cities,
health care, agriculture, smart meters.M2M, Web of things, Cellular IoT, Industrial IoT, Industry
4.0,IoT standards.

Course Plan(40 Hours)

No. of Lectures
No Topic
(40)

1 Architecture for IoT(8 hours)

Architectural approach towards the future Internet of

1.1 Things- Definitions and Functional Requirements, Possible 1 hour
Architecture for the Future Internet of Things.

1.2 Characteristics of IoT - Challenges and Issues 1 hour

1.3 Physical Design of IoT, Logical Design of IoT 1 hour

1.4 Software Design-Control Units, 1 hour

1.5 IoT Functional Blocks 1 hour

 INFORMATION TECHNOLOGY-IT1
1.6 IETF Architecture for IoT 1 hour

1.7 IoT Reference Architecture. 1 hour

1.8 Examples of IoT infrastructure 1 hour

2 IoT protocols –DDL,NWL,TL(8 hours)

IoT Data Link Layer -PHY/MAC Layer (3GPP MTC,

2.1 2hour
IEEE 802.11, IEEE 802.15)

2.2 Wireless HART, Z Wave 1 hour

2.3 WiFi, Bluetooth Low Energy 1 hour

2.4 Zigbee Smart Energy 1 hour

Network Layer-IPv4,IPv6, 6LoWPAN, DHCP, ICMP,

2.5 2hour
RPL, CORPL, CARP

IoT Transport Layer Protocols : -TCP, MPTCP, UDP,

2.6 1 hour
DCCP, TLS, DTLS

3 IoT protocols- Session Layer, Application Layer and Service Layer(8 hours)

IoT Session Layer Protocols and Application Layer

3.1 2hour
Protocols-: CoAP, XMPP

3.2 AMQP 1 hour

3.3 MQTT,DDS 1 hour

3.4 IoT Service Layer Protocols: -M2M, OMA, BBF 2hour

3.5 Security Protocols-IPSec VPN 1 hour

3.6 secure DNS, Secure HTTP,HTTPS 1 hour

 INFORMATION TECHNOLOGY-IT1
4 Technologies behind IoT (8 hours)

Four pillars of IOT paradigm, - RFID, Wireless Sensor

4.1 1 hour
Networks, SCADA,M2M

IOT Enabling Technologies - BigData Analytics, Cloud

4.2 1 hour
Computing, Embedded Systems.

Programming the microcontroller for IoT :-Working

4.3 1 hour
principles of sensors

IOT deployment for Raspberry Pi /Arduino/Equivalent

4.4 1 hour
platform

Reading from Sensors, Communication: Connecting

4.4 1 hour
microcontroller with mobile devices

4.5 communication through Bluetooth, wifi and USB 1 hour

4.6 Contiki OS- Cooja Simulator. 2 hour

5
Security and Privacy in the IoT(8 hours)

Security Issues in the IoT , Security Mechanisms -

5.1 1 hour
Traditional vs Lightweight security

Symmetric-key LWC Algorithms- Public-key

5.2 1 hour
(Asymmetric) LWC Algorithms

5.3 Lightweight Cryptographic Hash Functions 1 hour

5.4 Homomorphic Encryption Schemes 1 hour

5.5 Key Agreement, Distribution, and Security Bootstrapping. 1 hour

Case studies: IoT for smart cities, health care, agriculture,

5.6 1 hour
Smart meters.
 INFORMATION TECHNOLOGY-IT1
5.7 M2M, Web of things 1 hour

5.8 Cellular IoT, Industrial IoT, Industry 4.0,IoT standards. 1 hour

Reference Books

1. Simone Cirani, Gianluigi Ferrari, Marco Picone, Luca Veltri. Internet of Things:
Architectures, Protocols and Standards, 1st edition, Wiley Publications, 2019.
2. Bahga, Arshdeep, and Vijay Madisetti. Internet of Things: A hands-on approach, 1st
edition,University press, 2014
3. Dr. Ovidiu Vermesan, Dr Peter Friess, Internet of Things: Converging Technologies for
Smart Environments and Integrated Ecosystems, River Publishers, 2013
4. Vermesan, Ovidiu, and Peter Friess, eds. Internet of things-from research and innovation
to market deployment, 1st edition, Aalborg: River publishers, 2014.
5. Tsiatsis, Vlasios, Tsiatsis, Vlasios, Stamatis Karnouskos, Jan Holler, David Boyle, and
Catherine Mulligan, Internet of Things: technologies and applications for a new age of
intelligence, 2nd edition, Academic Press, 2018.
 INFORMATION TECHNOLOGY-IT1

CODE: COURSE NAME: CATEGORY L T P CREDIT

PROGRAM
221EIT008 STORAGE MANAGEMENT
ELECTIVE 3 0 0 3
AND SECURITY
2

Preamble: This course aims at introducing the students to the various storage architectures, their
management, and security aspects.

Course Outcomes: After the completion of the course, the student will be able to

CO Bloom's Category
Course Outcome (CO)
No. Level

Choose from various storage technologies the one that suits

CO 1 Apply
the required application

Explain the storage system principles including structure,

CO 2 Understand
host I/O processing,and core algorithms

Explain key characteristics, services, deployment models,

CO 3 Understand
and infrastructurecomponents for a cloud computing

CO 4 Design business continuity plan Apply

CO 5 Analyze networked storage capabilities Apply

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1

CO 2

CO 3
 INFORMATION TECHNOLOGY-IT1

CO 4

CO 5

Assessment Pattern

Bloom’s Category Levels End Semester Examination

BL 2: Understand 60 %

BL 3: Apply 40 %

BL 4: Analyze

BL 5: Evaluate

BL 6: Create

Mark distribution

Continuous
End Semester
Total Internal
Examination ESE Duration
Marks Evaluation
(ESE)
(CIE)

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)
 INFORMATION TECHNOLOGY-IT1

Continuous Internal Evaluation (CIE) Pattern:

Preparing a review article based on peer reviewed

original publications (minimum 10publications shall be referred): 15 marks

Course-based task/Seminar/Data collection and interpretation: 15 Marks

Test paper (one only): 10 Marks

Each student shall prepare the review article based on peer reviewed publications (refer
minimum 10 original publications). The test paper shall include a minimum of 80% of the
syllabus.

End Semester Examination (ESE) Pattern:

There shall be two parts; Part A and Part B. Part A shall contain five (numerical) questions (such
questions shall be useful in the testing of knowledge, skills, comprehension, application,
analysis, synthesis, evaluation, and understanding of the students), with one question from each
module, having five marks for each question. Students shall answer all questions. Part B shall
contain seven questions (such questions shall be useful in the testing of overall achievement and
maturity of the students in a course, through long answer questions relating to
theoretical/practical knowledge, derivations, problem-solving, and quantitative evaluation), with
at least one question from each module, of which, the student shall answer any five. Each
question shall carry seven marks.
 INFORMATION TECHNOLOGY-IT1

Model Question Paper

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FIRST SEMESTER M.TECH

DEGREE EXAMINATION, MONTH & YEAR

Course Code: 221EIT008

Course Name: Storage Management and Security

Max.Marks: 60

Duration: 2½ Hours,

PART A (Answer all questions. Five marks each)

1. What is a distributed storage system and why is it important?

2. Describe the concept of RAID and different RAID levels in detail?
3. Write short notes on Storage Management activities.
4. Write short notes on Backup Granularity.
5. What are different file sharing protocols and what are the I/O operations of a file?

PART B (Answer any five questions. Seven marks each)

6. Explain Information Storage.

7. Explain Explain the SCSI command model.
8. What are the components of NAS? Explain NAS Implementations.
9. Explain various forms of virtualization & Storage virtualization challenges.
10. Explain the concept of Storage security domains,
11. Explain Risk Triad.
12. Write a brief note on cloud computing infrastructure.
 INFORMATION TECHNOLOGY-IT1

Syllabus

Module 1: Introduction to Storage and Management:

Introduction, History: computing, networking, storage,Intelligent Storage

Array.Need for storage networking - SAN, NAS, SAN/NAS, Distributed Storage
Systems, SCSI command Model and fiber channel connectivity, 8 Hours

Module 2: Storage System Environment

Storage Components; Data organization: File vs. Block,Object, Data store;File

sharing protocols, I/O operations, Error Management: Disk error Management –
RAID ErrorManagement, Distributed Systems Error Management 8 Hours

Module 3: Large Storage Systems

Cloud/Web-based systems, Storage Management: - Device Management –

NASManagement, Storage Virtualization -Forms of Virtualization, Types of
Storage Virtualization, Block level virtualization, File level virtualization. 8 Hours

Module 4: Introduction to Business connectivity

Information Availability, BC terminology, Life cycles, Backup Purpose -

Granularity, Backup and restore operations
8 Hours

Module 5:Storage Security Domains

Overview of storage security, Storage Security Framework, Risk Triad – Storage

Security Domains, Storage management challenges and ideal solutions
8 Hours
 INFORMATION TECHNOLOGY-IT1

Reference Books

1. EMC Education Services” Information Storage and Management: Storing, Managing and
Protecting Digital Information”, John Wiley & Sons, 2010

2. David Alexander, Amanda French, Dave Sutton “Information Security Management

Principles” BCS, The Chartered Institute 2008

3. lohnChirillo, ScottBaul“ Storage Security: Protecting SANs, NAS and DAS”, Wiley,
2003

4. MeetaGupta ,Storage Area Network Fundamentals, Pearson Education Ltd 2002Network

Management: Principles and Practice, Mani Subramanian, 2/e, Pearson, 2010

5. Foster Stockwell , “A history or information storage and retrieval” McFarland, 2001

Course Plan

No. of
Sl. No. Topic Lectures

1 Introduction to Storage and Management 8 Hours

1.1 Introduction, History: computing, networking, storage,Intelligent 1

Storage Array

1.2 Need for storage networking - SAN, NAS, SAN/NAS 3

1.3 Distributed Storage Systems 2

1.4 SCSI command Model and fiber channel connectivity 2

2 Storage System Environment 8 Hours

2.1 Storage Components; Data organization: File vs. Block,Object, Data 3

store;

2.2 File sharing protocols, I/O operations 2

2.3 Error Management: Disk error Management – RAID Error 2

Management
 INFORMATION TECHNOLOGY-IT1

2.4 Distributed Systems Error Management 1

3 Large Storage Systems 8 Hours

3.1 Cloud/Web-based systems 2

3.2 Storage Management: - Device Management – NASManagement 3

3.3 Storage Virtualization -Forms of Virtualization 2

3.4 Types of Storage Virtualization, Block level virtualization, File level 1

virtualization

4 Introduction to Business connectivity 8 Hours

4.1 Information Availability 2

4.2 BC terminology, Life cycles 2

4.3 Backup Purpose -Granularity 2

4.4 Backup and restore operations 2

5 Storage security Domains 8 Hours

5.1 Overview of storage security 2

5.2 Storage Security Framework 2

5.3 Risk Triad – Storage Security Domains 2

5.4 Storage management challenges and ideal solutions 2

 INFORMATION TECHNOLOGY-IT1

CODE: COURSE NAME: CATEGORY L T P CREDIT

NETWORK
PROGRAM
221EIT009 PROGRAMMING AND 3 0 0 3
ELECTIVE 2
MANAGEMENT

Preamble: This course is intended for students to develop the necessary skills for creating robust
and scalable network applications and to impart basic knowledge for managing networks.

Course Outcomes: After the completion of the course, the student will be able to

CO Course Outcome (CO) Bloom's Category

No. Level

CO 1 Compare the features of elementary TCP/IP protocols and BL 2: Understand

sockets

CO 2 Develop applications using TCP sockets and use various BL 3: Apply

socket options

CO 3 Illustrate the functions of UDP and SCTP sockets BL 2: Understand

CO 4 Develop high-performance scalable applications using the BL 3: Apply

concept of multithreading

CO 5 Summarize simple network management protocols and their BL 2: Understand

practical issues

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1

CO 2

CO 3
 INFORMATION TECHNOLOGY-IT1

CO 4

CO 5

Assessment Pattern

Bloom’s Category Levels End Semester Examination

BL 2: Understand 60 %

BL 3: Apply 40 %

BL 4: Analyze

BL 5: Evaluate

BL 6: Create

Mark distribution

Total Continuous End Semester ESE Duration

Marks Internal Examination
Evaluation (ESE)
(CIE)

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)
 INFORMATION TECHNOLOGY-IT1

Continuous Internal Evaluation (CIE) Pattern:

Review article preparation/Mini project: 15 Marks

Course-based task/Seminar/Data collection and interpretation: 15 Marks

Test paper (one only): 10 Marks

Each student shall prepare the review article based on peer reviewed publications (refer
minimum 10 original publications). The test paper shall include a minimum of 80% of the
syllabus.

End Semester Examination (ESE) Pattern:

There shall be two parts; Part A and Part B. Part A shall contain five (numerical) questions (such
questions shall be useful in the testing of knowledge, skills, comprehension, application,
analysis, synthesis, evaluation, and understanding of the students), with one question from each
module, having five marks for each question. Students shall answer all questions. Part B shall
contain seven questions (such questions shall be useful in the testing of overall achievement and
maturity of the students in a course, through long answer questions relating to
theoretical/practical knowledge, derivations, problem-solving, and quantitative evaluation), with
at least one question from each module, of which, the student shall answer any five. Each
question shall carry seven marks.
 INFORMATION TECHNOLOGY-IT1

Model Question Paper

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FIRST SEMESTER M.TECH

DEGREE EXAMINATION, MONTH & YEAR

Course Code: 221EIT009

Course Name: Network Programming and Management

Max.Marks: 60

Duration: 2½ Hours,

PART A (Answer all questions. Five marks each)

1. Explain the fields present in Sockaddr_In structure.

2. What are the boundary conditions for crashing of TCP server host?
3. Develop a simple UDP application server and client program. The server should echo
back the message sent by the client.
4. Why is a mutex always associated with a condition available?
5. What are the limitations of using SNMP?

PART B (Answer any five questions. Seven marks each)

6. Explain any five functions meant for byte order transformation.

7. Explain the general format for getsockopt and setsockopt for specifying TCP socket
options.
8. Develop a UDP socket program to enable a client to send a float value to the server. The
server process should increment the value of the number it receives by 2. The server
should print both the value it receives and the value that it sends. The client should print
the value it receives from the server.
9. Write a simple TCP/IP client-server application program that accepts client connections
and echoes back whatever text is sent to the server. The server should be multithreaded,
i.e., it can serve multiple concurrent clients.
10. Explain the key elements for TCP/IP network management.
11. Write a program that uses TCP sockets to accept a binary IP address and return the host
name corresponding to that address from the host address structure.
12. Compare and contrast the key features of SNMPv3 with SNMPV2.
 INFORMATION TECHNOLOGY-IT1

Syllabus

Module 1: Introduction to TCP/IP and Socket Programming

Introduction: Overview of Transport Layer protocols - TCP, UDP, and SCTP;

Socket Programming – Introduction to Sockets – Socket address Structures – Byte
ordering and manipulation functions – address conversion functions – Elementary 8 Hours
TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions –
Iterative Server – Concurrent Server.
Module 2: TCP/IP Application Development and Socket Options

TCP Echo Server – TCP Echo Client – POSIX Signal handling – Server with
multiple clients – boundary conditions: Server process Crashes, Server host
Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O 9 Hours
Models – select function – shutdown function – TCP echo Server (with
multiplexing) – poll function – TCP echo Client (with Multiplexing). Socket
options – getsocket and setsocket functions – generic socket options – IP socket
options – ICMP socket options – TCP socket options.

Module 3: Elementary UDP and SCTP Sockets

Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing
TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6
support in DNS – gethostbyaddr function – getservbyname and getservbyport 8 Hours
functions, Elementary SCTP sockets, interface models, functions for bind,
connect, address mapping and shutdown.

Module 4: Advanced Socket Programming

Ipv4 and Ipv6 interoperability – threaded servers – thread creation and

termination – TCP echo server using threads – Mutex – condition variables – raw
sockets – raw socket creation – raw socket output – raw socket input – ping 7 Hours
program – traceroute program.

Module 5:Network Management

SNMP network management concepts – SNMP management information –

standard MIBs – SNMPv1 protocol and Practical issues, RMON – Basic
concepts, statistics collection, alarms and filters, Practical issues, RMON2 – 8 Hours
Overview, Protocol Directory and Protocol Distribution Groups, RMON2 Host
and Matrix Groups, Practical Issues, SNMPv2 – Protocol Operations, MIBs,
SNMPv3 – Architecture and Applications, Cryptographic algorithms.
 INFORMATION TECHNOLOGY-IT1

Reference Books

1. UNIX Network Programming, Volume 1: Networking APIs - Sockets and XTI, W

Richard Stevens, Prentice Hall, 1997

2. SNMP, SNMPv2, SNMPv3, and RMON 1 and 2, William Stallings, 3/e, Addison
Wesley, 1998

3. Internetworking with TCP/IP Vol. II: Design, Implementation, and Internals, Douglas E
Comer, David L Stevens, 3/e, Pearson, 2015

4. Network Management: Principles and Practice, Mani Subramanian, 2/e, Pearson, 2010

Course Plan

No. of
Sl. No. Topic
Lectures

1 Introduction to TCP/IP and Socket Programming8 Hours

1.1 Introduction: Overview of Transport Layer protocols - TCP, UDP, 2

and SCTP

1.2 Socket Programming – Introduction to Sockets – Socket address 2

Structures – Byte ordering and manipulation functions – address
conversion functions

1.4 Elementary TCP Sockets – socket, connect, bind, listen, accept, 2

read, write, close functions

1.5 Iterative Server – Concurrent Server 2

2 TCP/IP Application Development and Socket Options9 Hours

2.1 TCP Echo Server – TCP Echo Client – POSIX Signal handling – 2
Server with multiple clients

2.2 Boundary conditions: Server process Crashes, Server host Crashes, 2

Server Crashes and reboots

2.3 Server Shutdown – I/O multiplexing – I/O Models – select function 2

 INFORMATION TECHNOLOGY-IT1

– shutdown function

2.4 TCP echo Server (with multiplexing) – poll function – TCP echo 1
Client (with Multiplexing)

2.5 Socket options – getsocket and setsocket functions – generic socket 2

options – IP socket options – ICMP socket options – TCP socket
options

3 Elementary UDP and SCTP Sockets8 Hours

3.1 Elementary UDP sockets – UDP echo Server – UDP echo Client 2

3.2 Multiplexing TCP and UDP sockets – Domain name system – 2

gethostbyname function

3.3 Ipv6 support in DNS – gethostbyaddr function – getservbyname and 2

getservbyport functions

3.4 Elementary SCTP sockets, interface models, functions for bind, 2

connect, address mapping, and shutdown

4 Advanced Socket Programming7 Hours

4.1 Ipv4 and Ipv6 interoperability – threaded servers – thread creation 2

and termination

4.2 TCP echo server using threads – Mutex – condition variables 2

4.3 raw sockets – raw socket creation – raw socket output – raw socket 2
input

4.4 ping program – trace route program 1

5 Network Management8 Hours

 INFORMATION TECHNOLOGY-IT1

5.1 SNMP network management concepts – SNMP management 1

information – standard MIBs

5.2 SNMPv1 protocol and Practical issues 1

5.3 RMON – Basic concepts, statistics collection, alarms and filters, 2

Practical issues

5.4 RMON2 – Overview, Protocol Directory and Protocol Distribution 2

Groups, RMON2 Host and Matrix Groups, Practical Issues

5.5 SNMPv2 – Protocol Operations, MIBs, SNMPv3 – Architecture and 2

Applications, Cryptographic algorithms
 INFORMATION TECHNOLOGY-IT1

CODE: COURSE NAME: CATEGORY L T P CREDIT

PROGRAM
221EIT010 NETWORK FORENSICS 3 0 0 3
ELECTIVE 2

Preamble: This course is intended for students to have sound technical knowledge in basic and
advanced topics in network forensics including the application of traffic acquisition software,
packet and flow traffic analysis, statistical traffic protocols network tunneling strategies, and
malware evolution trends.

Course Outcomes: After the completion of the course, the student will be able to

CO Course Outcome (CO) Bloom's Category

No. Level

CO 1 Familiarize various traffic acquisition software used for BL 2: Understand

network forensics

CO 2 Analyze network traffic in various levels – protocol, packet BL 4: Analyze

and flow analysis

CO 3 Analyze various statistical wireless traffic protocols BL 4: Analyze

CO 4 Identify the different types of network devices and logs BL 2: Understand

CO 5 Characterize various network tunneling strategies and BL 2: Understand

malware evolution trends

Mapping of course outcomes with program outcomes

PO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7
7

CO 1

CO 2
 INFORMATION TECHNOLOGY-IT1

CO 3

CO 4

CO 5

Assessment Pattern

Bloom’s Category Levels End Semester Examination

BL 2: Understand 60 %

BL 3: Apply 20 %

BL 4: Analyze 20 %

BL 5: Evaluate

BL 6: Create

Mark distribution

Continuous
End Semester
Total Internal
Examination ESE Duration
Marks Evaluation
(ESE)
(CIE)

100 40 60 2.5 hours

The evaluation shall only be by employing application-based, analysis-based, or design-based

questions (for both internal and end-semester examinations)
 INFORMATION TECHNOLOGY-IT1

Continuous Internal Evaluation (CIE) Pattern:

Preparing a review article based on peer reviewed

original publications (minimum 10publications shall be referred): 15 marks

Course-based task/Seminar/Data collection and interpretation: 15 Marks

Test paper (one only): 10 Marks

Each student shall prepare the review article based on peer reviewed publications (refer
minimum 10 original publications). The test paper shall include a minimum of 80% of the
syllabus.

End Semester Examination (ESE) Pattern:

There shall be two parts; Part A and Part B. Part A shall contain 5 (numerical) questions (such
questions shall be useful in the testing of knowledge, skills, comprehension, application,
analysis, synthesis, evaluation, and understanding of the students), with one question from each
module, having 5 marks for each question. Students shall answer all questions. Part B shall
contain 7 questions (such questions shall be useful in the testing of overall achievement and
maturity of the students in a course, through long answer questions relating to
theoretical/practical knowledge, derivations, problem-solving, and quantitative evaluation), with
at least one question from each module, of which, the student shall answer any five. Each
question shall carry 7 marks.
 INFORMATION TECHNOLOGY-IT1

Model Question Paper

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FIRST SEMESTER M.TECH

DEGREE EXAMINATION, MONTH & YEAR

Course Code: 221EIT010

Course Name: Network Forensics

Max.Marks: 60

Duration: 2½ Hours,

PART A (Answer all questions. Five marks each)

1. Give the syntax of the Berkeley packet filter interface.

2. Compare flow analysis versus packet analyis.

3. What are the types of sensors based on their deployment?

4. List and briefly explain any four attacks in wireless networks.

5. What happens in TLS protocol implementation when a client contacts a server for
communication?

PART B (Answer any five questions. Seven marks each)

6. List and explain the different types of digital evidence.

7. What are protocol analyzers? Explain the options in Wireshark for packet filtering.

8. What is network flow monitoring? Compare the features of Netflow, sFlow and IPFIX
for monitoring network traffic.

9. Explain the roles played by switches, routers and firewalls in a network.

10. Explain any three strategies for covert tunneling.

11. Explain protocol awareness and behavioural analysis in network intrusion detection.

12. Explain the features of libpcap and WinPcap for acquiring network evidence.
 INFORMATION TECHNOLOGY-IT1

Syllabus

Module 1: Technical Fundamentals of Network Forensics

Introduction to Network Forensics: Concepts in digital evidence - Challenges

related to network evidence - Network forensic investigative methodology;
Technical Fundamentals: Sources of network-based evidence - On the wire, In the 9 Hours
air, Switches, Routers, DHCP servers, Name servers, Authentication servers,
Central log servers; Evidence Acquisition - Physical interception of cable, Radio
frequency, Hubs, Switches; Traffic acquisition software - Libpcap and WinPcap,
The Berkeley packet filter (BPF) language, Tcpdump, Wireshark, Tshark,
Dumpcap; Active acquisition - Common interfaces, Inspection without access
strategy.
Module 2: Traffic Analysis

Traffic Analysis: Protocol Analysis – Protocol analysis tool, Protocol analysis

technique; Packet analysis - Packet analysis tool, Packet analysis technique; Flow
analysis - Flow analysis tool, Flow analysis technique; Higher-layer traffic 7 Hours
analysis - Common higher-layer protocols, Higher-layer analysis tool, Higher
layer analysis techniques.

Module 3: Statistical Flow Analysis

Statistical flow analysis - Processor overview – Sensors - sensors types, Sensor

software, Sensor placement; Flow record export protocols – Netflow, IPFIX,
sFlow - Collection and aggregation; Wireless access point - Type of WAP, WAP 8 Hours
evidence; Wireless traffic capture and analysis: Spectrum analysis, Wireless
passive evidence acquisition; Common attacks: Sniffing, Rogue wireless access
points, Evil twin, WEP cracking, Locating wireless devices.

Module 4: Network Devices

Network Devices: Intrusion detection and analysis – Typical NIDS/NIPS

functionality – sniffing - Higher layer protocol awareness - Alerting on suspicious
bits modes of detection - Modes of Detection –Signature-based analysis - Protocol 8 Hours
awareness - Behavioural analysis - Type of NIDS/NIPS, NIDS/NIPS evidence
acquisition - Comprehensive packet logging - Event log aggregation - Correlation
and analysis - Source of logs, Operating system logs, Application logs, Physical
device logs, Network equipment logs; Network log architecture - Three type of
logging architecture; Remote logging - Common pitfall and strategy, Log
aggregation and analysis tool; Collecting and Analysing Evidence, Switches:
Content-addressable memory table - ARP, Switch evidence; Routers - Type of
 INFORMATION TECHNOLOGY-IT1

routers, Router evidence; Firewalls - Type of firewalls, Firewall evidence.

Module 5:Network Tunneling and Malware Forensics

Advanced Topics - Web Proxies - Web proxy functionality: Caching, URI

Filtering, Content Filtering; Distributed cache – Squid – Squid configuration,
Squid access logfile, Squid Cache; Encrypted web traffic - Transport Layer 8 Hours
Security – Gaining access to encrypted content – Commercial TLS/SSL
Interception Tools; Network Tunneling - Tunneling for functionality – Inter-
switch link (ISL), Generic routing encapsulation (GRE), Tunneling for
confidentiality; Internet protocol security (IPSec) - Transport layer security (TLS)
and Secure socket layer (SSL) – Covert Tunneling: Covert Tunneling strategy,
TCP sequence number; DNS Tunneling - ICMP tunnels – Malware forensics -
Trends in malware evolution, Network behaviour of malware - Propagation,
Command and control Communications, Payload behaviour.

Reference Books

1. Network Forensics: Tracking Hackers through Cyberspace, Sherri Davidoff, Jonathan

Ham, Pearson, 2012.

2. Computer Forensics: Computer Crime Scene Investigation, John R Vacca, Jones &
Bartlett Learning, LLC, 3/e, 2010

3. Network Forensics, Ric Messier, Wiley Publishers, 2017

4. Computer Evidence: Collection & Preservation, Christopher L T Brown, Charles River

Media, 2005

5. Investigating Network Intrusions and Cybercrime (CHFI), Computer Forensic Series by

EC-Council, Cengage Learning, 2016
 INFORMATION TECHNOLOGY-IT1

Course Plan and Lecture Schedule

No. of
Sl. No. Topic
Lectures

1 Technical Fundamentals of Network Forensics (9 hours)

1.1 Introduction to Network Forensics: Concepts in digital evidence - 2

Challenges related to network evidence - Network forensic
investigative methodology

1.2 Technical Fundamentals: Sources of network-based evidence - On 2

the wire, In the air, Switches, Routers, DHCP servers, Name
servers, Authentication servers, Central log servers

1.3 Evidence Acquisition - Physical interception of cable, Radio 1

frequency, Hubs, Switches

1.4 Traffic acquisition software - Libpcap and WinPcap, The Berkeley 2

packet filter (BPF) language, Tcpdump, Wireshark, Tshark,
Dumpcap

1.5 Active acquisition - Common interfaces, Inspection without access 2

strategy

2 Traffic Analysis(7 hours)

2.1 Traffic Analysis: Protocol Analysis – Protocol analysis tool, 2

Protocol analysis technique

2.2 Packet analysis - Packet analysis tool, Packet analysis technique 2

2.3 Flow analysis - Flow analysis tool, Flow analysis technique 1

2.4 Higher-layer traffic analysis - Common higher-layer protocols, 2

Higher-layer analysis tool, Higher layer analysis techniques

3 Statistical Flow Analysis (8 hours)

3.1 Statistical flow analysis - Processor overview – Sensors - sensors 2

 INFORMATION TECHNOLOGY-IT1

types, Sensor software, Sensor placement

3.2 Flow record export protocols – Netflow, IPFIX, sFlow - Collection 2

and aggregation

3.3 Wireless access point - Type of WAP, WAP evidence; Wireless 2

traffic capture and analysis: Spectrum analysis, Wireless passive
evidence acquisition

3.4 Common attacks: Sniffing, Rogue wireless access points, Evil twin, 2
WEP cracking, Locating wireless devices

4 Network Devices(8 hours)

4.1 Network Devices: Intrusion detection and analysis – Typical 2

NIDS/NIPS functionality – sniffing

4.2 Higher layer protocol awareness - Alerting on suspicious bits 2

modes of detection - Modes of Detection –Signature-based analysis
- Protocol awareness - Behavioural analysis - Type of NIDS/NIPS,
NIDS/NIPS evidence acquisition

4.3 Comprehensive packet logging - Event log aggregation - 2

Correlation and analysis - Source of logs, Operating system logs,
Application logs, Physical device logs, Network equipment logs

4.4 Network log architecture - Three types of logging architecture; 2

Remote logging - Common pitfall and strategy, Log aggregation
and analysis tool; Collecting and Analysing Evidence, Switches:
Content-addressable memory table - ARP, Switch evidence;
Routers - Type of routers, Router evidence; Firewalls - Type of
firewalls, Firewall evidence

5 Network Tunneling and Malware Forensics(8 hours)

5.1 Advanced Topics - Web Proxies - Web proxy functionality:

2
Caching, URI Filtering, Content Filtering; Distributed cache –
 INFORMATION TECHNOLOGY-IT1

Squid – Squid configuration, Squid access logfile, Squid Cache

5.2 Encrypted web traffic - Transport Layer Security – Gaining access

to encrypted content – Commercial TLS/SSL Interception Tools 2

5.3 Network Tunneling - Tunneling for functionality – Inter-switch link

(ISL), Generic routing encapsulation (GRE), Tunneling for
confidentiality; Internet protocol security (IPSec) - Transport layer
security (TLS) and Secure socket layer (SSL), Covert Tunneling: 2
Covert Tunneling strategy, TCP sequence number; DNS Tunneling
- ICMP tunnels

5.4 Malware forensics - Trends in malware evolution, Network

behaviour of malware - Propagation, Command and control 2
Communications, Payload behaviour.
 INFORMATION TECHNOLOGY-IT1
CODE: COURSE NAME: CATEGORY L T P CREDIT
MATHEMATICAL MODEL PROGRAM
221EIT011 3 0 0 3
FOR INTERNET ELECTIVE 2

Preamble: The course aims to impart advanced concepts on complex networks and game
theory. Using these mathematical concepts, the course aims to enable students to model
research problems related to the Internet.

Course Outcomes: After the completion of the course the student will be able to

Bloom's
CONo. Course Outcomes (CO) Category
Level
CO 1 Explain the evolution of random networks based on graph Level2:
theoretical concepts. Understand
CO 2 Interpret the nature of scale-free networks based on Barabasi- Level 2:
Albert model. Understand
CO 3 Analyse the robustness of the network using complexity theory Level4:
Analyse
CO 4 Calculate Nash Equilibrium of Normal form and Extensive Level 3:
form games Apply
CO 5 Model problems related to internet pricing, congestion control, Level4:
and cyber security using game theoretical concepts. Analyse

Program Outcomes ( PO)

Outcomes are the attributes that are to be demonstrated by a graduate after completing the
course.

PO1:An ability to independently carry out research/investigation and development work in

engineering and allied streams

PO2:An ability to communicate effectively, write and present technical reports on complex
engineering activities by interacting with the engineering fraternity and with society at
large.

PO3:An ability to demonstrate a degree of mastery over the area as per the specialization of
the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

PO4:An ability to apply stream knowledge to design or develop solutions for real world
problems by following the standards

PO5:An ability to identify, select and apply appropriate techniques, resources and state-of-
the-art tool to model, analyse and solve practical engineering problems.
 INFORMATION TECHNOLOGY-IT1
PO6:An ability to engage in life-long learning for the design and development related to the
stream related problems taking into consideration sustainability, societal, ethical and
environmental aspects

PO7:An ability to develop cognitive load management skills related to project management
and finance which focus on Entrepreneurship and Industry relevance.

Mapping of course outcomes with program outcomes

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7

CO 1 - - ✓ - - - -
CO 2 - - ✓ - - - -
CO 3 ✓ ✓ ✓ ✓ - - ✓
CO 4 - - ✓ - - - -
CO 5 ✓ ✓ ✓ ✓ ✓ ✓ ✓

Assessment Pattern

Bloom’s Category End Semester Examination

Understand 40%

Apply 40%

Analyse 20%

Evaluate

Create
 INFORMATION TECHNOLOGY-IT1
Mark distribution

Total Marks CIE ESE ESE Duration

100 40 60 2.5 hours

Continuous Internal Evaluation: 40 marks

i. Preparing a review article based on peer reviewed original publications (minimum 10

publications shall be referred) : 15 marks

ii. Course based task / Seminar/ Data collection and interpretation : 15 marks

iii. Test paper (1 number) : 10 marks

Test paper shall include minimum 80% of the syllabus.

End Semester Examination Pattern:

The end semester examination will be conducted by the respective College. There will be
two parts; Part A and Part B. Part A will contain 5 numerical/short answer questions with 1
question from each module, having 5 marks for each question (such questions shall be useful
in the testing of knowledge, skills, comprehension, application, analysis, synthesis, evaluation
and understanding of the students). Students should answer all questions. Part B will contain
7 questions (such questions shall be useful in the testing of overall achievement and maturity
of the students in a course, through long answer questions relating to theoretical/practical
knowledge, derivations, problem solving and quantitative evaluation), with minimum one
question from each module of which student should answer any five. Each question can carry
7 marks.

Note: The marks obtained for the ESE for an elective course shall not exceed 20% over the
average ESE mark % for the core courses. ESE marks awarded to a student for each elective
course shall be normalized accordingly. For example, if the average end semester mark % for
a core course is 40, then the maximum eligible mark % for an elective course is 40+20 = 60
%.
 INFORMATION TECHNOLOGY-IT1
Course Level Assessment Questions

Course Outcome 1 (CO1):

1. Explain the evolution of random network and the emergence of giant component.

2. Can structure of the Internet be explained using random graphs? Discuss.

Course Outcome 2 (CO2)

1. Explain briefly the Scale Free phenomenon and its significance.

2. Explain Barabasi-Albert model of growth of complex network.

Course Outcome 3(CO3):

1. Does the phenomenon of inverse percolation help in assessing robustness of a

network? Investigate.

2. “Mitigation of Cascaded attacks can be done using Lazarus effect” Do you agree with
this statement? Substantiate your answer with example analysis.

Course Outcome 4 (CO4):

1. Calculate Nash equilibrium for Cournot duopoly game.

2. Comment on the uniqueness of Nash equilibrium with the example of Stag Hunt
Game.

Course Outcome 5 (CO5):

1. Model congestion control problem using game theory. Investigate on the existence
and uniqueness of Nash Equilibrium in the model.
2. Using a game theoretical model of DDoS attack in a computer network, Investigate on
the effect of having firewall as the countermeasure.
 INFORMATION TECHNOLOGY-IT1
Model Question Paper

QP CODE:
Reg No:

Name: _

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER M.TECH DEGREE EXAMINATION, MONTH & YEAR

IT12022-PE2 (F)

Mathematical Models for Internet

Max. Marks : 60 Duration: 2.5 hrs

PART A

(Answer all questions. Each Question Carries 5 Marks)

1. Compare the structure of random network and real network based on cluster
size distribution.

2. Use degree distribution to mathematically explain the structure of Internet.

3. Discuss small world phenomena in scale free networks with examples.

4. Give an example of Zero-Sum game and explain its importance in game

theoretical analysis.

5. Analyze the Nash equilibrium of advertising game from the perspectives of

normal form game and extensive form game.

PART B

(Answer any FIVE Questions. Each Question Carries 7 Marks)

6. Define Average Path length, Clustering Coefficient and Degree

Distribution. Compare the behavior of these in the context of random networks
and real networks.

7. Discuss on the emergent behavior of random networks

8 Use degree distribution to mathematically explain the structure of Internet.

9. Compare and contrast coordination game with coalitional game with

examples.
 INFORMATION TECHNOLOGY-IT1
10. Explain extensive form game and Backward Induction.

11. Analyze the Nash equilibrium of advertising game from the perspectives of
normal form game and extensive form game..

12. Explain the modelling of DDoS attack using game theory. Explore the
possibility of solving the problem as a non-zero-sum game.

Syllabus

Module 1: Graph models (8 Hours)

Relevant Concepts From Graph Theory - Undirected, directed, signed, weighted and
spatial networks,Paths, connected components ,Directed Acyclic Graphs, Bipartite graphs
Max-flow/min-cut, Clustering coefficients.

The Random Network Model - Introduction, Number of Links, Degree Distribution in

random network, The Evolution of a Random Network, Small Worlds, Clustering Coefficient
in random network, Watts-Strogatz model.

Module 2:Scale-Free Networks and The Barabasi-Albert model (7 Hours)

Power Laws and Scale-Free Networks, Discrete Formalism, Continuum Formalism, Hubs,
The Meaning of Scale-Free, Universality, Ultra-Small Property, The Role of the Degree
Exponent.

The Barabasi-Albert model-Growth and Preferential Attachment, The Barabási-Albert

Model, Degree Dynamics, Degree Distribution in BA Model, Measuring Preferential
Attachment, Non-linear Preferential Attachment, The Origins of Preferential Attachment,
Diameter and Clustering Coefficient .

Module 3: Modelling Network Robustness(8 Hours)

Network Robustness- Percolation Theory, Inverse Percolation Transition and Robustness,

Robustness of Scale-free Networks, Molloy-Reed Criterion, Critical Threshold, Attack
Tolerance, Cascading Failures, Modelling Cascading Failures, Failure Propagation Model,
Branching Model, Building Robustness, Designing Robust Networks.
Module 4: Game theory-Introduction (8 Hours)

Games in Normal Form, Dominant Strategies, Nash Equilibrium, Randomization and Mixed
Strategies. Sequentiality, Extensive Form Games, and Backward Induction
Module 5: Game Theoretical Modelling (9 Hours)

Example games and analysis, application of game theory in internet pricing, congestion
control and cyber security
 INFORMATION TECHNOLOGY-IT1
Reference Books
1. A-L. Barabási , Network Science,Cambridge University Press 2016, Available
online:http://barabasi.com/networksciencebook/
2. M.E.J. Newman, Networks - An introduction , Oxford Univ Press, 2010.
3. D. Easley and J. Kleinberg, Networks, Crowds and Markets , Cambridge Univ Press.
4. R. Cohen and S. Havlin, Complex Networks - Structure, Robustness and Function ,
Cambridge Univ Press, 2010.
5. Frank Kelly, Mathematical Modeling of the Internet, Proc. Fourth International
Congress on Industrial and Applied mathematics, Edinburgh, 1999.
6. Frank Kelly, Models for a Self Managed Internet, Philosophical Transactions of the
Royal Society A358, pp. 2335-2348, 2000
7. A Brief Introduction to the Basics of Game Theory-Matthew O. Jackson, Stanford
University
8. Algorithms, Games, and the Internet, Christos H. Papadimitriou,University of
California, Berkeley,[email protected]
9. A Game-Theoretic Framework for Congestion Control in General Topology
Networks, Tansu Alpcan, Tamer Basar (alpcan, tbasar)@control.csl.uiuc.edu
10. Wu, Q., Shiva, S., Roy, S., Ellis, C. and Datla, V., 2010, April. On modeling and
simulation of game theory-based defense mechanisms against DoS and DDoS attacks.
In Proceedings of the 2010 spring simulation multiconference (pp. 1-8).

Course Contents and Lecture Schedule

No Topic No. of Lectures

40 Hours
1 Graph models 8 Hours
1.1 Relevant Concepts From Graph Theory - Undirected, directed,
signed, weighted and spatial networks ,Paths, connected 2 Hours
components.
1.2 Directed Acyclic Graphs, Bipartite graphs Max-flow/min-cut,
Clustering coefficients. 1 Hour

1.3 The Random Network Model - Introduction, Number of Links,

Degree Distribution in random network. 2 Hours

1.4 The Evolution of a Random Network. 1 Hour

1.5 Small Worlds, Clustering Coefficient in random network 1 Hour
1.6 Watts-Strogatz model. 1 Hour
2 Scale Free Property and The Barabasi-Albert model 7 Hours
2.1 Scale Free Property - Introduction, Power Laws and Scale-Free
2 Hours
Networks, Discrete Formalism, Continuum Formalism, Hubs.
2.2 The Meaning of Scale-Free, Universality 1 Hour
2.3 Ultra-Small Property, The Role of the Degree Exponent. 1 Hour
2.4 Growth and Preferential Attachment, The Barabási-Albert 2 Hours
 INFORMATION TECHNOLOGY-IT1
Model, Degree Dynamics, Degree Distribution in BA Model,
Measuring Preferential Attachment, Non-linear Preferential
Attachment.
2.5 The Origins of Preferential Attachment, Diameter and
1 Hour
Clustering Coefficient.
3 Degree correlations and Network Robustness 8 Hours
3.1 Network Robustness - Introduction, Percolation Theory 1 Hour
3.2 Inverse Percolation Transition and Robustness, Robustness of
2 Hours
Scale-free Networks.
3.3 Molloy-Reed Criterion, Critical Threshold, Attack Tolerance. 2 Hours
3.4 Modelling Cascading Failures, Failure Propagation Model,
1 Hour
Branching Model
3.5 Building Robustness, Designing Robust Networks. 2 Hours
4 Game theory-Introduction 8 Hours
4.1 Games in Normal Form, Dominant Strategies 2 Hours
4.2 Nash Equilibrium 1 Hour
4.3 Randomization and Mixed Strategies. 2 Hours
4.4 Sequentiality, Extensive Form Games 1 Hour
4,5 Backward Induction 2Hours
5 Game Theoretical Modelling 9 Hours
5.1 Study of Example games 2 Hours
5.2 Analysis of Nash equilibrium of example games 2 Hours
5.3 Application of game theory in internet pricing 2 Hours
5.4 Game theoretical modelling of congestion control 1 Hour
5.5 Game theoretical modelling in cyber security 2 Hours