A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
After describing real application, it presents the best location query, the priority of target object, the heuristic rule to delete data objects, and analyzes the time complexity of the algorithm.
在叙述实际应用的基础上抽象出最优位置查询概念，提出目标对象的优先权度量标准、删减数据对象的启发式规则和最优位置查询算法，分析最优位置查询算法的时间复杂度。
应用推荐