The translation has come to an end.
Exit Zen
7
../../principles/transport.rst:25
English
Networked applications do not exchange random messages. In order to ensure that the server is able to understand the queries sent by a client, and also that the client is able to understand the responses sent by the server, they must both agree on a set of syntactical and semantic rules. These rules define the format of the messages exchanged as well as their ordering. This set of rules is called an application-level `protocol`.
0/4320 · 432
8
../../principles/transport.rst:27
English
An `application-level protocol` is similar to a structured conversation between humans. Assume that Alice wants to know the current time but does not have a watch. If Bob passes close by, the following conversation could take place :
0/2330 · 233
15
../../principles/transport.rst:41
English
Such a conversation succeeds if both Alice and Bob speak the same language. If Alice meets Tchang who only speaks Chinese, she won't be able to ask him the current time. A conversation between humans can be more complex. For example, assume that Bob is a security guard whose duty is to only allow trusted secret agents to enter a meeting room. If all agents know a secret password, the conversation between Bob and Trudy could be as follows :
0/4430 · 443
16
../../principles/transport.rst:43 • ../../principles/transport.rst:49
English
Bob : `What is the secret password ?`
0/370 · 37
18
../../principles/transport.rst:45
English
Bob : `This is the correct password, you're welcome`
0/520 · 52
19
../../principles/transport.rst:47
English
If Alice wants to enter the meeting room but does not know the password, her conversation could be as follows :
0/1110 · 111
25
../../principles/transport.rst:58
English
Let us first discuss the syntactical rules. We will later explain how the information flow can be organized by analyzing real networked applications.
0/1490 · 149
26
../../principles/transport.rst:60
English
Application-layer protocols exchange two types of messages. Some protocols such as those used to support electronic mail exchange messages expressed as strings or lines of characters. As the transport layer allows hosts to exchange bytes, they need to agree on a common representation of the characters. The first and simplest method to encode characters is to use the :term:`ASCII` table. :rfc:`20` provides the ASCII table that is used by many protocols on the Internet. For example, the table defines the following binary representations :
0/5420 · 542
27
../../principles/transport.rst:62
English
`A` : `1000011b`
0/160 · 16
28
../../principles/transport.rst:63
English
`0` : `0110000b`
0/160 · 16
29
../../principles/transport.rst:64
English
`z` : `1111010b`
0/160 · 16
30
../../principles/transport.rst:65
English
`@` : `1000000b`
0/160 · 16
31
../../principles/transport.rst:66
English
`space` : `0100000b`
0/200 · 20
32
../../principles/transport.rst:68
English
In addition, the :term:`ASCII` table also defines several non-printable or control characters. These characters were designed to allow an application to control a printer or a terminal. These control characters include `CR` and `LF`, that are used to terminate a line, and the `Bell` character which causes the terminal to emit a sound.
0/3360 · 336
33
../../principles/transport.rst:70
English
`carriage return` (`CR`) : `0001101b`
0/370 · 37
34
../../principles/transport.rst:71
English
`line feed` (`LF`) : `0001010b`
0/310 · 31
35
../../principles/transport.rst:72
English
`Bell`: `0000111b`
0/180 · 18
36
../../principles/transport.rst:74
English
The :term:`ASCII` characters are encoded as a seven bits field, but transmitted as an eight-bits byte whose high order bit is usually set to `0`. Bytes are always transmitted starting from the high order or most significant bit.
0/2280 · 228
37
../../principles/transport.rst:76
English
Most applications exchange strings that are composed of fixed or variable numbers of characters. A common solution to define the character strings that are acceptable is to define them as a grammar using a Backus-Naur Form (:term:`BNF`) such as the Augmented BNF defined in :rfc:`5234`. A BNF is a set of production rules that generate all valid character strings. For example, consider a networked application that uses two commands, where the user can supply a username and a password. The BNF for this application could be defined as shown in the figure below.
0/5630 · 563
38
../../principles/transport.rst:82
English
A simple BNF specification
0/260 · 26