Exit Zen
23
../../protocols/rpc.rst:100
English
The second sub-problem is how to reach the callee. A simple solution to this problem is to make sure that the callee listens on a specific port on the remote machine and then exchange information with this server process. This is the solution chosen for JSON-RPC [JSON-RPC2]_. JSON-RPC can be used over the connectionless or the connection-oriented transport service. A JSON-RPC request contains the following fields:
0/4170 · 417
23
../../protocols/ssh.rst:204
English
a key used by the client (resp. server) to encrypt the data that it sends
0/730 · 73
23
../../protocols/tcp.rst:50
English
the `RST` is used in case of problems or when an invalid segment has been received
0/820 · 82
23
../../protocols/tls.rst:47
English
990
0/100 · 3
23
../../protocols/transport-service.rst:65
English
The second transport service is the connection-oriented service. On the Internet, this service is often called the `byte-stream service` as it creates a reliable byte stream between the two applications that are linked by a transport connection. Like the datagram service, the networked applications that use the byte-stream service are identified by the host on which they run and a port number. These hosts can be identified by an address or a name. The figure below illustrates two applications that are using the byte-stream service provided by the TCP protocol on IPv6 hosts. The byte stream service provided by TCP is reliable and bidirectional.
0/6510 · 651
23
../../protocols/udp.rst:74
English
the entire UDP segment, including its header
0/440 · 44
23
../../protocols/wifi.rst:24
English
11 Mbps
0/100 · 7
24
../../bibliography.rst:74
English
Feldmeier, D. C., `Fast software implementation of error detection codes <https://dx.doi.org/10.1109/90.477710>`_. IEEE/ACM Transactions Networking 3, 6 (Dec. 1995), 640-651.
0/1740 · 174
24
../../glossary.rst:24
English
broadcast
0/100 · 9
24
../../exercises/ex-sharing.rst:559
English
How is the maximum round-trip-time influenced if the buffers of router `R1` store 10 packets ?
0/940 · 94
24
../../exercises/reliability.rst:54
English
Reliable protocols rely on different types of checksums to verify whether frames have been affected by transmission errors. The most frequently used checksums are :
188/1640 · 164
24
../../exercises/network.rst:210
English
`R1->R2->R4` and `R3->R2->R5->R4`
32/330 · 33
24
../../exercises/sockets.rst:224
English
This system call will assign the socket ``sockfd`` to the ``addr`` remote socket address. The process can then use the ``send`` and ``write`` system calls that do not to specify the destination socket address. Furthermore, the calls to ``recv`` and ``read`` will only deliver messages sent by this remote address. This is useful when we only care about the other peer messages.
414/3770 · 377
24
../../exercises/transport.rst:155
English
Footnotes
21/100 · 9
24
../../principles/naming.rst:123
English
Benefits of names
29/170 · 17
24
../../principles/referencemodels.rst:103
English
The upper layer of our architecture is the `Application layer`. This layer includes all the mechanisms and data structures that are necessary for the applications. We will use Application Data Unit (ADU) or the generic Service Data Unit (SDU) term to indicate the data exchanged between two entities of the Application layer.
362/3250 · 325
24
../../principles/reliability.rst:63
English
set the voltage on the electrical wire at ``-5V`` during one millisecond to transmit a bit set to `0`
108/1010 · 101
24
../../principles/sharing.rst:133
English
Besides the link bandwidth, the buffers on the network nodes are the second type of resource that needs to be shared inside the network. The node buffers play an important role in the operation of the network because that can be used to absorb transient traffic peaks. Consider again the example above. Assume that on average host `A` and host `B` send a group of three packets every ten seconds. Their combined transmission rate (0.6 packets per second) is, on average, lower than the network capacity (1 packet per second). However, if they both start to transmit at the same time, node `R1` will have to absorb a burst of packets. This burst of packets is a small `network congestion`. We will say that a network is congested, when the sum of the traffic demand from the hosts is larger than the network capacity :math:`\sum{demand}>capacity`. This `network congestion` problem is one of the most difficult resource sharing problem in computer networks. `Congestion` occurs in almost all networks. Minimizing the amount of congestion is a key objective for many network operators. In most cases, they will have to accept transient congestion, i.e. congestion lasting a few seconds or perhaps minutes, but will want to prevent congestion that lasts days or months. For this, they can rely on a wide range of solutions. We briefly present some of these in the paragraphs below.
0/13780 · 1378
24
../../protocols/dns.rst:81
English
Some DNS resolvers allow any host to send queries. Google operates a `public DNS resolver <https://developers.google.com/speed/public-dns/docs/using>`_ at addresses `2001:4860:4860::8888` and `2001:4860:4860::8844`. Other companies provide similar services.
291/2570 · 257
24
../../principles/security.rst:310
English
A secret key encryption scheme is a perfectly reversible functions, i.e. given an encryption function `E`, there is an associated decryption function `D` such that :math:`\forall k \forall M : D(K, E(M,K))=M`.
0/2090 · 209