Home > Store

NFS Illustrated

Register your product to gain access to bonus material or receive a coupon.

NFS Illustrated

Best Value Purchase

Book + eBook Bundle

  • Your Price: $56.06
  • List Price: $95.94
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

More Purchase Options


  • Your Price: $39.96
  • List Price: $49.95
  • Usually ships in 24 hours.

eBook (Watermarked)

  • Your Price: $36.79
  • List Price: $45.99
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.


  • Copyright 2000
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 552
  • Edition: 1st
  • Book
  • ISBN-10: 0-201-32570-5
  • ISBN-13: 978-0-201-32570-6

The Network File System (NFS) protocol that enables remote access to files is now a key element of any LAN. It is also currently and increasingly used as a key technology with the Web and wide area networks.

Written for programmers creating NFS-based applications, network engineers creating new implementations of NFS, and network managers, NFS Illustrated promotes a thorough understanding of that protocol through extensive diagrams and real protocol traces that show NFS in action. Covering NFS versions 2 and 3, the book also looks into WebNFS and the new NFS version 4, with Internet support. Detailed and authoritative, the book not only examines NFS in depth, but also describes the protocols that underlie and support it, including External Data Representation (XDR), Remote Procedure Call (RPC), the NFS MOUNT protocol, and the NFS Lock Manager protocol. It discusses several NFS variants and compares NFS to a number of alternative file systems.

You will find a detailed discussion on the NFS filesystem model and a procedure-by-procedure description of NFS versions 2 and 3, illustrated through the use of snoop traces that capture and display protocol packets from the network. In addition, the book addresses real-world implementation issues faced by those building an NFS client or server, factors that affect NFS performance, and critical performance benchmarks.

Specific topics of interest include:

  • NFS version 4, highlighting performance improvements, security features, and cross-platform interoperability for Internet operation
  • RPC authentication and security
  • Differences between NFS versions 2 and 3
  • Implementation issues for clients and servers
  • Read-ahead and write-behind
  • Caching policies
  • The Lock Manager protocol
  • Automounting
  • NFS variants, including Spritely NFS, NQNFS, Trusted NFS, and NASD NFS
  • NFS competitors: RFS, AFS, DCE/DFS, and CIFS
  • The PCNFS protocol for implementing NFS on PC operating systems
  • SPEC SFS benchmarks, WebNFS, and firewalls

Comprehensive and current, NFS Illustrated is an essential resource for network professionals who want to use this widespread and evolving technology to its fullest.

Sample Content

Table of Contents

(Each chapter concludes with a Summary.)



File Access and File Transfer.

Early File Access Protocols.


Organization of This Book.

XDR—External Data Representation.

Protocols and Transportable Data.

A Canonical Standard.

XDR Unit.

Primitive XDR Data Types.


Unsigned Integer.


Hyper Integer and Unsigned Hyper Integer.

Fixed-Length Opaque Data.

Variable-Length Opaque Data String.

Structured XDR Data Types.

Fixed-Length Array.

Variable-Length Array.

Discriminated Union.

Linked Lists.

XDR Language.

Notational Conventions.

Lexical Notes.

Syntax Information.

Syntax Notes.

Example of an XDR Data Description.

XDR Language Variant in This Book.


Remote Procedure Call Model.

RPC Transport Independence and Semantics.

Program Numbers and Versioning.

Requirements of the RPC Protocol.

RPC Call Message.

RPC Reply Message.

Record-Marking Standard.

Portmapper and Rpcbind.

Portmap Protocol.

Rpcbind Protocol.

RPC Authentication.

RPC Credential and Verifier.

Authentication Flavors.

Null Authentication.

System Authentication.

Diffie-Hellman Authentication.


DH Authentication Verifiers.

Nicknames and Clock Synchronization.

DH Authentication Protocol.

DH Full Network Name Credential and Verifier.

DH Nickname Credential and Verifier.

Server Verifier.

Diffie-Hellman Encryption.

Weaknesses of DH Authentication.

Kerberos Version 4 Authentication.

Kerberos Naming.

Kerberos-Based Authentication Protocol Specification.

Kerberos Full Network Name Credential and Verifier.

Kerberos Nickname Credential and Verifier.

Server Verifier.

Kerberos-Specific Authentication Status.


Weaknesses of Kerberos Authentication.

RPCSEC__GSS Authentication.

RPCSEC__GSS Security Protocol.

RPCSEC-GSS Credential.

Context Creation.

Successful Creation Response.

Unsuccessful Context Creation.

RPC Data Exchange.

Data Integrity Protection.

Data Privacy.

Server Processing of RPC Data Requests.

Server's Reply.


Performance of RPCSEC-GSS.

Snoop Trace of Session.

Connection-Based Security.

NFS Filesystem Model.

Filesystem and Filesystem Objects.



Filename Component Handling.

Pathname Evaluation.

Stateless Server.

Server Recovery.

Idempotent Operations.

Statelessness and High Availability.

NFS Version 2.

Common Data Types.

Server Procedures.

NULL—Do Nothing.

GETATTR—Get File Attributes.

SETATTR—Set File Attributes.

LOOKUP—Look Up File Name.

READLINK—Read from Symbolic Link.

READ—Read from File.

WRITE—Write to File.

CREATE—Create File.

REMOVE—Remove File.

RENAME—Rename File.

LINK—Create Link to File.

SYMLINK—Create Symbolic Link.

MKDIR—Create Directory.

RMDIR—Remove Directory.

READDIR—Read from Directory.

STATFS—Get Filesystem Attributes.

NFS Version 3.

Changes from the NFS Version 2 Protocol.

Deleted Procedures.

Modified Procedures.

New Procedures.

Filehandle Size.

Maximum Data Sizes.

Error Return.

File Type.

File Attributes.

Set File Attributes.

32-Bit Clients/Servers and 64-Bit.


Basic Data Types.


Basic Data Types.

Server Procedures.

NULL—Do Nothing.

GETATTR—Get File Attributes.

SETATTR—Set File Attributes.

LOOKUP—Look Up Filename.

ACCESS—Check Access Permission.

READLINK—Read from Symbolic Link.

READ—Read from File.

WRITE—Write to File.

CREATE—Create a File.

MKDIR—Create a Directory.

SYMLINK—Create a Symbolic Link.

MKNOD—Create a Special Device.

REMOVE—Remove a File.

RMDIR—Remove Directory.

RENAME—Rename File or Directory.

LINK—Create Link to an Object.

READDIR—Read from Directory.

READDIRPLUS—Extended Read from Directory.

FSSTAT—Get Dynamic Filesystem Information.

FSINFO—Get Static Filesystem Information.

PATHCONF—Retrieve POSIX Information.

COMMIT—Commit Cached Data on a Server to Stable Storage.

NFS Implementation.

File Attributes.

Unsupported Procedures.

Multiple Version Support.

Last Close Problem.

Crossing of Server Mountpoints.

Problems with Hierarchical Mounts.

Permission Issues.

Identifying Users.

Access to Open Files.

UID/GID Mapping.

Checking File Access.

Executable Files.

Concurrent RPC Calls.

Duplicate Request Cache.

Synchronous Operations and Stable Storage.

Adaptive Retransmission for UDP.

Read-ahead and Write-behind.

Write Gathering.

Caching Policies.

Cached Objects.

@AHEADS = Cache Consistency.

Close-to-Open Consistency.

Read and Write Caching.

Disk Caching.

Disconnection and Reconnection.


NFS MOUNT Protocol.

Protocol Revisions.



Access Lists.

Server Procedures.

NULL—Do Nothing.





MOUNTPROC__EXPORT—Return Export List.



POSIX Pathconf.


MOUNT Table.


Export Limitations.

NFS Lock Manager Protocol.

Monitored Locking.

Advisory vs. Mandatory Locks.

Exclusive and Nonexclusive Locks.

Asynchronous Procedures and Callback.

DOS/Windows File Sharing Procedures.

Server Crash Recovery.

Lockd and Statd Implementation.

Client Crash Recovery.

Deadlock Detection.

Locking Cached or Mapped Files.

Transport and Authentication.

Basic Data Types.


Lock Manager Procedures.

NULL—Do Nothing.

NLM__TEST—Test for a Lock.

NLM__LOCK—Create a Lock.

NLM__CANCEL—Cancel a Lock.

NLM__UNLOCK—Remove a Lock.

NLM__GRANTED—Lock Is Granted.

NLM__SHARE—Share a File.

NLM__UNSHARE—Unshare a File.

NLM__NM__LOCK—Establish a

Nonmonitored Lock.

NLM__FREE__ALL—Free All Locks.

Network Status Monitor Protocol.

SM__NULL—Do Nothing.

SM__STAT—Check Status.

SM__MON—Monitor a Host.

SM__UNMON—Unmonitor a Host.

SM__UNMON-ALL—Unmonitor All Hosts.

SM__SIMU-CRASH—Simulate a Crash.

SM__NOTIFY—Notify a Host.


Automounter as NFS Server.

Problems with Symbolic Links.

Automounting with Autofs.

Automounter Maps.

Master Map.

Direct Map.

Indirect Map.

Executable Map.

Offset Mounts.

Multiple Mounts.

Replica Servers.

Map Variables and Key Substitution.

MOUNT Options.

Amd Automounter.

Nonblocking Operation.

Server Keepalives.

Map Syntax.

NFS Variants.

Spritely NFS.

Stateful Server.








Other Features.

Trusted NFS.

AUTH__MLS Credential.

Extended Attributes.

Filename Attributes.

TNFS Interoperability.


NASD Storage.

Locating the Data.

Data Security.

Other Distributed Filesystems.

Remote File Sharing.

Remote System Calls.

RFS Naming.

Security and UID/GID Mapping.

Andrew File System.

File Caching.

Shared Namespace.

Volume Movement.

Read-only Replication.



Cache Consistency with Tokens.

DFS Namesp. 0201325705T04062001


I have been working with the NFS protocol since I joined Sun Microsystems in 1986. At that time the NFS market was expanding rapidly and I was excited to be working with the group, led by Bob Lyon, that developed the protocol and its first implementation in SunOS. In the NFS group, the protocol was a powerful but raw technology that needed to be exploited. We wanted it to run on as many platforms as possible, so an NFS porting group was assigned the task of helping other companies implement NFS on their computers.

Our NFS evangelism was a little ahead of its time. Before the phrase "open systems" had yet become hackneyed, we'd made the source code for Sun RPC available for free download via FTP server1 and organized the first Connectathon event. At Connectathon our enthusiasm for NFS was shared with engineers from other companies who brought along their machines, source code, and junk food and spent a few days connected to a network, testing their NFS client and server implementations against each other.

Implementations of the NFS protocol have been successful in bringing remote file access to programs through existing interfaces. There is no need to change the software for remote file access or to name files differently. NFS has been almost too successful at making remote files indistinguishable from local files. For instance, a program that backs up files on a local disk to tape needs to avoid stumbling into NFS filesystems. For everyone but system administrators, NFS is invisible--if you ignore the rare "NFS server not responding" message.

It's easy to forget NFS is there. NFS has no programming interface of its own. Even software engineers have no need to deal with NFS directly. There are no conference tutorials called "Programming with NFS," there are no magazine screen shots of NFS-enabled applications, and there are no demonstrations of NFS at trade shows. Except for server admin-istrators, NFS seems not to exist.

There are many server implementations of the NFS protocol, each with its own features. Each of these server implementations has its own documentation, each slightly different. Perhaps this explains why there are so few NFS books available. NFS is never more than a chapter in a book about the operating system in which it is embedded.

Although NFS implementations vary, there is an underlying invariant: the protocol itself. NFS is not a single protocol. Not only are there two versions of the protocol in use now, but there is a third version in development as well. The NFS protocol is layered on XDR and RPC protocols, and no implementation is complete without the MOUNT and Lock Manager protocols. I wanted to bring all the NFS protocols together into a single volume along with other topics unique to NFS, such as Connectathon and the SPEC SFS benchmarks.

I wanted this book to describe the protocol in detail in a more interesting way than a dry, text-only specification. I was inspired by Richard Stevens's book TCP/IP Illustrated, Volume 1. This book is an excellent example of network protocols animated through the use of diagrams and real protocol traces that show the protocol in action. I have used that book as a model for my own description of the NFS protocols. I hope you will appreciate it as a useful reference.

1. It is still available today via the Connectathon Web site, www.connectathon.org


Many people have helped me write this book. I attribute the idea for the book to Carol Long, my first editor at Addison Wesley Longman. Thanks to Richard Stevens and John Ousterhout for the advice and encouragement I needed to begin this venture. I'm grateful to my editor, Mary O'Brien, for her generous support and encouragement over the two years it took to write the book and to Elizabeth Spainhour for prompt handling of my drafts and reviews.

I'm very grateful to fellow NFS engineer Mike Eisler, who gave me prompt and insightful feedback on several drafts. Agnes Jacob did me a great favor in filling a draft with lots of yellow sticky notes with suggestions that helped improve the readability of some of my more obscure text. I'm thankful that Mike Kupfer and Salit Gazit were able to guide me through the mysteries of the Network Lock Manager--their experience with this protocol was invaluable. David Robinson and Spencer Shepler, who both spent several years developing the SPEC SFS benchmarks, corrected my description of SFS benchmarking and offered useful background material.

Thanks to Alex Chiu for the corrections he provided to my account of the WebNFS security negotiation protocol. Carl Beame and Fred Whiteside were invaluable in their review of the PC-NFS chapter. In particular, they provided me with useful material on their BWNFSD daemon implementation. Thanks to Jeff Mogul for his thorough review of my short description of his work on Spritely NFS and to Rick Macklem for checking my description of his NQNFS variant of NFS version 2. I'm grateful to Gary Winiger for the corrections and additional material he offered for the section on Trusted NFS (TNFS).

Special thanks to my technical reviewers for tolerating my lengthy (and sometimes incomplete) manuscripts. To be a useful reference, a technical book depends heavily on the accumulated experience of its reviewers. Thanks to Ran Atkinson, Richard Basch, Bob Gilligan, Clemens Huebner, Ron Hutchins, Kirk McKusick, Tom McNeal, Vernon Schryver, Hal Stern, Dana Treadwell, and Andy Watson.

I'm grateful to my employer, Sun Microsystems, Inc., for giving me the time and resources to write this book. A special thanks to my managers for their unwavering support: Cindy Vinores, David Brittle, and Bev Crair. Thanks to Professional Computing Series editors Brian Kernighan and Craig Partridge for their detailed and helpful reviews.

Finally, I'm grateful for the patience and understanding of my family: my wife, Barbara, and sons, Luke and Eli. Not only did they cheerfully put up with my frequent absences to work on "The Book," they also provided needed encouragement.



Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020