Exit Zen
165
../../protocols/tcp.rst:544
English
TCP connection release
0/220 · 22
166
../../glossary.rst:98
English
The Simple Network Management Protocol is a management protocol defined for TCP/IP networks.
0/920 · 92
166
../../principles/linkstate.rst:9
English
Link state routing
0/180 · 18
166
../../principles/sharing.rst:760
English
As shown in the graph above, a rate allocation may be fair but not efficient (e.g. :math:`r_A=0.7,r_B=0.7`), fair and efficient ( e.g. :math:`r_A=1,r_B=1`) or efficient but not fair (e.g. :math:`r_A=1.5,r_B=0.5`). Ideally, the allocation should be both fair and efficient. Unfortunately, maintaining such an allocation with fluctuations in the number of flows that use the network is a challenging problem. Furthermore, there might be several thousands flows that pass through the same link [#fflowslink]_.
0/5060 · 506
166
../../protocols/email.rst:264
English
h
0/100 · 1
166
../../protocols/ipv6.rst:541
English
``2`` : Packet Too Big. The router that was to send the ICMPv6 message received an IPv6 packet that is larger than the MTU of the outgoing link. The ICMPv6 message contains the MTU of this link in bytes. This allows the sending host to implement Path MTU discovery :rfc:`1981`
0/2760 · 276
166
../../protocols/wifi.rst:54
English
An 802.11 infrastructure network
0/320 · 32
166
../../protocols/tcp.rst:548
English
TCP, like most connection-oriented transport protocols, supports two types of connection releases :
0/990 · 99
167
../../glossary.rst:120
English
socket
0/100 · 6
167
../../principles/linkstate.rst:11
English
Link state routing is the second family of routing protocols. While distance vector routers use a distributed algorithm to compute their routing tables, link-state routers exchange messages to allow each router to learn the entire network topology. Based on this learned topology, each router is then able to compute its routing table by using a shortest path computation such as Dijkstra's algorithm [Dijkstra1959]_. A detailed description of this shortest path algorithm may be found in [Wikipedia:Dijkstra]_.
0/5110 · 511
167
../../principles/reliability.rst:693
English
Pipelining improves the performance of reliable protocols
0/570 · 57
167
../../principles/sharing.rst:762
English
To deal with these fluctuations in demand, which result in fluctuations in the available bandwidth, computer networks use a congestion control scheme. This congestion control scheme should achieve the three objectives listed above. Some congestion control schemes rely on a close cooperation between the end hosts and the routers, while others are mainly implemented on the end hosts with limited support from the routers.
0/4220 · 422
167
../../protocols/email.rst:264
English
50
0/100 · 2
167
../../protocols/ipv6.rst:542
English
``3`` : Time Exceeded. This error message can be sent either by a router or by a host. A router would set `code` to `0` to report the reception of a packet whose `Hop Limit` reached `0`. A host would set `code` to `1` to report that it was unable to reassemble received IPv6 fragments.
0/2850 · 285
167
../../protocols/wifi.rst:56
English
An 802.11 access point is a relay that operates in the datalink layer like switches. The figure below represents the layers of the reference model that are involved when a WiFi host communicates with a host attached to an Ethernet network through an access point.
0/2630 · 263
167
../../protocols/tcp.rst:550
English
graceful connection release, where each TCP user can release its own direction of data transfer after having transmitted all data
0/1290 · 129
168
../../glossary.rst:122
English
A low-level API originally defined on Berkeley Unix to allow programmers to develop clients and servers.
0/1040 · 104
168
../../principles/linkstate.rst:13
English
For link-state routing, a network is modeled as a `directed weighted graph`. Each router is a node, and the links between routers are the edges in the graph. A positive weight is associated to each directed edge and routers use the shortest path to reach each destination. In practice, different types of weights can be associated to each directed edge :
0/3540 · 354
168
../../principles/reliability.rst:695
English
`Pipelining` allows the sender to transmit frames at a higher rate. However this higher transmission rate may overload the receiver. In this case, the frames sent by the sender will not be correctly received by their final destination. The reliable protocols that rely on pipelining allow the sender to transmit `W` unacknowledged frames before being forced to wait for an acknowledgment from the receiving entity.
0/4140 · 414
168
../../principles/sharing.rst:764
English
A congestion control scheme can be modeled as an algorithm that adapts the transmission rate (:math:`r_i(t)`) of host :math:`i` based on the feedback received from the network. Different types of feedback are possible. The simplest scheme is a binary feedback [CJ1989]_ [Jacobson1988]_ where the hosts simply learn whether the network is congested or not. Some congestion control schemes allow the network to regularly send an allocated transmission rate in Mbps to each host [BF1995]_.
0/4870 · 487