发明名称 SEARCHING SYSTEM FOR HIERARCHICAL NETWORK ROUTE
摘要 <p>PURPOSE:To obtain the shortest route between two nodes in a comparatively short time by performing a simulated anneal processing system based on the hierarchical network information. CONSTITUTION:The detailed network connection information 7 is stored in a 1st memory 2 and at the same time, the rough network information 8 is stored in a 2nd memory 4. Then the hierarchical network connection information is obtained. Then a 2nd route searching means 5 searches the shortest route between two nodes given previously based on the information 8 stored in the memory 4 and obtains a solution route of a rough network as the next shortest route. Then a 1st route searching means 3 searches the shortest route between two nodes given previously by a simulated anneal processing system based on the information 7 stored in the memory 2. Thus a solution route of a detailed network.</p>
申请公布号 JPH0242567(A) 申请公布日期 1990.02.13
申请号 JP19880192706 申请日期 1988.08.03
申请人 NIPPON TELEGR & TELEPH CORP <NTT> 发明人 KANEDA SHIGEO
分类号 G06F17/30;H04L12/00 主分类号 G06F17/30
代理机构 代理人
主权项
地址