Exit Zen
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
8
../../bibliography.rst:24
English
Bonomi, F. and Fendick, K.W., `The rate-based flow control framework for the available bit rate ATM service <https://dx.doi.org/10.1109/65.372653>`_, IEEE Network, Mar/Apr 1995, Volume: 9, Issue: 2, pages : 25-39
0/2140 · 214
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
10
../../bibliography.rst:35
English
Bux, W., `Token-ring local-area networks and their performance <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=18625>`_, Proceedings of the IEEE, Vol 77, No 2, p. 238-259, Feb. 1989
0/1870 · 187
11
../../bibliography.rst:36
English
Buford, J., Yu, H., Lua, E.K., `P2P Networking and Applications <http://books.google.com/books?id=O9NkAaY9YxMC>`_, Morgan Kaufmann, 2008
0/1360 · 136
12
../../bibliography.rst:39
English
Calvert, K., Donahoo, M., `TCP/IP Sockets in Java : Practical Guide for Programmers <http://books.google.com/books?id=lfHo7uMk7r4C>`_, Morgan Kaufman, 2008
0/1550 · 155
13
../../bibliography.rst:40
English
Chiu, D., Jain, R., `Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks <https://dx.doi.org/10.1016/0169-7552(89)90019-6>`_, Computer Networks and ISDN Systems Vol 17, pp 1-14, 1989
0/2250 · 225
14
../../bibliography.rst:48
English
Clark D., `The Design Philosophy of the DARPA Internet Protocols <https://dx.doi.org/10.1145/205447.205458>`_, Computer Communications Review 18:4, August 1988, pp. 106-114
0/1720 · 172
15
../../bibliography.rst:51
English
Cohen, D., `On Holy Wars and a Plea for Peace`, IEN 137, April 1980, http://www.ietf.org/rfc/ien/ien137.txt
0/1070 · 107
16
../../principles/naming.rst:82
English
This hierarchical naming scheme is a key component of the Domain Name System (DNS). The DNS is a distributed database that contains mappings between fully qualified domain names and addresses. The DNS uses the client-server model. The clients are hosts or applications that need to retrieve the mapping for a given name. Each :term:`nameserver` stores part of the distributed database and answers the queries sent by clients. There is at least one :term:`nameserver` that is responsible for each domain. In the figure below, domains are represented by circles and there are three hosts inside domain `dom` (`h1`, `h2` and `h3`) and three hosts inside domain `a.sdom1.dom`. As shown in the figure below, a sub-domain may contain both host names and sub-domains.
0/7600 · 760
16
../../bibliography.rst:52
English
Donahoo, M., Calvert, K., `TCP/IP Sockets in C: Practical Guide for Programmers <http://books.google.com/books?id=dmt_mERzxV4C>`_ , Morgan Kaufman, 2009
0/1520 · 152
17
../../principles/naming.rst:107
English
A :term:`nameserver` that is responsible for domain `dom` can directly answer the following queries :
0/1010 · 101
17
../../bibliography.rst:62
English
Davik, F. Yilmaz, M. Gjessing, S. Uzun, N., `IEEE 802.17 resilient packet ring tutorial <https://dx.doi.org/10.1109/MCOM.2004.1273782>`_, IEEE Communications Magazine, Mar 2004, Vol 42, N 3, p. 112-118
0/2040 · 204
18
../../principles/naming.rst:109
English
the address of any host residing directly inside domain `dom` (e.g. `h2.dom` in the figure above)
0/970 · 97
18
../../bibliography.rst:63
English
Dijkstra, E., `A Note on Two Problems in Connection with Graphs <https://dx.doi.org/10.1007/BF01386390>`_. Numerische Mathematik, 1:269- 271, 1959
0/1460 · 146
19
../../principles/naming.rst:110
English
the nameserver(s) that are responsible for any direct sub-domain of domain `dom` (i.e. `sdom1.dom` and `sdom2.dom` in the figure above, but not `z.sdom1.dom`)
0/1580 · 158
19
../../bibliography.rst:64
English
Wikipedia, `Dijkstra's algorithm <https://en.wikipedia.org/wiki/Dijkstra's_algorithm>`_
0/870 · 87
20
../../principles/naming.rst:112
English
To retrieve the mapping for host `h2.dom`, a client sends its query to the name server that is responsible for domain `.dom`. The name server directly answers the query. To retrieve a mapping for `h3.a.sdom1.dom` a DNS client first sends a query to the name server that is responsible for the `.dom` domain. This nameserver returns the nameserver that is responsible for the `sdom1.dom` domain. This nameserver can now be contacted to obtain the nameserver that is responsible for the `a.sdom1.dom` domain. This nameserver can be contacted to retrieve the mapping for the `h3.a.sdom1.dom` name. Thanks to this structure, it is possible for a DNS client to obtain the mapping of any host inside the `.dom` domain or any of its subdomains. To ensure that any DNS client will be able to resolve any fully qualified domain name, there are special nameservers that are responsible for the root of the domain name hierarchy. These nameservers are called :term:`root nameserver`.
0/9720 · 972
20
../../bibliography.rst:66
English
Fletcher, J., `An Arithmetic Checksum for Serial Transmissions <https://dx.doi.org/10.1109/TCOM.1982.1095369>`_, Communications, IEEE Transactions on, Jan. 1982, Vol. 30, N. 1, pp. 247-252
0/1880 · 188
21
../../principles/naming.rst:114
English
Each root nameserver maintains the list [#froot]_ of all the nameservers that are responsible for each of the top-level domain names and their addresses [#frootv6]_. All root nameservers cooperate and provide the same answers. By querying any of the root nameservers, a DNS client can obtain the nameserver that is responsible for any top-level-domain name. From this nameserver, it is possible to resolve any domain name.
0/4220 · 422