arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.2408cs.NIcs.AI
收藏

服务发现协议的最大传输消息产生率

Maximum Production of Transmission Messages Rate for Service Discovery Protocols

University of Essex(埃塞克斯大学)

Intisar Al-Mejibli, Martin Colley

摘要:

最大限度地减少网络中丢弃的用户数据报协议(UDP)消息的数量被研究人员视为一个挑战。这个问题代表了许多协议的严重问题,特别是那些依赖于发送消息作为其策略的一部分的协议,如US服务发现协议。本文提出并评估了一种算法来预测两个或多个连续消息之间所需的最短时间,并建议路由器的最小队列大小,以管理流量,并尽量减少已造成的拥塞或队列溢出或两者兼而有之的丢弃消息的数量。该算法已被应用到通用即插即用(UPPERT)协议使用ns 2模拟器。在路由器以两种配置连接时进行了测试;集中式和分散式。该算法考虑了路由器间链路的报文长度和带宽。实验结果表明,该方法在路由器间的丢包率方面有较好的改善.

英文摘要:

Minimizing the number of dropped User Datagram Protocol (UDP) messages in a network is regarded as a challenge by researchers. This issue represents serious problems for many protocols particularly those that depend on sending messages as part of their strategy, such us service discovery protocols. This paper proposes and evaluates an algorithm to predict the minimum period of time required between two or more consecutive messages and suggests the minimum queue sizes for the routers, to manage the traffic and minimise the number of dropped messages that has been caused by either congestion or queue overflow or both together. The algorithm has been applied to the Universal Plug and Play (UPnP) protocol using ns2 simulator. It was tested when the routers were connected in two configurations; as a centralized and de centralized. The message length and bandwidth of the links among the routers were taken in the consideration. The result shows Better improvement in number of dropped messages `among the routers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑