Abstract
Our previous work proposed a simple algorithm for the distribution and coordination of network management policies across a number of autonomous management nodes by partitioning an Abstract Syntax Tree into different branches and specifying coordination points based on data and control flow dependencies. We now extend this work to support more complex policies containing control flow logic and looping, which are part of the PRONTO policy language. Early simulation results demonstrate the potential performance and scalability characteristics of this framework. © IFIP International Federation for Information Processing 2005.
Cite
CITATION STYLE
Sheridan-Smith, N., O’Neill, T., Leaney, J., & Hunter, M. (2005). Enhancements to policy distribution for control flow and looping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3775 LNCS, pp. 269–280). https://doi.org/10.1007/11568285_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
