适用于广域测量系统的实时数据寻址红黑树算法  

Red-black Tree Algorithm Applicable to WAMS Real-time Data Addressing

作　　者：安思成 吴克河[1] 周欢[1] 崔文超[1] 

机构地区：[1]华北电力大学控制与计算机工程学院,北京102206

出　　处：《华北电力大学学报（自然科学版）》2016年第3期95-101,110,共8页Journal of North China Electric Power University：Natural Science Edition

基　　金：中央高校基本科研业务费专项资金项目(2014XS37)

摘　　要：随着广域测量系统(Wide Area Measurement System,WAMS)的迅速发展,目前其数据主站的单站相量测量单元(Phasor Measurement Unit,PMU)的海量接入带来了一些规模化后的相关效率问题。主站实时数据通过层次化结构等方法在宏观上缓解了大量数据点的寻址效率问题,但在微观局部上当某一层次具有大量平行数据点时(如在含大量设备的站点或距离较长的线路上)的寻址时间飙升问题突出。本文对这种情况下的寻址操作提出了一种基于改进的红黑树数据结构组织和查询数据点的寻址算法RBA(Red-Black Tree Addressing Algrithm),并论证了其在此情况下的可行性以及对数据更新和搜索操作时间的大幅优化效果。实验和实际工程应用数据表明,RBA算法使平行节点搜索寻址效率大幅度提高,基本解决了WAMS系统在大量同层数据点下寻址时间过于滞后引起的同步周期速率延迟等问题。With the rapid development of wide area measurement system（ WAMS）,the massive access of phasor measurement unit（ PMU） of single master data station leads to some corresponding efficiency problems with scale development. The hierarchical organization structure of the real-time data of master data station relieves the addressing efficiency problem of huge data point macroscopically. Microscopically,the problem of sharp soaring of access time is very serious while the amount of parallel node of some level is considerable（ for example,the line containing many stations or extending very long）. For such an addressing problem,this paper proposes an addressing algorithm RBA（ Red-Black Tree Addressing Algrithm） based on the improved Red-Black Tree data structure to organize and search data point. Meanwhile the feasibility of application under such situation and significant optimization of updating and searching operation are demonstrated. The data of experiments and engineering application show that the RBA algorithm can greatly improve the efficiency of searching and addressing of parallel nodes. And by RBA,the problem of delay of synchronization cycle rate caused by addressing time lag of large data point in the same level is solved.

关 键 词：WAMS系统 实时数据 寻址 搜索 红黑树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]