Smart Grid Network Resource Scheduling Algorithm Based on Network Calculus

Abstract

Smart grid technology is further developed on the basis of distributed power grids and micro-grids. The communications network is an indispensable part of the smart grid. How to achieve real-time accurate transmission of various types of smart information is a technical guarantee for smart grids. This paper analyze data of smart grid bases on the demand of net resource, and adopts the idea of priority scheduling to draw on the advantages of integrated services and differentiated services to design a time-sharing polling scheduling strategy. In this strategy, the algorithm classify the network data, Using network calculus theory to analyze the optimal length of the queue satisfying the upper bound of delay, According to the degree of network congestion perception, the credibility of the data is calculated, and non-adaptive flows are quickly identified. The strategy ensure that the data is able to transfer to the user quickly and lively depend on its needs, So ensure the real-time transmission of energy supply & consumption information of active distribution network, realize multi-source collaborative optimization scheduling and distributed hierarchical intelligent control management. The algorithm can effectively ensure the demand of high-priority services, making the overall performance of the smart grid communication system data such as real-time and accuracy optimized.