Network topology: Difference between revisions

Browse history interactively ← Previous edit Next edit →Content deleted Content addedVisual WikitextInline

Revision as of 19:15, 15 May 2006 editIlmari Karonen (talk \| contribs)Extended confirmed users14,453 editsm restoring "See also" section and interwiki changes after revert← Previous edit		Revision as of 14:37, 22 November 2006 edit undoYandman (talk \| contribs)Extended confirmed users5,709 edits Revert to revision 89408052 dated 2006-11-22 07:52:25 by AntiVandalBot using popups Next edit →
(153 intermediate revisions by 82 users not shown)
Line 1:		Line 1:
			{{otherusesof\|topology}}
	:''For other senses of the word "topology", see ].''

	A '''network topology''' is the pattern of ] connecting pairs of ]s of a ]. A given node has one or more links to others, and the links can appear in a variety of different shapes. The simplest connection is a one-way link between two devices. A second return link can be added for two-way communication. Modern communications cables usually include more than one wire in order to facilitate this, although very simple ]-based networks have two-way communication on a single wire.		A '''network topology''' is the pattern of ]s connecting pairs of ]s of a ]. A ] or other communications system is an example of such a topology. A given node has one or more links to others, and the links can appear in a variety of different shapes. The simplest connection is a one-way link between two devices. A second return link can be added for two-way communication. Modern communications cables usually include more than one wire in order to facilitate this, although very simple ]-based networks have two-way communication on a single wire.

	Network topology is determined only by the configuration of connections between nodes; it is therefore a part of ]. Distances between nodes, physical interconnections, ] rates, and/or ] types are not a matter of network topology, although they may be affected by it in an actual physical network.		Network topology is determined only by the configuration of connections between nodes; it is therefore a part of ]. Distances between nodes, physical interconnections, ] rates, and/or ] types are not a matter of network topology, although they may be affected by it in an actual physical network.
Line 10:		Line 10:

	==Daisy chains==		==Daisy chains==
	Except for ~~bus~~-based networks, the easiest way to add more computers into a network is by ], or connecting each computer in series to the next. If a message is intended for a computer partway down the line, each system bounces it along in sequence until it reaches the destination. A daisy-chained network can take two basic forms: linear and ring.		Except for star-based networks, the easiest way to add more computers into a network is by ], or connecting each computer in series to the next. If a message is intended for a computer partway down the line, each system bounces it along in sequence until it reaches the destination. A daisy-chained network can take two basic forms: linear and ring.

	*A ''']''' puts a two-way link between one computer and the next. However, this was expensive in the early days of computing, since each computer (except for the ones at each end) required two receivers and two transmitters.		*A ''']''' puts a two-way link between one computer and the next. However, this was expensive in the early days of computing, since each computer (except for the ones at each end) required two receivers and two transmitters.
	*By connecting the computers at each end, a ''']''' can be formed. An advantage of the ring is that the number of transmitters and receivers can be cut in half, since a message will eventually loop all of the way around. When a ] sends a message, the message is processed by each computer in the ring. If a computer is not the destination node, it will pass the message to the next node, until the message arrives at its destination. If the message is not accepted by any node on the network, it will travel around the entire ring and return to the sender. This potentially results in a doubling of travel time for data, but since it is traveling at a significant fraction of the ], the loss is usually negligible.		*By connecting the computers at each end, a ''']''' can be formed. An advantage of the ring is that the number of transmitters and receivers can be cut in half, since a message will eventually loop all of the way around. When a ] sends a message, the message is processed by each computer in the ring. If a computer is not the destination node, it will pass the message to the next node, until the message arrives at its destination. If the message is not accepted by any node on the network, it will travel around the entire ring and return to the sender. This potentially results in a doubling of travel time for data, but since it is traveling at a significant fraction of the ], the loss is usually negligible

			==Centralization==
	The primary problem with daisy-chaining is that if a single link is cut, the entire network can go down. A linear network would become two separate "islands", while a one-way ring network would fail completely. A two-way ring network could continue operating if a single link was cut, and would only break down into separate islands if two links went down.

	==Centralisation==
	The ''']''' reduces the chance of network failure by connecting all of the systems to a central node. When applied to a bus-based network, this central ] rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The ] of a ] linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the rest of the systems will be unaffected.		The ''']''' reduces the chance of network failure by connecting all of the systems to a central node. When applied to a bus-based network, this central ] rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The ] of a ] linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the rest of the systems will be unaffected.

Line 27:		Line 25:
	If a link connecting a leaf fails, that leaf is isolated; if a connection to a non-leaf node fails, an entire section of the network becomes isolated from the rest.		If a link connecting a leaf fails, that leaf is isolated; if a connection to a non-leaf node fails, an entire section of the network becomes isolated from the rest.

	In order to alleviate the amount of network traffic that comes from broadcasting everything everywhere, more advanced central nodes were developed that would keep track of the identities of different systems connected to the network. These ]es will "learn" the layout of the network by first broadcasting ]s everywhere, then observing where response packets come from...		In order to alleviate the amount of network traffic that comes from broadcasting everything everywhere, more advanced central nodes were developed that would keep track of the identities of different systems connected to the network. These ]es will "learn" the layout of the network by first broadcasting ]s everywhere, then observing where response packets come from.

			==Decentralization==
	==Decentralisation==

	In a '''] topology''', there are at least two nodes with two or more paths between them. A special kind of mesh, limiting the number of hops between two nodes, is a ]. The number of arbitrary ]s in mesh networks makes them more difficult to design and implement, but their decentralized nature makes them very useful. This is similar in some ways to a ''']''', where a linear or ring topology is used to connect systems in multiple directions. A multi-dimensional ring has a ~~toroidal (~~]) topology, for instance.		In a '''] topology''', there are at least two nodes with two or more paths between them. A special kind of mesh, limiting the number of hops between two nodes, is a ]. The number of arbitrary ]s in mesh networks makes them more difficult to design and implement, but their decentralized nature makes them very useful. This is similar in some ways to a ''']''', where a linear or ring topology is used to connect systems in multiple directions. A multi-dimensional ring has a ] topology, for instance.

		⚫	A ''']''', '''complete topology''' or '''full mesh topology''' is a network topology in which there is a direct link between all pairs of nodes. In a fully connected network with n nodes, there are n(n-1)/2 direct links. Networks designed with this topology are usually very expensive to set up, but have a high amount of reliability due to multiple paths data can travel on. This topology is mostly seen in ] applications. However, it can also be seen in the ] protocol ] in which users connect to other users in the "swarm" by allowing each user sharing the file to connect to other users also involved. Oftentimes in actual usage of BitTorrent any given individual node is rarely connected to every single other node as in a true fully connected network but the protocol does allow for the possibility for any one node to connect to any other node when sharing files.

⚫	A '''fully connected''', '''complete topology''' or '''full mesh topology''' is a network topology in which there is a direct link between all pairs of nodes. In a fully connected network with n nodes, there are n(n-1)/2 direct links. Networks designed with this topology are usually very expensive to set up, but have a high amount of reliability due to multiple paths data can travel on. This topology is mostly seen in ] applications.

	==Hybrids==		==Hybrids==
	Hybrid networks use a combination of any two or more topologies in such a way that the resulting network does not have one of the standard forms. For example, a tree network connected to a tree network is still a tree network, but two star networks connected together (known as extended star) exhibit hybrid network topologies. A hybrid topology is always produced when two different basic network topologies are connected. Two common examples for Hybrid network are: ''star ring network'' and ''star bus network''		Hybrid networks use a combination of any two or more topologies in such a way that the resulting network does not have one of the standard forms. For example, a tree network connected to a tree network is still a tree network, but two star networks connected together (known as extended star) exhibit hybrid network topologies. A hybrid topology is always produced when two different basic network topologies are connected. Two common examples for Hybrid network are: ''star ring network'' and ''star bus network''
	*A Star ring network consists of two or more star topologies connected using a ] (MAU) as a centralized hub.		*A Star ring network consists of two or more star topologies connected using a ] (MAU) as a centralized hub.
	*A Star Bus network consists of two or more star topologies connected using a bus trunk (the bus trunk serves as the network's backbone).		*A Star Bus network consists of two or more star topologies connected using a bus trunk (the bus trunk serves as the network's backbone).

Line 47:		Line 46:
	*]		*]
	*]		*]
			*]
			*]
			*]
			*]

	== External links ==		== External links ==
			* Manufacturer of High Quality, Commercial Grade Mesh Nodes based on LocustWorld Pro Firmware.
	* The list contains the mesh topologies of many real transport networks.
			* An open source meshap offering for community networks as well as commercial offerings.
			* Don Moskaluk Paper on Wireless Mesh using Locustworld Open Source.
	* ''Real example =- spanning tree'': http://map.efnet.org/ -- Live map of the topology of EFnet, the traditional IRC network		* ''Real example =- spanning tree'': http://map.efnet.org/ -- Live map of the topology of EFnet, the traditional IRC network

Line 56:		Line 61:

	<!--Interwiki-->		<!--Interwiki-->

	]		]
	]		]
			]
			]
	]		]
	]		]
	]		]
			]
	]		]
	]		]
Line 70:		Line 79:
	]		]
	]		]
			]
	]		]

Revision as of 14:37, 22 November 2006

For other uses of "topology", see topology (disambiguation).

A network topology is the pattern of links connecting pairs of nodes of a network. A LAN or other communications system is an example of such a topology. A given node has one or more links to others, and the links can appear in a variety of different shapes. The simplest connection is a one-way link between two devices. A second return link can be added for two-way communication. Modern communications cables usually include more than one wire in order to facilitate this, although very simple bus-based networks have two-way communication on a single wire.

Network topology is determined only by the configuration of connections between nodes; it is therefore a part of graph theory. Distances between nodes, physical interconnections, transmission rates, and/or signal types are not a matter of network topology, although they may be affected by it in an actual physical network.

Daisy chains

Except for star-based networks, the easiest way to add more computers into a network is by daisy-chaining, or connecting each computer in series to the next. If a message is intended for a computer partway down the line, each system bounces it along in sequence until it reaches the destination. A daisy-chained network can take two basic forms: linear and ring.

A linear topology puts a two-way link between one computer and the next. However, this was expensive in the early days of computing, since each computer (except for the ones at each end) required two receivers and two transmitters.
By connecting the computers at each end, a ring topology can be formed. An advantage of the ring is that the number of transmitters and receivers can be cut in half, since a message will eventually loop all of the way around. When a node sends a message, the message is processed by each computer in the ring. If a computer is not the destination node, it will pass the message to the next node, until the message arrives at its destination. If the message is not accepted by any node on the network, it will travel around the entire ring and return to the sender. This potentially results in a doubling of travel time for data, but since it is traveling at a significant fraction of the speed of light, the loss is usually negligible

Centralization

The star topology reduces the chance of network failure by connecting all of the systems to a central node. When applied to a bus-based network, this central hub rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The failure of a transmission line linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the rest of the systems will be unaffected.

If the central node is passive, the originating node must be able to tolerate the reception of an echo of its own transmission, delayed by the two-way transmission time (i.e. to and from the central node) plus any delay generated in the central node. An active star network has an active central node that usually has the means to prevent echo-related problems.

A tree topology (a.k.a. hierarchical topology) can be viewed as a collection of star networks arranged in a hierarchy. This tree has individual peripheral nodes (i.e. leaves) which are required to transmit to and receive from one other node only and are not required to act as repeaters or regenerators. Unlike the star network, the function of the central node may be distributed.

As in the conventional star network, individual nodes may thus still be isolated from the network by a single-point failure of a transmission path to the node. If a link connecting a leaf fails, that leaf is isolated; if a connection to a non-leaf node fails, an entire section of the network becomes isolated from the rest.

In order to alleviate the amount of network traffic that comes from broadcasting everything everywhere, more advanced central nodes were developed that would keep track of the identities of different systems connected to the network. These network switches will "learn" the layout of the network by first broadcasting data packets everywhere, then observing where response packets come from.

Decentralization

In a mesh topology, there are at least two nodes with two or more paths between them. A special kind of mesh, limiting the number of hops between two nodes, is a hypercube. The number of arbitrary forks in mesh networks makes them more difficult to design and implement, but their decentralized nature makes them very useful. This is similar in some ways to a grid network, where a linear or ring topology is used to connect systems in multiple directions. A multi-dimensional ring has a toroidal topology, for instance.

A fully connected network, complete topology or full mesh topology is a network topology in which there is a direct link between all pairs of nodes. In a fully connected network with n nodes, there are n(n-1)/2 direct links. Networks designed with this topology are usually very expensive to set up, but have a high amount of reliability due to multiple paths data can travel on. This topology is mostly seen in military applications. However, it can also be seen in the file sharing protocol BitTorrent in which users connect to other users in the "swarm" by allowing each user sharing the file to connect to other users also involved. Oftentimes in actual usage of BitTorrent any given individual node is rarely connected to every single other node as in a true fully connected network but the protocol does allow for the possibility for any one node to connect to any other node when sharing files.

Hybrids

Hybrid networks use a combination of any two or more topologies in such a way that the resulting network does not have one of the standard forms. For example, a tree network connected to a tree network is still a tree network, but two star networks connected together (known as extended star) exhibit hybrid network topologies. A hybrid topology is always produced when two different basic network topologies are connected. Two common examples for Hybrid network are: star ring network and star bus network

A Star ring network consists of two or more star topologies connected using a multistation access unit (MAU) as a centralized hub.
A Star Bus network consists of two or more star topologies connected using a bus trunk (the bus trunk serves as the network's backbone).

While grid networks have found popularity in high-performance computing applications, some systems have used genetic algorithms to design custom networks that have the fewest possible hops in between different nodes. Some of the resulting layouts are nearly incomprehensible, although they do function quite well.

External links

AirMatrix Manufacturer of High Quality, Commercial Grade Mesh Nodes based on LocustWorld Pro Firmware.
LocustWorld An open source meshap offering for community networks as well as commercial offerings.
Wireless Mesh Topology Don Moskaluk Paper on Wireless Mesh using Locustworld Open Source.
Real example =- spanning tree: http://map.efnet.org/ -- Live map of the topology of EFnet, the traditional IRC network

Category:

Network topology