Exit Zen
5
../../exercises/network.rst:42
English
Same question as above, but the network is modified as shown in the figure below.
0/810 · 81
5
../../exercises/reliability.rst:19
English
How would you set the duration of the retransmission timer in the alternating bit protocol ?
0/920 · 92
5
../../exercises/sockets.rst:100
English
The socket API is quite low-level and should be used only when you need a complete control of the network access. If your application simply needs, for instance, to retrieve data from a web server, there are much simpler and higher-level APIs.
0/2430 · 243
5
../../exercises/transport.rst:18
English
A reliable connection oriented transport places a 32 bits sequence number inside the segment header to number the segments. This sequence number is incremented for each data segment. The connection starts as shown in the figure below :
0/2350 · 235
5
../../principles/naming.rst:15
English
Because names are at a higher level than addresses, they allow (both in the example of programming above, and on the Internet) to treat addresses as mere technical identifiers, which can change at will. Only the names are stable.
0/2290 · 229
5
../../principles/network.rst:18
English
Before explaining the operation of the network layer, it is useful to remember the characteristics of the service provided by the `datalink` layer. There are many variants of the datalink layer. Some provide a reliable service while others do not provide any guarantee of delivery. The reliable datalink layer services are popular in environments such as wireless networks where transmission errors are frequent. On the other hand, unreliable services are usually used when the physical layer provides an almost reliable service (i.e. only a negligible fraction of the frames are affected by transmission errors). Such `almost reliable` services are frequently used in wired and optical networks. In this chapter, we will assume that the datalink layer service provides an `almost reliable` service since this is both the most general one and also the most widely deployed one.
0/8770 · 877
5
../../principles/referencemodels.rst:21
English
Our reference model is divided into five layers, as shown in the figure below.
0/780 · 78
5
../../principles/reliability.rst:33
English
`electrical cable`. Information can be transmitted over different types of electrical cables. The most common ones are the twisted pairs (that are used in the telephone network, but also in enterprise networks) and the coaxial cables (that are still used in cable TV networks, but are no longer used in enterprise networks). Some networking technologies operate over the classical electrical cable.
0/3980 · 398
6
../../bibliography.rst:17
English
Androutsellis-Theotokis, S. and Spinellis, D.. .. 2004. `A survey of peer-to-peer content distribution technologies <http://doi.acm.org/10.1145/1041680.1041681>`_. ACM Computing Surveys 36, 4 (December 2004), 335-371.
0/2170 · 217
6
../../glossary.rst:15
English
anycast
0/100 · 7
6
../../index.rst:37
English
Part 1: Principles
0/180 · 18
6
../../exercises/ex-sharing.rst:66
English
In a shared medium, a collision may happen if two hosts transmit at almost the same time as shown in the example below.
0/1190 · 119
6
../../exercises/network.rst:67
English
Routing protocols used in data networks only use positive link weights. What would happen with a distance vector routing protocol in the network below that contains a negative link weight ?
0/1890 · 189
6
../../exercises/reliability.rst:22
English
A version of the Alternating Bit Protocol supporting variable length frames uses a header that contains the following fields :
0/1260 · 126
6
../../exercises/sockets.rst:102
English
A detailed discussion of the socket API is outside the scope of this section and the references cited above provide a detailed discussion of all the details of the socket API. As a starting point, it is interesting to compare the socket API with the service primitives that we have discussed in the previous chapter. Let us first consider the connectionless service that consists of the following two primitives :
0/4140 · 414
6
../../exercises/transport.rst:38
English
Continue the connection so that `Host B` sends `Hello` as data and `Host A` replies by sending `Pleased to meet you`. After having received the response, `Host B` closes the connection gracefully and `Host A` does the same. Discuss on the state that needs to be maintained inside each host.
0/2900 · 290
6
../../principles/naming.rst:19
English
The first solution that allowed applications to use names was the :term:`hosts.txt` file. This file is similar to the symbol table found in compiled code. It contains the mapping between the name of each Internet host and its associated address [#fhosts]_. It was maintained by SRI International that coordinated the Network Information Center (NIC). When a new host was connected to the network, the system administrator had to register its name and address at the NIC. The NIC updated the :term:`hosts.txt` file on its server. All Internet hosts regularly retrieved the updated :term:`hosts.txt` file from the SRI_ server. This file was stored at a well-known location on each Internet host (see :rfc:`952`) and networked applications could use it to find the address corresponding to a name.
0/7940 · 794
6
../../protocols/dns.rst:26
English
The DNS header
0/140 · 14
7
../../bibliography.rst:20
English
Abramson, N., `THE ALOHA SYSTEM: another alternative for computer communications <http://doi.acm.org/10.1145/1478462.1478502>`_. In Proceedings of the November 17-19, 1970, Fall Joint Computer Conference (Houston, Texas, November 17 - 19, 1970). AFIPS '70 (Fall). ACM, New York, NY, 281-285.
0/2910 · 291
7
../../glossary.rst:17
English
a transmission mode where an information is sent from one source to `one` receiver that belongs to a specified group
0/1160 · 116