Containment of network worms via per-process rate-limiting

  • Authors:
  • Yuanyuan Zeng;Xin Hu;Haixiong Wang;Kang G. Shin;Abhijit Bose

  • Affiliations:
  • The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;IBM T.J. Watson Research, Hawthorne, New York

  • Venue:
  • Proceedings of the 4th international conference on Security and privacy in communication netowrks
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

Network worms pose a serious threat to the Internet infrastructure as well as end-users. Various techniques have been proposed for detection of, and response against worms. A frequently-used and automated response mechanism is to rate-limit outbound worm traffic while maintaining the operation of legitimate applications, offering a gentler alternative to the usual detect-and-block approach. However, most rate-limiting schemes to date only focus on host-level network activities and impose a single threshold on the entire host, failing to (i) accommodate network-intensive applications and (ii) effectively contain network worms at the same time. To alleviate these limitations, we propose a per-process-based containment framework in each host that monitors the fine-grained runtime behavior of each process and accordingly assigns the process a suspicion level generated by a machine-learning algorithm. We have also developed a heuristic to optimally map each suspicion level to the rate-limiting threshold. The framework is shown to be effective in containing network worms and allowing the traffic of legitimate programs, achieving lower false-alarm rates.