![NG-CDI Logo FullArtboard 1@1.5x.png](https://static.wixstatic.com/media/9f03f9_a3fe5ffa278f4014947d8f18296c0d0c~mv2.png/v1/fill/w_267,h_95,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/NG-CDI%20Logo%20FullArtboard%201%401_5x.png)
![Publications Header 2.png](https://static.wixstatic.com/media/9f03f9_720fe94f4dde4ce093b382d5087ac452~mv2.png/v1/fill/w_980,h_245,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/9f03f9_720fe94f4dde4ce093b382d5087ac452~mv2.png)
Publications & Journals
The value of information for dynamic decentralised criticality computation
Citation:
Proselkov, Y., Herrera, M., Hernandez, M. P., Parlikad, A. K., & Brintrup, A. (2022). The value of information for dynamic decentralised criticality computation. IFAC-PapersOnLine, 55(2), 408-413.
Published:
28/03/2022
Link:
University:
University of Cambridge
Abstract:
Smart manufacturing uses advanced data-driven solutions to improve performance and operations resilience requiring large amounts of data delivered quickly, enabled by telecom networks and network elements such as routers or switches. Disruptions can render a network inoperable; avoiding them requires advanced responsiveness to network usage, achievable by embedding autonomy into the network, providing fast and scalable algorithms that use key metrics to manage disruptions, such as impact of failure in a network element on system functions. Centralised approaches are insufficient for this as they need time to transmit data to the controller, by which time it may have become irrelevant. Decentralised and information bounded measures solve this by placing computational agents near the data source. We propose an agent-based model to assess the value of the information for calculating decentralised criticality metrics, assigning a data collection agent to each network element, computing relevant indicators of the impact of failure in a decentralised way. This is evaluated by simulating discrete information exchange with concurrent data analysis, comparing measure accuracy to a benchmark, and with measure computation time as a proxy for computation complexity. Results show losses in accuracy are offset by faster computations with fewer network dependencies.
![Bristol (web).png](https://static.wixstatic.com/media/9f03f9_bc67ef4c76d9457fb620ed7d4938f49c~mv2.png/v1/fill/w_166,h_52,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/Bristol%20(web).png)
![Cambridge (web).png](https://static.wixstatic.com/media/9f03f9_dbf8cd4df31542b7aca5dec06ffe8892~mv2.png/v1/fill/w_166,h_52,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/Cambridge%20(web).png)
![Lancaster (web).png](https://static.wixstatic.com/media/9f03f9_dda69dbf486c46c086b7aa00001ac052~mv2.png/v1/fill/w_167,h_52,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/Lancaster%20(web).png)
![Surrey (web).png](https://static.wixstatic.com/media/9f03f9_6fbc881d6c634a52a0091167caa83862~mv2.png/v1/fill/w_167,h_52,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/Surrey%20(web).png)
![UKRI (web).png](https://static.wixstatic.com/media/9f03f9_756bcf5228914dafb248d9d0900ce525~mv2.png/v1/fill/w_166,h_52,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/UKRI%20(web).png)
![BT 2 (web).png](https://static.wixstatic.com/media/9f03f9_4f53180fcedf4cd9bbd27aa840d5a4b8~mv2.png/v1/fill/w_55,h_54,al_c,q_85,usm_0.66_1.00_0.01,enc_auto/BT%202%20(web).png)