• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Electrical and Control Engineering >A Mechanism for Constructing the Minimum Cost Multicast Routing Tree
【24h】

A Mechanism for Constructing the Minimum Cost Multicast Routing Tree

机译：最小成本组播路由树的构建机制

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In view of the free content distribution in multicast on Internet, a mechanism for constructing the minimum cost multicast routing tree is proposed based on the theory of economic mechanism design. The minimum cost multicast tree can minimize the total transmission cost of the tree, minimize the links connecting the specified multicast group members and save the data transmitting cost and network resources. The model of multicast networks is provided and a routing model based on minimum cost multicast tree is formulate. According to the existing multicast protocols, the design of an algorithm for implementing the routing mechanism is described. The mechanism is evaluated by means of a numerical example. Some prospects on the application of mechanism design theory in multicast research fields are presented.
机译：针对互联网上组播中的免费内容分发问题，基于经济机制设计理论，提出了一种构建成本最小的组播路由树的机制。最小开销的组播树可以最小化该树的总传输开销，最小化连接指定组播组成员的链路，并节省数据传输开销和网络资源。提供了组播网络模型，并建立了基于最小开销组播树的路由模型。根据现有的组播协议，描述了用于实现路由机制的算法的设计。通过数值示例评估该机制。提出了机制设计理论在组播研究领域中的应用前景。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号