论文部分内容阅读
针对目前可用的U PnP服务发现算法在普适计算环境中存在大量服务时响应消息严重丢失的问题,通过仿真试验分析认为原因在于根设备瞬间发送响应消息和相互独立地随机选择发送延时而产生的响应消息拥塞。进一步地给出了U PnP改进算法,采用根设备断续发送响应消息或(和)综合考虑整个U PnP网络来选择发送延时以减少响应消息拥塞的发生。实验表明改进算法可以明显地降低响应消息的丢失率。同时,改进算法还可以减少控制点对响应消息缓冲区大小的要求。
Aiming at the problem that the currently available U PnP service discovery algorithm has a serious loss of response message when a large number of services exist in a pervasive computing environment, the simulation analysis shows that the reason is that the root device sends the response message momentarily and randomly selects the sending delay independently from each other The response message is congested. Furthermore, an improved U PnP algorithm is proposed. The root device is used to intermittently send the response message or (and) consider the entire U PnP network to select the sending delay to reduce the occurrence of response message congestion. Experiments show that the improved algorithm can significantly reduce the loss rate of response messages. At the same time, the improved algorithm can also reduce the control point on the response message buffer size requirements.