Exit Zen
26
../../bibliography.rst:85
English
Garcia-Lunes-Aceves, J., `Loop-Free Routing Using Diffusing Computations <https://dx.doi.org/10.1109/90.222913>`_, IEEE/ACM Transactions on Networking, Vol. 1, No, 1, Feb. 1993
0/1760 · 176
26
../../glossary.rst:129
English
CIDR
0/100 · 4
26
../../exercises/ex-sharing.rst:561
English
Assume now that `R1` is using round-robin scheduling instead of a FIFO buffer. One queue is used to store the packets sent by `A` and another for the packets sent by `B`. `A` sends one 1000 bits packet every second while `B` sends packets at 10 Mbps. What is the round-trip-time measured by each of these two hosts if each of the two queues of `R1` can store 5 packets ?
0/3700 · 370
26
../../exercises/network.rst:240
English
`R1->R5->R4` and `R3->R2->R4`
0/290 · 29
26
../../exercises/reliability.rst:57
English
the 16 bits or the 32 bits Cyclical Redundancy Checks (CRC) that are often used on disks, in zip archives and in datalink layer protocols. See http://rosettacode.org/wiki/CRC-32 for CRC-32 implementations in various languages.
0/2260 · 226
26
../../exercises/sockets.rst:259
English
Creating a new socket to communicate through a network
0/540 · 54
26
../../principles/naming.rst:127
English
if the server process moves to another physical server, all clients must be informed about the new server address
0/1130 · 113
26
../../principles/network.rst:104
English
The figure illustrates some possible forwarding tables in this network. By inspecting the forwarding tables of the different routers, one can find the path followed by packets sent from a source to a particular destination. In the example above, host `A` sends its packet to router `R1`. `R1` consults its forwarding table and forwards the packet towards `R2`. Based on its own table, `R2` decides to forward the packet to `R5` that can deliver it to its destination. Thus, the path from `A` to `J` is `A -> R1 -> R2 -> R5 -> J`.
0/5290 · 529
26
../../principles/referencemodels.rst:116
English
physical layer entities exchange bits
0/370 · 37
26
../../principles/reliability.rst:66
English
every millisecond, record the voltage applied on the electrical wire. If the voltage is set to ``+5V``, record the reception of bit `1`. Otherwise, record the reception of bit `0`
0/1790 · 179
26
../../principles/sharing.rst:139
English
Congestion collapse on the Internet
0/350 · 35
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
../../bibliography.rst:93
English
ISO, `Intermediate System to Intermediate System intra-domain routeing information exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service (ISO 8473) <http://standards.iso.org/ittf/PubliclyAvailableStandards/c030932_ISO_IEC_10589_2002(E).zip>`_ , 2002
0/3080 · 308
27
../../glossary.rst:131
English
Classless Inter Domain Routing is the current address allocation architecture for IP version 4. It was defined in :rfc:`1518` and :rfc:`4632`.
0/1420 · 142
27
../../exercises/ex-sharing.rst:564
English
When analyzing the reaction of a network using round-robin schedulers, it is sometimes useful to consider that the packets sent by each source are equivalent to a fluid and that each scheduler acts as a tap. Using this analogy, consider the network below. In this network, all the links are 100 Mbps and host `B` is sending packets at 100 Mbps. If A sends at 1, 5, 10, 20, 30, 40, 50, 60, 80 and 100 Mbps, what is the throughput that destination `D` will receive from `A`. Use this data to plot a graph that shows the portion of the traffic sent by host `A` which is received by host `D`.
0/5880 · 588
27
../../exercises/sockets.rst:261
English
Until now, we learned how to use sockets that were already created. When writing a whole program, you will have to create you own sockets and choose the concrete technology that it will use to communicate with others. In this section, we will create new sockets and allow a program to communicate with processes located on another computer using a network. The most recent standardized technology used to communicate through a network is the :term:`IPv6` network protocol. In the IPv6 protocol, hosts are identified using *IPv6 addresses*. Modern operating systems allow IPv6 network communications between programs to be done using the socket API, just as we did in the previous sections.
0/6890 · 689
27
../../principles/naming.rst:128
English
if there are many concurrent clients, the load of the server will increase without any possibility of adding another server without changing the server addresses used by the clients
0/1810 · 181
27
../../principles/referencemodels.rst:117
English
datalink layer entities exchange *frames*
0/410 · 41
27
../../principles/reliability.rst:70
English
This transmission scheme has been used in some early networks. We use it as a basis to understand how hosts communicate. From a Computer Science viewpoint, dealing with voltages is unusual. Computer scientists frequently rely on models that enable them to reason about the issues that they face without having to consider all implementation details. The physical transmission scheme described above can be represented by using a `time-sequence diagram`.
0/4540 · 454
27
../../principles/sharing.rst:141
English
Congestion collapse is unfortunately not only an academic experience. Van Jacobson reports in [Jacobson1988]_ one of these events that affected him while he was working at the Lawrence Berkeley Laboratory (LBL). LBL was two network nodes away from the University of California in Berkeley. At that time, the link between the two sites had a bandwidth of 32 Kbps, but some hosts were already attached to 10 Mbps LANs. "In October 1986, the data throughput from LBL to UC Berkeley ... dropped from 32 Kbps to 40 bps. We were fascinated by this sudden factor-of-thousand drop in bandwidth and embarked on an investigation of why things had gotten so bad." This work lead to the development of various congestion control techniques that have allowed the Internet to continue to grow without experiencing widespread congestion collapse events.
0/8390 · 839