Skip to search formSkip to main contentSkip to account menu

Time to live

Known as: Time-to-live, Ping TTL, Hop limit 
Time to live (TTL) or hop limit is a mechanism that limits the lifespan or lifetime of data in a computer or network. TTL may be implemented as a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Broadcast radiationCache (computing)Cache invalidationCaptive portal

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Contact expectation based routing for delay tolerant networks
2012
2012
Fair content dissemination in participatory DTNs
Highly Cited
2011
Highly Cited
2011
TTL based routing in opportunistic networks
Highly Cited
2006
Highly Cited
2006
Covert channels in the IP time to live field
Covert channels are used for the secret transfer of information. Unlike encryption, which only protects the information from… 
Highly Cited
2005
Highly Cited
2005
Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks
The incredible growth in the capabilities and functionality of mobile devices has enabled new applications to emerge. Due to the… 
Highly Cited
2004
Highly Cited
2004
Advanced Detection of Selfish or Malicious Nodes in Ad Hoc Networks
The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the… 
Highly Cited
2004
Highly Cited
2004
Throughput-delay analysis of mobile ad-hoc networks with a multi-copy relaying strategy
Multiuser diversity has been shown to increase the throughput of mobile ad-hoc wireless networks (MANET) when compared to fixed… 
Highly Cited
2003
Highly Cited
2003
Bounds on Linear Codes for Network Multicast
Traditionally, communication networks are composed of routing nodes, which relay and duplicate data. Work in recent years has… 
Highly Cited
2001
Highly Cited
2001
Soft ARQ for Layered Streaming Media
A growing and important class of traffic in the Internet is so-called “streaming media,” in which a server transmits a packetized… 
Highly Cited
1994
Highly Cited
1994
An optimal spare-capacity assignment model for survivable networks with hop limits
The paper presents a new algorithm for spare-capacity assignment in survivable networks which use cross-connect systems as… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)