【摘要】 在研究支持普适计算的操作系统关键技术的过程中,需要测量活跃节点数目,若采用确定性协议计算网络中活跃节点的数目,需要搜索整个网络,消息复杂度为O(n+e).为将消息复杂度降低到o(n+e),设计了启发式测量协议及相应的自适应拓扑算法,并启用了侦听节点.在设计中借鉴了根基统计信息预分配资源的思想,进一步降低了消息复杂度.更多还原

【Abstract】 In a peertopeer(P2P) network with arbitrary pointtopoint topology,the induced network is considered by the active nodes,which send or forward messages frequently.Deterministic protocols to find out the size of the network need to search the whole network.It will take O(n + e) messages.To save the number of messages induced by our protocol,heuristics is used to make use of the normal messages in the network.The message complexity of our protocol is bound to o(n + e).In order to know the existence of some active nodes,a number of listeners(or mobile agents) are delegated to listen to their messageheaders.A deterministic solution is not expected in our protocol.更多还原