Teaching plan. No. Unit Topic Count Total Network System: Introduction: Review of Protocols and Packet Format 1

College of Engineering, Pune - 05

Department of Computer Engineering and Information Technology ADVANCED COMPUTER NETWORKS

Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks: Branch: Computer Engineering Continuous evaluation- Semester: FY MTech-I Assignment/Quizzes – 40 marks End Sem Exam - 60 marks

Teaching plan

No. Unit Topic Count Total

1 I

Network System: Introduction: Review of Protocols and Packet Format 1

6

Network Systems and the Internet, 1

Network Systems Engineering, Packet Processing, 1

Network Speed, Hardware, Software and Hybrids. 1

Network Interface Card functionality, Onboard Address Recognition, 1

Packet Buffering, Promiscuous mode. 1

2 II

Network Processors: Complexity of Network Processor Design 1

6

Network Processor Architectures, 2

Issues in Scaling a Network Processor 2

Examples of Commercial Network Processors 1

3 III

SNMP and Network Management Basic Foundations: Standards, Models, and

Language 1

6 SNMPv1 Network Management: Organization and Information Models 1

SNMPv2, SNMPv3, 1

RMON, Network Management Tools, 1

Systems, and Engineering, 1

Network Management Applications 1

4 IV

Design and Validation of Computer Protocols :Protocol Structure, Protocol Design, 1

4

Protocol Synthesis, Protocol Validation, 1

Design Tools-Protocol Simulator 1

Protocol Validator 1

5 V

High Speed Networks and Wireless Networks :High Speed Networks, 1

8

Performance Modeling and Estimation 1

Internet Routing, Quality of Service in IP Networks, 1

MAC Protocols for Ad Hoc Wireless Networks, , 1

Routing Protocols for Ad Hoc Wireless Networks 1

Multicast routing in Ad Hoc Wireless Networks, Transport Layer and 1 Security Protocols for Ad Hoc Wireless Networks,

Quality of Service in Ad Hoc Wireless Networks.

6 VI

Storage and Networking: Storage and Networking Concepts, 1

4

Fiber Channel Internals, Fiber Channel SAN Topologies, 1

Fiber Channel Products ,IP SAN Technology, 1

IP SAN Products, Management of SANs, SAN Issues 1

Text Books :

1. Douglas Comer, Network Systems Design using Network Processor, PearsonEducation, 2004.

2. Mani Subramanian, Timothy A. Gonsalves,N. Usha Rani; Network Management: Principles and Practice; Pearson Education India, 2010

3. Holzmann, Gerard J., Design and Validation of Computer Protocols, Prentice Hall, 1990. 4. William Stallings, High-Speed Networks and Internets, Pearson Education, 2nd _{Edition, 2002.}

References :

1. C. Siva Ram Murthy, B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall, 2004 2. Muthukumaran B, Introduction to High Performance Networks, Tata Mc Graw Hill, 2008.

3. Tom Clark, Designing Storage Area Networks, A Practical Reference for Implementing Fibre Channel and IP SANs, Addison-Wesley Professional, 2nd _{Edition, 2003 .}

Useful URLs: 1. http://www.eecs.berkeley.edu/~dtse/book.html 2. http://www.nari.ee.ethz.ch/commth/teaching/wirelessIT/#reading 3. http://www.site.uottawa.ca/~ivan/adhoc.html 4. http://www.cs.tut.fi/kurssit/TLT-2616 5. https://inst.eecs.berkeley.edu/~ee122/sp06/syllabus.htm Course Outcomes:

1. CO-1: Students will be knowledgeable with the network working system and its functionality

2. CO-2: Students will have a detailed knowledge of different network protocols, network management models and tools.

3. CO-3: Students will be knowledgeable with advanced networking and wireless networking in particular finding different solutions for communications at each network layer.

4. CO-4: Develop solutions by applying knowledge of mathematics, probability, and statistics to model and analyze some network design problems..

5. CO-5: Students will be able to explain Storage and Networking technologies.. Questions:

Test 1

Q1 – Protocols, packet format and NIC functionality. Q2 - Different network management protocols. Q3 – network management applications

Test 2

Q4 –protocol structure, design and synthesis. Q5 – High speed networks.

Q6 - mobile and ad hoc networks End Semester Exam

Q7 – On network systems Q8 – On network processors

Q9 – High speed and wireless networks Q10 - storage and networking concepts Q11 –fiber channel and SAN topologies. Program Outcomes relevant to the Outcomes:

a. Understanding advanced concepts of Computer Engineering and the underlying basic mathematics,

science and engineering concepts.

b. Creating appropriate experiments and analyzing their outcomes.

c. Analyzing real life situation and creating design solutions with a system, component, or process to meet

desired needs within realistic constraints such as economic, environmental, social, political, ethical,

health and safety, manufacturability, and sustainability

Mapping of Questions to CO’s: Questions CO’s 1 a 2 a 3 a 4 b 5 b, c 6 b, c 7 a, c 8 b,c 9 a,c 10 C 11 C

Mapping of CO’s to PO’s:

CO’s PO’s 1 a, c 2 a, b 3 a, b 4 a, b 5 a, b Evaluation Procedure

Examination Marks Dates (As per Academic Calendar)

Quiz I 20 August 25-28, 2014

Quiz II 20 September 22-25, 2014

End Sem Exam 60 November 19 – December 02, 2014

(S.N. Ghosh) Head

College of Engineering, Pune - 05

Department of Computer Engineering and Information Technology

Course Plan

: DISTRIBUTED OPERATING SYSTEM

Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks: Continuous

evaluation-Tests/Quizzes – 40 marks End Sem Exam - 60 marks

Reference books:

1. Sinha P. K., Distributed Operating Systems Concepts and Design, PHI, 1997

2. Tanenbaum A. S., Distributed Operating Systems, Pearson Education India, 1995

Online resources:

http://lass.cs.umass.edu/~shenoy/courses/677/

Sr.No Unit Topic No. of Lec tur es Total

01

I

Characteristics and challenges of distributed systems. Design issues

in distributed operating systems;

01

04

Message passing: Desirable features of good message passing

systems, Issues in IPC by message passing; Synchronization,

Buffering, Multi-datagram Messages, Failure Handling, Group

Communication

03

02

II

RPC Model, Transparency of RPC, Implementing RPC

mechanisms, RPC messages

03

07

Server management, parameter-passing semantics, call semantics

Communication protocols for RPC, Client-Server Binding

4

03

III

General Architecture of DSM Systems, Design and Implementation

issues in DSM, Consistency Models, Page based distributed shared

memory, shared – variable distributed shared memory

03

07

Replacement Strategy, Thrashing, Heterogeneous DSM, Advantages

of DSM,

Synchronization : Clock Synchronization, Event Ordering, Mutual

Exclusion, Deadlock, Election Algorithms

04

04

IV

Desirable features of good global scheduling algorithms, Task

Assignment Approach, Load-Balancing Approach, Load-Sharing

Approach,

Process management: Process Migration, Threads

04

04

05

V

File-Accessing Models, File-Sharing Semantics, File-caching

Schemes, File Replication, Fault Tolerance, Atomic Transactions,

Design Principles,

03

05

Naming: Fundamental Terminologies and Concepts,

System-Oriented names, Object-Locating Mechanisms, Human-System-Oriented

names, Name cache, Naming and Security.

02

06

VI

Potential Attacks to Computer Systems, Authentication, Access

Control.

03

03

Total

30

Program outcomes relevant to the course (PO)

PO-a

Understanding advanced concepts of Computer Engineering and the underlying basic

mathematics, science and engineering concepts.

PO-c

Analyzing real life situation and creating design solutions with a system, component, or process to

meet desired needs within realistic constraints such as economic, environmental, social, political,

ethical, health and safety, manufacturability, and sustainability

PO-g

Analyze contemporary issues

Course Outcomes:

CO-1

Students are aware of characteristics & challenges of distributed systems and design issues in

distributed operating systems.

CO-2

Students are conversant with various communication techniques such as message passing

mechanism, remote procedure call mechanism and distributed shared memory mechanism used for

exchange of information among processes of distributed computing system

CO-3

Students know the synchronization issues in a distributed system such as clock synchronization,

mutual exclusion, deadlock & election algorithms and approaches for resource management in a

distributed system.

CO-4

Students are conversant with issues in process management particularly process migration ,

distributed file system and security issues in distributed system

Evaluation Procedure

Exmination

Marks

Date(tentatively)

Test I

20

During August 13-23, 2014

Test II

20

During September 12-22, 2014

End Sem Exam

60

As per academic schedule

(November 19,2014 to December 2, 2014)

CO to be covered tentatively

Test I

Q.1

CO-1,CO-2

Q.2

CO-2

Test II

Q.3

CO-2

Q.4

CO-3

End Sem Exam

Q.5

CO-2

Q.6

CO-2

Q.7

CO-3

Q.8

CO-4

Q.10

CO-4

Mapping of CO to PO

CO

PO

CO-1

PO-a

CO-2

PO-a, PO-c

CO-3

PO-a

CO-4

PO-a, PO-g

Subject In charge

Head,

College of Engineering, Pune

www.coep.org.in

Department of Computer Engineering and Information Technology Course Plan

Course Code: CT-505 Course: Topics in Databases

Teaching Scheme: Lectures- 3 hours/week Examination Scheme: Tests/ Quizzes- 40 Marks ESE-60 Marks

Academic Year: 2014-15 Class: First Year M Tech Semester: I

1.

Teaching Learning Interaction: (Class, Tutorials, Assignments, presentations, home works) SN

N

Unit Topic Lecture(s) Total

01 I

Transaction Processing

10 Serial and Serializable Schedules, Conflict-Serializability, Enforcing

Serializability by Locks (Two-Phase Locking) 2

Locking Systems With Several Lock Mode, Concurrency Control by Timestamps, Serializability and Recoverability, The Dirty-Data Problem, Cascading Rollback, Recoverable Schedules, Managing Rollbacks Using Locking, Logical Logging, Recovery From Logical Logs

2

ARIES (Algorithm for Recovery and Isolation Exploiting Semantics), which supports partial rollbacks of transactions, fine granularity (e. g., record) locking and recovery using write-ahead logging (WAL).

6

02 II

Query Processing

10 Architecture of Query Execution Engines, Disk Access, Aggregation

and Duplicate Removal, Sorting and Hashing, Binary Matching Operations (Join Algorithms)

2 Execution of complex query plans,

Techniques for performance improvement: Pre-computation and Derived data,

Data Compression, Surrogate Processing; Bit vector filtering

4

Query Evaluation Techniques for Large Databases 4

03 III

Query Optimization

10

Basic Optimization Strategies, Algebraic Manipulation, 4

Optimizations of Selections in System R 6

04 IV

Case Studies

08 Hadoop Distributed File System; HIVE - Data warehousing

application built on top of Hadoop; 4

MapReduce; Dynamo – a distributed data store; Eventual

Consistency Model for Distributed Systems 4

Total 38

2. Text Book:

• Hector Garcia - Molina, Jeffrey D. Ullman and Jennifer Widom, Database Systems:The

Complete Book 2nd Edition, Pearson, 2013 (ISBN-13:9789332518674)

3. Reference Books/Papers: 1.

2. C. Mohan, ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging, ACM Transactions on Database Systems, Vol. 17, No. 1, March, 1992, pp. 94–162

3. P. Selinger, M. Astrahan, D. Chamberlin, Raymond Lorie and T. Price. Access Path Selection in a Relational Database Management System, Proceedings of ACM SIGMOD, pp 23-34, 1979

4. Jeffrey Dean and Sanjay Ghemawat, MapReduce: Simplified Data Processing on Large Clusters, Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008

5. Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber, Bigtable: A Distributed Storage System for Structured Data , Proceedings of Operating Systems Design and Implementation , pp. 205-218, 2006

6. W. Vogels. Eventually Consistent. ACM Queue, vol. 6, no. 6, December 2008 7. Goetz Graefe, Query Evaluation Techniques for Large Databases, ACM Computing

Surveys, Vol. 25, No. 2, June 1993

8. R. Elmasri, and S. Navathe, Fundamentals of Database Systems, Benjamin Cummings, Pearson, 6th Edition, 2010

9. Korth , Silberschatz and Sudarshan, Database System Concepts, Tata McGraw Hill, 6th Edition, 2011. R. N. Prasad, Seema Acharya, “Fundamentals of Business Analytics” , Wiley 2011

10. Thomas H. Davenport, Jeanne G. Harris and Robert Morison, “Analytics at Work: Smarter Decisions, Better Results”, Harvard Business Press, 2010

11. Evan Stubbs, “Delivering Business Analytics: Practical Guidelines for Best Practice”, Wiley 2013

4. On-line Course Resources:

1. MIT Course ware: Database Systems

5. List of Assignments/ home works /problems:

1. Implementation of Database Operators such as Join, Sort, GroupBy etc

2. Simulation of recovery techniques such as redo logging, undo logging, ARIES etc

6. Learning Outcomes of the Course:



CO 1

:

Students will learn advanced topics in RDBMS theory viz. transaction processing, query processing and query optimization



CO 2

:

Students will be exposed to the latest trends in the database technology such as

Hadoop distributed file system, HIVE (data warehousing application built on Hadoop), MapReduce (software framework by Google)



CO 3

:

Students will get exposure to some classic and path breaking papers in the DBMS area which have laid the foundation of RDBMS theory (e.g. ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging by C. Mohan, Query Evaluation Techniques for Large Databases by Goetz Graefe)

 CO 4: Students will become matured DBMS professionals who would have more familiarity

with the internal functioning of a typical real life DBMS than typical application developers who can simply write SQL queries and/or do routine DB administration

7. Questions (Not full question – just type/ theme/topic / abstract):

Submission of question-wise marks obtained in excel sheet to the Department. Note: Same sequence of questions is to be maintained in excel sheet and also mapping in item (9) below. Test- 1 examination:

 Question 1: Understand Serialzability, Conflict-serializable schedules, locking protocols to preserve consistency Undo, Redo and Undo-Redo logging

 Question 2: Understand Undo, Redo and Undo-Redo logging Test- 2 examination:



Question 1

:

Different algorithms for DB operators such as sort, join etc

 Question 2: Basic query optimization tehniques  …

End Semester examination:

 Question 1: Concurrency control using locking  Question 2: Recovery using logging

 Question 3: Concurrency control and recovery using ARIES  Question 4: Implementation of DB operators

 Question 5: Cost evaluation of query plans and query optimization techniques  Question 6: Case studies – HADOOP etc

8. Program Outcomes relevant to the Outcomes:

Full listing on URL

http://www.coep.org.in/index.php?pid=824

a) Understanding advanced concepts of Computer Engineering and the underlying basic mathematics, science and engineering concepts.

b) Creating appropriate experiments and analyzing their outcomes.

c) Analyzing real life situation and creating design solutions with a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability

d) Understand intellectual property rights and applying them in an appropriate fashion e) Understand inter-disciplinary areas and apply that in the problem domains

f) Understand effective communication methods and apply them g) Analyze contemporary issues

h) Understand need and skills for life-long learning and apply that by learning a liberal area

9. Mapping of Questions to CO’s: (Sequence of Questions as per item 7)

Questions CO’s 1 a, c 2 a, c 3 a, c, g 4 a, c 5 a, c 6 a, c, g …

10. Mapping of CO’s to PO’s:

CO’s PO’s CO-1 a, c CO-2 a, c CO-3 a, c CO-4 a, c, g 11. Evaluation Scheme:

Examination Marks Date

Quiz I 20 As per academic schedule

Quiz II 20 As per academic schedule

End Sem Exam 60 As per academic schedule

(Dr J V Aghav) Head, Comp IT Dept

(S P Gosavi) Course in charge