Time-To-Live: Difference between revisions
(changed language template according to mediawikirecovery plan) |
|||
| Line 1: | Line 1: | ||
{{Language}} | {{Language}} | ||
== | == Time-To-Live === | ||
This term stems from the TCP/IP communication library used to send and receive transmissions over the Internet and other public and private networks. The Time-To-Live defines the number of [[Hops|hops]] a packet may go through before it is discarded. This was an early means of traffic control to prevent a packet from getting stuck in a [[RoutingLoop|routing loop]] or traversing more nodes of the network than were necessary only to find that the destination was unreachable (this scheme makes the assumption that the destination will be reachable in a practical situation in under 255 hops). | This term stems from the TCP/IP communication library used to send and receive transmissions over the Internet and other public and private networks. The Time-To-Live defines the number of [[Hops|hops]] a packet may go through before it is discarded. This was an early means of traffic control to prevent a packet from getting stuck in a [[RoutingLoop|routing loop]] or traversing more nodes of the network than were necessary only to find that the destination was unreachable (this scheme makes the assumption that the destination will be reachable in a practical situation in under 255 hops). | ||
As a packet passes through routers on its way to a destination, the router deducts one value from its TTL and then sends it on to the next hop. If a router finds that the TTL value is 0 upon arrival, it will either forward the packet to the destination if it has reached the correct network, or discard it if the network will require more hops. In this way, packets are given specific lifespans, or "time to live." | As a packet passes through routers on its way to a destination, the router deducts one value from its TTL and then sends it on to the next hop. If a router finds that the TTL value is 0 upon arrival, it will either forward the packet to the destination if it has reached the correct network, or discard it if the network will require more hops. In this way, packets are given specific lifespans, or "time to live." | ||
Gnutella used a similar scheme to prevent gnutella transmissions from flooding too many nodes -- searches were originally defined by a TTL value which was between 0 and the maximum acceptable value of 15. Now, this system is primarily archaic as new, more efficient methods of routing have prevailed. The TTL, however, is still supported for backward compatibility and some other uses in Shareaza's network stack. For more information on where TTL is used in Shareaza, take a look at | Gnutella used a similar scheme to prevent gnutella transmissions from flooding too many nodes -- searches were originally defined by a TTL value which was between 0 and the maximum acceptable value of 15. Now, this system is primarily archaic as new, more efficient methods of routing have prevailed. The TTL, however, is still supported for backward compatibility and some other uses in Shareaza's network stack. For more information on where TTL is used in Shareaza, take a look at Shareaza's [[Advanced Settings]]. | ||
Revision as of 19:57, 8 November 2009
 Languages: |
[[::Time-To-Live|English]] • [[::Time-To-Live/de|Deutsch]] • [[::Time-To-Live/es|Español]] • [[::Time-To-Live/fr|Français]] • [[::Time-To-Live/he|עברית]] • [[::Time-To-Live/it|Italiano]] • [[::Time-To-Live/nl|Nederlands]] • [[::Time-To-Live/pl|Polski]] • [[::Time-To-Live/pt|Português]] • [[::Time-To-Live/ru|Русский]] • [[::Time-To-Live/zh-hant|中文(繁體)]] | e |
Time-To-Live =
This term stems from the TCP/IP communication library used to send and receive transmissions over the Internet and other public and private networks. The Time-To-Live defines the number of hops a packet may go through before it is discarded. This was an early means of traffic control to prevent a packet from getting stuck in a routing loop or traversing more nodes of the network than were necessary only to find that the destination was unreachable (this scheme makes the assumption that the destination will be reachable in a practical situation in under 255 hops).
As a packet passes through routers on its way to a destination, the router deducts one value from its TTL and then sends it on to the next hop. If a router finds that the TTL value is 0 upon arrival, it will either forward the packet to the destination if it has reached the correct network, or discard it if the network will require more hops. In this way, packets are given specific lifespans, or "time to live."
Gnutella used a similar scheme to prevent gnutella transmissions from flooding too many nodes -- searches were originally defined by a TTL value which was between 0 and the maximum acceptable value of 15. Now, this system is primarily archaic as new, more efficient methods of routing have prevailed. The TTL, however, is still supported for backward compatibility and some other uses in Shareaza's network stack. For more information on where TTL is used in Shareaza, take a look at Shareaza's Advanced Settings.