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

1. 发明专利

JPH06259257A INFERENCE OBJECT MANAGING DEVICE 失效
公开(公告)号：JPH06259257A
公开(公告)日：1994-09-16
申请号：JP4511193
申请日：1993-03-05
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： KANO TAKASHI , YONETANI NAOHISA
IPC分类号： G06F9/44 , G06N5/04
摘要： PURPOSE:To reduce the memory capacity of an object and the capacity of a processing system at an object managing part by separately managing paradigm information and paradigm peculiar information in the object of an inference object. CONSTITUTION:The object of the inference object is separated into a frame block 5 common for paradigms and frame blocks 6 and 7 peculiar for the respective paradigms and stored in a memory, the paradigm common frame block 5 is shared among the plural paradigms, and all the information concerning this object can be accessed by accessing the paradigm peculiar information through a means for performing access from the paradigm common information. Thus, the memory capacity of the object can be reduced, the capacity of the processing system at the object managing part can be reduced, and extendability at the time of adding any paradigm can be improved.

2. 发明专利

JPS63207242A ROUTING CONTROL SYSTEM FOR PACKET SWITCHING NETWORK 失效
公开(公告)号：JPS63207242A
公开(公告)日：1988-08-26
申请号：JP4066787
申请日：1987-02-24
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KASHIO JIRO , KANO TAKASHI , TANAKA MASAHIKO
IPC分类号： H04L12/711 , H04L12/733 , H04L12/803
摘要： PURPOSE:To improve the stability for routing change by by-passing respective destination exchanges stepwise in accordance with states of queue length abnormality of lines with destination exchanges as units. CONSTITUTION:Queue lengths of lines l1 and l2 are counted; and if they are different from each other, destination packet exchange which divides traffic into two or more directions with respect to the same destination are ob tained and only lines whose queue lengths are shorter are defined as transmission directions. If exchanges are already by-passed to the line l1, having the longer queue length in case that lines l1 and l2 are different in queue length, one exchange is selected from them and by-pass of this exchange is immediately stopped. Thus, if an abnormality of queue length occurs, the number of releating hops to all destination exchanged in the pertinent direction is increased by one and the transmission direction is changed in accordance with this number of repeating hops.

3. 发明专利

JPS63155839A CONTROL SYSTEM FOR ROUTING INFORMATION OF PACKET SWITCHING NETWORK 失效
公开(公告)号：JPS63155839A
公开(公告)日：1988-06-29
申请号：JP30130186
申请日：1986-12-19
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： KANO TAKASHI , SUZUKI MICHIO , KASHIO JIRO , TANAKA MASAHIKO
摘要： PURPOSE:To reduce the processing value of table distribution by extracting the changed parts of a routing table compared with the previously distributed one and informing these changed parts only to the switching stations and switching modules requiring the routing tables when these tables are distributed. CONSTITUTION:A packet switching network consists of a network control station 1, packet switching stations 2-5, and a trunk circuit which securs mutual connections among these stations. the station 1 has a function to produce the routing tables based on the state reports of stations 2-5 and to distribute them to each switching station in addition to a normal exchange function. When the routing tables are distributed to the stations 2-5 from the station 1, the changed parts of the table are extracted in comparison with the previously distributed one. These changed parts are information only to the switching stations that require the routing tables, thus. Thus it is possible to reduce the routing table value when these tables are distributed to the stations 2-5 from the station 1.

4. 发明专利

JPS62168267A CALCULATION SYSTEM FOR SHORTEST ROUTE 失效
公开(公告)号：JPS62168267A
公开(公告)日：1987-07-24
申请号：JP20652885
申请日：1985-09-20
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KANO TAKASHI , HOSHI TORU , KASHIO JIRO
IPC分类号： G06F17/10
摘要： PURPOSE:To improve the processing efficiency for calculation of the shortest route by treating adjacent matrices where the relation between adjacent nodes is shown by the elements of '1' and '0' by means of logical operation of bits. CONSTITUTION:In a network consisting of nodes A-F, each element of an adjacent matrix ¦A¦ containing an element of '0' or '1' showing an adjacent state between two nodes is set at a single bit. Then the rows of the ¦A¦ are stored in the memory areas (1)-(6) with the columns stored in the memory areas (7)-(12) respectively. While areas (13)-(24) are set for arrivable matrices ¦R1¦-¦Rn¦ expressed by ¦Rn¦=¦Rn-1¦*¦A¦. The calculation of the arrivable matrix R2 is calculated by performing an operation for an AND corresponding to the bits of the 1st row (13) of the arrivable matrix ¦R1¦ (=¦A¦) and the 1st col umn (7) of an adjacent matrix ¦A¦ and then setting the arithmetic result at '1' since the contents of said register are not equal to '0'. A distance matrix is calculated by an equation based on the arithmetic result of the arrivable matrix. Thus is it possible to calculate the shortest route with small memory capacity and high arithmetic efficiency.

5. 发明专利

JPS62115949A PACKET SWITCHING EQUIPMENT 失效
公开(公告)号：JPS62115949A
公开(公告)日：1987-05-27
申请号：JP25386985
申请日：1985-11-14
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KANO TAKASHI , HOSHI TORU , KASHIO JIRO
摘要： PURPOSE:To improve the processing ability by making a packet switching circuit into the self-rooting switching circuit composed of plural switching elements mutually connected to the line interface and executing the necessary switching control in accordance with the transfer packet from the line interface by the control part. CONSTITUTION:Line interfaces 4-6 provided corresponding to respective lines examine the classification of the received packet, discriminates the packet which may be conveyed to the address line as it does and the packet to need the processing by a control part 2, the former sticks the address of the conveying destination line interface, sends it to a self-rooting packet switching circuit 3 and the latter transfers it to the control part. The self-rooting packet switching circuit 3 sends the sent packet to the equivalent line interface in accordance with the address stuck to it. Thus, the burden of the control part is decreased, further, the problems of the competition and the congestion of the access to the common memory will not occur and the wide improvement of the processing ability of the packet switching equipment can be expected.

6. 发明专利

JPH06337788A HYPOTHETICAL INFERENCE SYSTEM 失效
公开(公告)号：JPH06337788A
公开(公告)日：1994-12-06
申请号：JP12670393
申请日：1993-05-28
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： KANO TAKASHI , NAKANO TAKAYUKI , KOBAYASHI OSAMU
IPC分类号： G06F9/44
摘要： PURPOSE:To provide the hypothetical inference system which performs fast inference by collating multiple-world rules and single-world rules with data to be inference object and executing rules whose conditions are met. CONSTITUTION:This system consists of a rule interpretation execution part 1 and a hypothesis management part 2. The rule interpretation execution part 1 collates the multiple-world rules and single-world rules described in a file as a knowledge base with the data to be handled in the inference and fires sophisticated ruled in if... then... format which meet the conditions to interpret and execute the rules. The hypothesis management part 2 stores justifications generated at the time of the rule firing and generates hypothesis data derived by using them. The generated data are delivered to the rule interpretation execution part 1 again and to be collated with a next rule.

7. 发明专利

JPS63219247A SYSTEM FOR MANAGING NETWORK STATE OF PACKET SWITCHING NETWORK 失效
公开(公告)号：JPS63219247A
公开(公告)日：1988-09-12
申请号：JP5194487
申请日：1987-03-09
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KASHIO JIRO , KANO TAKASHI , TANAKA MASAHIKO
摘要： PURPOSE:To evade discrepancy between a network state recognized by a centralized control station and an actual network state from being generated, by setting a normal state when a required condition is satisfied after receiving the recovery of a line from a faulty state to the normal state by the centralized control station. CONSTITUTION:For example, the fault of the line l1 is reported from a packet switching machine 5 to the centralized control station 4. In this case, a report from a packet switching machine 6 passes through a packet switching machine 9, and the generation of the fault of the line l3 on which the fault has been generated already is not received by the station 4. And after the recovery of the line l1 is reported, the station 4 sets a timer start normal state 3, and sets the normal state of the line l1 after the lapse of a timer time. Therefore, it is possible to evade the discrepancy between the network state recognized by the centralized control station and the actual network state due to the invert of an arrival order from being generated even when the line l3 is recovered to the normal state during that time.

8. 发明专利

JPS62281541A ROUTING CONTROL SYSTEM 失效
公开(公告)号：JPS62281541A
公开(公告)日：1987-12-07
申请号：JP12339586
申请日：1986-05-30
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： KANO TAKASHI , SUZUKI MICHIO , HOSHI TORU , KASHIO JIRO , TAKEUCHI YASUSHI
IPC分类号： G01C21/00
摘要： PURPOSE:To avoid the ping-pong looping by allowing each station to apply route retrieval and by passing other path in response to the state at a relay station. CONSTITUTION:Each node the decides packet type to a reception packet at first. Priority is given to a path receiving the packet in the order of reception of the route retrieval packet and a route retrieval packet is sent simultaneously to all paths except the received path. The packets whose reception order is a 2nd and succeeding order are abolished. When the packet type is an even notice packet and it is addressed to other station, the packet is sent simultaneously to all paths except the received path and when the packet is addressed to its own station, a new route is retrieved. If ping-pong and looping take place due to bypassing, the occurrence of an event is informed to the station being the destination of the packet and the said station applies new routing, then the routing table is rewritten.

9. 发明专利

JPH01119149A PACKET SWITCHING NETWORK CONTROL SYSTEM 失效
公开(公告)号：JPH01119149A
公开(公告)日：1989-05-11
申请号：JP27578287
申请日：1987-11-02
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KANO TAKASHI , AOKI EIICHI , NAKAMURA TSUTOMU , SASAKI RYOICHI
摘要： PURPOSE:To rapidly recover a switching node to a network due to the generation and recovery of a fault even when management for a sequence number is performed by controlling the sequence number managed by the switching node so as to be synchronized with the sequence number of a received packet. CONSTITUTION:In case of performing re-transmission by a retry operation without receiving a response for flooding by terminals 31-33 which transmit flooding packets, an instruction to synchronize the sequence number managed by the switching nodes 1-6 is issued compulsorily. Also, each of the switching nodes 1-6, in case of receiving the packet of compulsory instruction for the sequence number, controls the sequence number being managed by its own station so as to be synchronized with that of the packet. Therefore, when the switching node is not isolated, it is synchronized with ordinary sequence control, and only when it is isolated due to the fault and recovered again, the sequence control functions compulsorily. In such a way, it is possible to prevent malfunction from being generated, and to perform a packet switching processing rapidly.

10. 发明专利

JPS6268343A ROUTING CONTROL SYSTEM IN PACKET EXCHANGE NETWORK 失效
公开(公告)号：JPS6268343A
公开(公告)日：1987-03-28
申请号：JP20652985
申请日：1985-09-20
申请人： HITACHI LTD , HITACHI SEIBU SOFTWARE KK
发明人： SUZUKI MICHIO , KANO TAKASHI , HOSHI TORU , KAJIO JIRO , TAKEUCHI YASUSHI
IPC分类号： H04L12/70 , H04L12/727
摘要： PURPOSE:To select a path minimizing the delay time by recognizing the delay time between all two stations in a network from network form information provided statically in the center and the delay time of each line obtained by the report of each exchange station and informing the estimated delay to each exchange station from an adjacent station to the destination. CONSTITUTION:A connection state table 20 stored in a node A provided for the center function as network form information represents how each node is connected to any path and is rewritten when the network form is changed. Each node estimates the delay time from the queue length caused at each path of its own station to the adjacent station and reports it as the estimated delay by using a packet periodically to the center. The node A having the center function forms the estimated delay table 21 based on the report from each node periodically or each report reception from each node. The content of the estimated delay table 21 represents the minimum value of the estimated delay from the adjacent station to the destination station when each node selects a sending path.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式