Skip to content
Switch branches/tags
Go to file
Cannot retrieve contributors at this time
1212 lines (1104 sloc) 95.2 KB
% This is "sig-alternate.tex" V2.1 April 2013
% This file should be compiled with V2.5 of "sig-alternate.cls" May 2012
% This example file demonstrates the use of the 'sig-alternate.cls'
% V2.5 LaTeX2e document class file. It is for those submitting
% articles to ACM Conference Proceedings WHO DO NOT WISH TO
% The 'sig-alternate.cls' file will produce a similar-looking,
% albeit, 'tighter' paper resulting in, invariably, fewer pages.
% ----------------------------------------------------------------------------------------------------------------
% This .tex file (and associated .cls V2.5) produces:
% 1) The Permission Statement
% 2) The Conference (location) Info information
% 3) The Copyright Line with ACM data
% 4) NO page numbers
% as against the acm_proc_article-sp.cls file which
% DOES NOT produce 1) thru' 3) above.
% Using 'sig-alternate.cls' you have control, however, from within
% the source .tex file, over both the CopyrightYear
% (defaulted to 200X) and the ACM Copyright Data
% (defaulted to X-XXXXX-XX-X/XX/XX).
% e.g.
% \CopyrightYear{2007} will cause 2007 to appear in the copyright line.
% \crdata{0-12345-67-8/90/12} will cause 0-12345-67-8/90/12 to appear in the copyright line.
% ---------------------------------------------------------------------------------------------------------------
% This .tex source is an example which *does* use
% the .bib file (from which the .bbl file % is produced).
% REMEMBER HOWEVER: After having produced the .bbl file,
% and prior to final submission, you *NEED* to 'insert'
% your .bbl file into your source .tex file so as to provide
% ONE 'self-contained' source file.
% ================= IF YOU HAVE QUESTIONS =======================
% Questions regarding the SIGS styles, SIGS policies and
% procedures, Conferences etc. should be sent to
% Adrienne Griscti (
% Technical questions _only_ to
% Gerald Murray (
% ===============================================================
% For tracking purposes - this is V2.0 - May 2012
\usepackage{listings} % Include the listings-package
% Fixing type issue
\lstset{ %
backgroundcolor=\color{white}, % choose the background color; you must add \usepackage{color} or \usepackage{xcolor}
basicstyle=\ttfamily\scriptsize, % the size of the fonts that are used for the code
breakatwhitespace=false, % sets if automatic breaks should only happen at whitespace
breaklines=true, % sets automatic line breaking
captionpos=b, % sets the caption-position to bottom
commentstyle=\color{mygreen}, % comment style
deletekeywords={...}, % if you want to delete keywords from the given language
escapeinside={\%*}{*)}, % if you want to add LaTeX within your code
extendedchars=true, % lets you use non-ASCII characters; for 8-bits encodings only, does not work with UTF-8
frame=single, % adds a frame around the code
keepspaces=true, % keeps spaces in text, useful for keeping indentation of code (possibly needs columns=flexible)
keywordstyle=\color{blue}, % keyword style
% language=C, % the language of the code
morekeywords={property,set,is,type, constant, enumeration, end, applies, to, inherit, of, *,...}, % if you want to add more keywords to the set
numbers=left, % where to put the line-numbers; possible values are (none, left, right)
numbersep=5pt, % how far the line-numbers are from the code
numberstyle=\tiny\color{mygray}, % the style that is used for the line-numbers
rulecolor=\color{black}, % if not set, the frame-color may be changed on line-breaks within not-black text (e.g. comments (green here))
showspaces=false, % show spaces everywhere adding particular underscores; it overrides 'showstringspaces'
showstringspaces=false, % underline spaces within strings only
showtabs=false, % show tabs within strings adding particular underscores
stepnumber=1, % the step between two line-numbers. If it's 1, each line will be numbered
stringstyle=\color{mymauve}, % string literal style
tabsize=2, % sets default tabsize to 2 spaces
title=\lstname % show the filename of files included with \lstinputlisting; also try caption instead of title
\providecommand{\keywords}[1]{\textbf{\textit{Index terms---}} #1}
% \usepackage[pdftex]{graphicx}
% declare the path(s) where your graphic files are
% \graphicspath{{../pdf/}{../jpeg/}}
% and their extensions so you won't have to specify these with
% every instance of \includegraphics
% \DeclareGraphicsExtensions{.pdf,.jpeg,.png}
% or other class option (dvipsone, dvipdf, if not using dvips). graphicx
% will default to the driver specified in the system graphics.cfg if no
% driver is specified.
% \usepackage[dvips]{graphicx}
% declare the path(s) where your graphic files are
% \graphicspath{{../eps/}}
% and their extensions so you won't have to specify these with
% every instance of \includegraphics
% \DeclareGraphicsExtensions{.eps}
% paper title
% can use linebreaks \\ within to get better formatting as desired
\title{A Trace-Based Study of SMB Network File System Workloads in an Academic Enterprise}
\author{\IEEEauthorblockN{Paul Wortman and John Chandy}
\IEEEauthorblockA{Department of Electrical and Computer Engineering\\
University of Connecticut, USA\\
(paul.wortman, john.chandy)
% make the title area
Storage system traces are important for examining real-world applications, studying potential bottlenecks, as well as driving benchmarks in the evaluation of new system designs.
While file system traces have been well-studied in earlier work, it has been some time since the last examination of the SMB network file system.
The purpose of this work is to continue previous SMB studies to better understand the use of the protocol in a real-world production system in use at the University of Connecticut.
The main contribution of our work is the exploration of I/O behavior in modern file system workloads as well as new examinations of the inter-arrival times and run times for I/O events.
We further investigate if the recent standard models for traffic remain accurate.
Our findings reveal interesting data relating to the number of read and write events. We notice that the number of read and write events is significantly less than creates and the average number of bytes exchanged per I/O is much smaller than what has been seen in previous studies.
%the average of bytes transferred over the wire is much smaller than what has been seen in previous studies.
Furthermore, we find an increase in the use of metadata for overall network communication that can be taken advantage of through the use of smart storage devices.
\keywords{Server Message Block, Storage System Tracing,
Network Benchmark, Storage Systems, Distributed I/O.}
% \item Why is it important to re-examine the SMB protocol?
% \item Why does examination of network use matter?
% \item Need to ensure hash of data and not saving any of the original traffic packets.
Over the last twenty years, data storage provisioning has been centralized through the
use of network file systems. The architectures of these storage systems can vary from
storage area networks (SAN), network attached storage (NAS), clustered file systems,
hybrid storage, amongst others. However, the front-end client-facing network file
system protocol in most enterprise IT settings tends to be, for the most part, solely
SMB (Server Message Block) because of the preponderance of Microsoft (MS) Windows clients.
While there are other network file systems such as Network File System (NFS) and
clustered file systems such as Ceph, PanFS, and OrangeFS, they tend to be used less
extensively in most non-research networks.
In spite of the prevalence of SMB usage within most enterprise networks, there has
been very little analysis of SMB workloads in prior academic research. The last major study
of SMB was more than a decade ago~\cite{leung2008measurement}, and the nature of storage
usage has changed dramatically over the last decade.
It is always important to revisit commonly used protocols to examine their use in comparison to the expected use case(s). This is doubly so for network communications because the nuances of networked data exchange can greatly influence the effectiveness and efficiency of a chosen protocol.
Since an SMB-based trace study has not been undertaken
recently, we took a look at its current implementation and use in a large university network.
%Due to the sensitivity of the captured information, we ensure that all sensitive information is hashed and that the original network captures are not saved.
Our study is based on network packet traces collected on
the University of Connecticut's
centralized storage facility over a period of three weeks in May 2019. This trace-driven analysis can help in the design of future storage products as well as providing data for future performance benchmarks.
%Benchmarks are important for the purpose of developing technologies as well as taking accurate metrics. The reasoning behind this tracing capture work is to eventually better develop accurate benchmarks for network protocol evaluation.
Benchmarks allow for the stress testing of various aspects of a system (e.g. network, single system). Aggregate data analysis collected from traces can lead to the development of synthetic benchmarks. Traces can also expose systems patterns that can also be reflected in synthetic benchmarks. Finally, the traces themselves can drive system simulations that can be used to evaluate prospective storage architectures.
% \item \textbf{Why?:} Benchmarks allow for the stress testing of different/all aspects of a system (e.g. network, single system).
% \item \textbf{How:} There are three ``steps'' to creating a benchmark.
% \begin{enumerate}
% \item Take a trace of an existing system
% \begin{itemize}
% \item This is important because this information is how one is able to compare the expected actions of a system (theory) against the traced actions (practice) of the system. Leads to the development of later synthetic benchmarks.
% \end{itemize}
% \item Determine which aspects of the trace of said system (in an educated arbitrary way) are most representative of ``what occurred'' during the tracing of the system. Leads to discovery of habits/patterns of the system; which is later used for synthetic benchmark.
% \item Use discovered information to produce benchmark
% \begin{itemize}
% \item Done by either running a repeat of the trace of synthetic benchmark created using trends from trace.
% \end{itemize}
% \end{enumerate}
We created a new tracing system to collect data from the university
storage network system. The tracing system was built around the high-speed PF\_RING packet capture system~\cite{pfringWebsite} and required the use of proper hardware and software to handle incoming data%\textcolor{blue}{; however interaction with later third-party code did require re-design for processing of the information}
. We also created a new trace capture format based on the DataSeries structured data format developed by HP~\cite{DataSeries}.
% PF\_RING section
%The addition of PF\_RING lends to the tracing system by minimizing the copying of packets which, in turn, allows for more accurate timestamping of incoming traffic packets being captured ~\cite{Orosz2013,skopko2012loss,pfringWebsite,PFRINGMan}.
PF\_RING acts as a kernel module that aids in minimizing packet loss/timestamping issues by not passing packets through the kernel data structures.
%The other reason PF\_RING is instrumental is that it functions with the 10Gb/s hardware that was installed into the Trace1 server; allowing for full throughput from the network tap on the UITS system. \\
% DataSeries + Code section
DataSeries was modified to filter specific SMB protocol fields along with the writing of analysis tools to parse and dissect the captured packets. Specific fields were chosen to be the interesting fields kept for analysis.
%It should be noted that this was done originally arbitrarily and changes/additions have been made as the value of certain fields were determined to be worth examining; e.g. multiple runs were required to refine the captured data for later analysis.
The DataSeries data format allowed us to create data analysis code that focuses on I/O events and ID tracking: e.g. Tree Identifier (TID) and User Identifier (UID). The future vision for this information is to combine ID tracking with the OpLock information in order to track resource sharing of the different clients on the network, as well as using IP information to recreate communication in a larger network trace to establish a better benchmark.
%Focus should be aboiut analysis and new traces
The contributions of this work are the new traces of SMB traffic over a large university network as well as new analysis of this traffic. Our new examination of the captured data reveals that despite the streamlining of the CIFS/SMB protocol to be less "chatty", the majority of SMB communication is still metadata based I/O rather than actual data I/O. We found that read operations occur in greater numbers and cause a larger overall number of bytes to pass over the network. Additionally, the average number of bytes transferred for each write I/O is smaller than that of the average read operation. We also find that the current standard for modeling network I/O holds for the majority of operations, while a more representative model needs to be developed for reads.
%\textcolor{red}{Add information about releasing the code?}
\section{Related Work}
Study & Date of Traces & FS/Protocol & Network FS & Trace Approach & Workload \\ \hline
Ousterhout, \textit{et al.}~\cite{ousterhout1985trace} & 1985 & BSD & & Dynamic & Engineering \\ \hline
Ramakrishnan, \textit{et al.}~\cite{ramakrishnan1992analysis} & 1988-89 & VAX/VMS & x & Dynamic & Engineering, HPC, Corporate \\ \hline
Baker, \textit{et al.}~\cite{baker1991measurements} & 1991 & Sprite & x & Dynamic & Engineering \\ \hline
Gribble, \textit{et al.}~\cite{gribble1998self} & 1991-97 & Sprite, NFS, VxFS & x & Both & Engineering, Backup \\ \hline
Douceur and Bolosky~\cite{douceur1999large} & 1998 & FAT, FAT32, NTFS & & Snapshots & Engineering \\ \hline
Vogels~\cite{vogels1999file} & 1998 & FAT, NTFS & & Both & Engineering, HPC \\ \hline
Zhou and Smith~\cite{zhou1999analysis} & 1999 & VFAT & & Dynamic & PC \\ \hline
Roselli, \textit{et al.}~\cite{roselli2000comparison} & 1997-00 & VxFS, NTFS & & Dynamic & Engineering, Server \\ \hline
%Malkani, \textit{et al.}~\cite{malkani2003passive} & 2001 & NFS & x & Dynamic & Engineering, Email \\ \hline
Agrawal, \textit{et al.}~\cite{agrawal2007five} & 2000-2004 & FAT, FAT32, NTFS & & Snapshots & Engineering \\ \hline
Ellard, \textit{et al.}~\cite{ellard2003passive} & 2003 & NFS & x & Dynamic & Engineering, Email \\ \hline
Leung, \textit{et al.}~\cite{leung2008measurement} & 2007 & CIFS & x & Dynamic & Corporate, Engineering \\ \hline
%Traeger, \textit{et al.}~\cite{traeger2008nine} & 2008 & FUSE & x & Snapshots & Backup \\ \hline
Vrable, \textit{et al.}~\cite{vrable2009cumulus} & 2009 & FUSE & x & Snapshots & Backup \\ \hline
Benson, \textit{et al.}~\cite{benson2010network} & 2010 & AFS, MapReduce, NCP, SMB & x & Dynamic & Academic, Corporate \\ \hline
Chen, \textit{et al.}~\cite{chen2012interactive} & 2012 & MapReduce & x & Dynamic & Corporate \\ \hline
This paper & 2020 & SMB & x & Dynamic & Academic, Engineering, Backup \\ \hline
\caption{Summary of major file system studies over the past decades. For each study the tables shows the dates of the trace data, the file system or protocol studied, whether it involved network file systems, the trace methodology used, and the workloads studied. Dynamic trace studies are those that involve traces of live requests. Snapshot studies involve snapshots of file system contents.}
\label{Previous Advances Due to Testing}
%In this section we discuss previous studies examining traces and testing that has advanced benchmark development.
We summarize major works in trace study in Table~\ref{tbl:studySummary}.
%In addition we examine issues that occur with traces and the assumptions in their study.
Tracing collection and analysis from previous studies have provided important insights and lessons such as an observations of read/write event changes, overhead concerns originating in system implementation, bottlenecks in communication, and other revelations found in the traces.
Previous tracing work has shown that one of the largest and broadest hurdles to tackle is that traces (and benchmarks) must be tailored to the system being tested. There are always some generalizations taken into account, but these generalizations can also be a major source of error (e.g. timing, accuracy, resource usage) ~\cite{vogels1999file,ellard2003passive,seltzer2003nfs,anderson2004buttress,Orosz2013,dabir2007bottleneck,skopko2012loss,traeger2008nine,ruemmler1992unix}.
To produce a benchmark with high fidelity one needs to understand not only the technology being used but how it is being implemented within the system~\cite{roselli2000comparison,traeger2008nine,ruemmler1992unix}. All these aspects lend to the behavior of the system; from timing and resource elements to how the managing software governs actions~\cite{douceur1999large,ellard2003passive,seltzer2003nfs}. Furthermore, in pursuing this work one may find unexpected results and learn new things through examination~\cite{leung2008measurement,roselli2000comparison,seltzer2003nfs}.
These studies are required in order to evaluate the development of technologies and methodologies along with furthering knowledge of different system aspects and capabilities. As has been pointed out by past work, the design of systems is usually guided by an understanding of the file system workloads and user behavior.
%It is for that reason that new studies are constantly performed by the science community, from large scale studies to individual protocol studies~\cite{leung2008measurement,vogels1999file,roselli2000comparison,seltzer2003nfs,anderson2004buttress}. Even within these studies, the information gleaned is only as meaningful as the considerations of how the data is handled.
%The work done by
Leung et al.~\cite{leung2008measurement} found that
%observations related to the infrequency of files to be shared by more than one client.
over 67\% of files were never opened by more than one client
%Work by Leung \textit{et al.} led to a series of observations, from the fact that files are rarely re-opened to finding
and that read-write access patterns are more frequent.
%If files were shared it was rarely concurrently and usually as read-only; where 5\% of files were opened by multiple clients concurrently and 90\% of the file sharing was read only.
%Concerns of the accuracy achieved of the trace data was due to using standard system calls as well as errors in issuing I/Os leading to substantial I/O statistical errors.
% Anderson Paper
%The 2004 paper by
Anderson et al.~~\cite{anderson2004buttress} found that a
%has the following observations. A
source of decreased precision came from the kernel overhead for providing timestamp resolution. This would introduce substantial errors in the observed system metrics due to the use inaccurate tools when benchmarking I/O systems. These errors in perceived I/O response times can range from +350\% to -15\%.
%I/O benchmarking widespread practice in storage industry and serves as basis for purchasing decisions, performance tuning studies and marketing campaigns.
Issues of inaccuracies in scheduling I/O can result in as much as a factor 3.5 difference in measured response time and factor of 26 in measured queue sizes. These inaccuracies pose too much of an issue to ignore.
Orosz and Skopko~\cite{Orosz2013} examined the effect of the kernel on packet loss and
%in their 2013 paper~\cite{Orosz2013}. Their work
showed that when taking network measurements, the precision of the timestamping of packets is a more important criterion than low clock offset, especially when measuring packet inter-arrival times and round-trip delays at a single point of the network. One solution for network capture is the tool Dumpcap. However, the concern with Dumpcap is that it is a single threaded application and was suspected to be unable to handle new arriving packets due to the small size of the kernel buffer. Work by
Dabir and Matrawy%, in 2008
~\cite{dabir2007bottleneck} attempted to overcome this limitation by using two semaphores to buffer incoming strings and improve the writing of packet information to disk.
%Narayan and Chandy examined the concerns of distributed I/O and the different models of parallel application I/O.
%There are five major models of parallel application I/O. (1) Single output file shared by multiple nodes. (2) Large sequential reads by a single node at the beginning of computation and large sequential writes by a single node at the end of computation. (3) Checkpointing of states. (4) Metadata and read intensive (e.g. small data I/O and frequent directory lookups for reads).
%Due to the striping of files across multiple nodes, this can cause any read or write to access all the nodes; which does not decrease the inter-arrival times (IATs) seen. As the number of I/O operations increases and the number of nodes increases, the IAT times decreased.
%Observations from
%in a 2012 paper
~\cite{skopko2012loss} examined the concerns of software-based capture solutions and observed that
%. The main observation was
software solutions relied heavily on OS packet processing mechanisms. Furthermore, depending on the mode of operation (e.g. interrupt or polling), the timestamping of packets would change.
As seen in previous trace work~\cite{leung2008measurement,roselli2000comparison,seltzer2003nfs}, the general perceptions of how computer systems are being used versus their initial purpose have allowed for great strides in eliminating actual bottlenecks rather than spending unnecessary time working on imagined bottlenecks. Without illumination of these underlying actions (e.g. read-write ratios, file death rates, file access rates) these
issues cannot be readily tackled.
%\subsection{Server Message Block}
The Server Message Block (SMB) is an application-layer network protocol mainly used for providing shared access to files, shared access to printers, shared access to serial ports, miscellaneous communications between nodes on the network, as well as providing an authenticated inter-process communication mechanism.
%The majority of usage for the SMB protocol involves Microsfot Windows. Almost all implementations of SMB servers use NT Domain authentication to validate user-access to resources
The SMB 1.0 protocol~\cite{SMB1Spec} has been found to have high/significant impact on performance due to latency issues. Monitoring revealed a high degree of ``chattiness'' and disregard of network latency between hosts. Solutions to this problem were included in the updated SMB 2.0 protocol which decreases ``chattiness'' by reducing commands and sub-commands from over a hundred to nineteen~\cite{SMB2Spec}. Additional changes, most significantly increased security, were implemented in the SMB 3.0 protocol (previously named SMB 2.2). % XXX citations for SMB specs for different versions?
%\textcolor{red}{\textbf{Add information about SMB 2.X/3?}}
\caption{Visualization of Packet Capturing System}
The rough order of communication for SMB session file interaction contains five steps. First is a negotiation where a Microsoft SMB Protocol dialect is determined. Next, a session is established to determine the share-level security. After this, the Tree ID (TID) is determined for the share to be connected to as well as a file ID (FID) for a file requested by the client. From this establishment, I/O operations are performed using the FID given in the previous step. %\textcolor{green}{The SMB packet header is shown in Figure~\ref{fig:smbPacket}.}
% Information relating to the capturing of SMB information
The only data that needs to be tracked from the SMB traces are the UID (User ID) and TID for each session. The SMB commands also include a MID (Multiplex ID) value that is used for tracking individual packets in each established session, and a PID (Process ID) that tracks the process running the command or series of commands on a host.
For the purposes of our tracing, we do not track the MID or PID information.
Some nuances of the SMB protocol I/O to note are that SMB/SMB2 write requests are the actions that push bytes over the wire while for SMB/SMB2 read operations it is the response packets.
% \item SMB/SMB2 write request is the command that pushes bytes over the wire. \textbf{Note:} the response packet only confirms their arrival and use (e.g. writing).
% \item SMB/SMB2 read response is the command that pushes bytes over the wire. \textbf{Note:} The request packet only asks for the data.
% Make sure to detail here how exactly IAT/RT are each calculated
%\textcolor{red}{Add writing about the type of packets used by SMB. Include information about the response time of R/W/C/General (to introduce them formally; not sure what this means.... Also can bring up the relation between close and other requests.}
%\textcolor{blue}{It is worth noting that for the SMB2 protocol, the close request packet is used by clients to close instances of file that \textcolor{green}{were opened} with a previous create request packet.}
% \includegraphics[width=0.5\textwidth]{./images/smbPacket.jpg}
% \caption{SMB Packet \textcolor{green}{Header Format}}
% \label{fig:smbPacket}
%\subsection{Issues with Tracing}
%\label{Issues with Tracing}
%There are three general approaches to creating a benchmark based on a trade-off between experimental complexity and resemblance to the original application. (1) Connect the system to a production test environment, run the application, and measure the application metrics. (2) Collect traces from running the application and replay them (after possible modification) back on the test I/O system. (3) Generate a synthetic workload and measure the system performance.
%The majority of benchmarks attempt to represent a known system and structure on which some ``original'' design/system was tested. While this is all well and good, there are many issues with this sort of approach; temporal and spatial scaling concerns, timestamping and buffer copying, as well as driver operation for capturing packets~\cite{Orosz2013,dabir2007bottleneck,skopko2012loss}. Each of these aspects contribute to the initial problems with dissection and analysis of the captured information. For example, inaccuracies in scheduling I/Os may result in as much as a factor of 3.5 differences in measured response time and factor of 26 in measured queue sizes; differences that are too large to ignore~\cite{anderson2004buttress}.
%Dealing with timing accuracy and high throughput involves three challenges. (1) Designing for dealing with peak performance requirements. (2) Coping with OS timing inaccuracies. (3) Working around unpredictable OS behavior; e.g. mechanisms to keep time and issue I/Os or performance effects due to interrupts.
%Temporal scaling refers to the need to account for the nuances of timing with respect to the run time of commands; consisting of computation, communication and service. A temporally scalable benchmarking system would take these subtleties into account when expanding its operation across multiple machines in a network. While these temporal issues have been tackled for a single processor (and even somewhat for cases of multi-processor), these same timing issues are not properly handled when dealing with inter-network communication. Inaccuracies in packet timestamping can be caused due to overhead in generic kernel-time based solutions, as well as use of the kernel data structures ~\cite{PFRINGMan,Orosz2013}.
%Spatial scaling refers to the need to account for the nuances of expanding a benchmark to incorporate a number of machines over a network. A system that properly incorporates spatial scaling is one that would be able to incorporate communication (even in varying intensities) between all the machines on a system, thus stress testing all communicative actions and aspects (e.g. resource locks, queueing) on the network.
\section{Packet Capturing System}
%In this section, we describe the packet capturing system as well as decisions made that influence its capabilities. We illustrate the existing university network filesystem as well as our methods for ensuring high-speed packet capture. Then, we discuss the analysis code we developed for examining the captured data.
% and on the python dissection code we wrote for performing traffic analysis.
\subsection{University Storage System Overview}
We collected traces from
the University of Connecticut Information Technology Services (ITS)
centralized storage server%The \textcolor{red}{UITS system}
, which consists of five Microsoft file server cluster nodes. These blade servers are used to host SMB file shares for various departments at
the university
as well as personal drive share space for faculty, staff and students, along with at least one small group of users. Each server is capable of handling 1~Gb/s of traffic in each direction (e.g. outbound and inbound traffic). Altogether, the five-blade server system can in theory handle 5~Gb/s of data traffic in each direction.
%Some of these blade servers have local storage but the majority do not have any.
The blade servers serve as SMB heads, but the actual storage is served by a pair of NetApp SAN appliance nodes that sit behind the SMB heads. The NetApp storage provides 588~TB of usable disk storage fronted by 4~TB of flash cache. This system does not currently implement load balancing. Instead, the SMB servers are set up to spread the load with a static distribution across four of the active cluster nodes while the passive fifth node takes over in the case of any other nodes going down.% (e.g. become inoperable or crash).
The actual tracing was performed with a tracing server connected to a switch outfitted with a packet duplicating element as shown in the topology diagram in Figure~\ref{fig:captureTopology}. A 10~Gbps network tap was installed in the file server switch, allowing our storage server to obtain a copy of all network traffic going to the 5 file servers. The reason for using 10~Gbps hardware is to help ensure that the system is able to capture information on the network at peak theoretical throughput.
\subsection{High-speed Packet Capture}
%The packet capturing aspect of the tracing system is fairly straight forward.
%On top of the previously mentioned alterations to the system (e.g. PF\_RING), the capture of packets is done through the use of \textit{tshark}, \textit{pcap2ds}, and \textit{inotify} programs.
%The broad strokes are that incoming SMB/CIFS information comes from the university's network. All packet and transaction information is passed through a duplicating switch that then allows for the tracing system to capture these packet transactions over a 10 Gb port. These packets are
%passed along to the \textit{tshark} packet collection program which records these packets into a cyclical capturing ring. A watchdog program (\textit{inotify}) watches the directory where all of these packet-capture (pcap) files are being stored. As a new pcap file is completed \textit{inotify} passes the file to \textit{pcap2ds} along with what protocol is being examined (i.e. SMB). The \textit{pcap2ds} program reads through the given pcap files,
In order to maximize our faithful capture of the constant rate of traffic, we implement on the tracing server an ntop~\cite{ntopWebsite} solution called PF\_RING~\cite{pfringWebsite} to dramatically improve the storage server's packet capture speed.
%A license was obtained for scholastic use of PF\_RING. PF\_RING implements a ring buffer to provide fast and efficient packet capturing. Having implemented PF\_RING, the next step was to
We had to tune an implementation of \texttt{tshark} (wireshark's terminal pcap implementation) to maximize the packet capture rate.
%and dissection into the DataSeries format~\cite{dataseriesGit}.
%The assumption being made is that PF\_RING tackles and takes care of the concerns of packets loss due to buffer size, storage, and writing. \textit{tshark} need only read in those packets and generate the necessary DataSeries (ds) files.
\texttt{tshark} outputs \texttt{.pcap} files which captures all of the data present in packets on the network. We configure \texttt{tshark} so that it only captures SMB packets. Furthermore, to optimize this step, a capture ring buffer flag is used to minimize the amount of space used to write \texttt{.pcap} files, while optimizing the amount of time to
%\textit{pcap2ds} can
filter data from the \texttt{.pcap} files.
The file size used was in a ring buffer where each file captured was 64000 kB.
% This causes tshark to switch to the next file after it reaches a determined size.
%To simplify this aspect of the capturing process, the entirety of the capturing, dissection, and permanent storage was all automated through watch-dog scripts.
The \texttt{.pcap} files from \texttt{tshark} do not lend themselves to easy data analysis, so we translate these files into \texttt{.ds} files using the DataSeries~\cite{DataSeries} format, an XML-based structured data format designed to be self-descriptive, storage and access efficient, and highly flexible.
%The system for taking captured \texttt{.pcap} files and writing them into the DataSeries format (i.e. \texttt{.ds}) does so by first creating a structure (based on a pre-written determination of the data desired to capture). Once the code builds this structure, it then reads through the capture traffic packets while dissecting and filling in the prepared structure with the desired information and format.
For our purposes, there is no need to track all data that is exchanged, only information that illuminates the behavior of the clients and servers that interact over the network (i.e. I/O transactions). It should also be noted that all sensitive information being captured by the tracing system is hashed to protect the privacy of the users of the storage system. Furthermore, the DataSeries file retains only the first 512 bytes of the SMB packet - enough to capture the SMB header information that contains the I/O information we seek, while the body of the SMB traffic is not retained in order to better ensure privacy. The reasoning for this limit was to allow for capture of longer SMB AndX message chains due to negotiated \textit{MaxBufferSize}. It is worth noting that in the case of larger SMB headers, some information is lost, however this is a trade-off by the university to provide, on average, the correct sized SMB header but does lead to scenarios where some information may be captured incompletely. This scenario only occurs in the cases of large AndX Chains in the SMB protocol, since the SMB header for SMB 2 is fixed at 72 bytes. In those scenarios the AndX messages specify only a single SMB header with the rest of the AndX Chain attached in a series of block pairs.
\subsection{DataSeries Analysis}
Building upon existing code for the interpretation and dissection of the captured \texttt{.ds} files, we developed C/C++ code to examine the captured traffic information. From this analysis, we are able to capture read, write, create and general I/O information at both a global scale and individual tracking ID (UID/TID) level. In addition, read and write buffer size information is tracked, as well as the inter-arrival and response times. Also included in this data is oplock information and IP addresses. The main contribution of this step is to aggregate observed data for later interpretation of the results.
This step also creates an easily digestible output that can be used to re-create all tuple information for SMB/SMB2 sessions that are witnessed over the entire time period.
Sessions are any communication where a valid UID and TID is used.
%\textcolor{red}{Add information about if the code will be publically shared?}
%\subsection{Python Dissection}
%The final step of our SMB/SMB2 traffic analysis system is the dissection of the \texttt{AnalysisModule} output using the pandas data analysis library~\cite{pandasPythonWebsite}. The pandas library is a python implementation similar to R. In this section of the analysis structure, the generated text file is tokenized and placed into specific DataFrames representing the data seen for each 15 minute period. The python code is used for the analysis and further dissection of the data. This is where the cumulative distribution frequency and graphing of collected data is performed. Basic analysis and aggregation is also performed in this part of the code. This analysis includes the summation of individual session I/O (e.g. reads, writes, creates) as well as the collection of inter arrival time data and response time data.
\section{Data Analysis}
% & Academic Engineering \\ \hline
%Maximum Tuples in 15-min Window & 36 \\ %\hline
%Total Tuples Seen & 2721 \\ \hline
%\textcolor{red}{Maximum Sessions in 15-min Window} & 35 \\ %\hline
%Maximum Non-Session in 15-min Window & 2 \\ \hline
Total Days & 21 \\ %\hline
Total Sessions & 2,413,589 \\ %\hline
%Total Non-Sessions & 279006484 \\ \hline
Number of SMB Operations & 281,419,686 (100\%)\\ %\hline
Number of General SMB Operations & 210,705,867 (74.87\%) \\ %\hline
Number of Creates & 54,486,043 (19.36\%) \\ %\hline
Number of Read I/Os & 8,355,557 (2.97\%) \\ %\hline
Number of Write I/Os & 7,872,219 (2.80\%) \\ %\hline
R:W I/O Ratio & 1.06 \\ \hline
Total Data Read (GB) & 0.97 \\ %\hline
Total Data Written (GB) & 0.6 \\ %\hline
Average Read Size (B) & 144 \\ %\hline
Average Write Size (B) & 63 \\ \hline
%Percentage of Read Bytes of Total Data & 99.4\% \\ %\hline
%Percentage of Written Bytes of Total Data & 0.6\% \\ %\hline
%Total R:W Byte Ratio & 166.446693744549 \\ %\hline
%Average R:W Byte Ratio & 0.253996031053668 \\ \hline
\caption{\label{tbl:TraceSummaryTotal}Summary of Trace I/O Statistics for the time of April 30th, 2019 to May 20th, 2019}
% NOTE: Not sure but this reference keeps referencing the WRONG table
shows a summary of the SMB traffic captured, statistics of the I/O operations, and read/write data exchange observed for the network filesystem. This information is further detailed in Table~\ref{tbl:SMBCommands}, which illustrates that the majority of I/O operations are general (74.87\%). As shown in %the bottom part of
Table~\ref{tbl:SMBCommands2}, general I/O includes metadata commands such as connect, close, query info, etc.
Our examination of the collected network filesystem data revealed interesting patterns for the current use of CIFS/SMB in a large academic setting. The first is that there is a major shift away from read and write operations towards more metadata-based ones. This matches the last CIFS observations made by Leung et.~al.~\cite{leung2008measurement} that files were being generated and accessed infrequently. The change in operations are due to a movement of use activity from reading and writing data to simply checking file and directory metadata. However, since the earlier study, SMB has transitioned to the SMB2 protocol which was supposed to be less "chatty". As a result, we would expect fewer general SMB operations. Table~\ref{tbl:SMBCommands} shows a breakdown of SMB and SMB2 usage over the time period of May. From this table, one can see that the SMB2 protocol makes up $99.14$\% of total network operations compared to just $0.86$\% for SMB, indicating that most clients have upgraded to SMB2. However, $74.66$\% of SMB2 I/O are still general operations. Contrary to the purpose of implementing the SMB2 protocol, there is still a large amount of general I/O.
%While CIFS/SMB protocol has less metadata operations, this is due to a depreciation of the SMB protocol commands, therefore we would expect to see less total operations (e.g. $0.04$\% of total operations).
%The infrequency of file activity is further strengthened by our finding that within a week long window of time there are no Read or Write inter arrival times that can be calculated.
%\textcolor{red}{XXX we are going to get questioned on this. its not likely that there are no IATs for reads and writes}
%General operations happen at very high frequency with inter arrival times that were found to be relatively short (1317$\mu$s on average), as shown in Table~\ref{tbl:PercentageTraceSummary}.
Taking a deeper look at the SMB2 operations, shown in %the bottom half of
Table~\ref{tbl:SMBCommands2}, we see that $9.06$\% of the general operations are negotiate commands. These are commands sent by the client to notify the server which dialects of the SMB2 protocol the client can understand. The three most common commands are close, tree connect, and query info.
The latter two relate to metadata information of shares and files accessed. However, the close operation corresponds to the create operations. Note that the create command is also used as an open file. Notice that the number of closes is greater than the total number of create operations by $9.35$\%. These extra close operations are most likely due to applications doing multiple closes that do not need to be performed.
I/O Operation & SMB & SMB2 & Both \\ \hline
General Operations & 2,418,980 & 208,286,887 & 210,705,867 \\
General \% & 99.91\% & 74.66\% & 74.87\% \\ %\hline
Create Operations & 0 & 54,486,043 & 54,486,043 \\
Create \% & 0.00\% & 19.53\% & 19.36\% \\
Read Operations & 1,931 & 8,353,626 & 8,355,557 \\
Read \% & 0.08\% & 2.99\%& 2.97\%\\
Write Operations & 303 & 7,871,916 & 7,872,219 \\
Write \% & 0.01\% & 2.82\% & 2.80\% \\ \hline
Combine Protocol Operations & 2,421,214 & 278,998,472 & 281,419,686 \\
Combined Protocols \% & 0.86\% & 99.14\% & 100\% \\ \hline
\caption{\label{tbl:SMBCommands}Percentage of SMB and SMB2 Protocol Commands for the Time of April 30th, 2019 to May 20th, 2019}
SMB2 General Operation & \multicolumn{2}{|c|}{Occurrences} & Percentage of Total \\ \hline
Close & \multicolumn{2}{|c|}{80,114,256} & 28.71\% \\
Tree Connect & \multicolumn{2}{|c|}{48,414,491} & 17.35\% \\
Query Info & \multicolumn{2}{|c|}{27,155,528} & 9.73\% \\
Negotiate & \multicolumn{2}{|c|}{25,276,447} & 9.06\% \\
Tree Disconnect & \multicolumn{2}{|c|}{9,773,361} & 3.5\% \\
IOCtl & \multicolumn{2}{|c|}{4,475,494} & 1.6\% \\
Set Info & \multicolumn{2}{|c|}{4,447,218} & 1.59\% \\
Query Directory & \multicolumn{2}{|c|}{3,443,491} & 1.23\% \\
Session Setup & \multicolumn{2}{|c|}{2,041,208} & 0.73\%\\
Lock & \multicolumn{2}{|c|}{1,389,250} & 0.5\% \\
Flush & \multicolumn{2}{|c|}{972,790} & 0.35\% \\
Change Notify & \multicolumn{2}{|c|}{612,850} & 0.22\% \\
Logoff & \multicolumn{2}{|c|}{143,592} & 0.05\% \\
Oplock Break & \multicolumn{2}{|c|}{22,397} & 0.008\% \\
Echo & \multicolumn{2}{|c|}{4,715} & 0.002\% \\
Cancel & \multicolumn{2}{|c|}{0} & 0.00\% \\
\caption{\label{tbl:SMBCommands2}Breakdown of General Operations for SMB2 from April 30th, 2019 to May 20th, 2019.}
\subsection{I/O Data Request Sizes}
%\textcolor{red}{Figures~\ref{fig:IO-All} and~\ref{fig:IO-R+W} show the amount of I/O in 15-minute periods during the week of March 12-18, 2017.
%The general I/O (GIO) value is representative of I/O that does not include read, write, or create actions. For the most part, these general I/O are mostly metadata operations. As one can see in Figure~\ref{fig:IO-All}, the general I/O dominates any of the read or write operations. Figure~\ref{fig:IO-R+W} is a magnification of the read and write I/O from Figure~\ref{fig:IO-All}. Here we see that the majority of I/O operations belong to reads. There are some spikes where more write I/O occur, but these events are in the minority. One should also notice that, as would be expected, the spikes of I/O activity occur around the center of the day (e.g. 8am to 8pm), and during the week (March 12 was a Sunday and March 18 was a Saturday).}
% \includegraphics[width=0.5\textwidth]{./images/AIO.pdf}
% \caption{All I/O}
% \label{fig:IO-All}
% \includegraphics[width=0.5\textwidth]{./images/RWIO-win.pdf}
% \caption{Read and Write I/O}
% \label{fig:IO-R+W}
Each SMB Read and Write command is associated with a data request size that indicates how many bytes are to be read or written as part of that command.
Figure~\ref{fig:SMB-Bytes-IO} %and~\ref{fig:PDF-Bytes-Write}
shows the probability density function (PDF) of the different sizes of bytes transferred for read and write I/O operations respectively, as well as
%Figure~\ref{fig:SMB-Bytes-IO} %and~\ref{fig:CDF-Bytes-Write}
showing cumulative distribution functions (CDF) for bytes read and bytes written.
The most noticeable aspect of these
graphs is that the majority of bytes transferred for read and write operations is around 64 bytes. It is worth noting that write I/Os also have a larger number of very small transfer amounts. This is unexpected in terms of the amount of data passed in a frame.
Part of the reason is due to a large number of long-term %calculations/
scripts that only require small but frequent updates, as we observed several
%. This assumption was later validated in part when examining the files transferred, as some were related to
running scripts creating a large volume of files. A more significant reason was because we noticed Microsoft Word would perform a large number of small reads at ever growing offsets. This was interpreted as when a user is viewing a document over the network and Word would load the next few lines of text as the user scrolled down the document; causing ``loading times'' amid use. Finally, a large degree of small writes were observed to be related to application cookies or other such smaller data communications.
%This could also be attributed to simple reads relating to metadata\textcolor{red}{???}
%\textcolor{blue}{Reviewing of the SMB and SMB2 leads to some confusion in understanding this behavior. According to the specification the default ``MaxBuffSize'' for reads and writes should be between 4,356 bytes and 16,644 bytes depending on the use of either a client version of server version of Windows; respectively. In the SMB2 protocol specification, specific version of Windows (e.g. Vista SP1, Server 2008, 7, Server 2008 R2, 8, Server 2012, 8.1, Server 2012 R2) disconnect if the ``MaxReadSize''/``MaxWriteSize'' value is less than 4096. However, further examination of the specification states that for SMB2 the read length and write length can be zero. Thus, this seems to conflict that the size has to be greater than 4096 but allows for it to also be zero. It is due to this protocol specification of allowing zero that supports the smaller read/write sizes seen in the captured traffic. The author's assumption here is that the university's configuration allows for smaller traffic to be exchanged without the disconnection for sizes smaller than 4096.}
% \includegraphics[width=0.5\textwidth]{./images/aggAvgBytes.pdf}
% \caption{Average Bytes by I/O}
% \label{fig:Agg-AvgBytes}
% \includegraphics[width=0.5\textwidth]{./images/bytesCompare.pdf}
% \caption{Total Bytes by I/O}
% \label{fig:bytesCompare}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_bytes_pdf.png}
% \vspace{-2em}
% \caption{PDF of Bytes Transferred for Read I/O}
% \label{fig:PDF-Bytes-Read}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_bytes_cdf.png}
% \vspace{-2em}
% \caption{CDF of Bytes Transferred for Read I/O}
% \label{fig:CDF-Bytes-Read}
% \includegraphics[width=0.5\textwidth]{./images/smb_write_bytes_pdf.png}
% \vspace{-2em}
% \caption{PDF of Bytes Transferred for Write I/O}
% \label{fig:PDF-Bytes-Write}
% \includegraphics[width=0.5\textwidth]{./images/smb_write_bytes_cdf.png}
% \vspace{-2em}
% \caption{CDF of Bytes Transferred for Write I/O}
% \label{fig:CDF-Bytes-Write}
\caption{PDF and CDF of Bytes Transferred for Read and Write I/O}
% \includegraphics[width=0.5\textwidth]{./images/CDF-ioBuff-win.pdf}
% \caption{CDF of Bytes Transferred for Read+Write I/O}
% \label{fig:CDF-Bytes-RW}
%Figure~\ref{fig:SMB-Bytes-IO} %and~\ref{fig:CDF-Bytes-Write}
%shows cumulative distribution functions (CDF) for bytes read and bytes written.
Additionally, almost no read transfer sizes are less than 32 bytes, whereas 20\% of the writes are smaller than 32 bytes. Table~\ref{fig:transferSizes} shows a tabular view of this data. For reads, $34.97$\% are between 64 and 512 bytes, with another $28.86$\% at 64-byte request sizes. There are a negligible percentage of read requests larger than 512.
This read data differs from the size of reads observed by Leung et al. by a factor of four smaller.
%This read data is similar to what was observed by Leung et al, however at an order of magnitude smaller.
%Writes observed also differ from previous inspection of the protocol's usage. % are very different.
Leung et al. showed that $60$-$70$\% of writes were less than 4K in size and $90$\% less than 64K in size. In our data, however, we see that almost all writes are less than 1K in size. In fact, $11.16$\% of writes are less than 4 bytes, $52.41$\% are 64-byte requests, and $43.63$\% of requests are less than 64 bytes.
In the ten years since the last study, it is clear that writes have become significantly smaller. In our analysis of a subset of the writes, we found that a significant part of the write profile was writes to cookies which are necessarily small files. The preponderance of web applications and the associated tracking is a major change in how computers and data storage are used compared to a decade ago. These small data reads and writes significantly alter the assumptions that most network storage systems are designed for.
%This may be explained by the fact that large files, and multiple files, are being written as standardized blocks more fitting to the frequent update of larger data-sets and disk space available. This could be as an effort to improve the fidelity of data across the network, allow for better realtime data consistency between client and backup locations, or could just be due to a large number of scripts being run that create and update a series of relatively smaller documents.
%\textbf{Note: It seems like a change in the order of magnitude that is being passed per packet. What would this indicate?}\textcolor{red}{Answer the question. Shorter reads/writes = better?}
Transfer size & Reads & Writes \\ \hline
$< 4$ & 0.098\% & 11.16\% \\
$= 4$ & 1.16\% & 4.13\% \\
$>4, < 64$ & 34.89\% & 28.14\% \\
$= 64$ & 28.86\% & 52.41\% \\
$>64, < 512$ & 34.97\% & 4.15\% \\
$= 512$ & 0.002\% & 2.54e-5\% \\
$= 1024$ & 1.22e-5\% & 3.81e-5\% \\ \hline
\caption{\label{fig:transferSizes}Percentage of transfer sizes for reads and writes}
In comparison of the read, write, and create operations we found that the vast majority
of I/O belong to creates. By the fact that there are so many creates, it
seems apparent that many applications create new files rather than updating existing
files when files are modified. Furthermore, read operations account for the largest aggregate of bytes transferred over the network. However, the number of bytes transferred by write commands is not far behind, although, non-intuitively, including a larger number of standardized relatively smaller writes. The most unexpected finding of the data is that all the read and writes are performed using much smaller buffers than expected; about an order of magnitude smaller (e.g. bytes instead of kilobytes).
% XXX I think we should get rid of this figure - not sure it conveys anything important that is not better conveyed than the CDF
%Figure~\ref{fig:Agg-AvgRT} shows the average response time (RT) for the different I/O operations. The revealing information is that write I/Os take the longest average time. This is expected since writes transfer more data on average. There is an odd spike for create I/O which can be due to a batch of files or nested directories being made. There are points where read I/O RT can be seen, but this only occurs in areas where large RT for write I/O occur. This is attributed to a need to verify the written data.
% \includegraphics[width=0.5\textwidth]{./images/aggAvgRTs-windowed.pdf}
% \caption{Average Response Time by I/O Operation}
% \label{fig:Agg-AvgRT}
% XXX I think we should get rid of this figure - not sure it conveys anything important that is not better conveyed than the CDF
%Figure~\ref{fig:Agg-AvgBytes} shows the average inter arrival time (IAT) for the different I/O operations. \textcolor{red}{Issue: Data only exists for general operations, NOT for other operations. In other words, data for all other operations was IAT of zero.} \textcolor{blue}{Idea: This is due to single operation by a single user and then no operation being performed again. This would aligns with the ideas of Lueng et.~al.~who noticed that files were being interacted with only once or twice and then not again.}
% \includegraphics[width=0.5\textwidth]{./images/aggAvgIATs-windowed.pdf}
% \caption{Average Inter Arrival Time by I/O Operation}
% \label{fig:Agg-AvgIAT}
%The following is a list of data collected and why:
% \item TID-to-IP map: with the hashing, the only way to maintain mapping of `share-types' (i.e. share-paths) to TIDs is via IP (reverse DNS).
% \item FID Data: holds the number of reads, writes, and size of the FID (tracked) for which this information is tracked (per FID).
% \item Tuple Data: holds the reads and writes performed by a seen tuple (per tuple) along with by the tuple and FID's data.
% \item TID Data: holds the number of reads, writes, creates, and total I/O events along with the last time each/any command was seen. Maps are kept of the buffs seen, general IAT, read IAT, write IAT, create IATs.
% \item Tuple Info: Tracking the tuples seen along with a map to that tuple's (per tuple) data.
% \item Oplock Data: Tracks the different types of oplocks that are seen per 15 minutes.
% \item Read/Write Buff: Maps that are used to track the different sized buffers used for Read/Write commands.
% \item `filesizeMap': Used for track the different sized buffers to pass data along the network (generic and all inclusive; ie. tuple level data).
% \item I/O Events: Track the number of I/O events seen in 15 minute periods. I/Os include - read, write, create, general.
\subsection{I/O Response Times}
%~!~ Addition since Chandy writing ~!~%
Most previous tracing work have not reported I/O response times or command latency, which is generally proportional to data request size, but under load, the response times give an indication of server load. In
Table~\ref{tbl:PercentageTraceSummary} we show a summary of the response times for read, write, create, and general commands. We note that most general (metadata) operations occur fairly frequently, run relatively slowly, and happen at high frequency.
We also observe that the number of writes is very close to the number of reads. The write response time for their operations is very small - most likely because the storage server caches the write without actually committing to disk. Reads, on the other hand, are in most cases probably not going to hit in the cache and require an actual read from the storage media. Although read operations are only a small percentage of all operations, they have the highest average response time. As noted above, creates happen more frequently, but have a slightly slower response time, because of the extra metadata operations required for a create as opposed to a simple write.
% Note: RT + IAT time CDFs exist in data output
% IAT information
% \includegraphics[width=0.5\textwidth]{./images/smb_general_iats_cdf.png}
% \caption{CDF of Inter Arrival Time for General I/O}
% \label{fig:CDF-IAT-General}
% \includegraphics[width=0.5\textwidth]{./images/smb_general_iats_pdf.png}
% \caption{PDF of Inter Arrival Time for General I/O}
% \label{fig:PDF-IAT-General}
% \includegraphics[width=0.5\textwidth]{./images/smb_general_rts_cdf.png}
% \caption{CDF of Response Time for General I/O}
% \label{fig:CDF-RT-General}
% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/smb_general_rts_pdf.png}
% \caption{PDF of Response Time for General I/O}
% \label{fig:PDF-RT-General}
% \vspace{-2em}
\caption{CDF of Inter-Arrival Time for SMB I/O}
\caption{PDF of Inter-Arrival Time for SMB I/O}
\caption{CDF of Response Time for SMB I/O}
\caption{PDF of Response Time for SMB I/O}
& Reads & Writes & Creates & General \\ \hline
I/O \% & 2.97 & \multicolumn{1}{r|}{2.80} & \multicolumn{1}{r|}{19.36} & \multicolumn{1}{r|}{74.87} \\ \hline
Avg RT ($\mu$s) & 59,819.7 & \multicolumn{1}{r|}{519.7} & \multicolumn{1}{r|}{698.1} & \multicolumn{1}{r|}{7,013.4} \\ \hline
Avg IAT ($\mu$s) & 33,220.8 & \multicolumn{1}{r|}{35,260.4} & \multicolumn{1}{r|}{5,094.5} & \multicolumn{1}{r|}{1,317.4} \\ \hline
%Total RT (s) & 224248 & \multicolumn{1}{l|}{41100} & \multicolumn{1}{l|}{342251} & \multicolumn{1}{l|}{131495} \\ \hline
%\% Total RT & 30.34\% & \multicolumn{1}{l|}{5.56\%} & \multicolumn{1}{l|}{46.3\%} & \multicolumn{1}{l|}{17.79\%} \\ \hline
\caption{Summary of Trace Statistics: Average Response Time (RT) and Inter Arrival Time (IAT)}
% & Reads & Writes & Creates & General R-W \\ \hline
%Total RT (ms) & 224248442 & \multicolumn{1}{l|}{41100075} & \multicolumn{1}{l|}{342251439} & \multicolumn{1}{l|}{131495153} & \multicolumn{1}{l|}{258573201} \\ \hline
%\% Total RT & 30.34\% & \multicolumn{1}{l|}{5.56\%} & \multicolumn{1}{l|}{46.3\%} & \multicolumn{1}{l|}{17.79\%} & \multicolumn{1}{l|}{34.99\%} \\ \hline
%\caption{Summary of Response Time (RT) Statistics: Total RT and Percentage RT per Operation}
%\textcolor{red}{To get an indication of how much of an effect these general commands take on overall latency, we also calculated the total aggregate response time for read, write, create, and general operations. We see that even though general commands account for $74.87$\% of all commands, they only account for only $17.8$\% of the total response time. Thus, while the volume of general operations does not present an extraordinary burden on server load, reducing these operations can present a clear performance benefit. We also see that creates take the most amount of time ($46.3$\%) of the total response time for all operations. As seen in Table~\ref{tbl:SMBCommands}, the majority of general operations are negotiations while $28.71$\% are closes; which relate to create operations.
%This shows that while creates are only $5.08$\% on March 15th (and $2.5$\% of the week's operations shown in Table~\ref{tbl:PercentageTraceSummary}) of the total operations performed, they are responsible for $46.3$\% of the time spent performing network I/O.}
%\textbf{Do we need this above data piece?}
%% Not Needed to Say Since we have no data
%%One key observation is that there were no inter arrival time calculations for read, write, or create operations. We interpret this data to reflect the observations of Leung et.~al.~that noticed that files are interacted with only a few times and then not interacted with again. Extrapolating this concept, we interpret the data to illustrate that files may be read or written once, but then are not examined or interacted with again.
%%\textcolor{blue}{This was entirely unexpected and was discovered as a result of our original assumptions made based on what scope we believed to be the best interpretation of user activity on the network filesystem.}
%% & Count \\ \hline
%%Sessions & 122 \\ \hline
%%Non-Sessions & 2 \\ \hline
%%\caption{Summary of Maximum Session and Non-Session Seen}
%%\textcolor{red}{Not sure if presenting a count of the number of sessions seen is important or worth showing.}
%% & Reads & Writes \\ \hline
%%Average & 27167.76 B & 106961.36 B \\ \hline
%%Percentage & 99.4\% & 0.6\% \\ \hline
%%\caption{Summary of Bytes Transferred Over the Network}
%%\textcolor{red}{Reference the large single table instead}
%%Table~\ref{tbl:TraceSummary} shows our findings relating to the total number of bytes transferred over the network due to Read and Write operations. Mimicing the findings from Figure~\ref{fig:Agg-AvgBytes}, the table shows that while the percentage of total bytes passed over the network is dominated by Read operations the average bytes pushed by Write operations is of a magnitude greater.
%%Tables to be included:
%% \item Return Times:
%% \begin{itemize}
%% \item General
%% \item Read
%% \item Write
%% \item Create
%% \item Read+Write
%% \end{itemize}
%% \item Inter Arrival Times
%% \begin{itemize}
%% \item General
%% \item Read
%% \item Write
%% \item Create
%% \item Read+Write
%% \end{itemize}
%% \item Bytes per Request (Bytes Over Network)
%% \begin{itemize}
%% \item Read
%% \item Write
%% \item Read+Write
%% \end{itemize}
%%Modeling to include:
%% \item Inter Arrival Time CDF
%% \begin{itemize}
%% \item Read
%% \item Write
%% \item Read+Write
%% \end{itemize}
Figures~\ref{fig:CDF-IAT-SMB} and~\ref{fig:PDF-IAT-SMB} shows the inter arrival times CDFs and PDFs. As can be seen, SMB commands happen very frequently - $85$\% of commands are issued less than 1000~$\mu s$ apart. As mentioned above, SMB is known to be very chatty, and it is clear that servers must spend a significant amount of time dealing with these commands. For the most part, most of these commands are also serviced fairly quickly as
seen in Figures~\ref{fig:CDF-RT-SMB} and~\ref{fig:PDF-RT-SMB}. Interestingly, the response time for the general metadata operations follows a similar curve to the inter-arrival times.
%Next we examine the response time (RT) of the read, write, and create I/O operations that occur over the SMB network filesystem.
The response time for write operations (shown in Figure~\ref{fig:CDF-RT-SMB}) does not follow the step function similar to the bytes written CDF in Figure~\ref{fig:SMB-Bytes-IO}. This is understandable as the response time for a write would be expected to be a more standardized action and not necessarily proportional to the number of bytes written. However, the read response time %(Figure~\ref{fig:CDF-RT-SMB})
is smoother than the bytes read CDF (Figure~\ref{fig:SMB-Bytes-IO}). This is most likely due to the fact that some of the reads are satisfied by server caches, thus eliminating some long access times to persistent storage.
However, one should notice that the response time on read operations grows at a rate similar to that of write operations. This, again, shows a form of standardization in the communication patterns although some read I/O take a far greater period of time; due to larger amounts of read data sent over several standardized size packets.
%While the RT for Write operations are not included (due to their step function behavior) Figure~\ref{fig:CDF-RT-Read} and Figure~\ref{fig:CDF-RT-RW} show the response times for Read and Read+Write operations respectively. T
%\textcolor{red}{The write I/O step function behavior is somewhat visible in the CDF of both reads and writes in Figures~\ref{fig:CDF-RT-Read}~and~\ref{fig:CDF-RT-Write}. Moreover, this shows that the majority ($80$\%) of read (and write) operations occur within 2~$ms$, the average access time for enterprise storage disks. As would be expected, this is still an order of magnitude greater than the general I/O.}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_iats_cdf.png}
% \vspace{-2em}
% \caption{CDF of Inter Arrival Time for Read I/O}
% \label{fig:CDF-IAT-Read}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_iats_pdf.png}
% \vspace{-2em}
% \caption{PDF of Inter Arrival Time for Read I/O}
% \label{fig:PDF-IAT-Read}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_rts_cdf.png}
% \vspace{-2em}
% \caption{CDF of Response Time for Read I/O}
% \label{fig:CDF-RT-Read}
%% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/smb_read_rts_pdf.png}
% \vspace{-2em}
% \caption{PDF of Response Time for Read I/O}
% \label{fig:PDF-RT-Read}
%% \vspace{-2em}
% RTs information
% \includegraphics[width=0.5\textwidth]{./images/smb_write_iats_cdf.png}
% \vspace{-2em}
% \caption{CDF of Inter Arrival Time for Write I/O}
% \label{fig:CDF-IAT-Write}
% \includegraphics[width=0.5\textwidth]{./images/smb_write_iats_pdf.png}
% \vspace{-2em}
% \caption{PDF of Inter Arrival Time for Write I/O}
% \label{fig:PDF-IAT-Write}
% \includegraphics[width=0.5\textwidth]{./images/smb_write_rts_cdf.png}
% \vspace{-2em}
% \caption{CDF of Return Time for Write IO}
% \label{fig:CDF-RT-Write}
%% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/smb_write_rts_pdf.png}
% \vspace{-2em}
% \caption{PDF of Return Time for Write IO}
% \label{fig:PDF-RT-Write}
%% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/smb_create_iats_cdf.png}
% \caption{CDF of Inter Arrival Time for Create I/O}
% \vspace{-2em}
% \label{fig:CDF-IAT-Create}
% \includegraphics[width=0.5\textwidth]{./images/smb_create_iats_pdf.png}
% \vspace{-2em}
% \caption{PDF of Inter Arrival Time for Create I/O}
% \label{fig:PDF-IAT-Create}
% \includegraphics[width=0.5\textwidth]{./images/smb_create_rts_cdf.png}
% \vspace{-2em}
% \caption{CDF of Response Time for Create I/O}
% \label{fig:CDF-RT-Create}
%% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/smb_create_rts_pdf.png}
% \vspace{-2em}
% \caption{PDF of Response Time for Create I/O}
% \label{fig:PDF-RT-Create}
%% \vspace{-2em}
% \includegraphics[width=0.5\textwidth]{./images/CDF-ioRT-win.pdf}
% \caption{CDF of Response Time for Read+Write I/ O}
% \label{fig:CDF-RT-RW}
% \includegraphics[width=0.5\textwidth]{./images/CDF-rBuff-win.pdf}
% \caption{CDF of Bytes Transferred for Read IO}
% \label{fig:CDF-Bytes-Read}
% \includegraphics[width=0.5\textwidth]{./images/CDF-wBuff-win.pdf}
% \caption{CDF of Bytes Transferred for Write IO}
% \label{fig:CDF-Bytes-Write}
% \includegraphics[width=0.5\textwidth]{./images/CDF-ioBuff-win.pdf}
% \caption{CDF of Bytes Transferred for Read+Write IO}
% \label{fig:CDF-Bytes-RW}
\subsection{File Extensions}
Tables~\ref{tab:top10SMB2FileExts} and~\ref{tab:commonSMB2FileExts} show a summary of the various file extensions that were seen within the SMB2 traffic during the three-week capture period; following the \textit{smb2.filename} field. The easier to understand is Table~\ref{tab:commonSMB2FileExts}, which illustrates the number of common file extensions (e.g. doc, ppt, xls, pdf) that were part of the data.
%The greatest point of note is that the highest percentage is ``.xml'' with $0.54$\%, which is found to be surprising result.
Originally, we expected that these common file extensions would be a much larger total of traffic. However, as seen in Table~\ref{tab:commonSMB2FileExts}, these common file extensions were less than $2$\% of total files seen. The top ten extensions that we saw (Table~\ref{tab:top10SMB2FileExts}) comprised approximately $84$\% of the total seen.
Furthermore, the majority of extensions are not readily identified.
Upon closer examination of the tracing system it was determined that
%these file extensions are an artifact of how Windows interprets file extensions. The Windows operating system merely guesses the file type based on the assumed extension (e.g. whatever characters follow after the final `.').
many files simply do not have a valid extension. These range from Linux-based library files, manual pages, odd naming schemes as part of scripts or back-up files, as well as date-times and IPs as file names. There are undoubtedly more, but exhaustive determination of all variations is seen as out of scope for this work.
%\textcolor{red}{Add in information stating that the type of OS in use in the university environment range from Windows, Unix, BSD, as well as other odd operating systems used by the engineering department.}
SMB2 Filename Extension & Occurrences & Percentage of Total \\ \hline
-Travel & 33,396,147 & 15.26 \\
o & 28,670,784 & 13.1 \\
e & 28,606,421 & 13.07 \\
N & 27,639,457 & 12.63 \\
one & 27,615,505 & 12.62 \\
\textless{}No Extension\textgreater{} & 27,613,845 & 12.62 \\
d & 2,799,799 & 1.28 \\
l & 2,321,338 & 1.06 \\
x & 2,108,279 & 0.96 \\
h & 2,019,714 & 0.92 \\ \hline
\caption{Top 10 File Extensions Seen Over Three Week Period}
SMB2 Filename Extension & Occurrences & Percentage of Total \\ \hline
doc & 352,958 & 0.16 \\
docx & 291,047 & 0.13 \\
ppt & 46,706 & 0.02 \\
pptx & 38,604 & 0.02 \\
xls & 218,031 & 0.1 \\
xlsx & 180,676 & 0.08 \\
odt & 28 & 0.000013 \\
pdf & 375,601 & 0.17 \\
xml & 1,192,840 & 0.54 \\
txt & 167,827 & 0.08 \\ \hline
\caption{Common File Extensions Seen Over Three Week Period}
%Points worth mentioning:
% \item Scale of time is only to the microsecond due to the original pcap file capturing process. \texttt{tshark} only captures to a microsecond scale in our implementation.
% \item Due to a complication of how DataSeries stores information, there are potentially more SMB2 packets than actually occurred since $0$ is an acceptable command for SMB2 (although not used for SMB).
\subsection{Distribution Models}
For simulations and analytic modeling, it is often useful to have models that describe storage systems I/O behavior. In this section, we attempt to map traditional probabilistic distributions to the data that we have observed.
Specifically, taking the developed CDF graphs, we perform curve fitting to determine the applicability of Gaussian and Weibull distributions to the network filesystem I/O behavior. Note that an exponential distribution, typically used to model interarrival times and response times, is a special case of a Weibull distribution where $k=1$.
Table~\ref{tbl:curveFitting} shows best-fit parametrized distributions for the measured data. % along with $R^2$ fitness values.
%Based on the collected IAT and RT data, the following are the best fit curve representation equations with supporting $R^{2}$ values. In the case of each, it was found that the equation used to model the I/O behavior was a Gaussian equation with a single term.
%\begin{equation} f(x) = a_1 * e^{-((x-b_1)/c_1)^2)} \end{equation}
%The $R^2$ values for each CDF graph were found to be the following:
% \item General Command IAT CDF, shown in Figure~\ref{fig:CDF-IAT-General}, had $R^2$ Value of $0.6704$.
% \item General Command RT CDF, shown in Figure~\ref{fig:CDF-RT-General}, had $R^2$ Value of $0.9728$.
% \item Read command RT CDF, shown in Figure~\ref{fig:CDF-RT-Read}, had $R^2$ Value of $0.7754$.
% \item Write command RT CDF, shown in Figure~\ref{fig:CDF-RT-Write}, had $R^2$ Value of $0.7797$
% \item Create command RT CDF, shown in Figure~\ref{fig:CDF-RT-Create}, had $R^2$ Value of $0.07146$
% \item Read + Write command RT CDF, shown in Figure~\ref{fig:CDF-RT-RW}, has $R^2$ Value of $0.7837$.
%Model & \multicolumn{3}{|c|}{Gaussian}
% & \multicolumn{3}{|c|}{Weibull} \\ \hline
%CDF & \multicolumn{3}{|c|}{$\frac{1}{\sqrt{2\pi}}\int_{-\infty}^{\frac{x-\mu}{\sigma}}e^{\frac{-t^2}{2}}dt$}
% & \multicolumn{3}{|c|}{$1 - e^{(-x/\lambda)^k}$} \\ \hline \hline
%I/O Operation & $\mu$ & \multicolumn{2}{|c|}{$\sigma$} & $k$ & \multicolumn{2}{|c|}{$\lambda$} \\ \hline
%General RT & 3606.66$\pm$742.44 & \multicolumn{2}{|c|}{2.74931e+06$\pm$530} & 0.5652$\pm$0.0001 & \multicolumn{2}{|c|}{980.9721$\pm$0.4975} \\
%General IAT & 786.72$\pm$2.79 & \multicolumn{2}{|c|}{10329.6$\pm$2} & 0.9031$\pm$0.0002 & \multicolumn{2}{|c|}{743.2075$\pm$0.2341} \\
%Read RT & 44718.5$\pm$11715 & \multicolumn{2}{|c|}{1.72776e+07$\pm$8300} & 0.0004$\pm$0.0 & \multicolumn{2}{|c|}{1.5517$\pm$0.0028} \\
%Read IAT & 24146$\pm$8062 & \multicolumn{2}{|c|}{1.189e+07$\pm$5700} & 0.0005$\pm$0.0 & \multicolumn{2}{|c|}{3.8134$\pm$0.0057} \\
%Write RT & 379.823$\pm$2.809 & \multicolumn{2}{|c|}{4021.72$\pm$1.99} & 0.8569$\pm$0.0004 & \multicolumn{2}{|c|}{325.2856$\pm$0.2804} \\
%Write IAT & 25785.7$\pm$8556.6 & \multicolumn{2}{|c|}{1.22491e+07$\pm$6000} & 0.0004$\pm$0.0 & \multicolumn{2}{|c|}{3.1287$\pm$0.0052} \\
%Create RT & 502.084$\pm$5.756 & \multicolumn{2}{|c|}{21678.4$\pm$4.1} & 0.9840$\pm$0.0002 & \multicolumn{2}{|c|}{496.9497$\pm$0.1403} \\
%Create IAT & 3694.82$\pm$1236.16 & \multicolumn{2}{|c|}{4.65553e+06$\pm$880} & 0.0008$\pm$0.0 & \multicolumn{2}{|c|}{2.3504$\pm$0.0009} \\ \hline
%%R+W RT & \textcolor{red}{0.8045} & \multicolumn{2}{|c|}{\textcolor{red}{0.2122}} & \textcolor{red}{5.103} & \multicolumn{2}{|c|}{\textcolor{red}{0.3937}} \\ \hline
%%R+W Byte Transfer & \textcolor{red}{0.3744} & \multicolumn{2}{|c|}{\textcolor{red}{0.2983}} & \textcolor{red}{1.153} & \multicolumn{2}{|c|}{\textcolor{red}{0.3937}} \\
%Read Buff Transfer & 82.9179$\pm$0.7641 & \multicolumn{2}{|c|}{1117.9$\pm$0.54} & 1.0548$\pm$0.0003 & \multicolumn{2}{|c|}{85.2525$\pm$0.0575} \\
%Write Buff Transfer & 46.2507$\pm$0.4475 & \multicolumn{2}{|c|}{640.621$\pm$0.316} & 1.0325$\pm$0.0004 & \multicolumn{2}{|c|}{46.8707$\pm$0.0328} \\ \hline
%\caption{\label{tbl:curveFitting}Comparison of %$R^2$
%$\mu$, $\sigma$, $k$, and $\lambda$ Values for Curve Fitting Equations on CDF Graphs}
Model & \multicolumn{3}{|c|}{Gaussian}
& \multicolumn{3}{|c|}{Weibull} \\ \hline
CDF & \multicolumn{3}{|c|}{$\frac{1}{\sqrt{2\pi}}\int_{-\infty}^{\frac{x-\mu}{\sigma}}e^{\frac{-t^2}{2}}dt$}
& \multicolumn{3}{|c|}{$1 - e^{(-x/\lambda)^k}$} \\ \hline \hline
I/O Operation & $\mu$ & \multicolumn{2}{|c|}{$\sigma$} & $k$ & \multicolumn{2}{|c|}{$\lambda$} \\ \hline
General RT & 3606.66$\pm$20.6\% & \multicolumn{2}{|r|}{2.74931e+06$\pm$0.02\%} & 0.5652$\pm$0.02\% & \multicolumn{2}{|r|}{980.9721$\pm$0.05\%} \\
General IAT & 786.72$\pm$0.35\% & \multicolumn{2}{|r|}{10329.6$\pm$0.02\%} & 0.9031$\pm$0.02\% & \multicolumn{2}{|r|}{743.2075$\pm$0.02\%} \\
Read RT & 44718.5$\pm$26.2\% & \multicolumn{2}{|r|}{1.72776e+07$\pm$0.05\%} & 0.0004$\pm$0.00\% & \multicolumn{2}{|r|}{1.5517$\pm$0.18\%} \\
Read IAT & 24146$\pm$33.4\% & \multicolumn{2}{|r|}{1.189e+07$\pm$0.05\%} & 0.0005$\pm$0.00\% & \multicolumn{2}{|r|}{3.8134$\pm$0.15\%} \\
Write RT & 379.823$\pm$0.74\% & \multicolumn{2}{|r|}{4021.72$\pm$0.05\%} & 0.8569$\pm$0.05\% & \multicolumn{2}{|r|}{325.2856$\pm$0.09\%} \\
Write IAT & 25785.7$\pm$33.2\% & \multicolumn{2}{|r|}{1.22491e+07$\pm$0.05\%} & 0.0004$\pm$0.00\% & \multicolumn{2}{|r|}{3.1287$\pm$0.17\%} \\
Create RT & 502.084$\pm$1.15\% & \multicolumn{2}{|r|}{21678.4$\pm$0.02\%} & 0.9840$\pm$0.02\% & \multicolumn{2}{|r|}{496.9497$\pm$0.03\%} \\
Create IAT & 3694.82$\pm$33.5\% & \multicolumn{2}{|r|}{4.65553e+06$\pm$0.02\%} & 0.0008$\pm$0.00\% & \multicolumn{2}{|r|}{2.3504$\pm$0.04\%} \\ \hline
%R+W RT & \textcolor{red}{0.8045} & \multicolumn{2}{|c|}{\textcolor{red}{0.2122}} & \textcolor{red}{5.103} & \multicolumn{2}{|c|}{\textcolor{red}{0.3937}} \\ \hline
%R+W Byte Transfer & \textcolor{red}{0.3744} & \multicolumn{2}{|c|}{\textcolor{red}{0.2983}} & \textcolor{red}{1.153} & \multicolumn{2}{|c|}{\textcolor{red}{0.3937}} \\
Read Buff Transfer & 82.9179$\pm$0.92\% & \multicolumn{2}{|r|}{1117.9$\pm$0.05\%} & 1.0548$\pm$0.03\% & \multicolumn{2}{|r|}{85.2525$\pm$0.07\%} \\
Write Buff Transfer & 46.2507$\pm$0.97\% & \multicolumn{2}{|r|}{640.621$\pm$0.05\%} & 1.0325$\pm$0.04\% & \multicolumn{2}{|r|}{46.8707$\pm$0.07\%} \\ \hline
\caption{\label{tbl:curveFitting}Comparison of %$R^2$
$\mu$, $\sigma$, $k$, and $\lambda$ Values for Curve Fitting Equations on CDF Graphs}
%The graphs created by the dissection script are:
% \item Average IAT (G/R/W/C) - By DateTime.
% \item Average Bytes (R/W) - By DateTime.
% \item Session I/Os (G/R/W/C) - By DateTime.
% \item Non-Session I/Os (G/R/W/C) - By DateTime.
% \item Tuple Counts - By DateTime.
% \item Total Bytes (R+W/R/W) - By DateTime.
% \item Total I/Os (G/R/W) - By DateTime.
%Observations on graphs:
% \item Avergage IAT - majority write/general.
% \item Total I/O - majority are general I/O.
% \item Average Bytes - majority are writes.
% \item Bytes Total - majority reads.
% \item Tuple counts are close to same as session counts.
%Examination of the Response Time (RT) and Inter Arrival Times (IAT) revealed the speed and frequency with which metadata operations are performed, as well as the infrequency of individual users and sessions to interact with a given share.
%% NEED: Run the matlab curve fitting to complete this section of the writing
%Our comparison of the existing standard use of an exponential distribution to model network inter-arrival and response times is still valid.
As indicated by the error bounds, one can see that the Weibull distributions are generally much better fits for all the different distributions. Furthermore, the Poisson arrival assumption (exponential distribution $k=1$) is only valid for general I/O, but the write and create service times are exponential. Interestingly, the read and write buffer sizes are very close to exponential, though a Gaussian distribution is a close fit.
%One should notice that the Gaussian distributions
% had better $R^2$ result than the exponential equivalent for write operations. This is not surprising due to the step-function shape of the Figure~\ref{fig:CDF-RT-Write} CDF. Examining the $R^2$ results for the read + write I/O operations we find that the exponential distribution is far more accurate at modeling this combined behavior.
The models for the write and create operations are similar, while those for read operations are not. Furthermore, there is less similarity between the modeled behavior of general operation inter arrival times and their response times, showing the need for a more refined model for each aspect of the network filesystem interactions.
%One should also notice that the general operation model is more closely similar to that of the creates.
%This makes sense since create operations are found to dominate the network filesystem I/O, which aligns well with the number of existing close operations.
%improves the ability of a exponential distribution to model the combined behavior.}
% \item Byte data appears in powers of 2 (e.g. 32K, 64K)
% \item IAT times most occur in the 0-10000 microsecond range, expect to general I/O which is in a much smaller range. The expectation is that this is because some commands and actions in SMB do not require the establishment of a session, thus allowing for a faster response.
% \item The timestamps provided by SMB are only accurate to the microseconds.
%University information:
% \item Central backup server where each has a client.
% \item Client notifies 50 servers at once to do backup and as finished move onto the next.
% \item Only begin during midnight to 4am while servers must be ready to back-up and clients must respond to back-up.
% \item The 50 servers are randomized and incremental back-up takes ~1-2 hours
%\textbf{Note:} Not sure that we would see this traffic since that would be between the servers and the back-up clients, (not the student clients?).
%The collected data shows the following observations about the observed network filesystem.
% \item The majority of network operations relate to metadata. This is due to a movement for user activity from reading and writing data to simply checking file and directory metadata.
% \item Writes cause the largest amount of data to be passed over the network. While Read operations occur at the largest number and cause the larger total number of bytes to be transferred, write operations are more expensive by an order of magnitude.
% \item \textcolor{red}{Here will be observation on the modeling of poisson fit.}
\subsection{System Limitations and Challenges}
\label{System Limitations and Challenges}
When initially designing the tracing system used in this paper, different aspects were taken into account, such as space limitations of the tracing system, packet capture limitations (e.g. file size), and speed limitations of the hardware. One limitation encountered in the packet capture system deals with the functional pcap (packet capture file) size. The concern being that the pcap files only need to be held until they have been filtered for specific protocol information and then compressed using the DataSeries format, but still allow for room for the DataSeries files being created to be stored. %Other limitation concerns came from the software and packages used to collect the network traffic data~\cite{Orosz2013,dabir2007bottleneck,skopko2012loss}. These ranged from timestamp resolution provided by the tracing system's kernel~\cite{Orosz2013} to how the packet capturing drivers and programs (such as dumpcap and tshark) operate along with how many copies are performed and how often. The speed limitations of the hardware are dictated by the hardware being used (e.g. Gb capture interface) and the software that makes use of this hardware (e.g. PF\_RING).
%After all, our data can only be as accurate as the information being captured~\cite{seltzer2003nfs,anderson2004buttress}.
Another concern was whether or not the system would be able to function optimally during periods of high network traffic. All aspects of the system, from the hardware to the software, have been altered to help combat these concerns and allow for the most accurate packet capturing possible.
%About Challenges of system
%While the limitations of the system were concerns, there were other challenges that were tackled in the development of this research.
%One glaring challenge with building this tracing system was using code written by others; tshark and DataSeries. While these programs are used within the tracing structure there are some issues when working with them. These issues ranged from data type limitations of the code to hash value and checksum miscalculations due to encryption of specific fields/data. Attempt was made to dig and correct these issues, but they were so inherent to the code being worked with that hacks and workarounds were developed to minimize their effect. Other challenges centralize around selection, interpretations and distribution scope of the data collected. Which fields should be filtered out from the original packet capture? What data is most prophetic to the form and function of the network being traced? What should be the scope, with respect to time, of the data being examined? Where will the most interesting information appear? As each obstacle was tackled, new information and ways of examining the data reveal themselves and with each development different alterations and corrections are made.
%Even when all the information is collected and the most important data has been selected, there is still the issue of what lens should be used to view this information.
Because the data is being collected from an active network, there will be differing activity depending on the time, the day, the week, and the academic calendar. For example, although the first week or so of the academic year may contain a large amount of traffic, this does not mean that trends of that period of time will occur for every week of the year (except perhaps the final week of the semester). The trends and habits of the network will change based on the time of year, time of day, and even depend on the exam schedule. A comprehensive examination requires looking at all different periods of time to see how all these factors play into the storage system utilization.
% DataSeries Challenge
%A complication of this process is that the DataSeries code makes use of a push-pop stack for iterating through packet information. This means that if information can not be re-read then errors occur. This can manifest in the scenario where a produced \texttt{.ds} file is corrupted or incomplete, despite the fact that the original \texttt{.pcap} being fine.
%This manifested as an approximate loss of \textbf{????} out of every 100,000 files.
%Normally, one could simply re-perform the conversion process to a DataSeries file, but due to the rate of the packets being captured and security concerns of the data being captured, we are unable to re-run any captured information.
\section{Conclusions and Future Work}
Our analysis of this university network filesystem illustrated the current implementation and use of the CIFS/SMB protocol in a large academic setting. We notice the effect of caches on the ability of the filesystem to limit the number of accesses to persistent storage. The effect of enterprise storage disks access time can be seen in the response time for read and write I/O. Metadata operations dominate the majority of network communication, which is of less surprise since SMB is a known chatty protocol. We do notice that the CIFS/SMB protocol continues to be chatty with metadata I/O operations regardless of the version of SMB being implemented; $74.66$\% of I/O being metadata operations for SMB2.
We also find that read and write transfer sizes are significantly smaller than would be expected and requires further study as to the impact on current storage systems.
%operations happen in greater number than write operations (at a ratio of 1.06) and the size of their transfers are is also greater by a factor of about 2.
%However, the average write operation includes a larger number of relatively smaller writes.
Examination of the return times for these different I/O operations shows that exponential distribution curve fitting equation is most accurate at modeling the CDF of the various I/O operations. This shows that the current model is still effective for the majority of I/O, but that for read operations there needs to be further research in modeling their behavior.
%Our work finds that a single term Gaussian distribution has an $R^2$ value of $0.7797$, but further work needs to be made in order to refine the model.
Our work finds that write and create response times can be modeled similarly, but that the read response times require the alteration of the general model.
However, the general I/O can be modeled using the same standard; which has similar shape and scale to that of the write and create operations.
%\subsection{Future Work}
The analysis work will eventually incorporate oplocks and other aspects of resource sharing on the network to gain a more complete picture of the network's usage and bottlenecks.
Network filesystem usage from an individual user scope has become simple and does not contain a greater deal of read, write, and create operations.
Further analysis will be made in examining how the determined metrics change when examined at the scope of a per share (i.e. TID) or per user (i.e. UID). At this level of examination, we will be able to obtain a better idea of how each share is interacted with, as well as how files and directories are shared, and access control is implemented.
Due to the large number of metadata operations, the use of smart storage solutions could be used to minimize the impact of these I/O. Smart storage elements can aid by performing metadata operations without the need to access persistent storage, thus causing shorter response times. In this manner, the use of smart storage can also help reduce bottlenecks with larger network filesystems and minimize the effect of traffic on overall network performance.
%\end{document} % This is where a 'short' article might terminate
%This work was supported in part by a National Science Foundation grant (award number
%CNS-0855090). Any opinions, findings and conclusions or recommendations expressed in
%this material are those of the authors and do not necessarily reflect those of the
%National Science Foundation.
% The following two commands are all you need in the
% initial runs of your .tex file to
% produce the bibliography for the citations in your paper.
\bibliography{sigproc} % sigproc.bib is the name of the Bibliography in this case
% You must have a proper ".bib" file
% and remember to run:
% latex bibtex latex latex
% to resolve all references
% ACM needs 'a single self-contained file'!
%APPENDICES are optional
%%Appendix A
%\section{Headings in Appendices}
%The rules about hierarchical headings discussed above for
%the body of the article are different in the appendices.
%In the \textbf{appendix} environment, the command
%\textbf{section} is used to
%indicate the start of each Appendix, with alphabetic order
%designation (i.e. the first is A, the second B, etc.) and
%a title (if you include one). So, if you need
%hierarchical structure
%\textit{within} an Appendix, start with \textbf{subsection} as the
%highest level. Here is an outline of the body of this
%document in Appendix-appropriate form:
%\subsection{The Body of the Paper}
%\subsubsection{Type Changes and Special Characters}
%\subsubsection{Math Equations}
%\paragraph{Inline (In-text) Equations}
%\paragraph{Display Equations}
%\subsubsection{Theorem-like Constructs}
%\subsubsection*{A Caveat for the \TeX\ Expert}
%\subsection{Additional Authors}
%This section is inserted by \LaTeX; you do not insert it.
%You just add the names and information in the
%\texttt{{\char'134}additionalauthors} command at the start
%of the document.
%Generated by bibtex from your ~.bib file. Run latex,
%then bibtex, then latex twice (to resolve references)
%to create the ~.bbl file. Insert that ~.bbl file into
%the .tex source file and comment out
%the command \texttt{{\char'134}thebibliography}.
%% This next section command marks the start of
%% Appendix B, and does not continue the present hierarchy
%\section{More Help for the Hardy}
%The sig-alternate.cls file itself is chock-full of succinct
%and helpful comments. If you consider yourself a moderately
%experienced to expert user of \LaTeX, you may find reading
%it useful but please remember not to change it.
%\balancecolumns % GM June 2007
% That's all folks!