department of information science & engineering scheme of ... · scheme of teaching and...

Department of Information Science & Engineering

Scheme of teaching and examination & syllabus

of

I-IV Semester M.Tech (Computer Network Engineering)

(Year of admission: 2016-18)

The National Institute of Engineering, Mysore – 8

(Autonomous Institution under VTU)

1

Department of Information Science and Engineering

M.Tech(Computer Network Engineering)

Vision:

Information Science and Engineering department will provide quality technical education to produce creative, innovative and globally recognized information engineers of tomorrow for the betterment of society.

Mission:

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

Program Educational Objectives

PEO1: Graduates will have an understanding of computer networks and related skills necessary for successful careers.

PEO2: Graduate will be able to engage in higher studies or conduct research.

PROGRAM SPECIFIC OUTCOMES

PSO1: Computer Network Engineers able to model design and implement computer network systems to meet specific requirements and develop solutions through use of emerging technology for societal challenges. PSO2: Acquire professional competence in research, project management and involve in life-long learning

2

PROGRAM OUTCOMES:

1. Engineering Knowledge: Real world engineering problems are solved by applying knowledge of science, mathematics, computer and information engineering.

2. Problem Analysis: Identify, devise and analyze real world engineering problems using

principles of mathematics, sciences and information technologies.

3. Design and Develop solutions: Designing and developing solutions for engineering problems based on needs while considering the norms of Safety and environmental conditions.

4. Conduct investigations of complex problems: Use research based knowledge and

research methods including design of experiments, analysis and interpretation of data and synthesis of the information to provide valid conclusions.

5. Modern Tool usage: Applying appropriate engineering techniques and tools that includes

simulation and modeling to solve complex engineering problems

6. The engineering and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and their consequent responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts and demonstrate the knowledge of and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics, responsibilities and

norms of engineering practice

9. Individual and Team Work: Participate and performs effectively as an individual and as a member or leader in diverse teams and in multidisciplinary environment

10. Communication: Communicate effectively with engineering community and the

society through reports and presentations

11. Project Management and finance: Apply the principles of software engineering and fundamentals of finance to manage a project in multidisciplinary environment. In the verge of technological changes, there is a need to recognize and learn independently and also in a team.

12. Lifelong learning: Recognize the need for and have the preparation and ability to engage

in independent and lifelong learning in the broadest context of technological change. 3

SCHEME OF TEACHING AND EXAMINATION

M. TECH COMPUTER NETWORK ENGINEERING - I SEMESTER

Sl. No

Subject Code

Subject Teaching

Dept.

Contact Hrs./Week No. of Credits L T P

1 MCN0531 Wireless Adhoc Network CSE/ISE 4 0 2 5

2 MCN0532 Advances in Computer Networks

CSE/ISE 4 0 2 5

3 MCN0533 Information and Network Security

CSE/ISE 4 2 0 5

4 AMT0401 Advanced Mathematics CSE/ISE

4 0 0 4

5 MCN05XX Elective – I CSE/ISE 4 2 0 5

6 MCN05XX Elective – II CSE/ISE 4 2 0 5

Total Credits

23 6 4 29

Total Contact Hrs./Week: 33

4


M. TECH COMPUTER NETWORK ENGINEERING - II SEMESTER

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Sl. No

Subject Code

Subject Teaching

Dept.

Contact Hrs./Week No. of Credits L T P

1 MCN0537 Cyber Crime and Digital forensic

CSE/ISE 4 2 0 5

2 MCN0515 Cloud Computing CSE/ISE 4 2 0 5

3 MCN0518 Protocol Engineering CSE/ISE 4 2 0 5

4 MCN0401 Network Management CSE/ISE 4 0 0 4

5 MCN05XX Elective – III CSE/ISE 4 2 0 5

6 MCN05XX Elective – IV CSE/ISE 4 2 0 5

Total Credits

24 6 4 29

Total Contact Hrs./Week: 34

5


M. TECH COMPUTER NETWORK ENGINEERING - III SEMESTER


Sl.No Subject Code Subject

Teaching Hours/ Week Credits

L T P

1 MCN0402 Industrial Training for 8 weeks duration (At the end of the training, students are required to submit a report and present a seminar)

- - - 4

2 MCN0801 Project-work ( preliminary)

(Students have to initiate the project-work during III semester and are required to submit a report and present a seminar)

- - - 8

3 MCN0201 Subject Seminar on current topic - - - 2

Total Credits 14

6


M. TECH COMPUTER NETWORK ENGINEERING - IV SEMESTER

Credits Division of the programme

Sl.No Subject Code Subject


L T P

1 MCN2801 Project Work

(Students have to submit the final project report at the end of the semester which will be evaluated followed by a seminar, presentation and viva voce examination)

- - - 28

Total Credits 28

Core Courses 38

Elective Courses 20

Seminars/Industrial Training 14

Major Project 28

T O T A L 100

7


M. TECH COMPUTER NETWORK ENGINEERING - ELECTIVE COURSES


Sl.No Subject Code

Subject


L T P

1 MCN0534 Advanced Algorithms 4 0 2 5

2 MCN0535 Multi core Architecture and programming

4 2 0 5

3 MCN0536 Multimedia Communications 4 2 0 5

4 MCN0506 Optical Networks 4 0 2 5

5 MCN0524 Intrusion Detection and Prevention Systems

4 2 0 5

6 MCN0501 Advanced Digital Communication 4 0 2 5

7 MCN0505 Client server Programming 4 0 2 5

8 MCN0509 System Modeling and Simulation 4 2 0 5

9 MCN0511 Information Security 4 0 2 5

10 MCN0512 Distributed systems 4 2 0 5

11 MCN0513 Computer Systems performance Analysis

4 2 0 5

12 MCN0514 Web Engineering 4 0 2 5

13 MCN0520 Advances in Storage Area Networks

4 2 0 5

14 MCN0521 Wireless Sensor Networks 4 2 0 5

8

15 MCN0525 Cyber Security 4 2 0 5

16 MCN0526 Cloud sensor Networks 4 2 0 5

17 MCN0527 Vehicular sensor networks 4 2 0 5

18 MCN0528 Robot aided sensor networks 4 2 0 5

19 MCN0529 Smart sensor networks 4 2 0 5

29 MCN0530 Cyber enabled distributed computing and knowledge discovery

4 2 0 5

9

WIRELESS Ad-HOC NETWORKS

SubCode: MCN0531

Designation: Core

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

Students will be able to 1. Apply knowledge of wireless sensor networks to various application areas. 2. Design, implement and maintain wireless sensor networks. 3. Formulate and solve problems creatively. 4. Explain the knowledge acquired by hands-on session. 5. Explain the energy management 6. Explain the security protocols of wireless systems

UNIT-1 Ad hoc Wireless Networks: Introduction, Issues in Ad hoc Wireless Networks, Ad hoc Wireless Internet; MAC Protocols for Ad hoc Wireless Networks: Introduction, Issues in Designing a MAC Protocol, Design Goals of MAC Protocols, Classification of MAC protocols, Contention-Based Protocols, Contention-Based Protocols with Reservation Mechanisms, Contention-Based Protocols with Scheduling Mechanisms,

Self Learning Component(SLC): MAC Protocols that Use Directional Antennas

(Chapter 5: 5.1-5.3, Chapter 6: 6.1-6.8) 10 Hours

UNIT-2 Routing Protocols for Ad Hoc Wireless Networks:Introduction, Issues in Designing a Routing Protocol for Ad hoc Wireless Networks; Classification of Routing Protocols; Table Driven Routing Protocols; On-Demand Routing Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols

SLC:Power-Aware Routing Protocols

(Chapter 7: 7.1-7.6, 7.8, 7.9) 10 Hours

UNIT-3 Multicast Routing in Ad hoc Wireless Networks: Introduction, Issues in Designing a Multicast Routing Protocol, Operation of Multicast Routing Protocols, An Architecture Reference Model for Multicast Routing Protocols, Classifications of Multicast Routing Protocols, Tree-Based Multicast Routing Protocols.

SLC:Mesh-Based Multicast Routing Protocols.

(Chapter 8: 8.1-8.7) 9 Hours

10

UNIT-4 Transport Layer and Security Protocols for Ad hoc Networks: Introduction, Issues in Designing a Transport Layer Protocol; Design Goals of a Transport Layer Protocol; Classification of Transport Layer Solutions; TCP over Transport Layer Solutions; Other Transport Layer Protocols for Ad hoc Networks; Security in Ad hoc Wireless Networks, Issues and Challenges in Security Provisioning, Network Security Attacks, Key Management SLC: Secure Touting Ad hoc Wireless Networks.

(Chapter 9: 9.1-9.6, 9.7-9.12) 9 Hours

UNIT-5 Quality of Service and Energy Management in Ad hoc Wireless Networks

Introduction, Issues and Challenges in Providing QoS in Ad hoc Wireless Networks, Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions; SLC: Relevant Case study. 7Hours

UNIT-6 Energy Management in Ad hoc Wireless Networks: Introduction, Need for Energy Management in Ad hoc Wireless Networks, Classification of Energy Management Schemes, Battery Management Schemes, Transmission Management Schemes, SLC: System Power Management Schemes.

(Chapter 10: 10.1-10.5, Chapter 11: 11.1-11.6) 7Hours

LABORATORY WORK

Note: Standard Network Parameters and supporting protocols may be assumed for simulation. Any suitable network simulator may be used. (Preferably NS2 or NS3 Simulator)

1. Develop unicast routing protocols using any suitable Network Simulator for (Mobile Ad hoc Networks) MANET to find the best route using the any one of routing protocols from each category from table-driven (e.g., link state or DSDV) on demand (e.g., DSR, AODV, TORA), hybrid (e.g., ZRP, contact-based architectures) and hierarchical (e.g., cluster based.) The efficient path/route should be established for source and destination data transmission using routing protocols. Understand the advantages and disadvantages of each routing protocol types by observing the performance metrics of the routing protocol. In that way the best application/environment suitable routing protocol can be identified in each category.

2: Develop multicast routing protocols using any suitable Network Simulator for MANET in which session nodes are connecting through either tree(MAODV, MCEDAR) or mesh (ODMRP,

11

CAMP, FGMP) structure. Analyze the performance metrics of multicast routing protocols with unicast routing protocols.

3. Develop MAC Protocol using any suitable Network Simulator for MANETs to send the packet without any contention through wireless link using the following MAC protocols; (CSMA/CA (802.11), MACA, MACAW, PAMAS, SMAC). Analyze its performance with increasing node density and mobility.

4. Develop and Analyze the performance of TCP connection when it is used for wireless networks. You will find performance of TCP decreases dramatically when a TCP connection traverses a wireless link on which packets may be lost due to wireless transmission errors. Make use of Active Queue Management Technique to control congestion on Wireless Networks. Evaluate the performance of FIFO, RED and WFQ over wireless networks using suitable Network Simulator.

5. Simulate MANET environment using suitable Network Simulator and test with various mobility model such as Random way point, group mobility, highway model, Manhattan model, hybrid models) (Spatial correlation, temporal correlation, relative speed, link durations). Analyze throughput, PDR and delay with respect to different mobility models.

TEXT BOOKS:

1. C. Siva Ram Murthy & B. S. Manoj: Ad hoc Wireless Networks, 2nd Edition, Pearson Education, 2011

REFERENCES:

1. Ozan K. Tonguz and Gianguigi Ferrari: Ad hoc Wireless Networks, John Wiley, 2007.

2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad hoc Wireless Networking, Kluwer Academic Publishers, 2004.

12

ADVANCES IN COMPUTER NETWORKS

SubCode: MCN0532

Designation: Core

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

COURSE OUTCOMES

1. Explain the basics of Computer Networks. 2. Describe Network architectures. 3. Explain Concepts of fundamental protocols. 4. Explain knowledge of internetworking concepts. 5. Explain the knowledge of internetworking concepts in various applications. 6. Explain the implementation concepts in congestion control and error detections.

UNIT-1 Foundation Building a Network, Requirements, Perspectives, Scalable Connectivity, Cost-Effective Resource sharing, Support for Common Services, Manageability, Protocol layering, Performance, Bandwidth and Latency, Delay X Bandwidth Product, Perspectives on Connecting, Classes of Links, Reliable Transmission, Stop-and-Wait , Sliding Window SLC: Concurrent Logical Channels. T1:Ch 1.1, 1.2, 1.5.1, 1.5.2., 2.1, 2.5 T2:Ch 4 9Hours

UNIT 2: Internetworking- I Switching and Bridging, Datagrams, Virtual Circuit Switching, Source Routing, Bridges and LAN Switches, Basic Internetworking (IP), What is an Internetwork ?, Service Model, Global Addresses, Datagram Forwarding in IP, subnetting and classless addressing, Address Translation(ARP), Host Configuration(DHCP), Error Reporting(ICMP) SLC: Virtual Networks and Tunnels. T1: Chap 3.1, 3.2. 9Hours

UNIT-3 Internetworking- II Network as a Graph, Distance Vector(RIP), Link State(OSPF), Metrics, The Global Internet, Routing Areas, Routing among Autonomous systems(BGP), IP Version 6(IPv6), Mobility SLC: Mobile IP T1: Chap3.3, 4.1.1,4.1.3 T2:Ch 13.1 to 13.18 , Ch 18. 10 Hours

13

UNIT-4 End-to-End Protocols Simple Demultiplexer (UDP), Reliable Byte Stream(TCP), End-to-End Issues, Segment Format, Connecting Establishment and Termination, Sliding Window Revisited, Triggering Transmission, Adaptive Retransmission, Record Boundaries SLC: TCP Extensions UNIT-5 Queuing Disciplines, FIFO, Fair Queuing, TCP Congestion Control, Additive Increase/ Multiplicative Decrease, Slow Start, Fast Retransmit SLC:Fast Recovery. T1: Chap 5.1, 5.2.1 to 5.2.8, 6.2, 6.3 7Hours

UNIT-6 Congestion Control and Resource Allocation Congestion-Avoidance Mechanisms, DEC bit, Random Early Detection (RED), Source-Based Congestion Avoidance. The Domain Name System(DNS),Electronic Mail(SMTP,POP,IMAP,MIME),World Wide Web(HTTP) SLC:Network Management(SNMP) . T1: Chap 6.4 T2: Ch 23.1 to 23.16, Ch 24, Ch 25, Ch 27.1 to 27.8 7Hours

LABORATORY WORK PART A: Implement the following using C/C++:

1. Write a program to transfer the contents of a requested file from server to the client using TCP/IP Sockets (using TCP/IP Socket programming). 2. Write a program to archive Traffic management at Flow level by implementing Closed Loop Control technique. (Leaky Bucket Algorithm) 3. Write a program to implement dynamic routing strategy in finding optimal path for data transmission. (Bellman ford algorithm). 4. Write a program to implement Link State Routing (Dijkstra Algorithm). 5. Write a program for implementing the error detection technique while data transfer in unreliable network code using CRC (16-bits) Technique. 6. Write a program for providing security for transfer of data in the network. (RSA Algorithm) 7. Write a program for encrypting 64 bit playing text using DES algorithm. PART B: Simulation Programs using OPNET /NS2 or any other equivalent software

1. Simulate a 3 node point to point network with duplex links between them. Set the Queue size and vary the bandwidth and find the number of packets dropped. 2. Simulate a four-node point-to-point network, and connect the links as follows: n0->n2, n1->n2 and n2->n3. Apply TCP agent changing the parameters and determine the number of packets sent/received by TCP/UDP 3. Simulate the different types of internet traffic such as FTP and TELNET over network and analyze the throughput.

14

Text books:

1. T1: Larry Peterson and Bruce S Davis “Computer Networks :A System Approach” 5th Edition , Elsevier -2014

2. T2: Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols and Architecture” 6th Edition, PHI - 2014

References:

1. Uyless Black “Computer Networks, Protocols , Standards and Interfaces” 2nd Edition - PHI

2. Behrouz A Forouzan “TCP/IP Protocol Suite” 4th Edition – Tata McGraw-Hill.

15

INFORMATION and NETWORK SECURITY

Subject Code: MCN0533

Designation: Core

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

1. Explain the fundamentals of Cryptography 2. Acquire knowledge on standard algorithms used to provide confidentiality, integrity and

authenticity. 3. Describe the various key distribution and management schemes. 4. Implement encryption techniques to secure data in transit across data networks 5. To design security applications in the field of Information technology. 6. Explain Electronic mail security.

UNIT -1 Classical Encryption Techniques Symmetric Cipher Model, Cryptography, Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One Time Pad. Block Ciphers and the data encryption standard: Traditional block Cipher structure, stream Ciphers and block Ciphers, Motivation for the feistel Cipher structure, SLC: the feistel Cipher. 7 Hours UNIT -2 The data encryption standard, DES encryption , DES decryption , A DES example, results,the avalanche effect, the strength of DES, the use of 56-Bit Keys, the nature of the DES algorithm,timing attacks, Block cipher design principles, number of rounds, design of function F, SLC: key schedule algorithm.

07 Hours UNIT -3 Public-Key Cryptography and RSA: Principles of public-key cryptosystems. Public-key cryptosystems. Applications for public-key cryptosystems, requirements for public-key cryptosystems. public-key cryptanalysis. The RSA algorithm, desription of the algorithm, computational aspects, the security of RSA. Other Public-Key Cryptosystems: Diffie-hellman key exchange, The algorithm, key exchange protocols,man in the middle attack, Elgamal Cryptographic systems, Elliptic curve arithmetic, abelian groups,elliptic curves over real numbers, elliptic curves over Zp, elliptic curves overGF(2m), Elliptic curve cryptography, Analog of Diffie-hellman key exchange, Elliptic curve encryption/ decryption, security of Elliptic curve cryptography, SLC:Pseudorandom number generation based on an asymmetric cipher, PRNG based on RSA.

9 Hours

16

UNIT -4 Key Management and Distribution: Symmetric key distribution using Symmetric encryption, A key distribution scenario, Hierarchical key control, session key lifetime, a transparent key control scheme, Decentralized key control, controlling key usage, Symmetric key distribution using asymmetric encryption, simple secret key distribution, secret key distribution with confidentiality and authentication, A hybrid scheme, distribution of public keys, public announcement of public keys, publicly available directory, public key authority, public keys certificates, X-509 certificates. Certificates, X-509 version 3, public key infrastructure .User Authentication: Remote user Authentication principles, Mutual Authentication, one way Authentication, remote user Authentication using Symmetric encryption, Mutual Authentication, one way Authentication, Kerberos, Motivation , Kerberos version 4, Kerberos version 5, Remote user Authentication using Asymmetric encryption, Mutual Authentication, one way Authentication, SLC: federated identity management, identity management, identity federation, personal identity verification.

9 Hours UNIT -5 Wireless network security: Wireless security, Wireless network threats, Wireless network measures, mobile device security, security threats, mobile device security strategy, IEEE 802.11 Wireless LAN overview, the Wi-Fi alliance, IEEE 802 protocol architechture. Security, IEEE 802.11i services, IEEE 802.11i phases of operation, discovery phase, Authentication phase, key management phase, protected data transfer phase, the IEEE 802.11i pseudorandom function, .. Web Security Considerations: Web Security Threats, Web Traffic Security Approaches. Secure Sockets Layer :SSL Architecture, SSL Record Protocol, Change Cipher Spec Protocol, Alert Protocol, andshake Protocol, Cryptographic Computations. Transport Layer Security: Version Number, Message Authentication Code, Pseudorandom Functions, Alert Codes, Cipher Suites, Client Certificate Types, Certificate Verify And Finished Messages, Cryptographic Computations, Padding. HTTPS Connection Initiation, Connection Closure. Secure Shell (SSH) Transport Layer Protocol SLC:User Authentication Protocol, Connection Protocol.

10 Hours UNIT -6 Electronic Mail Security: Pretty good privacy, notation, operational; description, S/MIME, RFC5322, Multipurpose internet mail extensions, S/MIME functionality, S/MIME messages, S/MIME certificate processing, enhanced security services, Domain keys identified mail, internet mail architechture, E-Mail threats, DKIM strategy, DKIM functional flow. IP Security: IP Security overview, applications of IPsec, benefits of IPsec, Routing applications, IPsec documents, IPsec services, transport and tunnel modes, IP Security policy, Security associations, Security associations database, Security policy database, IP traffic processing, Encapsulating Security payload, ESP format, encryption and authentication algorithms, Padding, Anti replay service, transport and tunnel modes, combining security associations, authentication plus confidentiality, basic combinations of security associations, internet key exchange, key determinations protocol, header and payload formats SLC:cryptographic suits.

10 Hours

17

LABORATORY WORK

1. Implement Conventional encryption algorithms. Implement DES, AES which accepts a string and produces a cipher text.

2. Implement Public key cryptography algorithms. Implement RSA algorithm which accepts a text file and produces a cipher text file.

3. Implement secure hash algorithms for Data Integrity. Implement MD5 and SHA-1 algorithm, which accepts a string input, and produce a fixed size number - 128 bits for MD5; 160 bits for SHA-1, this number is a hash of the input. Show that a small change in the input results in a substantial change in the output.

4. Setup a security channel by using Diffie-Hellman key exchange between client and server.

5. Using any simulation tool: demonstrate packet filtering firewalls, create the ACL, create VLAN [subnetting].

6. Setup a port scanner and identify the intrusion

Text Books:

1. William Stallings: Cryptography and Network Security, Pearson 6th edition. References 1. V k Pachghare: Cryptography and Information Security.

18

Subject Code: AMT0401 Subject Title: ADVANCED MATHEMATICS Designation: CORE Credits: 04 Contact Hours: 04 Type of Delivery: 4-0-0-0

Course outcomse

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

1. Construct the matrix , digraphs of relations and prove some results on different types

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

3. Apply the concepts of graph theory to solve some application problems.

4. Solve problems associated with basic probability, Baye’s rule , discrete &. Evaluate estimators, construct confidence intervals, and perform hypothesis tests and

5. Solve problems of Joint Distribution , Markov chain using transition probability of relation and also obtain equivalence classes.

6. Solve problems using pigeon-hole principle.continuous probability distributions. Obtain regression lines. Mtrix and also the problems in queuing theory.

Unit-1 : Relations Binary relations, Matrix and Digraph representation of a relation, Operations on binary relations, (SLE:Composition of relations), Properties of relations, Equivalence relations. Unit-2 : Functions Function, Types of functions, Composition of functions, Invertible functions, Recursive function, (SLE:Hash function), The Pigeonhole-principle. Unit-3 : Graph Theory Graphs and Multigraphs, Subgraphs, Isomorphic and Homomorphic graphs, Paths, Cycles and Circuits in a graph. Connected graphs. Euler’s and Hamiltonian graphs. The Konigsberg Bridge problem.Trees, Kruskal’s algorithm(SLE: Prim’s algorithm), Cut sets and cut vertices, Network flow problems.

19

Unit-4 : Probability (SLE: Basic probability upto Baye’s Theorem ) Random variables – Discrete and continuous random variables, Binomial, Poisson’s, Exponential and Normal Distributions. Unit-5 : Statistical Inference (SLE: Basic concept of statistics viz mean and standard deviation) Random sampling, Sampling distributions, Parameter estimation, Testing of hypothesis, Correlation and regression Unit-6 : Joint Distribution and Markov Chains Concept of joint probability: Joint probability distribution, (discrete) Independent random variables, Expectation, Covariance, Correlation Coefficient.(SLE: Continuous joint probability distributions) Probability vectors, Stochastic matrices, Regular stochastic matrices, Markov chains, Concept of a queue, the M/G/I and M/M/I queuing systems, analysis.

1. Discrete Mathematics and its Applications – Kenneth.H.Rosen V edition 2. Elements of Discrete Mathematics – C.L. Liu, D.P. Mohapatra. 3. Discrete and Combinatorial Mathematics – Ralph P. Grimaldi. 4. Probability and Statistics – Schaum Series (All latest editions) 5. Engineering Mathematics – T. Veerarajan, edition 2, Tata McGraw-Hill Publications.

20

Cyber Crime and Digital forensic (4:2:0) Sub code : MCN0537 CIE : 50% Marks

Hrs/week : 04 SEE : 50% Marks

SEE : 03Hrs Max Marks : 100

Course Outcomes:

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

1. Identify and need for computer forensics 2. Analyze the computer forensic technology 3. Describe the process of data recovery 4. Explain legal aspects of collecting and preserving computer evidence 5. How to recover electronic documents 6. Distinguish between usable and unusable file formats

UNIT – 1 9 Hrs

Computer forensics fundamentals

Introduction: what is computer forensics?, Use of computer forensics in law enforcement,

Computer forensics assistance to human resources /employment proceedings, Computer

forensics services, Benefits of professional forensics methodology SLC:Steps taken by computer

forensics specialists, who can use computer forensic evidence?

UNIT-2

Types of computer forensics technology 8 Hrs

Types of military computer forensic technology, Types of law enforcement, Computer forensic

technology, Types of business computer forensic technology, Occurrence of cybercrime, Cyber

detectives, Fighting cyber crime with risk –management techniques, Computer forensics

investigative services SLC:Forensic process improvement.

UNIT-3

Data recovery 9 Hrs

Introduction of Data recovery , Data back-up and recovery, the role of back-up in data recovery,

The data-recovery solution.

21

UNIT-4 9 Hrs

Evidence collection and data seizure

Why collect evidence?, Collection options, Obstacles, Types of evidence, The rules of evidence,

Volatile evidence, General procedure, Collection and archiving, Methods of collection, Artifacts,

Collection steps, Preserving the digital crime scene, Computer evidence processing scene, Legal

aspects of collecting SLC: preserving computer forensic evidence.

UNIT-5 8 Hrs

Computer image verification and authentication

Special needs of evidential authentication, Practical consideration, Practical implementation,

Electronic document discovery :a powerful new litigation tool, Time travel, SLC: Forensics

identification and analysis of technical surveillance devices.

UNIT-6 9 Hrs

Reconstruction past events

How to become a digital detective, Useable file formats, Unusable file formats, Converting files,

Network forensics scenario, A technical approach, Destruction of e-mail, Damaging computer

evidence, Documenting the intrusion on destruction of data SLC:System testing.

TEXT BOOKS:

1. Computer Forensics computer crime scene investigation by John R VACCA , Firewall

Media ,2009 edition Reprint 2012.

REFERENCE BOOKS:

1. Guide to computer forensics and investigations by Bill Nelson, Amelia Phillips,

Christopher Stuart, Cengage Learning publications, 4th edition 2013.

2. Computer Forensics by David Cowen -CISSP , Mc GrawHill education , Indian edition

2013.

22

CLOUD COMPUTING

SubCode: MCN0515

Designation: Core

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

1. Explain how to use Cloud Services. 2. Describe knowledge Virtualization 3. Explain knowledge Task Scheduling algorithms. 4. Apply Map-Reduce concept to applications. 5. Build Private Cloud. 6. Explain knowledge in cloud resource virtualization and scheduling.

UNIT-1 Introduction, Cloud Infrastructure Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing the Google perspective, Microsoft Windows Azure and online services, Open-source software platforms for private clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service level agreements, User experience and software licensing. Exercises SLC: problems.

10 Hours UNIT-2 Cloud Computing: Application Paradigms. Challenges of cloud computing, Architectural styles of cloud computing, Workflows: Coordination of multiple activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce programming model, A case study: The GrepTheWeb application , Cloud for science and engineering, High-performance computing on a cloud, SLC:Cloud computing for Biology research, Social computing, digital content and cloud computing.

9 Hours UNIT-3 Cloud Resource Virtualization. Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines, Performance and Security Isolation, Full virtualization and paravirtualization, Hardware support for virtualization, Case Study:Xen a VMM based paravirtualization, Optimization of network virtualization, vBlades, Performance comparison of virtual machines, SLC:The dark side of virtualization, Exercises and problems.

10 Hours UNIT-4 Cloud Resource Management and Scheduling. Policies and mechanisms for resource management, Application of control theory to task scheduling on a cloud, Stability of a two-level resource allocation architecture, Feedback control based on dynamic thresholds, Coordination of specialized autonomic performance managers, A utility-based model for cloud-based Web services, Resourcing bundling: Combinatorial auctions 23

for cloud resources, Scheduling algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time, Cloud scheduling subject to deadlines, Scheduling Map Reduce applications subject to deadlines SLC:Resource management and dynamic scaling, Exercises and problems.

9Hours UNIT-5 Cloud Security, Cloud Application Development. Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact assessment, Trust, Operating system security, Virtual machine Security, Security of virtualization, Security risks posed by shared images, Security risks posed by a management OS, A trusted virtual machine monitor, Amazon web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance and connect to it SLC:How to use S3 in java, 8 Hours UNIT-6 Cloud-based simulation of a distributed trust algorithm, A trust management service, A cloud service for adaptive data streaming, Cloud based optimal FPGA synthesis SLC:Exercises and problems.

6Hours Text Book:

1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013. REFERENCES:

1. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and Paradigms, Willey 2014.

2. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and Security, CRC Press 2013.

24

Subject Title: PROTOCOL ENGINEERING

SubCode: MCN0518

Designation: Core

Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0 Course Outcome On successful completion of the course the students will be able to

1. Explain the concept of protocols and their representation and discuss the phases of

protocol engineering

2. Identify the components of protocol to be specified and to create formal specification of protocol using communicating finite state machine

3. Design and develop SDL based specification of a protocol

4. Apply different types of protocol verification techniques and tools

5. Identify a generally applicable and efficient procedure for generating a conformance test suite for a given protocol implementation, to compare different types of protocol testing methods, to familiarize concepts of performance, interoperability and scalability testing of protocol

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

UNIT-1. Introduction, Error Control, Flow Control: Communication model, Communication Software, Communication Subsystems, Communication Protocol Definition/Representation, Formal and Informal Protocol Development Methods, Protocol Engineering Phases, Type of Transmission Errors, Linear Block Code, Cyclic Redundancy Checks, Introduction to Flow Control, Window Protocols, Sequence Numbers, Negative Acknowledgments,

SLC:Congestion Avoidance 9hours

UNIT-2. Network Reference Model: Layered Architecture, Network Services and Interfaces, Protocol Functions: Encapsulation, Segmentation, Reassembly, Multiplexing, Addressing, OSI Model Layer Functions,TCP/IP Protocol Suite,

SLC: Application Protocols. 9hours

UNIT-3. Protocol Specification: Components of specification, Service specification, Communication Service Specification Protocol entity specification: Sender, Receiver and

25

Channel specification, Interface specifications, Interactions, Multimedia specifications, Alternating Bit Protocol Specification,

SLC: RSVP specification. 8hours

UNIT-4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient Features. Communication System Description using SDL, Structure of SDL. Data types and communication paths, Examples of SDL based Protocol Specifications: Question and answer protocol, X-on-X-off protocol, Alternating bit protocol, Sliding window protocol specification, TCP protocol specification, SDL based platform for network, OSPF, BGP Multi Protocol Label Switching SDL components, Protocol Verification using FSM, ABP Verification, Protocol Design Errors, Deadlocks, Unspecified Reception, Non-executable Interactions, State Ambiguities, Protocol Validation Approaches: Perturbation Technique, Reachability Analysis, Fair Reachability Graphs, Process Algebra based Validation, SDL Based Protocol Verification: ABP Verification, Liveness Properties

SLC: SDL Based Protocol Validation: ABP Validation 9hours

UNIT-5 Protocol Conformance and Performance Testing: Conformance Testing Methodology and Framework, Local and Distributed Conformance Test Architectures, Test Sequence Generation Methods: T, U, D and W methods, Distributed Architecture by Local Methods, Synchronizable Test Sequence, Conformance testing with Tree and Tabular Combined Notation (TTCN), Conformance Testing of RIP, Testing Multimedia Systems, quality of service test architecture(QOS), Performance Test methods, SDL Based Performance Testing of TCP, OSPF, Interoperability testing

SLC: Scalability testing protocol synthesis problem 8hours

UNIT-6 Protocol Synthesis+ and Implementation: Synthesis methods, Interactive Synthesis Algorithm, Automatic Synthesis Algorithm, Automatic Synthesis of SDL from MSC, Protocol Re-synthesis, Requirements of Protocol Implementation, Objects Based Approach To Protocol Implementation, Protocol Compilers, Code generation from Estelle, LOTOS

SLC: SDL and CVOPS.

9hours

26

TEXT BOOKS:

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

REFERENCE BOOKS:

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

27

Subject Code: MCN0401 Subject Title: NETWORK MANAGEMENT

Designation: CORE


1. Describe the importance of Network topology, discuss the common network problems 2. Discuss the Network management standards, terminology , symbols and conventions,

data types etc., 3. Discuss the SNMP V1 network management and communication model 4. Analyze the RMON, SMI, MIB, distinguish relationship between control and data tables 5. Explain the broadband network management ATM Networks, discriminate M1, M2 and

M2 interface 6. Explain the broadband access networks and technologies

UNIT-1 Introduction: Analogy of Telephone Network Management, Data and Telecommunication Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets, Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services; Case Histories of Networking and Management – The Importance of topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology Managers, Network Management: Goals, Organization, and Functions- Goal of Network Management, Network Provisioning, Network Operations and the NOC, Network Installation and Maintenance; Network and System Management, Network Management System platform SLC: Current Status and Future of Network Management. 9hours UNIT-2 Basic Foundations: Standards, Models, and Language: Network Management Standards, Network Management Model, Organization Model, Information Model – Management Information Trees, Managed Object Perspectives, Communication Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros SLC: Functional Model 8hours UNIT-3 SNMPv1 Network Management: Managed Network: The History of SNMP Management, Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, System Overview. The Information Model – Introduction, The Structure of Management Information, Managed Objects, Management

28

Information Base. The SNMP Communication Model – The SNMP Architecture, Administrative Model, SNMP Specifications, SNMP Operations, SNMP MIB Group SLC: Functional Model 9hours UNIT-4 SNMP Management – RMON: Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The RMON2 Management Information Base RLC: RMON2 Conformance Specifications. 8hours

UNIT-5 Broadband Network Management: Broadband Access Networks and Technologies: Broadband Access Networks, Broadband Access Technology; HFCT Technology: The Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable. Reference Architecture; HFC Management – Cable Modem and CMTS Management, HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line Technology – Role of the ADSL Access Network in an Overall Network, ADSL Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2,

SLC:ADSL Configuration Profiles. 9hours

UNIT-6 Network Management Applications: Configuration Management- Network Provisioning, Inventory Management, Network Topology, Fault Management- Fault Detection, Fault Location and Isolation Techniques, Performance Management – Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; Event Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State Machine Model, Security Management – Policies and Procedures, Security Breaches and the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication and Authorization, Client/Server Authentication Systems, Messages Transfer Security, Protection of Networks from Virus Attacks, Accounting Management, Report Management

SLC:Policy- Based Management, Service Level Management. 9hours

29

TEXT BOOKS:

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

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

30

ELECTIVES

31

ADVANCED ALGORITHMS

Subject Code: MCN0534 Designation: CORE

Credits: 05 Contact Hours: 04 Type of Delivery: 4-0-2-0 COURSE Outcomes

1. Explain the graph search algorithms. 2. Describe hill climbing and dynamic programming design techniques. 3. Develop recursive backtracking algorithms. 4. Explain NP completeness and randomized algorithms. 5. Design probabilistic and randomize algorithms. 6. Explain polynomials.

UNIT-1 Review of Analysis Techniques: Growth of Functions: Asymptotic notations; Standard notations and common functions; Recurrences and Solution of Recurrence equations- The substitution method, The recurrence – tree method, The master method; Amortized Analysis: Aggregate method SLC: Accounting and Potential Methods. 9 Hours UNIT-2 Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnson’s Algorithm for sparse graphs; Flow networks and Ford-Fulkerson method; SLC: Maximum bipartite matching. 9 Hours UNIT-3 Polynomials and the FFT: Representation of polynomials; The DFT and FFT; Efficient implementation of FFT. SLC: Programming implementations 10 Hours UNIT-4 Number -Theoretic Algorithms: Elementary notions; GCD; Modular Arithmetic; Solving modular linear equations; The Chinese remainder theorem; SLC: Powers of an element; RSA cryptosystem; Primality testing; Integer factorization SLC: Problems 10 Hours UNIT-5 String-Matching Algorithms: Naïve string Matching; Rabin - Karp algorithm; String matching with finite automata; Knuth-Morris-Pratt algorithm; Boyer – Moore algorithms. 10 Hours UNIT-6 Probabilistic and Randomized Algorithms: Probabilistic algorithms; Randomizing deterministic algorithms, Monte Carlo and Las Vegas algorithms; SLC:Probabilistic numeric algorithms. 10 Hours

32

TEXT BOOKS: 1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, 3rd Edition, Prentice-Hall of India, 2010. 2. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning, 2002. REFERENCE BOOKS: 1. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: Fundamentals of Computer Algorithms, 2nd Edition, Universities press, 2007

33

MULTI-CORE ARCHITECTURE and PROGRAMMING


Credits: 05 Contact Hours: 04 Type of Delivery: 4-2-0-0 Course Outcomes

1. Explain the recent trends in the field of Computer Architecture and identify performance related parameters

2. Expose the students to the problems related to multiprocessing 3. Describe the different types of multi core architectures 4. To expose the students to warehouse-scale and embedded architectures 5. Explain the fundamentals of threading 6. Analyze the fundamentals of parallel programming.

UNIT-1 Introduction to Multi-core Architecture: Motivation for Concurrency in software, Parallel Computing Platforms, Parallel Computing in Microprocessors, Differentiating Multi-core Architectures from Hyper- Threading Technology, Multi-threading on Single-Core versus Multi-Core Platforms Understanding Performance, Amdahl’s Law, SLC:Growing Returns: Gustafson’s Law. 7 Hours

UNIT-2 System Overview of Threading: Defining Threads, System View of Threads, Threading above the Operating System, Threads inside the OS, Threads inside the Hardware, What Happens When a Thread Is Created, Application Programming Models and Threading, Virtual Environment: VMs and Platforms, Runtime Virtualization,SLC:System Virtualization.

7 Hours

UNIT-3 Fundamental Concepts of Parallel Programming: Designing for Threads, Task Decomposition, Data Decomposition, Data Flow Decomposition, Implications of Different Decompositions, Challenges You’ll Face, Parallel Programming Patterns, A Motivating Problem: Error Diffusion, Analysis of the Error Diffusion Algorithm, An Alternate Approach: Parallel Error Diffusion, SLC:Other Alternatives. 10 Hours

UNIT-4 Threading and Parallel Programming Constructs: Synchronization, Critical Sections, Deadlock, Synchronization Primitives, Semaphores, Locks, Condition Variables, Messages, Flow Control- based Concepts, Fence, Barrier, Implementation-dependent Threading Features. Threading APIs : Threading APls for Microsoft Windows, Win32/MFC Thread APls, Threading APls for Microsoft. NET Framework, Creating Threads, Managing Threads, Thread Pools, Thread Synchronization, POSIX Threads, Creating Threads, Managing Threads, SLC:Thread Synchronization, Signaling, Compilation and Linking. 10 Hours

34

UNIT-5 OpenMP: A Portable Solution for Threading: Challenges in Threading a Loop, Loop-carried Dependence, Data-race Conditions, Managing Shared and Private Data, Loop Scheduling and Portioning, Effective Use of Reductions, Minimizing Threading Overhead, Work-sharing Sections, Performance-oriented Programming, Using Barrier and No wait, Interleaving Single-thread and Multi-thread Execution, Data Copy-in and Copy-out, Protecting Updates of Shared Variables, Intel Task queuing Extension to OpenMP, OpenMP Library Functions, SLC:OpenMP Environment Variables, Compilation, Debugging, performance. 9 Hours

UNIT-6 Solutions to Common Parallel Programming Problems: Too Many Threads, Data Races, Deadlocks, and Live Locks, Deadlock, Heavily Contended Locks, Priority Inversion, Solutions for Heavily Contended Locks, Non-blocking Algorithms, ABA Problem, Cache Line Ping-ponging, Memory Reclamation Problem, Recommendations, Thread-safe Functions and Libraries, Memory Issues, Bandwidth, Working in the Cache, Memory Contention, Cache-related Issues, False Sharing, Memory Consistency, Current IA-32 Architecture, Itanium Architecture, High-level Languages, Avoiding Pipeline Stalls on IA-32 SLC:Data Organization for High Performance. 9 Hours

Text Book

1. Multicore Programming , Increased Performance through Software Multi-threading by Shameem Akhter and Jason Roberts , Intel Press , 2006.

35

Subject Title: MULTIMEDIA COMMUNICATIONS

SubCode: MCN0536

Designation: Elective


1. Explain the Multimedia Communication Models 2. Study the Multimedia Transport in Wireless Networks 3. Solve the Security issues in multimedia networks 4. Explore real-time multimedia network applications. 5. Explore different network layer based application. 6. Study multimedia standards

UNIT-1 Introduction to Multimedia Communications: Introduction, Human communication model, Evolution and convergence, Technology framework SLC:Standardization framework.

10 Hours

UNIT-2 Framework for Multimedia Standardization: Introduction, Standardization activities, Standards to build a new global information infrastructure, Standardization processes on multimedia communications SLC: ITU-T mediacom2004 7 Hours

UNIT-3 Framework for multimedia, ISO/IEC MPEG-21 multimedia framework SLC: IETF multimedia Internet standards. 7Hours

UNIT-4 Application Layer: Introduction, ITU applications, MPEG applications, Mobile servers and applications, SLC:Universal multimedia access. 9 Hours

UNIT-5 Middleware Layer: Introduction to middleware for multimedia, Media coding, Media Streaming, SLC:Infrastructure for multimedia content distribution. 9 Hours

UNIT-6 Network Layer: Introduction, QoS in Network Multimedia Systems. 10 Hours

SLC: Example Case Study

36

TEXT BOOKS:

1. K.R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic: Introduction to Multimedia Communications – Applications, Middleware, Networking, Wiley India, 2006.

REFERENCE BOOKS:

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

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

3. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Volume 1-Media Coding and Content Processing, 2nd Edition, Pearson, 2003.

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

37

Subject Code: MCN0506 Subject Title: OPTICAL NETWORKS

Designation: ELECTIVE


1. Explain different generations of digital transport networks

2. Describe the timing and synchronization in digital networks

3. Describe architecture of OTN

4. Describe the WDM

5. Develop the concept of label switching and its importance in OTN

6. Explain the Knowledge on LMP and optical routers

Part-A

UNIT-1 Introduction, Telecommunications Infrastructure, Characteristics of Optical Fiber: Three generations of Digital Transport Networks; A brief introduction to WDM and TDM; The Optical Marketplace; Key Optical Nodes; Other Key Terms; Evolution of Optical Systems; Key attributes of Optical Fiber, The Local Connections; The Backbone Connections; The Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3; The Layered Protocol Model in the Transport Network; considerations for Interworking Layer1, Layer 2, and Layer 3 Networks, The Basics; The Wavelength; The Basic Components; Structure of the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier Spontaneous Emission; Chromatic Dispersion;.

SLC: Wireless Optical Systems, Lasers 9 Hours

UNIT-2 Timing and Synchronization, SONET and SDH: Timing and Synchronization in Digital Networks; Effect of a Timing error; The Clocking Signal; Types of Timing in Networks; Timing Variations; Methods of Clock Exchange; Distribution of Timing Using SONET and DS1; Timing Downstream Devices; Synchronization Status Messages and Timing Loops, The SONET Multiplexing Hierarchy; SONET and SDH Multiplexing Structure; The SONET / SDH Frame Structure; SONET and SDH Functional Components; SONET and SDH Problem Detection; Locating and Adjusting Payload with Pointers; Virtual Tributaries in more detail; Virtual Tributaries in Virtual Containers; The Overhead Bytes;.

38

SLC: Building Integrated Timing Supply, SONET and SDH Concatenation 9 Hours

UNIT-3 Architecture of Optical Transport Networks, WDM, Network Topologies and Protection Schemes: The Digital Wrapper; Control Planes; In-Band and Out-Band Control Signaling; Importance of Multiplexing and Multiplexing Hierarchies; Current Digital Transport Hierarchy; SONET Multiplexing Hierarchy; SDH Multiplexing Hierarchy; Key Indexes and Other Terms; The New Optical Transport and Digital Transport Hierarchy; The OTN Layered Model; Encapsulation and Decapsulation Operations;

SLC: Generic Framing Procedure, 8 Hours

UNIT-4 The WDM Operation; DWDM, TDM and WDM Topologies; Relationship of WDM to SONET / SDH; EDF; WDM Amplifiers; Add-Drop Multiplexers; WDM Cross-Connects; Wavelength Continuity Property; Examples of DWDM Wavelength Plan; Higher Dispersion for DWDM; Tunable DWDM Lasers, The Non-Negotiable Requirement Robust Networks; Diversity in the Network; Line and Path Protection Switching; Types of Topologies; Working and Protection Fibers; Point-to-Point Topology; BLSR; Protection Switching on Four-Fiber BLSR; Meshed Topologies; PONs; Ethernet in the Wide Area Backbone,

SLC: Metro Optical Networking. 8 Hours

UNIT-5 MPLS and Optical Networks, Architecture of IP and MPLS-Based OTNs: Label Switching; FEC; Types of MPLS Nodes; Label Distribution and Binding; Label Switching and Traffic Forwarding; MPLS Support of VPNs; MPLS Traffic Engineering; Multiprotocol Lambda Switching; MPLS and Optical TE Similarities; Possibilities for the MPIS Network; Control and Data Planes Interworking, IP, MPLS, and Optical Control Planes; Interworking the three Control Planes; Management of the Planes; A Framework for the IP over Optical Networks; An Opposing View; Generalized MPLS use in Optical Networks; Bi-Directional LSPs in Optical Networks; GMPLS Extensions for G.709;

SLC: GMPLS with SONET and SDH. 9 Hours

UNIT-6 The Link Management Protocol, Optical Routers: Keep the Optical Link up and running; What is managed? Data-bearing Links; Clarification of terms; Basic functions of LMP; Control Channel Management; Link Property Correlation; Fault Management; Extending LMP operations for Optical Link Systems., Optical Switching; Implementation Preferences; Key Terms; Evolution of Switching Networks; Optical Router; Optical Switching Technologies; Optical Resources; Protecting the Label Switched Paths; Protection of the OSP; Wavelength OSP and MPLS LSP; Nesting the LSPs and OSPs; Topologies for a Node Failure; Plane Coupling and De-Coupling; Some End-to-End Wavelengths and Node-to-Node Wavelengths;

39

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

SLC: MEMS and Optical Switching; Thermo-Optic Switches. 9 Hours

TEXT BOOKS:

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

REFERENCE BOOKS:

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

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

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

40

INTRUSION DETECTION AND PREVENTION SYSTEMS (4:2:0)

Sub code :MCN0524 CIE : 50%Marks Hrs/week : 04 SEE : 50%Marks SEE Hrs : 03 Hours Max. Marks : 100 Course Outcome: On Successful completion of the course, the students will be able to:

1. Demonstrate knowledge of intrusion detection and prevention concepts. 2. Conduct traffic analysis for intrusion detection and prevention. 3. Analyze the internals for intrusion detection and prevention. 4. Write filters and policies for intrusion detection and prevention in networks. 5. Explain IPS 6. Explain the business issues.

UNIT – 1 9 Hrs UNDERSTANDING INTRUSION DETECTION: Intrusion-Detection and Intrusion-Prevention Basics-Why IDSs and IPSs are Important - IDS and IPS Analysis Schemes- IDSIPS SLC:Pros and Cons UNIT - 2 8 Hrs UNAUTHORIZED ACTIVITY I: General IDS Limitations -Network Protocol Abuses: ARP, IP, UDP, TCP SLC:ICMP. UNIT - 3 9 Hrs Tcpdump: Tcpdump Command Line Options-Tcpdump Output Format-Tcpdump Expressions-Bulk Capture-How Many Bytes Were Transferred in That Connection?-Tcpdump as Intrusion Detection? SLC:Tcpslice, Tcpflow, and Tcpjoin

UNIT – 4 7 Hrs ARCHITECTURE: IDS and IPS Architecture- Tiered Architectures. SLC:Future IDS UNIT - 5 10 Hrs IDS AND IPS INTERNALS: Information Flow in IDS and IPS-Detection of Exploits-Malicious Code Detection-Output Routines SLC: Defending IDS/IPS 41

UNIT – 6 9Hrs POLICY AND PROCEDURES & SECURITY BUSINESS ISSUES: IDS/IPS Policy- Creating an IDS/IPS Policy- International Cyber Security Related Laws-Standards-Organizations-Legal Resources on the Web - :The Business Case for Intrusion Detection and Prevention-IDS Deployment Costs SLC: Managing Intrusion Detection TEXT BOOK: “Intrusion detection and Prevention”, Carl Enrolf, Eugene Schultz, Jim Mellander, McGraw Hill, 2004 REFERENCES: 1. “Network Intrusion Detection and Prevention: Concepts and Techniques”, Ali A. Ghorbani, Wei Lu, Springer, 2010. 2. “The Practical Intrusion Detection Handbook “, Paul E. Proctor, Prentice Hall , 2001. 3. “Intrusiion Alert”, Ankit Fadia and Mnu Zacharia, Vikas Publishing house Pvt., Ltd, 2007. 4. “Intrusion Prevention Fundamentals”, Earl Carter, Jonathan Hogue, Pearson Education, 2006.

42

Subject Code: MCN0501 Subject Title: ADVANCED DIGITAL COMMUNICATION Designation: ELECTIVE Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0

Course Outcomes

1. Describe fundamentals of digital transmission 2. Compare different techniques for error Detection and Correction 3. Identify and describe elements of DCS 4. Analyze and Compare different waveform coding techniques 5. Describe Nyquest Criterion and correlative coding 6. Analyzing zero forcing and LMA algorithm

UNIT-1 Digital Transmission Fundamentals: Digital Representation of Information: Block-Oriented Information, Stream Information; Why Digital Communications? Comparison of Analog and Digital Transmission , Basic properties of Digital Transmission Systems; Digital Representation of Analog Signals: Bandwidth of Analog Signals, Sampling of an Analog Signal, Digital Transmission of Analog Signals; Characterization of Communication Channels: Frequency Domain Characterization, Time Domain Characterization; Fundamental Limits in Digital Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding ; Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations, Telephone Modem Standards;

SLC: Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations,

UNIT-2 Properties of Media and Digital Transmission Systems: Twisted Pair, Coaxial Cable, Optical Fiber, Radio Transmission, Infrared Light; Error Detection and Correction: Error Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial Codes, Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code.

SLC: Error Detecting Capability of a Polynomial Code

43

UNIT-3 Brief Review of digital communication systems: Elements of Digital communication systems; Communication channels and their characteristics;

SLC: Historical perspective in the development of digital communication

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

SLC: coding speech at low bit rates, Applications

UNIT-5 Base band Shaping for data transmission: Discrete PAM signals, Inter-symbol interference (ISI) Nyquist criterion for distortion-less Base band binary transmission.

SLC: correlative coding.

UNIT-6 Eye-pattern, transmission, correlative coding, Eye-patterns Based and M-ary PAM system, Adoptive Equalization,

SLC: The zero forcing algorithm, The LMA algorithm

TEXT BOOKS:

1. Alberto Leon – Garcia and Indra Widjaja: Communication Networks - Fundamental Concepts and Key architectures, 2nd Edition, Tata McGrawHill, 2006.

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

REFERENCE BOOKS:

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

44

Subject Code: MCN0505 Subject Title: CLIENT-SERVER PROGRAMMING

Designation: CORE

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

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

1. Analyze the requirements of the client and server environment. 2. Explain socket level programming and with designing and programming client server

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

3. Demonstrate knowledge and understanding of current client/server system. technologies for application across intranet/internet.

4. Develop and evaluate client server solutions. 5. Algorithms and issues in server software design. 6. Design example server systems.

UNIT-1 The Client Server Model and Software Design, Concurrent Processing in Client-Server software: Introduction, Motivation, Terminology and Concepts, Introduction, Concurrency in Networks, Concurrency in Servers, Terminology and Concepts, An example of Concurrent Process Creation, Executing New Code, Context Switching and Protocol Software Design, SLC:Concurrency and Asynchronous I/O. 8hours

UNIT-2 Program Interface to Protocols, The Socket Interface: Introduction, Loosely Specified Protocol Software Interface, Interface Functionality, Conceptual Interface Specification, System Calls, Two Basic Approaches to Network Communication, The Basic I/O Functions available in UNIX, Using UNIX I/O with TCP/IP, Introduction, Berkley Sockets, Specifying a Protocol Interface, The Socket Abstraction, Specifying an End Point Address, A Generic Address Structure, Major System Calls used with Sockets, Utility Routines for Integer Conversion, Using Socket Calls in a Program, SLC:Symbolic Constants for Socket Call Parameters.

9hours

45

UNIT-3 Algorithms and Issues in Client Software Design: Introduction, Learning Algorithms instead of Details, Client Architecture, Identifying the Location of a Server, Parsing an Address Argument, Looking up a Domain Name, Looking up a well-known Port by Name, Port Numbers and Network Byte Order, Looking up a Protocol by Name, The TCP Client Algorithm, Allocating a Socket, Choosing a Local Protocol Port Number, A fundamental Problem in choosing a Local IP Address, Connecting a TCP Socket to a Server, Communicating with the Server using TCP, Reading a response from a TCP Connection, Closing a TCP Connection, Programming a UDP Client, Connected and Unconnected UDP Socket, Using Connect with UDP, Communicating with a Server using UDP, Closing a Socket that uses UDP, SLC:Partial Close for UDP, A Warning about UDP Unreliability. 9hours

Part-B

UNIT-4 Example Client Software: Introduction, The Importance of Small Examples, Hiding Details, An Example Procedure Library for Client Programs, Implementation of Connect TCP, Implementation of Connect UDP, A Procedure that Forms Connections, Using the Example Library, The DAYTIME Service, Implementation of a TCP Client for DAYTIME, Reading from a TCP Connection, The Time Service, Accessing the TIME Service, Accurate Times and Network Delays, A UDP Client for the TIME Service, The ECHO Service, A TCP Client for the ECHO Service, SLC:A UDP Client for the ECHO Service.

9hours

UNIT-5 Algorithms and Issues in Server Software Design: Introduction, The Conceptual Server Algorithm, Concurrent Vs Iterative Servers, Connection-Oriented Vs Connectionless Access, Connection-Oriented Servers, Connectionless Servers, Failure, Reliability and Statelessness, Optimizing Stateless Servers, Four Basic Types of Servers, Request Processing Time, Iterative Server Algorithms, An Iterative Connection-Oriented Server Algorithm, Binding to a Well Known Address using INADDR_ANY, Placing the Socket in Passive Mode, Accepting Connections and using them. An Iterative Connectionless Server Algorithm, Forming a Reply Address in a Connectionless Server, Concurrent Server Algorithms, Master and Slave Processes, A Concurrent Connectionless Server Algorithm,

A concurrent Connection-Oriented Server Algorithm, Using separate Programs as Slaves, Apparent Concurrency using a Single Process, When to use each Server Types, The Important Problem of Server Deadlock, SLC: Alternative Implementations. 9hours

UNIT-1 Iterative, Connectionless Servers (UDP), Iterative, Connection-Oriented Servers (TCP), Concurrent, Connection-Oriented Servers (TCP): Introduction, Creating a Passive Socket, Process Structure, An example TIME Server, Introduction, Allocating a Passive TCP Socket, A Server for the DAYTIME Service, Process Structure, An Example DAYTIME Server, Closing Connections, Connection Termination and Server Vulnerability, Introduction,

46

Concurrent ECHO, Iterative Vs Concurrent Implementations, Process Structure, An example Concurrent ECHO Server, SLC:Cleaning up Errant Processes 8hours

Laboratory Work:

1. Design, develop, and execute a program in C under UNIX / LINUX environment to implement a simple iterative connectionless server and demonstrate its functioning.

2. Design, develop, and execute a program in C under UNIX / LINUX environment to implement a simple iterative connection-oriented server and demonstrate its functioning.

3. Design, develop, and execute a program in C under UNIX / LINUX environment to implement a simple concurrent connection-oriented server and demonstrate its functioning.

4. Design, develop, and execute a program in C under UNIX / LINUX environment to implement a simple Day / Time Server and demonstrate its functioning.

5. Repeat the above problems using JAVA networking facilities.

TEXT BOOK:

1. Douglas E.Comer, David L. Stevens: Internetworking with TCP/IP – Vol. 3, Client-Server Programming and Applications, BSD Socket Version with ANSI C, 2nd Edition, Pearson, 2001.

47

Subject Code: MCN0509 Subject Title: SYSTEM MODELING AND SIMULATION


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

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

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

2. Analyze various probability distribution functions.

3. Generate and test random number sequences.

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

5. Verify, validate and calibrate simulation models.

6. Analyze system responsiveness, scalability etc. as a function of workload.

UNIT-1 Introduction, General Principles: When simulation is the appropriate tool and when it is not appropriate; Advantages and disadvantages of Simulation; Areas of application; Some recent applications of Simulation; Systems and system environment; Components of a system; Discrete and continuous systems; Model of a system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study, Concepts in Discrete-Event Simulation,

SLC:List processing. 9hours

UNIT-2 Statistical Models in Simulation, Queuing Models Review of terminology and concepts; Useful statistical models; discrete distributions; Continuous distributions; Poisson process; Empirical distributions, Characteristics of queuing systems; Queuing notation; Long-run measures of performance of queuing systems; Steady-state behavior of M/G/1 queue; SLC: Networks of queues, 8hours

UNIT-3 Random-Number Generation, Random-Variate Generation: Properties of random numbers; Generation of pseudo-random numbers; Techniques for generating random numbers; Tests for Random Numbers Random-Variate Generation: Inverse transform technique;

48

Acceptance-Rejection technique; SLC:Special properties. 9hours

UNIT-4 Input Modeling: Data Collection; Identifying the distribution with data; Parameter estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate SLC:Time-Series input models. 9hours

UNIT-5 Verification, Calibration, and Validation of Simulation Models: Model building, verification, and validation; Verification of simulation models; Calibration and validation of models. SLC:Optimization via Simulation 9hours

UNIT-6 Estimation of Absolute Performance, Case Study: Types of simulations with respect to output analysis; Stochastic nature of output data; Absolute measures of performance and their estimation; Output analysis for terminating simulations; Output analysis for steady-state simulations, SLC:Simulation of networked computer systems. 8hours

TEXT BOOKS:

1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System Simulation, 5th Edition, Pearson Education, 2010.

REFERENCE BOOKS:

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

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

Subject Code: MCN0511 49

Subject Title: INFORMATION SECURITY Designation: ELECTIVE Pre-requisite: COMPUTER NETWORKS Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0

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

1. Identify common network security vulnerabilities/attacks 2. Explain and analyze the basic Cryptographic algorithms for security 3. Critically evaluate the risks and threats to networked computers how provide security

using public key cryptography. 4. Demonstrate detailed knowledge of the role of encryption in email sort of

communication. 5. Analyze security issues of IP security. 6. Identify the appropriate procedures required for secure electronic transactions.

UNIT-1 Introduction to Information Security: Introduction; what is security? Critical characteristics of information; NSTISSC security model; Approaches to information security implementation; The Security System Development Life Cycle; Information Security Terminology. Planning for Security: Introduction; Information Security Policy, Standards, and Practices;

SLC:The Information Security Blue Print. 9hours

UNIT-2 Security Technology: Firewalls and VPNs: Introduction, Physical design, Firewalls, Protecting Remote Connections. Intrusion Detection, Access control and Other Security Tools: Introduction; Intrusion Detection Systems (IDS); Honey Pots, Honey Nets, and Padded cell systems; Scanning and Analysis Tools;

SLC:Access Control Devices. 9hours

UNIT-3 Information Security maintenance: Introduction; Security Management Models; The Maintenance Model. Introduction to Network Security: Attacks, Services, and Mechanisms; Security Attacks; Security Services; A model for Internetwork Security; Internet Standards and RFCs;

SLC:Wireless network security. 8hours

UNIT-4 Cryptography: Conventional Encryption Principles and Algorithms; Cipher Block Modes of Operation; Location of encryption devices; Key distribution; Approaches to message

50

authentication; Secure Hash functions and HMAC; Public Key Cryptography Principles and Algorithms; Digital Signatures; Key management. Authentication Applications: Kerberos, X.509 SLC:Directory Authentication Service. 9hours

UNIT-5 Electronic Mail Security: Pretty Good Privacy (PGP), S/MIME.IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload, Combining Security Associations SLC:Key Management. 9hours

UNIT-6 Web Security: Web security requirements, Secure Socket layer (SSL) and Transport layer Security (TLS), Secure Electronic Transaction (SET). Software: Introduction; Software flaws; Malware; Software-based attacks; SLC:Digital Rights Management; 8hours

TEXT BOOKS:

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

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

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

REFERENCE BOOKS:

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

51

Subject Code: MCN0512 Subject Title: DISTRIBUTED SYSTEMS Designation: ELECTIVE Pre-requisite: OPERATING SYSTEM Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0

Course outcomes

On successful completion of the course, students will be able to: 1. Perceptive of the principles and concepts involved in designing distributed systems 2. Explain the general properties of networked communication necessary for distributed

systems on the Internet 3. Describe basic algorithms for failure detection, leader elections, broadcast and multicast,

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

4. Create common paradigms for easing the task of distributed systems programming, such as RPC

5. Identify the security challenges faced by distributed systems. Be able to select appropriate security solutions to meet the needs of commonly encountered distributed programming scenarios.

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

scheduling.

UNIT-1 Characterization of Distributed Systems and System Models: Introduction, Examples of distributed systems, Resource sharing and the Web, Challenges, Architectural models, SLC:Fundamental models. 9hours

UNIT-2 Networking and Internetworking: Types of Networks, Networks principles

SLC: Internet protocols 9hours

UNIT-3 Interprocess Communication: Introduction, The API for the Internet protocols, External data representation and marshalling, Client -Server communication, Group communication,

SLC:Case study: Interprocess communication in UNIX 8hours

52

UNIT-4 Distributed Objects and Remote Invocation: Communication between distributed objects, Remote procedure call, events SLC:notifications 9hours

UNIT-5 Operating System Support and Security: The Operating system layer, protection, processes and threads, communication and invocation SLC:operating system architecture 9hours

UNIT-6 Transactions and Concurrency Control: Transactions, nested transactions, locks, optimistic concurrency control, timestamp ordering, comparison of methods for concurrency control. Distributed Shared Memory: Design and Implementation issues, sequential consistency SLC:Ivy.

8hours

TEXT BOOKS:

1. George Coulouris, Jean Dollimore, Tim Kindberg: Distributed Systems, Concept and Design, 3rd Edition, Pearson Education, 2005.

REFERENCE BOOKS:

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

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

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

53

COMPUTER SYSTEMS PERFORMANCE ANALYSIS


Credits: 05 Contact Hours: 04 Type of Delivery: 4-2-0-0 COURSE Outcomes

1. Describe the mathematical foundations needed for performance evaluation of computer systems

2. Explain the metrics used for performance evaluation 3. Describe the analytical modeling of computer systems 4. Enable the students to develop new queueing analysis for both simple and complex

systems 5. Analyze the concept of planning and design in computer system. 6. Explain the experimental analysis

UNIT-1 Introduction: The art of Performance Evaluation; Common Mistakes in Performance Evaluation, A Systematic Approach to Performance Evaluation, Selecting an Evaluation Technique, Selecting Performance Metrics, Commonly used Performance Metrics, Utility Classification of Performance Metrics, SLC:Setting Performance Requirements. 9 Hours UNIT-2 Workloads, Workload Selection and Characterization: Types of Work loads, addition instructions, Instruction mixes, Kernels; Synthetic programs, Application benchmarks, Popular benchmarks. Work load Selection: Services exercised, level of detail; Representativeness; Timeliness, Other considerations in workload selection. Work load characterization Techniques: Terminology; Averaging, Specifying dispersion, Single Parameter Histograms, Multi Parameter Histograms, Principle Component Analysis, SLC:Markov Models, Clustering. 9 Hours UNIT-3 Monitors, Program Execution Monitors and Accounting Logs: Monitors: Terminology and classification; Software and hardware monitors, Software versus hardware monitors, Firmware and hybrid monitors, Distributed System Monitors, Program Execution Monitors and Accounting Logs, Program Execution Monitors, Techniques for Improving Program Performance, Accounting Logs, Analysis and Interpretation of Accounting log data, SLC:Using accounting logs to answer commonly asked questions. 9Hours UNIT-4 Capacity Planning and Benchmarking: Steps in capacity planning and management; Problems in Capacity Planning; Common Mistakes in Benchmarking; Benchmarking Games; Load Drivers; Remote- Terminal Emulation; Components of an RTE; SLC:Limitations of RTEs. 9 Hours UNIT-5 Experimental Design and and Analysis: Introduction: Terminology, Common mistakes in experiments, Types of experimental designs, 2k Factorial Designs, Concepts, Computation of effects, Sign table method for computing effects; Allocation of variance; General 2k Factorial Designs, General full factorial designs with k factors: Model, Analysis of a

54

General Design, SLC:Informal Methods. 9Hours UNIT -6 Queuing Models: Introduction: Queuing Notation; Rules for all Queues; Little’s Law, Types of Stochastic Process. Analysis of Single Queue: Birth-Death Processes; M/M/1 Queue; M/M/m Queue; M/M/m/B Queue with finite buffers; Results for other M/M/1 Queuing Systems. Queuing Networks: Open and Closed Queuing Networks; Product form networks, queuing Network models of Computer Systems. Operational Laws: Utilization Law; Forced Flow Law; Little’s Law; General Response Time Law; Interactive Response Time Law; Bottleneck Analysis; Mean Value Analysis and Related Techniques; Analysis of Open Queuing Networks; Mean Value Analysis; Approximate MVA; Balanced Job Bounds; Convolution Algorithm, Distribution of Jobs in a System, Convolution Algorithm for Computing G(N), Computing Performance using G(N), Timesharing Systems, Hierarchical Decomposition of Large Queuing Networks: Load Dependent Service Centers, Hierarchical DecompositionSLC: Limitations of Queuing Theory. 7 Hours Text Book: 1. Raj Jain: The Art of Computer Systems Performance Analysis, John Wiley and Sons, 2013. Reference Books: 1. Paul J Fortier, Howard E Michel: computer Systems Performance Evaluation and prediction, Elsevier, 2003. 2. Trivedi K S: Probability and Statistics with Reliability, Queuing and Computer Science Applications, 2nd Edition, Wiley India, 2001.

55

Subject Code: MCN0514 Subject Title: WEB ENGINEERING Designation: ELECTIVE Pre-requisite: Object oriented programming Credits: 05 Contact Hours: 06 Type of Delivery: 4-0-2-0

Course outcomes:

1. Analysis modeling and design modeling for web applications.

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

3. Develop user-interfaces for web applications.

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

applications and web services.

5. Explain the web security

6. Describe web applications

UNIT-1 Introduction: Motivation, Categories of web applications, Characteristics of web applications. Requirements Engineering: Introduction, Fundamentals, RE specifics in web engineering, Principles of RE for web applications, Adapting RE methods to web application development SLC: Outlook. 9hours

UNIT-2 Modeling Web Application: Introduction, Fundamentals, Modeling specifics in web engineering, Modeling requirements, Content modeling, Hypertext modeling, Presentation modeling, Customization modeling, Methods and tools, Outlook. Web Application Architectures: Introduction, Fundamentals, Specifics of web application architectures, Components of generic web application architecture, Layered architectures SLC: Data-aspect architectures. 9hours

UNIT-3 Technology-Aware Web Application Design: Introduction, Web design from an evolutionary perspective, Presentation design, Interaction design, Functional design, Outlook. Technologies for Web Applications: Introduction, Fundamentals, Client/Server communication on the web, Client side technologies, Document-specific technologies, Server-side technologies, Outlook. Testing Web Applications: Introduction, Fundamentals, Testing specifics in web engineering, Test approaches, Test scheme, Test methods and techniques,

SLC: Test automation, Outlook. 8hours

56

UNIT-4 Operation and Maintenance of Web Applications: Introduction, Challenges following the launch of a web application, Content management, Usage analysis, Outlook. Web Project Management: From software project management to web project management, Challenges in web project management, Managing web teams, Managing the development process of a web application, Outlook. The Web Application Development Process: Motivation, Fundamentals, Requirements for a web application development process, Analysis of the rational unified process, SLC:Analysis of extreme programming, Outlook. 9hours

UNIT-5 Usability of Web Applications: Motivation, What is usability? What characterizes the usability of web applications? Design guidelines, Web usability engineering methods, Web usability engineering trends, Outlook Performance of Web Applications: Introduction, What is performance? What characterizes performance of web applications, System definition and indicators, Characterizing the work load, Analytical techniques, Representing and interpreting results, SLC:Performance optimization methods, Outlook. 9hours

UNIT-6 Security for web Applications: Introduction, Aspects of security, Encryption, digital signatures, and certificates, Secure Client/Server interaction, Client security issues, Service provider security issues, Outlook. The Semantic Web: Fundamentals of the semantic web, Technological concepts, SLC:Specifics of semantic web applications, Tools, Outlook.

8hours

Text Book:

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

Reference Books:

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

57


Subject Title: ADVANCES IN STORAGE AREA NETWORKS


Pre-requisite: Data Communication Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0 Course Outcome

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

1. Differentiate the server centric and storage centric networks , and its advantages and disadvantages, understand the importance of SAN

2. Identify the different types of Disks , other storages and their operations useful in SAN 3. Understand the various I/O techniques used in SAN , and differentiate between NAS and

SAN 4. Explain the local , network file systems and shared disk file systems of NAS 5. Explain the concepts of storage virtualization , and identify the various levels of storages

for virtualization 6. Design a network for storage using various SAN devices

UNIT-1 Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT Architecture and its advantages. Case study: Replacing a server with Storage Networks The Data Storage and Data Access problem; SLC:The Battle for size and access. 9hours

UNIT-2 Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O Channels; JBOD, Storage virtualization using RAID and different RAID levels; Caching: Acceleration of Hard Disk Access; Intelligent disk subsystems,

SLC:Availability of disk subsystems. 9hours

UNIT-3 I/O Techniques, Network Attached Storage, File System and NAS: The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack; Fibre Channel SAN; IP Storage, The NAS Architecture, The NAS hardware Architecture, The NAS Sotfware Architecture, Network connectivity, NAS as a storage system, Local File Systems; Network file Systems and file servers; Shared Disk file systems; SLC:Comparison of fibre Channel and NAS.

8hours

58

UNIT-4 Storage Virtualization: Definition of Storage virtualization; Implementation Considerations; Storage virtualization on Block or file level; Storage virtualization on various levels of the storage Network;

SLC:Symmetric and Asymmetric storage virtualization in the Network. 9hours

UNIT-5 SAN Architecture and Hardware devices: Overview, Creating a Network for storage; SAN Hardware devices; The fibre channel switch; Host Bus Adaptors; Putting the storage in SAN; SLC:Fabric operation from a Hardware perspective. 9hours

UNIT-6 Software Components of SAN, Management: The switch’s Operating system; Device Drivers; Supporting the switch’s components; Configuration options for SANs, Planning Business Continuity; Managing availability; Managing Serviceability; Capacity planning; SLC:Security considerations. 8hours

Text Book:

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

Reference Books:

1. Marc Farley: Storage Networking Fundamentals – An Introduction to Storage Devices, Subsystems, Applications, Management, and File Systems, Cisco Press, 2005.

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

3. Richard Barker and Paul Massiglia: “Storage Area Network Essentials A Complete Guide to understanding and Implementing SANs”, Wiley India, 2006

59


Subject Title: WIRELESS SENSOR NETWORKS


Pre-requisite: Wireless Communication and Networks Credits: 05 Contact Hours: 06 Type of Delivery: 4-2-0-0 Course Outcomes

1. Explain architect sensor networks for various application setups. 2. Explore the design space and conduct trade-off analysis between performance and

resources. 3. Devise appropriate data dissemination protocols and model links cost. 4. Determine suitable medium access protocols and radio hardware. 5. Explain prototype sensor networks using commercial components. 6. Describe quality of service, fault-tolerance, security and other dependability requirements

while coping with resource constraints.

UNIT-1 Introduction, Overview and Applications of Wireless Sensor Networks

Introduction, Basic overview of the Technology, Applications of Wireless Sensor Networks: Introduction, Background, Range of Applications, Examples of Category 2 WSN Applications, Examples of Category 1 WSN Applications, SLC:Another Taxonomy of WSN Technology

(Chapter 1: 1.1, 1.2, Chapter2: 2.1-2.6) 10 Hours

UNIT-2 Basic Wireless Sensor Technology and Systems:Introduction, Sensor Node Technology, Sensor Taxonomy, WN Operating Environment, WN Trends, Wireless Transmission Technology and Systems: Introduction, Radio Technology Primer, SLC:Available Wireless Technologies

(Chapter3: 3.1-3.5, Chapter 4: 4.1-4.3) 7 Hours

UNIT-3 MAC and Routing Protocols for Wireless Sensor Networks:Introduction, Background, Fundamentals of MAC Protocols, MAC Protocols for WSNs, Sensor-MAC case Study, IEEE 802.15.4 SLC:LR-WPANs Standard Case Study. 7 Hours

UNIT-4 Routing Protocols for Wireless Sensor Networks: Introduction, Background, Data Dissemination and Gathering, Routing Challenges and Design Issues in WSNs, SLC:Routing Strategies in WSNs. 60

(Chapter 5: 5.1-5.6, Chapter 6: 6.1-6.5)

9 Hours

UNIT-5 Transport Control and Middleware for Wireless Sensor Networks

Traditional Transport Control Protocols, Transport Protocol Design Issues, Examples of Existing Transport Control Protocols, Performance of Transport Control Protocols. Middleware for Wireless Sensor Networks: Introduction, WSN Middleware Principles, Middleware Architecture, SLC:Existing Middleware.

(Chapter 7: 7.1-7.4, Chapter 8: 8.1-8.4)

9 Hours UNIT-6 Network Management and Operating System for Wireless Sensor Networks

Introduction, Network Management Requirements, Traditional Network Management Models, Network Management Design Issues. Operating Systems for Wireless Sensor Networks: Introduction, Operating System Design Issues, SLC:Examples of Operating Systems.

(Chapter 9: 9.1-9.5, Chapter 10: 10.1-10.3)

10 Hours TEXT BOOKS:

1. KAZEM SOHRABY, DANIEL MINOLI, TAIEB ZNATI, “Wireless Sensor Networks: Technology, Protocols and Applications:, WILEY , Second Edition (Indian) , 2014

REFERENCE BOOKS:

1.Ian F. Akyildiz, Mehmet Can Vuran "Wireless Sensor Networks", Wiley 2010

2. Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks- An Information Processing Approach", Elsevier, 2007.

61

CYBER SECURITY (4:2:0:0) Sub code : MCN0525 CIE : 50% Marks

Hrs/week : 04 SEE : 50% Marks

SEE : 03Hrs Max Marks : 100

Course outcomes

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

1. Explain the classification of cybercrimes 2. Identify the steps of attacks 3. Discuss challenges posed by mobile devices 4. Recognize the attack on mobile networks 5. Discuss Phishing in cybercrime 6. Explain the different security challenges to Indian law

UNIT – 1 9 Hrs Introduction to Objectives

Introduction to cybercrime, Cybercrime and information security, who are Cybercriminals,

Classification of Cybercrimes, Cybercrime: The Legal Perspectives, An Indian Perspective,

Cybercrime and the Indian ITA 2000,A global perspective on cybercrimes SLC: Cybercrime era:

Survival mantra for the citizens.

UNIT-2 8 Hrs

Cyber offenses

Introduction, How criminal plan the attacks, Social engineering, Cyber stalking, Cybercafe and

cybercrimes, Botnets: The fuel for cybercrime, Attack vector SLC: Cloud Computing.

UNIT-3 9 Hrs

Cybercrime: Mobile and Wireless devices

Introduction, Proliferation of mobile and wireless devices, Trends in mobility, Security

challenges posed by mobile devices, Registry setting for mobile devices, Authentication service

security, Attacks on mobile/ cell phones, Mobile devices: security implications for organizations,

Organization measures for handling mobile, SLC: Organizational security policies and measures

in mobile computing era, Laptops.

62

UNIT-4 9 Hrs

Tools and method used in Cybercrime:

Introduction, Proxy servers and anonymizers, Phishing, Password cracking, Key loggers and

spywares, Virus and worms, Trojan horses and backdoors, Steganography, DoS and DDoS

attacks, SQL injection, Buffer overflow SLC: Attacks on wireless networks.

UNIT-5 8 Hrs

Phishing and identity theft:

Introduction, Phishing SLC: Identity theft (id theft).

UNIT-6 9 Hrs

Cybercrimes and Cyber Security: The legal perspectives

Introduction, Cybercrime and the legal landscape around the world, why do we need cyber laws:

the Indian context, The Indian IT act, Challenges to Indian law and cybercrime scenario in India,

SLC: Consequences of not addressing the weakness in information technology act.

TEXT BOOK:

1. Cyber Security by Nina Godbole,Sunit Belapure, Wiley India, 1st edition copyright 2011

reprint 2013.

REFERENCES:

1. Computer Forensics and Cyber Crime An Introduction by Marjie T. Britz ,Pearson

publication, 2nd edition.

63