nie.ac.in · 2 Department of Information Science and Engineering M.Tech(Computer Network Engineering) Vision: Information Science and Engineering department will provide quality technical

MTech_CNE_Sch_Syl_2013-14.docx

MTech_CNE_Sch_Syl_2014-15.docx

MTech CNE Syl 2015-2016.docx

M.tech(CNE)-2016-17-Batch_syllabus.docx

M.tech(CNE)-2017-18-Batch_syllabus.docx

1

Department of Information Science & Engineering

Scheme of teaching and examination & syllabus

of

1st – 4th Semester M.Tech (Computer Network Engineering)

(Year of admission: 2013-14)

The National Institute of Engineering, Mysore – 8

(Autonomous Institution under VTU)

2

Department of Information Science and Engineering

M.Tech(Computer Network Engineering)

Vision:

Information Science and Engineering department will provide quality technical education to

produce creative, innovative and globally recognized information engineers of tomorrow for the

betterment of society.

Mission:

To educate graduate students to contribute to society as software engineers in the field of

computer networks.

Graduate Attributes

GA1: Knowledge-breadth: A systematic acquisition and understanding of knowledge in the

area of computer networks.

GA2: Problem solving: Solving and evaluating computer network engineering problems to

obtain workable solutions.

GA3: Research Skill: Carrying out literature review for network engineering problems, thus

improving the overall skill in the chosen area of research.

GA4: Communication: Effectively interact with professionals, society at large, to write

effective reports and make presentations.

GA5: Career Management: Demonstrate an awareness of transferable skills and their

applicability to both academic and non-academic positions.

GA6: Ethics: Ability to retain ethical practices even under difficult situations.

3

Program Educational Objectives

PEO1: Have a solid foundation for engaging in lifelong learning and professional development

in the computer networking field.

PEO2: Will attain productive and challenging careers in their workplace.

PEO3: Are proficient in applying networking theory and practice to problems encountered in

their workplace.

PEO4: Will exhibit professionalism and behave in an ethical manner with regard to workplace

and societal issues.

PEO5: Will function effectively in the computer networking field and associated hardware /

software systems.

Program Outcomes

PO1: Ability to apply knowledge on applied mathematics and computer engineering concepts.

PO2: Ability to understand, identify, formulate and solve network engineering problems.

PO3: Able to demonstrate with excellent programming, analytical, logical and problem solving

skills.

PO4: Ability to design, develop, test and debug the software.

PO5: Ability to deploy, analyze, troubleshoot, maintain, manage and secure the computer

network.

PO6: Able to communicate effectively in both verbal and written forms.

PO7: Ability to possess leadership and management skills with best professional ethical

practices and social concern.

4

I Semester

Scheme of teaching and examination

5

II Semester


Sl. No Subject

Code Subject

Teaching

Dept.

Contact Hrs./Week No. of

Credits L T P

1 MCN0501 Advanced Digital

Communication ISE 4 2 0 5

2 MCN0502 Computer Networks ISE 4 0 2 5

3 MCN0503 Network Programming ISE 4 2 0 5

4 AMT0401 Advanced Mathematics ISE

4 0 0 4

5 MCN---- Elective - I ISE

4 2 0 5

6 MCN---- Elective - II ISE 4 2 0 5

Total Credits 23 6 4 29

Total Contact Hrs./Week: 33

6

III Semester

Sl. No Subject

Code Subject

Teaching

Dept.


Credits L T P

1 MCN0504 Wireless & Mobile Networks ISE 4 0 2 5

2 MCN0505 Client-Server Programming ISE 4 2 0 5

3 MCN0506 Optical Networks ISE 4 0 2 5

4 MCN0401 Network Management ISE 4 0 0 4

4 MCN---- Elective – III ISE 4 2 0 5

5 MCN---- Elective - IV ISE 4 2 0 5

Total Credits 24 6 4 29


Sl.No Subject Code Subject Teaching Hours/

Week Credits

7

IV Semester

L T P

1 MCN0402 Industrial Training for 8 weeks

duration (At the end of the training,

students are required to submit a

report and present a seminar)

- - - 4

2 MCN0801 Project-work ( preliminary)

(Students have to initiate the project-

work during III semester and are

required to submit a report and

present a seminar)

- - - 8

3 MCN0201 Subject Seminar on current topic - - - 2

Total Credits 14

Sl.No Subject Code Subject

Teaching Hours/ Week

Credits

L T P

1 MCN2801 Project Work

(Students have to submit the final

project report at the end of the

semester which will be evaluated

followed by a seminar, presentation

and viva voce examination)

- - - 28

Total Credits 28

Core Courses 38

8

Elective Courses 20

Seminars/Industrial Training 14

Major Project 28

T O T A L 100

9

ELECTIVE COURSES

Sl.No Subject

Code Subject

Teaching Hours/

Week Credits

L T P

1 MCN0507 C# and .Net 4 0 2 5

2 MCN0508 Stochastic Models and Applications 4 2 0 5

3 MCN0509 System Modeling and Simulation 4 2 0 5

4 MCN0510 Embedded Systems 4 2 0 5

5 MCN0511 Information Security 4 2 0 5

6 MCN0512 Distributed systems 4 2 0 5

7 MCN0513 Computer Systems Performance Analysis 4 2 0 5

8 MCN0514 Web Engineering 4 2 0 5

9 MCN0515 Cloud Computing 4 2 0 5

10 MCN0516 Switching & Statistical Multiplexing in

Telecommunications

4 2 0 5

11 MCN0517 Web Commerce 4 2 0 5

12 MCN0518 Protocols Engineering 4 2 0 5

13 MCN0519 Topics in Multimedia Communications 4 2 0 5

14 MCN0520 Advances in Storage Area Networks 4 2 0 5

15 MCN0521 Wireless Sensor Networks 4 2 0 5

16 MCN0522 Advances in Digital image processing 4 2 0 5

17 MCN0523 Topics in Analysis of Computer Networks 4 2 0 5

10

Subject Code: MCN0501

Subject Title: Advanced Digital Communication

Designation: CORE

Credits: 05 Contact Hours: 06 Type of Delivery: 4-0-2-0

Course outcomes:

1. Identify and describe different techniques in modern digital communications,

2. Compare different techniques in different situations

3. Apply mathematical modeling to problems in digital communications,

4. Explain how mathematical model is used to analyze and synthesize methods and

algorithms within the field.

5. Code waveforms using different methods.

6. Provide base band shaping for data transmission.

Part-A

1. Digital Transmission Fundamentals: Digital Representation of Information: Block-Oriented

Information, Stream Information; Why Digital Communications? Comparison of Analog and

Digital Transmission , Basic properties of Digital Transmission Systems; Digital Representation

of Analog Signals: Bandwidth of Analog Signals, Sampling of an Analog Signal, Digital

Transmission of Analog Signals; Characterization of Communication Channels: Frequency

Domain Characterization, Time Domain Characterization; Fundamental Limits in Digital

Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding ;

9hours

2.Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations,

Telephone Modem Standards; Properties of Media and Digital Transmission Systems: Twisted

Pair, Coaxial Cable, Optical Fiber, Radio Transmission, Infrared Light; Error Detection and

Correction: Error Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial

Codes, Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code.

8hours

3. Brief Review of digital communication systems: Elements of Digital communication

systems; Communication channels and their characteristics; Historical perspective in the

development of digital communication; Review of the features of a decreases memory less

channel and the channel capacity theorem 9hours

11

Part-B

4. Wave form Coding Techniques: PCM, Channel. Noise and error probability, DPCM, DM,

coding speech at low bit rates, Applications. 8hours

5. Base band Shaping for data transmission: Discrete PAM signals, Inter-symbol interference

(ISI) Nyquist criterion for distortion-less Base band binary transmission, correlative coding,

Eypattern, transmission, correlative coding, Eypatterns Based and M-ary PAM system, Adoptive

Equalization, The zero forcing algorithm, The LMA algorithm 8hours

6. Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal

Constellations, Error Detecting Capability of a Polynomial Code, Review of the features of a

decreases memory less channel and the channel capacity theorem, coding speech at low bit rates,

Applications, The zero forcing algorithm, The LMA algorithm, 8hours

TEXT BOOKS:

1. Alberto Leon – Garcia and Indra Widjaja: Communication Networks - Fundamental Concepts

and Key architectures, 2nd Edition, Tata McGrawHill, 2006.

2. Simon Haykin: Digital Communication, Wiley India, 2007.

REFERENCE BOOKS:

1. John G Proakis: Digital Communications, 3rd Edition, McGraw Hill, 2008.

2. Leon W Couch: Analog / Digital Communication, 5th Edition, PHI, 2008

12


Subject Title: COMPUTER NETWORKS

Designation: CORE


Course outcomes:

1. Appreciate Network fundamentals and terminology.

2. Recognize network industry standards such as: the OSI model, Routing Protocols,

3. Master the concepts Address Resolution and Reverse Address Resolution Protocols,

4. Learn the concepts of IP Addresses and Subnetting, MAC Addressing.

5. Appreciate the need of congestion control and methods to improve quality of service.

6. Gain knowledge about various multimedia techniques.

Part – A

1. Review of Basic Concepts: Building a Network; Requirements- Connectivity, Cost-Effective

Resource Sharing, Support for Common Services; Network Architecture- Layering and

Protocols, OSI Architecture, Internet Architecture; Performance- Bandwidth and Latency,

Delay× Bandwidth Product, High-Speed Networks. 8hours

2. Direct link networks: Hardware Building Blocks-nodes, links; error Detection- Two-

Dimensional Parity, Internet checksum Algorithm, cyclic Redundancy Check; reliable

Transmission- Stop-and-Wait, Sliding Window, Concurrent Logical Channels; Rings (802.5,

FDDI) –Token Ring Media Access Control, Token Ring Maintenance, FDDI. 9hours

3. Packet Switching: Switching and forwarding – Datagrams,Virtual Circuit Switching, Source

Routing; Bridges and LAN Switches – Learning Bridges, Spanning Tree Algorithm, Broadcast

and Multicast, Limitations of Bridges; cell switching (ATM) – Cells, Segmentation and

Reassembly, Virtual Paths, Physical Layers for ATM. 9hours

Part - B

13

4. Internetworking: Simple internetworking (IP) – What Is an Internetwork?, Service Model,

Global Address, Datagram Forwarding in IP, Address Translation(ARP), Host

Configuration(DHCP), Error Reporting(ICMP), Virtual Networks and Tunnels; Routing –

Network as a Graph, distance Vector(RIP), Link State(OSPF), Metrics, Routing for Mobile

Hosts, Global Internet – Subnetting, Classless Routing(CIDR), Interdomain Routing(BGP),

Routing Areas, IP Version 6(IPv6). 9hours

5. End –to-End Protocols & Congestion Control and Resource Allocation:: Simple

demultiplexer (UDP); Reliable byte stream (TCP) – End-to-End Issues, Segment Format,

Connection Establishment and Termination, Sliding Window Revisited, Triggering

Transmission, Adaptive Retransmission, Record Boundaries, TCP Extensions, Alternative

Design Choices. Issues in resource allocation – Network Model, Taxonomy, Evaluation Criteria;

Queuing discipline – FIFO, Fair Queuing; TCP Congestion Control – Additive

Increase/Multiplicative Decrease, Slow Start, Fast Retransmit and Fast Recovery; Congestion-

Avoidance mechanisms – DECbit, Random Early Detection (RED), Source-Based Congestion

Control. 9hours

6. Applications: Traditional applications – Electronic Mail (SMTP, MIME, IMAP), World Wide

Web (HTTP), Name Service (DNS), Network management (SNMP); Web services – Custom

APPLICATION Protocols (WSDL, SOAP), A Generic application Protocol (REST).

8hours

Self-Learning-Component (SLC): High-Speed Networks, FDDI, Physical Layers for ATM, IP

Version 6(IPv6), Congestion-Avoidance mechanisms – DECbit, Random Early Detection

(RED), Source-Based Congestion Control, A Generic application Protocol (REST).

(Shall contain compulsory questions for 10 marks from SLC in Part-C of the question paper)

Laboratory Work:

Using any Protocol Analyzer like Ethereal, perform the following experiments:

1. Capture the packets that are transmitted after clicking on the URL of the web site of your

college. Analyze the packets at the highest level and prepare a brief report of your

analysis.

2. Analyze the data captured above at lower levels and demonstrate the layering of the

protocols.

3. Capture the packets in the LAN, & filter for a unique subscriber

4. Capture the ARP packets and find the MAC addresses in the LAN in your laboratory.

Using either NS228/OPNET or any other suitable simulator, perform the following

experiments:

1. Simulate an Ethernet LAN using 10 node , change error rate and data rate , and compare

throughput

14

2. Simulate a three nodes point – to – point network with duplex links between them. Set the

queue size and vary the bandwidth and find the number of packets dropped.

3. Simulate the transmission of ping messages over a network topology consisting of 6

nodes and find the number of packets dropped due to congestion.

4. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot

congestion window for different source / destination.

Implement the following in C/C++:

1. Write a program for distance vector algorithm to find suitable path for transmission.

2. Write a program for error detecting code using CRC-CCITT (16-bit)

3. Write a program for congestion control using leaky bucket algorithm.

TEXT BOOKS:

1. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th

Edition, Elsevier, 2007.

REFERENCE BOOKS:

1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw Hill,

2006.

2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.

3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts

and Key Architectures, 2nd Edition Tata McGraw-Hill, 2004.

15


Subject Title: NETWORK PROGRAMMING

Designation: CORE


Course outcomes:

1. Identify and describe socket programming for communications,

2. Compare different techniques in different types of servers

3. Analyze the concepts of TFTP

4. Explain the concepts of remote login

5. Appreciate the concepts of remote command execution

6. Explore the concets of JAVA Network programming

Part-A

1. Review of Basic Concepts: Layering, OSI model, Processes, A simplified model, Client-

Server model, A history of Unix Networking; Review of TCP/IP. 8hours

2. Sockets: Introduction, Unix domain protocols, socket addresses, elementary socket system

calls, advanced socket system calls, reserved ports, stream pipes, passing file descriptions, socket

options, asynchronous I/O, Input/Output Multiplexing, Out-of-Band data, sockets and signals,

Internet superservers, socket implementation. 9hours

3. TFTP Protocol: Introduction, protocol, security, data formats, connections, client user

interface, UDP implementation, TCP implementation. 9hours

Part- B

4. Remote Command Execution: Introduction, Security issues, rcmd function and rshd server,

rexec function and rexecd server. 9hours

5. Remote Login: Introduction, Terminal line disciplines, pseudo terminal, terminal modes,

control terminals rlogin overview, rlogin client, rlogin server. 9hours

6. JAVA Network Programming: Introduction, Client-Server Computing, The InetAddress

class, Serving multiple clients, Applet clients, Sending and receiving objects, Retrieving objects

from Web servers, Datagram sockets. 9hours

16

TEXT BOOKS:

1. W. Richard Stevens: UNIX Network Programming, PHI, 2001.

2. Y. Daniel Liang: Introduction to JAVA Programming, 6th Edition, Pearson, 2007.

REFERENCE BOOKS:

1. W. Richard Stevens: TCP/IP Illustrated, Volumes 1, 2, and 3, Pearson, 2000.

Laboratory Work:

1. Design, develop, and execute a program in C under UNIX / LINUX environment to

implement a simple echo server and demonstrate its working. Both the server and client are to be

connection-oriented and use TCP. The system works as follows: Client reads a line from the

standard input and writes the line to the server; the server reads a line from its network input and

echoes the line back to the client; the client reads the echoed line and prints it on its standard

output.

2. Repeat the above experiment using UDP instead of TCP.

3. Repeat the Experiment 1 using JAVA network programming facilities.

4. Modify the above program such that the client sends an integer value supposed to represent

the radius of a circle and the server is to compute and return the corresponding area.

5. Extend the above program such that the server responds to multiple clients.

Mini Project:

Design, develop, and execute a program in C under UNIX / LINUX environment to implement

any utility in TCP? IP suite like PING, TFTP etc.

17

Subject Code: AMT0401

Subject Title: ADVANCED MATHEMATICS

Designation: CORE


Course outcome

On successful completion of the course, the students will be able to,

1. Define relations,compute new relations,verify the properties of equivalence relations and

partial ordering.

2. Recognise different types of functions,find composition and inverse of a function. apply

the pigeon-hole principle to solve problems.

3. Discuss different graph structures ,their properties and algorithms which have their

applications in almost all the fields.

4. Demonstrate an understanding of basic principles of probability and Baye’s rule leading

to discrete & continuous probability distributions . To represent a given Markov chain

in terms of transition matrix and use various queuing models to solve some practical

problems.

5. Evaluate estimators, construct confidence intervals, and perform hypothesis tests in the

context of a single population sample and how to calculate basic two-variable statistics

(covariance, correlation).

6. Explain distribution functions

Part – A

1. Relations : Binary Relations, Mtrix and Digraph representation of relation, Operations on

binary relations, Composition of relations, Properties of relations, Equivalence relations.

8hours

2. Functions: Function, Types of functions, Composition of functions, Invertible functions,

Recursive function, Has function, The Pigeonhole principle

9hours

3. Graph Theory : Graphs and Multi graphs, Sub graphs, Isomorphic and Homeomorphic

18

graphs, Paths, Cycles and Circuits in a graph, Connected graphs, Euler’s and Hamiltonian

graphs, The Konigsberg Bridge problem and Travelling salesman problem, Trees, Planar

graphs, Graph coloring.

9hours

Part-B

4. Probability: Axioms and Models, Conditional Probability, Baye’s rule, problems, random

variables – discrete and continuous random variables, binomial distribution, Poissons

distribution, Exponential distribution, Normal distribution

8hours

5. Statistical Inference: Random sampling, sampling distributions, parameter estimation, and

hypothesis testing, regression, correlation, and analysis of variance examples.

9hours

6. Joint distribution and Markov Chains: Concept of joint probability, jointly distributed

random variables (discrete) , , Independent random variables, Expectations, Covariance,

Correlation Coefficient, Probabilty vectors, Stochastic matrices, Regular stochastic matrices,

Markov chains, concept of a queue, the M/G/I and M/M/I queuing systems, analysis.

9hours

Text Books:

1. Discrete Mathematics and Computer Science, Gary Haggard, John Schlipf, Sue Whitesides,

1st Indian Edition, Thomson, 2007.

2. Discrete and Combinatorial Mathematics an Applied Introduction, Ralph P. Grimaldi, 4th

Edition, Pearson Education, 2003

3. Higher Engineering Mathematics, Dr. B.S. Grewal, 40th Edition, 2008.

19


Subject Title: WIRELESS & MOBILE NETWORKS

Designation: CORE


Course outcomes:

• Student will be able explain the basic principles and technologies of mobile

communication systems

• Describe various mobile network architecture,

• Implement some practical mobile applications

• Explain the concept of cellular design

• Analyze various modulation techniques

• Describe the concepts of radio propagation

Part-A

1. Introduction to Wireless Communication Systems: Evolution of Mobile Radio

Communications Mobil Radio Systems around the world examples of Wireless Communication

Systems, Paging System, Cordless Telephone System. Cellular Telephone Systems, Comparison

of Common Wireless Communications Systems 8hours

2. Wireless Communications Modern Systems: Second generation (2G), Cellular Networks,

evolution of 2.5G, TDMA Standards, Third Generation (3G) Wireless Networks, Wireless Local

Loop (WLL) and LMDS, Wireless Local Area Networks (WLANs), Bluetooth and Personal

Area Networks (PANS) 9hours

3. The Cellular Concept: System Design Fundamentals, Introduction, Frequency reuse, channel

assignment strategies, handoff strategies – prioritizing handoffs, Practical Handoff

considerations, Interference and system capacity, co-channel interference and system capacity,

channel planning for wireless systems, adjacent channel interference, power control for reducing

interference 9hours

Part-B

4. Mobile Radio Propagation: Introduction to radio wave propagation, Free space propagation

model, Relating power to electric field, Reflection, Diffraction, Scattering.

9hours

20

5. Modulation Techniques for Mobile Radio: Frequency modulation Vs amplitude modulation,

Amplitude modulation, Angle modulation, Digital Modulation, Linear Modulation techniques –

binary phases shift keying (BPSK), Differential Phase Shift Keying (DPSK), Quadrature Phase

Shift Keying (QPSK), Constant envelope modulation – Binary Frequency Shift Keying,

Minimum Shift Keying (MSK), Gaussian Minimum Shift Keying (GMSK).

8hours

6. Multiple Access Techniques for Wireless Communications: Introduction to Multiple

access, Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA),

Spread Spectrum Multiple Access, Space Division Multiple Access (SDMA), Packet Radio.

Protocols, Reservation Protocols – Reservation ALOHA, Packet Reservation Multiple Access

(PRMA), Capacity of cellular systems , Wireless Networking: Introduction, Difference between

Wireless and Fixed Telephone Networks, Development of Wireless Networks, First generation,

second generation, third generation.

9hours

Self-Learning-Component (SLC): Comparison of Common Wireless Communications

Systems, Bluetooth and Personal Area Networks (PANS), power control for reducing

interference, Gaussian Minimum Shift Keying (GMSK), Development of Wireless Networks,

First generation, second generation, third generation.


Laboratory Work:

1. Using any package like MATLAB or using any programming language of your choice,

implement the BPSK algorithm and study its performance.

2. Repeat the above experiment for QPSK algorithm and compare its performance with that of

BPSK.

3. Using any Network simulation package or using any programming language of your choice,

implement and study the performance of PRMA.

Mini Project: Using any platform like ANDROID, J2ME etc, implement any mobile application

like Location Based Services, Emergency Services, Remote Monitoring etc.

TEXT BOOKS:

1. Theodore S Rappaport: Wireless Communications, Principles and Practice, 2nd Edition,

Pearson Education Asia, 2002.

REFERENCE BOOKS:

1. William C Y Lee: Mobile Communications Engineering Theory and Applications, 2nd

Edition, McGraw Hill Telecommunications 1998.

2. William Stallings: Wireless Communications and Networks, Pearson Education Asia, 2002.

21


Subject Title: CLIENT-SERVER PROGRAMMING

Designation: CORE


Course outcome

On successful completion of the course, students will be able to:

1. Analyze the requirements of the client and server environment.

2. Familiar with socket level programming and with designing and programming client

server systems based on TCP/IP and http protocols to run across a range of computing

platforms.

3. Demonstrate knowledge and understanding of current client/server system. technologies

for application across intranet/internet.

4. Develop and evaluate client server solutions.

5. Algorithms and issues in server software design.

6. Design example server systems.

Part-A

1. The Client Server Model and Software Design, Concurrent Processing in Client-Server

software: Introduction, Motivation, Terminology and Concepts, Introduction, Concurrency in

Networks, Concurrency in Servers, Terminology and Concepts, An example of Concurrent

Process Creation, Executing New Code, Context Switching and Protocol Software Design,

Concurrency and Asynchronous I/O. 8hours

2. Program Interface to Protocols, The Socket Interface: Introduction, Loosely Specified

Protocol Software Interface, Interface Functionality, Conceptual Interface Specification, System

Calls, Two Basic Approaches to Network Communication, The Basic I/O Functions available in

UNIX, Using UNIX I/O with TCP/IP, Introduction, Berkley Sockets, Specifying a Protocol

Interface, The Socket Abstraction, Specifying an End Point Address, A Generic Address

Structure, Major System Calls used with Sockets, Utility Routines for Integer Conversion, Using

Socket Calls in a Program, Symbolic Constants for Socket Call Parameters.

9hours

3. Algorithms and Issues in Client Software Design: Introduction, Learning Algorithms

instead of Details, Client Architecture, Identifying the Location of a Server, Parsing an Address

Argument, Looking up a Domain Name, Looking up a well-known Port by Name, Port Numbers

and Network Byte Order, Looking up a Protocol by Name, The TCP Client Algorithm,

22

Allocating a Socket, Choosing a Local Protocol Port Number, A fundamental Problem in

choosing a Local IP Address, Connecting a TCP Socket to a Server, Communicating with the

Server using TCP, Reading a response from a TCP Connection, Closing a TCP Connection,

Programming a UDP Client, Connected and Unconnected UDP Socket, Using Connect with

UDP, Communicating with a Server using UDP, Closing a Socket that uses UDP, Partial Close

for UDP, A Warning about UDP Unreliability. 9hours

Part-B

4. Example Client Software: Introduction, The Importance of Small Examples, Hiding Details,

An Example Procedure Library for Client Programs, Implementation of Connect TCP,

Implementation of Connect UDP, A Procedure that Forms Connections, Using the Example

Library, The DAYTIME Service, Implementation of a TCP Client for DAYTIME, Reading from

a TCP Connection, The Time Service, Accessing the TIME Service, Accurate Times and

Network Delays, A UDP Client for the TIME Service, The ECHO Service, A TCP Client for the

ECHO Service, A UDP Client for the ECHO Service.

9hours

5. Algorithms and Issues in Server Software Design: Introduction, The Conceptual Server

Algorithm, Concurrent Vs Iterative Servers, Connection-Oriented Vs Connectionless Access,

Connection-Oriented Servers, Connectionless Servers, Failure, Reliability and Statelessness,

Optimizing Stateless Servers, Four Basic Types of Servers, Request Processing Time, Iterative

Server Algorithms, An Iterative Connection-Oriented Server Algorithm, Binding to a Well

Known Address using INADDR_ANY, Placing the Socket in Passive Mode, Accepting

Connections and using them. An Iterative Connectionless Server Algorithm, Forming a Reply

Address in a Connectionless Server, Concurrent Server Algorithms, Master and Slave Processes,

A Concurrent Connectionless Server Algorithm,

A concurrent Connection-Oriented Server Algorithm, Using separate Programs as Slaves,

Apparent Concurrency using a Single Process, When to use each Server Types, The Important

Problem of Server Deadlock, Alternative Implementations. 9hours

6. Iterative, Connectionless Servers (UDP), Iterative, Connection-Oriented Servers (TCP),

Concurrent, Connection-Oriented Servers (TCP): Introduction, Creating a Passive Socket,

Process Structure, An example TIME Server, Introduction, Allocating a Passive TCP Socket, A

Server for the DAYTIME Service, Process Structure, An Example DAYTIME Server, Closing

Connections, Connection Termination and Server Vulnerability, Introduction, Concurrent

ECHO, Iterative Vs Concurrent Implementations, Process Structure, An example Concurrent

ECHO Server, Cleaning up Errant Processes 8hours

23

Laboratory Work:


implement a simple iterative connectionless server and demonstrate its functioning.


implement a simple iterative connection-oriented server and demonstrate its functioning.


implement a simple concurrent connection-oriented server and demonstrate its functioning.


implement a simple Day / Time Server and demonstrate its functioning.

5. Repeat the above problems using JAVA networking facilities.

TEXT BOOK:

1. Douglas E.Comer, David L. Stevens: Internetworking with TCP/IP – Vol. 3, Client-

Server Programming and Applications, BSD Socket Version with ANSI C, 2nd Edition,

Pearson, 2001.

24


Subject Title: OPTICAL NETWORKS

Designation: CORE


Course Outcomes:

1. Discuss the different generations of digital transport networks also compare the WDM

and TDM. Analyze the attributes of OFC

2. Discuss the different digital signaling hierarchies

3. Explain the different characteristics of Optical fiber

4. Diagnose the timing and synchronization in digital networks

5. Analyze the SONET and SDH networks

6. Determine the importance of multiplexing also classify the relationship of WDM to

SONET

Part-A

1. Introduction, Telecommunications Infrastructure, Characteristics of Optical Fiber:

Three generations of Digital Transport Networks; A brief introduction to WDM and TDM; The

Optical Marketplace; Wireless Optical Systems; Key Optical Nodes; Other Key Terms;

Evolution of Optical Systems; Key attributes of Optical Fiber, The Local Connections; The

Backbone Connections; The Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies;

T1 / DS1 and T3 / DS3; The Layered Protocol Model in the Transport Network; considerations

for Interworking Layer1, Layer 2, and Layer 3 Networks, The Basics; The Wavelength; The

Basic Components; Structure of the Fiber; Fiber Types; Key Performance Properties of Fiber;

Attenuation; Amplifier Spontaneous Emission; Chromatic Dispersion; Lasers. 8hours

2. Timing and Synchronization, SONET and SDH: Timing and Synchronization in Digital

Networks; Effect of a Timing error; The Clocking Signal; Types of Timing in Networks; Timing

Variations; Methods of Clock Exchange; Distribution of Timing Using SONET and DS1;

Timing Downstream Devices; Building Integrated Timing Supply; Synchronization Status

Messages and Timing Loops, The SONET Multiplexing Hierarchy; SONET and SDH

Multiplexing Structure; The SONET / SDH Frame Structure; SONET and SDH Functional

Components; SONET and SDH Problem Detection; Locating and Adjusting Payload with

Pointers; Virtual Tributaries in more detail; Virtual Tributaries in Virtual Containers; The

Overhead Bytes; SONET and SDH Concatenation. 9hours

3. Architecture of Optical Transport Networks, WDM, Network Topologies and Protection

Schemes: The Digital Wrapper; Control Planes; In-Band and Out-Band Control Signaling;

25

Importance of Multiplexing and Multiplexing Hierarchies; Current Digital Transport Hierarchy;

SONET Multiplexing Hierarchy; SDH Multiplexing Hierarchy; Key Indexes and Other Terms;

The New Optical Transport and Digital Transport Hierarchy;

The OTN Layered Model; Encapsulation and Decapsulation Operations; Generic Framing

Procedure, The WDM Operation; DWDM, TDM and WDM Topologies; Relationship of WDM

to SONET / SDH; EDF; WDM Amplifiers; Add-Drop Multiplexers; WDM Cross-Connects;

Wavelength Continuity Property; Examples of DWDM Wavelength Plan; Higher Dispersion for

DWDM; Tunable DWDM Lasers, The Non-Negotiable Requirement Robust Networks;

Diversity in the Network; Line and Path Protection Switching; Types of Topologies; Working

and Protection Fibers; Point-to-Point Topology; BLSR; Protection Switching on Four-Fiber

BLSR; Meshed Topologies; PONs; Ethernet in the Wide Area Backbone, Metro Optical

Networking. 9hours

Part-B

4. MPLS and Optical Networks, Architecture of IP and MPLS-Based OTNs: Label

Switching; FEC; Types of MPLS Nodes; Label Distribution and Binding; Label Switching and

Traffic Forwarding; MPLS Support of VPNs; MPLS Traffic Engineering; Multiprotocol Lambda

Switching; MPLS and Optical TE Similarities; Possibilities for the MPIS Network; Control and

Data Planes Interworking, IP, MPLS, and Optical Control Planes; Interworking the three

Control Planes; Management of the Planes; A Framework for the IP over Optical Networks; An

Opposing View; Generalized MPLS use in Optical Networks; Bi-Directional LSPs in Optical

Networks; GMPLS Extensions for G.709; GMPLS with SONET and SDH. 9hours

5. The Link Management Protocol, Optical Routers: Keep the Optical Link up and running;

What is managed? Data-bearing Links; Clarification of terms; Basic functions of LMP; Control

Channel Management; Link Property Correlation; Fault Management; Extending LMP

operations for Optical Link Systems., Optical Switching; Implementation Preferences; Key

Terms; Evolution of Switching Networks; Optical Router; Optical Switching Technologies;

Optical Resources; Protecting the Label Switched Paths; Protection of the OSP; Wavelength

OSP and MPLS LSP; Nesting the LSPs and OSPs; Topologies for a Node Failure; Plane

Coupling and De-Coupling; Some End-to-End Wavelengths and Node-to-Node Wavelengths;

Granularity of Labels versus Wavelength Support; Approach to the Problem of LSP and OSP

Interworking; MEMS and Optical Switching; Thermo-Optic Switches. 9hours

6. ASON Operation at the UNI and NNI, ATM versus IP in Optical Internets, Evolving to

3G Architecture: Objectives of ASON; UNI and NNI; Managing the Optical Bandwidth in the

ASON; General approach to Optical Bandwidth Management; IETF Optical Carrier Framework

for the UNI; Types of Connections; NNI; UNI and NNI Signaling Services, IP over ATM over

SONET; The OSI and Internet Layered Models; ATM in the SONET / SDH Payload Envelope;

26

PPP in the SONET Payload Envelope; Encapsulation / Framing Rules; The PPP Packet; The

ATM versus IP; Overhead of IP and ATM; Three encapsulation methods, Migration of IP

Optical Networking; IP and the Optical Backbones; Placing MPLS into the Picture; Putting it

together. 8hours

Self-Learning-Component (SLC): Key attributes of Optical Fiber, Lasers, SONET and SDH

Concatenation, Metro Optical Networking, GMPLS with SONET and SDH, Thermo-Optic

Switches, UNI and NNI Signaling Services, Three encapsulation methods.


TEXT BOOKS:

1. Uyless Black: Optical Networks, Pearson Education Asia, 2002.

REFERENCE BOOKS:

1. Rajiv Ramaswami and Kumar N.Sivaranjan: Optical Networks - A Practical Perspective,

Morgan Kaufuann, 2000.

2. Paul E.Green Jr.: Fiber Optic Network, Prentice Hall, 1993.

3. Jeff Hecht: Understanding Fiber Optics, 4th Edition, PHI 1999.

27


Subject Title: NETWORK MANAGEMENT

Designation: CORE


Course Outcomes:

1. Describe the importance of Network topology, discuss the common network problems

2. Discuss the Network management standards, terminology , symbols and conventions,

data types etc.,

3. Discuss the SNMP V1 network management and communication model

4. Analyze the RMON, SMI, MIB, distinguish relationship between control and data tables

5. Explain the broadband network management ATM Networks, discriminate M1, M2 and

M2 interface

6. Explain the broadband access networks and technologies

Part-A

1. Introduction: Analogy of Telephone Network Management, Data and Telecommunication

Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and

Intranets, Communications Protocols and Standards- Communication Architectures, Protocol

Layers and Services; Case Histories of Networking and Management – The Importance of

topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems;

Challenges of Information Technology Managers, Network Management: Goals, Organization,

and Functions- Goal of Network Management, Network Provisioning, Network Operations and

the NOC, Network Installation and Maintenance; Network and System Management, Network

Management System platform, Current Status and Future of Network Management.

9hours

2. Basic Foundations: Standards, Models, and Language: Network Management Standards,

Network Management Model, Organization Model, Information Model – Management

Information Trees, Managed Object Perspectives, Communication Model; ASN.1- Terminology,

Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from

ISO 8824; Encoding Structure; Macros, Functional Model 8hours

3. SNMPv1 Network Management: Managed Network: The History of SNMP Management,

Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization

Model, System Overview. The Information Model – Introduction, The Structure of Management

Information, Managed Objects, Management Information Base. The SNMP Communication

28

Model – The SNMP Architecture, Administrative Model, SNMP Specifications, SNMP

Operations, SNMP MIB Group, Functional Model 9hours

Part-B

4. SNMP Management – RMON: Remote Monitoring, RMON SMI and MIB, RMONI1-

RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control

and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension

Groups, RMON2 – The RMON2 Management Information Base, RMON2 Conformance

Specifications. 8hours

5. Broadband Network Management: Broadband Access Networks and Technologies:

Broadband Access Networks, Broadband Access Technology; HFCT Technology: The

Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant,

The RF Spectrum for Cable Modem; Data Over Cable. Reference Architecture; HFC

Management – Cable Modem and CMTS Management, HFC Link Management, RF Spectrum

Management, DSL Technology; Asymmetric Digital Subscriber Line Technology – Role of the

ADSL Access Network in an Overall Network, ADSL Architecture, ADSL Channeling

Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network Management

Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance

Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2,

ADSL Configuration Profiles. 9hours

6. Network Management Applications: Configuration Management- Network Provisioning,

Inventory Management, Network Topology, Fault Management- Fault Detection, Fault Location

and Isolation Techniques, Performance Management – Performance Metrics, Data Monitoring,

Problem Isolation, Performance Statistics; Event Correlation Techniques – Rule-Based

Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook correlation Model, State

Transition Graph Model, Finite State Machine Model, Security Management – Policies and

Procedures, Security Breaches and the Resources Needed to Prevent Them, Firewalls,

Cryptography, Authentication and Authorization, Client/Server Authentication Systems,

Messages Transfer Security, Protection of Networks from Virus Attacks, Accounting

Management, Report Management, Policy- Based Management, Service Level Management.

9hours

TEXT BOOKS:

29

1. Mani Subramanian: Network Management- Principles and Practice, 2nd Pearson Education,

2010.

REFERENCE BOOKS:

1.J. Richard Burke: Network management Concepts and Practices: a Hands-On Approach, PHI,

2008.

30


Subject Title: C# AND .NET

Designation: ELECTIVE


Course Outcome

On successful completion of the course the students will be able to

1. Explain the basics of .Net platform and the role of base class libraries, role of common

intermediate language and namespaces.

2. Explain the method to Define and deploy the different command line compiler options.

3. Discuss the fundamentals of c# and to build the basic c# program using different constructs.

4. Review the basic pillars of object oriented programming concepts.

5. Provide the knowledge about Exception Handling and basics of object lifetime.

6. Discuss the different system defined interfaces and collections and also define the custom

interfaces with examples.

Part-A

1. The Philosophy of .NET: Understanding the Previous State of Affairs, The .NET Solution,

The Building Block of the .NET Platform (CLR,CTS, and CLS), The Role of the.NET Base

Class Libraries, What C# Brings to the Table, An Overview of.NET Binaries ( aka Assemblies ),

the Role of the Common Intermediate Language , The Role of .NET Type Metadata, The Role of

the Assembly Manifest, Compiling CIL to Platform –Specific Instructions, Understanding the

Common Type System, Intrinsic CTS Data Types, Understanding the Common Languages

Specification, Understanding the Common Language Runtime A tour of the.NET Namespaces,

Increasing Your Namespace Nomenclature, Deploying the .NET Runtime. The Role of the

Command Line Complier (csc.exe), Building C # Application using csc.exe Working with

csc.exe Response Files, Generating Bug Reports , Remaining C# Compiler Options, The

Command Line Debugger (cordbg.exe) Using the, Visual Studio .NET IDE, Other Key Aspects

of the VS.NET IDE, C# “Preprocessor:” Directives, An Interesting Aside: The System.

Environment Class 9hours

2. C# Language Fundamentals: The Anatomy of a Basic C# Class, Creating objects:

Constructor Basics, The Composition of a C# Application, Default Assignment and Variable

Scope, The C# Member Initialization Syntax, Basic Input and Output with the Console Class,

Understanding Value Types and Reference Types, The Master Node: System, Object, The

System Data Types (and C# Aliases),Converting Between Value Types and Reference Types:

Boxing and Unboxing, Defining Program Constants, C# Iteration Constructs, C# Controls Flow

Constructs, The Complete Set of C# Operators, Defining Custom Class Methods, Understating

31

Static Methods, Methods Parameter Modifies, Array Manipulation in C #, String Manipulation in

C#, C# Enumerations, Defining Structures in C#, Defining Custom Namespaces. 9hours

3. Object- Oriented Programming with C#: Forms defining of the C# Class, Definition the

“Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s

Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields, The Second Pillar:

C#’s Inheritance Supports, keeping Family Secrets: The “Protected” Keyword, Nested Type

Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between 8hours

Part-B

4. Exceptions and Object Lifetime: Ode to Errors, Bugs, and Exceptions, The Role of .NET

Exception Handing, the System, Exception Base Class, Throwing a Generic Exception, Catching

Exception, CLR System – Level Exception (System. System Exception), Custom Application-

Level Exception (System. System Exception), Handling Multiple Exception, the Family Block,

the Last Chance Exception. Dynamically Identifying Application and System Level Exception

Debugging System Exception Using VS.NET, Understanding Object Lifetime, the CIT of “new’,

The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an

Ad Hoc Destruction Method, Garbage Collection Optimizations, The System. GC Type.

9hours

5. Interfaces and Collections: Defining Interfaces Using C# Invoking Interface Members at the

object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation,

Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing,

Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a

Custom Enumerator(IEnumerable and Enumerator), Building Cloneable objects ( ICloneable),

Building Comparable Objects ( IComparable ), Exploring the system. Collections Namespace,

Building a Custom Container (Retrofitting the Cars Type). Callback Interfaces, Delegates, and

Events, Advanced Techniques Understanding Callback Interfaces, Understanding the .NET

Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate

Example, Building More a Elaborate Delegate Example, Understanding Asynchronous

Delegates, Understanding (and Using)Events. The Advances Keywords of C#, A Catalog of C#

Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation

of Type Indexer. Using C# Indexer from VB.NET. Overloading operators, The Internal

Representation of Overloading Operators, interacting with Overload Operator from Overloaded-

Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit

Conversion Routines, The Internal\Representations of Customs Conversion Routines

9hours

6. Understanding .NET Assemblies: Problems with Classic COM Binaries, An Overview of

.NET Assembly, Building a Simple File Test Assembly, A C#, Client Application, A Visual

Basic .NET Client Application, Cross Language Inheritance, Exploring the CarLibrary’s,

Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly,

Understanding Private Assemblies, Probing for Private Assemblies (The Basics), Private A

Assemblies XML Configurations Files, Probing for Private Assemblies (The

Details),Understanding Shared Assembly, Understanding Shared Names, Building a Shared

32

Assembly, Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared

Assembly. 8hours

TEXT BOOKS:

1. Andrew Troelsen: Programming C# with .NET 3.0, 4th Edition, Wiley India, 2009.

2. E. Balagurusamy: Programming in C#, 2nd Edition, Tata McGraw Hill, 2008.

REFERENCE BOOKS:

1. Tom Archer: Inside C#, WP Publishers, 2001.

2. Herbert Schildt: C# - The Complete Reference, Tata McGraw Hill, 2004.

33


Subject Title: STOCHASTIC MODELS AND APPLICATIONS



Course outcome:

1. Have an appreciation for the power of stochastic processes and its range of applications.

2. Master essential stochastic modeling using Markov chains

3. Analyze concepts of queuing theory.

4. To formulate and solve problems which involve setting up stochastic models.

5. Describe the concepts of random process

6. To implement simulation of complex models using commercial software, to interpret the

outputs of simulation exercises.

Part-A

1. Introduction, Introduction to Probability Theory: A Speech Recognition System, A Radar

System, A Communication Network, Experiments, Sample Spaces, and Events, Axioms of

Probability, Assigning Probabilities, Joint and Conditional Probabilities, Bayer’s Theorem,

independence, Discrete random Variables, Engineering Application: An Optimal

Communication System 9hours

2. Random variables, Distributions, and Density Functions: The Cumulative Distribution

Function, The Probability Density Function, The Gaussian Random Variable, Other Important

Random Variables, Conditional Distribution and Density Functions, Engineering Application:

Reliability and Failure Rates 9hours

3. Random Processes: Definition and Classification of Processes, Mathematical Tools for

Studying Random Processes, Stationary and Ergodic Random Processes, Properties of the

Autocorrelation Function, Gaussian random Processes, Poisson Processes, Engineering

Application: Shot Noise in a p-n Junction Diode

8hours

Part-B

34

4. Markov Processes: Definition and Examples of Markov Processes, Calculating Transition

and State Probabilities in Markov Chains, Characterization of Markov Chains, Continuous Time

Markov Processes, Engineering Application: A Telephone Exchange 8hours

5. Poisson Processes, Queuing Theory: The non-stationary Poisson process; The stationary

Poisson process; Some Poisson process computations; Classifying the events of a non-stationary

Poisson process; Conditional distribution of the arrival times. Queuing Theory: Introduction;

Preliminaries; Exponential models; Birth-and-Death exponential queuing systems; The backwards

approach in exponential queues; A closed queuing network; An open queuing network; The M/G/1 queue; Priority

queues. 9hours

6. Simulation Techniques: Computer Generation of Random Variables, Generation of Random

Processes, Simulation of Rare Events, Engineering Application: Simulation of a Coded Digital

Communication System. 9hours

TEXT BOOKS:

1. Scott L. Miller, Donald G. Childers: Probability and Random Processes With Applications to

Signal Processing and Communications, Elsevier, 2004.

2. Sheldon M. Ross: Probability Models for Computer Science, Elsevier, 2002.

REFERENCE BOOKS:

1. R. W. Wolff: “Stochastic Modeling and Queuing Theory”, Prentice Hall, 1989.

2. B. R. Bhat: “Stochastic Models Analysis and Applications”, New Age International, 2000.

35


Subject Title: SYSTEM MODELING AND SIMULATION



Course Outcome

On successful completion of the course, the student will be able to

1. Identify situations where one should use simulation and where not to.

2. Analyze various probability distribution functions.

3. Generate and test random number sequences.

4. Select suitable data collection methods and build and run simulation methods.

5. Verify, validate and calibrate simulation models.

6. They will thus be able to analyze system responsiveness, scalability etc. as a function of

workload.

Part-A

1. Introduction, General Principles: When simulation is the appropriate tool and when it is not

appropriate; Advantages and disadvantages of Simulation; Areas of application; Some recent

applications of Simulation; Systems and system environment; Components of a system; Discrete

and continuous systems; Model of a system; Types of Models; Discrete-Event System

Simulation; Steps in a Simulation Study, Concepts in Discrete-Event Simulation, List processing.

9hours

2. Statistical Models in Simulation, Queuing Models Review of terminology and concepts;

Useful statistical models; discrete distributions; Continuous distributions; Poisson process;

Empirical distributions, Characteristics of queuing systems; Queuing notation; Long-run

measures of performance of queuing systems; Steady-state behavior of M/G/1 queue;

Networks of queues, 8hours

3. Random-Number Generation, Random-Variate Generation: Properties of random

numbers; Generation of pseudo-random numbers; Techniques for generating random

numbers; Tests for Random Numbers Random-Variate Generation: Inverse transform

technique; Acceptance-Rejection technique; Special properties.

9hours

36

Part-B

4. Input Modeling: Data Collection; Identifying the distribution with data; Parameter

estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input

models without data; Multivariate and Time-Series input models. 9hours

5. Verification, Calibration, and Validation of Simulation Models: Model building,

verification, and validation; Verification of simulation models; Calibration and validation of

models.Optimization via Simulation 9hours

6. Estimation of Absolute Performance, Case Study: Types of simulations with respect to

output analysis; Stochastic nature of output data; Absolute measures of performance and their

estimation; Output analysis for terminating simulations; Output analysis for steady-state

simulations, Simulation of networked computer systems. 8hours

TEXT BOOKS:

1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System

Simulation, 5th Edition, Pearson Education, 2010.

REFERENCE BOOKS:

1. Lawrence M. Leemis, Stephen K. Park: “Discrete – Event Simulation: A First Course”,

Pearson Education, 2006.

2. Averill M. “Law: Simulation Modeling and Analysis”, 4th Edition”, Tata McGraw-Hill, 2007.

37


Subject Title: EMBEDDED SYSTEMS



Course outcome:

• Understand embedded systems and real-time systems

• Design embedded systems and real-time systems

• Describing concurrent process model

• Exploring the software architecture

• Explaining the OS Services

• Analyzing the Embedded softwares

Part-A

1. Custom single-purpose processor design; RT level custom single-purpose processor

design, optimizing custom single-purpose processors: Optimizing the original program,

optimizing the FSMD, Optimizing the data path, optimizing the FSM.

9hours

2. Timers, counters, and watchdog timers. State machine models: introduction; An

introductory example, A basic state machine model: finite-state machines(FSM);finite-

state machines with data path model (FSMD);using state machines: Describing a system

as a state machine, Comparing state machine and sequential program models, Capturing a

state machine model in a sequential programming language; hierarchical/concurrent state

machine model (HCFSM) and the state charts language; program state machine

model(PSM);The role of an appropriate model and language. 8hours

3. Concurrent process models: concurrent processes: process create and terminate ,process

suspend and resume, Process join; Communication among processes: shared memory,

Message passing; synchronization among processes: Condition variables, monitors.

Interrupts: interrupt Basics; The Shared Data Problem; interrupt latency

9hours

Part-B

4. Survey of Software Architecture: Round Robin, Round Robin with interrupts, Function

queue scheduling architecture, Real time operating system architecture, selecting

architecture. Introduction to RTOS: Tasks and task states, tasks and Data, semaphores

and shared data. 9hours

38

5. Operating systems services: Message queues, mailboxes, and pipes; Timer functions;

Events; memory management, Interrupt routines in an RTOS environment. Basic design

using an RTOS;

Overview, principles, an example, encapsulating semaphores and queues, Hard Real-time

scheduling considerations, saving power. 9hours

6. Embedded software development tools: Host and target machines; Linker/locator for

Embedded software, getting embedded software into the target system. Debugging

Techniques: Testing on host machine, instruction set simulators, macros and tools, an

example system: what the program does, environment in which the program operates.

8hours

Text Books :

1. Embedded system design : A unified Hardware/software introduction – Frank Vahid,

Tony Givargis, John Wiley and Sons, Inc. 2002 (Articles : 2.4, 2.5, 2.6; 4.2, 8.3 to 8.13)

2. An Embedded software Primer – David E. Simon; Pearson Education, 1999. (Chapters:

4, 5, 6, 7, 8, 9, 10 and 11)

Reference books:

1. Embedded C: Michael J. Pont, Pearson Education (2002)

2. Real-Time systems and programming languages : Alan Burns and Andy Wellings,

Addison Wesley-Longman (1997)

3. Real Time programming : A guide to 32 bit embedded development, Grehan,

Moore and Cyliax, Addison-Wesley-longman.

39


Subject Title: INFORMATION SECURITY


Pre-requisite: COMPUTER NETWORKS



1. identify common network security vulnerabilities/attacks

2. Explain and analyze the basic Cryptographic algorithms for security

3. Critically evaluate the risks and threats to networked computers how provide security

using public key cryptography.

4. Demonstrate detailed knowledge of the role of encryption in email sort of

communication.

5. Analyze security issues of IP security.

6. Identify the appropriate procedures required for secure electronic transactions.

Part-A

1. Introduction to Information Security: Introduction; what is security? Critical characteristics

of information; NSTISSC security model; Approaches to information security implementation;

The Security System Development Life Cycle; Information Security Terminology. Planning for

Security: Introduction; Information Security Policy, Standards, and Practices; The Information

Security Blue Print. 9hours

2. Security Technology: Firewalls and VPNs: Introduction, Physical design, Firewalls,

Protecting Remote Connections. Intrusion Detection, Access control and Other Security Tools:

Introduction; Intrusion Detection Systems (IDS); Honey Pots, Honey Nets, and Padded cell

systems; Scanning and Analysis Tools; Access Control Devices. 9hours

3. Information Security maintenance: Introduction; Security Management Models; The

Maintenance Model. Introduction to Network Security: Attacks, Services, and Mechanisms;

Security Attacks; Security Services; A model for Internetwork Security; Internet Standards and

RFCs; Wireless network security. 8hours

Part-B

40

4. Cryptography: Conventional Encryption Principles and Algorithms; Cipher Block Modes of

Operation; Location of encryption devices; Key distribution; Approaches to message

authentication; Secure Hash functions and HMAC; Public Key Cryptography Principles and

Algorithms; Digital Signatures; Key management. Authentication Applications: Kerberos, X.509

Directory Authentication Service. 9hours

5. Electronic Mail Security: Pretty Good Privacy (PGP), S/MIME.IP Security: IP Security

Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload,

Combining Security Associations, Key Management. 9hours

6. Web Security: Web security requirements, Secure Socket layer (SSL) and Transport layer

Security (TLS), Secure Electronic Transaction (SET). Software: Introduction; Software flaws;

Malware; Software-based attacks; Digital Rights Management; 8hours

TEXT BOOKS:

1. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2nd Edition,

Cengage Learning, 2005.

2. William Stallings: Network Security Essentials Applications and Standards, Person, 2000.

3. Deven N. Shah: Information Security – Principles and Practice, Wiley India, 2009.

REFERENCE BOOKS:

1. Behrouz A. Forouzan: Cryptography and Network Security, Tata McGraw-Hill, 2007.

41


Subject Title: DISTRIBUTED SYSTEMS


Pre-requisite: OPERATING SYSTEM


Course outcomes


1. Perceptive of the principles and concepts involved in designing distributed systems

2. Master the general properties of networked communication necessary for distributed

systems on the Internet

3. Master basic algorithms for failure detection, leader elections, broadcast and multicast,

basic shared memory in distributed systems, agreement protocols, and group

communication

4. Employ and create common paradigms for easing the task of distributed systems

programming, such as RPC

5. Identify the security challenges faced by distributed systems. Be able to select

appropriate security solutions to meet the needs of commonly encountered distributed

programming scenarios.

6. nalyze the distributed algorithms for locking, synchronization and concurrency

scheduling.

Part-A

1. Characterization of Distributed Systems and System Models: Introduction, Examples of

distributed systems, Resource sharing and the Web, Challenges, Architectural models,

Fundamental models. 9hours

2. Networking and Internetworking: Types of Networks, Networks principles, Internet

protocols 9hours

3. Interprocess Communication: Introduction, The API for the Internet protocols, External data

representation and marshalling, Client -Server communication, Group communication, Case

study: Interprocess communication in UNIX 8hours

Part-B

4. Distributed Objects and Remote Invocation: Communication between distributed objects,

Remote procedure call, events and notifications 9hours

42

5. Operating System Support and Security: The Operating system layer, protection, processes

and threads, communication and invocation, operating system architecture 9hours

6. Transactions and Concurrency Control: Transactions, nested transactions, locks, optimistic

concurrency control, timestamp ordering, comparison of methods for concurrency control.

Distributed Shared Memory: Design and Implementation issues, sequential consistency and Ivy.

8hours

TEXT BOOKS:

1. George Coulouris, Jean Dollimore, Tim Kindberg: Distributed Systems, Concept and Design,

3rd Edition, Pearson Education, 2005.

REFERENCE BOOKS:

1. Sukumar Ghosh: Distributed Systems, An Algorithmic Approach, Chapman &Hall / CRC,

2007.

2. Pradeep K. Sinha: Distributed Operating Systems, Concepts and Design, PHI, 2007.

3. Randy Chow, Theodore Johnson: Distributed Operating Systems and Algorithm Analysis,

Pearson, 2009.

43


Subject Title: COMPUTER SYSTEMS PERFORMANCE ANALYSIS


Pre-requisite: NOT APPLICABLE


Course outcomes:

• Use applied probability theory in measuring the performance of a system.

• Realize statistics and data presentation.

• Practice performance evaluation techniques and performance measures or metrics.

• Compare systems using sample data. Use Queuing theory to measure performances of

systems.

• Explain the queuing networks

• Explore the concepts of convolution algorithms

Part-A

1. Introduction: The art of Performance Evaluation; Common mistakes in Performance

Evaluation; A systematic approach to Performance Evaluation; Selecting an evaluation

technique; Selecting performance metrics; Commonly used performance metrics; Utility

classification of performance metrics; Setting performance requirements. 9hours

2. Workloads, Workload Selection and Characterization: Types of workloads: addition

instructions; Instruction mixes; Kernels; Synthetic programs; Application benchmarks; Popular

benchmarks. Work load selection: Services exercised; Level of detail; Representativeness;

Timeliness; Other considerations in workload selection. 9hours

Work load characterization techniques: Terminology; Averaging; Specifying dispersion; Single-

parameter histograms; Multi-parameter histograms; Principle-component analysis; Markov

models; Clustering. 8hours

3. Monitors, Program Execution Monitors, and Accounting Logs: Monitors: Terminology

and classification; Software and hardware monitors; Software versus hardware monitors;

Firmware and hybrid monitors; Distributed system monitors. Program execution monitors and

44

accounting logs: Program execution monitors; Techniques for improving program performance;

Accounting logs; Analysis and interpretation of accounting log data; Using accounting logs to

answer commonly asked questions. Capacity Planning and Benchmarking: Steps in capacity

planning and management; Problems in capacity planning; Common mistakes in benchmarking;

Benchmarking games; Load drivers; Remote-terminal emulation; Components of an RTE;

Limitations of RTEs

Part-B

4. Experimental Design and Analysis: Introduction: Terminology; Common mistakes in

experiments; Types of experimental designs. 2k Factorial Designs: Concepts; Computation of

effects; Sign table method for computing effects; Allocation of variance; General 2k Factorial

Designs. General full factorial designs with k factors: Model; Analysis of a general design;

Informal methods. Queuing Models: Introduction: Queuing notation; Rules for all Queues;

Little’s law; Types of stochastic processes. Analysis of Single Queue: Birth-Death processes; M /

M / 1 Queue; M / M /m Queue; M / M / m / B Queue with finite buffers; Results for other M / M

/1 Queuing Systems. 9hours

5. Queuing Networks: Open and closed Queuing Networks; Product form networks; Queuing

Network models of Computer Systems. Operational Laws: Utilization law; Forced flow law;

Little’s law; General response time law; Interactive response time law; Bottleneck analysis.

Mean Value analysis and related techniques: Analysis of open queuing networks; Mean value

analysis; Approximate MVA; Balanced job bounds. 9hours

6. Convolution Algorithm: Distribution of jobs in a system; Convolution algorithm for

computing G(N); Computing performance using G(N); Timesharing systems. Hierarchical

decomposition of Large Queuing Networks: Load-dependent service centers; Hierarchical

decomposition; Limitations of Queuing Theory. 8hours

TEXT BOOKS

1. Raj Jain: The Art of Computer Systems Performance Analysis, John Wiley and Sons, 2007.

REFERENCE BOOKS:

1. Paul J. Fortier, Howard E. Michel: Computer Systems Performance Evaluation and Prediction,

Elsevier, 2003.

2. Trivedi, KS: Probability and Statistics with Reliability, Queuing and computer science

Applications, 2nd Edition, Wiley India, 2001.

45


Subject Title: WEB ENGINEERING


Pre-requisite: Object oriented programming


Course outcomes:

1. Perform analysis modeling and design modeling for web applications.

2. Identify candidate tools and technologies for developing web applications.

3. Develop user-interfaces for web applications.

4. Describe and transform data using XML and its related technologies. Develop web

applications and web services.

5. Explain the web security

6. Describe web applications

Part-A

1. Introduction: Motivation, Categories of web applications, Characteristics of web

applications. Requirements Engineering: Introduction, Fundamentals, RE specifics in web

engineering, Principles of RE for web applications, Adapting RE methods to web application

development, Outlook. 9hours

2. Modeling Web Application: Introduction, Fundamentals, Modeling specifics in web

engineering, Modeling requirements, Content modeling, Hypertext modeling, Presentation

modeling, Customization modeling, Methods and tools, Outlook. Web Application

Architectures: Introduction, Fundamentals, Specifics of web application architectures,

Components of generic web application architecture, Layered architectures, Data-aspect

architectures. 9hours

3. Technology-Aware Web Application Design: Introduction, Web design from an

evolutionary perspective, Presentation design, Interaction design, Functional design, Outlook.

Technologies for Web Applications: Introduction, Fundamentals, Client/Server communication

on the web, Client side technologies, Document-specific technologies, Server-side technologies,

Outlook. Testing Web Applications: Introduction, Fundamentals, Testing specifics in web

engineering, Test approaches, Test scheme, Test methods and techniques, Test automation,

Outlook. 8hours

46

Part-B

4. Operation and Maintenance of Web Applications: Introduction, Challenges following the

launch of a web application, Content management, Usage analysis, Outlook. Web Project

Management: From software project management to web project management, Challenges in

web project management, Managing web teams, Managing the development process of a web

application, Outlook. The Web Application Development Process: Motivation, Fundamentals,

Requirements for a web application development process, Analysis of the rational unified

process, Analysis of extreme programming, Outlook. 9hours

5. Usability of Web Applications: Motivation, What is usability? What characterizes the

usability of web applications? Design guidelines, Web usability engineering methods, Web

usability engineering trends, Outlook Performance of Web Applications: Introduction, What is

performance? What characterizes performance of web applications, System definition and

indicators, Characterizing the work load, Analytical techniques, Representing and interpreting

results, Performance optimization methods, Outlook. 9hours

6. Security for web Applications: Introduction, Aspects of security, Encryption, digital

signatures, and certificates, Secure Client/Server interaction, Client security issues, Service

provider security issues, Outlook. The Semantic Web: Fundamentals of the semantic web,

Technological concepts, Specifics of semantic web applications, Tools, Outlook.

8hours

Text Book:

1.Gerti Kappel, Birgit Proll, SiegfriedReich, Werner Retschitzegeer (Editors): Web Engineering,

Wiley India, 2007.

Reference Books:

1. Roger Pressman, David Lowe: Web Engineering: A Practitioner’s Approach, McGraw Hill,

2008.

47


Subject Title: CLOUD COMPUTING


Pre-requisite: NOT APPLICABLE


Course Outcome


1. Understand the basic cloud services, infrastructure and computing characteristics.

2. Thorough understanding of the various cloud models and their security cibstraints.

3. Choose between the various cloud solutions as a service.

4. Articulate issues like cloud management, provisioning, billing etc.

5. Articulate about the various cloud articulation technologies.

6. Map the cloud to Service Oriented Architecture (SOA)

•

Part – A

1. Introduction: Business and IT perspective, Cloud and virtualization, Cloud services

requirements, cloud and dynamic infrastructure, cloud computing characteristics, cloud adoption.

9hours

2. Cloud models: Cloud characteristics, Measured Service, Cloud models, security in a public

cloud, public verses private clouds, cloud infrastructure self service. 9hours

3. Cloud at a service: Gamut of cloud solutions, principal technologies, cloud strategy, cloud

design and implementation using SOA, Conceptual cloud model, cloud service demand. Cloud

solutions: Cloud ecosystem, cloud business process management, cloud service management,

cloud stack, computing on demand, cloud sourcing. 8hours

Part – B

4. Cloud offerings: Cloud analytics, testing under cloud, information security, virtual desktop

infrastructure, Storage cloud. Cloud management: Resiliency, Provisioning, Asset management,

48

cloud governance, high availability and disaster recovery, charging models, usage reporting,

billing and metering. 9hours

5. Cloud virtualization technology: Virtualization defined virtualization benefits, server

virtualization, virtualization for x 86 architecture, Hypervisor management software, Logical

partitioning, VIO server, Virtual infrastructure requirements. Storage virtualization, storage area

networks, network attached storage, cloud server virtualization, virtualized data center.

8hours

6. Cloud and SOA: SOA journey to infrastructure, SOA and cloud, SOA defined, SOA defined,

SOA and IAAS, SOA based cloud infrastructure steps, SOA business and IT services.

9hours

Books:

1. Cloud Computing by Dr. Kumar Saurabh, Wiley India, 2011.

Reference Books

1. Michael Miller, Cloud Computing: Web based applications that change the way

you work and collaborate online, Que publishing , August 2009

2. Haley Beard, Cloud Computing Best Practices for Managing and Measuring

Processes for On Demand computing applications and data Centers in the Cloud

with SLAs, Emereo Pty Limited, July 2008.

49


Subject Title: SWITCHING & STATISTICAL MULTIPLEXING IN

TELECOMMUNICATIONS


Pre-requisite: Not applicable


Course outcomes:

• Introduction to switching and digital terminologies

• The purpose of the course is for the course participant to develop basic knowledge and

skills in analysis and synthesis of digital circuits.

• Such knowledge is necessary to be able to work professional as an engineering related to

the fields of electrical engineering and computer technology.

• Explain the concepts of digital communication

• Explain the basics of Traffic engineering

• Exploring the time division switching

PART A

1. Introduction, Why Digital?: Evolution of Telecommunication, Simple Telephone

Communication, Basics of a Switching System, Manual Switching System, Major

Telecommunication Networks, Advantages of Digital Voice Networks, Digital Signal

Processing, Disadvantages of Digital Voice Networks. 9hours

2. Switching: Crossbar Switching, Principles of Common Control, Touch Tone Dial Telephone,

Principles of Crossbar Switching, Crossbar Switch Configurations, Crosspoint Technology,

Crossbar Exchange Organization 9hours

3. Electronic Space Division Switching: Stored Program Control, Centralized SPC, Distributed

SPC, Software Architecture, Application Software, Enhanced Services, Two-stage, Three-stage

and n-stage Networks. 8hours

PART-B

4. Digital Transmission and Multiplexing: Sampling, Quantization and Binary Coding,

Quantization Noise, Companding, Differential Coding, Vocoders, Pulse Transmission, Line

Coding, Time Division Multiplexing. 9hours

50

5. Time Division Switching: Basic Division Space and Time Switching, Time Multiplexed

Space and Time Switching, Combination Switching, Three-stage and n-stage Combination

Switching. 9hours

6. Traffic Engineering: Network Traffic Load and Parameters, Grade of Service and Blocking

Probability, Modeling Switching Systems, Incoming Traffic and Service Time Characterization,

Blocking Models and Loss Estimates, Delay Systems. 8hours

TEXT BOOKS:

1. Thiagarajan Viswanathan: Telecommunication Switching Systems and Networks, PHI, 1992.

2. John.C.Bellamy: Digital Telephony, 3rd Edition, John Wiley and Sons Inc., 2002.

51


Subject Title: WEB-COMMERCE


Pre-requisite: Not Applicable


Course outcome


1. Understand the scope of e-commerce in the realm of modern business.

2. Know the various business models of e-commerce.

3. Find out the technologies used to develop e-commerce applications.

4. Familiar with marketing methods used in e-commerce.

5. Operate the legal and regulatory framework in e-commerce.

6. Keep track of the methods and metrics used to measure effectiveness of e-commerce

activities

Part-A

1. E-commerce in Indian business context: Definition of e-commerce advantages of e-

commerce, disadvantages of e-commerce, e-commerce opportunities for industries, e-

transition challenges for Indian corporate. 9hours

2. Business models for e-commerce: e-business models based on relationship of

transaction parties – B2C, B2B, C2C and C2B; e-business models based on relationship

of transaction types – Brokerage model, Aggregator model, Info-mediary model,

community model, value chain model, advertising model, subscription model.

9hours

3. Enabling Technologies of www : Internet client-server applications, Networks and

Internets, IPV4, IPV6, Search Engines, software agents, Internet standards and

52

specifications, ISP, Broadband technologies – types of broadband technology. 8hours

Part-B

4. E-marketing : Traditional marketing, identifying web-presence goods, Browsing

behavior model, online marketing, e-advertising, e-branding, Marketing strategies.

9hours

5. E-payment Systems : Main concerns in Internet banking, Digital payment, requirements,

Digital token based e-payment systems, classification of new payment systems,

Properties of e-cash, cheque payment on Internet, Risk of e-payment systems, Designing

e-payment systems, digital signatures. 9hours

6. Other issues : E-CRM solutions; e-supply chain management – strategic advantage,

ESCM components; Information and Strategy – The virtual value chain, seven

dimensions of e-commerce strategy. 8hours

Text Books

1. P.T. Joseph, S.J. “E Commerce – and Indian perspective” – Third edition, PHI 2010. Ch.

1,2,3,4,6 and related sections of 7,8 and 9 only.

2. Daniel Minoli and Emma Minoli “Web commerce Technology”, Tata McGraw Hill – 2000.

53


Subject Title: PROTOCOL ENGINEERING


Pre-requisite: Data Communication


Course Outcome


1. Familiar with the concept of protocols and their representation and discuss the phases of

protocol engineering

2. Identify the components of protocol to be specified and to create formal specification of

protocol using communicating finite state machine

3. Design and develop SDL based specification of a protocol

4. Apply different types of protocol verification techniques and tools

5. Identify a generally applicable and efficient procedure for generating a conformance test

suite for a given protocol implementation, to compare different types of protocol testing

methods, to familiarize concepts of performance, interoperability and scalability testing

of protocol

6. Discuss methods for interactively build correct protocol specification and its

implementation issues

Part-A

1. Introduction, Error Control, Flow Control: Communication model, Communication

Software, Communication Subsystems, Communication Protocol Definition/Representation,

Formal and Informal Protocol Development Methods, Protocol Engineering Phases, Type of

Transmission Errors, Linear Block Code, Cyclic Redundancy Checks, Introduction to Flow

Control, Window Protocols, Sequence Numbers, Negative Acknowledgments, Congestion

Avoidance 9hours

2. Network Reference Model: Layered Architecture, Network Services and Interfaces, Protocol

Functions: Encapsulation, Segmentation, Reassembly, Multiplexing, Addressing, OSI Model

Layer Functions, TCP/IP Protocol Suite, Application Protocols. 9hours

54

3. Protocol Specification: Components of specification, Service specification, Communication

Service Specification Protocol entity specification: Sender, Receiver and Channel specification,

Interface specifications, Interactions, Multimedia specifications, Alternating Bit Protocol

Specification, RSVP specification. 8hours

Part-B

4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient

Features. Communication System Description using SDL, Structure of SDL. Data types and

communication paths, Examples of SDL based Protocol Specifications: Question and answer

protocol, X-on-X-off protocol, Alternating bit protocol, Sliding window protocol specification,

TCP protocol specification, SDL based platform for network, OSPF, BGP Multi Protocol Label

Switching SDL components, Protocol Verification using FSM, ABP Verification, Protocol

Design Errors, Deadlocks, Unspecified Reception, Non-executable Interactions, State

Ambiguities, Protocol Validation Approaches: Perturbation Technique, Reachability Analysis,

Fair Reachability Graphs, Process Algebra based Validation, SDL Based Protocol Verification:

ABP Verification, Liveness Properties, SDL Based Protocol Validation: ABP Validation.

9hours

5. Protocol Conformance and Performance Testing: Conformance Testing Methodology and

Framework, Local and Distributed Conformance Test Architectures, Test Sequence Generation

Methods: T, U, D and W methods, Distributed Architecture by Local Methods, Synchronizable

Test Sequence, Conformance testing with Tree and Tabular Combined Notation (TTCN),

Conformance Testing of RIP, Testing Multimedia Systems, quality of service test

architecture(QOS), Performance Test methods, SDL Based Performance Testing of TCP, OSPF,

Interoperability testing, Scalability testing protocol synthesis problem 8hours

6. Protocol Synthesis and Implementation: Synthesis methods, Interactive Synthesis

Algorithm, Automatic Synthesis Algorithm, Automatic Synthesis of SDL from MSC, Protocol

Re-synthesis, Requirements of Protocol Implementation, Objects Based Approach To Protocol

Implementation, Protocol Compilers, Code generation from Estelle, LOTOS, SDL and CVOPS.

9hours

TEXT BOOKS:

1. Pallapa Venkataram and Sunilkumar S. Manvi: Communication Protocol Engineering, PHI,

2004.

REFERENCE BOOKS:

1. Mohammed G. Gouda: Elements of Protocol Design, Wiley Student Edition, 2004.

55


Subject Title: TOPICS IN MULTIMEDIA COMMUNICATIONS


Pre-requisite: Computer networks


Course outcome: Students will learn

Course Outcomes:

1. Describe the multimedia architecture, representation of media, multimedia databases

2. Discuss the digitization of video signals, virtual reality, image processing etc.,

3. Analyze the different data compression techniques

4. Compare the different optical storage media

5. Distinguish between simple and complex feature, analyze the images and audio

applications

6. Demonstrate the multimedia application design

Part-A

1. Introduction to Multimedia Communications: Introduction, Human communication model,

Evolution and convergence, Technology framework, Standardization framework. 9hours

2. Framework for Multimedia Standardization: Introduction, Standardization activities,

Standards to build a new global information infrastructure, 8hours

3. Standardization processes on multimedia communications, ITU-T mediacom2004 framework

for multimedia, ISO/IEC MPEG-21 multimedia framework, IETF multimedia Internet standards.

9hours

Part-B

3. Application Layer: Introduction, ITU applications, MPEG applications, Mobile servers and

applications, Universal multimedia access. 9hours

4. Middleware Layer: Introduction to middleware for multimedia, Media coding, Media

Streaming, Infrastructure for multimedia content distribution. 8hours

5. Network Layer: Introduction, QoS in Network Multimedia Systems. 9hours

56

TEXT BOOKS:

1. K.R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic: Introduction to Multimedia

Communications – Applications, Middleware, Networking, Wiley India, 2006.

REFERENCE BOOKS:

1. Fred Halsall: Multimedia Communications – Applications, Networks, Protocols, and

Standards, Pearson, 2001.

2. Nalin K Sharad: Multimedia information Networking, PHI, 2002.

3. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Volume 1-Media Coding and

Content Processing, 2nd Edition, Pearson, 2003.

4. Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design, PHI, 2003.

57


Subject Title: ADVANCES IN STORAGE AREA NETWORKS




Course Outcome


1. Differentiate the server centric and storage centric networks , and its advantages and

disadvantages, understand the importance of SAN

2. Identify the different types of Disks , other storages and their operations useful in SAN

3. Understand the various I/O techniques used in SAN , and differentiate between NAS and

SAN

4. Understand the local , network file systems and shared disk file systems of NAS

5. Understand the concepts of storage virtualization , and identify the various levels of

storages for virtualization

Design a network for storage using various SAN devices Part-A

1. Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT

Architecture and its advantages. Case study: Replacing a server with Storage Networks The Data

Storage and Data Access problem; The Battle for size and access. 9hours

2. Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks and

Internal I/O Channels; JBOD, Storage virtualization using RAID and different RAID levels;

Caching: Acceleration of Hard Disk Access; Intelligent disk subsystems, Availability of disk

subsystems. 9hours

3. I/O Techniques, Network Attached Storage, File System and NAS: The Physical I/O path

from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack; Fibre Channel SAN;

IP Storage, The NAS Architecture, The NAS hardware Architecture, The NAS Sotfware

Architecture, Network connectivity, NAS as a storage system, Local File Systems; Network file

Systems and file servers; Shared Disk file systems; Comparison of fibre Channel and NAS.

8hours

Part-B

4. Storage Virtualization: Definition of Storage virtualization; Implementation Considerations;

Storage virtualization on Block or file level; Storage virtualization on various levels of the

storage Network; Symmetric and Asymmetric storage virtualization in the Network. 9hours

58

5. SAN Architecture and Hardware devices: Overview, Creating a Network for storage; SAN

Hardware devices; The fibre channel switch; Host Bus Adaptors; Putting the storage in SAN;

Fabric operation from a Hardware perspective. 9hours

6. Software Components of SAN, Management: The switch’s Operating system; Device

Drivers; Supporting the switch’s components; Configuration options for SANs, Planning

Business Continuity; Managing availability; Managing Serviceability; Capacity planning;

Security considerations. 8hours

Text Book:

1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India,

2007.

Reference Books:

1. Marc Farley: Storage Networking Fundamentals – An Introduction to Storage Devices,

Subsystems, Applications, Management, and File Systems, Cisco Press, 2005.

2. Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-Hill, 2003.

3. Richard Barker and Paul Massiglia: “Storage Area Network Essentials A Complete Guide to

understanding and Implementing SANs”, Wiley India, 2006

59


Subject Title: WIRELESS SENSOR NETWORKS


Pre-requisite: Wireless Communication and Networks


Course outcomes:

1. Be familiar with architectures

2. Analyze the functions and performance of wireless sensor networks systems

3. Describe the various platforms.

4. Describe and analyze the specific requirements for applications in wireless sensor

networks regarding energy supply, memory and processing and transmission capacity

5. Describing the WSNs Protocols

6. Exploring the Tiny GALS

Part-A

1. Introduction: Unique Constraints and Challenges, Advantages of Sensor Networks, Energy

advantage, Detection advantage, Sensor Network Applications, Habitat monitoring, Wildlife

conservation through autonomous, non-intrusive sensing, Tracking chemical plumes, Ad hoc,

just-in-time deployment mitigating disasters, Smart transportation: networked sensors making

roads safer and less congested, Collaborative Processing. 9hours

2. Key Definitions and The Problem: Key Definitions of Sensor Networks, Canonical Problem:

Localization and Tracking, Tracking Scenario, Problem Formulation, Sensing model,

Collaborative localization, Bayesian state estimation, Distributed Representation and Inference

of States, Impact of choice of representation, Design desiderata in distributed tracking, Tracking

Multiple Objects, State space decomposition, Data association, Sensor Models, Performance

Comparison and Metrics. 9hours

3. Networking and Protocols: Networking Sensors, Key Assumptions, Medium Access

Control, The SMAC Protocol, IEEE 802.15.4 Standard and ZigBee, General Issues, Geographic,

Energy-Aware Routing, Unicast Geographic Routing, Routing on a Curve, Energy-Minimizing

Broadcast, Energy-Aware Routing to a Region, Attribute-Based Routing, Directed Diffusion,

Rumor Routing, Geographic Hash Tables. Infrastructure Establishment, Topology Control,

Clustering, Time Synchronization, Clocks and Communication Delays, Interval Methods,

Broadcasts, Localization and Localization Services, Ranging Techniques, Range-Based

60

Localization Algorithms, Other Localization Algorithms, Location Services. Sensor Tasking and

Control, Task-Driven Sensing, Roles of Sensor Nodes and Utilities, Information- Based Sensor

Tasking, Sensor selection, IDSQ: Information-driven sensor querying, Cluster leader based

protocol, Sensor tasking in tracking relations, Joint Routing and Information Aggregation,

Moving center of aggregation, Multi-step information-directed routing, Sensor group

management, Case study: Sensing global phenomena. 8hours

Part-B

4. Databases: Sensor Network Databases, Sensor Database Challenges, Querying The Physical

Environment, Query Interfaces, Cougar sensor database and abstract data types, Probabilistic

queries, High-level Database Organization, In- Network Aggregation, Query propagation and

aggregation, Tiny DB query processing, Query processing scheduling and optimization, Data-

Centric Storage, Data Indices and Range Queries, One-dimensional indices, Multidimensional

indices for orthogonal range searching, Non-orthogonal range searching, Distributed

Hierarchical Aggregation, Multi-resolution, Partitioning, Fractional cascading, Locality

preserving hashing, Temporal Data, Data aging, Indexing motion data. 9hours

5. Platforms and Tools: Sensor Network Platforms and Tools, Sensor Network Hardware,

Berkeley motes, Sensor Network Programming Challenges, Node-Level Software Platforms,

Operating system: Tiny OS, Imperative language: nesC, Dataflow style language: 9hours

6. Tiny GALS, Node-Level Simulators, ns-2 and its sensor network extensions, TOSSIM,

Programming Beyond Individual Nodes: State-centric programming, Collaboration groups,

PIECES: A state-centric design framework, Multi-target tracking problem revisited. Applications

and Future Directions. 8hours

TEXT BOOKS:

1. Feng Zhao, Leonidas Guibas: Wireless Sensor Networks – An Information Processing

Approach, Elsevier, 2004.

61


Subject Title: ADVANCES IN DIGITAL IMAGE PROCESSING


Pre-requisite: Not Applicable


Course outcomes:

This course is designed to

1. Analyze and apply principles and techniques of digital image processing in applications

related to digital imaging system design and analysis.

2. Describe the basics of image processing.

3. Explain the basics of image manipulation

4. Analyze and implement image processing algorithms

5. Explain the basics of video compression

6. Gain hands-on experience in using software tools for processing digital images.

Part-A

1. Introduction: Origins of Digital Image Processing, examples, Fundamental Steps in Digital

Image Processing, Components of an Image Processing System, Image analysis and computer

vision, spatial feature extraction, transform features, Edge detection, gradient operators, compass

operators, stochastic gradients, line and spot detection. 9hours

2. Digital Image Fundamentals, Image Enhancement in the Spatial Domain: Elements of

Visual Perception, A Simple Image Formation Model, Basic Concepts in Sampling and

Quantization, Representing Digital Images, Zooming and Shrinking Digital Images, Some Basic

Relationships Between Pixels, Linear and Nonlinear Operations, Some Basic Gray Level

Transformations, Histogram Processing, Enhancement Using Arithmetic/Logic Operations,

Basics of Spatial Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters, Combining

Spatial Enhancement Methods. 9hours

3. Image Enhancement in the Frequency Domain, Image Restoration: Background, Image

Enhancement in the Frequency Domain, Introduction to the Fourier Transform and the

Frequency, Domain, Smoothing Frequency-Domain Filters, Sharpening Frequency Domain

Filters, Homo-morphic Filtering, A Model of the Image degradation/Restoration process, Noise

Models, Restoration in the Presence of Noise Only–Spatial Filtering, Periodic Noise Reduction

by Frequency Domain Filtering, Linear, Position-Invariant Degradations , Estimating the

Degradation Function, Inverse Filtering ,Minimum Mean Square Error (Wiener) Filtering.

62

8hours

Part-B

4. Color Fundamentals, Image Transformation: Color Models, Pseudo color Image

Processing, Basics of Full-Color Image Processing, Color Transformations, Smoothing and

Sharpening, Color Segmentation, Noise in Color Images, Color Image Compression, Discrete

Cosine Transforms, Walsh Hadmard Transforms, Wavelet Transforms and Multiprocessing,

Background, Multiresolution Expansions, Wavelet Transforms in one Dimension, Wavelet

Transforms in Two Dimensions, Wavelet Packets, an overview of Second Generation Wavelet

Transforms. 9hours

5. Image and Video Compression: Fundamentals, Image Compression Models, Lossless

compression Methods: Huffman coding, run length coding, LZ coding, Arithmetic coding, Lossy

Compression: Gray level Run length coding, Block truncation coding, vector quantization,

Differential predictive coding, Transform coding , Hybrid coding, Video Compression

Techniques – Motion compensation, Search for motion vectors, H.261, H.263, MPEG I, MPEG

2, MPEG 4, MPEG 7 . 8hours

6. Morphological Image Processing, Image Segmentation and Object Recognition:

Preliminaries, Dilation and Erosion, Opening and Closing, The Hit-or-Miss Transformation,

Some Basic Morphological Algorithms, Detection of Discontinuities, Edge Linking and

Boundary Detection, Thresholding, Region-Based Segmentation, Patterns and Pattern Classes,

Recognition Based on Decision-Theoretic Methods, Structural Methods. 9hours

TEXT BOOKS

1. Rafel C Gonzalez and Richard E. Woods: Digital Image Processing, PHI 2nd Edition 2005

2. Scott.E.Umbaugh: Computer Vision and Image Processing, Prentice Hall, 1997

REFERENCES:

1. A. K. Jain: Fundamentals of Digital Image Processing, Pearson, 2004.

2. Z. Li and M.S. Drew: Fundamentals of Multimedia, Pearson, 2004.

3. S.Jayaraman, S.Esakkirajan, T.Veerakumar: Digital Image Procesing, TataMcGraw Hill,

2004.

63


Subject Title: TOPICS IN ANALYSIS OF COMPUTER NETWORKS


Pre-requisite: Computer Networks


Course outcomes:

1. Ability to apply knowledge of mathematics, probability, and statistics to model and

analyze some networking protocols

2. Ability to design, implement, and analyze simple computer network

3. Ability to identify, formulate, and solve network engineering problems, Knowledge of

contemporary issues in computer networks.

4. Ability to use techniques, skills, and modern networking tools.

5. Explain the basics adaptive band width

6. Describing the concepts of multiplexing

Part-A

1. Introduction: Two examples of analysis: Efficient transport of packet voice calls, Achievable

throughput in an input-queuing packet switch; the importance of quantitative modeling in the

Engineering of Telecommunication Networks. 9hours

2. Multiplexing: Network performance and source characterization; Stream sessions in a packet

network: Delay guarantees; Elastic transfers in a packet network; Packet multiplexing over

Wireless networks. 9hours

3. Stream Sessions: Deterministic Network Analysis: Events and processes in packet

multiplexer models: Universal concepts; Deterministic traffic models and Network Calculus;

Scheduling; Application to a packet voice example; Connection setup: The RSVP approach;

Scheduling (continued). 8hours

Part-B

4.Stream Sessions: Stochastic Analysis: Deterministic analysis can yield loose bounds;

Stochastic traffic models; Additional notation; Performance measures; Little’s theorem,

Brumelle’s theorem, and applications; 9hours

5.Multiplexer analysis with stationary and ergodic traffic; The effective bandwidth

approach for admission control; Application to the packet voice example; Stochastic

64

analysis with shaped traffic; Multihop networks; Long-Range-Dependent traffic.

9hours

6.Adaptive Bandwidth Sharing for Elastic Traffic: Elastic transfers in a Network; Network

parameters and performance objectives; sharing a single link; Rate-Based Control; Window-

Based Control: General Principles; TCP: The Internet’s Adaptive Window Protocol; Bandwidth

sharing in a Network. 8hours

TEXT BOOKS:

1. Anurag Kumar, D. Manjunath, Joy Kuri: Communication Networking An Analytical

Approach, Elsevier, 2004.

REFERENCE BOOKS:

1. M. Schwartz: Broadband Integrated Networks, Prentice Hall PTR, 1996.

2. J. Walrand, P. Varaiya: High Performance Communication Networks, 2nd Edition, Morgan

Kaufmann, 1999.

1



of

1st – 4th Semester M.Tech (Computer Network Engineering)




2



Vision:




Mission:


computer networks.


PEO1: Have a solid foundation for engaging in lifelong learning and professional development

in the computer networking field.

PEO2: Will attain productive and challenging careers in their workplace.

PEO3: Are proficient in applying networking theory and practice to problems encountered in

their workplace.

PEO4: Will exhibit professionalism and behave in an ethical manner with regard to workplace

and societal issues.

PEO5: Will function effectively in the computer networking field and associated hardware /

software systems.

3

Program Outcomes

PO1: Ability to apply knowledge on applied mathematics and computer engineering concepts.

PO2: Ability to understand, identify, formulate and solve network engineering problems.

PO3: Able to demonstrate with excellent programming, analytical, logical and problem solving

skills.

PO4: Ability to design, develop, test and debug the software.

PO5: Ability to deploy, analyze, troubleshoot, maintain, manage and secure the computer

network.

PO6: Able to communicate effectively in both verbal and written forms.

PO7: Ability to possess leadership and management skills with best professional ethical

practices and social concern.

GRADUATE ATTRIBUTES:

1. Engineering Knowledge: Real world engineering problems are solved by applying

knowledge of science, mathematics, computer and information engineering.

2. Problem Analysis: Identify, devise and analyze real world engineering problems using

principles of mathematics, sciences and information technologies.

3. Design and Develop solutions: Designing and developing solutions for engineering

problems based on needs while considering the norms of Safety and environmental

conditions.

4. Conduct investigations of complex problems: Use research based knowledge and

research methods including design of experiments, analysis and interpretation of data and

synthesis of the information to provide valid conclusions.

5. Modern Tool usage: Applying appropriate engineering techniques and tools that includes

simulation and modeling to solve complex engineering problems

6. The engineering and society: Apply reasoning informed by the contextual knowledge to

assess societal, health, safety, legal and cultural issues and their consequent

responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional engineering

solutions in societal and environmental contexts and demonstrate the knowledge of and

need for sustainable development.

4

8. Ethics: Apply ethical principles and commit to professional ethics, responsibilities and

norms of engineering practice

9. Individual and Team Work: Participate and performs effectively as an individual and as a

member or leader in diverse teams and in multidisciplinary environment

10. Communication: Communicate effectively with engineering community and the

society through reports and presentations

11. Project Management and finance: Apply the principles of software engineering and

fundamentals of finance to manage a project in multidisciplinary environment. In the

verge of technological changes, there is a need to recognize and learn independently and

also in a team.

12. Lifelong learning: Recognize the need for and have the preparation and ability to engage

in independent and lifelong learning in the broadest context of technological change.

5

I Semester


Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P

1 MCN05 Wireless Adhoc Network ISE 4 0 2 5

2 MCN05 Advances in Computer

Networks

ISE 4 0 2 5

3 MCN05 Information and Network

Security

ISE 4 2 0 5

4 AMT0401 Advanced Mathematics ISE

4 0 0 4

5 MCN05XX Elective – I ISE

4 2 0 5

6 MCN05XX Elective – II ISE 4 2 0 5

Total

Credits 23 6 4 29


6

II Semester


Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P

1 MCN0506 Optical networks ISE 4 2 0 5

2 MCN0515 Cloud Computing ISE 4 2 0 5

3 MCN0518 Protocol Engineering ISE 4 2 0 5

4 MCN0401 Network Management ISE 4 0 0 4

5 MCN05XX Elective – III ISE 4 2 0 5

6 MCN05XX Elective – IV ISE 4 2 0 5

Total

Credits 24 6 4 29


7

III Semester


Teaching Hours/

Week Credits

L T P


duration (At the end of the

training, students are required

to submit a report and present

a seminar)

- - - 4


(Students have to initiate the

project-work during III

semester and are required to

submit a report and present a

seminar)

- - - 8

3 MCN0201 Subject Seminar on current

topic - - - 2

Total Credits 14

8

IV Semester

Credits Division of the programme

Core Courses 38

Elective Courses 20


Major Project 28

T O T A L 100


Teaching Hours/

Week Credits

L T P


(Students have to submit the

final project report at the end

of the semester which will be

evaluated followed by a

seminar, presentation and

viva voce examination)

- - - 28

Total Credits 28

9

ELECTIVE COURSES

Sl.No Subject

Code Subject

Teaching Hours/

Week Credits

L T P

1 MCN05 Advanced Algorithms 4 0 2 5

2 MCN05 Multi core Architecture and

programming

4 2 0 5

3 MCN05 Multimedia Communications 4 2 0 5

4 MCN05 Cyber Crime and Digital forensic 4 0 2 5

5 MCN05 Intrusion Detection and Prevention

Systems

4 2 0 5

6 MCN0501 Advanced Digital Communication 4 0 2 5

7 MCN0505 Client server Programming 4 0 2 5




11 MCN0513 Computer Systems performance

Analysis

4 2 0 5


13 MCN0520 Advances in Storage Area

Networks

4 2 0 5


15 MCN05 Cyber Security 4 2 0 5

10

WIRELESS Ad-HOC NETWORKS

SubCode: MCN05

Designation: Core


COURSE OUTCOMES

Students will be able to

1. Apply knowledge of wireless sensor networks to various application areas.

2. Design, implement and maintain wireless sensor networks.

3. Formulate and solve problems creatively.

4. Practical knowledge acquired by hands-on session.

5. Knowledge of energy management

6. Explain the security protocols of wireless systems

UNIT-1 Ad hoc Wireless Networks: Introduction, Issues in Ad hoc Wireless Networks, Ad hoc

Wireless Internet; MAC Protocols for Ad hoc Wireless Networks: Introduction, Issues in

Designing a MAC Protocol, Design Goals of MAC Protocols, Classification of MAC protocols,

Contention-Based Protocols, Contention-Based Protocols with Reservation Mechanisms,

Contention-Based Protocols with Scheduling Mechanisms,

Self Learning Component(SLC): MAC Protocols that Use Directional Antennas

(Chapter 5: 5.1-5.3, Chapter 6: 6.1-6.8) 10 Hours

UNIT-2 Routing Protocols for Ad Hoc Wireless Networks:Introduction, Issues in Designing a

Routing Protocol for Ad hoc Wireless Networks; Classification of Routing Protocols; Table

Driven Routing Protocols; On-Demand Routing Protocols, Hybrid Routing Protocols,

Hierarchical Routing Protocols

SLC:Power-Aware Routing Protocols

(Chapter 7: 7.1-7.6, 7.8, 7.9) 10 Hours

UNIT-3 Multicast Routing in Ad hoc Wireless Networks: Introduction, Issues in Designing a

Multicast Routing Protocol, Operation of Multicast Routing Protocols, An Architecture

Reference Model for Multicast Routing Protocols, Classifications of Multicast Routing

Protocols, Tree-Based Multicast Routing Protocols.

SLC:Mesh-Based Multicast Routing Protocols.

(Chapter 8: 8.1-8.7) 9 Hours

11

UNIT-4 Transport Layer and Security Protocols for Ad hoc Networks: Introduction, Issues

in Designing a Transport Layer Protocol; Design Goals of a Transport Layer Protocol;

Classification of Transport Layer Solutions; TCP over Transport Layer Solutions; Other

Transport Layer Protocols for Ad hoc Networks; Security in Ad hoc Wireless Networks, Issues

and Challenges in Security Provisioning, Network Security Attacks, Key Management

SLC: Secure Touting Ad hoc Wireless Networks.

(Chapter 9: 9.1-9.6, 9.7-9.12) 9 Hours

UNIT-5 Quality of Service and Energy Management in Ad hoc Wireless Networks

Introduction, Issues and Challenges in Providing QoS in Ad hoc Wireless Networks,

Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions;

SLC: Relevant Case study

7Hours

UNIT-6 Energy Management in Ad hoc Wireless Networks: Introduction, Need for Energy

Management in Ad hoc Wireless Networks, Classification of Energy Management Schemes,

Battery Management Schemes, Transmission Management Schemes,

SLC: System Power Management Schemes.

(Chapter 10: 10.1-10.5, Chapter 11: 11.1-11.6) 7Hours

LABORATORY WORK

Note: Standard Network Parameters and supporting protocols may be assumed for

simulation. Any suitable network simulator may be used. (Preferably NS2 or NS3

Simulator)

1. Develop unicast routing protocols using any suitable Network Simulator for (Mobile Ad hoc

Networks) MANET to find the best route using the any one of routing protocols from each

category from table-driven (e.g., link state or DSDV) on demand (e.g., DSR, AODV, TORA),

hybrid (e.g., ZRP, contact-based architectures) and hierarchical (e.g., cluster based.) The

efficient path/route should be established for source and destination data transmission using

routing protocols. Understand the advantages and disadvantages of each routing protocol types

by observing the performance metrics of the routing protocol. In that way the best

application/environment suitable routing protocol can be identified in each category.

2: Develop multicast routing protocols using any suitable Network Simulator for MANET in

which session nodes are connecting through either tree(MAODV, MCEDAR) or mesh (ODMRP,

12

CAMP, FGMP) structure. Analyze the performance metrics of multicast routing protocols with

unicast routing protocols.

3. Develop MAC Protocol using any suitable Network Simulator for MANETs to send the

packet without any contention through wireless link using the following MAC protocols;

(CSMA/CA (802.11), MACA, MACAW, PAMAS, SMAC). Analyze its performance with

increasing node density and mobility.

4. Develop and Analyze the performance of TCP connection when it is used for wireless

networks. You will find performance of TCP decreases dramatically when a TCP connection

traverses a wireless link on which packets may be lost due to wireless transmission errors. Make

use of Active Queue Management Technique to control congestion on Wireless Networks.

Evaluate the performance of FIFO, RED and WFQ over wireless networks using suitable

Network Simulator.

5. Simulate MANET environment using suitable Network Simulator and test with various

mobility model such as Random way point, group mobility, highway model, Manhattan model,

hybrid models) (Spatial correlation, temporal correlation, relative speed, link durations). Analyze

throughput, PDR and delay with respect to different mobility models.

TEXT BOOKS:

1. C. Siva Ram Murthy & B. S. Manoj: Ad hoc Wireless Networks, 2nd Edition, Pearson

Education, 2011

REFERENCES:

1. Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2007.

2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic

Publishers, 2004.

13

ADVANCES IN COMPUTER NETWORKS

SubCode: MCN05

Designation: Core


COURSE OUTCOMES

1. To become familiar with the basics of Computer Networks.

2. To learn Network architectures.

3. To learn Concepts of fundamental protocols.

4. To gain the knowledge of internetworking concepts.

5. To understand the knowledge of internetworking concepts in various applications.

6. To acquire knowledge of implementation concepts in congestion control and error

detections.

UNIT-1 Foundation

Building a Network, Requirements, Perspectives, Scalable Connectivity, Cost-Effective

Resource sharing, Support for Common Services, Manageability, Protocol layering,

Performance, Bandwidth and Latency, Delay X Bandwidth Product, Perspectives on Connecting,

Classes of Links, Reliable Transmission, Stop-and-Wait , Sliding Window

SLC: Concurrent Logical Channels.

T1:Ch 1.1, 1.2, 1.5.1, 1.5.2., 2.1, 2.5 T2:Ch 4 9Hours

UNIT 2: Internetworking- I

Switching and Bridging, Datagrams, Virtual Circuit Switching, Source Routing, Bridges and

LAN Switches, Basic Internetworking (IP), What is an Internetwork ?, Service Model, Global

Addresses, Datagram Forwarding in IP, subnetting and classless addressing, Address

Translation(ARP), Host Configuration(DHCP), Error Reporting(ICMP)

SLC: Virtual Networks and Tunnels.

T1: Chap 3.1, 3.2. 9Hours

UNIT-3 Internetworking- II

Network as a Graph, Distance Vector(RIP), Link State(OSPF), Metrics, The Global Internet,

Routing Areas, Routing among Autonomous systems(BGP), IP Version 6(IPv6), Mobility

SLC: Mobile IP

T1: Chap3.3, 4.1.1,4.1.3 T2:Ch 13.1 to 13.18 , Ch 18. 10 Hours

UNIT-4 End-to-End Protocols

14

Simple Demultiplexer (UDP), Reliable Byte Stream(TCP), End-to-End Issues, Segment Format,

Connecting Establishment and Termination, Sliding Window Revisited, Triggering

Transmission, Adaptive Retransmission, Record Boundaries SLC: TCP Extensions

UNIT-5 Queuing Disciplines, FIFO, Fair Queuing, TCP Congestion Control, Additive Increase/

Multiplicative Decrease, Slow Start, Fast Retransmit SLC:Fast Recovery.

T1: Chap 5.1, 5.2.1 to 5.2.8, 6.2, 6.3 7Hours

UNIT-6 Congestion Control and Resource Allocation

Congestion-Avoidance Mechanisms, DEC bit, Random Early Detection (RED), Source-Based

Congestion Avoidance. The Domain Name System(DNS),Electronic

Mail(SMTP,POP,IMAP,MIME),World Wide Web(HTTP) SLC:Network Management(SNMP) .

T1: Chap 6.4 T2: Ch 23.1 to 23.16, Ch 24, Ch 25, Ch 27.1 to 27.8 7Hours

LABORATORY WORK

PART A: Implement the following using C/C++:

1. Write a program to transfer the contents of a requested file from server to the client using

TCP/IP Sockets (using TCP/IP Socket programming).

2. Write a program to archive Traffic management at Flow level by implementing Closed Loop

Control technique. (Leaky Bucket Algorithm)

3. Write a program to implement dynamic routing strategy in finding optimal path for data

transmission. (Bellman ford algorithm).

4. Write a program to implement Link State Routing (Dijkstra Algorithm).

5. Write a program for implementing the error detection technique while data transfer in

unreliable network code using CRC (16-bits) Technique.

6. Write a program for providing security for transfer of data in the network. (RSA Algorithm)

7. Write a program for encrypting 64 bit playing text using DES algorithm.

PART B: Simulation Programs using OPNET /NS2 or any other equivalent software

1. Simulate a 3 node point to point network with duplex links between them. Set the Queue size

and vary the bandwidth and find the number of packets dropped.

2. Simulate a four-node point-to-point network, and connect the links as follows: n0->n2, n1->n2

and n2->n3. Apply TCP agent changing the parameters and determine the number of packets

sent/received by TCP/UDP

3. Simulate the different types of internet traffic such as FTP and TELNET over network and

analyze the throughput.

15

Text books:

1. T1: Larry Peterson and Bruce S Davis “Computer Networks :A System Approach”

5th Edition , Elsevier -2014

2. T2: Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols and

Architecture” 6th Edition, PHI - 2014

References:

1. Uyless Black “Computer Networks, Protocols , Standards and Interfaces” 2nd Edition -

PHI

2. Behrouz A Forouzan “TCP/IP Protocol Suite” 4th Edition – Tata McGraw-Hill.

16

INFORMATION and NETWORK SECURITY

Subject Code: MCN05

Designation: Core


Course Outcomes:

1. To understand the fundamentals of Cryptography

2. To acquire knowledge on standard algorithms used to provide confidentiality, integrity

and authenticity.

3. To understand the various key distribution and management schemes.

4. To understand how to deploy encryption techniques to secure data in transit across data

networks

5. To design security applications in the field of Information technology.

6. Learn Electronic mail security.

UNIT -1 Classical Encryption Techniques

Symmetric Cipher Model, Cryptography, Cryptanalysis and Brute-Force Attack, Substitution

Techniques, Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic

Cipher, One Time Pad. Block Ciphers and the data encryption standard: Traditional block

Cipher structure, stream Ciphers and block Ciphers, Motivation for the feistel Cipher structure,

SLC: the feistel Cipher. 7 Hours

UNIT -2 The data encryption standard, DES encryption , DES decryption , A DES example,

results,the avalanche effect, the strength of DES, the use of 56-Bit Keys, the nature of the DES

algorithm,timing attacks, Block cipher design principles, number of rounds, design of function F,

SLC: key schedule algorithm.

07 Hours

UNIT -3 Public-Key Cryptography and RSA: Principles of public-key cryptosystems. Public-

key cryptosystems. Applications for public-key cryptosystems, requirements for public-key

cryptosystems. public-key cryptanalysis. The RSA algorithm, desription of the algorithm,

computational aspects, the security of RSA. Other Public-Key Cryptosystems: Diffie-hellman

key exchange, The algorithm, key exchange protocols,man in the middle attack, Elgamal

Cryptographic systems, Elliptic curve arithmetic, abelian groups,elliptic curves over real

numbers, elliptic curves over Zp, elliptic curves overGF(2m), Elliptic curve cryptography,

Analog of Diffie-hellman key exchange, Elliptic curve encryption/ decryption, security of

Elliptic curve cryptography, SLC:Pseudorandom number generation based on an asymmetric

cipher, PRNG based on RSA.

9 Hours

UNIT -4 Key Management and Distribution: Symmetric key distribution using Symmetric

encryption, A key distribution scenario, Hierarchical key control, session key lifetime, a

17

transparent key control scheme, Decentralized key control, controlling key usage, Symmetric key

distribution using asymmetric encryption, simple secret key distribution, secret key distribution

with confidentiality and authentication, A hybrid scheme, distribution of public keys, public

announcement of public keys, publicly available directory, public key authority, public keys

certificates, X-509 certificates. Certificates, X-509 version 3, public key infrastructure .User

Authentication: Remote user Authentication principles, Mutual Authentication, one way

Authentication, remote user Authentication using Symmetric encryption, Mutual Authentication,

one way Authentication, Kerberos, Motivation , Kerberos version 4, Kerberos version 5, Remote

user Authentication using Asymmetric encryption, Mutual Authentication, one way

Authentication, SLC: federated identity management, identity management, identity federation,

personal identity verification.

9 Hours

UNIT -5 Wireless network security: Wireless security, Wireless network threats, Wireless

network measures, mobile device security, security threats, mobile device security strategy,

IEEE 802.11 Wireless LAN overview, the Wi-Fi alliance, IEEE 802 protocol architechture.

Security, IEEE 802.11i services, IEEE 802.11i phases of operation, discovery phase,

Authentication phase, key management phase, protected data transfer phase, the IEEE 802.11i

pseudorandom function, ..

Web Security Considerations: Web Security Threats, Web Traffic Security Approaches.

Secure Sockets Layer :SSL Architecture, SSL Record Protocol, Change Cipher Spec Protocol,

Alert Protocol, andshake Protocol, Cryptographic Computations. Transport Layer Security:

Version Number, Message Authentication Code, Pseudorandom Functions, Alert Codes, Cipher

Suites, Client Certificate Types, Certificate Verify And Finished Messages, Cryptographic

Computations, Padding. HTTPS Connection Initiation, Connection Closure. Secure Shell (SSH)

Transport Layer Protocol SLC:User Authentication Protocol, Connection Protocol.

10 Hours

UNIT -6 Electronic Mail Security: Pretty good privacy, notation, operational; description,

S/MIME, RFC5322, Multipurpose internet mail extensions, S/MIME functionality, S/MIME

messages, S/MIME certificate processing, enhanced security services, Domain keys identified

mail, internet mail architechture, E-Mail threats, DKIM strategy, DKIM functional flow. IP

Security: IP Security overview, applications of IPsec, benefits of IPsec, Routing applications,

IPsec documents, IPsec services, transport and tunnel modes, IP Security policy, Security

associations, Security associations database, Security policy database, IP traffic processing,

Encapsulating Security payload, ESP format, encryption and authentication algorithms, Padding,

Anti replay service, transport and tunnel modes, combining security associations, authentication

plus confidentiality, basic combinations of security associations, internet key exchange, key

determinations protocol, header and payload formats SLC:cryptographic suits.

10 Hours

LABORATORY WORK

1. Implement Conventional encryption algorithms.

18

Implement DES, AES which accepts a string and produces a cipher text.

2. Implement Public key cryptography algorithms.

Implement RSA algorithm which accepts a text file and produces a cipher text file.

3. Implement secure hash algorithms for Data Integrity.

Implement MD5 and SHA-1 algorithm, which accepts a string input, and produce a fixed

size number - 128 bits for MD5; 160 bits for SHA-1, this number is a hash of the input.

Show that a small change in the input results in a substantial change in the output.

4. Setup a security channel by using Diffie-Hellman key exchange between client and

server.

5. Using any simulation tool: demonstrate packet filtering firewalls, create the ACL, create

VLAN [subnetting].

6. Setup a port scanner and identify the intrusion

Text Books:

1. William Stallings: Cryptography and Network Security, Pearson 6th edition.

References

1. V k Pachghare: Cryptography and Information Security.

19



Designation: CORE


Course outcome


1. Construct the matrix , digraphs of relations and prove some results on different types

2. Identify different types of functions ,find composition and inverse of a function and

3. Apply the concepts of graph theory to solve some application problems.

4. Solve problems associated with basic probability, Baye’s rule , discrete &. Evaluate

estimators, construct confidence intervals, and perform hypothesis tests and

5. Solve problems of Joint Distribution , Markov chain using transition probability of relation

and also obtain equivalence classes.

6. solve problems using pigeon-hole principle.continuous probability distributions. Obtain

regression lines. Mtrix and also the problems in queuing theory.

Unit-I : Relations

Binary relations, Matrix and Digraph representation of a relation, Operations on binary relations,

(SLE:Composition of relations), Properties of relations, Equivalence relations.

Unit-II : Functions

Function, Types of functions, Composition of functions, Invertible functions, Recursive

function, (SLE:Hash function), The Pigeonhole-principle.

Unit-III : Graph Theory

Graphs and Multigraphs, Subgraphs, Isomorphic and Homomorphic graphs, Paths, Cycles and

Circuits in a graph. Connected graphs. Euler’s and Hamiltonian graphs. The Konigsberg Bridge

problem.Trees, Kruskal’s algorithm(SLE: Prim’s algorithm), Cut sets and cut vertices, Network

flow problems.

20

Unit-IV : Probability

(SLE: Basic probability upto Baye’s Theorem ) Random variables – Discrete and continuous

random variables, Binomial, Poisson’s, Exponential and Normal Distributions.

Unit-V : Statistical Inference

(SLE: Basic concept of statistics viz mean and standard deviation) Random sampling, Sampling

distributions, Parameter estimation, Testing of hypothesis, Correlation and regression

Unit-VI : Joint Distribution and Markov Chains

Concept of joint probability: Joint probability distribution, (discrete) Independent random

variables, Expectation, Covariance, Correlation Coefficient.(SLE: Continuous joint probability

distributions)

Probability vectors, Stochastic matrices, Regular stochastic matrices, Markov chains, Concept of

a queue, the M/G/I and M/M/I queuing systems, analysis.

1. Discrete Mathematics and its Applications – Kenneth.H.Rosen V edition

2. Elements of Discrete Mathematics – C.L. Liu, D.P. Mohapatra.

3. Discrete and Combinatorial Mathematics – Ralph P. Grimaldi.

4. Probability and Statistics – Schaum Series (All latest editions)

5. Engineering Mathematics – T. Veerarajan, edition 2, Tata McGraw-Hill Publications.

21



Designation: CORE


Course Outcomes:

1. Discuss the different generations of digital transport networks also compare the WDM

and TDM. Analyze the attributes of OFC

2. Discuss the different digital signaling hierarchies

3. Explain the different characteristics of Optical fiber

4. Diagnose the timing and synchronization in digital networks

5. Analyze the SONET and SDH networks

6. Determine the importance of multiplexing also classify the relationship of WDM to

SONET

UNIT-1. Introduction, Telecommunications Infrastructure, Characteristics of Optical

Fiber: Three generations of Digital Transport Networks; A brief introduction to WDM and

TDM; The Optical Marketplace; Wireless Optical Systems; Key Optical Nodes; Other Key

Terms; Evolution of Optical Systems; Key attributes of Optical Fiber, The Local Connections;

The Backbone Connections; The Digital Multiplexing Hierarchy; The Digital Signaling

Hierarchies; T1 / DS1 and T3 / DS3; The Layered Protocol Model in the Transport Network;

considerations for Interworking Layer1, Layer 2, and Layer 3 Networks, The Basics; The

Wavelength; The Basic Components; Structure of the Fiber; Fiber Types; Key Performance

Properties of Fiber; SLC: Attenuation; Amplifier Spontaneous Emission; Chromatic Dispersion;

Lasers. 8hours

UNIT-2. Timing and Synchronization, SONET and SDH: Timing and Synchronization in

Digital Networks; Effect of a Timing error; The Clocking Signal; Types of Timing in Networks;

Timing Variations; Methods of Clock Exchange; Distribution of Timing Using SONET and

DS1; Timing Downstream Devices; Building Integrated Timing Supply; Synchronization Status

Messages and Timing Loops, The SONET Multiplexing Hierarchy; SONET and SDH

Multiplexing Structure; The SONET / SDH Frame Structure; SONET and SDH Functional

Components; SONET and SDH Problem Detection; Locating and Adjusting Payload with

Pointers; Virtual Tributaries in more detail; Virtual Tributaries in Virtual Containers; The

Overhead Bytes; SLC: SONET and SDH Concatenation. 9hours

22

UNIT-3. Architecture of Optical Transport Networks, WDM, Network Topologies and

Protection Schemes: The Digital Wrapper; Control Planes; In-Band and Out-Band Control

Signaling; Importance of Multiplexing and Multiplexing Hierarchies; Current Digital Transport

Hierarchy; SONET Multiplexing Hierarchy; SDH Multiplexing Hierarchy; Key Indexes and

Other Terms; The New Optical Transport and Digital Transport Hierarchy;

The OTN Layered Model; Encapsulation and Decapsulation Operations; Generic Framing

Procedure, The WDM Operation; DWDM, TDM and WDM Topologies; Relationship of WDM






BLSR; Meshed Topologies; PONs;

SLC: Ethernet in the Wide Area Backbone, Metro Optical Networking. 9hours

UNIT-4 MPLS and Optical Networks, Architecture of IP and MPLS-Based OTNs: Label







Networks; SLC:GMPLS Extensions for G.709; GMPLS with SONET and SDH. 9hours

UNIT-5 The Link Management Protocol, Optical Routers: Keep the Optical Link up and

running; What is managed? Data-bearing Links; Clarification of terms; Basic functions of LMP;

Control Channel Management; Link Property Correlation; Fault Management; Extending LMP







Interworking; MEMS and Optical Switching; SLC:Thermo-Optic Switches. 9hours

UNIT-6 ASON Operation at the UNI and NNI, ATM versus IP in Optical Internets,

Evolving to 3G Architecture: Objectives of ASON; UNI and NNI; Managing the Optical

23

Bandwidth in the ASON; General approach to Optical Bandwidth Management; IETF Optical

Carrier Framework for the UNI; Types of Connections; NNI; UNI and NNI Signaling Services,

IP over ATM over SONET; The OSI and Internet Layered Models; ATM in the SONET / SDH

Payload Envelope; PPP in the SONET Payload Envelope; Encapsulation / Framing Rules; The

PPP Packet; The ATM versus IP; Overhead of IP and ATM; Three encapsulation methods,

Migration of IP Optical Networking; IP and the Optical Backbones; SLC:Placing MPLS into the

Picture; Putting it together.

8hours

TEXT BOOKS:


REFERENCE BOOKS:





24

CLOUD COMPUTING

SubCode: MCN0515

Designation: Core


Course Outcomes 1. To learn how to use Cloud Services.

2. To gain knowledge Virtualization

3. To gain knowledge Task Scheduling algorithms.

4. Apply Map-Reduce concept to applications.

5. To build Private Cloud.

6. To gain knowledge in cloud resource virtualization and scheduling.

UNIT-1 Introduction, Cloud Infrastructure

Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud vulnerabilities,

Cloud computing at Amazon, Cloud computing the Google perspective, Microsoft Windows Azure and

online services, Open-source software platforms for private clouds, Cloud storage diversity and vendor

lock-in, Energy use and ecological impact, Service level agreements, User experience and software

licensing. Exercises SLC: problems.

10 Hours

UNIT-2 Cloud Computing: Application Paradigms.

Challenges of cloud computing, Architectural styles of cloud computing, Workflows: Coordination of

multiple activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce

programming model, A case study: The GrepTheWeb application , Cloud for science and engineering,

High-performance computing on a cloud, SLC:Cloud computing for Biology research, Social computing,

digital content and cloud computing.

9 Hours

UNIT-3 Cloud Resource Virtualization.

Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines, Performance and

Security Isolation, Full virtualization and paravirtualization, Hardware support for virtualization, Case

Study:Xen a VMM based paravirtualization, Optimization of network virtualization, vBlades,

Performance comparison of virtual machines, SLC:The dark side of virtualization, Exercises and

problems.

10 Hours

UNIT-4 Cloud Resource Management and Scheduling.

Policies and mechanisms for resource management, Application of control theory to task scheduling on a

cloud, Stability of a two-level resource allocation architecture, Feedback control based on dynamic

thresholds, Coordination of specialized autonomic performance managers, A utility-based model for

cloud-based Web services, Resourcing bundling: Combinatorial auctions for cloud resources, Scheduling

algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time, Cloud

25

scheduling subject to deadlines, Scheduling Map Reduce applications subject to deadlines

SLC:Resource management and dynamic scaling, Exercises and problems.

9Hours

UNIT-5 Cloud Security, Cloud Application Development.

Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact assessment,

Trust, Operating system security, Virtual machine Security, Security of virtualization, Security risks

posed by shared images, Security risks posed by a management OS, A trusted virtual machine monitor,

Amazon web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security

rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance and

connect to it SLC:How to use S3 in java, 8 Hours

UNIT-6 Cloud-based simulation of a distributed trust algorithm, A trust management service, A cloud

service for adaptive data streaming, Cloud based optimal FPGA synthesis SLC:Exercises and problems.

6Hours

Text Book:

1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013.

REFERENCES:

1. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and

Paradigms, Willey 2014.

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

Security, CRC Press 2013.

26


SubCode: MCN0518

Designation: Core


Course Outcome


1. Familiar with the concept of protocols and their representation and discuss the phases of









of protocol



1. Introduction, Error Control, Flow Control: Communication model, Communication




Control, Window Protocols, Sequence Numbers, Negative Acknowledgments,

SLC:Congestion Avoidance 9hours

2. Network Reference Model: Layered Architecture, Network Services and Interfaces, Protocol

Functions: Encapsulation, Segmentation, Reassembly, Multiplexing, Addressing, OSI Model

Layer Functions,TCP/IP Protocol Suite,

SLC: Application Protocols. 9hours

3. Protocol Specification: Components of specification, Service specification, Communication

Service Specification Protocol entity specification: Sender, Receiver and Channel specification,

27

Interface specifications, Interactions, Multimedia specifications, Alternating Bit Protocol

Specification,

SLC: RSVP specification. 8hours

4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient









ABP Verification, Liveness Properties

SLC: SDL Based Protocol Validation: ABP Validation 9hours

5. Protocol Conformance and Performance Testing: Conformance Testing Methodology and

Framework, Local and Distributed Conformance Test Architectures, Test Sequence Generation

Methods: T, U, D and W methods, Distributed Architecture by Local Methods, Synchronizable

Test Sequence, Conformance testing with Tree and Tabular Combined Notation (TTCN),

Conformance Testing of RIP, Testing Multimedia Systems, quality of service test

architecture(QOS), Performance Test methods, SDL Based Performance Testing of TCP, OSPF,

Interoperability testing

SLC: Scalability testing protocol synthesis problem 8hours

6. Protocol Synthesis and Implementation: Synthesis methods, Interactive Synthesis



Implementation, Protocol Compilers, Code generation from Estelle, LOTOS

SLC: SDL and CVOPS.

9hours

28

TEXT BOOKS:


2004.

REFERENCE BOOKS:


29



Designation: CORE


Course Outcomes:



data types etc.,




M2 interface


UNIT-1 Introduction: Analogy of Telephone Network Management, Data and

Telecommunication Network Distributed computing Environments, TCP/IP-Based

Networks: The Internet and Intranets, Communications Protocols and Standards-

Communication Architectures, Protocol Layers and Services; Case Histories of

Networking and Management – The Importance of topology , Filtering Does Not Reduce

Load on Node, Some Common Network Problems; Challenges of Information

Technology Managers, Network Management: Goals, Organization, and Functions- Goal

of Network Management, Network Provisioning, Network Operations and the NOC,

Network Installation and Maintenance; Network and System Management, Network

Management System platform

SLC: Current Status and Future of Network Management. 9hours

UNIT-2 Basic Foundations: Standards, Models, and Language: Network

Management Standards, Network Management Model, Organization Model, Information

Model – Management Information Trees, Managed Object Perspectives, Communication

Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types,

Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros

SLC:Functional Model 8hours

UNIT-3 SNMPv1 Network Management: Managed Network: The History of SNMP

Management, Internet Organizations and standards, Internet Documents, The SNMP

Model, The Organization Model, System Overview. The Information Model –

Introduction, The Structure of Management Information, Managed Objects, Management

30

Information Base. The SNMP Communication Model – The SNMP Architecture,

Administrative Model, SNMP Specifications, SNMP Operations, SNMP MIB Group

SLC: Functional Model 9hours

UNIT-4 SNMP Management – RMON: Remote Monitoring, RMON SMI and MIB,

RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship

Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON

Token Ring Extension Groups, RMON2 – The RMON2 Management Information Base

RLC: RMON2 Conformance Specifications. 8hours

UNIT-5 Broadband Network Management: Broadband Access Networks and

Technologies: Broadband Access Networks, Broadband Access Technology; HFCT

Technology: The Broadband LAN, The Cable Modem, The Cable Modem Termination

System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable.

Reference Architecture; HFC Management – Cable Modem and CMTS Management,

HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric

Digital Subscriber Line Technology – Role of the ADSL Access Network in an Overall

Network, ADSL Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes;

ADSL Management – ADSL Network Management Elements, ADSL Configuration

Management, ADSL Fault Management, ADSL Performance Management, SNMP-

Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, SLC:ADSL

Configuration Profiles. 9hours

UNIT-6 Network Management Applications: Configuration Management- Network

Provisioning, Inventory Management, Network Topology, Fault Management- Fault

Detection, Fault Location and Isolation Techniques, Performance Management –

Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; Event

Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case-Based

Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State

Machine Model, Security Management – Policies and Procedures, Security Breaches and

the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication and

Authorization, Client/Server Authentication Systems, Messages Transfer Security,

Protection of Networks from Virus Attacks, Accounting Management, Report

Management

RLC:Policy- Based Management, Service Level Management.

9hours

31

TEXT BOOKS:

1. Mani Subramanian: Network Management- Principles and Practice, 2nd Pearson

Education, 2010.

REFERENCE BOOKS:J. Richard Burke: Network management Concepts and

Practices: a Hands-On Approach, PHI, 2008.

32

ELECTIVES

33

ADVANCED ALGORITHMS

Subject Code: MCN05

Designation: CORE


COURSE Outcomes

1. To learn the graph search algorithms.

2. To learn the hill climbing and dynamic programming design techniques.

3. To develop recursive backtracking algorithms.

4. To get an awareness of NP completeness and randomized algorithms.

5. To get an awareness of probabilistic and randomize algorithms.

6. To get the awareness of polynomials.

TOPICS

UNIT-1 Review of Analysis Techniques: Growth of Functions: Asymptotic notations;

Standard notations and common functions; Recurrences and Solution of Recurrence equations-

The substitution method, The recurrence – tree method, The master method; Amortized

Analysis: Aggregate method SLC: Accounting and Potential Methods. 9 Hours

UNIT-2 Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in a DAG;

Johnson’s Algorithm for sparse graphs; Flow networks and Ford-Fulkerson method;

SLC: Maximum bipartite matching. 9 Hours

UNIT-3 Polynomials and the FFT: Representation of polynomials; The DFT and FFT;

Efficient implementation of FFT. SLC: Programming implementations 10 Hours

UNIT-4 Number -Theoretic Algorithms: Elementary notions; GCD; Modular Arithmetic;

Solving modular linear equations; The Chinese remainder theorem; SLC: Powers of an element;

RSA cryptosystem; Primality testing; Integer factorization SLC: Problems 10 Hours

UNIT-5 String-Matching Algorithms: Naïve string Matching; Rabin - Karp algorithm; String

matching with finite automata; Knuth-Morris-Pratt algorithm; Boyer – Moore algorithms.

10 Hours

UNIT-6 Probabilistic and Randomized Algorithms: Probabilistic algorithms; Randomizing

deterministic algorithms, Monte Carlo and Las Vegas algorithms;

SLC:Probabilistic numeric algorithms. 10 Hours

34

TEXT BOOKS:

1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, 3rd Edition,

Prentice-Hall of India, 2010.

2. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning, 2002.

REFERENCE BOOKS:

1. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: Fundamentals of Computer Algorithms, 2nd

Edition,

Universities press, 2007

35

MULTI-CORE ARCHITECTURE and PROGRAMMING

Subject Code: MCN05

Designation: CORE


Course Outcomes

1. To understand the recent trends in the field of Computer Architecture and identify

performance related parameters

2. To expose the students to the problems related to multiprocessing

3. To understand the different types of multi core architectures

4. To expose the students to warehouse-scale and embedded architectures

5. Explain the fundamentals of threading

6. Understanding the fundamentals of parallel programming.

UNIT-1 Introduction to Multi-core Architecture: Motivation for Concurrency in software,

Parallel Computing Platforms, Parallel Computing in Microprocessors, Differentiating Multi-

core Architectures from Hyper- Threading Technology, Multi-threading on Single-Core versus

Multi-Core Platforms Understanding Performance, Amdahl’s Law, SLC:Growing Returns:

Gustafson’s Law. 7 Hours

UNIT-2 System Overview of Threading: Defining Threads, System View of Threads,

Threading above the Operating System, Threads inside the OS, Threads inside the Hardware,

What Happens When a Thread Is Created, Application Programming Models and Threading,

Virtual Environment: VMs and Platforms, Runtime Virtualization,SLC:System Virtualization.

7 Hours

UNIT-3 Fundamental Concepts of Parallel Programming: Designing for Threads, Task

Decomposition, Data Decomposition, Data Flow Decomposition, Implications of Different

Decompositions, Challenges You’ll Face, Parallel Programming Patterns, A Motivating

Problem: Error Diffusion, Analysis of the Error Diffusion Algorithm, An Alternate Approach:

Parallel Error Diffusion, SLC:Other Alternatives. 10 Hours

UNIT-4 Threading and Parallel Programming Constructs: Synchronization, Critical

Sections, Deadlock, Synchronization Primitives, Semaphores, Locks, Condition Variables,

Messages, Flow Control- based Concepts, Fence, Barrier, Implementation-dependent Threading

Features. Threading APIs : Threading APls for Microsoft Windows, Win32/MFC Thread

APls, Threading APls for Microsoft. NET Framework, Creating Threads, Managing Threads,

Thread Pools, Thread Synchronization, POSIX Threads, Creating Threads, Managing Threads,

SLC:Thread Synchronization, Signaling, Compilation and Linking. 10 Hours

36

UNIT-5 OpenMP: A Portable Solution for Threading: Challenges in Threading a Loop,

Loop-carried Dependence, Data-race Conditions, Managing Shared and Private Data, Loop

Scheduling and Portioning, Effective Use of Reductions, Minimizing Threading Overhead,

Work-sharing Sections, Performance-oriented Programming, Using Barrier and No wait,

Interleaving Single-thread and Multi-thread Execution, Data Copy-in and Copy-out, Protecting

Updates of Shared Variables, Intel Task queuing Extension to OpenMP, OpenMP Library

Functions, SLC:OpenMP Environment Variables, Compilation, Debugging, performance.

9 Hours

UNIT-6 Solutions to Common Parallel Programming Problems: Too Many Threads, Data

Races, Deadlocks, and Live Locks, Deadlock, Heavily Contended Locks, Priority Inversion,

Solutions for Heavily Contended Locks, Non-blocking Algorithms, ABA Problem, Cache Line

Ping-ponging, Memory Reclamation Problem, Recommendations, Thread-safe Functions and

Libraries, Memory Issues, Bandwidth, Working in the Cache, Memory Contention, Cache-

related Issues, False Sharing, Memory Consistency, Current IA-32 Architecture, Itanium

Architecture, High-level Languages, Avoiding Pipeline Stalls on IA-32 SLC:Data Organization

for High Performance. 9 Hours

Text Book

1. Multicore Programming , Increased Performance through Software Multi-threading by

Shameem Akhter and Jason Roberts , Intel Press , 2006.

37

Subject Title: MULTIMEDIA COMMUNICATIONS

SubCode: MCN05

Designation: Elective



Course Outcomes:

1. To understand the Multimedia Communication Models

2. To study the Multimedia Transport in Wireless Networks

3. To solve the Security issues in multimedia networks

4. To explore real-time multimedia network applications.

5. To explore different network layer based application.

6. To study multimedia standards

UNIT-1 Introduction to Multimedia Communications: Introduction, Human communication

model, Evolution and convergence, Technology framework SLC:Standardization framework.

10 Hours

UNIT-2 Framework for Multimedia Standardization: Introduction, Standardization activities,

Standards to build a new global information infrastructure, Standardization processes on

multimedia communications SLC: ITU-T mediacom2004 7 Hours

UNIT-3 Framework for multimedia, ISO/IEC MPEG-21 multimedia framework SLC: IETF

multimedia Internet standards.

7Hours

UNIT-4 Application Layer: Introduction, ITU applications, MPEG applications, Mobile servers

and applications, SLC:Universal multimedia access.

9 Hours

UNIT-5 Middleware Layer: Introduction to middleware for multimedia, Media coding, Media

Streaming, SLC:Infrastructure for multimedia content distribution. 9 Hours

UNIT-1 Network Layer: Introduction, QoS in Network Multimedia Systems. 10 Hours

SLC: Example Case Study

38

TEXT BOOKS:



REFERENCE BOOKS:







39

INTRUSION DETECTION AND PREVENTION SYSTEMS (4:2:0)

Sub code :MCN05 CIE : 50%Marks

Hrs/week : 04 SEE : 50%Marks

SEE Hrs : 03 Hours Max. Marks : 100

Course Outcome:

On Successful completion of the course, the students will be able to:

1. Demonstrate knowledge of intrusion detection and prevention concepts.

2. Conduct traffic analysis for intrusion detection and prevention.

3. Analyze the internals for intrusion detection and prevention.

4. Write filters and policies for intrusion detection and prevention in networks.

5. Understanding IPS

6. Explain the business issues.

UNIT – 1 9 Hrs

UNDERSTANDING INTRUSION DETECTION:

Intrusion-Detection and Intrusion-Prevention Basics-Why IDSs and IPSs are Important - IDS

and IPS Analysis Schemes- IDSIPS SLC:Pros and Cons

UNIT - 2 8 Hrs

UNAUTHORIZED ACTIVITY I:

General IDS Limitations -Network Protocol Abuses: ARP, IP, UDP, TCP SLC:ICMP.

UNIT - 3 9 Hrs

Tcpdump:

Tcpdump Command Line Options-Tcpdump Output Format-Tcpdump Expressions-Bulk

Capture-How Many Bytes Were Transferred in That Connection?-Tcpdump as Intrusion

Detection? SLC:Tcpslice, Tcpflow, and Tcpjoin

UNIT – 4 7 Hrs

ARCHITECTURE:

IDS and IPS Architecture- Tiered Architectures. SLC:Future IDS

UNIT - 5 10 Hrs

IDS AND IPS INTERNALS:

Information Flow in IDS and IPS-Detection of Exploits-Malicious Code Detection-Output

Routines SLC: Defending IDS/IPS

40

UNIT – 6 9Hrs

POLICY AND PROCEDURES & SECURITY BUSINESS ISSUES:

IDS/IPS Policy- Creating an IDS/IPS Policy- International Cyber Security Related Laws-

Standards-Organizations-Legal Resources on the Web - :The Business Case for Intrusion

Detection and Prevention-IDS Deployment Costs SLC: Managing Intrusion Detection

TEXT BOOK:

“Intrusion detection and Prevention”, Carl Enrolf, Eugene Schultz, Jim Mellander, McGraw

Hill, 2004

REFERENCES:

1. “Network Intrusion Detection and Prevention: Concepts and Techniques”, Ali A.

Ghorbani, Wei Lu, Springer, 2010.

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

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

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

2006.

41


Subject Title: ADVANCED DIGITAL COMMUNICATION



Course Outcomes

1. Describe fundamentals of digital transmission

2. Compare different techniques for error Detection and Correction

3. Identify and describe elements of DCS

4. Analyze and Compare different waveform coding techniques

5. Describe Nyquest Criterion and correlative coding

6. Analyzing zero forcing and LMA algorithm

UNIT-1 Digital Transmission Fundamentals: Digital Representation of Information: Block-

Oriented Information, Stream Information; Why Digital Communications? Comparison of

Analog and Digital Transmission , Basic properties of Digital Transmission Systems; Digital

Representation of Analog Signals: Bandwidth of Analog Signals, Sampling of an Analog Signal,

Digital Transmission of Analog Signals; Characterization of Communication Channels:

Frequency Domain Characterization, Time Domain Characterization; Fundamental Limits in

Digital Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding

; Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations,

Telephone Modem Standards;

SLC: Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal

Constellations,

UNIT-2 Properties of Media and Digital Transmission Systems: Twisted Pair, Coaxial Cable,

Optical Fiber, Radio Transmission, Infrared Light; Error Detection and Correction: Error

Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial Codes,

Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code.

SLC: Error Detecting Capability of a Polynomial Code

UNIT-3 Brief Review of digital communication systems: Elements of Digital communication

systems; Communication channels and their characteristics;

42

SLC: Historical perspective in the development of digital communication

UNIT-4 Wave form Coding Techniques: PCM, Channel. Noise and error probability, DPCM,

DM,.

SLC: coding speech at low bit rates, Applications

UNIT-5 Base band Shaping for data transmission: Discrete PAM signals, Inter-symbol

interference (ISI) Nyquist criterion for distortion-less Base band binary transmission.

SLC: correlative coding.

UNIT-6 Eye-pattern, transmission, correlative coding, Eye-patterns Based and M-ary PAM

system, Adoptive Equalization,

SLC: The zero forcing algorithm, The LMA algorithm

TEXT BOOKS:




REFERENCE BOOKS:


43



Designation: CORE


Course outcome



2. Familiar with socket level programming and with designing and programming client

server systems based on TCP/IP and http protocols to run across a range of computing

platforms.






UNIT-1 The Client Server Model and Software Design, Concurrent Processing in Client-

Server software: Introduction, Motivation, Terminology and Concepts, Introduction,

Concurrency in Networks, Concurrency in Servers, Terminology and Concepts, An example of

Concurrent Process Creation, Executing New Code, Context Switching and Protocol Software

Design, SLC:Concurrency and Asynchronous I/O.

8hours

UNIT-2 Program Interface to Protocols, The Socket Interface: Introduction, Loosely

Specified Protocol Software Interface, Interface Functionality, Conceptual Interface

Specification, System Calls, Two Basic Approaches to Network Communication, The Basic I/O

Functions available in UNIX, Using UNIX I/O with TCP/IP, Introduction, Berkley Sockets,

Specifying a Protocol Interface, The Socket Abstraction, Specifying an End Point Address, A

Generic Address Structure, Major System Calls used with Sockets, Utility Routines for Integer

Conversion, Using Socket Calls in a Program, SLC:Symbolic Constants for Socket Call

Parameters.

9hours

44

UNIT-3 Algorithms and Issues in Client Software Design: Introduction, Learning Algorithms








UDP, Communicating with a Server using UDP, Closing a Socket that uses UDP, SLC:Partial

Close for UDP, A Warning about UDP Unreliability. 9hours

Part-B

UNIT-4 Example Client Software: Introduction, The Importance of Small Examples, Hiding

Details, An Example Procedure Library for Client Programs, Implementation of Connect TCP,





ECHO Service, SLC:A UDP Client for the ECHO Service.

9hours

UNIT-5 Algorithms and Issues in Server Software Design: Introduction, The Conceptual

Server Algorithm, Concurrent Vs Iterative Servers, Connection-Oriented Vs Connectionless

Access, Connection-Oriented Servers, Connectionless Servers, Failure, Reliability and

Statelessness, Optimizing Stateless Servers, Four Basic Types of Servers, Request Processing

Time, Iterative Server Algorithms, An Iterative Connection-Oriented Server Algorithm, Binding

to a Well Known Address using INADDR_ANY, Placing the Socket in Passive Mode,

Accepting Connections and using them. An Iterative Connectionless Server Algorithm, Forming

a Reply Address in a Connectionless Server, Concurrent Server Algorithms, Master and Slave

Processes, A Concurrent Connectionless Server Algorithm,



Problem of Server Deadlock, SLC: Alternative Implementations. 9hours

UNIT-1 Iterative, Connectionless Servers (UDP), Iterative, Connection-Oriented Servers

(TCP), Concurrent, Connection-Oriented Servers (TCP): Introduction, Creating a Passive

Socket, Process Structure, An example TIME Server, Introduction, Allocating a Passive TCP

Socket, A Server for the DAYTIME Service, Process Structure, An Example DAYTIME Server,

Closing Connections, Connection Termination and Server Vulnerability, Introduction,

45

Concurrent ECHO, Iterative Vs Concurrent Implementations, Process Structure, An example

Concurrent ECHO Server, SLC:Cleaning up Errant Processes

8hours

Laboratory Work:










TEXT BOOK:



Pearson, 2001.

46





Course Outcome







6. They will thus be able to analyze system responsiveness, scalability etc. as a function of

workload.

UNIT-1 Introduction, General Principles: When simulation is the appropriate tool and when it

is not appropriate; Advantages and disadvantages of Simulation; Areas of application; Some

recent applications of Simulation; Systems and system environment; Components of a system;

Discrete and continuous systems; Model of a system; Types of Models; Discrete-Event System

Simulation; Steps in a Simulation Study, Concepts in Discrete-Event Simulation,

SLC:List processing. 9hours

UNIT-2 Statistical Models in Simulation, Queuing Models Review of terminology and

concepts; Useful statistical models; discrete distributions; Continuous distributions; Poisson

process; Empirical distributions, Characteristics of queuing systems; Queuing notation; Long-run

measures of performance of queuing systems; Steady-state behavior of M/G/1 queue; SLC:


UNIT-1 Random-Number Generation, Random-Variate Generation: Properties of random

numbers; Generation of pseudo-random numbers; Techniques for generating random numbers;

Tests for Random Numbers Random-Variate Generation: Inverse transform technique;

Acceptance-Rejection technique; SLC:Special properties.

47

9hours

UNIT-4 Input Modeling: Data Collection; Identifying the distribution with data; Parameter


models without data; Multivariate SLC:Time-Series input models. 9hours

UNIT-5 Verification, Calibration, and Validation of Simulation Models: Model building,


models. SLC:Optimization via Simulation 9hours

UNIT-6 Estimation of Absolute Performance, Case Study: Types of simulations with respect

to output analysis; Stochastic nature of output data; Absolute measures of performance and their


simulations, SLC:Simulation of networked computer systems. 8hours

TEXT BOOKS:



REFERENCE BOOKS:




48







1. identify common network security vulnerabilities/attacks





communication.



UNIT-1 Introduction to Information Security: Introduction; what is security? Critical

characteristics of information; NSTISSC security model; Approaches to information security

implementation; The Security System Development Life Cycle; Information Security

Terminology. Planning for Security: Introduction; Information Security Policy, Standards, and

Practices;

SLC:The Information Security Blue Print. 9hours

UNIT-2 Security Technology: Firewalls and VPNs: Introduction, Physical design, Firewalls,



systems; Scanning and Analysis Tools;

SLC:Access Control Devices. 9hours

UNIT-3 Information Security maintenance: Introduction; Security Management Models; The



RFCs;

SLC:Wireless network security. 8hours

49

UNIT-4 Cryptography: Conventional Encryption Principles and Algorithms; Cipher Block

Modes of Operation; Location of encryption devices; Key distribution; Approaches to message



SLC:Directory Authentication Service. 9hours

UNIT-5 Electronic Mail Security: Pretty Good Privacy (PGP), S/MIME.IP Security: IP

Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security

Payload, Combining Security Associations SLC:Key Management. 9hours

UNIT-6 Web Security: Web security requirements, Secure Socket layer (SSL) and Transport

layer Security (TLS), Secure Electronic Transaction (SET). Software: Introduction; Software

flaws; Malware; Software-based attacks; SLC:Digital Rights Management; 8hours

TEXT BOOKS:





REFERENCE BOOKS:


50






Course outcomes



2. Master the general properties of networked communication necessary for distributed


3. Master basic algorithms for failure detection, leader elections, broadcast and multicast,


communication

4. Employ and create common paradigms for easing the task of distributed systems

programming, such as RPC




6. nalyze the distributed algorithms for locking, synchronization and concurrency

scheduling.

UNIT-1 Characterization of Distributed Systems and System Models: Introduction,

Examples of distributed systems, Resource sharing and the Web, Challenges, Architectural

models, SLC:Fundamental models. 9hours

UNIT-2 Networking and Internetworking: Types of Networks, Networks principles

SLC: Internet protocols 9hours

UNIT-3 Interprocess Communication: Introduction, The API for the Internet protocols,

External data representation and marshalling, Client -Server communication, Group

communication,

SLC:Case study: Interprocess communication in UNIX 8hours

Part-B

51

UNIT-4 Distributed Objects and Remote Invocation: Communication between distributed

objects, Remote procedure call, events SLC:notifications 9hours

UNIT-5 Operating System Support and Security: The Operating system layer, protection,

processes and threads, communication and invocation SLC:operating system architecture 9hours

UNIT-6 Transactions and Concurrency Control: Transactions, nested transactions, locks,

optimistic concurrency control, timestamp ordering, comparison of methods for concurrency

control. Distributed Shared Memory: Design and Implementation issues, sequential consistency

SLC:Ivy.

8hours

TEXT BOOKS:



REFERENCE BOOKS:


2007.



Pearson, 2009.

52

COMPUTER SYSTEMS PERFORMANCE ANALYSIS


Designation: CORE


COURSE Outcomes

1. To understand the mathematical foundations needed for performance evaluation of

computer systems

2. To understand the metrics used for performance evaluation

3. To understand the analytical modeling of computer systems

4. To enable the students to develop new queueing analysis for both simple and complex

systems

5. To understand the concept of planning and design in computer system.

6. To understand the experimental analysis

UNIT-1 Introduction: The art of Performance Evaluation; Common Mistakes in Performance

Evaluation, A Systematic Approach to Performance Evaluation, Selecting an Evaluation

Technique, Selecting Performance Metrics, Commonly used Performance Metrics, Utility

Classification of Performance Metrics, SLC:Setting Performance Requirements. 9 Hours

UNIT-2 Workloads, Workload Selection and Characterization: Types of Work loads,

addition instructions, Instruction mixes, Kernels; Synthetic programs, Application benchmarks,

Popular benchmarks. Work load Selection: Services exercised, level of detail;

Representativeness; Timeliness, Other considerations in workload selection. Work load

characterization Techniques: Terminology; Averaging, Specifying dispersion, Single Parameter

Histograms, Multi Parameter Histograms, Principle Component Analysis,

SLC:Markov Models, Clustering. 9 Hours

UNIT-3 Monitors, Program Execution Monitors and Accounting Logs: Monitors:

Terminology and classification; Software and hardware monitors, Software versus hardware

monitors, Firmware and hybrid monitors, Distributed System Monitors, Program Execution

Monitors and Accounting Logs, Program Execution Monitors, Techniques for Improving

Program Performance, Accounting Logs, Analysis and Interpretation of Accounting log data,

SLC:Using accounting logs to answer commonly asked questions. 9Hours

UNIT-4 Capacity Planning and Benchmarking: Steps in capacity planning and management;

Problems in Capacity Planning; Common Mistakes in Benchmarking; Benchmarking Games;

Load Drivers; Remote- Terminal Emulation; Components of an RTE; SLC:Limitations of RTEs.

9 Hours

UNIT-5 Experimental Design and and Analysis: Introduction: Terminology, Common

mistakes in experiments, Types of experimental designs, 2k Factorial Designs, Concepts,

Computation of effects, Sign table method for computing effects; Allocation of variance;

General 2k Factorial Designs, General full factorial designs with k factors: Model, Analysis of a

53

General Design, SLC:Informal Methods. 9Hours

UNIT -6 Queuing Models: Introduction: Queuing Notation; Rules for all Queues; Little’s

Law, Types of Stochastic Process. Analysis of Single Queue: Birth-Death Processes; M/M/1

Queue; M/M/m Queue; M/M/m/B Queue with finite buffers; Results for other M/M/1 Queuing

Systems. Queuing Networks: Open and Closed Queuing Networks; Product form networks,

queuing Network models of Computer Systems. Operational Laws: Utilization Law; Forced

Flow Law; Little’s Law; General Response Time Law; Interactive Response Time Law;

Bottleneck Analysis; Mean Value Analysis and Related Techniques; Analysis of Open Queuing

Networks; Mean Value Analysis; Approximate MVA; Balanced Job Bounds;

Convolution Algorithm, Distribution of Jobs in a System, Convolution Algorithm for Computing

G(N), Computing Performance using G(N), Timesharing Systems, Hierarchical Decomposition

of Large Queuing Networks: Load Dependent Service Centers, Hierarchical DecompositionSLC:

Limitations of Queuing Theory. 7 Hours

Text Book:


Reference Books:

1. Paul J Fortier, Howard E Michel: computer Systems Performance Evaluation and prediction,

Elsevier, 2003.

2. Trivedi K S: Probability and Statistics with Reliability, Queuing and Computer Science


54






Course outcomes:

1. Perform analysis modeling and design modeling for web applications.







UNIT-1 Introduction: Motivation, Categories of web applications, Characteristics of web



development SLC: Outlook. 9hours

UNIT-2 Modeling Web Application: Introduction, Fundamentals, Modeling specifics in web




Components of generic web application architecture, Layered architectures SLC: Data-aspect


UNIT-3 Technology-Aware Web Application Design: Introduction, Web design from an





engineering, Test approaches, Test scheme, Test methods and techniques,

SLC: Test automation, Outlook. 8hours

55

UNIT-4 Operation and Maintenance of Web Applications: Introduction, Challenges

following the launch of a web application, Content management, Usage analysis, Outlook. Web

Project Management: From software project management to web project management,

Challenges in web project management, Managing web teams, Managing the development

process of a web application, Outlook. The Web Application Development Process: Motivation,

Fundamentals, Requirements for a web application development process, Analysis of the rational

unified process, SLC:Analysis of extreme programming, Outlook. 9hours

UNIT-5 Usability of Web Applications: Motivation, What is usability? What characterizes the





results, SLC:Performance optimization methods, Outlook. 9hours

UNIT-6 Security for web Applications: Introduction, Aspects of security, Encryption, digital



Technological concepts, SLC:Specifics of semantic web applications, Tools, Outlook.

8hours

Text Book:


Wiley India, 2007.

Reference Books:


2008.

56






Course Outcome






SAN

4. Understand the local , network file systems and shared disk file systems of NAS

5. Understand the concepts of storage virtualization , and identify the various levels of

storages for virtualization

6. Design a network for storage using various SAN devices

UNIT-1 Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT


Storage and Data Access problem; SLC:The Battle for size and access. 9hours

UNIT-2 Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks

and Internal I/O Channels; JBOD, Storage virtualization using RAID and different RAID levels;

Caching: Acceleration of Hard Disk Access; Intelligent disk subsystems,

SLC:Availability of disk subsystems. 9hours

UNIT-3 I/O Techniques, Network Attached Storage, File System and NAS: The Physical I/O

path from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack; Fibre Channel

SAN; IP Storage, The NAS Architecture, The NAS hardware Architecture, The NAS Sotfware


Systems and file servers; Shared Disk file systems; SLC:Comparison of fibre Channel and NAS.

8hours

57

UNIT-4 Storage Virtualization: Definition of Storage virtualization; Implementation

Considerations; Storage virtualization on Block or file level; Storage virtualization on various

levels of the storage Network;

SLC:Symmetric and Asymmetric storage virtualization in the Network. 9hours

UNIT-5 SAN Architecture and Hardware devices: Overview, Creating a Network for storage;

SAN Hardware devices; The fibre channel switch; Host Bus Adaptors; Putting the storage in

SAN; SLC:Fabric operation from a Hardware perspective.

9hours

UNIT-6 Software Components of SAN, Management: The switch’s Operating system; Device



SLC:Security considerations. 8hours

Text Book:


2007.

Reference Books:






58






Course Outcomes

1. Architect sensor networks for various application setups.

2. Explore the design space and conduct trade-off analysis between performance and

resources.

3. Devise appropriate data dissemination protocols and model links cost.

4. Determine suitable medium access protocols and radio hardware.

5. Prototype sensor networks using commercial components.

6. Provision quality of service, fault-tolerance, security and other dependability

requirements while coping with resource constraints.

UNIT-1 Introduction, Overview and Applications of Wireless Sensor Networks

Introduction, Basic overview of the Technology, Applications of Wireless Sensor Networks:

Introduction, Background, Range of Applications, Examples of Category 2 WSN Applications,

Examples of Category 1 WSN Applications, SLC:Another Taxonomy of WSN Technology

(Chapter 1: 1.1, 1.2, Chapter2: 2.1-2.6) 10 Hours

UNIT-2 Basic Wireless Sensor Technology and Systems:Introduction, Sensor Node

Technology, Sensor Taxonomy, WN Operating Environment, WN Trends, Wireless

Transmission Technology and Systems: Introduction, Radio Technology Primer, SLC:Available

Wireless Technologies

(Chapter3: 3.1-3.5, Chapter 4: 4.1-4.3) 7 Hours

UNIT-3 MAC and Routing Protocols for Wireless Sensor Networks:Introduction,

Background, Fundamentals of MAC Protocols, MAC Protocols for WSNs, Sensor-MAC case

Study, IEEE 802.15.4 SLC:LR-WPANs Standard Case Study. 7 Hours

UNIT-4 Routing Protocols for Wireless Sensor Networks: Introduction, Background, Data

Dissemination and Gathering, Routing Challenges and Design Issues in WSNs, SLC:Routing

Strategies in WSNs.

59

(Chapter 5: 5.1-5.6, Chapter 6: 6.1-6.5)

9 Hours

UNIT-5Transport Control and Middleware for Wireless Sensor Networks

Traditional Transport Control Protocols, Transport Protocol Design Issues, Examples of Existing

Transport Control Protocols, Performance of Transport Control Protocols. Middleware for

Wireless Sensor Networks: Introduction, WSN Middleware Principles, Middleware

Architecture, SLC:Existing Middleware.

(Chapter 7: 7.1-7.4, Chapter 8: 8.1-8.4)

9 Hours

UNIT-6 Network Management and Operating System for Wireless Sensor Networks

Introduction, Network Management Requirements, Traditional Network Management Models,

Network Management Design Issues. Operating Systems for Wireless Sensor Networks:

Introduction, Operating System Design Issues, SLC:Examples of Operating Systems.

(Chapter 9: 9.1-9.5, Chapter 10: 10.1-10.3)

10 Hours

TEXT BOOKS:

1. KAZEM SOHRABY, DANIEL MINOLI, TAIEB ZNATI, “Wireless Sensor Networks:

Technology, Protocols and Applications:, WILEY , Second Edition (Indian) , 2014

REFERENCE BOOKS:

1.Ian F. Akyildiz, Mehmet Can Vuran "Wireless Sensor Networks", Wiley 2010

2. Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks- An Information Processing

Approach", Elsevier, 2007.

60

CYBER SECURITY (4:2:0:0)

Sub code : CIE : 50% Marks

Hrs/week : 04 SEE : 50% Marks

SEE : 03Hrs Max Marks : 100

Course outcomes

On Successful completion of the course, the students will be able to

1. Explain the classification of cybercrimes

2. Identify the steps of attacks

3. Discuss challenges posed by mobile devices

4. Recognize the attack on mobile networks

5. Discuss Phishing in cybercrime

6. Explain the different security challenges to Indian law

PART-A

UNIT – 1 9 Hrs

Introduction to Objectives

Introduction to cybercrime, Cybercrime and information security, who are Cybercriminals,

Classification of Cybercrimes, Cybercrime: The Legal Perspectives, An Indian Perspective,

Cybercrime and the Indian ITA 2000,A global perspective on cybercrimes SLC: Cybercrime era:

Survival mantra for the citizens.

UNIT-2 8 Hrs

Cyber offenses

Introduction, How criminal plan the attacks, Social engineering, Cyber stalking, Cybercafe and

cybercrimes, Botnets: The fuel for cybercrime, Attack vector SLC: Cloud Computing.

UNIT-3 9 Hrs

Cybercrime: Mobile and Wireless devices

Introduction, Proliferation of mobile and wireless devices, Trends in mobility, Security

challenges posed by mobile devices, Registry setting for mobile devices, Authentication service

security, Attacks on mobile/ cell phones, Mobile devices: security implications for organizations,

61

Organization measures for handling mobile, SLC: Organizational security policies and measures

in mobile computing era, Laptops.

PART - B

UNIT-4 9 Hrs

Tools and method used in Cybercrime:

Introduction, Proxy servers and anonymizers, Phishing, Password cracking, Key loggers and

spywares, Virus and worms, Trojan horses and backdoors, Steganography, DoS and DDoS

attacks, SQL injection, Buffer overflow SLC: Attacks on wireless networks.

UNIT-5 8 Hrs

Phishing and identity theft:

Introduction, Phishing SLC: Identity theft (id theft).

UNIT-6 9 Hrs

Cybercrimes and Cyber Security: The legal perspectives

Introduction, Cybercrime and the legal landscape around the world, why do we need cyber laws:

the Indian context, The Indian IT act, Challenges to Indian law and cybercrime scenario in India,

SLC: Consequences of not addressing the weakness in information technology act.

TEXT BOOK:

1. Cyber Security by Nina Godbole,Sunit Belapure, Wiley India, 1st edition copyright 2011

reprint 2013.

REFERENCES:

1. Computer Forensics and Cyber Crime An Introduction by Marjie T. Britz ,Pearson

publication, 2nd edition.

62

Cyber Crime and Digital forensic (4:2:0)

Sub code : CIE : 50% Marks



Course Outcomes:


1. Identify and need for computer forensics

2. Analyze the computer forensic technology

3. Describe the process of data recovery

4. Explain legal aspects of collecting and preserving computer evidence

5. How to recover electronic documents

6. Distinguish between usable and unusable file formats

PART-A

UNIT – 1 9 Hrs

Computer forensics fundamentals

Introduction: what is computer forensics?, Use of computer forensics in law enforcement,

Computer forensics assistance to human resources /employment proceedings, Computer

forensics services, Benefits of professional forensics methodology SLC:Steps taken by computer

forensics specialists, who can use computer forensic evidence?

UNIT-2

Types of computer forensics technology 8 Hrs

Types of military computer forensic technology, Types of law enforcement, Computer forensic

technology, Types of business computer forensic technology, Occurrence of cybercrime, Cyber

detectives, Fighting cyber crime with risk –management techniques, Computer forensics

investigative services SLC:Forensic process improvement.

UNIT-3

Data recovery 9 Hrs

63

Introduction of Data recovery , Data back-up and recovery, the role of back-up in data recovery,

The data-recovery solution.

PART - B

UNIT-4 9 Hrs

Evidence collection and data seizure

Why collect evidence?, Collection options, Obstacles, Types of evidence, The rules of evidence,

Volatile evidence, General procedure, Collection and archiving, Methods of collection, Artifacts,

Collection steps, Preserving the digital crime scene, Computer evidence processing scene, Legal

aspects of collecting SLC: preserving computer forensic evidence.

UNIT-5 8 Hrs

Computer image verification and authentication

Special needs of evidential authentication, Practical consideration, Practical implementation,

Electronic document discovery :a powerful new litigation tool, Time travel, SLC: Forensics

identification and analysis of technical surveillance devices.

UNIT-6 9 Hrs

Reconstruction past events

How to become a digital detective, Useable file formats, Unusable file formats, Converting files,

Network forensics scenario, A technical approach, Destruction of e-mail, Damaging computer

evidence, Documenting the intrusion on destruction of data SLC:System testing.

TEXT BOOKS:

1. Computer Forensics computer crime scene investigation by John R VACCA , Firewall

Media ,2009 edition Reprint 2012.

REFERENCE BOOKS:

1. Guide to computer forensics and investigations by Bill Nelson, Amelia Phillips,

Christopher Stuart, Cengage Learning publications, 4th edition 2013.

64

2. Computer Forensics by David Cowen -CISSP , Mc GrawHill education , Indian edition

2013.



of

I-IV Semester M.Tech (Computer Network Engineering)




1



Vision:




Mission:


computer networks.


PEO1: Graduates will have an understanding of computer networks and related skills necessary

for successful careers.

PEO2: Graduate will be able to engage in higher studies or conduct research.

2

Program Outcomes

Our graduate students will be able to

PO1: Apply knowledge of computer network and engineering to evaluate, analyze and design

networking problems.

PO2: Conceptualize and apply network problem solutions for assessing the impact on society.

PO3: Recognize the research problem; apply research methodologies, techniques and tools,

design, conduct experiments, documenting and reporting of the problem.

PO4: Exhibit knowledge and understanding of computer networking ideas, algorithms

and management principles for managing projects efficiently.

PO5: Use modern software tools for designing simple to complex Networking Applications in

real world.

PO6: Communicate effectively with the engineering community and with the society at large.

PO7: Engage in lifelong learning to improve knowledge and professionalcompetence

PO8: Acquire professional integrity, professional ethics for sustainable development of

the society

3






3. Design and Develop solutions: Designing

problems based on needs while considering

conditions.

and developing solutions for engineering

the norms of Safety and environmental





















also in a team.



4

SCHEME OF TEACHING AND EXAMINATION

M. TECH COMPUTER NETWORK ENGINEERING -I SEMESTER

Sl. Subject Subject

Teaching Contact Hrs./Week No. of

No Code Dept.

Credits

L T P

1 MCN0531 Wireless Adhoc Network CSE/ISE 4 0 2 5

2 MCN0532 Advances in Computer CSE/ISE

4 0 2 5

Networks

3 MCN0533 Information and Network CSE/ISE

4 2 0 5

Security

4 AMT0401 Advanced Mathematics CSE/ISE

4 0 0 4

5 MCN05XX Elective – I CSE/ISE

4 2 0 5

6 MCN05XX Elective – II CSE/ISE 4 2 0 5

Credits

Total 23 6 4 29


5


M. TECH COMPUTER NETWORK ENGINEERING -IISEMESTER

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Sl. Subject Subject

Teaching Contact Hrs./Week No. of

No Code Dept.

Credits

L T P

1 MCN0506 Optical networks CSE/ISE 4 2 0 5

2 MCN0515 Cloud Computing CSE/ISE 4 2 0 5

3 MCN0518 Protocol Engineering CSE/ISE 4 2 0 5

4 MCN0401 Network Management CSE/ISE 4 0 0 4

5 MCN05XX Elective – III CSE/ISE 4 2 0 5

6 MCN05XX Elective – IV CSE/ISE 4 2 0 5

Credits

Total 24 6 4 29


6


M. TECH COMPUTER NETWORK ENGINEERING -IIISEMESTER


Teaching Hours/

Sl.No Subject Code Subject Week Credits

L T P



-

- - 4



a seminar)



project-work during III - - - 8



seminar)

3 MCN0201 Subject Seminar on current -

- - 2

topic

Total Credits 14

7


M. TECH COMPUTER NETWORK ENGINEERING -IVSEMESTER

Teaching Hours/

Sl.No Subject Code Subject Week Credits

L T P



final project report at the end -

- - 28





Total Credits 28


Core Courses 38

Elective Courses 20


Major Project 28

TOTAL 100

8


M. TECH COMPUTER NETWORK ENGINEERING -ELECTIVE COURSES


Subject

Teaching Hours/

Sl.No Subject

Week Credits

Code

L T P

1 MCN0534 Distributed Computing 4 0 2 5

2 MCN0535 Multi core Architecture and 4 2 0 5

programming


4 MCN0537 Cyber Crime and Digital forensic 4 0 2 5

5 MCN0524 Intrusion Detection and Prevention 4 2 0 5

Systems






11 MCN0513 Computer Systems performance 4 2 0 5

Analysis


13 MCN0520 Advances in Storage Area 4 2 0 5

Networks



9

16 MCN0526 Cloud sensor Networks 4 2 0 5

17 MCN0527 Vehicular sensor networks 4 2 0 5

18 MCN0528 Robot aided sensor networks 4 2 0 5

19 MCN0529 Smart sensor networks 4 2 0 5

20 MCN0530 Cyber enabled distributed 4 2 0 5

computing and knowledge

discovery

10


SubCode: MCN0531

Designation: Core


COURSE OUTCOMES





4. Explain the knowledge acquired by hands-on session.

5. Explain the energy management














(Chapter 7: 7.1-7.6, 7.8, 7.9) 10 Hours







11





and Challenges in Security Provisioning, Network Security Attacks, Key Management SLC:

Secure Touting Ad hoc Wireless Networks.

(Chapter 9: 9.1-9.6, 9.7-9.12) 9 Hours



Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions; SLC:

Relevant Case study.

7Hours



Battery Management Schemes, Transmission Management Schemes, SLC: System Power

Management Schemes.


LABORATORY WORK



Simulator)











12






increasing node density and mobility. 4. Develop and Analyze the performance of TCP connection when it is used for wireless





Network Simulator. 5. Simulate MANET environment using suitable Network Simulator and test with various


hybrid models) (Spatialcorrelation, temporal correlation, relative speed, link durations). Analyze

throughput, PDR and delaywith respect to different mobility models.

TEXT BOOKS:

1. C. Siva Ram Murthy & B. S. Manoj: Ad hoc Wireless Networks, 2nd

Edition, Pearson

Education, 2011

REFERENCES:

1. Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2007. 2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic

Publishers, 2004.

13


SubCode: MCN0532

Designation: Core

Credits: 05

Contact Hours: 06

Type of Delivery: 4-0-2-0

COURSE OUTCOMES 1. Explain the basics of Computer Networks.

2. Describe Network architectures.

3. Explain Concepts of fundamental protocols.

4. Explain knowledge of internetworking concepts.

5. Explain the knowledge of internetworking concepts in various applications.

6. Explain the implementation concepts in congestion control and error detections.

UNIT-1 Foundation

Building a Network,Requirements, Perspectives, Scalable Connectivity, Cost-Effective Resource

sharing, Support for Common Services, Manageability, Protocol layering, Performance,

Bandwidth and Latency, Delay X Bandwidth Product,Perspectives on Connecting, Classes of Links, Reliable Transmission, Stop-and-Wait , Sliding Window

SLC:

Concurrent Logical Channels. T1:Ch 1.1, 1.2, 1.5.1, 1.5.2., 2.1, 2.5T2:Ch 4

9Hours

UNIT2:Internetworking- I









Routing Areas, Routing among Autonomous systems(BGP), IP Version 6(IPv6), Mobility SLC:

Mobile IP T1: Chap3.3, 4.1.1,4.1.3T2:Ch 13.1 to 13.18 , Ch 18. 10 Hours

14







T1: Chap 5.1, 5.2.1 to 5.2.8, 6.2, 6.3 7Hours

UNIT-6 Congestion Control and Resource Allocation Congestion-Avoidance Mechanisms,

DEC bit, Random Early Detection (RED), Source-Based Congestion

Avoidance.The

Domain

Name

System(DNS),Electronic

Mail(SMTP,POP,IMAP,MIME),World Wide Web(HTTP) SLC:Network Management(SNMP) . T1: Chap 6.4

T2: Ch 23.1 to 23.16, Ch 24, Ch 25, Ch 27.1 to 27.8

7Hours

LABORATORY WORK





















15

Text books:


5th

Edition , Elsevier -2014



References:

1. Uyless Black “Computer Networks, Protocols , Standards and Interfaces” 2nd

Edition -

PHI

2. Behrouz A Forouzan “TCP/IP Protocol Suite” 4th

Edition – Tata McGraw-Hill.

16



Designation: Core


Course Outcomes: 1. Explain the fundamentals of Cryptography

2. Acquire knowledge on standard algorithms used to provide confidentiality, integrity and

authenticity.

3. Describe the various key distribution and management schemes.

4. Implement encryption techniques to secure data in transit across data networks


6. Explain Electronic mail security.

UNIT -1 Classical Encryption Techniques Symmetric Cipher Model, Cryptography, Cryptanalysis and Brute-Force Attack, Substitution


Cipher, One Time Pad. Block Ciphers and the data encryption standard: Traditional block Cipher structure, stream Ciphers and block Ciphers, Motivation for the feistel Cipher structure,

SLC:the feistel Cipher. 7 Hours

UNIT -2The data encryption standard, DES encryption , DES decryption , A DES example,



SLC:key schedule algorithm.

07 Hours

UNIT -3Public-Key Cryptography and RSA: Principles of public-key cryptosystems. Public-

key cryptosystems.Applications for public-key cryptosystems, requirements for public-key

cryptosystems.public-key cryptanalysis. The RSA algorithm, desription of the algorithm,

computational aspects, the security of RSA.OtherPublic-Key Cryptosystems: Diffie-hellman


Cryptographic systems, Elliptic curve arithmetic, abeliangroups,elliptic curves over real




cipher, PRNG based on RSA. 9 Hours

17







certificates, X-509 certificates. Certificates, X- 509 version 3, public key infrastructure .User





Authentication, SLC:federated identity management, identity management, identity federation,

personal identity verification. 9 Hours

UNIT - 5 Wireless network security: Wireless security, Wireless network threats, Wireless





pseudorandom function, .. Web Security Considerations: Web Security Threats, Web Traffic Security Approaches.







10 Hours











determinations protocol, header and payload formats SLC:cryptographic suits. 10 Hours

18

LABORATORY WORK






Implement MD5 and SHA-1 algorithm, which accepts a string input, and produce a

fixed size number - 128 bits for MD5; 160 bits for SHA-1, this number is a hash of the

input. Show that a small change in the input results in a substantial change in the output.


server.

5. Using any simulation tool: demonstrate packet filtering firewalls, create the ACL,

create VLAN [subnetting].


Text Books:

1. William Stallings: Cryptography and Network Security, Pearson 6th

edition.

References 1. V k Pachghare: Cryptography and Information Security.

19



Designation: CORE


Course outcomse


1. Construct the matrix , digraphs of relations and prove some results on different types 2. Identify different types of functions ,find composition and inverse of a function and 3. Apply the concepts of graph theory to solve some application problems. 4. Solve problems associated with basic probability, Baye’srule , discrete &. Evaluate

estimators, construct confidence intervals, and perform hypothesis tests and 5. Solve problems of Joint Distribution , Markov chain using transition probability of relation

and also obtain equivalence classes. 6. Solve problems using pigeon-hole principle.continuous probability distributions. Obtain


Unit-I : Relations



Unit-II : Functions



Unit-III : Graph Theory


Circuits in a graph. Connected graphs.Euler’s and Hamiltonian graphs. The

20

KonigsbergBridgeproblem.Trees, Kruskal’salgorithm(SLE: Prim’s algorithm), Cut sets and cut

vertices, Network flow problems.

Unit-IV : Probability

(SLE: Basic probability uptoBaye’sTheorem )Random variables – Discrete and continuous


Unit-V : Statistical Inference



Unit-VI : Joint Distribution and Markov Chains


variables,Expectation, Covariance, Correlation Coefficient.(SLE: Continuous joint probability

distributions)








21





Course Outcomes:

1. Explain different generations of digital transport networks

2. Describe the timing and synchronization in digital networks

3. Describe architecture of OTN

4. Describe the WDM

5. Develop the concept of label switching and its importance in OTN

6. Explain the Knowledge on LMP and optical routers

Part-A

UNIT-1Introduction, Telecommunications Infrastructure, Characteristics of Optical Fiber:

Three generations of Digital Transport Networks; A brief introduction to WDM and TDM; The

Optical Marketplace; Key Optical Nodes; Other Key Terms; Evolution of Optical Systems; Key

attributes of Optical Fiber, The Local Connections; The Backbone Connections; The Digital

Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3; The Layered

Protocol Model in the Transport Network; considerations for Interworking Layer1, Layer 2, and

Layer 3 Networks, The Basics; The Wavelength; The Basic Components; Structure of the Fiber;

Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier Spontaneous

Emission; Chromatic Dispersion;.

SLC: Wireless Optical Systems,Lasers 9 Hours

UNIT- 2Timing and Synchronization, SONET and SDH: Timing and Synchronization in



DS1; Timing Downstream Devices; Synchronization Status Messages and Timing Loops, The

SONET Multiplexing Hierarchy; SONET and SDH Multiplexing Structure; The SONET / SDH

Frame Structure; SONET and SDH Functional Components; SONET and SDH Problem

Detection; Locating and Adjusting Payload with Pointers; Virtual Tributaries in more detail;

Virtual Tributaries in Virtual Containers; The Overhead Bytes;.

22

SLC: Building Integrated Timing Supply, SONET and SDH Concatenation 9 Hours

UNIT-3 Architecture of Optical Transport Networks, WDM, Network Topologies and




Other Terms; The New Optical Transport and Digital Transport Hierarchy; The OTN Layered

Model; Encapsulation and Decapsulation Operations;

SLC: Generic Framing Procedure, 8 Hours

UNIT-4 The WDM Operation; DWDM, TDM and WDM Topologies; Relationship of WDM






BLSR; Meshed Topologies; PONs; Ethernet in the Wide Area Backbone,

SLC: Metro Optical Networking. 8 Hours





Data Planes Interworking, IP, MPLS, and Optical Control Planes; Interworking the three Control

Planes; Management of the Planes; A Framework for the IP over Optical Networks; An


Networks; GMPLS Extensions for G.709;

SLC: GMPLS with SONET and SDH. 9 Hours









23


Interworking;

SLC: MEMS and Optical Switching; Thermo-Optic Switches. 9 Hours

TEXT BOOKS:


REFERENCE BOOKS:


Morgan Kaufuann, 2000. 2. Paul E.Green Jr.: Fiber Optic Network, Prentice Hall, 1993. 3. Jeff Hecht: Understanding Fiber Optics, 4th Edition, PHI 1999.

24

CLOUD COMPUTING

SubCode: MCN0515

Designation: Core

Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0 Course Outcomes

1. Explain how to use Cloud Services.

2. Describe knowledge Virtualization

3. Explain knowledge Task Scheduling algorithms.


5. Build Private Cloud.

6. Explain knowledge in cloud resource virtualization and scheduling.

UNIT-1 Introduction, Cloud Infrastructure Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud vulnerabilities,

Cloud computing at Amazon, Cloud computing the Google perspective, Microsoft Windows Azure and

online services, Open-source software platforms for private clouds, Cloud storage diversity and vendor

lock-in, Energy use and ecological impact, Service level agreements, User experience and software

licensing. Exercises SLC: problems.

10 Hours

UNIT-2 Cloud Computing: Application Paradigms. Challenges of cloud computing, Architectural styles of cloud computing, Workflows: Coordination of

multiple activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce programming model, A case study: The GrepTheWebapplication , Cloud for science and engineering,

High-performance computing on a cloud, SLC:Cloud computing for Biology research, Social computing, digital content and cloud computing.

9 Hours

UNIT-3 Cloud Resource Virtualization. Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines, Performance and

Security Isolation, Full virtualization and paravirtualization, Hardware support for virtualization, Case

Study:Xen a VMM based paravirtualization, Optimization of network virtualization,vBlades, Performance comparison of virtual machines, SLC:The dark side of virtualization, Exercises and

problems. 10 Hours

UNIT-4 Cloud Resource Management and Scheduling. Policies and mechanisms for resource management, Application of control theory to task scheduling on a

cloud, Stability of a two-level resource allocation architecture, Feedback control based on dynamic

thresholds, Coordination of specialized autonomic performance managers, A utility-based model for

cloud-based Web services, Resourcing bundling: Combinatorial auctions for cloud resources, Scheduling

algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time, Cloud 25

scheduling subject to deadlines, Scheduling MapReduce applications subject to deadlines SLC:Resource

management and dynamic scaling, Exercises and problems.

9Hours

UNIT-5 Cloud Security, Cloud Application Development. Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact assessment,

Trust, Operating system security, Virtual machine Security, Security of virtualization, Security risks

posed by shared images, Security risks posed by a management OS, A trusted virtual machine monitor,

Amazon web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security

rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance and

connect to it SLC:How to use S3 in java, 8 Hours

UNIT-6 Cloud-based simulation of a distributed trust algorithm, A trust management service, A cloud

service for adaptive data streaming, Cloud based optimal FPGA synthesis SLC:Exercises and problems. 6Hours

Text Book: 1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013.

REFERENCES: 1. RajkumarBuyya , James Broberg, AndrzejGoscinski: Cloud Computing Principles and

Paradigms, Willey 2014. 2. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and

Security, CRC Press 2013.

26


SubCode:MCN0518

Designation: Core


Course Outcome


1. Explain the concept of protocols and their representation and discuss the phases of









of protocol



UNIT-1.Introduction, Error Control, Flow Control: Communication model, Communication






UNIT-2.Network Reference Model: Layered Architecture, Network Services and Interfaces,

Protocol Functions: Encapsulation, Segmentation, Reassembly, Multiplexing, Addressing, OSI

Model Layer Functions,TCP/IP Protocol Suite,

SLC: Application Protocols.

9hours

UNIT-3.Protocol Specification:

Components

of

specification,

Service

specification,

Communication Service Specification Protocol entity specification: Sender, Receiver and

27

Channel specification, Interface specifications, Interactions, Multimedia specifications,

Alternating Bit Protocol Specification,


UNIT-4.Protocol Specification Language (SDL), Protocol Verification / Validation: Salient











UNIT-5 Protocol Conformance and Performance Testing: Conformance Testing

Methodology and Framework, Local and Distributed Conformance Test Architectures, Test

Sequence Generation Methods: T, U, D and W methods, Distributed Architecture by Local

Methods, Synchronizable Test Sequence, Conformance testing with Tree and Tabular Combined

Notation (TTCN), Conformance Testing of RIP, Testing Multimedia Systems, quality of service

test architecture(QOS), Performance Test methods, SDL Based Performance Testing of TCP,

OSPF, Interoperability testing


UNIT-6Protocol Synthesis+ and Implementation: Synthesis methods, Interactive Synthesis




SLC: SDL and CVOPS.

9hours

28

TEXT BOOKS:

1. PallapaVenkataram and Sunilkumar S. Manvi: Communication Protocol Engineering, PHI,

2004.

REFERENCE BOOKS:


29



Designation: CORE


Course Outcomes:



data types etc.,




M2 interface 6. Explain the broadband access networks and technologies










Management System platform SLC:Current Status and Future of Network Management. 9hours UNIT-2 Basic Foundations:Standards, Models, and Language: Network Management

Standards, Network Management Model, Organization Model, Information Model –

Management Information Trees, Managed Object Perspectives, Communication Model;

ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object

Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros

SLC:Functional Model 8hours





30



















Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2,

SLC:ADSL Configuration Profiles. 9hours





Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case- Based






Management

SLC:Policy- Based Management, Service Level Management.

9hours

31

TEXT BOOKS:


Education, 2010.



32

ELECTIVES

33

DISTRIBUTED COMPUTING


Designation: CORE


COURSE Outcomes 1. Compare Load Balancing and Load Sharing

2. Identify the Basic concept of DSM, Hardware DSM

3. Summarize advantages of DFS

4. Outline mechanisms to manage security in DS

5. Choose appropriate real-time scheduling

6. Identify the emerging trends in DS

UNIT-I 08 hour

Distributed System management: Introduction, Resource management, Task Assignment

Approach, LoadBalancing Approach, Load-Sharing Approach, Process management in a

Distributed Environment, Process Migration, Threads. SLC: Fault Tolerance.

UNIT-II 09 hour Distributed Shared Memory :Introduction, Basic Concepts of DSM,

Hardware DSM, Design Issue in DSM Systems, Issue in Implementing DSM Systems SLC:

Heterogeneous and Other DSM Systems, Case Studies.

UNIT-III 10 hour Distributed File System: Introduction to DFS, File Models, Distributed File System Design,

Semantics of File Sharing, DFS Implementation, File Caching in DFS, Replication in DFS, Case

studies. Naming: Introduction, Desirable features of a good naming system, Basic concepts,

System-oriented names, Object-locating mechanisms, Issues in designing human-oriented

names, Name caches, Naming and security

SLC: Case study: Domain name service.

UNIT-IV 07 hour Security in distributed systems:

Introduction, Cryptography, Secure channels, Access control, Security Management

SLC: Case studies.

UNIT-V 10 hour Real-Time Distributed operating Systems: Introduction, Design issues in real-time distributed

systems, Realtime communication, Real-time scheduling. SLC: Case study: Real-time

communication in MARS

34

UNIT-VI Emerging Trends in distributed Computing:

Introduction to emerging trends, Grid Computing, SOA, Cloud computing

SLC: Future of emerging Trends. 08 hour

Text Book. SunithaMahajan, Seema Shah: Distributing Computing, Published by Oxford University

press 2010

LIST OF EXPERIMENTS: Note: Use appropriate tools/language to implement the following experiment:

1. Design and implement client server application using RMI (Remote Method Invocation) to

invoke a service to calculate the income tax.

2. Design and implement EJB (Entity Java Beans) session bean business logic to calculate

income tax and invoke the service using stub, i.e., client side proxy object.

3. Design and implement an EJB entity bean to persist the client submitted data into an enterprise

information system.

4. Design and implement an offline database communication system using JMS (Java Message

Service) to service the client request.

5. Design and implement the client code to call the Micro soft service like free service from

UDDI (Universal Description Discovery Protocol). 6. Design and implement business logic

and bind it as service using SOAP (Simple Object Access Protocol), also implement client to

call service.

NOTE: Use EJB 3.X or any equivalent tool.

35



Designation: CORE


Course Outcomes

1. Explain the recent trends in the field of Computer Architecture and identify performance

related parameters

2. Expose the students to the problems related to multiprocessing

3. Describe the different types of multicore architectures 4. To expose the students to warehouse-scale and embedded architectures 5. Explain the fundamentals of threading 6. Analyze the fundamentals of parallel programming.






UNIT-2System Overview of Threading: Defining Threads, System View of Threads,



Virtual Environment: VMs and Platforms, Runtime Virtualization,SLC:System Virtualization.7

Hours

UNIT-3Fundamental Concepts of Parallel Programming: Designing for Threads, Task





UNIT-4Threading and Parallel Programming Constructs: Synchronization, Critical Sections,

Deadlock, Synchronization Primitives, Semaphores, Locks, Condition Variables, Messages,

Flow Control- based Concepts, Fence, Barrier, Implementation-dependent Threading Features.

Threading APIs : Threading APls for Microsoft Windows, Win32/MFC Thread APls,

Threading APls for Microsoft. NET Framework, Creating Threads, Managing Threads, Thread

Pools, Thread Synchronization, POSIX Threads, Creating Threads, Managing Threads,


36





Interleaving Single-thread and Multi -thread Execution, Data Copy-in and Copy-out, Protecting



9 Hours

UNIT- 6 Solutions to Common Parallel Programming Problems: Too Many Threads, Data






Architecture, High-level Languages, Avoiding Pipeline Stalls on IA-32 SLC:Data Organization for High Performance. 9 Hours

Text Book


ShameemAkhter and Jason Roberts , Intel Press , 2006.

37

Subject Title:MULTIMEDIA COMMUNICATIONS

SubCode: MCN0536



Course Outcomes: 1. Explain the Multimedia Communication Models

2. Study the Multimedia Transport in Wireless Networks

3. Solve the Security issues in multimedia networks

4. Explore real-time multimedia network applications.

5. Explore different network layer based application.

6. Study multimedia standards

UNIT- 1 Introduction to Multimedia Communications: Introduction, Human communication


10 Hours






7Hours



9 Hours



UNIT-6Network Layer: Introduction, QoS in Network Multimedia Systems.

10 Hours


38

TEXT BOOKS:



REFERENCE BOOKS:


Standards, Pearson, 2001. 2. Nalin K Sharad: Multimedia information Networking, PHI, 2002. 3. Ralf Steinmetz, KlaraNarstedt: Multimedia Fundamentals: Volume 1-Media Coding and

Content Processing, 2nd Edition, Pearson, 2003. 4. Prabhat K. Andleigh, KiranThakrar: Multimedia Systems Design, PHI, 2003.

39


Sub code :MCN0524 Hrs/week : 04

SEEHrs : 03 Hours

CIE : 50%Marks

SEE : 50%Marks

Max. Marks : 100

Course Outcome: On Successful completion of the course, the students will be able to:





5. Explain IPS


UNIT – 1 9 Hrs

UNDERSTANDING INTRUSION DETECTION: Intrusion-Detection and Intrusion-Prevention Basics-Why IDSs and IPSs are Important - IDS


UNIT - 2 8 Hrs

UNAUTHORIZED ACTIVITY I: General IDS Limitations -Network Protocol Abuses: ARP, IP, UDP, TCPSLC:ICMP.

UNIT - 3

Tcpdump:

9 Hrs




UNIT – 4

ARCHITECTURE: IDS and IPS Architecture- Tiered Architectures.SLC:Future IDS

7 Hrs

UNIT - 5


10 Hrs



40

UNIT – 6 9Hrs

POLICY AND PROCEDURES & SECURITY BUSINESS ISSUES: IDS/IPS Policy- Creating an IDS/IPS Policy- International Cyber Security Related Laws-



TEXT BOOK:


Hill, 2004

REFERENCES:




3. “Intrusiion Alert”,AnkitFadia and MnuZacharia, Vikas Publishing house Pvt., Ltd, 2007.


2006.

41





Course Outcomes







UNIT-1Digital Transmission Fundamentals: Digital Representation of Information: Block-






Digital Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding ; Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations,



Constellations,






42





DM,.








TEXT BOOKS:

1. Alberto Leon – Garcia and IndraWidjaja: Communication Networks - Fundamental Concepts

and Key architectures, 2nd Edition, Tata McGrawHill, 2006. 2. Simon Haykin: Digital Communication, Wiley India, 2007.

REFERENCE BOOKS:


43



Designation: CORE


Course outcome



2. Explain socket level programming and with designing and programming client server

systems based on TCP/IP and http protocols to run across a range of computing

platforms.






UNIT-1The Client Server Model and Software Design, Concurrent Processing in Client-


Concurrency in Networks, Concurrency in Servers, Terminology and Concepts, An example

of Concurrent Process Creation, Executing New Code, Context Switching and Protocol

Software Design, SLC:Concurrency and Asynchronous I/O.

8hours








Parameters.

9hours

44









UDP, Communicating with a Server using UDP, Closing a Socket that uses UDP, SLC:Partial Close for UDP, A Warning about UDP Unreliability. 9hours

Part-B








9hours

UNIT- 5 Algorithms and Issues in Server Software Design: Introduction, The Conceptual











Problem of Server Deadlock,SLC: Alternative Implementations. 9hours

UNIT-1Iterative, Connectionless Servers (UDP), Iterative, Connection-Oriented Servers



45





8hours

Laboratory Work:


implement a simple iterative connectionless server and demonstrate its functioning. 2. Design, develop, and execute a program in C under UNIX / LINUX environment to

implement a simple iterative connection-oriented server and demonstrate its functioning. 3. Design, develop, and execute a program in C under UNIX / LINUX environment to

implement a simple concurrent connection-oriented server and demonstrate its functioning. 4. Design, develop, and execute a program in C under UNIX / LINUX environment to

implement a simple Day / Time Server and demonstrate its functioning. 5. Repeat the above problems using JAVA networking facilities.

TEXT BOOK:



Pearson, 2001.

46





Course Outcome


1. Identify situations where one should use simulation and where not to. 2. Analyze various probability distribution functions.




6. Analyze system responsiveness, scalability etc. as a function of workload.

UNIT-1Introduction, General Principles: When simulation is the appropriate tool and when it









measures of performance of queuing systems; Steady-state behavior of M/G/1 queue; SLC: Networks of queues, 8hours

47

UNIT-3Random-Number Generation, Random -Variate Generation: Properties of random



Acceptance-Rejection technique; SLC:Special properties. 9hours


estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate SLC:Time-Series input models. 9hours



models.SLC:Optimization via Simulation 9hours



estimation; Output analysis for terminating simulations; Output analysis for steady-state simulations, SLC:Simulation of networked computer systems. 8hours

TEXT BOOKS:



REFERENCE BOOKS:


Pearson Education, 2006. 2. Averill M. “Law: Simulation Modeling and Analysis”, 4th Edition”, Tata McGraw-Hill, 2007.

48





Credits: 05 Contact Hours: 06



1. Identify common network security vulnerabilities/attacks 2. Explain and analyze the basic Cryptographic algorithms for security 3. Critically evaluate the risks and threats to networked computers how provide security



communication.

5. Analyze security issues of IP security. 6. Identify the appropriate procedures required for secure electronic transactions.





Practices;










RFCs;


49

UNIT- 4 Cryptography: Conventional Encryption Principles and Algorithms; Cipher Block



Algorithms; Digital Signatures; Key management. Authentication Applications: Kerberos, X.509 SLC:Directory Authentication Service. 9hours






flaws; Malware; Software-based attacks; SLC:Digital Rights Management;8hours

TEXT BOOKS:


Cengage Learning, 2005. 2. William Stallings: Network Security Essentials Applications and Standards, Person, 2000. 3. Deven N. Shah: Information Security – Principles and Practice, Wiley India, 2009. REFERENCE BOOKS: 1. Behrouz A. Forouzan: Cryptography and Network Security, Tata McGraw-Hill, 2007.

50





Credits: 05 Contact Hours: 06

Course outcomes




2. Explain the general properties of networked communication necessary for distributed

systems on the Internet 3. Describe basic algorithms for failure detection, leader elections, broadcast and multicast,


communication

4. Create common paradigms for easing the task of distributed systems programming, such

as RPC



programming scenarios. 6. Analyze the distributed algorithms for locking, synchronization and concurrency

scheduling.


Examples of distributed systems, Resource sharing and the Web, Challenges, Architectural models, SLC:Fundamental models. 9hours


SLC: Internet protocols

9hours



communication,


51

UNIT-4 Distributed Objects and Remote Invocation: Communication between distributed objects, Remote procedure call, events SLC:notifications 9hours


processes and threads, communication and invocationSLC:operating system architecture 9hours



control. Distributed Shared Memory:Design and Implementation issues, sequential consistency

SLC:Ivy.

8hours

TEXT BOOKS:



REFERENCE BOOKS:

1. SukumarGhosh: Distributed Systems, An Algorithmic Approach, Chapman &Hall / CRC,

2007. 2. Pradeep K. Sinha: Distributed Operating Systems, Concepts and Design, PHI, 2007. 3. Randy Chow, Theodore Johnson: Distributed Operating Systems and Algorithm Analysis,

Pearson, 2009.

52



Designation: CORE


COURSE Outcomes 1. Describe the mathematical foundations needed for performance evaluation of computer

systems

2. Explain the metrics used for performance evaluation

3. Describe the analytical modeling of computer systems

4. Enable the students to develop new queueing analysis for both simple and complex

systems

5. Analyze the concept of planning and design in computer system.

6. Explain the experimental analysis
















Program Performance, Accounting Logs, Analysis and Interpretation of Accounting log data, SLC:Using accounting logs to answer commonly asked questions. 9Hours




9 Hours




General 2k Factorial Designs, General full factorial designs with k factors: Model, Analysis of a 53









Networks; Mean Value Analysis; Approximate MVA; Balanced Job Bounds; Convolution Algorithm, Distribution of Jobs in a System, Convolution Algorithm for Computing




Text Book: 1. Raj Jain: The Art of Computer Systems Performance Analysis, John Wiley and Sons, 2013.

Reference Books: 1. Paul J Fortier, Howard E Michel: computer Systems Performance Evaluation and prediction,

Elsevier, 2003.



Subject Code: MCN0514 54





Course outcomes:

1. Analysis modeling and design modeling for web applications.







UNIT-1Introduction: Motivation, Categories of web applications, Characteristics of web




UNIT-2Modeling Web Application: Introduction, Fundamentals, Modeling specifics in web




Components of generic web application architecture, Layered architecturesSLC: Data-aspect architectures. 9hours




on the web, Client side technologies, Document-specific technologies, Server -side technologies,




55



Project Management:From software project management to web project management,



Fundamentals, Requirements for a web application development process, Analysis of the rational unified process, SLC:Analysis of extreme programming, Outlook. 9hours





indicators, Characterizing the work load, Analytical techniques, Representing and interpreting results, SLC:Performance optimization methods, Outlook. 9hours





8hours

Text Book:

1.GertiKappel, Birgit Proll, SiegfriedReich, Werner Retschitzegeer (Editors): Web Engineering,

Wiley India, 2007.

Reference Books:


2008.

56





Credits: 05

Contact Hours: 06


Course Outcome






SAN

4. Explain the local , network file systems and shared disk file systems of NAS

5. Explain the concepts of storage virtualization , and identify the various levels of storages

for virtualization 6. Design a network for storage using various SAN devices









path from the CPU to the Storage System; SCSI; FibreChannel Protocol Stack; Fibre Channel




8hours

57








9hours



Business Continuity; Managing availability; Managing Serviceability; Capacity planning; SLC:Security considerations. 8hours

Text Book:


2007.

Reference Books:


Subsystems, Applications, Management, and File Systems, Cisco Press, 2005. 2. Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-Hill, 2003. 3. Richard Barker and Paul Massiglia: “Storage Area Network Essentials A Complete Guide to


58






Course Outcomes 1. Explain architect sensor networks for various application setups.


resources.



5. Explain prototype sensor networks using commercial components.

6. Describe quality of service, fault-tolerance, security and other dependability requirements

while coping with resource constraints.
















Strategies in WSNs.

59

(Chapter 5: 5.1-5.6, Chapter 6: 6.1-6.5)

9 Hours

UNIT-5Transport Control and Middleware for Wireless Sensor Networks





(Chapter 7: 7.1-7.4, Chapter 8: 8.1-8.4)

9 Hours UNIT-6 Network Management and Operating System for Wireless Sensor Networks


Network Management Design Issues.Operating Systems for Wireless Sensor Networks:


(Chapter 9: 9.1-9.5, Chapter 10: 10.1-10.3)

10 Hours

TEXT BOOKS:



REFERENCE BOOKS:




60


Sub code: MCN0525 CIE

: 50% Marks

Hrs/week: 04

SEE

: 50% Marks

SEE : 03Hrs

Max Marks : 100

Course outcomes








UNIT – 1 9 Hrs






UNIT-2 8 Hrs

Cyber offenses



UNIT-3 9 Hrs





61



UNIT-49 Hrs





UNIT-5 8 Hrs



UNIT-6 9 Hrs





TEXT BOOK:

1. Cyber Security by Nina Godbole,SunitBelapure, Wiley India, 1st

edition copyright 2011

reprint 2013.

REFERENCES:

1. Computer Forensics and Cyber Crime An Introduction byMarjie T. Britz ,Pearson

publication, 2nd

edition.

62

Cyber Crime and Digital forensic(4:2:0)

Sub code: MCN0537 CIE

: 50% Marks

Hrs/week: 04

SEE

: 50% Marks

SEE : 03Hrs

Max Marks : 100

Course Outcomes:








UNIT – 1 9 Hrs Computer forensics fundamentals


Computer forensics assistance to humanresources /employment proceedings, Computer forensics

services, Benefits of professional forensics methodologySLC:Steps taken by computer forensics

specialists, who can use computer forensic evidence?

UNIT-2





investigative servicesSLC:Forensic process improvement.

UNIT-3

Data recovery 9 Hrs



63

UNIT-4 9 Hrs






UNIT-5 8 Hrs





UNIT-6 9 Hrs




evidence, Documenting the intrusion on destruction of dataSLC:System testing.

TEXT BOOKS:



REFERENCE BOOKS:


Christopher Stuart, Cengage Learning publications, 4th

edition 2013.

2. Computer Forensics by David Cowen -CISSP ,McGrawHill education , Indian edition

2013.

64

1



of





2



Vision:




Mission:


computer networks.





3

Program Outcomes

Our graduate students will be able to

PO1: Apply knowledge of computer network and engineering to evaluate, analyze and design

networking problems.

PO2: Conceptualize and apply network problem solutions for assessing the impact on society.

PO3: Recognize the research problem; apply research methodologies, techniques and tools,

design, conduct experiments, documenting and reporting of the problem.

PO4: Exhibit knowledge and understanding of computer networking ideas, algorithms and

management principles for managing projects efficiently.

PO5: Use modern software tools for designing simple to complex Networking Applications in

real world.

PO6: Communicate effectively with the engineering community and with the society at large.

PO7: Engage in lifelong learning to improve knowledge and professional competence

PO8: Acquire professional integrity, professional ethics for sustainable development of the

society

4






3. Design and Develop solutions: Designing and developing solutions for engineering

problems based on needs while considering the norms of Safety and environmental

conditions.





















also in a team.



5


M. TECH COMPUTER NETWORK ENGINEERING - I SEMESTER

Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P



Networks

CSE/ISE 4 0 2 5


Security

CSE/ISE 4 2 0 5


4 0 0 4


4 2 0 5


Total

Credits 23 6 4 29


6


M. TECH COMPUTER NETWORK ENGINEERING - II SEMESTER


Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P

1 MCN0537 Cyber Crime and Digital

forensic

CSE/ISE 4 2 0 5






Total

Credits 24 6 4 29


7


M. TECH COMPUTER NETWORK ENGINEERING - III SEMESTER



Teaching Hours/

Week Credits

L T P





a seminar)

- - - 4






seminar)

- - - 8


topic - - - 2

Total Credits 14

8


M. TECH COMPUTER NETWORK ENGINEERING - IV SEMESTER



Teaching Hours/

Week Credits

L T P








- - - 28

Total Credits 28

Core Courses 38

Elective Courses 20


Major Project 28

T O T A L 100

9


M. TECH COMPUTER NETWORK ENGINEERING - ELECTIVE COURSES


Sl.No Subject

Code Subject

Teaching Hours/

Week Credits

L T P



programming

4 2 0 5


4 MCN0506 Optical Networks 4 0 2 5


Systems

4 2 0 5







Analysis

4 2 0 5



Networks

4 2 0 5


10






29 MCN0530 Cyber enabled distributed


discovery

4 2 0 5

11


SubCode: MCN0531

Designation: Core


COURSE OUTCOMES





4. Explain the knowledge acquired by hands-on session.

5. Explain the energy management














(Chapter 7: 7.1-7.6, 7.8, 7.9) 10 Hours







12





and Challenges in Security Provisioning, Network Security Attacks, Key Management

SLC: Secure Touting Ad hoc Wireless Networks.

(Chapter 9: 9.1-9.6, 9.7-9.12) 9 Hours



Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions;

SLC: Relevant Case study.

7Hours



Battery Management Schemes, Transmission Management Schemes,



LABORATORY WORK



Simulator)











13






increasing node density and mobility.

4. Develop and Analyze the performance of TCP connection when it is used for wireless





Network Simulator.

5. Simulate MANET environment using suitable Network Simulator and test with various


hybrid models) (Spatial correlation, temporal correlation, relative speed, link durations). Analyze

throughput, PDR and delay with respect to different mobility models.

TEXT BOOKS:

1. C. Siva Ram Murthy & B. S. Manoj: Ad hoc Wireless Networks, 2nd Edition, Pearson

Education, 2011

REFERENCES:

1. Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2007.

2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic

Publishers, 2004.

14


SubCode: MCN0532

Designation: Core


COURSE OUTCOMES

1. Explain the basics of Computer Networks.






UNIT-1 Foundation






T1:Ch 1.1, 1.2, 1.5.1, 1.5.2., 2.1, 2.5 T2:Ch 4 9Hours











SLC: Mobile IP


15







T1: Chap 5.1, 5.2.1 to 5.2.8, 6.2, 6.3 7Hours






LABORATORY WORK





















16

Text books:





References:


PHI


17



Designation: Core


Course Outcomes:

1. Explain the fundamentals of Cryptography


authenticity.















07 Hours











9 Hours

18














9 Hours














10 Hours












10 Hours

19

LABORATORY WORK










server.


VLAN [subnetting].


Text Books:


References


20



Designation: CORE


Course outcomse









6. Solve problems using pigeon-hole principle.continuous probability distributions. Obtain


Unit-1 : Relations



Unit-2 : Functions



Unit-3 : Graph Theory




flow problems.

21

Unit-4 : Probability



Unit-5 : Statistical Inference



Unit-6 : Joint Distribution and Markov Chains



distributions)








22


Sub code : MCN0537 CIE : 50% Marks



Course Outcomes:








UNIT – 1 9 Hrs






UNIT-2






UNIT-3

Data recovery 9 Hrs



23

UNIT-4 9 Hrs






UNIT-5 8 Hrs





UNIT-6 9 Hrs





TEXT BOOKS:



REFERENCE BOOKS:




2013.

24

CLOUD COMPUTING

SubCode: MCN0515

Designation: Core


Course Outcomes








Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud

vulnerabilities, Cloud computing at Amazon, Cloud computing the Google perspective,

Microsoft Windows Azure and online services, Open-source software platforms for private

clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service

level agreements, User experience and software licensing. Exercises SLC: problems.

10 Hours


Challenges of cloud computing, Architectural styles of cloud computing, Workflows:

Coordination of multiple activities, Coordination based on a state machine model: The

Zookeeper, The Map Reduce programming model, A case study: The GrepTheWeb application ,

Cloud for science and engineering, High-performance computing on a cloud, SLC:Cloud

computing for Biology research, Social computing, digital content and cloud computing.

9 Hours


Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines,

Performance and Security Isolation, Full virtualization and paravirtualization, Hardware support

for virtualization, Case Study:Xen a VMM based paravirtualization, Optimization of network

virtualization, vBlades, Performance comparison of virtual machines, SLC:The dark side of

virtualization, Exercises and problems.

10 Hours


Policies and mechanisms for resource management, Application of control theory to task

scheduling on a cloud, Stability of a two-level resource allocation architecture, Feedback control

based on dynamic thresholds, Coordination of specialized autonomic performance managers, A

utility-based model for cloud-based Web services, Resourcing bundling: Combinatorial auctions

25

for cloud resources, Scheduling algorithms for computing clouds, Fair queuing, Start-time fair

queuing, Borrowed virtual time, Cloud scheduling subject to deadlines, Scheduling Map Reduce

applications subject to deadlines SLC:Resource management and dynamic scaling, Exercises

and problems.

9Hours


Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact

assessment, Trust, Operating system security, Virtual machine Security, Security of

virtualization, Security risks posed by shared images, Security risks posed by a management OS,

A trusted virtual machine monitor, Amazon web services: EC2 instances, Connecting clients to

cloud instances through firewalls, Security rules for application and transport layer protocols in

EC2, How to launch an EC2 Linux instance and connect to it SLC:How to use S3 in java,

8 Hours

UNIT-6 Cloud-based simulation of a distributed trust algorithm, A trust management service, A

cloud service for adaptive data streaming, Cloud based optimal FPGA synthesis SLC:Exercises

and problems.

6Hours

Text Book:


REFERENCES:



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

Management and Security, CRC Press 2013.

26


SubCode: MCN0518

Designation: Core


Course Outcome











of protocol



UNIT-1. Introduction, Error Control, Flow Control: Communication model, Communication






UNIT-2. Network Reference Model: Layered Architecture, Network Services and Interfaces,




UNIT-3. Protocol Specification: Components of specification, Service specification,


27




UNIT-4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient



















UNIT-6 Protocol Synthesis+ and Implementation: Synthesis methods, Interactive Synthesis




SLC: SDL and CVOPS.

9hours

28

TEXT BOOKS:


2004.

REFERENCE BOOKS:


29



Designation: CORE


Course Outcomes:



data types etc.,




M2 interface























30































Management


9hours

31

TEXT BOOKS:


Education, 2010.



32

ELECTIVES

33

ADVANCED ALGORITHMS


Designation: CORE


COURSE Outcomes

1. Explain the graph search algorithms.

2. Describe hill climbing and dynamic programming design techniques.

3. Develop recursive backtracking algorithms.

4. Explain NP completeness and randomized algorithms.

5. Design probabilistic and randomize algorithms.

6. Explain polynomials.















10 Hours




34

TEXT BOOKS:




REFERENCE BOOKS:


Edition,


35



Designation: CORE


Course Outcomes

1. Explain the recent trends in the field of Computer Architecture and identify



3. Describe the different types of multi core architectures



6. Analyze the fundamentals of parallel programming.










7 Hours













36








9 Hours









Text Book



37


SubCode: MCN0536



Course Outcomes:

1. Explain the Multimedia Communication Models








10 Hours






7Hours



9 Hours





38

TEXT BOOKS:



REFERENCE BOOKS:







39





Course Outcomes:




4. Describe the WDM



Part-A

UNIT-1 Introduction, Telecommunications Infrastructure, Characteristics of Optical


TDM; The Optical Marketplace; Key Optical Nodes; Other Key Terms; Evolution of Optical

Systems; Key attributes of Optical Fiber, The Local Connections; The Backbone Connections;

The Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3;

The Layered Protocol Model in the Transport Network; considerations for Interworking Layer1,

Layer 2, and Layer 3 Networks, The Basics; The Wavelength; The Basic Components; Structure

of the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier

Spontaneous Emission; Chromatic Dispersion;.

SLC: Wireless Optical Systems, Lasers 9 Hours

UNIT-2 Timing and Synchronization, SONET and SDH: Timing and Synchronization in








40


































41


Interworking;


TEXT BOOKS:


REFERENCE BOOKS:





42





Course Outcome:






5. Explain IPS


UNIT – 1 9 Hrs




UNIT - 2 8 Hrs



UNIT - 3 9 Hrs

Tcpdump:




UNIT – 4 7 Hrs

ARCHITECTURE:


UNIT - 5 10 Hrs




43

UNIT – 6 9Hrs





TEXT BOOK:


Hill, 2004

REFERENCES:






2006.

44





Course Outcomes

















Constellations,






45





DM,.








TEXT BOOKS:




REFERENCE BOOKS:


46



Designation: CORE


Course outcome





platforms.











8hours








Parameters.

9hours

47











Part-B








9hours


















48



8hours

Laboratory Work:










TEXT BOOK:



Pearson, 2001.

49





Course Outcome






















50


9hours











TEXT BOOKS:



REFERENCE BOOKS:




51







1. Identify common network security vulnerabilities/attacks





communication.







Practices;










RFCs;


52












TEXT BOOKS:





REFERENCE BOOKS:


53






Course outcomes





3. Describe basic algorithms for failure detection, leader elections, broadcast and multicast,


communication


as RPC




6. Analyze the distributed algorithms for locking, synchronization and concurrency

scheduling.








communication,


54








SLC:Ivy.

8hours

TEXT BOOKS:



REFERENCE BOOKS:


2007.



Pearson, 2009.

55



Designation: CORE


COURSE Outcomes

1. Describe the mathematical foundations needed for performance evaluation of computer

systems




systems























9 Hours



56
















Text Book:


Reference Books:


Elsevier, 2003.



57






Course outcomes:
























58



















8hours

Text Book:


Wiley India, 2007.

Reference Books:


2008.

59






Course Outcome






SAN



for virtualization














8hours

60








9hours





Text Book:


2007.

Reference Books:






61






Course Outcomes

1. Explain architect sensor networks for various application setups.


resources.





















Strategies in WSNs.

62

(Chapter 5: 5.1-5.6, Chapter 6: 6.1-6.5)

9 Hours

UNIT-5 Transport Control and Middleware for Wireless Sensor Networks





(Chapter 7: 7.1-7.4, Chapter 8: 8.1-8.4)

9 Hours





(Chapter 9: 9.1-9.5, Chapter 10: 10.1-10.3)

10 Hours

TEXT BOOKS:



REFERENCE BOOKS:




63





Course outcomes








UNIT – 1 9 Hrs






UNIT-2 8 Hrs

Cyber offenses



UNIT-3 9 Hrs







64

UNIT-4 9 Hrs





UNIT-5 8 Hrs



UNIT-6 9 Hrs





TEXT BOOK:


reprint 2013.

REFERENCES:



1



of





2



Vision:




Mission:


computer networks.





3

Program Outcomes

1. Scholarship of Knowledge: Acquire in-depth knowledge of specific discipline or professional area, including wider and global perspective, with an ability to discriminate, evaluate, analyse and synthesise existing and new knowledge and integration of the same for enhancement of knowledge.

2. Critical Thinking: Analyse complex engineering problems critically, apply independent judgement for synthesizing information to make intellectual and / or creative advances for conducting research in a wider theoretical, practical and policy context.

3. Problem Solving: Think laterally and originally, conceptualise and solve engineering problems, evaluate a wide range of potential solutions for those problems and arrive at feasible, optional solutions after considering public health and safety, cultural, societal and environmental factors in the core areas of expertise.

4. Research Skill: Extract information pertinent to unfamiliar problems through literature survey and experiments, apply appropriate research methodologies, techniques and tools, design and conduct experiments, analyse and interpret data, demonstrate higher order skill and view things in a broader perspective, contribute individually / in group(s) to the development of specific/ technological knowledge in one or more domains of engineering.

5. Usage of Modern Tools: Create, select, learn and apply appropriate techniques, resources and modern engineering and IT tools, including prediction and modeling, to complex engineering activities with an understanding of the limitations.

6. Collaborative and Multidisciplinary Work: Possess knowledge and understanding of group dynamics, recognize opportunities and contribute positively to collaborative-multidisciplinary scientific research, demonstrate a capacity for self-management and teamwork, decision-making based on open-mindedness, objectivity and rational analysis in order to achieve common goal and further the learning of themselves as well as others.

7. Project Management and Finance: Demonstrate knowledge and understanding of engineering and management principles and apply the same to one’s own work, as a member and leader in a team, manage projects efficiently in respective disciplines and multidisciplinary environments after consideration of economical and financial factors.

8. Communication: Communicate with the engineering community, and with society at large, regarding complex engineering activities confidently and effectively, such as, being able to comprehend and write effective reports and design documentation by adhering to appropriate standards, make effective presentations and give and receive clear instructions.

9. Life-long Learning: Recognise the need for, and have the preparation and ability to engage in life-long learning independently, with a high level of enthusiasm and commitment to improve knowledge and competence continuously.

10. Ethical Practices and Social Responsibility: Acquire professional and intellectual integrity, professional code of conduct, ethics of research and scholarship, consideration of the impact of research outcomes on professional practices and an understanding of responsibility to contribute to the community for sustainable development of society.

11. Independent and Reflective Learning: Observe and examine critically the outcomes of one’s actions

and make corrective measures subsequently, and learn from mistakes without depending on extern

feedback.

4


M. TECH COMPUTER NETWORK ENGINEERING - I SEMESTER

Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P



Networks

CSE/ISE 4 0 2 5


Security

CSE/ISE 4 2 0 5


4 0 0 4


4 2 0 5


Total

Credits 23 6 4 29


5


M. TECH COMPUTER NETWORK ENGINEERING - II SEMESTER


Sl.

No

Subject

Code Subject

Teaching

Dept.


Credits L T P

1 MCN0537 Cyber Crime and Digital

forensic

CSE/ISE 4 2 0 5






Total

Credits 24 6 4 29


6


M. TECH COMPUTER NETWORK ENGINEERING - III SEMESTER



Teaching Hours/

Week Credits

L T P





a seminar)

- - - 4






seminar)

- - - 8


topic - - - 2

Total Credits 14

7


M. TECH COMPUTER NETWORK ENGINEERING - IV SEMESTER



Teaching Hours/

Week Credits

L T P








- - - 28

Total Credits 28

Core Courses 38

Elective Courses 20


Major Project 28

T O T A L 100

8


M. TECH COMPUTER NETWORK ENGINEERING - ELECTIVE COURSES


Sl.No Subject

Code Subject

Teaching Hours/

Week Credits

L T P



programming

4 2 0 5


4 MCN0506 Optical Networks 4 0 2 5


Systems

4 2 0 5







Analysis

4 2 0 5



Networks

4 2 0 5



9





29 MCN0530 Cyber enabled distributed


discovery

4 2 0 5

30 MCN0534 Distributed Computing 4 2 0 5

10


SubCode: MCN0531

Designation: Core


COURSE OUTCOMES



2. Discuss the working of routing protocols.

3. Apply the knowledge of Multicast Routing in Ad hoc Wireless Networks and

solve problems.

4. Compare different Transport Layer and Security Protocols for Ad hoc

Networks..

5. Solve the Energy Management issues by applying the knowledge of energy

management

6. Provide the necessary security to Wireless Adhoc Networks using security

protocols.

UNIT-1

Ad hoc Wireless Networks: Introduction, Issues in Ad hoc Wireless Networks,

Ad hoc Wireless Internet; MAC Protocols for Ad hoc Wireless Networks:

Introduction, Issues in Designing a MAC Protocol, Design Goals of MAC

Protocols, Classification of MAC protocols, Contention-Based Protocols,

Contention-Based Protocols with Reservation Mechanisms, Contention-Based

Protocols with Scheduling Mechanisms,


10 Hours

UNIT-2

Routing Protocols for Ad Hoc Wireless Networks:Introduction, Issues in

Designing a Routing Protocol for Ad hoc Wireless Networks; Classification of

11

Routing Protocols; Table Driven Routing Protocols: Destination Sequenced

Distance-Vector Routing Protocol, Cluster-Head Gateway Switch Routing

Protocol; On-Demand Routing Protocols: Dynamic Source Routing Protocol, Ad

Hoc On-Demand Distance-Vector Routing Protocol, Location-Aided Routing,

Associativity-Based Routing, Hybrid Routing Protocols: Zone Routing Protocol,

Hierarchical Routing Protocols: Hierarchical State Routing Protocol


10 Hours

UNIT-3

Multicast Routing in Ad hoc Wireless Networks: Issues in Designing a

Multicast Routing Protocol, Operation of Multicast Routing Protocols, An

Architecture Reference Model for Multicast Routing Protocols, Classifications of

Multicast Routing Protocols, Tree-Based Multicast Routing Protocols: Bandwidth-

Efficient Multicast Routing Protocol, Preferred Link-Based Multicast Protocol,

SLC:Mesh-Based Multicast Routing Protocols: On-Demand Multicast Routing

Protocol, Core-Assisted Mesh Protocol.

9 Hours

UNIT-4

Transport Layer and Security Protocols for Ad hoc Networks: Introduction,

Issues in Designing a Transport Layer Protocol; Design Goals of a Transport Layer

Protocol; Classification of Transport Layer Solutions; TCP over Transport Layer

Solutions: Why Does TCP Not Perform Well in Ad Hoc Wireless, TCP with

Explicit Link Failure Notification, TCP-Bus, Split TCP, A Comparison of TCP

Solutions for Ad Hoc Wireless Networks; Security in Ad hoc Wireless Networks,

Issues and Challenges in Security Provisioning, Network Security Attacks:

Transport Layer Attacks, Application Layer Attacks, Other Attacks; Key

Management: Symmetric Key Algorithms, Asymmetric Key Algorithms, Key

Management Approaches.

12

SLC:Secure Touting Ad hoc Wireless Networks: Security-Aware Ad Hoc Routing

Protocol, Security-Aware AODV Protocol.

9 Hours

UNIT-5

Quality of Service and Energy Management in Ad hoc Wireless Networks

Introduction, Issues and Challenges in Providing QoS in Ad hoc Wireless

Networks, Classification of QoS Solutions, MAC Layer Solutions: IEEE 802.11e,

DBASE, Network Layer Solutions: Ticket-Based Qos Routing Protocol,

Bandwidth Routing Protoicol, On-Demand QoS Routing Protocol ;

SLC: Relevant Case study. 7Hours

UNIT-6

Energy Management in Ad hoc Wireless Networks: Introduction, Need for

Energy Management in Ad hoc Wireless Networks, Classification of Energy

Management Schemes, Battery Management Schemes, Transmission Management

Schemes,


7Hours

LABORATORY WORK

Note: Standard Network Parameters and supporting protocols may be

assumed for simulation. Any suitable network simulator may be used.

(Preferably NS2 or NS3 Simulator)

1. Develop unicast routing protocols using any suitable Network Simulator for

(Mobile Ad hoc Networks) MANET to find the best route using the any one of

routing protocols from each category from table-driven (e.g., link state or DSDV)

on demand (e.g., DSR, AODV, TORA), hybrid (e.g., ZRP, contact-based

architectures) and hierarchical (e.g., cluster based.) The efficient path/route should

be established for source and destination data transmission using routing protocols.

13

Understand the advantages and disadvantages of each routing protocol types by

observing the performance metrics of the routing protocol. In that way the best

application/environment suitable routing protocol can be identified in each

category.

2: Develop multicast routing protocols using any suitable Network Simulator for

MANET in which session nodes are connecting through either tree(MAODV,

MCEDAR) or mesh (ODMRP,CAMP, FGMP) structure. Analyze the performance

metrics of multicast routing protocols with unicast routing protocols.

3. Develop MAC Protocol using any suitable Network Simulator for MANETs to

send the packet without any contention through wireless link using the following

MAC protocols; (CSMA/CA (802.11), MACA, MACAW, PAMAS, SMAC).

Analyze its performance with increasing node density and mobility.

4. Develop and Analyze the performance of TCP connection when it is used for

wireless networks. You will find performance of TCP decreases dramatically when

a TCP connection traverses a wireless link on which packets may be lost due to

wireless transmission errors. Make use of Active Queue Management Technique to

control congestion on Wireless Networks. Evaluate the performance of FIFO, RED

and WFQ over wireless networks using suitable Network Simulator.

5. Simulate MANET environment using suitable Network Simulator and test with

various mobility model such as Random way point, group mobility, highway

model, Manhattan model, hybrid models) (Spatial correlation, temporal

correlation, relative speed, link durations). Analyze throughput, PDR and delay

with respect to different mobility models.

TEXT BOOK:

1. C. Siva Ram Murthy & B. S. Manoj: Ad hoc Wireless Networks, 2nd Edition,

Pearson Education, 2011

REFERENCES:

1. Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John

Wiley, 2007.

14

2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking,

Kluwer Academic Publishers, 2004.

15


SubCode: MCN0532

Designation: Core


COURSE OUTCOMES

1. Explain the basics of Computer Networks.






UNIT-1 Foundation






T1:Ch 1.1, 1.2, 1.5.1, 1.5.2., 2.1, 2.5 T2:Ch 4 9Hours











SLC: Mobile IP


16







T1: Chap 5.1, 5.2.1 to 5.2.8, 6.2, 6.3 7Hours






LABORATORY WORK





















17

Text books:





References:


PHI


18



Designation: Core


Course Outcomes:

1. Explain the fundamentals of Cryptography


authenticity.















07 Hours











9 Hours

19














9 Hours














10 Hours












10 Hours

20

LABORATORY WORK










server.


VLAN [subnetting].


Text Books:


References


21



Designation: CORE


Course outcomes









6. Solve problems using pigeon-hole principle.continuous probability distributions. Obtain


Unit-1 : Relations



Unit-2 : Functions



Unit-3 : Graph Theory




flow problems.

22

Unit-4 : Probability



Unit-5 : Statistical Inference



Unit-6 : Joint Distribution and Markov Chains



distributions)








23





Course Outcomes:








UNIT – 1 9 Hrs






UNIT-2






UNIT-3

Data recovery 9 Hrs



24

UNIT-4 9 Hrs






UNIT-5 8 Hrs





UNIT-6 9 Hrs





TEXT BOOKS:



REFERENCE BOOKS:




2013.

25

CLOUD COMPUTING

SubCode: MCN0515

Designation: Core


Course Outcomes








Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud

vulnerabilities, Cloud computing at Amazon, Cloud computing the Google perspective,

Microsoft Windows Azure and online services, Open-source software platforms for private

clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service

level agreements, User experience and software licensing. Exercises SLC: problems.

10 Hours


Challenges of cloud computing, Architectural styles of cloud computing, Workflows:

Coordination of multiple activities, Coordination based on a state machine model: The

Zookeeper, The Map Reduce programming model, A case study: The GrepTheWeb application ,

Cloud for science and engineering, High-performance computing on a cloud, SLC:Cloud

computing for Biology research, Social computing, digital content and cloud computing.

9 Hours


Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines,

Performance and Security Isolation, Full virtualization and paravirtualization, Hardware support

for virtualization, Case Study:Xen a VMM based paravirtualization, Optimization of network

virtualization, vBlades, Performance comparison of virtual machines, SLC:The dark side of

virtualization, Exercises and problems.

10 Hours


Policies and mechanisms for resource management, Application of control theory to task

scheduling on a cloud, Stability of a two-level resource allocation architecture, Feedback control

based on dynamic thresholds, Coordination of specialized autonomic performance managers, A

utility-based model for cloud-based Web services, Resourcing bundling: Combinatorial auctions

26

for cloud resources, Scheduling algorithms for computing clouds, Fair queuing, Start-time fair

queuing, Borrowed virtual time, Cloud scheduling subject to deadlines, Scheduling Map Reduce

applications subject to deadlines SLC:Resource management and dynamic scaling, Exercises

and problems.

9Hours


Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact

assessment, Trust, Operating system security, Virtual machine Security, Security of

virtualization, Security risks posed by shared images, Security risks posed by a management OS,

A trusted virtual machine monitor, Amazon web services: EC2 instances, Connecting clients to

cloud instances through firewalls, Security rules for application and transport layer protocols in

EC2, How to launch an EC2 Linux instance and connect to it SLC:How to use S3 in java,

8 Hours

UNIT-6 Cloud-based simulation of a distributed trust algorithm, A trust management service, A

cloud service for adaptive data streaming, Cloud based optimal FPGA synthesis SLC:Exercises

and problems.

6Hours

Text Book:


REFERENCES:



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

Management and Security, CRC Press 2013.

27


SubCode: MCN0518

Designation: Core


Course Outcome











of protocol



UNIT-1. Introduction, Error Control, Flow Control: Communication model, Communication






UNIT-2. Network Reference Model: Layered Architecture, Network Services and Interfaces,




UNIT-3. Protocol Specification: Components of specification, Service specification,


28




UNIT-4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient



















UNIT-6 Protocol Synthesis+ and Implementation: Synthesis methods, Interactive Synthesis




SLC: SDL and CVOPS.

9hours

29

TEXT BOOKS:


2004.

REFERENCE BOOKS:


30



Designation: CORE


Course Outcomes:



data types etc.,




M2 interface























31































Management


9hours

32

TEXT BOOKS:


Education, 2010.



33

Course outcomes of MTECH(CNE) III semester

Industrial Training (MCN0402)

Course Outcomes

1. Ability to analyse a given engineering problem, identify an appropriate

Problem solving methodology , implement the methodology and propose

a meaningful solution.

2. Ability to apply prior acquired knowledge in problem solving.

3. Ability to manage a project within a given time frame.

4. Ability to take engineering decision.

Project-work – Phase -I (MCN0801)

Course Outcomes


1. Identify the different areas of interest feasible to the project group.

2. Formulate the problem and perform problem analysis.

3. Develop the design methods to solve the identified problems.

Subject Seminar(MCN0201)

Course Outcomes On Successful completion of the course, the students will be able to:

1. Recognize relevance of the topic chosen

2. Explain current real world issues by doing literature survey

3. Identify the depth of the topic

4. Prepare presentations to convey the essence of the topic clearly.

5. Justify the comments and questionnaires from audience.

34

Course outcomes of MTECH (CNE) IV semester

Project Work Phase- II (MCN2801)

Course Outcomes


1. Implement the proposed design of phase- I.

2. Compute the results obtained from the implementation.

3. Validate the obtained results using various test cases.

4. Demonstrate and present the project.

5. Prepare the report of the project work.

35

ELECTIVES

36

ADVANCED ALGORITHMS

Subject Code: MCN05XX

Designation: CORE


COURSE Outcomes

1. Explain the graph search algorithms.

2. Describe hill climbing and dynamic programming design techniques.

3. Develop recursive backtracking algorithms.

4. Explain NP completeness and randomized algorithms.

5. Design probabilistic and randomize algorithms.

6. Explain polynomials.















10 Hours




37

TEXT BOOKS:




REFERENCE BOOKS:


Edition,


38



Designation: CORE


Course Outcomes

1. Explain the recent trends in the field of Computer Architecture and identify



3. Describe the different types of multi core architectures



6. Analyze the fundamentals of parallel programming.










7 Hours













39








9 Hours









Text Book



40


SubCode: MCN0536



Course Outcomes:

1. Explain the Multimedia Communication Models








10 Hours






7Hours



9 Hours





41

TEXT BOOKS:



REFERENCE BOOKS:







42





Course Outcomes:




4. Describe the WDM



Part-A

UNIT-1 Introduction, Telecommunications Infrastructure, Characteristics of Optical


TDM; The Optical Marketplace; Key Optical Nodes; Other Key Terms; Evolution of Optical

Systems; Key attributes of Optical Fiber, The Local Connections; The Backbone Connections;

The Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3;

The Layered Protocol Model in the Transport Network; considerations for Interworking Layer1,

Layer 2, and Layer 3 Networks, The Basics; The Wavelength; The Basic Components; Structure

of the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier

Spontaneous Emission; Chromatic Dispersion;.

SLC: Wireless Optical Systems, Lasers 9 Hours

UNIT-2 Timing and Synchronization, SONET and SDH: Timing and Synchronization in








43


































44


Interworking;


TEXT BOOKS:


REFERENCE BOOKS:





45





Course Outcome:






5. Explain IPS


UNIT – 1 9 Hrs




UNIT - 2 8 Hrs



UNIT - 3 9 Hrs

Tcpdump:




UNIT – 4 7 Hrs

ARCHITECTURE:


UNIT - 5 10 Hrs




46

UNIT – 6 9Hrs





TEXT BOOK:


Hill, 2004

REFERENCES:






2006.

47





Course Outcomes

















Constellations,






48





DM,.








TEXT BOOKS:




REFERENCE BOOKS:


49



Designation: CORE


Course outcome





platforms.











8hours








Parameters.

9hours

50











Part-B








9hours


















51



8hours

Laboratory Work:










TEXT BOOK:



Pearson, 2001.

52





Course Outcome






















53


9hours











TEXT BOOKS:



REFERENCE BOOKS:




54







1. Identify common network security vulnerabilities/attacks





communication.







Practices;










RFCs;


55












TEXT BOOKS:





REFERENCE BOOKS:


56






Course outcomes





3. Describe basic algorithms for failure detection, leader elections, broadcast and multicast,


communication


as RPC




6. Analyze the distributed algorithms for locking, synchronization and concurrency

scheduling.








communication,


57








SLC:Ivy.

8hours

TEXT BOOKS:



REFERENCE BOOKS:


2007.



Pearson, 2009.

58



Designation: CORE


COURSE Outcomes

1. Describe the mathematical foundations needed for performance evaluation of computer

systems




systems























9 Hours



59
















Text Book:


Reference Books:


Elsevier, 2003.



60






Course outcomes:
























61



















8hours

Text Book:


Wiley India, 2007.

Reference Books:


2008.

62






Course Outcome






SAN



for virtualization














8hours

63








9hours





Text Book:


2007.

Reference Books:






64






Course Outcomes

1. Explain architect sensor networks for various application setups.


resources.





















Strategies in WSNs.

65

(Chapter 5: 5.1-5.6, Chapter 6: 6.1-6.5)

9 Hours

UNIT-5 Transport Control and Middleware for Wireless Sensor Networks





(Chapter 7: 7.1-7.4, Chapter 8: 8.1-8.4)

9 Hours





(Chapter 9: 9.1-9.5, Chapter 10: 10.1-10.3)

10 Hours

TEXT BOOKS:



REFERENCE BOOKS:




66





Course outcomes








UNIT – 1 9 Hrs






UNIT-2 8 Hrs

Cyber offenses



UNIT-3 9 Hrs







67

UNIT-4 9 Hrs





UNIT-5 8 Hrs



UNIT-6 9 Hrs





TEXT BOOK:


reprint 2013.

REFERENCES:



68

DISTRIBUTED COMPUTING

Sub Code: MCN0534


Credit: 05 Contact Hours: 04+2 Type-of-Delivery:4-0-2-0

Course Outcomes:

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

1. Compare Load Balancing and Load Sharing

2. Identify the Basic concept of DSM, Hardware DSM

3. Summarize advantages of DFS

4. Outline mechanisms to manage security in DS

5. Choose appropriate real-time scheduling

6. Identify the emerging trends in DS

UNIT I

Distributed System management: Introduction, Resource management, Task Assignment

Approach, Load-Balancing Approach, Load-Sharing Approach, Process management in a

Distributed Environment, Process Migration, Threads.

SLC: Fault Tolerance. 08 hours

UNIT II

Distributed Shared Memory:Introduction, Basic Concepts of DSM, Hardware DSM, Design

Issue in DSM Systems, Issue in Implementing DSM Systems.

SLC: Heterogeneous and Other DSM Systems, Case Studies. 09 hours

UNIT III

Distributed File System: Introduction to DFS, File Models, Distributed File System Design,

Semantics of File Sharing, DFS Implementation, File Caching in DFS, Replication in DFS, Case

studies. Naming: Introduction, Desirable features of a good naming system, Basic concepts,

System-oriented names, Object-locating mechanisms, Issues in designing human-oriented

names, Name caches, Naming and security.

SLC: Case study: Domain name service. 10 hours

UNIT IV

Security in distributed systems: Introduction, Cryptography, Secure channels, Access control,

Security Management.

SLC: Case studies. 07 hours

UNIT V

Real-Time Distributed operating Systems: Introduction, Design issues in real-time distributed

systems, Real-time communication, Real-time scheduling,

SLC: Case study: Real-time communication in MARS. 08 hours

69

UNIT VI

Emerging Trends in distributed Computing: Introduction to emerging trends, Grid Computing,

SOA, Cloud computing.

SLC: The future of emerging Trends. 08 hours

Text Book.

1. SunithaMahajan, Seema Shah: Distributing Computing, Published by Oxford University

press 2010

Hands-on:

LIST OF EXPERIMENTS:

Note: Use appropriate tools/language to implement the following experiment:

1. Design and implement client server application using RMI (Remote Method Invocation) to

invoke a service to calculate the income tax.

2. Design and implement EJB (Entity Java Beans) session bean business logic to calculate

income tax and invoke the service using stub, i.e., client side proxy object.

3. Design and implement an EJB entity bean to persist the client submitted data into an enterprise

information system.

4. Design and implement an offline database communication system using JMS (Java Message

Service) to service the client request.

5. Design and implement the client code to call the Micro soft service like free service from

UDDI (Universal Description Discovery Protocol).

6. Design and implement business logic and bind it as service using SOAP (Simple Object

Access Protocol), also implement client to call service. NOTE: Use EJB 3.X or any equivalent

tool.