Hierarchy aware distributed plan execution monitoring

Elaboration of a hierarchy aware and distributed monitoring approach suitable for shared information awareness.Aggregation of distributed nodes into clusters and cluster heads in order to localize the information exchange at the level of the distributed nodes.Gossip based communication across the clusters along with asymmetric clustering to reflect hierarchical relationships among participants.Formalization of the information sharing technique based on communicating Markov Decision Processes and probability analysis using probabilistic model checking. Collaborative plan execution is becoming increasingly important given its potential for operational agility and cost reduction. In this paper we propose a distributed and hierarchy aware monitoring procedure for operational plan execution taking place in a dynamic environment characterized by unreliable communication and exogenous events. The contribution of this paper consists in employing a hierarchical clustering approach supporting a multi-party and hierarchy aware information sharing mechanism that is resilient to disruptions in the execution environment. The proposed distributed monitoring procedure uses asymmetric clustering to reflect hierarchical relationships along with gossip based communication across the clusters. Of significance is the information sharing mechanism formalization which utilizes a fresh information window in conjunction with communicating Markov Decision Processes. We show the usefulness of assessing shared information awareness via probabilistic model checking for various combinations of clustering topology and disruption conditions. In this context, we assess formal specifications expressed in probabilistic temporal logic and show how the model checking results can be used to derive the best fresh window value to maximize an information awareness utility function. An illustrative case study is also presented.

[1]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[2]  Marta Z. Kwiatkowska,et al.  Analysis of a gossip protocol in PRISM , 2008, PERV.

[3]  Srinivasan Keshav,et al.  Incremental Maintenance of Global Aggregates , 2006 .

[4]  Kim Hua Tan,et al.  Close-loop or open hierarchical structures in green supply chain management under uncertainty , 2014, Expert Syst. Appl..

[5]  Peng Gao,et al.  Formal Verification and Simulation for Performance Analysis for Probabilistic Broadcast Protocols , 2006, ADHOC-NOW.

[6]  Rolf Stadler,et al.  Gossip-based resource management for cloud environments , 2010, 2010 International Conference on Network and Service Management.

[7]  Karen L. Myers CPEF: A Continuous Planning and Execution Framework , 1999, AI Mag..

[8]  Mourad Debbabi,et al.  Transportation risk analysis using probabilistic model checking , 2015, Expert Syst. Appl..

[9]  Nima Jafari Navimipour,et al.  Behavioral modeling and formal verification of a resource discovery approach in Grid computing , 2014, Expert Syst. Appl..

[10]  Mourad Debbabi,et al.  Gossiping Based Distributed Plan Monitoring , 2013, ANT/SEIT.

[11]  Devavrat Shah,et al.  Computing separable functions via gossip , 2005, PODC '06.

[12]  Liliana Enciso Quispe,et al.  Behavior of Ad Hoc routing protocols, analyzed for emergency and rescue scenarios, on a real urban area , 2014, Expert Syst. Appl..

[13]  Rolf Stadler,et al.  A GENERIC PROTOCOL FOR NETWORK STATE AGGREGATION , 2005 .

[14]  Ann Q. Gates,et al.  A taxonomy and catalog of runtime software-fault monitoring tools , 2004, IEEE Transactions on Software Engineering.

[15]  Lijun Zhang,et al.  Synthesis for PCTL in Parametric Markov Decision Processes , 2011, NASA Formal Methods.

[16]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[17]  Nils Jansen,et al.  DTMC Model Checking by SCC Reduction , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[18]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[19]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[20]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[21]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[22]  James P. Allen,et al.  Plan execution monitoring with distributed intelligent agents for battle command , 2004, SPIE Defense + Commercial Sensing.

[23]  Marta Z. Kwiatkowska,et al.  An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata , 2005, ATVA.

[24]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[25]  Ian F. Akyildiz,et al.  A new random walk model for PCS networks , 2000, IEEE Journal on Selected Areas in Communications.

[26]  Joaquín Fernández-Valdivia,et al.  A dynamic approach for clustering data , 1995, Signal Process..

[27]  Marco Aurélio Gerosa,et al.  Automated instructional design for CSCL: A hierarchical task network planning approach , 2014, Expert Syst. Appl..

[28]  Teerawat Issariyakul,et al.  Introduction to Network Simulator NS2 , 2008 .

[29]  Joost-Pieter Katoen,et al.  Efficient CTMC Model Checking of Linear Real-Time Objectives , 2011, TACAS.

[30]  Chen Avin,et al.  Efficient and robust query processing in dynamic environments using random walk techniques , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.