Intent-driven data link network policy negotiation model and algorithm
The priority based intent negotiation algorithm is proposed to address the issue of conflicting intent policies in intent-driven data-link networks.The algorithm aims to achieve the optimal configuration of intent policies while considering the limited availability of network resources.It takes into account both time and bandwidth dimensions of resources and indirectly increases the available network resources by reclaiming resources from low-priority intents that have already been configured.This approach enhances the quality of high-priority intents that are yet to be configured.Additionally,the algorithm utilizes optimization techniques to determine the best resource allocation for configuring high-priority intents and reclaiming low-priority intents,thereby avoiding the problem of forcefully downgrading intents due to insufficient resources and the resulting degradation in service quality.Experimental results demonstrate that the proposed algorithm significantly improves the resource planning capability of data-link networks,leading to a 6.0％and 5.5％enhancement in intent service quality compared to existing negotiation algorithms.
intent-driven networkresource allocationintent negotiationnetwork architecturedata link network
NETL
NSTL
万方数据
