Topology-aware optimal task allocation for publish/subscribe-based mission critical environment

Authors:
Shameem Ahmed;Thadpong Pongthawornkamol;Klara Nahrstedt;Matthew Caesar;Guijun Wang
Affiliations:
Dept. of Computer Science, University of Illinois at Urbana-Champaign;Dept. of Computer Science, University of Illinois at Urbana-Champaign;Dept. of Computer Science, University of Illinois at Urbana-Champaign;Dept. of Computer Science, University of Illinois at Urbana-Champaign;Boeing Research & Technology, WA
Venue:
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Year:
2009

Citing 7
Cited 0

Multi-Robot Task Allocation in Uncertain Environments

Autonomous Robots
Optimization of Task Allocation in a Cluster-Based Sensor Network

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
The many faces of publish/subscribe

ACM Computing Surveys (CSUR)
Role-based access control for publish/subscribe middleware architectures

Proceedings of the 2nd international workshop on Distributed event-based systems
Energy-balanced task allocation for collaborative processing in wireless sensor networks

Mobile Networks and Applications
Energy-Aware Task Allocation for Rate Monotonic Scheduling

RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Optimal Resource Allocation on Grid Computing Using a Quantum Chromosomes Genetic Algorithm

DMAMH '07 Proceedings of the Second Workshop on Digital Media and its Application in Museum & Heritage

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mission critical environment (MCE) consists of errorprone, highly variable, and highly rate limited communication channels. Paradoxically, this substantially increases the need to perform optimal task allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To simplify the problem, we consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish /subscribe node and task differentiation and high scalability. In this work, we formulate the OTA problem for publish/subscribe-based MCEs, propose an architectural framework and distributed communication protocols emphasizing the unique challenges of MCE. We adopt wellknown Hungarian method and Rectangular Assignment algorithm to solve OTA problem in publish/subscribe-based MCE in polynomial time. Through simulations, we evaluate the performance of our proposed system for multiple publish/subscribe scenarios. Our results indicate that our proposed solutions achieve the goal of OTA in highly dynamic environments, with low processing time and communication overhead.