Exit Zen
8
../../protocols/ipv6.rst:71
English
The third type of datalink layers are used in Non-Broadcast Multi-Access (NBMA) networks. These networks are used to interconnect devices like a LAN. All devices attached to an NBMA network are identified by a unique datalink layer address. However, and this is the main difference between an NBMA network and a traditional LAN, the NBMA service only supports unicast. The datalink layer service provided by an NBMA network supports neither broadcast nor multicast.
0/4650 · 465
8
../../protocols/ppp.rst:18
English
The `Link Control Protocol` that is used to negotiate options and authenticate the session by using username and password or other types of credentials
0/1510 · 151
8
../../protocols/ppp.rst:21
English
The PPP framing :rfc:`1662` was inspired by the datalink layer protocols standardized by ITU-T and ISO. A typical PPP frame is composed of the fields shown in the figure below. A PPP frame starts with a one byte flag containing `01111110`. PPP can use bit stuffing or character stuffing depending on the environment where the protocol is used. The address and control fields are present for backward compatibility reasons. The 16 bit Protocol field contains the identifier [#fpppid]_ of the network layer protocol that is carried in the PPP frame. `0x002d` is used for an IPv4 packet compressed with :rfc:`1144` while `0x002f` is used for an uncompressed IPv4 packet. `0xc021` is used by the Link Control Protocol, `0xc023` is used by the Password Authentication Protocol (PAP). `0x0057` is used for IPv6 packets. PPP supports variable length packets, but LCP can negotiate a maximum packet length. The PPP frame ends with a Frame Check Sequence. The default is a 16 bits CRC, but some implementations can negotiate a 32 bits CRC. The frame ends with the `01111110` flag.
0/10710 · 1071
8
../../protocols/routing.rst:25
English
When we consider the interconnection of domains that are managed by different organizations, this is no longer true. Each domain implements its own routing policy. A routing policy is composed of three elements : an `import filter` that specifies which routes can be accepted by a domain, an `export filter` that specifies which routes can be advertised by a domain and a ranking algorithm that selects the best route when a domain knows several routes towards the same destination prefix. As we will see later, another important difference is that the objective of the interdomain routing protocol is to find the `cheapest` route towards each destination. There is only one interdomain routing protocol : :term:`BGP`.
0/7180 · 718
8
../../protocols/rpc.rst:16
English
The callee returns the control of execution to the caller's
0/590 · 59
8
../../protocols/ssh.rst:81
English
In practice, an ``ssh`` implementation supports four types of cryptographic algorithms :
0/880 · 88
8
../../protocols/tcp.rst:20
English
non-interactive multimedia applications (flash, ...)
0/520 · 52
8
../../protocols/tls.rst:41
English
TLS port
0/100 · 8
8
../../protocols/transport-service.rst:18
English
the `port number` on which the application `listens` for SDUs
0/610 · 61
8
../../protocols/udp.rst:43
English
UDP uses a single segment format shown in the figure below.
0/590 · 59
8
../../protocols/wifi.rst:19
English
Typical throughput
0/180 · 18
9
../../bibliography.rst:28
English
Beech, W., Nielsen, D., Taylor, J., `AX.25 Link Access Protocol for Amateur Packet Radio <http://www.tapr.org/pdf/AX25.2.2.pdf>`_, version 2.2, Revision: July 1998
0/1640 · 164
9
../../index.rst:149
English
Appendices
7/100 · 10
9
../../glossary.rst:119
English
Application Programming Interface
0/330 · 33
9
../../exercises/ex-sharing.rst:150
English
In ALOHA, the hosts rely on acknowledgments to detect whether their frame has been received correctly by the destination. Consider a network running at 100 Mbps where the host exchange 1000 bits frames and acknowledgments of 100 bits. Draw the frames sent by hosts A and B in the figure below. Assume that a square corresponds to 10 microseconds and that the cable has a length of 2 kilometers.
0/3940 · 394
9
../../exercises/reliability.rst:26
English
a Cyclic Redundancy Check (`CRC`)
42/330 · 33
9
../../exercises/network.rst:94
English
In this network, assume that all the link weights are set to 1. What is the paths followed by a packet sent by the router located in `Los Angeles` to reach :
164/1570 · 157
9
../../exercises/sockets.rst:107
English
The `DATA` primitives are exchanged through a service access point. In the socket API, the equivalent to the service access point is the `socket`. A `socket` is a data structure which is maintained by the networking stack and is used by the application every time it needs to send or receive data through the networking stack.
348/3260 · 326
9
../../exercises/transport.rst:60
English
Consider a reliable connection-oriented transport protocol that provides the bytestream service. In this transport protocol, the sequence number that is placed inside each DATA segment reflects the position of the bytes in the bytestream. Considering the connection shown below, provide the DATA segments that are sent by `Host A` in response to the `DATA.request`, assuming that one segment is sent for each `DATA.request`.
428/4240 · 424
9
../../principles/naming.rst:25
English
Each top-level domain is managed by an organization that decides how sub-domain names can be registered. Most top-level domain names use a first-come first served system, and allow anyone to register domain names, but there are some exceptions. For example, `.gov` is reserved for the US government, `.int` is reserved for international organizations and names in the `.ca` are mainly `reserved <http://en.wikipedia.org/wiki/.ca>`_ for companies or users that are present in Canada.
604/4820 · 482