首页>
外国专利>
MULTICOST ROUTE SETTING BASED ON CONNECTION MATRIX
MULTICOST ROUTE SETTING BASED ON CONNECTION MATRIX
展开▼
机译：基于连接矩阵的多成本路由设置
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To provide a route setting method that makes it possible to process a multicost coefficient and to consider a non-additive cost coefficient when determining the relative cost of route in a network. ;SOLUTION: Cost functions to be considered when selecting any route, are determined (200), a compound multicost function is generated by applying priority to the respective cost functions (205), and a connection matrix is determined corresponding to the network including a set composed of (n) pieces of elements to which the order directly expressing the multicost between the respective pairs of nodes in the network (208). Next, a general-purpose addition computing element is determined so as to apply distribution characteristics and exchange characteristics to the general added total of values of cost functions and by applying the compound multicost function to the connection matrix while using these general-purpose addition computing element and order, the shortest route matrix is led out (215).;COPYRIGHT: (C)1998,JPO
展开▼
