UNIVERSITY OF KERALA

 

REGULATIONS, SCHEME & SYLLABUS

for

M.Tech Degree Programme

in

Network Engineering

( 2010 Scheme )

 

M.Tech. DEGREE COURSE REGULATIONS

w.e.f. 2010 ADMISSIONS

1. General

The M.Tech degree course for 2 years comprises of 4 semesters. Duration is counted from the first registration date of the student (in the first semester). Credit system is adopted for the course. Grade point average is calculated on the basis of all courses taken by the student. The total credits for the course is 69. The distribution of these credits among the various course works is as follows:

 

2. Distribution of credits among the various Course Work (Table 1)

 

Course Work	Weekly hours	Credits Allotted
Theory Subject	3	3
Seminar	2 or 3	2
Laboratory	2or3	1
Project - Part 1	-	3
Industrial Training /interaction	-	1
Research Methodology	-	1
Thesis - Preliminary	-	4
Thesis - Final	-	12

 

 

 

3. Distribution of credits among the four semesters (Table 2)

 

Semester	Course work content	Total credits allotted	Allotted credits semester  wise
I	6 Theory Subjects	6 x 3 = 18	22
	Seminar	1 x 2 = 2
	Laboratory	1 x 1 = 1
	Project - Part I (to be continued in the second  semester)	1 x 1 = 1
II	6 Theory  Subjects: 2 core subjects, 2 Stream   Electives ,1 Departmental elective and 1 Non   departmental Interdisciplinary Elective	2 x 3 + 2 x 3 +1 x 3 + 1 x 3 = 18	23
	Laboratory	1 x l = 1
	Seminar	1 x 2 = 2
	Project - Part 2	1 x 2 = 2
III	2 Theory subjects(Stream Electives)	2 x 3 = 6	12
	Research Methodology	1 x 1 = 1 i-
	Industrial Training	1 x 1 = 1
	Thesis - Preliminary	1 x 4 = 4 """.
IV	Thesis	12	12
	Total credits for four semesters		69

 

4. Details of course work contents:  

4.1 Academic Committee

This refers to the Academic Committee of the concerned institution comprising of (i) Principal, (ii) Dean (PG studies) (iii) Heads of all departments offering PG Courses and (iv) Course coordinators of PG Courses in the departments offering PG Courses.

4.2 Course Coordinator

The Professor in charge of PG Courses in each department will be the course coordinator.

4.3 Department Committee

Each Department will have a Department Committee to look after the PG Course. This Committee will consist of (i) Head of the Department (ii) The Course coordinator (iii) Faculty in charge of each Stream and (iv) One student representative.

4.4 Evaluation Committee

Each Department has to constitute an evaluation committee to evaluate seminars, projects, pre-submission seminar for the Thesis etc., consisting of at least three members. The internal guide and another expert in the area of specialization shall be the two essential members of this committee.

4.5 Course Work Content

Semester I : The student has to credit 6 theory subjects. All the subjects will be core subjects out of which one will be from the area of Mathematics. In addition, the student has to take up 1 Seminar, 1 Laboratory and a project which is to be continued in the second semester and to be completed by the end of second semester.

 

Semester II: The student has to credit 6 theory subjects, one seminar, one laboratory, and one project (continuation of Project-part 1) in this semester. Among the six subjects, one would an inter disciplinary elective as advised by the course coordinator in consultation  with the academic Committee: two would be the core subjects offered in the stream concerned, two would be stream electives and remaining one would be a departmental elective. Stream and departmental electives are to be selected from the list of electives for each department. The student has to continue the project work commenced in the first semester and submit a project report at the end of this semester.

 

The seminar which the student has to credit would be on a topic different from his/her project work.

 

Semester III : The student has to credit 2 subjects from the Stream Electives listed and a course on research methodology. He/She has to undergo an Industrial Training during the semester break after semester II and complete it within 15 calendar days from the start of the III semester. For crediting the industrial Training/Interaction, the student has to undertake the training in an Industrial organization / R&D organization for a period of not less than two weeks. The student is required to submit an industrial training report and present it before the evaluation committee.

Thesis Preliminary comprises of a preliminary thesis work, two seminars and submission of thesis preliminary report. The first seminar would highlight the topic, objectives, methodology and expected results. The first seminar shall be conducted in the first half of this semester. The second seminar is the presentation of the work they have completed for the thesis- preliminary and scope of the work, which is to be accomplished in the fourth semester.

Weightages for the 4 credits allotted for the Thesis Preliminary

1. Internal evaluation of the thesis- preliminary work by the guide -50%

2. Internal evaluation of the thesis- preliminary by the Evaluation Committee – 50%

 

Semester IV : In the fourth semester there will be only thesis work. The fourth semester thesis must be the extension of thesis preliminary work. Towards the end of the semester there would be a pre- submission seminar to assess the quality and quantum of the work by the Evaluation Committee. This would be the pre-qualifying exercise for the students for getting approval from the Department Committee for the submission of Thesis. At least one technical paper is to be prepared for possible publication in Journals/ Conferences. The final evaluation of the Thesis would be external evaluation. The 12 credits allotted may be proportionally distributed between external and internal evaluation as follows. As far as possible, the student shall be encouraged to do their work in the parent institute itself.

Weightages of marks for the Thesis

Internal Evaluation of the Thesis by the guide                                     200 marks

Internal Evaluation of the Thesis by the Evaluation Committee            200 Marks

Final Evaluation of the Thesis by the Internal and External Examiners

(Evaluation of Thesis: 100 marks + Viva : 100 marks)                             200 Marks

 

           Facility for Students to do thesis outside the parent Institute

As far as possible the students shall be encouraged to do their work in the parent institute itself. However if found essential, they may be permitted for continuing their Thesis in the 4^th semester outside the parent institute with the approval of the Department Committee. For students who are availing this facility, the following conditions are to be observed.

 

1.     The student has to get prior approval from the Department Committee for availing this facility as well choice of the Institution/Industry/ R &D organization with which the student is associated for continuing his/her thesis work.

2.     If they are doing their thesis work in an Educational Institute then the institute is to be preferably an institution of national repute like IITs, IISc, etc.

3.     Students availing this facility should continue as regular students of the parent institute itself.

4.     They should have a guide each in the parent institution and the external Institution/industry/R &D organization with which the student is associated for doing the thesis work.

5.     The student has to furnish a certificate from the guide of the organization concerned stating the willingness to supervise the thesis work through the Institution / industry  / R&D organization with which the student is associated for his /her thesis work and has to submit the same to the Department Committee.

6.     The student has to furnish his/her monthly progress as well as attendance report signed by the external guide and submit the same to the concerned Internal Guide.

7.     The external guide and the internal guide are to be preferably present during all the stages of evaluation of the thesis work. In case the external guide is not present, the internal guide can alone take the responsibility of conducting the evaluation.

5. Evaluation Process

In the first semester, second semester and the third semester, all the subjects to be credited are evaluated through internal assessment and examinations. The written examination for the first semester will be conducted by the University. The written examination for the second and third semester would be through internal examination. The internal examination in the second and third semester has to be valued by two examiners; the first examiner being the staff member handling the subject and a second examiner specialized in the area of the subject.

 

The seminar, project, Industrial Training / Interaction programme etc will be evaluated by the Evaluation Committee. The laboratory work will be evaluated by the staff member/(s) concerned.

 

In the 3rd semester, Thesis-Preliminary will be evaluated by the Evaluation Committee. The internal evaluation of the Thesis in the 4th semester would be done by the Evaluation Committee. Final evaluation of Thesis would be conducted by the guide and an expert from outside the Institution appointed by the University.

 

The evaluation of Thesis work will be taken up only after the students completes all core, elective as well as other course requirements satisfactorily.

5.1 Weightage of marks

 

The following will be the weightage of marks for the different subject

a.    Theory subjects

             Continuous assessment                                               -  50 marks

 University/ internal examination                                 - 100 marks

 (For continuous evaluation, minimum 4 assignments and 2 tests shall  be considered. The marks shall be distributed as follows:  Attendance 20%, Assignment- 30% and Tests- 50%)

b.    Laboratory based subjects    

Continuous assessment -  50 marks

 "., .

5.2 Grade and Grade Points

 

A student is awarded a letter grade in each course he/she has registered for, indicating his/ her overall performance in that course. There are eight letter grades S, A, B, C, D, E, F and 1. The correspondence between grades and points (on a 10- point scale) rating is given in Table 3. 

If a student does not satisfy all the requirements for a course during the second and/or third semester for a genuine reason, the teacher concerned may award grade I (incomplete). The student will be given a chance to satisfy the requirements within a stipulated date as decided by the Department Committee. Once the student satisfies this within the time, the I grade will be converted by the Department committee to a regular letter grade. If the student fails to satisfy the requirements within this extra time allotted then, I grade is automatically converted to an F Grade.

5.3 Substitution of courses                    

A student getting an F or E grade in a course must either reappear for the subsequent chance of the examination or substitute the course with another course as suggested by the Department committee. The student is allowed for substitution only if the course concerned is not a core course. A student is not allowed to register for more than one semester at a time. Hence substitution is allowed only after completing the regular course work.

5.4 Classification of Grades based on Marks Scored (Table 3)

The Grades are allotted based on the percentage of total marks (Continuous evaluation and Written examination put together) scored by the student in each subject. Appropriate grades in that subject is then allotted based on the classification given in Table 3. In case a student has taken more than two chances in passing a subject only minimum pass grade D will be allotted in that subject irrespective of the actual marks scored.

Sl No	Percentage of Marks	Grades Allotted	Grade Points
1	90 % and Above	S	10
2	80 % or Above But less than 90 %	A	9
3	70 % or Above But less than 80 %	B	8
4	60 % or Above But less than 70 %	C	7
5	50 % or Above But less than 60 %	D	6
6	40 % or Above But less than 50 %	E	4
7	Less than 40 %	F	0
8		I	Incomplete

 

5.5  Computation of SGPA ( Semester Grade Point Average) and CGPA (Cumulative Grade Point Average)

The SGPA is an overall academic performance of a student in all the courses he/she has registered during a given semester. It is computed as follows: If a student is awarded G1, G2 etc grades in courses with corresponding credit units U1, U2 etc, the SGPA is given by

             SGPA = (U1 * G1 + U2 * G2 + …) / (U1+U2+…)

Similarly the CGPA indicates the cumulative academic performance in all the courses taken including the current semester.

            CGPA for  i^th  semester = ∑ ( (SGPA) _i * S_i ) / ∑ S_i

Where (SGPA)_i = SGPA in the ith semester and S_i = total credits in the ith semester

 

5.6  Academic performance requirement:

 

The minimum CGPA requirement for the M. Tech Programme is 6.0 in every semester with the following provisions. If a student scores CGPA below 6 in any semester he/she may be allowed to continue in the programme only on the recommendation of the Academic Committee. A student is given only-three chances to reappear for the examination in the subject in which he has failed' (scoring E or F Grade) within a period of 5 years from the time of his/her registration to the M Tech course, provided the student has obtained minimum attendance requirement.

 

5.7   Class Distinction

 

Minimum pass requirement for each written paper is 50%. A student is eligible for the degree on completion of 69 credits obtaining at least D in each subject and a CGPA of at least 6.0. A student is placed in first class with Distinction if he/she has CGPA >= 9. He/ she is placed in First Class if his/ her CGPA is 7>= and < 9. Incase a student has taken more than two chances in passing a subject only minimum pass grade D will be considered in that subject for classification purposes.

5.8   Attendance Requirements  (Table 4)

A student should have a minimum of 75% attendance in all the semesters. Medical leave is granted only twice during the entire duration of the M Tech (two years) and the student becomes eligible to avail the medical leave only if he/she has a minimum of 60% attendance. The percentage of attendance for a subject will be indicated by a code number/letter as given in Table 4 will be included in the grade card:

 

Attendance Rounded to	Code
95% and above	H
85% to 94%	9
75% to 84%	8
Below 75%	W

 

6. Structure of Syllabus and Question Paper:

 

The syllabus would be of non-modular structure: The question paper shall cover entire syllabus and contain 20% choice.

 

7. Time limit for completion of Coursework:

 

The student who has registered for the M. Tech course has to complete all the requirements for awarding the degree within 5 years from the date of admission to the course.

 

 

 

Scheme of Studies

 

Network Engineering

SEMESTER I

 

Code	Name of Subject	Credits	Hrs Per Week	Duration of Exam	Evaluation ( Mark )
					Internal	External	Total
INC1001	Mathematical Foundations of Computing Systems	3	3	3	50	100	150
INC1002	Advanced Computer Architecture	3	3	3	50	100	150
INC1003	Advanced Operating Systems	3	3	3	50	100	150
INC1004	Distributed Systems and Algorithms	3	3	3	50	100	150
INC1005	Network Engineering and Management	3	3	3	50	100	150
INC1006	Applied Cryptography	3	3	3	50	100	150
INS1101	Seminar	2	2	-	50	-	50
INP1102	Computer Networks Lab	1	2	-	50	-	50
INP1103	Project – Part I	1	-	-	50	-	50
Total		22	22		450	600	1050

 

 

SEMESTER II

 

Code	Name of Subject	Credits	Hrs Per Week	Duration of Exam	Evaluation ( Mark )
					Internal	External	Total
INC2001	Network Security	3	3	3	50	100	150
INC2002	Modern Computing Paradigms	3	3	3	50	100	150
*	Elective I ( Stream)	3	3	3	50	100	150
*	Elective II ( Stream)	3	3	3	50	100	150
*	Elective III                        ( Department)	3	3	3	50	100	150
**	Elective IV(Interdisciplinary)	3	3	3	50	100	150
INS2101	Seminar	2	2	-	50	-	50
INP2102	Software Testing Lab	1	2	-	50	-	50
INP2103	Project – Part II	2	-	-	100	-	100
Total		23	22		500	600	1100

 

** Students can select a subject from the subjects listed under interdisciplinary electives for the second semester as advised by the course coordinator.

* Students can select a subject from the subjects listed under department electives for the second semester as advised by the course coordinator.

 

 

 

SEMESTER III

 

 

Code	Name of Subject	Credits	Hrs Per Week	Duration of Exam	Evaluation ( Mark )
					Internal	External	Total
*	Elective V ( Stream )	3	3	3	50	100	150
*	Elective VI ( Stream )	3	3	3	50	100	150
INC3101	Research Methodology	1			50		50
INC3102	Industrial Training	1			50		50
INP3101	Thesis Preliminary	4	14		200		200
Total		12	20		400	200	600

 

SEMESTER IV

 

Code	Name of Subject	Credits	Hrs Per Week	Duration of Exam	Evaluation ( Mark )
					Continuous Assessment			University Exam		Total
					Guide	Others		Thesis	Viva
INP4101	Thesis Final	12	29	3	200	200		200	200	600
Total		12	29		200		200	200	200	600

 

Note : 6 to 10 hrs/week is for department assistance

 

 

Electives I , II & III ( Stream / Department Elective )

 

Code	Name of Subject
INE2001	Data Warehousing and Data Mining
INE2002	Network Routing Algorithms
INE2003	High Speed Switching Architecture
INE2004	Neural Networks and Applications
INE2005	Soft Computing
INE2006	Advanced Database Systems
INE2007	Biometric Security
INE2008	Cellular Communication
INE2009	Embedded Networking
INE2010	Web Technologies

 

 

 

Elective IV ( Interdisciplinary )

 

Code	Name of Subject
INE2011	Advanced Techniques in Operations Research
INE2012	Advanced Digital Signal Processing
INE2013	Advanced Graph Theory
INE2014	Service Oriented Architecture

 

 

Elective V & VI ( Stream)

 

Code	Name of Subject
INE3001	Mathematical Models for Internet
INE3002	Performance Evaluation of Computer Systems & Networks
INE3003	High Performance Scientific Computing
INE3004	Component Based Technology
INE3005	Network Architecture & Design
INE3006	Information Retrieval
INE3007	Intelligent Systems
INE3008	Interconnection Networks

 

 

 

 

 

 

 

Syllabus of Studies

 

 

 

NETWORK ENGINEERING
SEMESTER I

 

INC1001      MATHEMATICAL FOUNDATIONS OF COMPUTING SYSTEMS      3-0-0-3

 

Formal Logic - Statements, Symbolic Representations, and Tautologies,Propositional Logic, Quantifiers, Predicates, and Validity, Predicate Logic, Logic Programming, Proof of Correctness. Proof Techniques – Induction, More on Proof of Correctness, Recursion and Recurrence Relations, Analysis of Algorithms .

Sets and Combinatorics – Sets, Counting, Principle of Inclusion and Exclusion and the Pigeonhole Principle, Permutations and Combinations, Binomial Theorem

 

Relations, Functions, and Matrices – Relations, Topological Sorting, Relations and Databases, Functions, Matrices

Graphs and Trees - Graphs and Their Representations, Trees and their Representations, Decision Trees, Huffman Codes

Graph Algorithms - Directed Graphs and Binary Relations; Warshall's Algorithm, Euler Path and Hamiltonian Circuit, Shortest Path and Minimal Spanning Tree, Traversal Algorithms, Articulation Points and Computer Networks

 

      Queuing Theory- Arrival and Departure Distributions-Types of Queues-  Queuing models

Boolean Algebra and Computer Logic -The Boolean Algebra Structure, Logic Networks, Minimization

Modeling Arithmetic, Computation, and Languages - Algebraic Structures, Finite-State Machines, Turing Machines, Formal Languages

 

TEXTBOOK

1.   Judith L. Gersting, “Mathematical Structures for Computer Science”, 5thEdition, W.H. Freeman and   Company,    2003.

REFERENCES

1. 1. J. P. Tremblay and R. Manohar, “Discrete Mathematical Structures with Applications to Computer           Science”, TMH, 1997.
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 5th Edition, TMH, 2003.
3. R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson Edition, 2002.
4. 4. M.K. Venkataraman, N. Sridharan and N. Chandrasekaran, “Discrete Mathematics”, The National   Publishing Company, 2003.

 

 

 

INC 1002                  ADVANCED COMPUTER ARCHITECTURE                             3-0-0-3

 

FUNDAMENTALS OF COMPUTER DESIGN - Measuring and Reporting Performance – Quantitative Principles of Computer Design – Classifying Instruction set Architecture – Memory Addressing – Addressing Modes – Type and Size of Operands – Operations in the Instruction Set – Operands and Operations for Media and Signal Processing – Instructions for Control Flow – Encoding an Instruction Set – Example Architecture – MIPS and TM32. INSTRUCTION LEVEL PARALLELISM - Pipelining and Hazards – Concepts of ILP – Dynamic Scheduling – Dynamic Hardware Prediction – Multiple Issues – Hardware based Speculation – Limitations of ILP – Case Studies – lP6 Micro Architecture

 

INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACH - Compiler Techniques for Exposing ILP – Static Branch Prediction – Static Multiple Issue. VLIW – Advanced Compiler Support – Hardware Support for Exposing Parallelism – Hardware Vs Software Speculation. Mechanism – IA 64 and Itanium Processor. MEMORY AND I/O- Cache Performance – Reducing Cache Miss Penalty and Miss Rate – Reducing Hit Time – MainMemory and Performance

 

Memory Technology – Types of Storage Devices – Buses – RAID – Reliability– Availability and Dependability – I/O Performance Measures – Designing I/O System.  MULTIPROCESSORS AND THREAD LEVEL PARALLELISM - Symmetric and Distributed Shared Memory Architectures – Performance Issues – Synchronization – Models of Memory Consistency – Multithreading.

 

TEXTBOOK

John L. Hennessey and David A. Patterson, “Computer Architecture A Quantitative Approach”, 3rd Edition, Morgan Kaufmann, 2003.

 

REFERENCES

1. D. Sima- T. Fountain and P. Kacsuk, “Advanced Computer Architectures A Design Space Approach”, Addison Wesley, 2000.
2. Kai Hwang, “Advanced Computer Architecture Parallelism Scalability Programmability”, Tata Mcgraw Hill, 2001.
3. Vincent P. Heuring, Harry F. Jordan, “Computer System Design and Architecture”, 2^nd Edition, Addison Wesley, 2004.

 

 

 

INC1003              ADVANCED OPERATING SYSTEMS                                 3-0-0-3

 

                

OPERATING SYSTEM - Introduction - operating systems and services – CPU Scheduling approaches – Process synchronization Semaphores – Deadlocks – Handling deadlocks – Multithreading. DISTRIBUTED SYSTEMS - Introduction - Advantages of distributed system over centralized system, Limitations of Distributed system; Communication in Distributed systems – ATM, Client-Server model. Distributed operating system – Issues, Communication primitives – Message Passing Model, Remote Procedure Call

 

SYNCHRONIZATION IN DISTRIBUTED SYSTEMS - Clock synchronization–Lamport’s logical clock, Vector clock,  Causal ordering of messages, Causal Ordering of Messages; Mutual exclusion – Non token based and token based algorithm; atomic transactions; Distributed deadlock detection and prevention. DISTRIBUTED RESOURCE MANAGEMENT - Distributed file system – Trend, Design and Implementation; Distributed Shared Memory (DSM) – Memory coherence, Page based DSM, Shared variable DSM, Object based DSM; Distributed Scheduling.

 

FAILURE RECOVERY AND FAULT TOLERANCE - Recovery – Classification, Backward and forward error recovery, Recovery in concurrent systems, synchronous checkpointing and recovery, Checkpointing for Distributed database system. Fault tolerant – commit protocols, Voting protocols, Dynamic vote reassignment protocol, Failure Resilient processes.

 

 

 

REFERENCES:

1.     Andrew S. Tanenbaum, “Distributed Operating Systems”, Pearson Education Asia, 1995.

2.    Mukesh singhal and Niranjan G. Shivarathri, “Advanced Concepts in Operating Systems”, Tata McGraw Hill, 1994..

3.    Silberschatz, Galvin, “Operating System Concepts”, John Wiley, 2003.

4.    Stallings, “Operating system”, PHI, New Delhi, 2004.

 

 

 

 

INC1004                   DISTRIBUTED SYSTEMS AND ALGORITHMS          3-0-0-3

 

Introduction, Synchronous Network Model, Leader election in a synchronous ring, Algorithms in general synchronous networks, Distributed consensus with link failures, Distributed consensus with process failures.

 

Asynchronous system model, Asynchronous shared memory model, mutual exclusion, resource allocation, consensus, atomic objects, basic asynchronous network algorithms, synchronizers.

 

Shared memory versus networks, logical time, global snapshots and stable properties, network resource allocation, partially synchronous system models.

 

 

REFERENCES:

1.     Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman

2.    Gerard Tel, “Introduction to Distributed Algorithms”, Cambridge University Press

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

INC1005                 NETWORK ENGINEERING AND MANAGEMENT          3-0-0-3

                                                                

Networking Components, Overview of Network Management, Network Management Strategies, Configuration Client/Server Components, Configuration: Infrastructure Components.
SNMP,MIBs,RMON,RMON2.TrafficEngineering.
                                                           

 

Desktop Management, Web-based Management, Network Management Initiatives, Secure SNMPv3.                                                                            

 

 

TEXT BOOKS

1. J Richard Burke, “Computer Network Management: Concepts and Practice, a Hands- On Approach “, Pearson Education.
2. Mani Subramanian, “Network Management Principle and Practice”, 1^st Edition, Pearson    Education, 2004.

 

REFERENCES

1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw Hill, 2004.
2. William Stallings, “Data and Computer Communication”, 6^th Edition, Pearson Education,    2000.
3. Douglas E. Comer, “Internetworking with TCP/IP Volume I”, PHI, 1997.

 

 

 

 

 

INC1006                                    APPLIED CRYPTOGRAPHY                            3-0-0-3

                                                             

Classical Cryptography-The Shift Cipher,The Substitution Cipher,The Affine Cipher - Cryptanalysis-Cryptanalysis of the Affine Cipher,Cryptanalysis of the Substitution Cipher,Cryptanalysis of the Vigenere Cipher,Shannon’s Theory - Block Cipher and the Advanced Encryption Standard-Substitution -Permutation Networks, Linear Cryptanalysis,    Differential Cryptoanalysis -  The Data Encryption Standard, The Advanced Encryption Standard, Modes of Operation ,Cryptography Hash Function-Hash Function and Data Integrity,Security of Hash Function ,Iterated Hash Functions-Message Authentication Codes.

The RSA Cryptosystem - Introduction to Public–key Cryptography, Number theory,The RSA Cryptosystem, Attacks on RSA, The ELGamal Cryptosystem, Shanks’ Algorithm,Finit Fields,Elliptic Curves over the Reals, Elliptical Curves Modulo a Prime,Signature Scheme –Digital Signature Algorithm. Identification Scheme and Entity Attenuation-Challenge – and – Response  in the Secret-key Setting,Challenge–Response  in the Public key Setting,The Schnorr Identification Scheme, Key distribution - Diffie-Hellman key exchange, Unconditionally Secure key Predistribution, Key Agreement Scheme- Diffie-Hellman Key agreement, PKI, Certificates,Trust Models.

 

Secret Sharing Schemes-The Shamir Threshold Scheme,Access Structure and General Scret key sharing, Information Rate and Construction of Efficient Schemes, Multicast Security and Copyright production- Multicast Security, Broadcast Encryption, Multicast Re-keying, Copyright Protection ,Tracing Illegally Redistribution keys.

 

REFERENCES

1.     Douglas R. Stinson ,“Cryptography Theory and Practice ”, Third Edition, Chapman & Hall/CRC,2006

2.    Menges A. J , Oorschot P, Vanstone S.A,“Handbollk of Appliled Cryptography”  CRC Press,1997. 

3.    William Stallings, “Cryptography and Network Security: Principles and Practices”, Third Edition, Pearson Education,2006.

4.    4. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education,    First Edition, 2006.

5.    Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Fourth       Edition, Pearson Education, 2007.

6.    Wade Trappe and Lawrence C. Washington, “Introduction to Cryptography with Coding Theory” Second Edition, Pearson Education, 2007.

INS1101                                             SEMINAR                                          0-0-2-2

      

 

Each student is required to select a topic on advanced technologies in Network Engineering/ Computer Science / Information Technology, and get it approved for a seminar to be presented in the class. Each student should also prepare a well documented report on the seminar as per an approved format and submit to the department. The seminar and report will be evaluated for the award of sessional marks.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

INP1102                         COMPUTER NETWORKS  LAB                                 0-0-2-1

      

Familiarization of different network cables – Color coding – Crimping

 

Experiments using routers & switches – Configuring routers – Implementing static & dynamic routing – Implementing BGP – Configuring switches – VLAN – VTP – VTP pruning – Implementing inter VLAN routing  - Backup & recovery of configuarion files of a router using tftp server  - Access control List  - Configuring PPP

 

Experiments using wireless networking

 

Experiments on network  security – Network reconnaissance – Network sniffers – address spoofing – network monitoring – Configuring firewalls, IDS and VPN – wireless security tools

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

INP1103                                            PROJECT PART – I                             3-0-0-3

 

 

The student has to undertake an individual project work on advanced technologies in Network Engineering/ Computer Science / Information Technology, submit a project report, which will be evaluated by the Evaluation Committee. The project has two parts: Part I in Semester I & Part II in Semester II. The project can be conveniently divided into two parts as advised by the guide and the first part is to be completed in 1^st semester. The student has to submit a report of the work completed in soft bonded form and to make a multimedia presentation before the evaluation committee at the end of the semester. The second volume is the final project report to be submitted in the second semester.

 

 

Marks Distribution

 

Project Work and Report Evaluation: 25

Presentation & Viva Voce: 25

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

SEMESTER II

.

INC2001                                         NETWORK SECURITY                             3-0-0-3

 

Attacks – Services – Mechanisms – Conventional Encryption – Classical and Modern Techniques – Encryption Algorithms – Confidentiality.RSA – Elliptic Curve Cryptography – Number Theory Concepts.

 

 

Hash Functions – Digest Functions – Digital Signatures – Authentication Protocols. Authentication– Applications – Electronic Mail Security – IP Security – Web Security.

 

Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems.

 

TEXT BOOK

 

Stallings, “Cryptography & Network Security, Principles & Practice”, 3rd Edition,  Prentice Hall, 2002.

 

REFERENCES

1. Bruce, Schneier, “Applied Cryptography”, 2nd Edition, Toha Wiley & Sons, 1996.

2. Man Young Rhee, “Internet Security”, Wiley, 2003.

3. Pfleeger & Pfleeger, “Security in Computing”, 3rd Edition, Pearson Education, 2003

 

 

 

 

 

 

 

 

 

 

 

 

 

INC2002                              MODERN COMPUTING PARADIGMS                3-0-0-3

 

 

High performance computing - cluster, grid, meta-computing, middleware. Programming models: shared memory, message passing, peer-to-peer, broker-based. Introduction to PVM and MPI.

Issues in cluster design: performance, single-system-image, fault tolerance, manageability, load balancing, security, storage. Architecture of Grid systems. Grid security infrastructure.

 

Cloud Computing – Cloud Architecture – Cloud Storage – Cloud Services. Types of Cloud Service Development – Software as a Service – Platform as a Service – Web Services – On-Demand Computing – Discovering Cloud Services.

Virtualization  - Virtualization Types – Desktop Virtualization – Network Virtualization – Server and Machine Virtualization – Storage Virtualization – Virtual Machine Basics – Hypervisor - Server Consolidation.

Software framework for distributed computing - MapReduce - Hadoop.

REFERENCES

1.     Joshy Joseph & Craig Fellenstein, “Grid Computing”, PHI, PTR, 2003.2. Ahmar Abbas, “Grid Computing A Practical Guide to technology and applications”,CharlesRiver media , 2003.

2.    Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online, Que Publishing, August 2008.

3.    Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008.

 

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

 

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

 

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

 

INS2101                                    SEMINAR                                                    0-0-2-2

 

 

Each student is required to select a topic on advanced technologies in Network Engineering/ Computer Science / Information Technology, and get it approved for a seminar to be presented in the class. Each student should also prepare a well documented report on the seminar as per an approved format and submit to the department. The seminar and report will be evaluated for the award of sessional marks.

 

INP2102                             SOFTWARE TESTING LAB                                0-0-2-1

 

      

Understanding Software Testing Tasks – Test planning – Test automation – Problem reporting – Test reporting

 

Experiments on testing Object oriented software  - Unit Testing – Integration Testing - System testing – Regression Testing – Acceptance testing

 

Experiments on testing Web applications – Functional testing – Usability Testing – Navigation Testing – Forms Testing – Page content testing 

 

Experiments on Performance testing – Scalability testing – Load testing – Stress testing – Configuration & Compatibility testing

 

Experiments on Security testing – End to end transaction testing – Database testing –Post implementation testing 

INP2103                                          PROJECT PART II                                  0-0-0-2

 

 

The student has to complete the project work started in the I^st semester and  submit a project report, which will be evaluated by the Evaluation Committee.

 

 

 

Marks Distribution

 

Project Work and Report Evaluation :  50

Presentation & Viva Voce                 :  50

 

 

 

 

 

 

 

 

 

 

SEMESTER III

 

 

 

INC3101                       RESEARCH METHODOLOGY                          3-0-0-1

 

 

Introduction - Meaning of research - Objectives of research - Motivation in research - Types of research - Research approaches - Significance of research - Research methods vs Methodology - Criteria of good research.

 

Defining Research Problem - What is a research problem - Selecting the problem - Necessity of defining the problem - Literature review - Importance of literature review in defining a problem - Critical literature review - Identifying gap areas from literature review

 

Research design - Meaning of research design - Need- Features of good design - Important concepts relating to research design - Different types - Developing a research plan

 

Method of data collection - Collection of data- observation method - Interview method ­Questionnaire method - Processing and analysis of data - Processing options - Types of analysis - Interpretation of results

 

Report writing - Types of report - Research Report, Research proposal ,Technical paper ­Significance - Different steps in the preparation - Layout, structure and Language of typical reports - Simple exercises - Oral presentation - Planning - Preparation - Practice - Making presentation - Answering questions - Use of visual aids - Quality & Proper usage - Importance of effective communication - Illustration .

REFERENCES

1. Coley S M and Scheinberg C A, 1990, Proposal Writing, Newbury Sage Publications.
2. Leedy P D, Practical Research: Planning and Design, 4th Edition, N W MacMillan Publishing
3. Day R A, "How to Write and Publish a Scientific Paper", Cambridge   University Press, 1989.

INC3102                            INDUSTRIAL TRAINING/ INTERACTION        0-0-0-1

 

 For crediting the industrial Training/Interaction, the student has to undertake a training in an Industrial organization /R&D organization/ Planning & Design organization for a period of not less than two weeks and not more than 4 weeks. The aim of the Industrial Training/Interaction is to orient the student towards their thesis work. The Industrial Training/Interaction course would begin soon after their second semester exams have ended. They have to submit a report of the Industrial Training/Interaction programme and present it before the Evaluation Committee.

 

 

 

INP3103                    THESIS PRELIMINARY                                             0-0-14-4

 

         Thesis-Preliminary comprises of two seminars and submission of an interim thesis report. This report shall be evaluated by the Evaluation Committee. The fourth semester thesis would be an extension of this work in the same area. The first seminar would highlight the topic, objectives, methodology and expected results. The first seminar shall be conducted in the first half of this semester. The second seminar is presentation of the interim thesis report of the work they have completed and scope of the work, which is to be accomplished in the fourth semester.

 

 

 

SEMESTER  IV

 

INP4101                              THESIS FINAL                                               0-0-29-12

 

 

            In the fourth semester there will be only thesis work. Towards the end of the semester there would be a pre-submission seminar to assess the quality and quantum of the work by the Evaluation Committee. This would be the pre-qualifying exercise for the students for getting approval from the Department Committee for the submission of Thesis-Final. At least one technical paper is to be prepared for possible publication in Journals/ Conferences. The final evaluation of the Thesis-Final would be external evaluation.

 

 

Syllabus :    ELECTIVE I, II, & III

 

INE2001      DATA WAREHOUSING AND DATA MINING          3-0-0-3

 

Relation to Statistics – Databases – Data Mining Functionalities – Steps in Data Mining Process – Architecture of a Typical Data Mining Systems – Classification of Data Mining Systems – Overviewof Data Mining Techniques.Data Preprocessing – Data Cleaning – Integration – Transformation – Reduction – Discretization Concept Hierarchies – Concept Description Data Generalization and Summarization BasedCharacterization – Mining Association Rules in Large Databases.

 

Classification and Prediction Issues Regarding Classification and Prediction – Classification by Decision Tree Induction – Bayesian Classification – Other Classification Methods – Prediction – Clusters Analysis – Types of Data in Cluster Analysis – Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical Methods.

 

Data Warehousing Components – Multi Dimensional Data Model – Data Warehouse Architecture – Data Warehouse Implementation – Mapping the Data Warehouse to Multiprocessor Architecture – OLAP – Need – Categorization of OLAP Tools. Applications of Data Mining – Social Impacts of Data Mining – Tools – An Introduction to DB .Miner – Case studies – Mining WWW – Mining Text Databases – Mining Spatial Databases.

 

TEXT BOOK

Jiawei Han, Micheline Kamber, "Data Mining Concepts and Techniques", Morgan

Kaufmann Publishers, 2002.

 

REFERENCES

1. Alex Berson, Stephen J Smith, “Data Warehousing, Data Mining & OLAP”, Tata Mcgraw Hill, 2004.
2. Usama M. Fayyad, Gregory Piatetsky , Shapiro, Padhrai Smyth and Ramasamy Uthurusamy,
3. "Advances In Knowledge Discovery And Data Mining", The M.I.T Press, 1996.
4. Ralph Kimball, "The Data Warehouse Life Cycle Toolkit", John Wiley & Sons Inc., 1998.
5. Sean Kelly, "Data Warehousing In Action", John Wiley & Sons Inc., 1997.

INE2002                               NETWORK ROUTING ALGORITHMS               3-0-0-3

 

CIRCUIT SWITCHING NETWORKS -AT & T’s Dynamic Routing Network, Routing in Telephone Network-Dynamic Non Hierarchical Routing-Trunk Status Map Routing-Real Time Network Routing, Dynamic Alternative Routing-Distributed Adaptive Dynamic Routing-Optimized Dynamic Routing. PACKET SWITCHING NETWORKS -Distance vector Routing, Link State Routing, Inter domain Routing-Classless Interdomain routing (CIDR), Interior Gateway routing protocols (IGRP) - Routing Information Protocol (RIP), Open Shortest Path First (OSPF), Exterior Gateway Routing Protocol (EGRP) -Border Gateway Protocol (BGP), Apple Talk Routing and SNA Routing

 

HIGH SPEED NETWORKS -Routing in optical networks-The optical layer, Node Designs, Network design and operation,Optical layer cost tradeoffs, Routing and wavelength assignment, Architectural variations, Routing in ATM networks-ATM address structure, ATM Routing, PNNI protocol, PNNI signaling protocol, Routing in the PLANET network and Deflection Routing. MOBILE NETWORKS - Routing in Cellular Mobile Radio Communication networks-Mobile Network Architecture,Mobility management in cellular systems, Connectionless Data service for cellular systems,

 

Mobility and Routing in Cellular Digital Packet Data (CDPD) network, Packet Radio Routing- DARPA packet radio network, Routing algorithms for small, medium and large sized packet radio networks. Internet based mobile ad-hoc networking, communication strategies, routing algorithms – Table-driven routing - Destination Sequenced Distance Vector (DSDV), Source initiated ondemand routing- Dynamic Source Routing (DSR), Ad-hoc On- demand Distance Vector (AODV), Hierarchical based routing- Cluster head Gateway Switch Routing (CGSR) and Temporally-Ordered Routing Algorithm (TORA), Quality of Service.

 

REFERENCES

1. 1 M. Steen strub, “Routing in Communication networks”, PH International, NY, 1995.
2. 2 “Internetworking Technologies Handbook”, Fourth Edition, Inc. Cisco Systems, ILSG Cisco Systems, 2003.
3. 3 William Stallings, “ISDN & Broadband ISDN with Frame Relay & ATM”, PHI, ND, 2004.
4. 4 Behrouz A Forouzan, “Data Communications and Networking (3/e), TMH, 2004
5. 5 William Stallings, “High Speed Networks TCP/IP and ATM Design Principles”, Prentice Hall International, New York, 1998.
6. Mohammad Ilyas, “The Handbook of Ad hoc Wireless Networks” CRC Press, 2002
7. Vijay K.Garg, “Wireless Network Evolution: 2G to 3G”, Pearson Education, ND, 2003.
8. Rajiv Ramaswami and Kumar N.Sivarajan, “Optical Networks”,Morgan Kaufmann Publishers,1998.
9. Sumit Kasera and Pankaj sethi, ”ATM Networks”, TMH Publishing Co. Ltd, ND,2001.
10. IEEE Journal on Selected Areas in Communications, Special issue on Wireless Ad-hoc Networks, Vol. 17, No.8, 1999.
11. Scott. M. Corson, Joseph P. Macker, Gregory H. Cirincione, IEEE Internet Computing Vol.3, No. 4, July – August 1999.
12. Alder M.Scheideler.Ch. Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, NewYork 1998.
13.  http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/

14.   www.moment.cs.ucsb.edu

INE2003          HIGH SPEED SWITCHING ARCHITECTURES                 3-0-0-3

                                                                    

 

LAN SWITCHING TECHNOLOGY  - Switching Concepts, switch forwarding techniques, switch path control, LAN Switching, cut through forwarding, store and forward, virtual LANs.

 

ATM SWITCHING  ARCHITECTURE  -   Blocking networks - basic - and- enhanced banyan networks, sorting networks - merge sorting, re-arrangable networks - full-and- partial connection networks, non blocking networks - Recursive network construction, comparison of non-blocking network, Switching with deflection routing - shuffle switch, tandem banyan switch.

 

QUEUES IN ATM SWITCHES  - Internal Queueing -Input, output and shared queueing, multiple queueing networks – combined Input, output and shared queueing - performance analysis of Queued switches.

 

HIGH PERFORMANCE PACKET SWITCHING ARCHITECTURES - Architectures of Internet Switches and Routers- Bufferless and buffered Crossbar switches,  Multi-stage switching, Optical Packet switching; Switching fabric on a chip; Internally buffered   Crossbars.  IP SWITCHING - Addressing model, IP Switching types - flow driven and topology driven solutions, IP Over ATM address and next hop resolution, multicasting, Ipv6 over ATM.

                          

REFERENCES:

1.      Achille Pattavina, “Switching Theory: Architectures and performance in Broadband   ATM networks ",John Wiley & Sons Ltd, New York. 1998

2.      Elhanany M. Hamdi, “High Performance Packet Switching architectures”, Springer        Publications, 2007.

3.      Christopher Y Metz, “Switching protocols & Architectures”, McGraw - Hill Professional Publishing, NewYork.1998.

4.      Rainer Handel, Manfred N Huber, Stefan Schroder, “ATM Networks - Concepts

       Protocols, Applications”, 3^rd  Edition, Addison Wesley, New York. 1999.

 

 

 

 

INE2004          NEURAL NETWORKS AND  APPLICATIONS                        3-0-0-3

 

BASIC LEARNING ALGORITHMS -Biological Neuron – Artificial Neural Model - Types of activation functions – Architecture:Feedforward and Feedback – Learning Process: Error Correction Learning –Memory Based Learning – Hebbian Learning – Competitive Learning - Boltzman Learning – Supervised and Unsupervised Learning – Learning Tasks: Pattern Space – Weight Space – Pattern Association – Pattern Recognition – Function Approximation – Control – Filtering -Beamforming – Memory – Adaptation - Statistical Learning Theory – Single Layer Perceptron – Perceptron Learning Algorithm – Perceptron Convergence Theorem – Least Mean Square Learning Algorithm – Multilayer Perceptron – Back Propagation Algorithm –XOR problem – Limitations of Back Propagation Algorithm.

 

RADIAL-BASIS FUNCTION NETWORKS AND SUPPORT VECTOR MACHINES - Radial Basis Function Networks:Exact Interpolator – Regularization Theory – Generalized Radial Basis Function Networks - Learning in Radial Basis Function Networks - Applications: XOR Problem – Image Classification. Support Vector Machines: Optimal Hyperplane for Linearly Separable Patterns and Nonseparable Patterns – Support Vector Machine for Pattern Recognition – XOR Problem - _-insensitive Loss Function – Support Vector Machines for Nonlinear Regression. ATTRACTOR NEURAL NETWORKS -Associative Learning – Attractor Neural Network Associative Memory – Linear Associative

Memory – Hopfield Network – Content Addressable Memory – Strange Attractors and Chaos - Error Performance of Hopfield Networks - Applications of Hopfield Networks – Simulated Annealing – Boltzmann Machine – Bidirectional Associative Memory – BAM Stability Analysis – Error Correction in BAMs - Memory Annihilation of Structured Maps in BAMS – Continuous BAMs – Adaptive BAMs – Applications

 

ADAPTIVE RESONANCE THEORY - Noise-Saturation Dilemma - Solving Noise-Saturation Dilemma – Recurrent On-center –Offsurround - Networks – Building Blocks of Adaptive Resonance – Substrate of Resonance - Structural Details of Resonance Model – Adaptive Resonance Theory – Applications - SELF ORGANISING MAPS - Self-organizing Map – Maximal Eigenvector Filtering – Sanger’s Rule – Generalized Learning Law – Competitive Learning - Vector Quantization – Mexican Hat Networks – Self organizing  Feature Maps – Applications

.

REFERENCES

 

1.     1 Satish Kumar, “Neural Networks: A Classroom Approach”, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2004.

2.    2 Simon Haykin, “Neural Networks: A Comprehensive Foundation”, 2ed., Addison Wesley Longman (Singapore) Private Limited, Delhi, 2001.

3.    3 Martin T.Hagan, Howard B. Demuth, and Mark Beale, “Neural Network Design”,Thomson Learning, New Delhi, 2003.

4.    4 James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques, Pearson Education (Singapore) Private Limited, Delhi, 2003.

5.    5 S. Rajasekaran, G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic Algorithms, Synthesis and Applications, PHI, New Delhi,2003

 

INE2005                            SOFT COMPUTING                                            3-0-0-3

 

      

ARTIFICIAL NEURALS - Basic-concepts-single layer perception-Multi layer perception-Supervised and un supervised learning back propagation networks, Application. FUZZY LOGIC - Fuzzy sets and Fuzzy reasoning -Fuzzy matrices - Fuzzy functions-decomposition - Fuzzy automata and languages- Fuzzy control methods-Fuzzy decision making, Applications.

 

NEURO-FUZZY MODELLING - Adaptive networks based Fuzzy interfaces-Classification and Representation trees-Data dustemp algorithm –Rule base structure identification - Neuro-Fuzzy controls GENETIC ALGORITHM- Survival of the fittest-pictures computations-cross over mutation-reproduction-rank method-rank space method, Application.

 

SOFT COMPUTING AND CONVENTIONAL AI - AI Search algorithm-Predicate calculus rules of interface - Semantic networks-frames-objects-Hybrid models applications.

 

 

 

REFERENCES:

1. Jang J.S.R.,Sun C.T and Mizutami E - Neuro Fuzzy and Soft computing Prentice hall New Jersey,1998
2. Timothy J.Ross:Fuzzy Logic Engineering Applications. McGraw Hill,NewYork,1997.
3. Laurene Fauseett: Fundamentals of Neural Networks. prentice Hall India, New Delhi,1994.
4. George J.Klir and Bo Yuan, Fuzzy Sets and Fuzzy Logic, Prentice Hall Inc., New Jersey,1995
5. Nih.J. Ndssen Artificial Intelligence, Harcourt Asia Ltd.,Singapore,1998.

 

 

INE2006               ADVANCED DATABASE SYSTEMS                                  3-0-0-3

 

 

QUERY AND TRANSACTION PROCESSING -  Data Storage and Querying : Storage and File Structure -  Indexing and Hashing – Physical Database Design and Tuning -  Query Processing Algorithms – Query Optimization Techniques – Transaction Management: Transaction Processing  Concepts – Concurrency Control – Recovery Techniques –Database Security. PARALLEL DATABASES   - Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism.

 

DISTRIBUTED  DATABASES -  Distributed Database Concepts - Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server Architecture- Case Studies.  OBJECT AND OBJECT RELATIONAL DATABASES - Concepts for Object Databases: Object Identity –Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards, Languages  and Design:  ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems : Object Relational features in SQL / Oracle – Case Studies.  

 

ENHANCED DATA MODELS - Active Database Concepts and Triggers – Temporal Databases – Spatial Databases – Multimedia Databases – Deductive Databases – XML Databases: XML Data Model – DTD - XML Schema - XML Querying - Geographic Information Systems - Genome Data Management.

EMERGING TECHNOLOGIES -  Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management -  Location Dependent Data Distribution - Mobile Transaction Models - Concurrency Control - Transaction Commit Protocols – Web Databases - Information Retrieval - Data Warehousing -  Data Mining.

           

REFERENCES

1.     R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition, Pearson Education/Addison Wesley, 2007.

2.    Thomas Cannolly and Carolyn Begg, “ Database Systems, A Practical Approach to Design, Implementation and Management”, Third Edition, Pearson Education, 2007.

3.    Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Fifth Edition, McGraw Hill, 2006.

4.    C.J.Date, A.Kannan and S.Swamynathan,”An Introduction to Database Systems”, Eighth Edition, Pearson Education, 2006.

5.    Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw Hill, Third Edition 2004.

INE2007                            BIOMETRIC SECURITY                                      3-0-0-3

 

 

Introduction & background, Authentication techniques, Biometric technologies, Finger Biometric technologies, Face biometric technologies, voice biometric technologies, Iris biometric technologies.

 

Implementing biometrics for network security, Intoduction to statistical measures of biometrics, biometric transaction - Security via biometrics. Spaced Domain based biometric and recognition techniques;

 

Correlation based biometric filters. Basic theory or Correlation filters; Design of advanced correlation fillers that offer tolerance to expected impairments; Methods to implement digital correlations; Applications of correlation filters.

 

 

 

 

REFERENCE:

 

Paul Reid, Biometrics for Network Security, Pearson Education, 2004

 

INE2008                    CELLULAR  COMMUNICATION                              3-0-0-3

 

Mobile Radio Propagation-Propogation Models, Propogation Mechanisms, Path Loss models, Small scale Multipath Propogation , Parameters of Mobile Multipath Channels , Rayleigh and Ricean Distributions, level crossing and fading statistics.

 

Wireless Communication Systems and Standards-Evolution of cellular networks, GSM, CDMA Digital Cellular Standard, Cordless Telephones,WLL, PACS,cellular data services, satellite base wirelesss systems. Cellular System Design & Signaling-Channel assignment, cell planning, power control, erlang capacity, database and mobility management, power control, interference and system capacity, signaling standards, antennas for mobile radio.

 

 

Modulation Techniques For Mobile Radio -Digital modulation, Linear modulation techniques, GMSK,MFSK,MPSK, QAM, OFDM Transmission Technique, spread spectrum techniques, modulation performance in fading and multipath channels, comparision, equalization and diversity concepts, RAKE receiver. WAP- Architecture, protocols, security issues, Routing Techniques in Ad Hoc wireless networks.

 

REFERENCES

 

1.      T.S.Rappaport, Wireless Communications: Principles and Practice, 2nd Edition, Pearson Education/ Prentice Hall of India, Third Indian Reprint 2003.

2.      W.C.Y.Lee, Mobile Communications Engineering: Theory and applications, 2nd Edition, McGraw-Hill International, 1998.

3.      Andreas F.Molisch, Wideband Wireless Digital Communications, Pearson Education, 2001.

4.      R. Blake, Wireless Communication Technology, Thomson Delmar, 2003.

 

 

INE2009                        EMBEDDED NETWORKING                                    3-0-0-3

 

      

EMBEDDED NETWORK REQUIREMENTS - Embedded networking – code requirements – Communication requirements – Introduction to CAN open – CAN open standard – Object directory – Electronic Data Sheets & Device – Configuration files – Service Data Objectives – Network management CAN open messages – Device profile encoder.

 

CAN OPEN - CAN open configuration – Evaluating system requirements choosing devices and tools – Configuring single devices – Overall network configuration – Network simulation – Network Commissioning – Advanced features and testing. CAN: Controller Area Network – Underlying Technology CAN Overview – Selecting a CAN - Controller – CAN development tools.

 

IMPLEMENTATION OF CAN OPEN - Implementing CAN open Communication layout and requirements – Comparison of implementation methods – Micro CAN open – CAN open source code – Conformance test – Entire design life cycle. ISSUES - Physical layer – Data types – Object dictionary – Communication object identifiers – Emerging objects – Node states.

 

 

REFERENCES

 

Glaf P.Feiffer, Andrew Ayre and Christian Keyold , Embedded Networking with CA and CAN open, Embedded System Academy 2005.

INE2010               WEB TECHNOLOGIES                                           3-0-0-3

 

Introduction - History of the Internet and World Wide Web – HTML 4 protocols – HTTP, SMTP, POP3, MIME, IMAP. Introduction to JAVA Scripts – Object Based Scripting for the web. Structures – Functions – Arrays – Objects.Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic position, frames, navigator, Event Model – On check – On load – Onenor – Mouse rel – Form process – Event Bubblers – Filters – Transport with the Filter – Creating Images – Adding shadows – Creating Gradients – Creating Motion with Blur – Data Binding – Simple Data Binding – Moving with a record set – Sorting table data –

Binding of an Image and table.

Audio and video speech synthesis and recognition - Electronic Commerce – E-Business Model – E- Marketing – Online Payments and Security – Web Servers – HTTP request types – System Architecture – Client Side Scripting and Server side Scripting – Accessing Web servers – IIS – Apache web server. Database, Relational Database model – Overview, SQL – ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies – ADO – Access a Database from ASP – Serverside.Active-XComponents

Web Resources – XML – Structure in Data – Name spaces – DTD – Vocabularies – DOM methods. Introduction – Servlet Overview Architecture – Handling HTTP Request – Get and post request – redirecting request – multi-tier applications – JSP – Overview – Objects – scripting – Standard Actions –Directives.

TEXTBOOK

Deitel & Deitel, Goldberg, “Internet and world wide web – How to Program”, Pearson Education Asia,2001.

 

REFERENCES

1.     Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of India –  QUE, 1999.

 

2.  Aferganatel, “Web Programming: Desktop Management”, PHI, 2004.
Rajkamal, “Web Technology”, Tata McGraw-Hill, 2001

 

 

 

 

 

Syllabus :    ELECTIVE IV

 

    INTERDISCIPLINARY ELECTIVES

 

INE2011          ADVANCED TECHNIQUES IN OPERATIONS RESEARCH      3-0-0-3

 

Mathematical Preliminaries – Maxima and Minima –Quadratic forms – Gradient and Hessian – Unimodal functions – Convex sets – Concave and Convex functions – Mathematical Programing problems – Varieties

and characteristics – Difficulties caused by nonlinearity – Role of convexity in N. L. P. Unconstrained Optimization – Search methods – Fibonacci Search – Golden sections search.

 

Hooke and Jeeve’s method – Optimal Gradient method – Newton’s method – Constrained nonlinear optimization constrained optimization with equality constraints. Lagrangian method – Sufficiency conditions – Optimization with inequality constraints – Kuhn – Tucker conditions – Sufficiency conditions.

 

Quadratic Programming – Separable convex programming – Frank & Wolfe’s method – Kelley’s cutting plane method – Rosen’s gradient projection method – Fletcher –    Reeve’s method – Penalty and Barrier methods. Integer linear programming – Gomory’s cutting plane method – Branch and Bound Algorithm – Travelling Salesman problem – Knapsack problem. Introduction to Optimization tools and software – MATLAB, LINDO, LINGO.

 

REFERENCES:

 

       1. Taha. H. A., Operations Research, An Introduction , PHI, VI edition.

       2. Simmons D. M, Nonlinear Programming  for Operations Research, PHI.

 

INE2012             ADVANCED DIGITAL SIGNAL PROCESSING                    3-0-0-3

             

 

DISCRETE RANDOM SIGNAL PROCESSING - Weiner Khitchine relation - Power spectral density – filtering random process, Spectral Factorization Theorem, special types of random process – Signal modeling-Least Squares method, Pade approximation, Prony’s method, iterative Prefiltering, Finite Data records, Stochastic Models. SPECTRUM ESTIMATION - Non-Parametric methods - Correlation method - Co-variance estimator - Performance analysis of estimators – Unbiased consistent estimators - Periodogram estimator - Barlett spectrum estimation - Welch estimation - Model based approach - AR, MA, ARMA Signal modeling - Parameter estimation using Yule-Walker method.

 

LINEAR ESTIMATION AND PREDICTION - Maximum likelihood criterion - Efficiency of estimator - Least mean squared error criterion  - Wiener filter - Discrete Wiener Hoff equations - Recursive estimators - Kalman filter - Linear prediction, Prediction error - Whitening filter, Inverse filter - Levinson recursion, Lattice realization, Levinson recursion algorithm for solving Toeplitz system of equations. ADAPTIVE FILTERS - FIR Adaptive filters - Newton's steepest descent method - Adaptive filters based on steepest descent method - Widrow Hoff LMS Adaptive algorithm - Adaptive channel equalization - Adaptive echo canceller - Adaptive noise cancellation - RLS Adaptive filters - Exponentially weighted RLS - Sliding window RLS - Simplified IIR LMS Adaptive filter.

 

MULTIRATE DIGITAL SIGNAL PROCESSING - Mathematical description of change of sampling rate - Interpolation and Decimation - Continuous time model - Direct digital domain approach - Decimation by integer factor - Interpolation by an integer factor - Single and multistage realization - Poly phase realization - Applications to sub band coding - Wavelet transform and filter bank implementation of wavelet expansion of signals.

 

REFERENCES:

1.   Monson H. Hayes, “Statistical Digital Signal Processing and Modeling”, John Wiley and Sons Inc., New York, 1996.

2.  Sophoncles J. Orfanidis, “Optimum Signal Processing “, McGraw-Hill, 1990.

3.  John G. Proakis, Dimitris G. Manolakis, “Digital Signal Processing”, Prentice Hall of India, New Delhi, 1995.

4.  Simon Haykin, “Adaptive Filter Theory”, Prentice Hall, Englehood Cliffs, NJ1986.

5.  S. Kay,” Modern spectrum Estimation theory and application”, Prentice Hall, Englehood Cliffs, NJ1988.

6.  P. P. Vaidyanathan, “Multirate Systems and Filter Banks”, Prentice Hall, 1992.

INE2013                          ADVANCED GRAPH THEORY                                3-0-0-3

 

Basic Concepts: Graphs and digraphs, incidence and adjacency matrices, isomorphism, the automorphism group; Trees: Equivalent definitions of trees and forests, Cayley's formula, the Matrix-Tree theorem, minimum spanning trees; Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger s theorem; Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal, girth, circumference, the Chinese Postman Problem, the Travelling Salesman problem, diameter and maximum degree, shortest paths; 

 

Matchings: Berge's Theorem, perfect matchings, Hall's theorem, Tutte's theorem, Konig's theorem, Petersen's theorem, algorithms for matching and weighted matching (in both bipartitie and general graphs), factors of graphs (decompositions of the complete graph), Tutte's f-factor theorem; Extremal problems: Independent sets and covering numbers, Turan's theorem, Ramsey theorems; Colorings: Brooks theorem, the greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic polynomials, girth and chromatic number, Vizing's theorem;

 

Graphs on surfaces: Planar graphs, duality, Euler's formula, Kuratowski's theorem, toroidal graphs, 2-cell embeddings, graphs on other surfaces; Directed graphs: Tournaments, directed paths and cycles, connectivity, digraphs, branchings; Networks and flows: Flow cuts, Max flow min cut theorems, perfect square; Selected topics: Dominating sets, the reconstruction problem, intersection graphs, perfect graphs, random graphs.

 

REFERENCES

 

1. Graphs Theory Applications – L.R. Foulds,  Narosa Publishers.

2. Graph Theory – Frank Harara, Narosa Publishers.

                                   

INE2014                        SERVICE ORIENTED ARCHITECTURE                  3-0-0-3

 

 

SOFTWARE ARCHITECTURE – Types of IT Architecture – SOA – Evolution – Key components – perspective of SOA – Enterprise-wide SOA – Architecture – Enterprise Applications – Solution Architecture for enterprise application –Software platforms for enterprise Applications – Patterns for SOA – SOA programming models.

 

SERVICE-ORIENTED ANALYSIS AND DESIGN – Design of Activity, Data, Client and business process services – Technologies of SOA – SOAP – WSDL – JAX – WS – XML WS for .NET – Service integration with ESB – Scenario – Business case for SOA – stakeholder objectives – benefits of SPA – Cost Savings - SOA implementation and Governance – strategy – SOA development – SOA governance – trends in SOA – event-driven architecture – software s a service – SOA technologies – proof-of-concept – process orchestration – SOA best practices .

 

Meta data management – XML security – XML signature – XML Encryption – SAML – XACML – XKMS – WS-Security – Security in web service framework - advanced messaging . TRANSACTION PROCESSING – paradigm – protocols and coodination – transaction specifications – SOA in mobile – research issues                                                 

 

 

REFERENCES                                                                                    

1. Shankar Kambhampaly, “Service –Oriented Architecture for Enterprise Applications”, Wiley India Pvt Ltd, 2008.
2. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Pearson Education.
3. Mark O’ Neill, et al. , “Web Services Security”, Tata McGraw-Hill Edition, 2003.

 

 

Syllabus :    ELECTIVE  V  & VI

 

INE3001            MATHEMATICAL MODELS FOR INTERNET                       3-0-0-3

 

 

Definition and characteristics of  mathematical models. Modeling the network - queuing systems, modeling the QoS for improvement. Mathematical models of fairness and stability.

 

 

Modeling a self-managed internet. Moving away from the end to end concept. Modeling required in an untrustworthy world.

 

 

Modeling of an internet based application.

 

 

 

REFERENCES

 

1.   Harold Tipton, Micki Krause, Information Security Management Handbook, 5th Edition,  Auerbach / CRC Press  2004

 

2.  Seymour Bosworth, M E Kabay .Computer Security Handbook, 4th Edition. John Wiley,  2002.

 

3.  Theo Dimitrakos, Fabio Martinelli, (Editors). Formal Aspects in Security and Trust: Proceedings of IFIP Workshop on Formal Aspects in Security and Trust (FAST) 2004, Springer 2005

 

4.  Ali E Abdallah, Peter Ryan, Steve Schneider (Editors). Formal Aspects of Security: Proceedings of First International Conference, FASec 2002. LNCS 2629, Springer 2003

 

5.  Markus Schumacher. Security Engineering with patterns: origins, theoretical model, and new applications. LNCS 2754, Springer.

 

INE3002    PERFORMANCE EVALUATION OF COMPUTER SYSTEMS AND NETWORKS

                                                                                                                                   3-0-0-3

 

FUNDAMENTALS  - Need for Performance Evaluation – Role of Performance Evaluation – Performance Evaluation Methods – Performance Metrics and Evaluation Criteria – CPU and I/O Architectures – Distributed and Network Architectures – Secondary Storage – Topologies – Computer Architecture – Fundamental Concepts and Performance Measures.

 

PROBABILITY AND STOCHASTIC PROCESSES - Scheduling Algorithms – Workloads – Random Variables –Probability Distributions – Densities – Expectation – Stochastic Processes – Poisson Process – Birth Death Process – Markov Process.  QUEUING THEORY - Queuing Systems – Networks of Queues – Estimating Parameters and Distributions – Computational Methods – Simulation Process – Time Control – Systems and Modeling.

 

           

PETRI NETS AND SYSTEM PERFORMANCE - Petri Nets – Classical Petri Nets – Timed Petri Nets – Priority–based Petri Nets – Colored Petri Nets - – Generalized Petri Nets – Tool Selection – Validation of Results – Performance Metrics – Evaluation – Multiple Server Computer System Analysis. ANALYSIS  - OS Components – System Architecture – Workloads – Design – Simulation – Analysis – Database System Performance – Computer Networks Components – Simulation Modeling of LAN.

 

REFERENCES

1.  Paul J. Fortier, Howard E. Michael, “Computer Systems Performance Evaluation and Prediction”, Elsevier Science 2003.
2. Thomas G. Robertazzi, “Computer Networks and Systems Queing theory and Performance Evaluation”, 3rd Edition, Springer, 2000.
3.  Domenico Ferrari , Giuseppe Serazzi ,Alexandro Zeijher, “Measurement & Tuning of Computer Systems “, Prentice Hall Inc, 1983.
4. Michael F. Mories and Paul F. Roth, “Tools and techniques Computer Performance Evaluation”, Van Nostrand, 1982.

INE3003              HIGH PERFORMANCE SCIENTIFIC COMPUTING           3-0-0-3

 

 

Overview of Scientific Computing & Numerical Analysis – IEEE Arithmetic Short Reference – UNIX, vi, ftp : A Quuick review – elements of UNIX make

 

Tools – elements of MATLAB, IDS, AVS – Scientific visualization

 

Architectures – Computer performance – vector computing – distributed memory – MIMD Computing – SIMD Computing – Applications

 

 

REFERENCES

 

Introduction to High Performance Scientific Computing -  Lloyd D. Fosdick, MIT Press.

INE3004                        COMPONENT BASED TECHNOLOGY                    3-0-0-3

 

 

INTRODUCTION - Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware.

 

JAVA COMPONENT TECHNOLOGIES - Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP. CORBA TECHNOLOGIES - Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture.

 

COM AND .NET TECHNOLOGIES - COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting.

 

COMPONENT FRAMEWORKS AND DEVELOPMENT - Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools.

 

REFERENCES:

 

1.   “Component Software:  Beyond Object-Oriented Programming”, Pearson Education publishers, 2003.

2. Ed Roman, “Enterprise Java Beans”, Third Edition , Wiley , 2004.

 

INE3005             NETWORK ARCHITECTURE AND DESIGN                     3-0-0-3

 

 

INTRODUCTION, REQUIREMENT ANALYSIS - Overview of Analysis, Architecture and Design Processes-Performance Characteristics, Requirement analysis- User Requirement- Application Requirement- Device Requirement- Network Requirement- Other Requirement, Gathering and Listing Requirements- Developing RMA, Delay and Capacity Requirements- Developing Supplemental Performance Requirements.

 

FLOW ANALYSIS, NETWORK ARCHITECTURE - Flows-Individual and Composite flow- Critical Flow, Flow models, Flow Specification, Network Architecture- Component Architecture, Reference Architecture, Architectural Models. NETWORK MANAGEMENT ARCHITECTURE - Addressing Mechanisms- Classful Addressing - Subnetting-Variable length Subnetting-Supernetting-Private Addressing and NAT, Routing Mechanisms, Addressing Strategies, Routing Strategies, Architectural Consideration, Network management, Network management Mechanisms, Architectural Considerations.

 

PERFORMANCE ARCHITECTURE, SECURITY AND PRIVACY ARCHITECTURE - Performance Mechanisms- Quality Services- Service level Arrangements, Architectural Consideration- Evaluation of Performance Mechanisms- Internal Relationship- External Relationship, Security and privacy Plan- Administration, Security and privacy Mechanisms, Architectural considerations- Evaluation of Security Mechanisms- Internal Relationship- External Relationship. INTERCONNECTING TECHNOLOGIES - Developing Criteria for Technology Evaluation, Making Technology Choices for the Network Design, Shared Medium, Switching, hybrid Mechanism-NHRP-MPOA, Applying Interconnection Mechanisms to the Design.

 

REFERENCES

 

1.     Network Analysis, Architecture and Design, 2nd Edition (The Morgan Kaufmann Series in Networking) James D. McCabe, Elsevier Science (USA), 2003.

2.    Network Architecture & Design, A Field Guide for IT Professionals, Dimarzio, J.F. DiMarzio, SAMS Series

3.    Top-Down Network Design Priscilla Oppenheimer from Cisco Press.1999.

 

 

INE3006                        INFORMATION RETRIEVAL                        3-0-0-3

 

 

Overview- Concepts of a document- data structures in the large- document surrogates- Vocabulary control- data compression- text documents- images and sound, Query structures- Boolean queries- vector queries- fuzzy queries- probabilistic queries

 

Relevance and similarity measures- Effects of Weighting- Effects of scaling- the Matching process, Indexing- Matrix representations- Term Association- Document Analysis- stemming- thesauri- user profiles and their use, Multiple Reference point systems- document clusters- Retrieval Effectiveness- Precision and Recall- Operating curves- Expected search Length- satisfaction and Frustration, Effectiveness Improvement Techniques, Relevance feedback,

 

Genetic Algorithms- TREC Experiments- Alternative Retrieval Techniques- Citation Processing- Hypertext links- Information Filtering and passage Retrieval.

 

REFERENCES

 

1.     Korfhage Robert R., Information storage and retrieval, John Wiley & Sons, Inc, 1997.

2.    Richardo & Bertheir, Modern Information Retrieval, Pearson Education, 2000

 

INE3007                        INTELLIGENT SYSTEMS                                    3-0-0-3

 

 

Biological foundations to intelligent systems I: Artificial neural networks, Back-propagation networks, Radial basis function networks, and recurrent networks.  Biological foundations to intelligent systems

 

Fuzzy logic, knowledge representation and inference mechanism, genetic algorithm, and fuzzy neural networks.  Fuzzy and expert control (standard, Takagi-Sugeno, mathematical characterizations, design example), Parametric optimization of fuzzy logic controller using genetic algorithm.

 

System identification using neural and fuzzy neural networks. Stability analysis: Lyapunov stability theory and Passivity Theory. Adaptive control using neural and fuzzy neural networks, Direct and Indirect adaptive control, and Self-tuning Pill Controllers. Applications to pH reactor control, flight control, robot manipulator dynamic control, underactuated systems such as inverted pendulum and inertia wheel pendulum control and visual motor coordination.

 

 

 

REFERENCES

1.     Stanislaw H. Zak, Systems and Control, Oxford University Press, 2003

2.    A.S. Poznyak, E. N. Sanchez and Wen Yu, Differential Neural Networks for Robust Nonlinear Control, World Scientific, 2001.

3.    Kevin M. Passino and Stephen Yurkovich, Fuzzy Control, Addison Wesley Longman, Menlo Park, CA, 1998.

 

 

INE3008               INTERCONNECTION NETWORKS                      3-0-0-3

 

Introduction Parallel computing and networks, network design considerations, classification of interconnection network, shared medium networks Message switching layer- n/w and router model, Basic switching techniques, virtual channels, hybrid switching techniques, Optimizing switching techniques, Comparison of switching techniques.

 

Deadlock , live lock and Starvation—Deadlock avoidance , Deadlock prevention, Deadlock recovery, Live lock avoidance Routing algorithms-Deterministic routing algorithms, Different types adaptive routing algorithms, Backtracking and Non minimal routing algorithms, backtracking protocols, Routing in MIN's, routing in switch based network with irregular topologies, resource allocation policies.

 

Collective communication Support- system support, models for multi cast communication- h/w and s/w implementation of multi cast, Fault tolerant routing- fault induced deadlock and live lock, channel and network redundancy, fault models, fault tolerant routing, dynamic fault recovery Network architecture- network topologies and physical constraints- router architecture- performance evaluation

 

REFERENCE

Interconnection Networks: An Engineering Approach,  Jose Duato , Sudhakar Yalamanchili , Lionel M. Ni, Morgan Kaufman Publishers.