Home WakeSpace Scholarship › Electronic Theses and Dissertations

Managing Agent Sampling Probabilities in Irregular Networks

Electronic Theses and Dissertations

Item Files

Item Details

abstract
Agent-based security can provide a good distributed solution to issues surrounding large real-world networks. Such networks are often modeled by small-world, scale-free, minimum-distance, or random (SFMR) graphs. If agents randomly wander nodes, then the irregularity found in these types of graphs gives rise to some nodes being visited more often than others. Assuming the system requires agents to uniformly visit and perform some set of tasks at nodes, then the cost of executing these tasks at every visited node can negatively impact the peformance of the system.
subject
agents
contributor
White, Jacob Barry (author)
Fulp, Errin W (committee chair)
John, David J (committee member)
Torgersen, Todd E (committee member)
date
2012-06-12T08:36:03Z (accessioned)
2012-06-12T08:36:03Z (available)
2012 (issued)
degree
Computer Science (discipline)
identifier
http://hdl.handle.net/10339/37297 (uri)
language
en (iso)
publisher
Wake Forest University
title
Managing Agent Sampling Probabilities in Irregular Networks
type
Thesis

Usage Statistics