Hierarchical routing

Hierarchical routing

Hierarchical routing: Routing that is based on hierarchical addressing.

"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

Hierarchical routing is the procedure of arranging routers in a hierarchical manner. A good example would be to consider a corporate intranet. Most corporate intranets consist of a high speed backbone network. Connected to this backbone are routers which are in turn connected to a particular workgroup. These workgroups occupy a unique LAN. The reason this is a good arrangement is because even though there might be dozens of different workgroups, the span of this particular description is only 2. The span of a network is the maximum hop count to get from one host to any other host on the network. Even if the workgroups divided their LAN network into smaller partitions, the span could only increase to 4 in this particular example. Considering alternative solutions with every router connected to every other router, or if every router was connected to 2 routers, shows the convenience of hierarchical routing. It decreases the complexity of network topology, increases routing efficiency, and causes much less congestion because of fewer routing advertisements. It is important to note that with hierarchical routing, only core routers connected to the backbone are aware of all routes. Routers that lie within a LAN only know about routes in the LAN. Unrecognized destinations are passed to the default route.

External Link - [http://www.isi.edu/nsnam/ns/doc-stable/node310.html http://www.isi.edu/nsnam/ns/doc-stable/node310.html]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Hierarchical state routing — (HSR), proposed in Scalable Routing Strategies for Ad Hoc Wireless Networks by Iwata et al. (1999), is a typical example of a hierarchical routing protocol.HSR maintains a hierarchical topology, where elected clusterheads at the lowest level… …   Wikipedia

  • Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… …   Wikipedia

  • Routing in the PSTN — is the process used to route telephone calls across the public switched telephone network. This process is the same whether the call is made between two phones in the same locality, or across two different continents. Contents 1 Relationship… …   Wikipedia

  • Hierarchical incompetence — A key feature of large hierarchical organizations is the over simplification of issues and the loss of tacit knowledge about issues as they ascend the hierarchy, and the tendency for lateral communication across the various departments, fiefdoms …   Wikipedia

  • Hierarchical internetworking model — The Hierarchical internetworking model, or three layer model , is a network design model first proposed by Cisco. Thethree layer model divides enterprise networks into three layers: core, distribution, and access layer. Each layer provides… …   Wikipedia

  • List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… …   Wikipedia

  • List of ad hoc routing protocols — An ad hoc routing protocol is a convention, or standard, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network . In ad hoc networks, nodes are not familiar with the topology of their… …   Wikipedia

  • Temporally-ordered routing algorithm — The Temporally Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad hoc networks. It was developed by Vincent Park at the University of Maryland and the Naval Research Laboratory. Park has… …   Wikipedia

  • Link-state routing protocol — A link state routing protocol is one of the two main classes of routing protocols used in packet switched networks for computer communications. Examples of link state routing protocols include OSPF and IS IS.The link state protocol is performed… …   Wikipedia

  • Information Routing Group — An Information Routing Group (or IRG ) is one of a semi infinite set of similar interlocking and overlapping groups each IRG containing a group of ( maybe 3 to 200) individuals (IRGists) and each IRG loosely sharing a particular common interest;… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”