Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Hierarchical routing The complex problem of routing on large networks can be simplified by breaking a network into a hierarchy of smaller networks, where each level is responsible for its own routing. The Internet has, basically, three levels: the backbones, the mid-levels, and the stub networks. The backbones know how to route between the mid-levels, the mid-levels know how to route between the sites, and each site (being an autonomous system) knows how to route internally. See also Exterior Gateway Protocol, Interior Gateway Protocol, transit network. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
Note: Most Transmission Control Protocol/Internet Protocol (TCP/IP) routing is based on a two-level hierarchical routing in which an IP address is divided into a network portion and a host portion. Gateways use only the network portion until an IP datagram reaches a gateway that can deliver it directly. Additional levels of hierarchical routing are introduced by the addition of subnetworks.
Source: from Federal Standard 1037C
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Hierarchical routing."
Proper Noun Anagrams | |
| Words within the letters "a-a-c-c-e-g-h-h-i-i-i-l-n-o-r-r-r-t-u" | |
-5 letters: Rhineloricaria. | |
| Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)48 49 45 52 41 52 43 48 49 43 41 4C 52 4F 55 54 49 4E 47 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001000 01001001 01000101 01010010 01000001 01010010 01000011 01001000 01001001 01000011 01000001 01001100 00100000 01010010 01001111 01010101 01010100 01001001 01001110 01000111 |
HTML Code (1990) (references)H I E R A R C H I C A L   R O U T I N G |
ISO 10646 (1991-1993) (references)0048 0049 0045 0052 0041 0052 0043 0048 0049 0043 0041 004C 0052 004F 0055 0054 0049 004E 0047 |
Encryption (beginner's substitution cypher): (references)424339523552374243373546252495554434841 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
