M. Tech Information Technology (Network Engineering)

Kerala Technological University

M. Tech Information Technology (Network Engineering) Scheme of Instruction & Syllabus : 2015 Admissions

Compiled By

Rajiv Gandhi Institute of Technology, Kottayam July 2015

2 Kerala Technological University|Cluster 04 | M. Tech Program in (Network Engineering)

Kerala Technological University

(Kottayam/Idukki Cluster)

M. Tech Program in Information Technology (Network Engineering)

Scheme

Credit requirements : 67 credits (22+19+14+12)

Normal Duration : Regular: 4 semesters; External Registration: 6 semesters;

Maximum duration : Regular: 6 semesters; External Registration: 7 semesters.

Courses: Core Courses: Either 4 or 3 credit courses; Elective courses: All of 3 credits

Allotment of credits and examination scheme:-

Semester 1 (Credits: 22)

Exam Slot

Course No: Name L- T - P Internal Marks

End Semester Exam

Credits

Marks Duration (hrs)

A 04 IT 6101 Theoretical Foundations in

computer Networking

4-0-0 40 60 3 4

B 04 IT 6103 Design and Analysis of

Networks

4-0-0 40 60 3 4

C 04 IT 6105 Computer Network

Management

3-0-0 40 60 3 3

D 04 IT 6107 Wireless & Mobile Networks 3-0-0 40 60 3 3

E 04 IT 6XXX* Elective - I 3-0-0 40 60 3 3

04 GN 6001 Research Methodology 0-2-0 100 0 0 2

04 IT 6191 Seminar - I 0-0-2 100 0 0 2

04 IT 6193 Network Programming Lab 0-0-2 100 0 0 1

Total 23 22

*See List of Electives-I for slot E

List of Elective - I Courses

Exam Slot

Course No. Course Name

E 04 IT 6109 Internet and Web Technology

E 04 IT 6111 Virtualization Techniques

E 04 IT 6113 High Performance Networks

E 04 IT 6115 Multimedia and Rich Internet Applications



Exam Slot


End Semester Exam

Credits


A 04 IT 6102 Web Security 3-1-0 40 60 3 4

B 04 IT 6104 Advanced Distributed Systems 3-0-0 40 60 3 3

C 04 IT 6106 Software Defined Networks 3-0-0 40 60 3 3

D 04 IT 6XXX* Elective - II 3-0-0 40 60 3 3

E 04 IT 6XXX^ Elective - III 3-0-0 40 60 3 3

04 IT 6192 Mini Project 0-0-4 100 0 0 2

04 IT 6194 Network Simulation Lab 0-0-2 100 0 0 1

Total 22 19 *See List of Electives -II for slot D ^See List of Electives -III for slot E

List of Elective - II Courses

Exam Slot

Course Code

Course Name

D 04 IT 6108 Protocol Engineering

D 04 IT 6112 High-Performance Scientific Computing

D 04 IT 6114 Performance Evaluation of Computer Networks

D 04 IT 6116 Networking in Embedded Systems

List of Elective - III Courses

Exam Slot

Course Code

Course Name

E 04 IT 6118 Internet Routing Design

E 04 IT 6122 Enterprise Storage Architecture

E 04 IT 6124 Complex Networks

E 04 IT 6126 Distributed Algorithms

Summer Break Exam Slot


End Semester Exam

Credits


NA 04 IT 7190 Industrial Training/Mini Project 0-0-4 NA NA NA Pass /Fail

Total 4 0



Exam Slot


End Semester Exam

Credits


A 04 IT 7XXX* Elective - IV 3-0-0 40 60 3 3

B 04 IT 7XXX^ Elective - V 3-0-0 40 60 3 3

04 IT 7191 Seminar - II 0-0-2 100 0 0 2

04 IT 7193 Project (Phase - I) 0-0-12 50 0 0 6

Total 20 14 *See List of Electives-IV for slot A ^See List of Electives-V for slot B

List of Elective - IV Courses

Exam Slot

Course Code Course Name

A 04 IT 7101 Engineering Mobile Applications

A 04 IT 7103 Agent Based Intelligent Systems

A 04 IT 7105 Social Network Analysis

A 04 IT 7107 Big Data Analytics

List of Elective - V Courses

Exam Slot

Course Code Course Name

B 04 IT 7109 Network Forensics

B 04 IT 7111 Datacenter Virtualization

B 04 IT 7113 Geo Spatial Information Management

B 04 IT 7115 Converged Networks


Exam Slot


External Evaluation

Marks

Credits

NA 04 IT 7194 Project (Phase -II) 0-0-21 70 30 NA 12

Total 21 12

Total: 67

14


COURSE CODE COURSE NAME L-T-P-C YEAR

04 IT 6101 Theoretical Foundations in Computer Networking 4-0-0:4 2015

Pre-requisites: Nil

Course Objectives:

• To inspire the students with interest, excitement, and urge to learn the subject of theoretical

foundations in computer networking

• To understand the fundamental concepts in networking

• To introduce the purpose of learning important subjects in networking for meeting the

requirement of various professional field applications

Syllabus

Course Outcome: The student will demonstrate the ability to understand the basic concepts of

foundation of computer network

Text Books:

1. John Clark and Derek Allan Holton, “A first look at Graph Theory”, World Scientific, 1991.

2. Balakrishnan R. and Ranganathan K, “A text book of Graph Theory” Spring Verlag, 2000.

References:

1. Harary F., “Graph Theory” Perseus Books, 1994.

2. Rosen K.H, “Elementary Number Theory”, 6th Ed, Addison-Wesley, 2010.

3. Dudley U., “A guide to elementary number theory”, The mathematical association of

America, 2004 .

4. Andrews G. E. “Number Theory”, Dover Publications, 1971.

5. Bose R., “Information Theory Coding and Cryptography” , Tata Mc Graw Hill, 2007.

6. Roth R.M, “Introduction to Coding Theory”, CUP, 2006.

7. MacWilliams F.J, Sloane N.J.A., “The Theory of Error Correcting Codes”, North Holland, 1977.

8. Paneerselvam R., Operations Research, Prentice Hall of India Private Limited, New Delhi 2004.

9. Ravindra K. Ahuja, Thomas L. Magnanti, James B.Orlin, “Network Flows – Theory,

10. Algorithms and Applications”, 1st Edition, Prentice Hall, 1993.


COURSE PLAN

COURSE CODE COURSE TITLE CREDIT

04 IT 6101 Theoretical Foundations in Computer Networking

4-0-0:4

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Graph, First theorem of Graph Theory, regular graph, subgraph, Paths, Cycles,

Matrix representation, Trees, Bridges, Theorems, spanning trees, Directed

graphs, Indegree and Outdegree

8 15

MODULE : 2

Euclidean Algorithm, Fundamental Theorem of Arithmetic and Applications,

Dirichlet Progressions, Irrational Numbers, Fermat Factorization, Linear

Diophantine Equations, Congruence, Linear Congruence

9 15

FIRST INTERNAL TEST (MODULE 1 & 2)

MODULE : 3

Chinese Remainder Theorem, Wilson's and Fermat's Little Theorem, Euler's

Theorem, Properties of the Euler Phi Function. The Binary Symmetric Channel,

Error Correction, Error Detection, Linear Codes, Representation Through

Generator and Parity-Check Matrices, Syndrome Decoding

10 15

MODULE : 4

Hamming Codes, Introduction to Finite Fields and Double-Error Correcting

Codes, Irreducible Polynomials, Primitivity, Singleton Bound, MDS Codes,

Hamming Sphere, Packing Bound, Perfect Codes.

10 15

SECOND INTERNAL TEST (MODULE 3 & 4)

MODULE : 5

Shortest Path Model, Systematic Method, Dijikstra’s Algorithm, Floyd’s

Algorithm, Minimum Spanning Tree Problem, Prim Algorithm, Kruskal’s

Algorithm, Maximal Flow Problem,

10 20

MODULE : 6

Physical methods: Solid-state sintering, Grain growth, Arc method,

Ion-beam induced nanostructures, Grinding, High energy ball milling,

Material-ball ratio, Control of grain size in the above methods, Laser ablation

methods.

9 20



04 IT 6103 Design& Analysis of Networks 4-0-0:4 2015

Pre-requisites: Nil

Course Objectives:

• To inspire the students to learn the subject of theoretical foundations in computer networking

• To understand the fundamental concepts in design of networking

• To introduce the purpose of analysing different concept of network and routing protocols

Syllabus

Course Outcome: The student will understand the concept of designing of networks and its protocol

Text Books:

1. The Internet and Its Protocols - A Comparative Approach by ADRIAN FARREL, Elsevier

2. Computer Networks – A Systems Approach by Larry L. Peterson and Bruce S. Davie, The Morgan

Kaufmann Series in Networking

References:

1. Data networks by D.Berteskas and R Gallagar, Printice Hall

2. Design and Analysis of Communication Networks By V Ahuja , McGraw Hill

3. Kerchenbaum A., “Telecommunication Network Design Algorithms”, Tata McGraw Hill

4. James D.McCabe, Network analysis, Architecture and Design, 2nd Edition, Elsevier, 2003.

5. Bertsekas&Gallager, Data Networks, second edition, Pearson Education, 2003.

6. Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press, New York,

2003.

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

Elsevier, 2003.

8. Thomas G. Robertazzi, “Computer Networks and Systems Queuing Theory and Performance

Evaluation” 3rd Edition Springer, 2000.

9. An Engineering approach to computer Networking by S.Keshav, Pearson education

10. Network Algorithms by George Varghese, Morgan Kaufmann.


COURSE PLAN


04 IT 6103 Design& Analysis of Networks 4-0-0:4

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Internet Protocol: IPv4-IP Datagram Formats - Data and Fragmentation -

Address Masks, Prefixes, and Sub networks Network Address Translation

(NAT) IP Switching and Routing - Local Delivery and Loopbacks - Address

Resolution Protocol Route Control and Recording

9 15

MODULE : 2

ICMP - Discovering Routers - Path MTU Discovery – Multicast - IP Version

Six,Routing and Forwarding – CIDR - Building and Using a Routing Table -

Router IDs, Numbered Links, and Unnumbered Links - Distributing

Routing Information.

8 15


MODULE : 3

Distance Vectors - Link State Routing - Path Vectors and Policies -

Computing Paths– Routing Information Protocol OSPF - OSPF –

Intermediate System to Intermediate System - Border Gateway Protocol -

Multicast Routing - Inter-Gateway Routing Protocol - Inter-Domain

Routing Protocol

11 15

MODULE : 4

End-to-End Protocols : Ports and Addresses - User Datagram Protocol -

UDP Message Format - Transmission Control Protocol - Segment Format -

Connection Establishment and Termination - Flow Control Triggering

Transmission - Silly Window Syndrome - Nagle’s Algorithm - Adaptive

Retransmission

9 15


MODULE : 5 Karn/Partridge Algorithm - Remote Procedure Call – BLAST – CHAN – SELECT – SunRPC- Stream Control Transmission Protocol - Real-time Transport Protocol,Congestion Control : Packet-Switched Network - Connectionless Flows - Issues in Resource Allocation - Fair Resource Allocation - Queuing Disciplines – FIFO - Fair Queuing - TCP Congestion Control - Additive Increase/Multiplicative Decrease - Slow Start

11 20

MODULE : 6 Fast Retransmit and Fast Recovery - Congestion-Avoidance Mechanisms – DECbit - Random Early Detection - Source-Based Congestion Avoidance – Tahoe, Reno, and Vegas- QoS Application Requirements - Real-Time Audio - Taxonomy of Real-Time Applications - Approaches to QoS Support

8 20



04 IT 6105 Computer Network Management 3-0-0: 3 2015

Pre-requisites: Nil Course Objectives:

1. To inspire the students with interest, excitement in the area of management of networks. 2. To understand the fundamental concepts of SNMP,RMON

Syllabus Course Outcome:

The students will get clear idea of managed object, SNMP, Remote monitoring etc. It also experiences how to manage the network.

Text Books: 1. Mani Subrahmanian, “Network Management, Principles and Practice”, Pearson Education 2. Morris, “Network management”, Pearson Education

References:

1. Mark Burges, Wiley Dreamtech, “Principles of Network System Administration”. 2. John Wiley, “Distributed Network Management”.

COURSE PLAN


04 IT 6105 Computer Network Management 3-0-0:3

MODULES Contact

Hours

Sem.Exam

Marks;%

MODULE : 1

Basic Foundations: Review of TCP/IP protocol stack , 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

8 15

MODULE : 2

SNMPv1 Network Management: 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 Model – The SNMP Architecture, Administrative Model,

SNMP Specifications, SNMP Operations, SNMP MIB Group, Functional

6 15


Model


MODULE : 3

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.

6 15

MODULE : 4

Broadband Network Management: 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.

6 15

SECOND INTERNAL TEST(MODULE 3 & 4)

MODULE : 5

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. Hamming Codes, Introduction to

Finite Fields and Double-Error-Correcting Codes ,Irreducible Polynomials,

Primitivity, Singleton Bound, MDS Codes, Hamming Sphere.

6 20

MODULE : 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.

10 20



04 IT 6107 Wireless & Mobile Networks 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

1. To inspire the students with the newly emerging concept in the area of wireless and mobile

networks.

2. To understand the fundamental concepts in wireless networks.

Syllabus

Fundamental concepts and overview; Fluid statics ; Basic equations in integral form; Basic

equations in differential form ; Dimensional analysis and similitude; Internal flow of incompressible and

viscous fluid ; External flow of incompressible and viscous fluids ;Fluid machines and design project.

Course Outcome:

The students will get an over view of mobile network and sensor networks.

Text Books:

1. Ian F. Akyildiz and Mehmet Can Vuran, Wirless Sensor Networks, Wiley.

2. Siva Ram Murthy C. andManoj B. S., “Ad Hoc Wireless Networks: Architectures and Protocols”,

2nd Edn. Pearson Education 2005

References:

1. Imielinski T. and Korth H.F., “Mobile Computing”, Kluwer Academic Publishers, 1996

2. William Stallings, “Wireless Communications and Networks”, Prentice Hall, 2004.

3. Clint Smith. P.E., and Daniel Collins, “3G Wireless Networks”, 2nd Edition, Tata McGraw Hill,

2007.

4. Carlos de MoraisCordeiro and Dharma Prakash Agrawal, “Ad Hoc & Sensor Networks: Theory

and Applications”, World Scientific, 2007.

5. Toh C. K., “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall, PTR, 2001.

6. Yi-Bing and ImrichChlamtac, “Wireless and Mobile Networks Architectures”, John Wiley & Sons,

2001.

7. Vijay. K. Garg, “Wireless Communication and Networking”, Morgan Kaufmann Publishers,

8. KavethPahlavan,. K. PrashanthKrishnamuorthy, "Principles of Wireless Networks", Prentice Hall

of India, 2006

9. Fie Hu, Xiaojun Cao, Wireless Sensor Networks – Principles and Practice, CRC Press


COURSE PLAN


04 IT 6107 Wireless & Mobile Networks 3-0-0:3

MODULES Contact

Hours

Sem.Exa

m

Marks;%

MODULE : 1

Introduction to wireless LANs - IEEE 802.11 WLANs - Physical Layer-

MAC sub layer-MAC Management Sub layer- Wireless ATM HIPERLAN-

HIPERLAN-2, WiMax, Wireless Local Loop (WLL). Migration path to UMTS,

UMTS Basics, Air Interface, 3GPP Network Architecture, CDMA2000

overview- Radio and Network components, Network structure.

8 15

MODULE : 2

4G features and challenges, Technology path, IMS Architecture,

Convergent Devices, 4G technologies, Advanced Broadband Wireless

Access and Services. Introduction to Mobile Networks, Heterogeneity in

Mobile Devices, Types of Mobile Communications, Types of Mobile Host

Movements, Challenges Facing Mobile Networks. Introduction to Ad-hoc

Wireless Networks, Overview, MAC Protocols. Issues in Designing a Routing

Protocol for Ad Hoc Wireless Networks.

11 15


MODULE : 3

Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks

Classifications of Routing Protocols, DSDV, WRP, AODV, DSR, TORA.

Introduction to Wireless Sensor Networks, Overview, Characteristics,

Network Applications, Design Objectives, Technological Background.

11 15

MODULE : 4

Wireless Sensor Networks Architecture, Classification, Protocol stack, MAC

Protocols. Routing Protocols – Flat – Architectural Protocols – Hierarchical

Protocols – Geographic Routing Protocols – QoS Based Protocols Time

Synchronization –Localization and Positioning – Topology Management.

9 15


MODULE : 5

Wireless Sensor and Actor Networks – Network Architecture – Sensor Actor

Coordination – Actor Actor Coordination. Wireless Multimedia Sensor

Networks – Network Architecture. Wireless Underwater Sensor Networks .

6 20

MODULE : 6

Network components – Communication Architecture – Basics of Acoustic

Propagation. Wireless Underground Sensor Networks – Applications –

Network Architecture – Communication.

5 20



04 IT 6109 Internet and Web Technology 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

To give the Student:-

1. To understand the fundamental concepts in Web Technologies

2. To learn about SOAP and Web Transactions

Syllabus




Course Outcome:

1. The students will get an idea about Internet and Web Technology

Text Books:

1. B.V.Kumar, S.V.Subrahmanya, Web Services – An Introduction, Tata McGraw-Hill

2. Steve Graham et.al., Building Web Services With Java: Making Sense Of Xml, Soap, Wsdl, And

Uddi, Pearson

3.

References:

1. Michael Havey, Essential Business Process Modeling, O'Reilly Media, Inc.

2. K. Qian, Java Web development illuminated, Jones & Bartlett Learning

3. R. Krishnamoorthy& S. Prabhu, “Internet and Java Programming”, New Age International

Publishers, 2004.

4. Frank. P. Coyle, “XML, Web Services and the Data Revolution”, Pearson Education, 2002.

5. Sandeep Chatterjee and James Webber, "Developing Enterprise Web Services", Pearson

Education, 2004.

6. McGovern, et al., "Java Web Services Architecture", Morgan Kaufmann Publishers, 2005.

7. Deitel, and Nieto, “Internet and World Wide Web – How to program”, Pearson Education

Publishers, 2000.

8. Elliotte Rusty Harold, “Java Network Programming”, O’Reilly Publishers, 2002.

9. Ramesh Nagappan , Robert Skoczylas and Rima Patel Sriganesh, " Developing Java Web

Services", Wiley Publishing Inc., 2004.

10. Guillemo Rauch, Smashing Node.Js: JavaScript Everywhere, John Wiley &Sons .


COURSE PLAN


04 IT 6109 INTERNET AND WEB TECHNOLGIES 3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Web Technology - Web 2.0 technologies, Web services, Web Services

Architecture, Web Services Communication Models, Implementing Web

Services,Evolution and differences with Distributed computing, XML -

Name Spaces - Structuring With Schemas and DTD - Transformation

7 15

MODULE : 2

SOAP- Anatomy of a SOAP Message, SOAP Encoding, SOAP Message

Exchange Model, SOAP Communication, SOAP Messaging, SOAP Bindings

for Transport Protocols, SOAP Security, Building SOAP Web Services,

Developing SOAP Web Services Using Java

5 15


MODULE : 3

WSDL- Anatomy of a WSDL Definition Document, WSDL Bindings, WSDL

Tools

4 15

MODULE : 4

UDDI- UDDI Registries, Programming with UDDI, Implementations of

UDD, Registering as a Systinet, UDDI Registry User ,Publishing

Information to a UDDI Registry, Searching Information in a UDDI

Registry,Deleting Information from a UDDI Registry

8 15


MODULE : 5

Web services: REST Basics, SOAP versus REST Introduction to Ajax, Ajax

Design Basics, Introduction to Mashups, user interface services

Platform for Web Services Development, MVC Design Pattern, Web

services - EJB, .NET J2EE Architecture, J2EE Components & Containers,

Specification, Application servers, Struts, Introduction to JSON-BSON

12 20

MODULE : 6

Web Transactions, Coordination, Orchestration, and Choreography –

tools BPEL, WSCDL Overview of Web service standards -BPEL4WS. WS-

Security and the Web services security specifications, WS Reliable

Messaging, WS-Policy, WS-Attachments Web Service Case Study - Web

Service Search Engine, Web Service Discovery, Web Service Composition.

Web Service – SOAP vs Web Service – REST. Overview of node.js

12 20



04 IT 6111 Virtualization Techniques 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:


1. To inspire the students with the newly emerging concept of Virtualization

2. To introduce different Virtualization Types

Syllabus




Course Outcome:

1. The students will get the basic concept of virtualization

Text Books:

1. William von Hagen, Professional Xen Virtualization, Wrox Publications, January, 2008.

2. Chris Wolf , Erick M. Halter, Virtualization: From the Desktop to the Enterprise, APress 2005.

3. Kumar Reddy, Victor Moreno, Network virtualization, Cisco Press, July, 2006.

References:

.

1. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes,

Elsevier/Morgan Kaufmann, 2005.

2. David Marshall, Wade A. Reynolds, Advanced Server Virtualization: VMware and Microsoft

Platform in the Virtual Data Center, Auerbach Publications, 2006

COURSE PLAN


04 IT 6111 VIRTUALIZATION TECHNIQUES 3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

OVERVIEW OF VIRTUALIZATION : Basics of Virtualization - Virtualization

Types – Desktop Virtualization – Network Virtualization – Server and

Machine Virtualization – Storage Virtualization

4 15

MODULE : 2

System-level or Operating Virtualization – Application Virtualization-

Virtualization Advantages – Virtual Machine Basics – Taxonomy of Virtual

machines - Process Virtual Machines – System Virtual Machines –

Hypervisor - Key Concepts

8 15


MODULE : 3 4 15


SERVER CONSOLIDATION : Hardware Virtualization – Virtual Hardware

Overview - Sever Virtualization Physical and Logical Partitioning - Types of

Server Virtualization

MODULE : 4

Business cases for Sever Virtualization – Uses of Virtual server

Consolidation –Planning for Development – Selecting server Virtualization

Platform

8 15


MODULE : 5

NETWORK VIRTUALIZATION : Design of Scalable Enterprise Networks -

Virtualizing the Campus WAN Design –WAN Architecture - WAN

Virtualization - Virtual Enterprise Transport Virtualization–VLANs and

Scalability - Theory Network Device Virtualization Layer 2 - VLANs Layer 3

VRF Instances Layer 2 - VFIs Virtual Firewall Contexts Network Device

Virtualization - Data- Path Virtualization Layer 2: 802.1q Trunking Generic

Routing Encapsulation – Ipsec L2TPv3 Label Switched Paths - Control-

Plane Virtualization–Routing Protocols- VRF - Aware Routing Multi-

Topology Routing

16 20

MODULE : 6

VIRTUALIZING STORAGE : SCSI- Speaking SCSI- Using SCSI buses – Fiber

Channel – Fiber Channel Cables – Fiber Channel Hardware Devices – iSCSI

Architecture – Securing iSCSI – SAN backup and recovery techniques –

RAID – SNIA Shared Storage Model – Classical Storage Model – SNIA

Shared Storage Model – Host based Architecture – Storage based

architecture – Network based Architecture – Fault tolerance to SAN –

Performing Backups – Virtual tape libraries.Overview of Hypervisors : Xen

Virtual machine monitors- Xen API – VMware – VMware products –

Vmware Features – Microsoft Virtual Server – Features of Microsoft

Virtual Server

8 20



04 IT 6113 HIGH PERFORMANCE NETWORKS 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

• To inspire the students with the newly emerging concept of high performance networks

• To introduce the purpose of learning important subjects in networking performance analysis for

meeting the requirement of various professional field applications.

Syllabus




Course Outcome:

1. The students will get the basic concept of high performance networks

Text Books:

1. Storage Networks Explained – UifTroppens, R Erkens and W Muller, John Wiley & Sons,

2003.

2. Alex Goldman, “Storage Area Networks Fundamentals”, Cisco Press 2002

3. Storage Area Network Essentials: a Complete Guide to understanding andimplementing

SANs- Richard Barker and Paul Massiglia, John Wiley India

References:

1. William Stallings: ISDN And BISDN

2. William Stallings: High Speed Networks

3. M Shwartz: Telecommunication Network Protocol Modeling And Analysis: Addison Wesley

4. Gallangar: Data Networks: Prentice Hall

5. Fred Halsall: Data Communication Computer Networks, And Open Systems: Addison Wesley

6. Kershanbaum : Telecommunication Network Design Algorithms: MGH

7. Jochetl Schiller: Mobile Communication: Addison Wesley.

8. Tanenbaum: Computer Networks: PHI

9. Johnson: Fast Ethernet

10. Tom Clark, “Designing Storage Area Networks”, Addison-Wesley Professional, 1stedition,

1999

11. Storage Networks: The Complete Reference – Robert Sparding, Tata Mcgraw Hills, 2003.


COURSE PLAN


04 IT 6113 HIGH PERFORMANCE NETWORKS 3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Network Performance analysis : Objectives and requirements for

Quality of Service (QoS) in high performance networks Architecture

of high performance networks (HPN), design issues, protocols for

HPN, VHF backbone networks, virtual interface architectures,

virtual interface for networking

8 15

MODULE : 2

High-speed switching and routing - internet and PSTN IP switching

techniques, SRP protocols, SRP authentication, and key exchange,

comparison of TCP/IP, FTP, TELNET, queuing systems, network

modelling as a graph Gigabit Ethernet : Architecture, standards,

interface, applications, network design Frame relay: Frame relay

protocols and services, frame relay congestion Control

8 15


MODULE : 3

ATM: Architecture, protocol, switching, traffic and congestion

control, flow control ATM service categories, ATM in LAN

environment, classical IP over ATM ADSL and DSL Technologies :

Background and technological capabilities, Standards and

associations, Architecture. Fiber Optics Communication: GPON

(Gigabit capable Passive Optical Network), SONET/SDH and

comparison with other available standards.Introduction to MPLS

and QOS, Network Components of MPLS, working RSVP protocol.

8 15

MODULE : 4

MPLS network Components, MPLS basic working, Applications, IETF

approach, RSVP protocol, Integrated & differential Services

Framework Storage and networking concepts – SCSI bus

architecture – Networking in front of the server – Networking

behind the server – Network -attached Storage –

8 15


MODULE : 5

Fibre channel internals – Layers – Data encoding – Framing protocol

– class of service – flow control – Name and addressing

8 20


conventions. SAN topologies – Point-to Point – Arbitrated Loop –

Loop Addressing-Loop Initialization-Port Login-Loop port state

machine – Design considerations for Arbitrated Loop –Fabrics –

Fabric login – Simple Name Server – State Change Notification –

Private Loop Support – Fabric Zoning – Building Extended SANs

MODULE : 6

Fibre Channel Products – Gigabit Interface Converters (GBICs) –

host Bus Adapters – Fibre channel RAID – Fibre channel JBODs –

Arbitrated Loop Hubs – hub Architecture – Unmanaged Hubs –

Managed Hubs –Microsoft Virtual Server Switching Hubs – Fabric

Switches – Fibre Channel-to-SCSI Bridges – SAN software Products –

Problem isolation in SANs – Isolation Techniques – Fibre channel

Analyzers.

8 20



04 IT 6115 MULTIMEDIA AND RICH INTERNET APPLICATIONS 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

1.To inspire the students with the emerging concepts in multimedia

2.To understand the fundamental concepts in Research and how to perform efficient research

3.To introduce the purpose of research in the academic program

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the concept of multimedia

Text Books:

1. Multimedia Communications: Protocols and Applications , Franklin F Kuo, J.Joaquin Garcia ,

Wolf gang Effelsberg,Prentice Hall Publications.

2. Multimedia Communications : Applications, Networks, Protocols and Standards , Fred

Halsall,Addison Wesley Publications.

3. AJAX, Rich Internet Applications, and Web Development for Programmers, Paul J Deitel and

Harvey M Deitel,Deitel Developer Series,Pearson education.

References:

1. Professional Adobe Flex 2 , Rich Tretola , Simon barber and RenaunErickson,Wrox,Wiley India

Edition.

2. Multimedia Information Networking ,Nalin K Sharda,PHI Learning.

3. Multimedia Computing, Communications &Applications , Ralf Steinmetz and Klara

Nahrstedt,Pearson Education.

4. Multimedia Communication Systems: techniques, standards and networks, K.R.Rao,Bojkovic and

Milovanovic.,PHI Learning.

5. Programming Flex 3,C.Kazoun and J.Lott,SPD.

6. Adobe Flex 3:Training from the Source,Tapper&others,Pearson Education.

7. Principles of Multimedia,R.Parekh,TMH.


COURSE PLAN


04 IT 6115 MULTIMEDIA AND RICH INTERNET APPLICATIONS

3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Internet and Multimedia communications, Multimedia Networks,

Multimedia Applications, Multimedia Information representation-

Digitization Principles, Text, Images, Audio and Video, Compression

Methods-Basic Coding Methods

Run Length coding, Huffman coding, Arithmetic coding, Discrete

Cosine Transform, Differential PCM, Motion Compensated Prediction

8 15

MODULE : 2

Video Compression – JPEG, H.261, MPEG-1 Video, MPEG 2 and 3

Video, H.263, Wavelet and Fractal Image Compression, Audio

Compression.

Multimedia Applications in Networks : Introduction, Application

Level Framing, Audio/Video Conferencing-Session Directories,

Audio/Video Conferencing, Adaptive Applications, Receiver

Heterogeneity

8 15


MODULE : 3

Real Time Application with Resource Reservation ,Video Server,

Applications requiring reliable multicast – White Board , Network

Text Editor for Shared Text Editing, Multi Talk.Multicast file

transfer,MultiMedia Applications on the World Wide Web – Multicast

Web Page Sharing, Audio/Video Streams in the www, Interactive

Multiplayer Games

8 15

MODULE : 4

Synchronization: notion of synchronization, presentation

requirements, reference model for synchronization, Introduction to

SMIL, Multimedia operating systems, Resource management, process

management techniques

Multimedia Communication Across Networks: Layered video coding,

error resilient video coding techniques, multimedia transport across

IP networks and relevant protocols such as RSVP, RTP, RTCP

8 15


SECOND INTERNAL TEST

MODULE : 5

DVMRP, multimedia in mobile networks, multimedia in broadcast

networks

Rich Internet Applications(RIAs) with Adobe Flash and Flex : Adobe

Flash- Introduction, Flash Movie Development, Learning Flash with

Hands-on Examples, Publish your flash movie, Creating special effects

with Flash, Creating a website splash screen, action script, web

sources.

8 20

MODULE : 6

Adobe Flex 2- Introduction, Flex Platform Overview, Creating a

Simple User Interface, Accessing XML data from your application,

Interacting with Server Side Applications, Customizing your User

Interface, Creating Charts and Graphs, Connection Independent RIAs

on the desktop -Adobe Integrated Runtime (AIR), Flex 3 Beta

8 20



04 GN 6001 RESEARCH METHODOLOGY 0-2-0:2 2015

Pre-requisites: Nil

Course Objectives:

To enable the students:

• To get introduced to research philosophy and processes in general. • To formulate the research problem and prepare research plan • To apply various numerical /quantitative techniques for data analysis • To communicate the research findings effectively

Syllabus Introduction to the Concepts of Research Methodology, Research Proposals, Research Design, Data Collection and Analysis, Quantitative Techniques and Mathematical Modeling, Report Writing.

Course Outcome:

Students who successfully complete this course would learn the fundamental concepts of Research Methodology, apply the basic aspects of the Research methodology to formulate a research problem and its plan. They would also be able to deploy numerical/quantitative techniques for data analysis. They would be equipped with good technical writing and presentation skills.

Text Books:

1. Research Methodology: Methods and Techniques’, by Dr. C. R. Kothari, New Age International Publisher, 2004

2. Research Methodology: A Step by Step Guide for Beginners’ by Ranjit Kumar, SAGE Publications Ltd; Third Edition

References:

1. Research Methodology: An Introduction for Science & Engineering Students’, by Stuart Melville and Wayne Goddard, Juta and Company Ltd, 2004

2. Research Methodology: An Introduction’ by Wayne Goddard and Stuart Melville, Juta and Company Ltd, 2004

3. Research Methodology, G.C. Ramamurthy, Dream Tech Press, New Delhi 4. Management Research Methodology by K N Krishnaswamy et al, Pearson Education


COURSE PLAN


04 GN 6001 RESEARCH METHODOLOGY 0-2-0:2

MODULES Contact

Hours

MODULE : 1

Introduction to Research Methodology: Concepts of Research, Meaning and 2

Objectives of Research, Research Process, Types of Research, Type of research:

Descriptive vs. Analytical, Applied vs. Fundamental, Quantitative vs. Qualitative, and

Conceptual vs. Empirical

5

MODULE :2

Criteria of Good Research, Research Problem, Selection of a problem, Techniques

involved in definition of a problem, Research Proposals – Types, contents, Ethical

aspects, IPR issues like patenting, copyrights.

4


MODULE: 3

Research Design : Meaning, Need and Types of research design, Literature Survey

and Review, Identifying gap areas from literature review, Research Design Process,

Sampling fundamentals, Measurement and scaling techniques, Data Collection –

concept, types and methods, Design of Experiments.

5

MODULE 4:

Quantitative Techniques: Probability distributions, Fundamentals of Statistical

analysis, Data Analysis with Statistical Packages, Multivariate methods, Concepts of

correlation and regression - Fundamentals of time series analysis and spectral

analysis.

5


MODULE: 5

Report Writing: Principles of Thesis Writing, Guidelines for writing reports & papers,

Methods of giving references and appendices, Reproduction of published material,

Plagiarism, Citation and acknowledgement.

5

MODULE: 6

Documentation and presentation tools – LaTeX, Office with basic presentations skills,

Use of Internet and advanced search techniques.

4



04 IT 6193 Network Programming Lab 0-0-2:1 2015

Pre-requisites: Java or C Programming knowledge

Course Objectives:


• To study the network programming concepts

• To understand the fundamental concepts in router configuration

• To understand routing protocols

Syllabus

At least 12 Programs must be covered in the Lab that must include but not restricted to the following

areas.

Tools/Language used : Socket programming using C, Wireshark, GNS

Familiarization of Graphical Network Simulator (GNS)

Familiarization of Wireshark

Detailed Study of protocols in TCP/IP model using Wireshark

Detailed Study of Subnetting and Supernetting

Experiments using GNS and Wireshark

Familiarization of following Linux/Unix network commands

o Ping

o traceroute

o arp

o route

o netstat

o About /etc folder

o IP Setting /Subnet Masking

o Setting up Hostname/Setting local name resolution

Installation and Configuration in Linux/Unix Environment

o Web Server

o File Server

o Remote Logins/Administration

o Database Server

o DNS

o NFS

o E-mail Server

o Firewall

o DHCP

o Proxy Server

o Samba

o LDAP


Socket Programming Experiments on

o TCP Echo Server, TCP Echo Client

o UDP Echo server, UDP Echo Client

o File Server

o Broadcast, Multicast

o Simple Network Time Protocol

o TCP Iterative Server

o TCP Concurrent Server

Familiarization on elementary commands to configure Router

Implementation of different routing protocols

Text Books:

1. Richard Stevens, Bill Fenner, “UNIX network programming Volume-1 –The Sockets Networking

API”.

References

1. W. Richard Stevens, “Advanced Programming in the Unix Environment”, Addison Wesley.

2. Vahalia, Uresh., UNIX Internals – “A new Frontier” , PHI

COURSE CODE: COURSE TITLE L-T-P-C YEAR

04 IT 6191 Seminar-1 0-0-2: 2 2015

Each student shall present a seminar on any topic of interest related to the core / elective courses

offered in the first semester of the M. Tech. Programme. He / she shall select the topic based on the

references from reputed International Journals, preferably IEEE/ACM/Springer/Elsevier journals. They

should get the paper approved by the Programme Coordinator / Faculty member in charge of the

seminar and shall present it in the class. Every student shall participate in the seminar. The students

should undertake a detailed study on the topic and submit a report at the end of the semester. Marks

will be awarded based on the topic, presentation, participation in the seminar and the report submitted.



04 IT 6102 WEB SECURITY 3-1-0:4 2015

Pre-requisites: Nil

Course Objectives:

• To inspire the students with interest, excitement, and urge to learn the subject of web

technology.

• To understand the fundamental concepts and implementation of web related issues and

resolution.

• To introduce the purpose of learning important subjects in web technology for meeting the

requirement of various web based threats.

Syllabus




Course Outcome:

• The student will demonstrate the ability to understand the basic concepts of web technologies

and their implementation

Text Books:

1. Dafydd Stuttard, Marcus Pinto, The Web Application Hacker’s Handbook, 2nd Edition, Wiley

Publishing, Inc.

2. Justin Clarke, SQL Injection Attacks and Defense, 2004 , Syngress Publication Inc

References:

1. Magnus Mischel , ModSecurity 2.5, Packt Publishing

2. Stuart McClure Joel, ScambRay, George Kurtz, Hacking Exposed 7: Network Security

Secrets & Solutions, Seventh Edition, 2012, The McGraw-Hill Companies

COURSE PLAN

COURSE CODE COURSE TITLE CREDITS

04 IT 6102 WEB SECURITY 3-1-0:4

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Web application security- Key Problem factors – Core defence

mechanisms- Handling user access- handling user input- Handling attackers

– web spidering – Discovering hidden content Transmitting data via the

client – Hidden form fields – HTTP cookies – URL parameters – Handling

client-side data securely

7 15

MODULE : 2

Attacking authentication – design flaws in authentication mechanisms –

securing authentication-Attacking access controls – Common vulnerabilities

9 15


– Securing access controls-identifying the database – UNION statements –

Preventing SQL injection


MODULE : 3

SQL Injection - How it happens - Dynamic string building - Insecure

Database Configuration - finding SQL injection – Exploiting SQL injection –

Common techniques-.Platform level defenses - Using run time protection -

web application Firewalls - Using ModSecurity - Intercepting filters

7 15

MODULE : 4

Web server filters - application filters – securing the database – Locking

down the application data – Locking down the Database server.Mod

Security - Blocking common attacks – HTTP finger printing – Blocking

proxied requests – Cross-site scripting

8 15


MODULE : 5

Cross-site request forgeries – Shell command execution attempts – Null

byte attacks – Source code revelation-Directory traversal attacks – Blog

spam – Website defacement – Brute force attack – Directory indexing –

Detecting the real IP address of an attacker.

8 20

MODULE : 6

Web server Hacking - Source code disclosure – Canonicalization attacks –

Denial of service-Web application hacking – Web crawling-Database

Hacking – Database discovery – Database vulnerabilities

9 20



04 IT 6104 ADVANCED DISTRIBUTED SYSTEMS 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

• Familiarise the concepts of distributed systems in a broader way.

• Identify various ideas about the transportation mechanism.

• Understand the concepts of cluster computing, cloud computing etc

Syllabus

Fundamental concepts and overview; Fluid statics ; Basic equations in integral form;

Basic equations in differential form ; Dimensional analysis and similitude; Internal flow of

incompressible and viscous fluid ; External flow of incompressible and viscous fluids ;Fluid

machines and design project.

Course Outcome:

• The student will demonstrate the ability to understand the basic concepts of various

ideas in the area of computing.

Text Books:

1. Overlay Networks: Toward Information Networking, SasuTarkoma, CRC Press

2. Peer-to-Peer Computing: Applications, Architecture, Protocols, and Challenges, Yu-

Kwong Ricky Kwok, CRC Press

3. High Performance Cluster Computing: Architectures and Systems, Volume 1, Ra

jkumarBuyya, Prentice Hall

4. Cloud Computing: Concepts, Technology & Architecture, Thomas Erl; Zaigham

Mahmood; Ricardo Puttini, Prentice Hall

References:

1. George Coulouris, Jean Dellimore Tim Kindberg ,”Distributed Systems – Concepts and

designing” Fifth Edition, Pearson Education Asia

2. Kai Hwang ,Jack Dongarra, Geoffrey Fox , Distributed and Cloud Computing, 1st Edition,

Morgan Kaufmann

3. Ian Foster, Carl Kesselman, The Grid 2: Blueprint for a New Computing Infrastructure,

Elsevier Series, 2004.

4. Vladimir Silva, Grid Computing for Developers, Charles River Media, January 2006.

5. RajkumarBuyya, High Performance Cluster Computing: Architectures and Systems,

Pearson

6. Andrei Gurtov, Dmitry Korzun , Structured Peer-to-peer Systems, Springer

7. Cloud Computing for Dummies by Judith Hurwitz, R.Bloor, M.Kanfman, F.Halper (Wiley

India Edition)

8. Enterprise Cloud Computing by GautamShroff,Cambridge


9. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India

10. Google Apps by Scott Granneman,Pearson

11. Cloud Computing: A Practical Approach, Antohy T Velte, et.al McGraw Hill,

12. Cloud Computing Bible by Barrie Sosinsky, Wiley India

13. StefanoFerretti et.al. “QoS aware Clouds”, QoS , 2010 IEEE 3rd International Conference

on Cloud Computing

14. Andrew S. Tenenbaum, “Distributed Operating Systems”, Pearson Education Asia

15. Pradeep. K.Sinha , “Distributed Operating Systems- Concepts and designing” , PHI

16. MapReduce Design Patterns, O'Reilly

17. Computer Networks – A Systems Approach, Larry L. Peterson and Bruce S. Davie, The

Morgan Kaufmann Series in Networking

COURSE PLAN

COURSE CODE COURSE tTITLE CREDITS

04 IT 6104 ADVANCED DISTRIBUTED SYSTEMS 3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Overlay Networks: Introduction - Routing Overlays - Structured

Overlays - Unstructured Overlays. Peer to Peer Systems-P2P Network

Architectures - Structured P2P Systems - Unstructured (Mesh) P2P

Systems.

7 15

MODULE : 2

Hybrid P2P Systems - Video Streaming Network Architecture.

Topology Control - Structured Topology Control-Unstructured

Topology Control. Trust – EigenTrust - PeerTrust – FuzzyTrust. Case

Study : Gnutella-Cluster Computing : Architecture – Classifications.

High Speed Networks - Fast Ethernet - High Performance Parallel

Interface

8 15

FIRST INTERNAL TEST (MODULE 1& 2)

MODULE : 3

Asynchronous Transfer Mode– Infiny Band– Myrinet. Network RAM

– Distributed Shared Memory. Case Study-Beowulf Cluster

Grid Computing : Services-Grid Standards – OGSA-WSRF, Grid

Monitoring Architecture (GMA), Grid Security- PKI-X504 Certificates

7 15

MODULE : 4 7 15


Grid Scheduling and Resource Management, Grid Data

Management, Grid Portals, Grid Middleware Case Study : Globus

Toolkit. Cloud Computing Fundamentals : Cloud Characteristics -

Cloud Delivery Models. Cloud Deployment Models - Cloud Security -

Cloud Infrastructure Mechanisms. Specialized Cloud Mechanisms -

Cloud Management Mechanisms


MODULE : 5

Cloud Security Mechanisms. Cloud Computing Architectures.

Fundamental Cloud Architectures - Advanced Cloud Architectures -

Specialized Cloud Architectures. Cloud Computing Technologies :

Data in the cloud: Relational databases – Amazon RDS- Google Cloud

SQL, No SQL databases - Amazon DynamoDB-Mongo DB

9 20

MODULE : 6

Cloud file systems: GFS and HDFS, BigTable, HBase.

Map-Reduce and extensions: Parallel. Computing The map-Reduce

model, Parallel efficiency of Map-Reduce, Relational operations using

Map-Reduce, Enterprise batch processing using Map-Reduce.

Introduction to cloud development, Example/Application of Map

reduce, Features and comparisons among GFS, HDFS etc, Map-

Reduce model case study: Google.

10 20



04 IT 6106 SOFTWARE DEFINED NETWORK 3-0-0:3 2015

Pre-requisites: Nil

Course Objectives:

1. Familiarise the idea of evolution of networking technologies and various implementation.

2. Students should be aware of various topologies.

Syllabus




Course Outcome:

1. The student will demonstrate the ability to understand the basic concepts of various ideas in

the area of computing.

2. Students will be capable of convey the ideas virtualization and hypervisors in the broader sense

Text Books:

1. Paul Goransson, Chuck Black, " A Comprehensive Approach", Morgan Kaufmann, Elsevier, USA,

2014

References:

1. Thomas D. Nadeau, Ken Gray, SDN: Software Defined Networks - An Authoritative Review of

Network Programmability Technologies, O'Reilly Media, August 2013.

2. David L. Tennenhouse and David J. Wetherall, Towards an Active Network Architecture,

Telemedia, Networks and Systems Group, MIT Press.

3. Aaron Gember, PrathmeshPrabhu, ZainabGhadiyali, Aditya Akella, "Toward Software-Defined

Middlebox Networking", Hotnets ’12, October, 2012, Seattle, WA, USA

4. Muhammad Bilal Anwer, MurtazaMotiwala, Mukarram bin Tariq, Nick Feamster, "SwitchBlade:

A Platform for Rapid Deployment of Network - Protocols on Programmable Hardware",

SIGCOMM 2010, ACM, New Delhi, India.


COURSE PLAN

COURSE CODE COURSE NAME CREDITS

04 IT 6106 SOFTWARE DEFINED NETWORK 3-0-0:3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction - Basic Packet-Switching Terminology, Historical background,

The Modern Data Center, traditional Switch Architecture

Autonomous and Dynamic Forwarding Tables, Can We Increase the Packet-

Forwarding IQ, Open Source and Technological Shifts

6 15

MODULE : 2

Evolution of Switches and Control Planes, Cost, SDN Implications for

Research and Innovation,DataCenter Innovation, Data Center Needs The

Evolution of Networking Technology,Forerunners of SDN, Software Defined

Networking is Born

Sustaining SDN Interoperability,Open Source Contributions, Legacy

Mechanisms Evolve Toward SDN, Network Virtualization

9

15


MODULE : 3

Fundamental Characteristics of SDN,SDN Operation, SDN Devices, SDN

Controller, SDN Applications, Alternate SDN Methods

OpenFlow Overview, Basics,Additions, Limitations. Potential Drawbacks of

Open SDN, SDN via APIs, SDN via Hypervisor-Based Overlays

8 15

MODULE : 4

SDN via Opening Up the Device, Network Functions Virtualization,

Alternatives Overlap and Ranking, Data Center Definition, Data Center

Demands, Tunneling Technologies for the Data Center, Path Technologies in

the Data Center

8 15


MODULE : 5

Ethernet Fabrics in the Data Center, SDN Use Cases in the Data Center,Open

SDN versus Overlays in the Data Center, Real-World Data Center

Implementations SDN in Other Environments

8 20

MODULE : 6

Wide Area Networks,Service Provider and Carrier Networks

Networks,HospitalityNetworks,MobileNetworks,In-Line, Network

Functions,OpticalNetworks,SDN vs. P2P/Overlay Networks

Players in the SDN Eco-system , SDN Applications, SDN Open source, SDN

Future

9 20



04 IT 6108 PROTOCOL ENGINEERING 3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


1. To understand the concepts and working of protocols.

2. Identify the role of each protocol in each layer

Syllabus




Course Outcome:

1. The student will demonstrate the ability to understand the basic concepts protocol used.

Text Books:

1. PallapaVenkataram and Sunilkumar S. Manvi: Communication Protocol Engineering, PHI, 2004.

References:

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

2. G. J. Holtzmann, “Design and validation of Computer protocols”, Prentice hall, 1991 (available

on web) K. Tarnay, “Protocol specification and testing”, Plenum press, 1991

COURSE PLAN


04 IT 6108 PROTOCOL ENGINEERING 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction: Communication model, Communication Software,

Communication Subsystems, Communication Protocol

Definition/Representation Formal and Informal Protocol Development

Methods, Protocol Engineering Phases Error Control, Flow Control Type

of Transmission Errors, Linear Block Code, Cyclic Redundancy Checks,

Introduction to Flow Control, Window Protocols

9 15

MODULE : 2

Sequence Numbers, Negative Acknowledgments, Congestion Avoidance

Network Reference Model: Layered Architecture, Network Services and

Interfaces, Protocol Functions Encapsulation, Segmentation, Reassembly,

6 15


Multiplexing, Addressing, OSI Model Layer Functions, TCP/IP Protocol

Suite, Application Protocols

FIRST INTERNAL TEST(MODULE 1 & 2)

MODULE : 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. Protocol Specification Language (SDL):

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

9 15

MODULE : 4

TCP protocol specification, SDL based platform for network, OSPF, BGP

Multi Protocol Label Switching SDL components

Protocol Verification / Validation: 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

9 15

SECOND INTERNAL TEST(MODULE 3 &4)

MODULE : 5

Process Algebra based Validation, SDL Based Protocol Verification: ABP

Verification, Liveness Properties, SDL Based Protocol Validation: ABP

Validation. 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

9 20

MODULE : 6

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. Protocol

Synthesis and Implementation: Synthesis methods, Requirements of

Protocol, Implementation, Objects Based Approach To Protocol

Implementation, Protocol Compilers, Code generation from SDL

6 20



04 IT 6112 HIGH-PERFORMANCE

SCIENTIFIC COMPUTING

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:

1. To familiarize the concepts of computing environments.

2. Understand various programming concepts.

3. Overview of application development environments

Syllabus




Course Outcome:

1. The student will be capable of understanding the basic idea of various programming concepts

Text Books:

1. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw Hill, 2003.

2. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006

References:

1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative

approach”, Morgan Kaufmann/Elsevier Publishers, 5th. edition, 2011.

2. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A hardware/

software approach” , Morgan Kaufmann/Elsevier Publishers, 2004.

3. Wesley Petersen and Peter Arbenz, “Introduction to Parallel Computing”, Oxford University

Press, 2004.

4. Jason Sanders, Jason Sanders, CUDA by Example: An Introduction to General-Purpose GPU

Programming, Pearson, 2010


COURSE PLAN

COURSE CODE: COURSE TITLE CREDITS

04 IT 6112 HIGH-PERFORMANCE SCIENTIFIC COMPUTING 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Parallel computer models –- Symmetric and distributed shared memory

architectures – Performance Issues Multi-core Architectures - Software

and hardware multithreading – SMT and CMP architectures

7 15

MODULE : 2

Design issues – Case studies – Intel Multi-core architecture – SUN CMP

architecture – IBM cell processor – NVIDIA GPU – AMD APU

Fundamental concepts – Designing for threads. Threading and parallel

programming constructs Synchronization – Critical sections – Deadlock.

Threading APIs

9 15

FIRST INTERNAL TEST(MODULE 1&2)

MODULE : 3

Shared memory programming : The OpenMP standard. Parallelisation

using compiler directives. Threading and variable types. Loop and

sections constructs. Program correctness and reproducibility

7 15

MODULE : 4

Scheduling and false sharing as factors influencing performance.

The MPI standard for message passing. Point-to-point and collective

communication. Synchronous vs asynchronous communication

8 15

SECOND INTERNAL TEST(MODULE 3&4)

MODULE : 5

MPI communicators and topologies.

GPU programming : The CUDA standard. Kernels and host-device

communication. Shared and constant memory, synchronicity and

performance. GPU coding restrictions. Overview of Open CL, Open Acc

8 20

MODULE : 6

Algorithms, program development and performance tuning. Limitations

to parallel performance. Strong vs weak scaling. Amdahl’s law. Network

contention in modern many-core architectures Mixed mode OpenMP+,

MPI programming.

9 20



04 IT 6114 Performance Evaluation of

Computer Networks

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


1. Identify various network flows.

2. Evaluate performance on each flows.

3. Familiarize various strategies on flows.

Syllabus




Course Outcome:

The student will be capable of understanding queuing discipline, models and its applications

Text Books:

1. James D.McCabe, Network analysis, Architecture and Design, 2nd Edition, Elsevier,2003.


3. Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press, NewYork,

2003

References:

1. D. Bertsekas, A. Nedic and A. Ozdaglar, Convex Analysis and Optimization, Athena Scientific,

Cambridge, Massachusetts, 2003

2. 2.Nader f. Mir Computer and Communication Networks, Pearson Education, 2007.


Elsevier, 2003.




COURSE PLAN


04 IT 6114 Performance Evaluation of Computer Networks 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Performance Characteristics – Requirement Analysis: Concepts – User,

Device Network Requirements – Process – Developing RMA, Delay,

Capacity Requirements

6 15

MODULE : 2

Flow analysis – Identifying and Developing Flows Models . Flow

Prioritization – Specification Random variables – Stochastic process

11 15


MODULE : 3

Link Delay components – Queuing Models – Little’s Theorem – Birth &

Death Process Queuing Disciplines

9 15

MODULE : 4

Markovian FIFO Queuing Systems – M/M/1 – M/M/a – M/M/∞ - M/G/1

M/M/m/m and other Markov – Non – Markovian and self – similar

models

8 15


MODULE : 5

Network of Queues – Burke’s Theorem – Jackson’s Theorem Multi- User

Uplinks/Downlinks

6 20

MODULE : 6

Capacity Regions – Opportunistic Scheduling for Stability and Max

Throughput Multi-hop routing – Mobile Networks – Throughput

Optimality and Backpressure

7 20



04 IT 6116 Networking in Embedded

Systems

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:

1. Analyses the embedded system components in detail.

2. Identify the objectives and goals of embedded systems.

Syllabus




Course Outcome:

Familiarized various embedded system and wireless embedded systems in practical.

Text Books:

1. Network Routing: Algorithms, Protocols, and Architectures DeepankarMedhi and

KarthikeyanRamasamy (Morgan Kaufmann Series in Networking)

2. Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices

George Varghese (Morgan Kaufmann Series in Networking)

References:

1. TCP/IP Protocol Suite, (B.A. Forouzum) Tata McGraw Hill Edition, Third Edition

2. TCP/IP Volume 1,2,3 (N. Richard Steveus Addison Wesley)

3. Computer Networks (A.S. Taueubaum) Pearson Edition, 4th Edition


COURSE PLAN


04 IT 6116 NETWORKING IN EMBEDDED SYSTEMS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Embedded Networking: Introduction – Serial/Parallel Communication

Serial communication protocols -RS232 standard – RS485 –

Synchronous Serial Protocols -Serial Peripheral Interface (SPI)

6 15

MODULE : 2

Inter Integrated Circuits (I2 C) – PC Parallel port programming -ISA/PCI

Bus protocols – Firewire. USB bus – Introduction – Speed Identification on

the bus – USB States – USB bus communication: Packets

9 15


MODULE : 3

Data flow types –Enumeration –Descriptors –PIC Microcontroller USB

Interface – C Programs –CAN Bus Introduction - Frames –Bit stuffing –

Types of errors –Nominal Bit Timing PIC microcontroller CAN Interface –A

simple application with CAN

9 15

MODULE : 4

Elements of a network – Inside Ethernet – Building a Network: Hardware

options – Cables, Connections and network speed Design choices:

Selecting components –Ethernet Controllers

6 15


MODULE : 5

Exchanging messages using UDP and TCP – Serving web pages with

Dynamic Data – Serving web pages that respond to user Input – Email for

Embedded Systems Using FTP – Keeping Devices and Network secure.

6 20

MODULE : 6

Wireless sensor networks – Introduction – Applications – Network

Topology Localization –Time Synchronization - Energy efficient MAC

protocols SMAC – Energy efficient and robust routing – Data Centric

routing

12 20


Pre-requisites: Nil

Course Objectives:


1. Comparison of various routing algorithms.

2. Routing table implementation.

Syllabus




Course Outcome:

1. The student will be capable of understanding queuing discipline, modelsand its applications.

Text Books:

1. James D.McCabe, Network analysis, Architecture and Design, 2nd Edition, Elsevier,2003.


3. Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press, NewYork,

2003.

References:

1. D. Bertsekas, A. Nedic and A. Ozdaglar, Convex Analysis and Optimization, Athena Scientific,

Cambridge, Massachusetts, 2003

2. Nader f. Mir Computer and Communication Networks, Pearson Education, 2007.


Elsevier, 2003.



COURSE CODE: COUSE TITLE L-T-P-C YEAR

04 IT 6118 INTERNET ROUTING DESIGN 3-0-0: 3 2015


COURSE PLAN


04 IT 6118 INTERNET ROUTING DESIGN 3-0-0: 3

MODULES

Contact

hours

Sem.Exa

m

Marks;%

MODULE : 1 Routing Protocol, Routing Algorithm, and Routing Table, Routing Information Representation and Protocol Messages Link State Routing Protocol, Path Vector Routing, Protocol, Link Cost. Architectural View of the Internet, Allocation of IP Prefixes and AS Number

15 20

MODULE : 2 Policy Based Routing, Point of Presence, Traffic Engineering Implications, Internet Routing Instability Traffic Engineering of IP/MPLS Networks, VPN Traffic Engineering, Problem Illustration: Layer 3 VPN, LSP Path Determination Constrained Shortest Path Approach, LSP Path Determination: Network Flow Modeling Approach, Layer 2 VPN Traffic Engineering, Observations and General Modeling Framework, Routing/Traffic Engineering for Voice Over MPLS

9 15


MODULE : 3 Router Architectures: Functions, Types, Elements of a Router, Packet Flow, Packet Processing: Fast Path versus Slow Path, Router Architectures

6 15

MODULE : 4 Network Bottleneck, Network Algorithmics, Strawman solutions, Thinking Algorithmically, Refining the Algorithm, Cleaning up, Characteristics of Network Algorithms IP Address Lookup Algorithms : Impact, Address Aggregation, Longest Prefix Matching, Naïve Algorithms, Binary , Multibit and Compressing Multibit Tries

7 20


MODULE : 5 Search by Length Algorithms, Search by Value Approaches, Hardware Algorithms, Comparing Different Approaches IP Packet Filtering and Classification Classification, Classification Algorithms, Naïve Solutions, Two-Dimensional Solutions, Approaches for d Dimensions

6 15

MODULE : 6 QoS Attributes, Adapting Routing: A Basic Framework. Update Frequency, Information Inaccuracy, and Impact on Routing, Dynamic Call Routing in the PSTN Heterogeneous Service, Single-Link Case, A General Framework for Source-Based QoS Routing with Path Caching , Routing Protocols for QoS Routing.

5 15



04 IT 6122 ENTERPRISE STORAGE

ARCHITECTURE

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


1. Data storage option analysis.

2. Storage in terms of networks.

Syllabus




Course Outcome:

1.Identified about the network topologies as well as data storage options for the future purpose

in a secure way.

Text Books:

1. EMC, Information Storage and Management [ISBN: 978-0470294215]

References:

1. Richard Barker, Paul Massiglia 2002, Storage area network essentials, Wiley New York [ISBN:

978-0471034452]

2. Ulf Troppens, Rainer Erkens, Wolfgang Mueller-Friedt, Rainer Wolafka, Nils Haustein, Storage

Networks Explained [ISBN: 978-0470741436]

3. W. Curtis Preston 2002, Using SANs and NAS, O'Reilly & Associates Sebastopol, Calif. [ISBN:

978-0596001537]

4. HimanshuDwivedi 2006, Securing storage, Addison-Wesley Upper Saddle River, NJ [ISBN:

978-0321349958]


COURSE PLAN


04 IT 6122 ENTERPRISE STORAGE ARCHITECTURE 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Storage Systems: Data Classification, Storage Evolution and Data Center

infrastructure. Host components, Connectivity, Storage, and Protocols

Components of a disk drive, physical disk and factors affecting disk drive

performance

6 20

MODULE : 2

RAID level performance and availability considerations, Components and

benefits of an intelligent storage system

6 15

FIRST INTERNAL TEST(MODULE 1 &2)

MODULE : 3

Storage Networking Technologies: Direct-Attached Storage (DAS)

architecture, Storage Area Network (SAN) attributes, components, topologies,

connectivity options and zoning FC protocol stack, addressing, flow control,

and classes of service.

6 15

MODULE : 4

Networked Attached Storage (NAS) components protocols, IP Storage Area

Network (IP SAN) iSCSI, FCIP and FCoE architecture. Content Addressed

Storage (CAS) elements, storage, and retrieval processes.

Virtualization: Block-level and file-level storage virtualization technology,

virtual provisioning and cloud computing

9 20


MODULE : 5

Business Continuity: Business Continuity measurement, terminologies, and

planning, Backup designs, architecture, topologies, and technologies in SAN

and NAS environments, Local and Remote replication using host and array

based replication technologies such as Synchronous and Asynchronous

methods

13 15

MODULE : 6

Storage Security and Management: Storage security framework and various

security domains. Security implementation in SAN, NAS and IP-SAN

networking. Monitoring and Storage management activities and challenges

8

15



04 IT 6124 COMPLEX NETWORKS 3-0-0: 3 2015

Pre-requisites: Nil

COURSE OBJECTIVES:

1. Comparison of various types of graphs.

2.Analysis flows on networks.

Syllabus




Course Outcome:

1. Students might have an idea about complex networking elements its flows and configuration.

.

Text Books:

1. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks, Oxford University press

References:

1. Narsingh Deo, Graph Theory, Prentice Hall of India.

COURSE PLAN


04 IT 6124 COMPLEX NETWORKS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Types of network: Social networks, Information networks, Technological

networks, Biological networks.Properties of network: Small world effect,

transitivity and clustering, degree distribution, scale free networks,

maximum degree; network resilience;

9 15

MODULE : 2

Mixing patterns; degree correlations; community structures; network

navigation

4 15



MODULE : 3

Random Graphs: Poisson random graphs, generalized random graphs the

configuration model, power-law degree distribution,

directed graph, bipartite graph, degree correlations.

15 15

MODULE : 4

Models of network growth: Price's model, Barabasi and Albert's model,

other growth models, vertex copying models

5 15

SECOND INTERNAL TEST(MODULE 3 &4)

MODULE : 5

Processes taking place on networks: Percolation theory and network

resilience, Epidemiological processes.

4 20

MODULE : 6

Applications: Search on networks, exhaustive network search

guided network search,network navigation; network visualization

11 20



04 IT 6126 DISTRIBUTED ALGORITHMS 3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


1. To inspire the students to learn the subject of theoretical foundations in algorithms used in

networking

2. To understand the fundamental concepts in design of networking

3. To introduce the purpose of analysing different concept of network and algorithms

Syllabus




Course Outcome:

The student will understand the concept of designing of networking algorithms

Text Books:

1. Nancy A. Lynch, Morgan,” Distributed Algorithms”, Kaufmann Publishers, Inc

2. WolfgangReisig, W. Reisig, “Elements Of Distributed Algorithms: Modeling And Analysis With

Petri Nets”, Springer-verlag

3. Tel Gerard , “Introduction To Distributed Algorithms”, 2nd Edition, Cambridge University Press

References:

1. Sukumar Ghosh, ”Distributed Systems: An Algorithmic Approach (Hardcover)”, Chapman &

Hall/crc

2. Valmir C. Barbosa,”An Introduction To Distributed Algorithms”, Mit Press

3. Randy Chow, Theodore Johnson, “Distributed Opearating Systems and Algorithm Analysis, ,

Pearson Education

4. Santoro N., Nicola Santoro, “Design And Analysis Of Distributed Algorithms”, Wiley-interscience

5. FionnualaO'donnell, VdmVerlagDr. Muller, “A Simulated Framework For The Teaching Of

Distributed Algorithms”, Aktiengesellschaft& Co. Kg

6. Ajay D. Kshemkalyani, MukeshSinghal, “Distributed Computing - Principles, Algorithms, And

Systems”, Cambridge University Press


COURSE PLAN


04 IT 6126 DISTRIBUTED ALGORITHMS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction to model of synchronous distributed computing system

Leader election in a General Network - Simple Flooding Algorithm

Basic Breadth-First Search Algorithm., Bellman-Ford algorithm.

9 15

MODULE : 2

Algorithms in Synchronous Networks, Minimum Spanning Tree,

Leader Election in a Synchronous Ring , LCR algorithm, HS algorithm,

Time Slice Algorithm

7 20


MODULE : 3

Variable Speeds Algorithm, Lower Bound for Comparison-Based

Algorithms, Maximal Independent Set, LubyMIS algorithm.

Distributed Consensus with Link Failures and Process Failures –

Basics

8 15

MODULE : 4

Introduction to model of asynchronous distributed computing

system, Send/Receive systems, Broadcast systems, Multicast

systems, Basic algorithms,

9 15


MODULE : 5

Asynchronous System Model. Shared Memory Systems,

Environment Model, Shared Variable Types, Mutual Exclusion -

Asynchronous Shared Memory Model, Dijkstra's Mutual Exclusion

Algorithm.

8 20

MODULE : 6

Resource Allocation - Nonexistence of Symmetric Dining

Philosophers Algorithms, Right-Left Dining Philosophers Algorithm,

mutual exclusion and consensus, relationship between shared

memory and network models, asynchronous networks with failures.

7 15



04 IT 6194 Network Simulation

Lab

0-0-2: 1 2015

Pre-requisites: Knowledge in network simulation tools

Course Objectives:


1. To inspire the students with interest, excitement, and urge to develop wireless and wired

networking applications in simulated environment

2. To develop new protocols

Lab Experiments based on the courses MITNE 203 and implementation of basic protocols of computer

network.

Experiment list:

Familiarizing Network Simulator – 2 (NS2) with suitable examples

Simulate a wired network consisting of TCP and UDP Traffic using NS2 and then calculate their

respective throughput using AWK script.

Performance evaluation of different routing protocols in wired network environment using NS2

Performance evaluation of different queues and effect of queues and buffers in wired network

environment using NS2

Compare the behavior of different variants of TCP (Tahoe, Reno, Vegas….) in wired network

using NS2. Comparison can be done on the congestion window behavior by plotting graph.

Simulation of wireless Ad hoc networks using NS2

Simulate a wireless network consisting of TCP and UDP Traffic using NS2 and then calculate their

respective throughput using AWK script.

Performance evaluation of different ad-hoc wireless routing protocols (DSDV, DSR, AODV …)

using NS2

Create different Wired-cum-Wireless networks and MobileIP Simulations using NS2.



04 IT 7190 Industrial Training 0-0-4: 2 2015

Pre-requisites: Knowledge in distributed and network programming

Course Objectives:


1. To inspire the students with interest, excitement, and urge to develop networking applications.

The students have to undergo industrial visit/Miniproject. The mini project is designed to develop

practical ability and knowledge about practical tools/techniques in order to solve the actual problems

related to the industry, academic institutions or similar area. Students can take up any application

level/system level project pertaining to a relevant domain. Projects can be chosen either from the list

provided by the faculty or in the field of interest of the student. For external projects, students should

obtain prior permission after submitting the details to the guide and synopsis of the work. The project

guide should have a minimum qualification of ME/M.Tech in relevant field of work. At the end of each

phase, presentation and demonstration of the project should be conducted, which will be evaluated by a

panel of examiners. A detailed project report duly approved by the guide in the prescribed format

should be submitted by the student for final evaluation. Publishing the work in Conference Proceedings/

Journals with National/ International status with the consent of the guide will carry an additional

weightage in the review process.



04 IT 7101 ENGINEERING MOBILE

APPLICATIONS

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


• To inspire the students with interest, excitement, and urge to learn the subject of Engineering

mobile applications .

• To understand the fundamental concepts of Engineering mobile applications.

• To introduce the purpose of learning important subjects in mobile applications for meeting the

requirement of various

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of Engineering mobile

applications

Text Books:

1. Karim Yaghmour, “Embedded Android Porting, Extending, and Customizing” , O'Reilly Media.

References:

1. Andrew Sloss, Dominic Symes , Chris Wright, “ARM System Developer's Guide: Designing and

Optimizing System Software”, Elsevier.

2. Reto Meier , “Professional Android 4 Application Development”, Wiley

COURSE PLAN


04 IT 7101 ENGINEERING MOBILE APPLICATIONS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Mobile Processor Architecture: ARM Processor – Design Philosophy –

System Hardware – System Software Registers – Program Status Register –

Pipe Line – Exceptions, Interrupts, Vector Table – Core Extensions. Firmware

8 15


and boot loader

MODULE : 2

Case Study : Sand Stone – Embedded Operating System – Case Study :

Simple Little Operating System. Android Operating System : Features and

Characteristics – Android Concepts – Framework - Architecture – Linux

Kernel Wakelocks - Low-Memory Killer – Binder – ashmem – Alarm – Logger

- Hardware Abstraction Layer - Loading and Interfacing Methods

10 20


MODULE : 3

Init - Dalvik and Android’s Java - Java Native Interface - System Services -

Service Manager and Binder Interaction. Hardware - Typical System

Architecture - System-on-Chip - Memory Layout and Mapping – File system

10 15

MODULE : 4

Basic Android Development : Android Application Architecture – Manifest

Application Lifecycle – Activities – Activity Lifecycle

6 15


MODULE : 5 User Interface Fundamentals – Layouts – Menus - Views - Intents – Linkify – Intents to Broadcast Events. Advanced Android Development : Connecting to an Internet Resource - SQLite Databases – Content values and cursors

7 20

MODULE : 6 Text-to-Speech and speech recognition - Sensors - Location based services Bluetooth – Wifi - Cloud to Device Messaging. Overview of Android Native Development

7 15



04 IT 7103 AGENT BASED INTELLIGENT

SYSTEMS

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:

1.To inspire the students with interest, excitement, and urge to learn the subject of

Agent based intelligent systems

2.To understand the fundamental concepts of Engineering mobile applications.

3.To introduce the purpose of learning intelligent systems.

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of

Agent based intelligent systems

Text Books:

1. Software Agents: Jeffrey M.Broadshaw, AAAI Press (1997)

2. Multi agent System – A modern approach to distributed artificial intelligence: Gerhard Weiss,

MIT Press (2000)

References:

1. Artificial intelligence. A modern approach by Stuart Russell & Peter Norvig.

2. Artificial Intelligence by Elaine Rich & Kevin knight.


COURSE PLAN


04 IT 7103 AGENT BASED INTELLIGENT SYSTEMS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Artificial Intelligence – intelligent agents – Environment – Structure of

agents.Agent types – Problem solving agents – Uninformed Search

strategies.Informed Search and Exploration – Adversarial Search.

11 15

MODULE : 2

Planning – Components of planning systems – Planning with state space

search – Partial order planning – Planning Graphs –

Hierarchical planning – Multi agent planning

12 15


MODULE : 3

Knowledge and reasoning – Knowledge Based Agents – First order logic –

Reasoning – Backward chaining; Resolution – Knowledge representation

– Handling uncertain knowledge

10 15

MODULE : 4

Learning – forms of learning – Inductive learning – Learning decision trees

– Explanation based learning – Statistical learning – Instantance based

learning – Neural networks – Reinforcement learning.

6 15


MODULE : 5

Agent oriented programming language – KQML as an agent

communication language – Java implementation of intelligent agents

JADE – Languages supporting mobility – Telescript.

5 20

MODULE : 6

Resolution – Knowledge representation – Handling uncertain knowledge 4 20



04 IT 7105 SOCIAL NETWORK

ANALYSIS

3-0-0: 3 2015

Pre-requisites: Nil

COURSE OBJECTIVES:

1.To inspire the students with interest, excitement, and urge to learn the subject of Social network

analysis .

2.To understand the fundamental concepts of Social network analysis .

3.To introduce the purpose of learning important aspects in Social network analysis .

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of Social network analysis

Text Books:

1. Charu C. Aggarwal, “Social Network Data Analytics”, Springer, 2011.

2. GuandongXu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking Techniques and

applications”, Springer, first edition, 2011.

References:

1. Peter Mika, “Social networks and the Semantic Web”, Springer, first edition 2007.

2. BorkoFurht, “Handbook of Social Network Technologies and Applications”, Springer, first

edition, 2010.

3. Dion Goh and Schubert Foo, “Social information retrieval systems: emerging technologies and

applications for searching the Web effectively”, IGI Global snippet, 2008. 133

4. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, “Collaborative and social information

retrieval and access: techniques for improved user modelling”, IGI Global snippet, 2004 .

5. John G. Breslin, Alexandre Passant and Stefan Decker, “The Social Semantic Web”, Springer,

2004

Web References:

1. www.utdallas.edu

2. ibook.ics.uci.edu

3. www.ebmtools.org

http://www.utdallas.edu/

http://www.ebmtools.org/


COURSE PLAN

COURSE CODE: COURSE TITLE: CREDITS

04 IT 7105 SOCIAL NETWORK ANALYSIS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction to Web - Limitations of current Web – Development of

Semantic Web – Emergence of the Social Web - Network analysis -

Development of Social Network Analysis - Key concepts and

measures in network analysis - Electronic sources for network

analysis -Electronic discussion networks, Blogs and online

communities, Web-based networks - Applications of Social

Network Analysis

10 15

MODULE : 2

Ontology and their role in the Semantic Web - Ontology-based

Knowledge Representation - Ontology languages for the Semantic

Web -RDF and OWL - Modelling and aggregating social network

data – State-of-the-art in network data representation, Ontological

representation of social individuals -Ontological representation of

social relationships, Aggregating and reasoning with social network

data, Advanced Representations

13 15


MODULE : 3

Extracting evolution of Web Community from a Series of Web

Archive - Detecting Communities in Social Networks - Definition of

Community - Evaluating Communities -–Methods for Community

Detection & Mining -Applications of Community Mining Algorithms

- Tools for Detecting Communities Social Network Infrastructures

and Communities-Applications - Case Studies - Real Time Sentiment

Analysis, Stock Market Predictions

13 15

MODULE : 4

Understanding and Predicting Human Behaviour for Social

Communities - User Data Management, Inference and Distribution

- Enabling New Human Experiences - Reality Mining - Context-

Awareness - Privacy in Online Social Networks

5 15

SECOND INTERNAL TEST(MODULE3&4)

MODULE : 5 4 20


Trust in Online Environment - Trust Models Based on Subjective

Logic - Trust Network Analysis - Trust Transitivity Analysis -

Combining Trust and Reputation - Trust Derivation Based on Trust

Comparisons - Attack Spectrum and Countermeasures

MODULE : 6

Text Mining in Social Networks: Introduction – Keyword Search –

Query Semantics and Answer Ranking - Keyword search over XML

and relational data - Keyword search over graph data -

Classification Algorithms - Clustering Algorithms - Transfer Learning

in Heterogeneous Networks - Application – Gephi

3 20



04 IT 7107 BIG DATA ANALYTICS 3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:

1. To inspire the students with interest, excitement, and urge to learn the subject of Big data

analysis

2. To understand the fundamental concepts of Big data analysis

3. To introduce the purpose of learning important aspects in Big data analysis

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of Big data analysis

Text Books:

1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.

2. AnandRajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University

Press, 2012.

3. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with

Advanced Analytics”, John Wiley & sons, 2012

References:

1. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007

2. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.

3. Jiawei Han, MichelineKamber “Data Mining Concepts and Techniques”, Second Edition, Elsevier,

Reprinted 2008.

4. Raymond Heatherly, Murat Kantarcioglu and BhavaniThuraisingham , “Preventing Private

Information Inference Attacks on Social Networks” IEEE Transaction on Knowledge and Data

5. Engineering,Vol 25, No.8 ,August 2013.

6. Arthur G. Erdman, Daniel F. Keefe, Senior Member, IEEE, and Randall Schiest,”Grand Challenge:

Applying Regulatory Science and Big Data to Improve Medical Device Innovation”, IEEE

7. Transactions On Biomedical Engg., Vol. 60, No. 3, March 2013.


COURSE PLAN


04 IT 7107 BIG DATA ANALYTICS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction to Big Data Platform – Challenges of Conventional Systems -

Intelligent data analysis – Nature of Data -

- Analytic Processes and Tools - Analysis Vs Reporting - Modern Data

Analytic Tools – Statistical Concepts: Sampling Distributions -

7 15

MODULE : 2

Re-Sampling - Statistical Inference - Prediction Error

Regression Modeling - Multivariate Analysis – Bayesian Methods –

Bayesian Paradigm - Bayesian Modeling - Inference and Bayesian

Networks - Support Vector and Kernel Methods

9 15


MODULE : 3

Analysis of Time Series: Linear Systems Analysis - Nonlinear Dynamics -

Rule Induction - Fuzzy Logic: Extracting Fuzzy Models from Data - Fuzzy

Decision Trees.

Search Methods and Visulaization: Search by simulated Annealing –

Stochastic, Adaptive search byEvaluation – Evalution Strategies – Genetic

Algorithm

8 15

MODULE : 4

Genetic Programming – Visualization – Classification of Visual Data

Analysis Techniques – Data Types – Visualization Techniques – Interaction

techniques – Specific Visual data analysis Techniques

Introduction To Streams Concepts – Stream Data Model and Architecture

- Stream Computing - Sampling Data in a Stream – Filtering Streams –

Counting Distinct Elements in a Stream– Estimating

8 15

SECOND INTERNAL TEST(MODULE 3 & 4)

MODULE : 5

Moments – Counting Oneness in a Window – Decaying Window – Real

time Analytics Platform(RTAP) Applications - Case Studies - Real Time

Sentiment Analysis, Stock Market Predictions MapReduce – Hadoop,

Hive, MapR – Sharding – NoSQL Databases - S3

9 20

MODULE : 6

Hadoop Distributed File Systems - Case Study- Preventing Private

Information Inference Attacks on Social Networks-Grand Challenge

Regulatory Science and Big Data to Improve Medical Device Innovation

7 20



04 IT 7109 NETWORK FORENSICS 3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:

1.To inspire the students with interest, excitement, and urge to learn the subject of network forensics

2.To understand the fundamental concepts of network forensics

3.To introduce the purpose of learning important aspects network forensics

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of Network forensics

Text Books:

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

Pearson Education, 2012.

References:

1. Katzendbisser, Petitcolas, " Information Hiding Techniques for Steganography and Digital

Watermarking", Artech House. 42

2. Peter Wayner, "Disappearing Cryptography: Information Hiding, Steganography and

Watermarking 2/e", Elsevier

3. Bolle, Connell et. al., "Guide to Biometrics", Springer

4. John Vecca, “Computer Forensics: Crime scene Investigation”, Firewall Media Christopher L.T.

Brown, “Computer Evidence: Collection and Preservation”, Firewall Media


COURSE PLAN


04 IT 7109 NETWORK FORENSICS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Introduction to Network Forensics : Concepts in Digital Evidence,

Challenges relating to Network Evidence, Network Forensics Investigative

Methodology, Technical Fundamentals, Sources of Network-Based

Evidence,

On the Wire, In the Air, Switches , Routers, DHCP Servers, Name Servers,

Authentication Servers, Network Intrusion Detection /Prevention

Systems, Firewalls, Web Proxies, Application Servers, Central Log

Servers.

7 15

MODULE : 2

Evidence Acquisition: Physical Interception-Cables, Radio Frequency,

Hubs, Switches, Traffic Acquisition Software, libpcap and WinPcap The

Berkeley Packet Filter (BPF) Language, tcpdump, Wireshark, tshark,

dumpcap, Active Acquisition- Common Interfaces, Inspection Without

Access, Strategy.

Traffic Analysis : Protocol Analysis, Protocol Analysis Tools, Protocol

Analysis Techniques, Packet Analysis, Packet Analysis Tools, Packet

Analysis Techniques, Flow Analysis, Flow Analysis Tools, Flow Analysis

Techniques

9 15


MODULE : 3

Higher-Layer Traffic Analysis, Common Higher-Layer Protocols, Higher-

Layer Analysis Tools, Higher-Layer Analysis Techniques Statistical Flow

Analysis, Process Overview, Sensors, Sensor Types, Sensor Software,

Sensor Placement, Flow Record Export Protocols, NetFlow, IPFIX, sFlow,

Collection and Aggregation, Wireless Traffic Capture and Analysis,

Spectrum Analysis, Wireless Passive Evidence Acquisition, Common

Attacks – Sniffing, Rogue Wireless Access Points, Evil Twin, WEP Cracking,

Locating Wireless Devices.

8 15

MODULE : 4

Network Devices, Intrusion Detection and Analysis : Typical NIDS/NIPS

Functionality, Sniffing , Higher-Layer Protocol Awareness, Alerting on

Suspicious Bits Modes of Detection, Signature-Based Analysis, Protocol

Awareness, Behavioral Analysis, Types of NIDS/NIPSs , NIDS/NIPS

Evidence Acquisition ,Advanced Topics : Network Tunneling, Tunneling

9 15


for Functionality, Inter-Switch Link (ISL), Generic Routing Encapsulation

(GRE), Tunneling for Confidentiality, Internet Protocol Security (IPsec)


MODULE : 5

Comprehensive Packet Logging , Event Log Aggregation, Correlation, and

Analysis, Sources of Logs - Operating System Logs , Application Logs

Physical Device Logs, Network Equipment Logs, Network Log

Architecture, Three Types of Logging Architectures

Remote Logging: Common Pitfalls and Strategies. Switches - Content-

Addressable Memory Table, ARP, Switch Evidence, Routers-Types of

Routers, Router Evidence, Firewalls -Types of Firewalls , Firewall

Evidence

9 20

MODULE : 6

Transport Layer Security (TLS) and Secure Socket Layer (SSL), Covert

Tunneling, Covert Tunneling Strategies , TCP Sequence Numbers , DNS

Tunnels

ICMP Tunnels. Malware Forensics, Trends in Malware Evolution, Network

Behavior of Malware, Propagation, Command and Control

Communications, Payload Behaviour.

6 20



04 IT 7111 DATA CENTER

VIRTUALIZATION

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


• To inspire the students with interest, excitement, and urge to learn the subject of data center

visualization

• To understand the fundamental concepts of of data center visualization

• To introduce the purpose of learning important aspects of data center visualization

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of datacenter

visualization.

Text Books:

1. Mickey Iqbal 2010, IT Virtualization Best Practices: A Lean, Green Virtualized Data Center

Approach, MC Press [ISBN: 978-1583473542]

2. Mike Laverick, VMware vSphere 4 Implementation [ISBN: 978-0071664523]

References:

1. Jason W. McCarty, Scott Lowe, Matthew K. Johnson, VMware vSphere 4 Administration Instant

Reference [ISBN: 978-0470520727]

2. Brian Perry, Chris Huss, Jeantet Fields, VCP VMware Certified Professional on vSphere 4 Study

Guide [ISBN: 978-0470569610]

3. Jason Kappel, Anthony Velte, Toby Velte, Microsoft Virtualization with Hyper-V: Manage Your

Datacenter with Hyper-V, Virtual PC, Virtual Server, and Application Virtualization [ISBN: 978-

0071614030]


COURSE PLAN

COURSE CODE COURSE TITLE : CREDITS:

04 IT 7111 DATA CENTER VIRTUALIZATION 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Data Center Challenges: How server, desktop, network Virtualization and

cloud computing reduce data center footprint, environmental impact and

power requirements by driving server consolidation.

8 15

MODULE : 2

Evolution of Data Centers: The evolution of computing infrastructures and

architectures from standalone servers to rack optimized blade servers and

unified computing systems (UCS), Enterprise-level Virtualization:

Provision, monitoring and management of a virtual datacenter and

multiple enterprise-level virtual servers and virtual machines through

software management interfaces.

9 15


MODULE : 3

Networking and Storage in Enterprise Virtualized Environments:

Connectivity to storage area and IP networks from within virtualized

environments using industry standard protocols.

6 15

MODULE 4

Virtual Machines & Access Control: Virtual machine deployment,

modification, management; monitoring and migration methodologies

5 15


MODULE 5 Resource Monitoring: Physical and virtual machine memory, CPU management and abstraction techniques using a hypervisor, Virtual Machine Data Protection: Backup and recovery of virtual machines using data recovery techniques.

11 20

MODULE 6 Scalability: Scalability features within Enterprise virtualized environments using advanced management applications that enable clustering, distributed network switches for clustering, network and storage expansion

7 20



04 IT 7113 GEOSPATIAL INFORMATION

MANAGEMENT

3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


• 1.To inspire the students with interest, excitement, and urge to learn the subject of geospatial

information management

• To understand the fundamental concepts of geospatial information management

• To introduce the purpose of learning important aspects of geospatial information management

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of geospatial

information management.

Text Books:

1. GIS Fundamentals: A First Text on Geographic Information Systems Paul Bolstad, 4th edition,

Eider Press. http://www.atlasbooks.com/marktplc/00729.htm

References:

1. Thakur, J.K., Singh, S.K., Ramanathan, A., Prasad, M.B.K., Gossel, W. (Eds), Geospatial

Techniques for Managing Environmental Resources, Springer, 2012.

2. Sample, John T., Ioup, Elias, Tile-Based Geospatial Information Systems Principles and Practices,

Springer, 2010.


COURSE PLAN


04 IT 7113 GEOSPATIAL INFORMATION MANAGEMENT 3-0-0: 3

MODULES Contact

hours

Sem. Exam

Marks;%

MODULE : 1

The use and the science of GIS - Components of a GIS - - Using GIS to solve

problems at multiple scales -Vector and raster systems - Scale, resolution,

map projection Coordinate systems

8 15

MODULE : 2

Role of GIS in studying food, agricultural, and environmental systems-Geo-

referencing & Global Positioning Systems (GPS) -Geo-referencing & Global

Positioning Systems (GPS)

7 15


MODULE : 3

Representing fields: raster, TIN, quad trees, polygons - Uncertainty

propagation,Understanding spatial data models and file formats

,Representing geographic entities in data form: raster and vector data

models

10 15

MODULE : 4

Understanding the data structure: coordinate values and attribute

tables,Common file formats used in GIS - Management of spatial data ,

Converting between file formats - Joins and relates- Working with attribute

tables (selecting data, summarizing data, field calculator)

8 15


MODULE : 5

Common vector-based functions - Selection and classification -

Aggregation of data (dissolving boundaries) - Buffers - Spatial overlay:

clips, intersects, and unions

8 20

MODULE : 6

Common raster-based functions - Concept of “map algebra” - Reclassifying

and smoothing data - Raster “overlay” - Working with raster and vector

data together

7 20



04 IT 7115 CONVERGED NETWORKS 3-0-0: 3 2015

Pre-requisites: Nil

Course Objectives:


• To inspire the students with interest, excitement, and urge to learn the subject of theoretical

foundations in computer networking

• To understand the fundamental concepts in VoIP,QoS

• To introduce the purpose of learning important subjects in networking for meeting the

requirement of various professional field applications.

Syllabus




Course Outcome:

The student will demonstrate the ability to understand the basic concepts of QoS parameters

of computer networks

Text Books:

1. Scott Firestone, ThiyaRamalingam, Steve Fry 2007, Voice and Video Conferencing

Fundamentals, 1st Ed. Ed., Cisco Press [ISBN: 978-1-58705-268-7]

2. Luc De Ghein 2006, MPLS Fundamentals, 1st Ed. Ed., Cisco Press [ISBN: 978-1-58705-197-5]

References:

1. Christina Hattingh, Darryl Sladden, ATM ZakariaSwapan 2010, SIP Trunking, CiscoPress [ISBN:

978-1-58705-944-4]

2. Eric Osborne, Ajay Simha 2003, Traffic engineering with MPLS, Cisco Press [ISBN:978-

1587050312]

3. Amir Ranjbar 2007, CCNP ONT Official Exam Certification Guide, Cisco Press[ISBN: 978-1-58720-

176-3]

4. Website: Cisco Systems Inc. 2006, Voice/Data Integration Technologies

http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/voicdata.htm


COURSE PLAN

COURSE CODE: COURSE TITLE: CREDITS

04 IT 7115 CONVERGED NETWORKS 3-0-0: 3

MODULES Contact

hours

Sem.Exam

Marks;%

MODULE : 1

Teleworker Solutions: Cable and DSL Technology, cable system

components and benefits DOCSIS ,HFC Cable Network Architecture; DSL

Variants, DSL performance and distance limitations

10 15

MODULE : 2

Real-time Applications in a Converged Network: Review of Traditional

Voice Networks; Codec / Vocoder Technologies; VoIP Transport; Real-

Time Concerns; RTP/RTCP

8 15


MODULE : 3

H.323 and SIP as signaling protocols; Cloud-based VoIP & Video services

QoS for a Converged Network: IP QOS review of QoS

9 15

MODULE : 4

802.1p/q; Queuing mechanisms – WFQ, CBWFQ,Low-Latency,

Random Early Detection; Integrated Services; Reservation Protocol

(RSVP); Differentiated Services (Diffserv)

8 15

SECOND INTERNAL TEST (MODULE 3&4)

MODULE : 5

QoS issues in WANs; implementation of DiffservQoS model

Multiprotocol Label Switching: MPLS Header; MPLS forwarding basics;

Quality of service with MPLS TE; MPLS VPN applications; implementation

of MPLS and MPLS VPN

9 20

MODULE : 6

IP Multicast: Multicast addressing; IGMP, IGMP snooping; Multicast

routing protocols (PIM-DM, -SM, SDM); Configuration

4 20



04 IT 7191 Seminar-2 0-0-2: 2 2015

Each student shall present a seminar on any topic of interest related to the core / elective courses

offered in the first semester of the M. Tech. Programme. He / she shall select the topic based on the

references from reputed International Journals, preferably IEEE/ACM/Springer/Elsevier journals. They

should get the paper approved by the Programme Coordinator / Faculty member in charge of the

seminar and shall present it in the class. Every student shall participate in the seminar. The students

should undertake a detailed study on the topic and submit a report at the end of the semester. Marks

will be awarded based on the topic, presentation, participation in the seminar and the report submitted.


04 IT 7193 Project (Phase 1) 0-0-12: 6 2015

Course Objectives:

The project work aims to develop the work practice in students to apply theoretical and practical tools/techniques to solve real-life problems related to industry and current research.

The project work can be a design project/experimental project and/or computer simulation project on any of the topics related to the stream of specialisation. The project work is chosen/allotted individually on different topics. Work of each student shall be supervised by one or more faculty members of the department. The students shall be encouraged to do their project work in the parent institute itself. If found essential, they may be permitted to carry out their main project outside the parent institute, subject to the conditions specified in the M. Tech regulations of the Kerala Technological University. Students are encouraged to take up industry problems in consultation with the respective supervisors.

The student is required to undertake the main project phase-1 during the third semester and the same is continued in the 4th semester (Phase 2). Phase-1 consist of preliminary work, two reviews of the work and the submission of a preliminary report. First review would highlight the topic, objectives, methodology and expected results. Second review evaluates the progress of the work, preliminary report and scope of the work which is to be completed in the 4th semester.


04 IT 7194 Project (Phase 2)

0-0-21: 12 2015


Main project phase II is a continuation of project phase-I started in the third semester. There

would be two reviews in the fourth semester, first in the middle of the semester and the second at the end of the

semester. First review is to evaluate the progress of the work, presentation and discussion. Second review would

be a pre -submission presentation before the evaluation committee to assess the quality and quantum of the work

done. It is encouraged to prepare at least one technical paper for possible publication in journals or conferences.

The papers received acceptance before the M. Tech evaluation will carry specific weightage. The project

report (and the technical paper(s)) shall be prepared without any plagiarised content and with adequate citations,

in the standard format specified by the Department /University.

Documents

M. Tech Information Technology (Network Engineering)