Skip to main content

Information Storage and Management

INFORMATION STORAGE AND MANAGEMENT ( ISAM)

Lecture Notes Unit Wise

INFORMATION STORAGE AND MANAGEMENT ( ISAM) Notes Unit Wise
Unit I
Introduction to Information Storage

Unit II
Data Protection
 
Unit III
Fibre Channel Storage Area Networks
 
Unit IV
Introduction to Business Continuity
 
Unit V
Cloud Computing
 


Text book 



Course Code
Course Title
Core / Elective
PE 834 IT
Information Storage and Management
Elective
Prerequisite
Contact Hours per Week
CIE
SEE
Credits
L
T
D
P
-
3
-
-
-
30
70
3
Course Objectives
Ø  To introduce the concept of storage, emphasize the significance of storage technologies in IT infrastructure.
Ø  To provides a comprehensive understanding of the various storage infrastructure components in data center environments.
Ø  To learn about the architectures, features, and benefits of Intelligent Storage Systems.
Ø  To understand various storage networking technologies such as FC-SAN, NAS, and IP-SAN; long- term archiving solution – CAS.
Ø  To know about various business continuity solutions such as backup and replication.
Ø  To understand information security role in storage networks and the emerging field of storage virtualization including storage resource management.
Course Outcomes
1.        Evaluate storage architecture; understand logical and physical components of a storage infrastructure including storage subsystems.
2.        Describe storage networking technologies such as FC-SAN, NAS, IP-SAN and data archival solution – CAS.
3.        Identify different storage virtualization technologies and their benefits.
4.        Understand and articulate business continuity solutions including, backup and recovery technologies, and local and remote replication solutions.
5.        Identify parameters of managing and monitoring storage infrastructure and describe common storage
management activities and solutions


UNIT-I

Introduction to Information Storage: Information Storage, Evolution of Storage Architecture, Data Center Infrastructure, Virtualization and Cloud Computing. Data Center Environment: Application, Database Management System (DBMS), Host, Connectivity, Storage, Disk Drive Components, Disk Drive Performance, Host Access to Data, Direct-Attached Storage, Storage Design Based on Application, Disk Native Command Queuing, Introduction to Flash Drives.

UNIT-II

Data Protection: RAID, Implementation Methods, Array Components, Techniques, Levels, RAID Impact on Disk Performance, RAID Comparison, Hot Spares. Intelligent Storage Systems: Components of an Intelligent Storage System, Storage Provisioning, Types of Intelligent Storage Systems.

UNIT-III

Fibre Channel Storage Area Networks: Overview, The SAN and Its Evolution, Components of FC SAN, FC Connectivity, Switched Fabric Ports, Fibre Channel Architecture, Zoning, FC SAN Topologies, Virtualization in SAN. IP SAN and FCoE: iSCSI, FCIP, FCoE. Network-Attached Storage: General-Purpose Servers versus NAS Devices, Benefits of NAS, File Systems and Network File Sharing, Components of NAS, I/O Operation, Implementations, File-Sharing Protocols, Factors Affecting NAS Performance, FileLevel Virtualization. Object-Based and Unified Storage: Object-Based Storage Devices, Content Addressed Storage, CAS Use Cases.

UNIT-IV

Introduction to Business Continuity: Information Availability, BC Terminology, BC Planning Life Cycle, Failure Analysis, Business Impact Analysis, BC Technology Solutions. Backup and Archive: Backup Purpose, Backup Considerations, Backup Granularity, Recovery Considerations, Backup Methods, Backup Architecture, Backup and Restore Operations, Backup Topologies, Backup in NAS Environments. Local Replication: Replication Terminology, Uses of Local Replicas, Replica Consistency, Local Replication Technologies. Remote Replication: Modes of Remote Replication, Remote Replication Technologies, Three- Site Replication.

UNIT-V

Cloud Computing: Cloud Enabling Technologies, Characteristics of Cloud Computing, Benefits of Cloud Computing Cloud Service Models, Cloud Deployment Models, Cloud Computing Infrastructure, Cloud Challenges. Securing the Storage Infrastructure: Information Security Framework, Risk Triad, Storage Security Domains, Storage Security Domains. Managing the Storage Infrastructure: Monitoring the Storage Infrastructure, Storage Infrastructure Management Activities, Storage Infrastructure Management Challenges, Developing an Ideal Solution, Information Lifecycle Management.

Suggested Readings:

1.      EMC Corporation, Information Storage and Management, Wiley India, 2nd Edition, 2011.
2.     Robert Spalding, Storage Networks: The Complete Reference, Tata McGraw Hill, Osborne, 2003.
3.      Marc Farley, Building Storage Networks, Tata McGraw Hill, Osborne,2nd Edition, 2001.
4.   Meeta Gupta, Storage Area Network Fundamentals, Pearson Education Limited, 2002.




LESSON PLAN
Unit No.
S No
Topic
No. of Classes Planned
Reference
Book
I
1
Information Storage, Evolution of Storage Architecture,
1
R1
2
Data Center Infrastructure, Virtualization and Cloud Computing
2
R1
3
Data Center Environment: Application and DBMS
1
R1
4
Host, Connectivity, Storage, Disk Drive Components & performance
2
R1
5
Host Access to Data
1
R1
6
Direct-Attached Storage, Storage Design Based on Application
2
R1
7
Disk Native Command Queuing, Introduction to Flash Drives
1
R1

Total periods required for Unit I
10

II
1
Data Protection: RAID, Implementation Methods,
2
R1
2
Array Components, Techniques, Levels,
2
R1
3
RAID Impact on Disk Performance,
2
R1
4
RAID Comparison, Hot Spares.
1
R1
5
Components of an Intelligent Storage System
1
R1
6
Storage Provisioning, Types of Intelligent Storage Systems
2
R1

Total periods required for Unit II
10

III
1
Fibre Channel Storage Area Networks: Overview
1
R2
2
Its Evolution, Components of FC SAN, FC Connectivity, Switched Fabric Ports
1
R2
3
Fibre Channel Architecture, Zoning, FC SAN Topologies, Virtualization in SAN.
2
R2
4
IP SAN and FCoE: iSCSI, FCIP, FCoE.
2
R2
5
General-Purpose Servers versus NAS Devices , Benefits of NAS
2
R2
6
File Systems and Network File Sharing, Components of NAS
1
R3
7
I/O Operation , Implementations, File-Sharing Protocols,
1
R3
8
Factors Affecting NAS Performance , FileLevel Virtualization
2
R3
9
Object-Based Storage Devices
1
R3
10
Content Addressed Storage, CAS Use Cases
1
R3

Total periods required for Unit III
14

IV
1
Introduction to Business Continuity, Information Availability
1
R3
2
BC Terminology, BC Planning Life Cycle, Failure Analysis, Business Impact Analysis , BC Technology Solutions
2
R3
3
Backup and Archive: Backup Purpose, Considerations, Granularity
1
R4
4
Recovery Considerations , Backup Methods, Architecture, Topologies
1
R4
5
Backup and Restore Operations, Backup in NAS Environments
2
R4
6
Local Replication: Replication Terminology, Local Replication Technologies.
2
R4
7
Remote Replication: Modes of Remote Replication, Remote Replication Technologies
2
R4


Total periods required for Unit IV
11

V
1
Cloud Computing: Cloud Enabling Technologies, Characteristics & Benefits.
1
R3
2
Cloud Service Models, Cloud Deployment Models,
1
R3
3
Cloud Computing Infrastructure, Cloud Challenges
2
R3
4
Securing the Storage Infrastructure: Information Security Framework, Risk Triad
1
R3
5
Storage Security Domains, Storage Security Domains
2
R3
6
Managing the Storage Infrastructure, Monitoring, activities, Challenges,
2
R3
7
Developing an Ideal Solution, Information Lifecycle Management
2
R3


Total periods required for Unit V
11

TOTAL No. OF LECTURES REQUIRED
56


Labels:

Comments

Post a Comment

Popular posts from this blog

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

  ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK                                         BE III Year II Semester (A & B Sections) –PC 603 CS     Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Why is an algorithm analysis required? 2.       State about UNION & FIND operations. 3.       List out the UNION algorithm using weighting rule. 4.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5.       List and define operations performed on sets? 6.       What do you mean by performance analysis of an algorithm? Explain. 7.       Explain the significance of input size of a problem. 8.       State the weighting, collapsing rules in sets. 9.       Explain set representation and write algorithm for FIND. 10.   Solve T(n)=3T(n/3)+√n. 11.   Define the terms direct recursive and indirect rec
Post a Comment
Read more

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION   HTML   CSS   WEB APPLICATION FUNDAMENTALS   Unit II XML   Unit III JQuery   JSON Java Script Unit IV AngularJS   Unit V MEAN Stack   SMACK Stack LAB PROGRAMS:  Click Here Important Question for MID I :  Click here WAD Previous Question : Click Here TEXT BOOK:  Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective:     Ø    To develop dynamic web applications using the concepts of HTML 5.0 and   CSS     Ø    To understand the document structure and schemas and represent data in  that format     Ø    To develop applications using Query and represent objects in JSON   notation    
19 comments
Read more

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

  ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Explain linear probing in Hashing with an example. 2.       Define Heap. 3.       List out the collision resolution techniques in hashing. 4.       Why is an algorithm analysis required? 5.       State about UNION & FIND operations. 6.       List out the UNION algorithm using weighting rule. 7.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8.       List and define operations performed on sets? 9.       What do you mean by performance analysis of an algorithm? Explain. 10.   Explain the significance of input size of a problem. 11.   State the weighting, collapsing rules in sets. 12.   Explain set representation and write algorithm for FIND. 17
Post a Comment
Read more