1. PLOD is a network topology generating algorithm for power-laws. But PLOD cannot guarantee the connectivity of the topology. Furthermore, PLOD has the "credit overstock" problem. PLOD是一种基于幂率的网络拓扑生成算法,但该算法不能保证生成拓扑图的连通性,且存在“出度货款过剩”现象。
2. The associated topology is the constructible topology on X. 相应的拓扑是X之上的可构造拓扑。
3. The associated topology is the constructible topology on X . 相应的拓扑是x之上的可构造拓扑。
4. When the hold time expires, DUAL is informed of the topology change, and must recalculate the new topology. 当保持时间终止时,DUAL会被告知拓扑已经改变,并且必须再重计算新拓扑。
5. This is our teacher requested one final examination, because of the time compared rush, only routers topology for a search, but not the main search topology. 这是我们老师要求的期末考试项目之一,因时间比较仓促,只对路由器的子拓扑进行了搜索,而没有搜索主拓扑。