Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

Centralized

biblio

Visible to the public Detecting Centralized Architecture-Based Botnets using Travelling Salesperson Non-Deterministic Polynomial-Hard problem-TSP-NP Technique

Submitted by grigby1 on Fri, 09/11/2020 - 12:08pm
  • Botnet detection
  • botnet
  • TSP-NP hard problem
  • travelling salesperson nondeterministic polynomial-hard problem-TSP-NP technique
  • travelling salesman problems
  • traveling salesperson person
  • NP-hard problem
  • nondeterministic polynomial-time hardness
  • deterministic
  • Detecting
  • centralized botnet architecture
  • centralized architecture-based botnets
  • Centralized
  • botnet developers
  • botnet detection accuracy
  • pubcrawl
  • botmaster
  • attack techniques
  • combinatorial optimization
  • Compositionality
  • optimisation
  • Metrics
  • DDoS Attacks
  • botnets
  • invasive software
  • Computer crime
  • architecture
  • internet
  • computer network security
  • Resiliency

Terms of Use  |  ©2023. CPS-VO