throbber
Case 3:17-cv-05659-WHA Document 390-11 Filed 03/14/19 Page 1 of 5
`
`Exhibit H
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 3:17-cv-05659-WHA Document 390-11 Filed 03/14/19 Page 2 of 5
`
`Network Working Group T. Berners-Lee
`Request for Comments: 3986 W3C/MIT
`STD: 66 R. Fielding
`Updates: 1738 Day Software
`Obsoletes: 2732, 2396, 1808 L. Masinter
`Category: Standards Track Adobe Systems
` January 2005
`
` Uniform Resource Identifier (URI): Generic Syntax
`
`Status of This Memo
`
` This document specifies an Internet standards track protocol for the
` Internet community, and requests discussion and suggestions for
` improvements. Please refer to the current edition of the "Internet
` Official Protocol Standards" (STD 1) for the standardization state
` and status of this protocol. Distribution of this memo is unlimited.
`
`Copyright Notice
`
` Copyright (C) The Internet Society (2005).
`
`Abstract
`
` A Uniform Resource Identifier (URI) is a compact sequence of
` characters that identifies an abstract or physical resource. This
` specification defines the generic URI syntax and a process for
` resolving URI references that might be in relative form, along with
` guidelines and security considerations for the use of URIs on the
` Internet. The URI syntax defines a grammar that is a superset of all
` valid URIs, allowing an implementation to parse the common components
` of a URI reference without knowing the scheme-specific requirements
` of every possible identifier. This specification does not define a
` generative grammar for URIs; that task is performed by the individual
` specifications of each URI scheme.
`
`Berners-Lee, et al. Standards Track [Page 1]
`
`

`

`Case 3:17-cv-05659-WHA Document 390-11 Filed 03/14/19 Page 3 of 5
`
`
`RFC 3986 URI Generic Syntax January 2005
`
`1.1.2. Examples
`
` The following example URIs illustrate several URI schemes and
` variations in their common syntax components:
`
` ftp://ftp.is.co.za/rfc/rfc1808.txt
`
` http://www.ietf.org/rfc/rfc2396.txt
`
` ldap://[2001:db8::7]/c=GB?objectClass?one
`
` mailto:John.Doe@example.com
`
` news:comp.infosystems.www.servers.unix
`
` tel:+1-816-555-1212
`
` telnet://192.0.2.16:80/
`
` urn:oasis:names:specification:docbook:dtd:xml:4.1.2
`
`1.1.3. URI, URL, and URN
`
` A URI can be further classified as a locator, a name, or both. The
` term "Uniform Resource Locator" (URL) refers to the subset of URIs
` that, in addition to identifying a resource, provide a means of
` locating the resource by describing its primary access mechanism
` (e.g., its network "location"). The term "Uniform Resource Name"
` (URN) has been used historically to refer to both URIs under the
` "urn" scheme [RFC2141], which are required to remain globally unique
` and persistent even when the resource ceases to exist or becomes
` unavailable, and to any other URI with the properties of a name.
`
` An individual scheme does not have to be classified as being just one
` of "name" or "locator". Instances of URIs from any given scheme may
` have the characteristics of names or locators or both, often
` depending on the persistence and care in the assignment of
` identifiers by the naming authority, rather than on any quality of
` the scheme. Future specifications and related documentation should
` use the general term "URI" rather than the more restrictive terms
` "URL" and "URN" [RFC3305].
`
`Berners-Lee, et al. Standards Track [Page 7]
`
`

`

`Case 3:17-cv-05659-WHA Document 390-11 Filed 03/14/19 Page 4 of 5
`
`
`RFC 3986 URI Generic Syntax January 2005
`
` coordinates on a map. Likewise, a URI scheme may define components
` with additional encoding requirements that are applied prior to
` forming the component and producing the URI.
`
` When a new URI scheme defines a component that represents textual
` data consisting of characters from the Universal Character Set [UCS],
` the data should first be encoded as octets according to the UTF-8
` character encoding [STD63]; then only those octets that do not
` correspond to characters in the unreserved set should be percent-
` encoded. For example, the character A would be represented as "A",
` the character LATIN CAPITAL LETTER A WITH GRAVE would be represented
` as "%C3%80", and the character KATAKANA LETTER A would be represented
` as "%E3%82%A2".
`
`3. Syntax Components
`
` The generic URI syntax consists of a hierarchical sequence of
` components referred to as the scheme, authority, path, query, and
` fragment.
`
` URI = scheme ":" hier-part [ "?" query ] [ "#" fragment ]
`
` hier-part = "//" authority path-abempty
` / path-absolute
` / path-rootless
` / path-empty
`
` The scheme and path components are required, though the path may be
` empty (no characters). When authority is present, the path must
` either be empty or begin with a slash ("/") character. When
` authority is not present, the path cannot begin with two slash
` characters ("//"). These restrictions result in five different ABNF
` rules for a path (Section 3.3), only one of which will match any
` given URI reference.
`
` The following are two example URIs and their component parts:
`
` foo://example.com:8042/over/there?name=ferret#nose
` \_/ \______________/\_________/ \_________/ \__/
` | | | | |
` scheme authority path query fragment
` | _____________________|__
` / \ / \
` urn:example:animal:ferret:nose
`
`Berners-Lee, et al. Standards Track [Page 16]
`
`

`

`Case 3:17-cv-05659-WHA Document 390-11 Filed 03/14/19 Page 5 of 5
`
`
`RFC 3986 URI Generic Syntax January 2005
`
`3.1. Scheme
`
` Each URI begins with a scheme name that refers to a specification for
` assigning identifiers within that scheme. As such, the URI syntax is
` a federated and extensible naming system wherein each scheme’s
` specification may further restrict the syntax and semantics of
` identifiers using that scheme.
`
` Scheme names consist of a sequence of characters beginning with a
` letter and followed by any combination of letters, digits, plus
` ("+"), period ("."), or hyphen ("-"). Although schemes are case-
` insensitive, the canonical form is lowercase and documents that
` specify schemes must do so with lowercase letters. An implementation
` should accept uppercase letters as equivalent to lowercase in scheme
` names (e.g., allow "HTTP" as well as "http") for the sake of
` robustness but should only produce lowercase scheme names for
` consistency.
`
` scheme = ALPHA *( ALPHA / DIGIT / "+" / "-" / "." )
`
` Individual schemes are not specified by this document. The process
` for registration of new URI schemes is defined separately by [BCP35].
` The scheme registry maintains the mapping between scheme names and
` their specifications. Advice for designers of new URI schemes can be
` found in [RFC2718]. URI scheme specifications must define their own
` syntax so that all strings matching their scheme-specific syntax will
` also match the <absolute-URI> grammar, as described in Section 4.3.
`
` When presented with a URI that violates one or more scheme-specific
` restrictions, the scheme-specific resolution process should flag the
` reference as an error rather than ignore the unused parts; doing so
` reduces the number of equivalent URIs and helps detect abuses of the
` generic syntax, which might indicate that the URI has been
` constructed to mislead the user (Section 7.6).
`
`3.2. Authority
`
` Many URI schemes include a hierarchical element for a naming
` authority so that governance of the name space defined by the
` remainder of the URI is delegated to that authority (which may, in
` turn, delegate it further). The generic syntax provides a common
` means for distinguishing an authority based on a registered name or
` server address, along with optional port and user information.
`
` The authority component is preceded by a double slash ("//") and is
` terminated by the next slash ("/"), question mark ("?"), or number
` sign ("#") character, or by the end of the URI.
`
`Berners-Lee, et al. Standards Track [Page 17]
`
`

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket