Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,773,135 papers from all fields of science
Search
Sign In
Create Free Account
Time to live
Known as:
Time-to-live
, Ping TTL
, Hop limit
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Broadcast radiation
Cache (computing)
Cache invalidation
Captive portal
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Contact expectation based routing for delay tolerant networks
Honglong Chen
,
W. Lou
Ad hoc networks
2016
Corpus ID: 43253814
2013
2013
An adaptive probabilistic marking scheme for fast and secure traceback
Hongcheng Tian
,
J. Bi
,
Xiaoke Jiang
2013
Corpus ID: 17063504
IP traceback can be used to find direct generator(s) and path(s) of attacking traffic. Probabilistic marking schemes, as one type…
Expand
2010
2010
Effects of Component-Subscription Network Topology on Large-Scale Data Centre Performance Scaling
Ilango Sriram
,
D. Cliff
IEEE International Conference on Engineering of…
2010
Corpus ID: 1258124
Modern large-scale date centres, such as those used for cloud computing service provision, are becoming ever-larger as the…
Expand
2009
2009
Estimating Hop Distance Between Arbitrary Host Pairs
Brian Eriksson
,
P. Barford
,
R. Nowak
IEEE INFOCOM
2009
Corpus ID: 2347627
Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic…
Expand
2007
2007
Optimized Designs of p-Cycles for Survivable Multicast Sessions in Optical WDM Networks
W. Zhong
,
Feng Zhang
,
Yaohui Jin
Second International Conference on Communications…
2007
Corpus ID: 18853439
Network service outage causes tremendous revenue loss and service disruption for both unicast and multicast traffic. In…
Expand
2004
2004
Flood search under the California Split rule
Yuliy M. Baryshnikov
,
E. Coffman
,
P. Jelenkovic
,
P. Momcilovic
,
Dan Rubenstein
Operations Research Letters
2004
Corpus ID: 649227
2004
2004
Web caching in broadcast mobile wireless environments
Dimitrios Katsaros
,
Y. Manolopoulos
IEEE Internet Computing
2004
Corpus ID: 3138262
Effectively exploiting available communication bandwidth and client resources is vital in wireless mobile environments. One…
Expand
2004
2004
Streamlining traceroute by estimating path lengths
T. Moors
IEEE International Workshop on IP Operations and…
2004
Corpus ID: 17218223
Traditional traceroute determines the path through a network by sending probe packets with progressively increasing TTL/hop count…
Expand
2002
2002
The effect of layer-2 switches on pathchar-like tools
Ravi S. Prasad
,
C. Dovrolis
,
B. Mah
International Memory Workshop
2002
Corpus ID: 1284193
Starting from Jacobson’s pathchar [1], there has been a significant interest in techniques that can measure the link capacities…
Expand
Review
2002
Review
2002
WIRELESS MULTIHOP INTERNET ACCESS : GATEWAY DISCOVERY , ROUTING , AND ADDRESSING
Jin Xi
,
Christian Bettstetter
2002
Corpus ID: 17666988
This paper investigates the interworking between wireless ad hoc networks and the Internet. In other words, we consider access to…
Expand
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)
ACCEPT & CONTINUE