专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06314093B1 Traffic route finder in communications network 失效
标题翻译：通信网络中的路由查找器
公开(公告)号：US06314093B1
公开(公告)日：2001-11-06
申请号：US09088805
申请日：1998-06-02
申请人： Jason Warren Mann , John Ian Turner , Anthony Richard Phillip White
发明人： Jason Warren Mann , John Ian Turner , Anthony Richard Phillip White
IPC分类号： H04L324
CPC分类号： H04Q11/0478 , H04J2203/0053 , H04J2203/0069 , H04L45/12 , H04L45/24 , H04L2012/562 , H04L2012/5642 , H04L2012/5651
摘要： A route finder means and method for finding routes to satisfy a plurality of connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. Arrays of eight shortest paths of links between each pair of nodes in the network are created. Bit strings comprising for example a 3 bit binary number for each point-to-point connection request are generated. Each 3 bit number is an index to one element of the shortest path array for each connection request's source and destination nodes. The bit strings are assembled into population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The route finder means and method has an ability to split traffic over multiple routes, and to handle different traffic types, eg different bit rate traffic types. The route finder means and method is generic to a plurality of different communications network types.
摘要翻译：一种用于寻找在包括由多个链路连接的多个节点的通信网络中满足多个连接请求的路由的路线寻找装置和方法。每个网络链路分配一个成本。创建网络中每对节点之间的八条最短路径的数组。生成包括例如每个点到点连接请求的3位二进制数的比特串。每个3位数字是每个连接请求的源和目标节点的最短路径数组的一个元素的索引。位串被组合成由遗传算法操纵的群体成员。通过计算遍历由位串表示的路由的成本来评估人口成员的适应度。路由查找器的方法和方法具有在多个路由上分流流量的能力，并处理不同的流量类型，例如不同的比特率流量类型。路线寻找装置和方法是通用于多种不同的通信网络类型。

2. 发明授权

US06310883B1 Traffic route finder in communications network 失效
标题翻译：通信网络中的路由查找器
公开(公告)号：US06310883B1
公开(公告)日：2001-10-30
申请号：US09044889
申请日：1998-03-20
申请人： Jason Warren Mann , John Ian Turner , Anthony Richard Phillip White
发明人： Jason Warren Mann , John Ian Turner , Anthony Richard Phillip White
IPC分类号： H04L1244
CPC分类号： H04Q11/0478 , H04J2203/0053 , H04J2203/0069 , H04L45/12 , H04L45/24 , H04L2012/562 , H04L2012/5642 , H04L2012/5651
摘要： A route finder for point to multi-point connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. For each connection request a set of all network nodes not included in its source node or its plurality of destination nodes are selected. An array of bits is created with an array element corresponding to a selected node element having a value of 1 if the node is steiner vertex for a steiner tree of nodes not selected, otherwise the array element has a value of 0. Each array is treated as a bit string and considered as population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The method is capable of routing a plurality of multi-point connection requests, and selecting an overall optimum solution.
摘要翻译：一种用于在包括由多个链路连接的多个节点的通信网络中的点对多点连接请求的路线寻找器。每个网络链路分配一个成本。对于每个连接请求，选择未包括在其源节点或其多个目的地节点中的一组所有网络节点。如果节点是未选择的节点的steiner树的节点顶点，则使用与所选节点元素相对应的数组元素来创建位数组，否则数组元素的值为0.每个数组被处理作为一个字串，被认为是由遗传算法操纵的人口成员。通过计算遍历由位串表示的路由的成本来评估人口成员的适应度。该方法能够路由多个多点连接请求，并且选择整体最优解。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式