To see the other types of publications on this topic, follow the link: Storage Area Networks (SAN).
Dissertations / Theses on the topic 'Storage Area Networks (SAN)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 32 dissertations / theses for your research on the topic 'Storage Area Networks (SAN).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Glöckner, Alexander. "Fibre Channel im Einsatz in Storage Area Networks (SAN)." Universitätsbibliothek Chemnitz, 2001. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200100511.
Full textAbstract:
Gemeinsamer Workshop von Universitaetsrechenzentrum und Professur "Rechnernetze und verteilte Systeme" der Fakultaet fuer Informatik der TU Chemnitz.
Workshop-Thema: Mobilitaet
Dieser Vortrag beschreibt neue Techniken zum Speichern grosser Datenmenge, auch über grosse Entfernungen hinweg.
2
Hajirostam, Siavash. "Evaluation of Storage Area Network (SAN) security and performance." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-24142.
Full textAbstract:
Due to growing the number of Information Technology (IT) users all around the world, consequently the amount of data that needs to be stored is increasing day by day. Single attached disks and old storage technologies cannot manage the storing these amounts of data. Storage Area Network (SAN) is a distributed storage technology to manage the data from several nodes in centralize place and secure. This thesis investigates how SAN works, the file system and protocols that are used in implementation of SAN. The thesis also investigate about other storages technologies such as Network Attached Storage (NAS) and Direct Attached Storage (DAS) to figure out the advantages and disadvantages of SAN, The main focus of the thesis project is on identifying the security vulnerabilities in SAN such as possible attacks in different SAN protocols. The thesis finally identifies the performance factors in SAN to figure out how to improve the performance with respect to security solutions aimed to enhance the security level in SAN.
3
Altaf, Moaz. "SMI-S for the Storage Area Network (SAN) Management." Thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6125.
Full textAbstract:
The storage vendors have their own standards for the management of their storage resources but it creates interoperability issues on different storage products. With the recent advent of the new protocol named Storage Management Initiative-Specification (SMI-S), the Storage Networking Industry Association (SNIA) has taken a major step in order to make the storage management more effective and organized. SMI-S has replaced its predecessor Storage Network Management Protocol (SNMP) and it has been categorized as an ISO standard. The main objective of the SMI-S is to provide interoperability management of the heterogeneous storage vendor systems by unifying the Storage Area Network (SAN) management, hence making the dreams of the network managers come true. SMI-S is a guide to build systems using modules that ‘plug’ together. SMI-S compliant storage modules that use CIM ‘language’ and adhere to CIM schema interoperate in a system regardless of which vendor built them. SMI-S is object-oriented, any physical or abstract storage-related elements can be defined as a CIM object. SMI-S can unify the SAN management systems and it works well with the heterogeneous storage environment. SMI-S has offered a cross-platform, cross-vendor storage resource management. This thesis work discusses the use of SMI-S at Compuverde which is a storage solution provider, located in the heart of the Karlskrona, the southeastern part of Sweden. Compuverde was founded by Stefan Bernbo in Karlskrona,Sweden. Just like all others leading storage providers, Compuverde has also decided to deploy the Storage Management Initiative-Specification (SMI-S) to manage their Storage Area Network (SAN) and to achieve interoperability. This work was done to help Compuverde to deploy the SMI-S protocol for the management of the Storage Area Network (SAN) which, among many of its features, would create alerts/traps in case of a disk failure in the SAN. In this way, they would be able to keep the data of their clients, safe and secure and keep their reputation for being reliable in the storage industry. Since Compuverde regularly use Microsoft Windows and Microsoft have started to support SMI-S for storage provisioning in System Center 2012 Virtual Machine Manager (SCVMM), this work was done using the SCVMM 2012 and the Windows Server 2012.The SMI-S provider which was used for this work was QNAP TS- 469 Pro.0764354242
4
Kalibjian, Jeff. "Storage Systems and Security Challenges in Telemetry Post Processing Environments." International Foundation for Telemetering, 2008. http://hdl.handle.net/10150/606206.
Full textAbstract:
ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, CaliforniaA common concern in telemetry post-processing environments is adequate disk storage capacity to house captured and post-processed telemetry data. In today's network environments there are many storage solutions that can be deployed to address storage needs. Recent trends in storage systems reveal movement to implement security services in storage systems. After reviewing storage options appropriate for telemetry post-processing environments; the security services such systems typically offer will also be discussed and contrasted with other third party security services that might be implemented directly on top of a networked storage system.
5
Müller, Thomas. "TUCSAN - Plattform für neue Speicherdienste." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700537.
Full textAbstract:
TUCSAN ist das Speichernetzwerk (Storage Area Network) der TU Chemnitz.
Es realisiert auf einem Midrange-Speichersystem und elf Raid-Systemen eine direkt nutzbare Gesamtspeicherkapazität von 83 TB. Für automatisierte Datensicherungen und Redundanz stehen weitere 104 TB zur Verfügung.
Der Vortrag stellt die eingesetzte Technik und die Sturktur von TUCSAN vor.
Weiterhin werden die damit realisierten Dienste präsentiert und es wird ein Ausblick auf künftige Vorhaben gegeben.
Der Vortrag wurde am 10. Mai 2007 im Rahmen eines Kolloquiums zur Inbetriebnahme des TUCSAN gehalten.
6
Heik, Andreas. "Managing VMware Virtual Infrastructure Environments." Universitätsbibliothek Chemnitz, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-64729.
Full text
7
Ziegler, Christoph, Matthias Clauß, Thomas Müller, Frank Richter, and Wolfgang Riedel. "Mitteilungen des URZ 4/2006." Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200602057.
Full text
8
Knobloch, DI Ralf. "Storage Area Networks." Universitätsbibliothek Chemnitz, 2001. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200100206.
Full text
9
El-Gorashi, Taisir El-Mustafa Hamza. "Optical storage area networks." Thesis, University of Leeds, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522930.
Full text
10
Pranggono, Bernardi. "Integrated Storage Area Networks (INSTANT)." Thesis, University of Leeds, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.505077.
Full textAbstract:
Storage Area Networks (SANs) have become an essential part of today's enterprise computing. SAN technologies are starting to be widely ~sed for data backup, recovery, and storage consolidation. INSTANT is a DTI-funded collaboration between two British universities: the University of Wales Swansea and the University of Cambridge and one industrial collaborator, ALPS. The principal objectives of the project are to devise a new form of fibre based high capacity distributed, dynamic, reconfigurable SAN and to enhance the performance and reconfigurability of the network using recently developed low cost Wavelength Division Multiplexing (WDM) technologies. In this thesis, we present results relating to a new metro WI?M storage demonstrator project, the INtegrated STorage Area NeTwork (INSTANT). Comprehensive literature review on SANs and WDM technologies was conducted. Based on the reviews, we propose novel SAN architecture and MAC protocols for SANs in metro WDM networks setting. Several possible solutions are proposed: storage area networking with fixed packet size, with variable packet size based on the real IP datagram distribution and with sectioned ring. \Ve then discuss and evaluate the network performance of the MAC protocol utilised in the proposed architectures. Performance analysis in real world scenarios and under realistic network traffic is performed. Two different traffic models were developed and implemented to simulate realistic traffic patterns. Both symmetric and asymmetric traffic scenarios are considered. Network performance in terms of throughput, delay and packet dropping probability are presented and studied. A novel data mirroring technique for metro WDM SANs in ring network architectures is also proposed and evaluated. Finally, traffic statistics in metro WDM SANs is also studied and discussed. Our approach considers all traffic happening during the conversation as a unique bidirectional flow of data, which we divided into upstream and downstream traffic. We separately study upstream and downstream traffic, building for each of them, estimates of number of packet and packet's inter-arrival time (IAT).
11
Wilson, Timothy David. "Increasing the performance of storage services for local area networks." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240037.
Full text
12
Zhang, Fan. "Free-space optical fibre-ribbon switch for storage area networks." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613373.
Full text
13
Miles, Joseph A. "Large fabric storage area networks fabric simulator development and preliminary analysis /." Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1798480901&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Full text
14
Munishwar, Vikram P. "Storage and indexing issues in sensor networks." Diss., Online access via UMI:, 2006.
Find full text
15
Chou, H. H. "Free-space multiwavelength optical switching core for MPLS-based storage area networks." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.597644.
Full textAbstract:
From the literature review of promising networking architectures, a MPLS-enabled networking architecture was selected for SAN applications over an optical network and the SAN data transmission protocol over such network architecture was simulated through a simulation platform constructed by Network Simulator (NS-2) software. The strategies in designing a MPLS-enabled router prototype were specified from the case study of currently commercial available SAN switches/routers. The architecture design of a MPLS-enabled router prototype was emulated by using OPNET Modeler. The network-wide simulation results from NS-2 showed that the utilization of iSCSI transmission protocol with appropriate setting of TCP parameters such as window size can increase the network throughput and the link bandwidth efficiency for SAN applications. A realistic system-level performance simulation of the proposed router prototype by OPNET Modeler software indicated that the labelled packet size of 1500 byte length under the proposed switching architecture with the SLM reconfiguration time of 1us is suitable to minimise the buffer size usage and maintain an acceptable switching latency less than 20ms no matter when the SANs traffic is intensive or not. The optical transmission performance of the implemented 2x2 shutter-based free-space multiwavelength optical switch prototype evaluated by CWDM transceiver based testbed has proved successfully that a link budget between -26.72dB and -28.88 dB can be achieved with a satisfying BER of less than 10-12 in a single mode fibre to multimode fibre transmission architecture. From the analysis of optical components, the optical system link budget can be improved up to 4.3dB. The system crosstalk of the optical switching prototype was calculated to be between -21.6dB and -24.4dB.
16
Hoge, James Claude. "Use of optical storage devices as shared resources in Local Area Networks." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27325.
Full text
17
Zhang, Ming. "Toward high performance and highly reliable storage service /." View online ; access limited to URI, 2004. http://wwwlib.umi.com.helin.uri.edu/dissertations/dlnow/3160041.
Full text
18
Singh, Aameek. "Secure Management of Networked Storage Services: Models and Techniques." Diss., Available online, Georgia Institute of Technology, 2007, 2007. http://etd.gatech.edu/theses/available/etd-04092007-004039/.
Full textAbstract:
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2008.Liu, Ling, Committee Chair ; Aberer, Karl, Committee Member ; Ahamad, Mustaque, Committee Member ; Blough, Douglas, Committee Member ; Pu, Calton, Committee Member ; Voruganti, Kaladhar, Committee Member.
19
Muangmode, Korawan. "The reaction evaluation of Blue Drive online tutorial at University of Wisconsin-Stout." Online version, 2008. http://www.uwstout.edu/lib/thesis/2008/2008muangmodek.pdf.
Full text
20
McMahon, Michael J. "An approach for enhanced management of network-attached devices." abstract and full text PDF (free order & download UNR users only), 2007. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1442840.
Full text
21
Bergenhem, Carl, and Magnus Jonsson. "Two Protocols with Heterogeneous Real-Time Services for High-Performance Embedded Networks." Högskolan i Halmstad, Centrum för forskning om inbyggda system (CERES), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-21296.
Full textAbstract:
High-performance embedded networks are found in computer systems that perform applications such as radar signal processing and multimedia rendering. The system can be composed of multiple computer nodes that are interconnected with the network. Properties of the network such as latency and speed affect the performance of the entire system. A node´s access to the network is controlled by a medium access protocol. This protocol decides e.g. real-time properties and services that the network will offer its users, i.e. the nodes. Two such network protocols with heterogeneous real-time services are presented. The protocols offer different communication services and services for parallel and distributed real-time processing. The latter services include barrier synchronisation, global reduction and short message service. A network topology of a unidirectional pipelined optical fibre-ribbon ring is assumed for both presented protocols. In such a network several simultaneous transmissions in non-overlapping segments are possible. Both protocols are aimed for applications that require a high-performance embedded network such as radar signal processing and multimedia. In these applications the system can be organised as multiple interconnected computation nodes that co-operate in parallel to achieve higher performance. The computing performance of the whole system is greatly affected by the choice of network. Computing nodes in a system for radar signal processing should be tightly coupled, i.e., communications cost, such as latency, between nodes should be small. This is possible if a suitable network with an efficient protocol is used. The target applications have heterogeneous real-time requirements for communication in that different classes of data-traffic exist. The traffic can be classified according to its requirements. The proposed protocols partition data-traffic into three classes with distinctly different qualities. These classes are: traffic with hard real-time demands, such as mission critical commands; traffic with soft real-time demands, such as application data (a deadline miss here only leads to decreased performance); and traffic with no real-time constraints at all. The protocols are analysed and performance is tested through simulation with different data-traffic patterns.
22
Zhang, Gong. "Data and application migration in cloud based data centers --architectures and techniques." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41078.
Full textAbstract:
Computing and communication have continued to impact on the way we run business, the way we learn, and the way we live. The rapid technology evolution of computing has also expedited the growth of digital data, the workload of services, and the complexity of applications. Today, the cost of managing storage hardware ranges from two to ten times the acquisition cost of the storage hardware. We see an increasing demand on technologies for transferring management burden from humans to software. Data migration and application migration are one of popular technologies that enable computing and data storage management to be autonomic and self-managing.
In this dissertation, we examine important issues in designing and developing scalable architectures and techniques for efficient and effective data migration and application migration. The first contribution we have made is to investigate the opportunity of automated data migration across multi-tier storage systems. The significant IO improvement in Solid State Disks (SSD) over traditional rotational hard disks (HDD) motivates the integration of SSD into existing storage hierarchy for enhanced performance. We developed adaptive look-ahead data migration approach to effectively integrate SSD into the multi-tiered storage architecture. When using the fast and expensive SSD tier to store the high temperature data (hot data) while placing the relatively low temperature data (low data) in the HDD tier, one of the important functionality is to manage the migration of data as their access patterns are changed from hot to cold and vice versa. For example, workloads during day time in typical banking applications can be dramatically different from those during night time. We designed and implemented an adaptive lookahead data migration model. A unique feature of our automated migration approach is its ability to dynamically adapt the data migration schedule to achieve the optimal migration effectiveness by taking into account of application specific characteristics and I/O profiles as well as workload deadlines. Our experiments running over the real system trace show that the basic look-ahead data migration model is effective in improving system resource utilization and the adaptive look-ahead migration model is more efficient for continuously improving and tuning of the performance and scalability of multi-tier storage systems. The second main contribution we have made in this dissertation research is to address the challenge of ensuring reliability and balancing loads across a network of computing nodes, managed in a decentralized service computing system. Considering providing location based services for geographically distributed mobile users, the continuous and massive service request workloads pose significant technical challenges for the system to guarantee scalable and reliable service provision. We design and develop a decentralized service computing architecture, called Reliable GeoGrid, with two unique features. First, we develop a distributed workload migration scheme with controlled replication, which utilizes a shortcut-based optimization to increase the resilience of the system against various node failures and network partition failures. Second, we devise a dynamic load balancing technique to scale the system in anticipation of unexpected workload changes. Our experimental results show that the Reliable GeoGrid architecture is highly scalable under changing service workloads with moving hotspots and highly reliable in the presence of massive node failures. The third research thrust in this dissertation research is focused on study the process of migrating applications from local physical data centers to Cloud. We design migration experiments and study the error types and further build the error model. Based on the analysis and observations in migration experiments, we propose the CloudMig system which provides both configuration validation and installation automation which effectively reduces the configuration errors and installation complexity. In this dissertation, I will provide an in-depth discussion of the principles of migration and its applications in improving data storage performance, balancing service workloads and adapting to cloud platform.
23
Ling, Meng-Chun. "Senior health care system." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2785.
Full textAbstract:
Senior Health Care System (SHCS) is created for users to enter participants' conditions and store information in a central database. When users are ready for quarterly assessments the system generates a simple summary that can be reviewed, modified, and saved as part of the summary assessments, which are required by Federal and California law.
24
Muppalaneni, Nitin. "Adaptive Hierarchical RAID." Thesis, 1998. http://etd.iisc.ernet.in/handle/2005/2171.
Full text
25
Dharmadeep, M. C. "Optimizations In Storage Area Networks And Direct Attached Storage." Thesis, 2007. http://hdl.handle.net/2005/574.
Full textAbstract:
The thesis consists of three parts.
In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk
subsystems have many megabytes of memory for various purposes such as prefetching and caching. Current disk scheduling algorithms make decisions oblivious of the underlying device cache algorithms. In this thesis, we propose a scheduler architecture that is aware of underlying device cache. We also describe how the underlying device cache parameters can be automatically deduced and incorporated into the scheduling algorithm. In this thesis, we have only considered adaptive caching algorithms as modern high end disk subsystems are by default configured to use such algorithms. We implemented a prototype for Linux anticipatory scheduler, where we observed, compared with the anticipatory scheduler, upto 3 times improvement in query execution times with Benchw benchmark and upto 10 percent improvement with Postmark benchmark.
The second part deals with implementing cooperative caching for the Redhat Global File System. The Redhat Global File System (GFS) is a clustered shared disk file system. The coordination between multiple accesses is through a lock manager. On a read, a lock on the inode is acquired in shared mode and the data is read from the disk. For a write, an exclusive lock on the inode is acquired and data is written to the disk; this requires all nodes holding the lock to write their dirty buffers/pages to disk and invalidate all the related buffers/pages. A DLM (Distributed Lock Manager) is a module that implements the functions of a lock manager. GFS’s DLM has some support for range locks, although it is not being used by GFS. While it is clear that a data sourced from a memory copy is likely to have lower latency, GFS currently reads from the shared disk after acquiring a lock (just as in other designs such as IBM’s GPFS) rather than from remote memory that just recently had the correct contents. The difficulties are mainly due to the circular relationships that can result between GFS and the generic DLM architecture while integrating DLM locking framework with cooperative caching. For example, the page/buffer cache should be accessible from DLM and yet DLM’s generality has to be preserved. The symmetric nature of DLM (including the SMP concurrency model) makes it even more difficult to understand and integrate cooperative caching into it (note that GPFS has an asymmetrical design). In this thesis, we describe the design of a cooperative caching scheme in GFS. To make it more effective, we also have introduced changes to the locking protocol and DLM to handle range locks more efficiently. Experiments with micro benchmarks on our prototype implementation reveal that, reading from a remote node over gigabit Ethernet can be upto 8 times faster than reading from a enterprise class SCSI disk for random disk reads. Our contributions are an integrated design for cooperative caching and lock manager for GFS, devising a novel method to do interval searches and determining when sequential reads from a remote memory perform better than sequential reads from a disk.
The third part deals with selecting a primary network partition in a clustered shared disk system, when node/network failures occur. Clustered shared disk file systems like GFS, GPFS use methods that can fail in case of multiple network partitions and also in case of a 2 node cluster. In this thesis, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speaking, a leader election algorithm is proactive if it can tolerate failure of nodes even after a leader is elected, and (stable) leader election happens periodically. This is needed in systems where a leader is required after every failure to ensure the availability of the system and there might be no explicit events such as messages in the (shared memory) system. Previous algorithms like DiskPaxos are not proactive. In our model, individual nodes can fail and reincarnate at any point in time. Each node has a counter which is incremented every period, which is same across all the nodes (modulo a maximum drift). Different nodes can be in different epochs at the same time. Our algorithm ensures that per epoch there can be at most one leader. So if the counter values of some set of nodes match, then there can be at most one leader among them. If the nodes satisfy certain timeliness constraints, then the leader for the epoch with highest counter also becomes the leader for the next epoch (stable property). Our algorithm uses shared memory proportional to the number of processes, the best possible. We also show how our protocol can be used in clustered shared disk systems to select a primary network partition. We have used the state machine approach to represent our protocol in Isabelle HOL logic system and have proved the safety property of the protocol.
26
Murphy, Matthew R. Harvey Bruce A. "ISCSI-based storage area network for disaster." Diss., 2005. http://etd.lib.fsu.edu/theses/available/etd-04082005-134722.
Full textAbstract:
Thesis (M.S.)--Florida State University, 2005.Advisor: Dr. Bruce A. Harvey, Florida State University, College of Engineering, Dept. of Electrical and Computer Engineering. Title and description from dissertation home page (viewed June 10, 2005). Document formatted into pages; contains vii, 73 pages. Includes bibliographical references.
27
"Switching considerations in storage networks." 2003. http://library.cuhk.edu.hk/record=b5891724.
Full textAbstract:
by Leung Yiu Tong.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 96-98).
Abstracts in English and Chinese.
Chapter 1. --- Introduction --- p.1
Chapter 1.1 --- Motivation --- p.1
Chapter 1.2 --- Thesis Organization --- p.3
Chapter 2. --- Storage Network Fundamentals --- p.4
Chapter 2.1 --- Storage Network Topology --- p.4
Chapter 2.1.1 --- Direct Attached Storage (DAS) --- p.5
Chapter 2.1.2 --- Network Attached Storage (NAS) --- p.7
Chapter 2.1.3 --- Storage Area Network (SAN) --- p.9
Chapter 2.1.3.1 --- SAN and the Fibre Channel Protocol --- p.11
Chapter 2.1.4 --- Summary on Storage Network Topology --- p.12
Chapter 2.2 --- Storage Protocol --- p.15
Chapter 2.2.1 --- Fibre Channel --- p.15
Chapter 2.2.1.1 --- Fibre Channel over IP (FCIP) --- p.17
Chapter 2.2.1.2 --- Internet Fibre Channel Protocol (iFCP) --- p.19
Chapter 2.2.2 --- Internet SCSI (iSCSI) --- p.20
Chapter 2.2.3 --- InfiniBand --- p.22
Chapter 2.2.4 --- Review on Storage Network Protocol --- p.25
Chapter 2.3 --- Standard Organization --- p.27
Chapter 2.4 --- Summary --- p.28
Chapter 3. --- Switching Design for Storage Networks --- p.30
Chapter 3.1. --- Shared Bus Design --- p.32
Chapter 3.2. --- Time Division Switch --- p.36
Chapter 3.3. --- Share Buffer Memory Switch --- p.37
Chapter 3.3.1 --- Parallel Memory Array --- p.40
Chapter 3.3.2 --- Distributive Storage --- p.43
Chapter 3.4. --- Crossbar Switch --- p.45
Chapter 3.4.1 --- Arbitrated Crossbar vs. Buffered Crossbar --- p.46
Chapter 3.4.1.1 --- Arbitrated Crossbar Switch --- p.47
Chapter 3.4.1.2 --- Buffered Crossbar Switch --- p.48
Chapter 3.4.2 --- Switch Scheduling --- p.49
Chapter 3.4.2.1 --- Bipartite Matching --- p.50
Chapter 3.4.2.2 --- Token-based Distributive Scheduling --- p.53
Chapter 3.4.2.3 --- Resource Counting using Semaphore --- p.56
Chapter 3.5. --- Algebraic Switches --- p.60
Chapter 3.5.1 --- Switching by Conditionally Nonblocking Properties --- p.61
Chapter 3.5.2 --- Self-Routing Mechanism with Zero-Bit Buffering --- p.64
Chapter 3.5.3 --- Multistage Interconnection of Self-routing Concentrators --- p.69
Chapter 3.6. --- Summary --- p.73
Chapter 4. --- Investigating Switching Issue in Storage Networks --- p.74
Chapter 4.1 --- Choosing a Suitable Switch --- p.74
Chapter 4.2 --- Quality of Service (QoS) --- p.76
Chapter 4.3 --- Multicasting --- p.77
Chapter 4.3.1 --- Crossbar Switch --- p.78
Chapter 4.3.2 --- Shared-Buffer Memory Switches --- p.80
Chapter 4.3.3 --- Algebraic Switch --- p.82
Chapter 4.3.4 --- Application on Multicast Transmission --- p.86
Chapter 4.4 --- Load Balancing Mechanism --- p.87
Chapter 4.5 --- Optimization on Storage Utilization --- p.91
Chapter 4.6 --- Summary --- p.93
Chapter 5. --- Conclusion and Summary of Original Contributions --- p.94
28
Gençay, Eray [Verfasser]. "Configuration checking and design optimization of storage area networks / Eray Gençay." 2009. http://d-nb.info/99643108X/34.
Full text
29
Mutombo, Deya Mwembya. "A performance evaluation of peer-to-peer storage systems." Thesis, 2013. http://hdl.handle.net/10539/12428.
Full textAbstract:
This work evaluates the performance of Peer-to-Peer storage systems in structured
Peer-to-Peer (P2P) networks under the impacts of a continuous process of nodes
joining and leaving the network (Churn). Based on the Distributed Hash Tables
(DHT), the peer-to-peer systems provide the means to store data among a large and
dynamic set of participating host nodes. We consider the fact that existing solutions
do not tolerate a high Churn rate or are not really scalable in terms of number of
stored data blocks. The considered performance metrics include number of data
blocks lost, bandwidth consumption, latencies and distance of matched lookups.
We have selected Pastry, Chord and Kademlia to evaluate the e ect of inopportune
connections/disconnections in Peer-to-Peer storage systems, because these selected
P2P networks possess distinctive characteristics.
Chord is one of the rst structured P2P networks that implements Distributed
Hash Tables (DHTs). Similar to Chord, Pastry is based on a ring structure, with the
identi er space forming the ring. However, Pastry uses a di erent algorithm than
Chord to select the overlay neighbors of a peer. Kademlia is a more recent structured
P2P network, with the XOR mechanism for improving distance calculation. DHT
deployments are characterized by Churn. But if the frequency of Churn is too high,
data blocks can be lost and lookup mechanism begin to incur delays. In architectures
that employ DHTs, the choice of algorithm for data replication and maintenance can
have a signi cant impact on the performance and reliability. PAST is a persistent
Peer-to-Peer storage utility, which replicates complete les on multiple nodes, and
uses Pastry for message routing and content location.
The hypothesis is that by enhancing the Churn tolerance through building a
really e cient replication and maintenance mechanisms, it will:
i) Operate better than a peer-to-peer storage system such as PAST especially in
replica placement strategy with a fewer data transfers.
ii) Resolve le lookups with a match that is closer to the source peer, thus con-
serving bandwidth.
Our research will involve a series of simulation studies using two network simulators
OverSim and OMNeT++. The main results are:
Our approach achieves a higher data availability in presence of Churn, than
the original PAST replication strategy;
For a Churn occuring every minute our strategy loses two times less blocks
than PAST;
Our replication strategy induces an average of twice less block transfers than
PAST.
30
"A quasi-static routing scheme for cross-connected storage area network." 2001. http://library.cuhk.edu.hk/record=b5890845.
Full textAbstract:
Yang Qin.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (leaves [65]-[67]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Thesis Overview --- p.7
Chapter 2 --- Storage Area Network(SAN) --- p.9
Chapter 2.1 --- Fibre Channel Protocol --- p.11
Chapter 2.2 --- Switched Fibre Channel SAN --- p.16
Chapter 2.2.1 --- Cascaded Topology --- p.17
Chapter 2.2.2 --- Meshed Topology --- p.17
Chapter 2.2.3 --- Cross-Connected Topology --- p.19
Chapter 2.2.4 --- Routing Scheme in Cross-Connected SAN --- p.21
Chapter 3 --- Path Switching --- p.24
Chapter 3.1 --- Cross-path Switching Principle --- p.24
Chapter 3.2 --- Capacity Assignment --- p.28
Chapter 3.3 --- Route Assignment --- p.31
Chapter 4 --- Path Switching in Cross-Connected SAN --- p.34
Chapter 4.1 --- Path Switching in SAN --- p.34
Chapter 4.1.1 --- Connectionless Traffic --- p.36
Chapter 4.1.2 --- Connection-Oriented Traffic --- p.39
Chapter 4.1.3 --- Mixed Traffic --- p.47
Chapter 4.2 --- Measurement Based Algorithm --- p.53
Chapter 4.3 --- Repetition Rate --- p.59
Chapter 5 --- Conclusion --- p.63
31
Jamoo, George. "Organisational implementation of storage area networks as a strategic knowledge managment tool." 2008. http://hdl.handle.net/2100/1101.
Full textAbstract:
University of Technology, Sydney.The growth of business data is proportional to growth in data storage systems. This growth in turn has driven management to examine more closely more effective ways of managing the functions of IT departments including the implementation of data storage systems. One such system is Storage Area Networks (SAN) which are complex and involve a vast array of different hardware, software, infrastructure setup and vendors. Given that, business operations in the twenty-first century are fast moving from traditional methods to more sophisticated technology-based systems and tools. It is arguable that successful implementation of new technologies is also dependent on many factors such as the efficient management of resources including intellectual and tangible assets. However these resources can be utilised much more efficiently and effectively through the application of knowledge management tools such as SAN systems which are well positioned to capture, store, use and re-use organisational knowledge for the purpose of enhancing the competitive position of the company. Some of the most important decisions facing organisations include: a) ongoing shortening of the development cycle of new products and services, b) effective and efficient communication with suppliers and experts from around the world, c) receiving and responding to customer feedback, and d) accessing research and development facilities around the world. However, in recent times, SAN systems as Knowledge Management tools have been rapidly emerging as critical tools for enhancing strategic advantage and for improving the organisation's standing. The study provides knowledge on Critical (key) Success Factors or CSFs for companies which have already implemented or plan to implement SAN in their business operations. Furthermore, companies may benefit from the results by utilising the assessment for planning and for strategic purposes. For example, as a result of better utilisation and better understanding of the implementation of SAN systems, cost savings and time savings may be achieved. In addition, simplifying business processes and improving quality and efficiency of organisational digital systems may lead to the additional benefits of improving the organisation's competitive advantage. Two separate focus groups were convened to assist the researcher by providing input into the model, as well as questionnaires. Questionnaires were then mailed to a randomly selected list of companies that have implemented SAN. The following statistical steps and procedures were used to analyse the collected data to develop the prediction model: 1) calculation of descriptive statistics; 2) examination of the non-response bias; 3) check of reliability and validity; 4) testing of the hypotheses; and 5) development of a prediction model As a result of the statistical analysis, seven CSFs for SAN system implementation success were identified. Some of the factors were identified to' make significant contributions to the success of a SAN implementation as a strategic knowledge management tool in organisations. Accordingly, this thesis provides both theoretical and practical new insights into the implementation of a SAN system and provides a framework for further development of the SAN and the IS research field. It is also believed that the findings of this thesis may help extend the existing knowledge on SAN and implementation research. The model used in this thesis is based on the industry conditions at the time and place when the research was conducted. The results of this research should be interpreted with caution, as this research is the first of its kind and like any other research is subject to a number of limitations, some due to the lack of information in the area of research as well as the limitations on the survey data.
32
Jain, Nitisha. "Performance Specific I/O Scheduling Framework for Cloud Storage." Thesis, 2015. http://etd.iisc.ernet.in/2005/3765.
Full textAbstract:
Virtualization is one of the important enabling technologies for Cloud Computing which facilitates sharing of resources among the virtual machines. However, it incurs performance overheads due to contention of physical devices such as disk and network bandwidth. Various I/O applications having different latency requirements may be executing concurrently on different virtual machines provisioned on a single server in Cloud data-centers. It is pertinent that the performance SLAs of such applications are satisfied through intelligent scheduling and allocation of disk resources.
The underlying disk scheduler at the server is unable to distinguish between the application requests being oblivious to the characteristics of these applications. Therefore, all the applica- tions are provided best effort services by default. This may lead to performance degradation for the latency sensitive applications. In this work, we propose a novel disk scheduling framework PriDyn (Dynamic Priority) which provides differentiated services to various I/O applications co-located on a single host based on their latency attributes and desired performance. The framework employs a scheduling algorithm which dynamically computes latency estimates for all concurrent I/O applications for a given system state. Based on these, an appropriate pri- ority assignment for the applications is determined which is taken into consideration by the underlying disk scheduler at the host while scheduling the I/O applications on the physical disk. The proposed scheduling framework is able to successfully satisfy QoS requirements for the concurrent I/O applications within system constraints. This has been verified through ex- tensive experimental analysis.
In order to realize the benefits of differentiated services provided by the PriDyn scheduler, proper combination of I/O applications must be ensured for the servers through intelligent meta-scheduling techniques at the Cloud data-center level. For achieving this, in the second part of this work, we extended the PriDyn framework to design a proactive admission control and scheduling framework PCOS (P rescient C loud I/O S cheduler). It aims to maximize to
Utilization of disk resources without adversely affecting the performance of the applications scheduled on the systems. By anticipating the performance of the systems running multiple I/O applications, PCOS prevents the scheduling of undesirable workloads on them in order to maintain the necessary balance between resource consolidation and application performance guarantees. The PCOS framework includes the PriDyn scheduler as an important component and utilizes the dynamic disk resource allocation capabilities of PriDyn for meeting its goals. Experimental validations performed on real world I/O traces demonstrate that the proposed framework achieves appreciable enhancements in I/O performance through selection of optimal I/O workload combinations, indicating that this approach is a promising step towards enabling QoS guarantees for Cloud data-centers.