KR910003969A

KR910003969A - Information routing method and apparatus

Info

Publication number: KR910003969A
Application number: KR1019900009532A
Authority: KR
Inventors: 마크 굴드 죠엘; 마리온 히긴스 2세 챨스; 해밀턴 프레이 2세 알렉산더
Original assignee: 하워드 지. 피커로아; 인터내셔널 비지네스 머신즈 코포레이션
Priority date: 1989-07-27
Filing date: 1990-06-27
Publication date: 1991-02-28
Also published as: PE10891A1; AU5786390A; CA2015968A1; CN1049066A; EP0410568A3; EP0410568B1; CA2015968C; KR930004910B1; JP2505060B2; EP0410568A2; DE69029766D1; CN1020533C; AR245303A1; JPH0365750A; US5181017A; BR9003630A; AU622815B2; DE69029766T2

Abstract

내용 없음.No content.

Description

Information routing method and apparatus

본 내용은 요부공개 건이므로 전문내용을 수록하지 않았음Since this is an open matter, no full text was included.

제2도는 본 발명에 따른 루팅 메카니즘과 노드 사이의 관계의 설명도,2 is an explanatory diagram of a relationship between a routing mechanism and a node according to the present invention;

제4도는 본 발명에 따른 표본 네트워크의 설명도.4 is an explanatory diagram of a sample network according to the present invention.

제9도는 본 발명에 따른 수신기와 주사기(injector) 모듈의 상태 변화를 설명하는 흐름도.9 is a flow chart illustrating a change in state of a receiver and an injector module in accordance with the present invention.

Claims

A method for routing information in a normal topology network having current network information between a first node and a second node, the method comprising: a) updating a data transaction comprising the information and current network information; and b) the second node. Determining a plurality of transmission links on the root for the interconnected nodes, c) reserving a series of transmission links on the root for the second interconnected node, and d) a series of multiple reservations. Transmitting a transaction to each of the transmitted transport links, e) continuing to transmit a portion of the transaction to each of the plurality of reserved transport links until no more information remains in the transaction; And repeating steps b), c), d), and e) until reaching two nodes.

The method of claim 1, further comprising: a) searching a normal topology network to determine the state of the network; b) storing the state as a transaction header; and c) outgoing sequence to assist each intermediate node. Using the state to select a particular network link of the information routing method.

2. The method of claim 1, comprising reserving a series of multiple transmission links having sufficient bandwidth to continue concurrently communicating the information.

2. The method of claim 1 further comprising transmitting information in a complete packet of a transaction on each of said plurality of transmission links.

2. The method of claim 1, further comprising releasing the link the moment the information is passed to the next network link.

2. The method of claim 1 further comprising releasing all secondary routines once the primary route is established.

The method of claim 1 further comprising: a) determining whether the routine is blocked, and b) terminating the relationship of the node in the transmission when the route is blocked.

An apparatus for routing information in a normal topology network having current network information between a first node and a second node, the apparatus comprising: a) means for updating a data transaction comprising the information and current network information, and b) the second Means for determining a plurality of transmission links on the route for the interconnected nodes, c) means for reserving a series of transmission links on the route for the second interconnected node, and d) a series of multiple reserved links. Means for transmitting a transaction on each of the transport links, and e) means for continuing to transmit a portion of the transaction to each of the series of multiple reserved transport links until no more information remains in the transaction; Means for repeating steps b), c) d) and e) until reaching a node.

10. The apparatus of claim 8, wherein each network link has means for simultaneously delivering multiple messages.

9. The method of claim 8, further comprising: a) means for searching a normal topology network to determine the state of the network, b) means for storing the state as a transaction header, and c) outgoing to assist each intermediate node. Using the state to select a series of specific network links.

9. The apparatus of claim 8, further comprising reserving a series of multiple transmission links having sufficient bandwidth to continue concurrently communicating the information.

9. The apparatus of claim 8, further comprising transmitting information in a complete packet of a transaction on each of said plurality of transmission links.

9. The apparatus of claim 8, further comprising releasing the link the moment the information is passed to the next network link.

10. The apparatus of claim 8, wherein the first node and the second node are in a separate normal phase network connected together via a split bidirectional link.

The information routing device of claim 8, wherein the second node is an externally interconnected terminal device connected through a bidirectional link of a specific node.

9. The apparatus of claim 8 further comprising: a) means for determining if the route is blocked, and b) means for terminating the node's relationship in transmission when the route is blocked.

9. The apparatus of claim 8, further comprising means for releasing all secondary routes once the primary route is established.

※ Note: The disclosure is based on the initial application.