Chenxi Wang
Carnegie Mellon University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Chenxi Wang.
workshop on rapid malcode | 2003
Yang Wang; Chenxi Wang
In this paper, we investigate epidemiological models to reason about computer viral propagation. We extend the classical homogeneous models to incorporate two timing parameters: Infection delay and user vigilance. We show that these timing parameters greatly influence the propagation of viral epidemics, and that the explicit treatment of these parameters gives rise to a more realistic and accurate propagation model. We validate the new model with simulation analysis.
dependable systems and networks | 2004
Cynthia Wong; Chenxi Wang; Dawn Song; Stan Bielski; Gregory R. Ganger
If we limit the contact rate of worm traffic, can we alleviate and ultimately contain Internet worms? This paper sets out to answer this question. Specifically, we are interested in analyzing different deployment strategies of rate control mechanisms and the effect thereof on suppressing the spread of worm code. We use both analytical models and simulation experiments. We find that rate control at individual hosts or edge routers yields a slowdown that is linear in the number of hosts (or routers) with the rate limiting filters. Limiting contact rate at the backbone routers, however, is substantially more effective-it renders a slowdown comparable to deploying rate limiting filters at every individual host that is covered. This result holds true even when susceptible and infected hosts are patched and immunized dynamically. To provide context for our analysis, we examine real traffic traces obtained from a campus computing network. We observe that rate throttling could be enforced with minimal impact on legitimate communications. Two worms observed in the traces, however, would be significantly slowed down.
Cyber Situational Awareness | 2010
Paul Barford; Marc Dacier; Thomas G. Dietterich; Matthew Fredrikson; Jonathon T. Giffin; Sushil Jajodia; Somesh Jha; Jason H. Li; Peng Liu; Peng Ning; Xinming Ou; Dawn Song; Laura D. Strater; Vipin Swarup; George P. Tadda; Chenxi Wang; John Yen
1. Be aware of the current situation. This aspect can also be called situation perception. Situation perception includes both situation recognition and identification. Situation identification can include identifying the type of attack (recognition is only recognizing that an attack is occurring), the source (who, what) of an attack, the target of an attack, etc. Situation perception is beyond intrusion detection. Intrusion detection is a very primitive element of this aspect. An IDS (intrusion detection system) is usually only a sensor, it neither identifies nor recognizes an attack but simply identifies an event that may be part of an attack once that event adds to a recognition or identification activity.
workshop on rapid malcode | 2004
Cynthia Wong; Stan Bielski; Jonathan M. McCune; Chenxi Wang
Mass-mailing worms have made a significant impact on the Internet. These worms consume valuable network resources and can also be used as a vehicle for DDoS attacks. In this paper, we analyze network traffic traces collected from a college campus and present an in-depth study on the effects of two mass-mailing worms, SoBig and MyDoom, on outgoing traffic. Rather than proposing a defense strategy, we focus on studying the fundamental behavior and characteristics of these worms. This analysis lends insight into the possibilities and challenges of automatically detecting, suppressing and stopping mass mailing worm propagation in a enterprise network environment.
recent advances in intrusion detection | 2005
Cynthia Wong; Stan Bielski; Ahren Studer; Chenxi Wang
One class of worm defense techniques that received attention of late is to “rate limit” outbound traffic to contain fast spreading worms. Several proposals of rate limiting techniques have appeared in the literature, each with a different take on the impetus behind rate limiting. This paper presents an empirical analysis on different rate limiting schemes using real traffic and attack traces from a sizable network. In the analysis we isolate and investigate the impact of the critical parameters for each scheme and seek to understand how these parameters might be set in realistic network settings. Analysis shows that using DNS-based rate limiting has substantially lower error rates than schemes based on other traffic statistics. The analysis additionally brings to light a number of issues with respect to rate limiting at large. We explore the impact of these issues in the context of general worm containment.
international conference on move to meaningful internet systems | 2007
Matthew W. Dunlop; Carrie Gates; Cynthia Wong; Chenxi Wang
Detection of fast-spreading Internet worms is a problem for which no adequate defenses exist. In this paper we present a Simple Worm Detection scheme (SWorD). SWorD is designed as a statistical detection method for detecting and automatically filtering fast-spreading TCP-based worms. SWorD is a simple two-tier counting algorithm designed to be deployed on the network edge. The first-tier is a lightweight traffic filter while the second-tier is more selective and rarely invoked.We present results using network traces from both a small and large network to demonstrate SWorDs performance. Our results show that SWorD accurately detects over 75% of all infected hosts within six seconds, making it an attractive solution for the worm detection problem.
Archive | 2002
Mehmet Bakkaloglu; Jay J. Wylie; Chenxi Wang; Gregory R. Ganger
Archive | 2002
Mehmet Bakkaloglu; Jay J. Wylie; Chenxi Wang; Gregory R. Ganger
Archive | 2006
Ahren Studer; Chenxi Wang
Lecture Notes in Computer Science | 2006
Ahren Studer; Chenxi Wang