{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/37297"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/37297","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"Managing Agent Sampling Probabilities in Irregular Networks","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.","abstract_html":"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.","abstract_has_math":false,"creators":["White, Jacob Barry"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-07-27T22:01:27Z","subjects":["agents"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/37297","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["White, Jacob Barry"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-06-12T08:36:03Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-06-12T08:36:03Z"]},{"key":"dc:date.issued","label":"Date","values":["2012"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["agents"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/37297"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Managing Agent Sampling Probabilities in Irregular Networks"]}]}],"canonical_facts":{"dc:creator":["White, Jacob Barry"],"dc:date.accessioned":["2012-06-12T08:36:03Z"],"dc:date.available":["2012-06-12T08:36:03Z"],"dc:date.issued":["2012"],"dc:description.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."],"dc:identifier.uri":["http://hdl.handle.net/10339/37297"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:subject":["agents"],"dc:title":["Managing Agent Sampling Probabilities in Irregular Networks"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:01:27Z"}