A longitudinal survey of Internet host reliability

Long, Darrell D. E.; Muir, Andrew; Golding, Richard

doi:10.1109/reldis.1995.518718

Cited by 89 publications

(49 citation statements)

References 5 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Long et al [23] studied the availability of hosts on the Internet, and their study is perhaps the most similar to ours; however, we focus on the availability of dedicated infrastructure and our measurements are much more recent (their study was conducted in 1995).…”

Section: Availabilitymentioning

confidence: 84%

Availability, usage, and deployment characteristics of the domain name system

Pang

Hendricks

Akella

et al. 2004

Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement

View full text Add to dashboard Cite

The Domain Name System (DNS) is a critical part of the Internet's infrastructure, and is one of the few examples of a robust, highlyscalable, and operational distributed system. Although a few studies have been devoted to characterizing its properties, such as its workload and the stability of the top-level servers, many key components of DNS have not yet been examined. Based on large-scale measurements taken from servers in a large content distribution network, we present a detailed study of key characteristics of the DNS infrastructure, such as load distribution, availability, and deployment patterns of DNS servers. Our analysis includes both local DNS servers and servers in the authoritative hierarchy. We find that (1) the vast majority of users use a small fraction of deployed name servers, (2) the availability of most name servers is high, and (3) there exists a larger degree of diversity in local DNS server deployment and usage than for authoritative servers. Furthermore, we use our DNS measurements to draw conclusions about federated infrastructures in general. We evaluate and discuss the impact of federated deployment models on future systems, such as Distributed Hash Tables.

show abstract

Section: Availabilitymentioning

confidence: 84%

Availability, usage, and deployment characteristics of the domain name system

Pang

Hendricks

Akella

et al. 2004

Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement

View full text Add to dashboard Cite

show abstract

“…Sen and Wang [14] described a similar study using passive measurement of flow-level data from multiple routers across a large tier-1 ISP backbone. Finally, Long et al [8] measured workstation availability in the Internet using an active probing methodology. Unfortunately, all of these approaches rely on IP addresses to uniquely identify individual hosts over time.…”

Section: Related Workmentioning

confidence: 99%

Understanding Availability

Bhagwan

Savage

Voelker

2003

Peer-to-Peer Systems II

398

374

View full text Add to dashboard Cite

This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say "availability" and how does this understanding impact the engineering of practical systems? We argue that existing measurements and models do not capture the complex time-varying nature of availability in today's peer-to-peer environments. Further, we show that unforeseen methodological shortcomings have dramatically biased previous analyses of this phenomenon. As the basis of our study, we empirically characterize the availability of a large peer-to-peer system over a period of 7 days, analyze the dependence of the underlying availability distributions, measure host turnover in the system, and discuss how these results may affect the design of high-availability peer-to-peer services.

show abstract

“…When a malware is detected on a system by the local agent, the information data about the intrusion that is submitted to the central database is shown. In the paper [19], [20] it is the unique identification string of the compromised system, the IP of the compromised system, the time of the event, and the detected malware.…”

Section: IImentioning

confidence: 99%

An Effective Method of Time Required to Compromise a Computer System

V¹,

Vishali²,

Rajakumari³

2015

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

Abstract:A cyber intrusion is a frequent assumption in the domain of cyber security and it follows the properties of a Poisson process. By the Poisson distribution the intrusion is well modeled and this process requires a high rate of time. This was also used with Pareto distribution of intrusion so that the rate of time required is slightly decreases with a better performance. Now we are used the chaos algorithm to determine the Time Taken to Compromise (TTC) by using this algorithm the time used for the performing a task in highly decreases. It shows the assumption of the Poisson process model might be suboptimal. The algorithm suggests that time to compromise decreases along the number of instruction of a system regarding this property. This paper clearly explains about the TTC by chaos algorithm.

show abstract

A longitudinal survey of Internet host reliability

Cited by 89 publications

References 5 publications

Availability, usage, and deployment characteristics of the domain name system

Availability, usage, and deployment characteristics of the domain name system

Understanding Availability

An Effective Method of Time Required to Compromise a Computer System

Contact Info

Product

Resources

About