SEMANTIC WEB AND SOCIAL NETWORKS

[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI11 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
 Explain the fundamentals of Semantic Web technologies.
 Implementation of semantic web applications and the architectures of social networking
 Social network performance analysis
Module 1 Teaching
Hours
Web Intelligence Thinking and Intelligent Web Applications, The Information Age ,The 10 Hours
World Wide Web, Limitations of Today’s Web, The Next Generation Web, Machine
Intelligence, Artificial Intelligence, Ontology, Inference engines, Software Agents,
Berners-Lee www, Semantic Road Map, Logic on the semantic Web.
Module 2
Knowledge Representation for the Semantic Web Ontologies and their role in the 10 Hours
semantic web, Ontologies Languages for the Semantic Web – Resource Description
Framework(RDF) / RDF Schema, Ontology Web Language(OWL), UML, XML/XML
Schema.
Module 3
Ontology Engineering, Ontology Engineering, Constructing Ontology, Ontology 10 Hours
Development Tools, Ontology Methods, Ontology Sharing and Merging, Ontology
Libraries and Ontology Mapping, Logic, Rule and Inference Engines.
Module 4
Semantic Web Applications, Services and Technology Semantic Web applications and 10 Hours
services, Semantic Search, e-learning, Semantic Bioinformatics, Knowledge Base, XML
Based Web Services, Creating an OWL-S Ontology for Web Services, Semantic Search
Technology, Web Search Agents and Semantic Methods.
Module 5
Social Network Analysis and semantic web What is social Networks analysis, 10 Hours
development of the social networks analysis, Electronic Sources for Network Analysis –
Electronic Discussion networks, Blogs and Online Communities, Web Based Networks.
Building Semantic Web Applications with social network features.
Course Outcomes
The students should be able to:
 Demonstrate the semantic web technologies like RDF Ontology and others
 Learn the various semantic web applications
 Identify the architectures and challenges in building social networks
 Analyze the performance of social networks using electronic sources
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Thinking on the Web - Berners Lee, Godel and Turing, Wiley inter science, 2008.
1. Social Networks and the Semantic Web, Peter Mika, Springer, 2007.
2.
Reference Books:
1. Semantic Web Technologies, Trends and Research in Ontology Based Systems.
2. Semantic Web and Semantic Web Services -Liyang Lu Chapman and Hall/CRC Publishers,
(Taylor & Francis Group).
3. Programming the Semantic Web, T.Segaran, C.Evans, J.Taylor, O’Reilly.

INFORMATION AND NETWORK SECURITY

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI12/16SCN13/16SCS253 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
 Explain standard algorithms used to provide confidentiality, integrity and authenticity.
 Distinguish key distribution and management schemes.
 Deploy encryption techniques to secure data in transit across data networks
 Implement security applications in the field of Information technology
Module 1 Teaching
Hours
Classical Encryption Techniques Symmetric Cipher Model, Cryptography, 10 Hours
Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar Cipher, Mono-
alphabetic Cipher, Playfair Cipher, Hill Cipher, Poly alphabetic 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, the feistel
Cipher, 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, key schedule algorithm
Module 2
Public-Key Cryptography and RSA: Principles of public-key cryptosystems. Public- 10 Hours
key cryptosystems. Applications for public-key cryptosystems, requirements for public-
key cryptosystems. Public-key cryptanalysis. The RSA algorithm, description 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,
Pseudorandom number generation based on an asymmetric cipher, PRNG based on RSA.
Module 3
Key Management and Distribution: Symmetric key distribution using Symmetric 10 Hours
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, federated identity management, identity management, identity federation,
personal identity verification.
Module 4
Wireless network security: Wireless security, Wireless network threats, Wireless 10 Hours
network measures, mobile device security, security threats, mobile device security
strategy, IEEE 802.11 Wireless LAN overview, the Wi-Fi alliance, IEEE 802 protocol
architecture. 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, and
shake 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, and Padding. HTTPS Connection Initiation, Connection Closure. Secure
Shell(SSH) Transport Layer Protocol, User Authentication Protocol, Connection Protocol
Module 5
Electronic Mail Security: Pretty good privacy, notation, operational; description, 10 Hours
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 architecture, 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, cryptographic suits.
Course Outcomes
The students should be able to:
 Analyze the vulnerabilities in any computing system and hence be able to design a security
solution.
 Identify the security issues in the network and resolve it.
 Evaluate security mechanisms using rigorous approaches, including theoretical.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. William Stallings, Cryptography and Network Security, Pearson 6th edition.
Reference Books:
1. V K Pachghare: Cryptography and Information Security.
 NETWORK PROGRAMMING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI13 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
 Define Network Programming.
 Demonstrate programming with TCP and SCTP.
 Explain key management and routing sockets.
 Evaluate advanced Socket Programming APIs.
Module 1 Teaching
Hours
Introduction to network application, client/server communication, OSI Model, BSD 10 Hours
Networking history, Test Networks and Hosts, Unix Standards, 64-bit architectures,
Transport Layer: TCP, UDP and SCTP.
Module 2
Sockets Introduction – socket address structures, value-result arguments, byte ordering 10 Hours
and manipulation functions, address conversion functions, Elementary TCP Sockets –
socket, connect, bind, listen, accept , fork and concurrent server design, getcsockname
and getpeername functions and TCP Client/Server Example- client/server programming
through TCP sockets, Normal startup, termination, POSIX signal handling, Signal
handling in server, Crashing, rebooting of server host, shutdown
Module 3
I/O Multiplexing and Socket Options, Elementary SCTP Sockets- Interface Models, 10 Hours
sctp_xx functions, shutdown function, Notifications, SCTP Client/Server Examples –
One-to-Many, Head–of-Line Blocking, Controlling number of streams and Termination,
IPv4 and IPv6 Interoperability–different interoperability scenarios.
Module 4
Daemon Processes, syslogd, daemonizing functions and the inetd super server, 10 Hours
Advanced I/O functions- readv, writev, sendmsg and recvmsg, Ancillary data, Advanced
polling, Unix domain protocols- socket address structure, functions and communication
scenarios, Nonblocking I/O – connect and accept examples.
Module 5
ioctl operations- socket, file, interface configuration information, ARP cache and routing 10 Hours
table operations, Routing sockets- data link socket address structure, reading and
writing, sysctl operations, interface name and index functions, Key Management
functions – reading, writing, SADB, SA, Dynamically Maintaining SA’s, Out-of-Band
data, Threads- basic thread functions, TCP echo server using threads, Mutexes and
Conditional variables.
Course Outcomes
The students should be able to:
 Develop applications that communicate with each other using TCP and SCTP.
 Identify the IPv4 and IPv6 compatibility.
 Evaluate socket programming APIs.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
 answer 5 full questions, selecting one full question from each module.

Text Books:
1. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff: “UNIX Network Programming”. Volume 1,
Third Edition, Pearson 2004.
Reference Books:
1. Barry Nance: “Network Programming in C”, PHI 2002 3.Bob Quinn, Dave Shute: “Windows
Socket Network Programming”, Pearson 2003.
2. Richard Stevens: “UNIX Network Programming”. Volume 2, Second Edition.

PROBABILITY STATISTICS AND QUEUING THEORY

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI14 /
16SCN14/16SCS14/
16SSE14 / 16SIT14 IA Marks 20
/16SCE14 /
16SFC14
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
 Develop analytical capability and to impart knowledge of Probability, Statistics and Queuing.
 Apply above concepts in Engineering and Technology.
 Acquire knowledge of Hypothesis testing and Queuing methods and their applications so as to
enable them to apply them for solving real world problems
Module 1 Teaching
Hours
Axioms of probability, Conditional probability, Total probability, Baye’s theorem, 10 Hours
Discrete Random variable, Probability mass function, Continuous Random variable.
Probability density function, Cumulative Distribution Function, and its properties,
Two-dimensional Random variables, Joint pdf / cdf and their properties
Module 2
Probability Distributions / Discrete distributions: Binomial, Poisson Geometric and 10 Hours
Hyper-geometric distributions and their properties. Continuous distributions: Uniform,
Normal, exponential distributions and their properties.
Module 3
Random Processes: Classification, Methods of description, Special classes, Average 10 Hours
values of Random Processes, Analytical representation of Random Process,
Autocorrelation Function, Cross-correlation function and their properties, Ergodicity,
Poisson process, Markov Process, Markov chain.
Module 4
Testing Hypothesis: Testing of Hypothesis: Formulation of Null hypothesis, critical 10 Hours
region, level of significance, errors in testing, Tests of significance for Large and Small
Samples, t-distribution, its properties and uses, F-distribution, its properties and uses,
Chi-square distribution, its properties and uses, χ2 – test for goodness of fit, χ2 test for
Independence
Module 5
Symbolic Representation of a Queuing Model, Poisson Queue system, Little Law, Types 10 Hours
 of Stochastic Processes, Birth-Death Process, The M/M/1 Queuing System, The M/M/s
Queuing System, The M/M/s Queuing with Finite buffers.
Course Outcomes
The students should be able to:
 Demonstrate use of probability and characterize probability models using probability mass
(density) functions & cumulative distribution functions.
 Explain the techniques of developing discrete & continuous probability distributions and
its applications.
 Describe a random process in terms of its mean and correlation functions.
 Outline methods of Hypothesis testing for goodness of fit.
 Define the terminology &nomenclature appropriate queuing theory and also distinguish
various queuing models.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Probability, Statistics and Queuing Theory, V. Sundarapandian, Eastern Economy Edition,
PHI Learning Pvt. Ltd, 2009.
Reference Books:
1. Probability & Statistics with Reliability, Queuing and Computer Applications, 2nd Edition
by Kishor. S. Trivedi , Prentice Hall of India ,2004.
2. Probability, Statistics and Random Processes, 1st Edition by P Kausalya, Pearson
Education, 2013.

CLOUD COMPUTING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16SCS12/16SCE12
16SIT22/16SSE254 IA Marks 20
16SCN22/16LNI151
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
 Define and Cloud, models and Services.
 Compare and contrast programming for cloud and their applications
 Explain virtuaization, Task Scheduling algorithms.
 Apply ZooKeeper, Map-Reduce concept to applications.
Module 1 Teaching
Hours
Introduction, Cloud Infrastructure: Cloud computing, Cloud computing delivery 8 Hours
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 and problems.
 Module 2
Cloud Computing: Application Paradigms.: Challenges of cloud computing, 8 Hours
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 Gre The Web application, Cloud for science and
engineering, High-performance computing on a cloud, Cloud computing for Biology
research, Social computing, digital content and cloud computing.
Module 3
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual 8 Hours
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, The dark side of virtualization, Exercises
and problems
Module 4
Cloud Resource Management and Scheduling: Policies and mechanisms for resource 8 Hours
management, Application of control theory to task scheduling on a cloud, Stability of a
two-level resource allocation architecture, Feedback control based on dynamic
thresholds, Coordination of specialized autonomic performance managers, A utility-
based model for cloud-based Web services, Resourcing bundling: Combinatorial
auctions for cloud resources, Scheduling algorithms for computing clouds, Fair queuing,
Start-time fair queuing, Borrowed virtual time, Cloud scheduling subject to deadlines,
Scheduling MapReduce applications subject to deadlines, Resource management and
dynamic scaling, Exercises and problems.
Module 5
Cloud Security, Cloud Application Development: Cloud security risks, Security: The 8 Hours
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, How to use S3 in java, Cloud-
based simulation of a distributed trust algorithm, A trust management service, A cloud
service for adaptive data streaming, Cloud based optimal FPGA synthesis .Exercises and
problems.
Course Outcomes
The students should be able to:
 Compare the strengths and limitations of cloud computing
 Identify the architecture, infrastructure and delivery models of cloud computing
 Apply suitable virtualization concept.
 Choose the appropriate cloud player
 Address the core issues of cloud computing such as security, privacy and interoperability
 Design Cloud Services
 Set a private cloud
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013.
Reference Books:
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.

MULTIMEDIA COMMUNICATIONS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16SCN21/16LNI152 IA Marks 20
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
 Define the Multimedia Communication Models
 Explain Multimedia Transport in Wireless Networks
 Solve the Security issues in multimedia networks
 Illustrate real-time multimedia network applications.
 Explain different network layer based application.
Module 1 Teachin
g Hours
Introduction, multimedia information representation, multimedia networks, multimedia 8 Hours
applications, Application and networking terminology, network QoS and application
QoS, Digitization principles,. Text, images, audio and video.
Module 2
Text and image compression,, compression principles, text compression- Runlength, 8 Hours
Huffman, LZW, Document Image compression using T2 and T3 coding, image
compression- GIF, TIFF and JPEG
Module 3
Audio and video compression, audio compression – principles, DPCM, ADPCM, 8 Hours
Adaptive and Linear predictive coding, Code-Excited LPC, Perceptual coding, MPEG
and Dolby coders video compression, video compression principles.
Module 4
Video compression standards: H.261, H.263, MPEG, MPEG 1, MPEG 2, MPEG-4 and 8 Hours
Reversible VLCs, MPEG 7 standardization process of multimedia content description,
MPEG 21 multimedia framework.
Module 5
Notion of synchronization, presentation requirements, reference model for 8 Hours
synchronization, Introduction to SMIL, Multimedia operating systems, Resource
management, process management techniques.
Course Outcomes
The students should be able to:
 Deploy the right multimedia communication models.
 Apply QoS to multimedia network applications with efficient routing techniques.
 Solve the security threats in the multimedia networks.
 Develop the real-time multimedia network applications
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Fred Halsall, “Multimedia Communications”, Pearson education, 2001.
2. Raif Steinmetz, Klara Nahrstedt, “Multimedia: Computing, Communications and Applications”,
Pearson education, 2002.

Reference Books:
1. K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic, “Multimedia Communication
Systems”, Pearson education, 2004.
2. John Billamil, Louis Molina, “Multimedia : An Introduction”, PHI, 2002.

ETHERNET TECHNOLOGY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI153 IA Marks 20
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
 Define with the basics of Ethernet
 Explain concepts of different types of Ethernet
 Analyze building an Ethernet system
 Acquire knowledge of hubs and repeaters
Module 1 Teaching
Hours
Introduction: Introduction to Ethernet, The Evolution of Ethernet, The Ethernet 8 Hours
System, The Media Access Control Protocol The media Access Control Protocol Full
Duplex Ethernet Auto-Negotiation
Module 2
Ethernet Media Systems: Ethernet Media Fundamentals Twisted-Pair Media 8 Hours
System(10Base-T) Fiber Optic Media System(10Base-F) Fast Ethernet Twisted-Pair
Media System(100Base-TX)
Module 3
Fast Ethernet Fiber Optic Media System(100Base-FX) Gigabit Ethernet Twisted-Pair 8 Hours
Media System(1000Base-T) Gigabit Ethernet Fiber Optic Media System (1000Base-X)
Module 4
Multi-Segment Configuration Guidelines Building Your Ethernet System: s tructured 8 Hours
Cabling Twisted-Pair Cables and Connectors Fiber Optic Cables and Connectors
Module 5
Ethernet Repeater Hubs Ethernet Switching Hubs Performance and troubleshooting: 8 Hours
Ethernet Performance Troubleshooting.
Course Outcomes
The students should be able to:
 Classify different types of Ethernet systems
 Contrast Ethernet Media systems
 Evaluate a complete Ethernet system
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Charles E. Spurgeon: “Ethernet – The Definitive Guide”, O’Reilly 2004.
Reference Books:
1. Rich Seifert: “Gigabit Ethernet”, Addison-Wesley 1998.

NETWORK MANAGEMENT
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI154 / 16SCN23 IA Marks 20
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
 Evaluate need for interoperable network management.
 Explain the concepts and architecture behind standards based network management.
 Illustrate the concepts and terminology associated with SNMP and TMN
 Demonstrate network management as a typical distributed application
Module 1 Teaching
Hours
Introduction: Analogy of Telephone Network Management, Data and 8 Hours
Telecommunication Network Distributed computing Environments, TCP/IP-Based
Networks: The Internet and Intranets, Communications Protocols and Standards-
Communication Architectures, Protocol Layers and Services; Case Histories of
Networking and Management – The Importance of topology , Filtering Does Not
Reduce Load on Node, Some Common Network Problems; Challenges of Information
Technology Managers, Network Management: Goals, Organization, and Functions-
Goal of Network Management, Network Provisioning, Network Operations and the
NOC, Network Installation and Maintenance; Network and System Management,
Network Management System platform, Current Status and Future of Network
Management.
Module 2
Basic Foundations: Standards, Models, and Language: Network Management Standards, 8 Hours
Network Management Model, Organization Model, Information Model – Management
Information Trees, Managed Object Perspectives, Communication Model; ASN.1-
Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An
Example of ASN.1 from ISO 8824; Encoding Structure; Macros, Functional Model.
Module 3
SNMPv1 Network Management: Managed Network: The History of SNMP 8 Hours
Management, Internet Organizations and standards, Internet Documents, The SNMP
Model, The Organization Model, System Overview. The Information Model –
Introduction, The Structure of Management Information, Managed Objects,
Management Information Base. The SNMP Communication Model – The SNMP
Architecture, Administrative Model, SNMP Specifications, SNMP Operations, SNMP
MIB Group, Functional Model SNMP Management – RMON: Remote Monitoring,
RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and
Functions, Relationship Between Control and Data Tables, RMON1 Common and
Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The RMON2
Management Information Base, RMON2 Conformance Specifications.
Module 4
Broadband Network Management: Broadband Access Networks and Technologies: 8 Hours
Broadband Access Networks, Broadband Access Technology; HFCT Technology: The
Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC
Plant, The RF Spectrum for Cable Modem; Data Over Cable, Reference Architecture;
HFC Management – Cable Modem and CMTS Management, HFC Link Management,
RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line
Technology – Role of the ADSL Access Network in an Overall Network, ADSL
Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL
Management – ADSL Network Management Elements, ADSL Configuration
Management, ADSL Fault Management, ADSL Performance Management, SNMP -
Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, ADSL
Configuration Profiles
Module 5
Network Management Applications: Configuration Management- Network 8 Hours
Provisioning, Inventory Management, Network Topology, Fault Management- Fault
Detection, Fault Location and Isolation 24 Techniques, Performance Management –
Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; Event
Correlation Techniques – Rule-Based Reasoning, Model-Based Reasoning, Case Based
Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State
Machine Model, Security Management – Policies and Procedures, Security Breaches
and the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication
and Authorization, Client/Server Authentication Systems, Messages Transfer Security,
Protection of Networks from Virus Attacks, Accounting Management, Report
Management, Policy- Based Management, Service Level Management.
Course Outcomes
The students should be able to:
 Analyze the issues and challenges pertaining to management of emerging network technologies
such as wired/wireless networks and high-speed internets.
 Apply network management standards to manage practical networks
 Formulate possible approaches for managing OSI network model.
 Use on SNMP for managing the network
 Use RMON for monitoring the behavior of the network
 Identify the various components of network and formulate the scheme for the managing them
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module. The students will have to
answer 5 full questions, selecting one full question from each module.
Text Books:
1. Mani Subramanian: Network Management- Principles and Practice, 2nd Pearson Education, 2010.
Reference Books:
1. J. Richard Burke: Network management Concepts and Practices: a Hands-On Approach, PHI,
2008.

INFORMATION NETWORK SECURITY AND NETWORK PROGRAMMING LAB

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16LNI16 IA Marks 20
Number of Lecture Hours/Week 01+03 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
  Evaluate of Cryptography through practical implementation.
 To implement standard algorithms used to provide confidentiality, integrity and authenticity.
 To implement the various key distribution and management schemes.
 How to use cutting edge simulation tools
 Design security applications in the field of Information technology
PART – A INFORMATION AND NETWORK SECURITY LABORATORY WORK:
1. Consider a file with composite data, substitute the content and transpose the ciphers.
2. Apply the RSA algorithm on a text file to produce cipher text file.
3. Develop a mechanism to setup a security channel using Diffie-Hellman Key Exchange between
client and server.
4. Implementation of Message Authentication Code using cryptography HMAC function.
5. Implement secure hash algorithm 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
PART – B NETWORK PROGRAMMING LABORATORY WORK:
1. Write a C program to implement daytime client/server program using TCP sockets
2. Write a TCP client/server program in which client sends three numbers to the server in a single
message. Server returns sum, difference and product as a result single message. Client program
should print the results appropriately.
3. Write a C program that prints the IP layer and TCP layer socket options in a separate file
Course Outcomes
The students should be able to:
 Implement various encryption techniques
 Generate and test message digest
 Perform interprocess communication between two machines in a network.
Conduction of Practical Examination:
1. All laboratory experiments (nos) are to be included for practical examination.
2. Students are allowed to pick one experiment from each part and execute both
3. Strictly follow the instructions as printed on the cover page of answer script for breakup of marks
4. PART –A: Procedure + Conduction + Viva: 10 + 20 +10 (40)
5. PART –B: Procedure + Conduction + Viva: 10 + 20 +10 (40)
6. Change of experiment is allowed only once and marks allotted to the procedure part to be made
zero.

SEMINAR
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – I
Subject Code 16SCE17 / 16SCN17 /
16LNI17 / 16SIT17 /
IA Marks 100
16SSE17 / 16SCS17 /
16SFC17
Number of Lecture Hours/Week ---- Exam Marks -
Total Number of Lecture Hours ---- Exam Hours -
CREDITS – 01
Course objectives: This course will enable students to
 Motivate the students to read technical article
 Discover recent technology developments
Descriptions
The students should read a recent technical article (try to narrow down the topic as much as possible)
from any of the leading reputed and refereed journals like:
  IEEE Transactions, journals, magazines, etc.
 ACM Transactions, journals, magazines, SIG series, etc.
 Springer
 Elsevier publications etc
In the area of (to name few and not limited to)
 Web Technology
 Cloud Computing
 Artificial Intelligent
 Networking
 Security
 Data mining
Course Outcomes
The students should be able to:
 Conduct survey on recent technologies
 Infer and interpret the information from the survey conducted
 Motivated towards research
Conduction:
The students have to present at least ONE technical seminar on the selected topic and submit a report
for internal evaluation.
Marks Distribution: Literature Survey + Presentation (PPT) + Report + Question & Answer
+ Paper: 20 + 30 + 30 + 20 (100).