Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: LAN; Linux; NFS. Includes bibliographical references (p. 91-92).

NFS is the dominant network file system used to share files between UNIX-derived operating system based hosts. At the onset of this research it was found that the tested NFS implementations did not achieve data writing throughput across a Gigabit Ethernet LAN commensurate with throughput achieved with the same hosts and network for packet streams generated without NFS. A series of tests were conducted involving variation of many system parameters directed towards identification of the bottleneck responsible for the large throughput ratio between non-NFS and NFS data transfers for high speed networks. Ultimately it was found that processor, disk, and network performance are not the source of low NFS throughput but rather it is caused by an avoidable NFS behavior, the effects of which worsen with increasing network latency.

Thesis (M.S.)--Mississippi State University. Department of Computer Science and Engineering. / Title from title screen. Includes bibliographical references.

<p>Detta arbete handlar om nätverksfilsystemsprotokollen SMB/CIFS, SMB2 och NFSv3. Arbetet baseras på artikeln ”A New Network File System is Born: Comparison of SMB2, CIFS, and NFS” som skrivits av Steven M. French på IBM, Samba Team. I den artikeln saknas det prestandatester och därför känns det relevant att göra prestandatester för att få fram vilket protokoll som har högst hastighet med olika filstorlekar i Windowsmiljö. Dessa tester utfördes mellan två Dell PowerEdge 2900 servar där den första agerade som klient och den andra som filserver. Testerna utfördes en gång utan nätverksfördröjningar (även kallat latens/latency) och en gång med. Detta resulterade i att vi fick stora skillnader i hur snabba protokollen är med och utan nätverksfördröjningar.</p> / <p>This essay is about the networkfilesystem protocols SMB/CIFS, SMB2 and NFSv3. The work is based on the article ”A New Network File System is Born: Comparison of SMB2, CIFS, and NFS” which is written by Steven M. French at IBM, Samba Team. In the article there are no performance tests, we found it relevant to do performance tests to see which networkfilesystem protocol was the fastest with different filesizes in a Windows client environment. These tests were performed between two Dell PowerEdge 2900 servers where one of them was acting client and the other one fileserver. The tests were done once without network latency and once with. This resulted in that we got differences in how fast the protocols were with and without network latency.</p>

Detta arbete handlar om nätverksfilsystemsprotokollen SMB/CIFS, SMB2 och NFSv3. Arbetet baseras på artikeln ”A New Network File System is Born: Comparison of SMB2, CIFS, and NFS” som skrivits av Steven M. French på IBM, Samba Team. I den artikeln saknas det prestandatester och därför känns det relevant att göra prestandatester för att få fram vilket protokoll som har högst hastighet med olika filstorlekar i Windowsmiljö. Dessa tester utfördes mellan två Dell PowerEdge 2900 servar där den första agerade som klient och den andra som filserver. Testerna utfördes en gång utan nätverksfördröjningar (även kallat latens/latency) och en gång med. Detta resulterade i att vi fick stora skillnader i hur snabba protokollen är med och utan nätverksfördröjningar. / This essay is about the networkfilesystem protocols SMB/CIFS, SMB2 and NFSv3. The work is based on the article ”A New Network File System is Born: Comparison of SMB2, CIFS, and NFS” which is written by Steven M. French at IBM, Samba Team. In the article there are no performance tests, we found it relevant to do performance tests to see which networkfilesystem protocol was the fastest with different filesizes in a Windows client environment. These tests were performed between two Dell PowerEdge 2900 servers where one of them was acting client and the other one fileserver. The tests were done once without network latency and once with. This resulted in that we got differences in how fast the protocols were with and without network latency.

Abstract not available

For thesis abstract select View Thesis Title, Contents and Abstract

An understanding of Input/Output data access patterns of applications is useful in several situations. First, gaining an insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps to create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the system in a closed loop. All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network file system traces are an important source of information that can be obtained non-intrusively and analyzed either online or offline. These traces are a sequence of primitive file system operations and their parameters. Simple counting, statistical analysis or deterministic search techniques are inadequate for discovering application-level semantics in the general case, because of the inherent variation and noise in realistic traces. In this paper, we describe a trace analysis methodology based on Profile Hidden Markov Models. We show that the methodology has powerful discriminatory capabilities that enables it to recognize applications based on the patterns in the traces, and to mark out regions in a long trace that encapsulate sets of primitive operations that represent higher-level application actions. It is robust enough that it can work around discrepancies between training and target traces such as in length and interleaving with other operations. We demonstrate the feasibility of recognizing patterns based on a small sampling of the trace, enabling faster trace analysis. Preliminary experiments show that the method is capable of learning accurate profile models on live traces in an online setting. We present a detailed evaluation of this methodology in a UNIX environment using NFS traces of selected commonly used applications such as compilations as well as on industrial strength benchmarks such as TPC-C and Postmark, and discuss its capabilities and limitations in the context of the use cases mentioned above.

The algorithms which control network routing are specific to the network because the algorithms are designed to take advantage of that network's topology. The "goodness" of a network includes such criteria as a simple routing algorithm and a simple routing algorithm would increase the use of the shuffle-exchange network.

No description available.