首页> 外国专利> Being the multiple cast tree design device which designs the multiple

Being the multiple cast tree design device which designs the multiple

机译:作为设计多重造型的多重造型树设计装置

摘要

The new multiple cast tree design device which designs the multiple cast tree making use of mathematical programming is offered. Being the multiple cast tree design device which designs the multiple cast tree in order with respect to the network which from the link which connects between the node and the node is formed ahead plural transmitting to transfer the packet to the node from the transmission original node, it possesses with problem compilation expedient and problem solving expedient, everything superposing plural route restriction compilation expedients and the route which draw up the restriction system because the plural routes where problem compilation expedient designates the transmission original node as starting point and ahead plural transmitting designates the node as terminus are formed, the tree restriction compilation expedient which draws up the restriction system because it forms the multiple cast tree and,When superposing plural routes, confluence restriction compilation expedient and forms the multiple cast tree it possesses with the link which draws up the restriction system because the fact that it becomes the topology where route flows together is not permitted or the objective function compilation expedient which draws up the objective function in order to minimize the evaluation figure regarding the node, problem solving expedient decides gathering of the link which forms the multiple cast tree by the fact that the mathematical programming problem which is formed from restriction system and the objective function which were drawn up by problem compilation expedient is solved.
机译:提供了一种新的多棵树设计设备,其利用数学编程来设计多棵树。作为相对于从节点与节点之间连接的链路形成的网络开始依次设计多播树的多播树设计装置,该多播树将多个分组从传输原始节点传送到节点,它具有问题编译权和问题解决权,一切都叠加了多个路由限制编译权和构成限制系统的路由,因为问题编译权以指定传输原始节点为起点,而多个传输以指定节点为起点当形成末端时,树限制编译权宜之计就形成了限制系统,因为它形成了多个转换树,并且,当叠加多条路径时,汇合限制编译权而形成了它所拥有的多重转换树,它与构成限制的链接系统因为f为使节点成为最小的评估图,目的是使路由成为不能一起流动的拓扑或起草目标函数的目标函数汇编权宜之计,解决问题的权宜之计决定形成多类型树的链路的收集通过解决由约束系统形成的数学程序设计问题和目标函数方便地编制的目标函数这一事实。

著录项

  • 公开/公告号JP5126622B2

    专利类型

  • 公开/公告日2013-01-23

    原文格式PDF

  • 申请/专利权人 日本電気株式会社;

    申请/专利号JP20090511867

  • 发明设计人 小出 俊夫;

    申请日2008-04-21

  • 分类号H04L12/701;H04L12/70;

  • 国家 JP

  • 入库时间 2022-08-21 16:55:19

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号