US5787256A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for data communication between nodes
Assignee: International Business Machines Corp
•
Filing: 1996-08-06
•
Granted: 1998-07-28
•
Expires: 2016-08-06
Abstract
Abstract An apparatus and method for communicating information between a computer and a plurality of peripherals along a plurality of communication channels is disclosed. The computer and peripherals are connected in a succession of stages (cascaded), in a tree-like (hierarchical) communication network configuration. Peripherals in the network include an associated communication unit which is responsible for transmitting and/or receiving data communicated on a communication channel. The communication unit facilitates the transfer of data to, and the receipt of data from, the unit's parent, and also facilitates the transfer of data to, and the receipt of data from, any child units. In the invented method, each communication unit, in parallel, composes those individual messages received from child units into a single composite message and transmits the composite message to the communication unit's parent. The parent, in turn, composes those individual or composite messages it has received into a single composite message and transmits the contents to its parent. This continues until a single composite message is transmitted to the computer for processing. The computer decomposes a composite message into its constituent individual messages and processes individual messages. The computer can also transmit messages to peripherals in a reciprocal manner, that is, by composing a single composite message to be transmitted to the first stage communication unit and thereafter decomposed and distributed to designated nodes within the network.
Inventors
- 👤 Mark Douglas Marik
- 👤 Robert Anthony Palo
- 👤 Susan E. Waefler
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 11:46
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/38; G06F13/40; G06F13/4004; G06F13/4022
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
211 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral, a composer, has at least one parent and at least one child, comprising the steps of: for at least one composer, (a) establishing a communication link between the composer and a parent; (b) transmitting a first composite message, if any, from the composer to the parent; (c) for at least one child within a set of children, (i) establishing a communication link between the composer and a child; (ii) receiving a message, if any, from the child; (iii) for each additional selected child, if any, repeating steps (c)(i) through (c)(ii), wherein a set of messages from a subset-of the set of children may be received; (d) composing the set of messages from step (c) into a second composite message; and (e) repeating steps (a) through (d) until terminated, wherein the second composite message of step (d) becomes the first composite message of step (b); whereby the composer is capable of composing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of composing messages asynchronously with at least one other peripheral in the hierarchy.
Claim 2
Dependent Claim
211 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral, a composer, has at least one parent and at least one child, comprising the steps of: for at least one composer, (a) establishing a communication link between the composer and a parent; (b) transmitting a first composite message, if any, from the composer to the parent; (c) for at least one child within a set of children, (i) establishing a communication link between the composer and a child; (ii) receiving a message, if any, from the child; (iii) for each additional selected child, if any, repeating steps (c)(i) through (c)(ii), wherein a set of messages from a subset-of the set of children may be received; (d) composing the set of messages from step (c) into a second composite message; and (e) repeating steps (a) through (d) until terminated, wherein the second composite message of step (d) becomes the first composite message of step (b); whereby the composer is capable of composing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of composing messages asynchronously with at least one other peripheral in the hierarchy.
Claim 3
Dependent Claim
31 words
Method according to claim 1, wherein step (a) includes receiving a SNRM command from the parent; sending an NSA response to the parent; and receiving an RR command from the parent.
Claim 4
Dependent Claim
37 words
Method according to claim 1, wherein step (b) includes converting a first composite message stored in a memory from a parallel representation to a serial representation and transmitting the serial representation from the peripheral to the parent.
Claim 5
Dependent Claim
61 words
Method according to claim 1, wherein, for each selected child, step (c) includes: sending a SNRM command to the child; receiving an NSA response from the child; sending an RR command to the child; receiving a serial representation of a non-control message from the child; converting the serial representation into a parallel representation; and storing the parallel representation in a memory.
Claim 6
Dependent Claim
75 words
Method according to claim 1, wherein, for each selected child, step (c) includes: sending a SNRM command to the child; receiving an NSA response from the child; sending an I-frame response to the child; receiving an RNR response from the child; sending an RR command to the child; receiving a serial representation of a non-control message from the child; converting the serial representation into a parallel representation; and storing the parallel representation in a memory.
Claim 7
Dependent Claim
61 words
Method according to claim 1, wherein, for each selected child, step (c) includes: sending a SNRM command to the child; receiving an I-frame response from the child; sending an RR command to the child; receiving a serial representation of a non-control message from the child; converting the serial representation into a parallel representation; and storing the parallel representation in a memory.
Claim 8
Dependent Claim
67 words
Method according to claim 1, wherein each message in the set of messages includes indicia for indicating which child sent the message, and step (d) includes: composing the messages in the set of messages in a decomposable second composite message; associating with the second composite message indicia for indicating the peripheral; and storing the second composite message in a memory wherein it becomes the first composite message.
Claim 9
Dependent Claim
178 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral, a decomposer, has at least one parent and at least one child, comprising the steps of: for at least one decomposer, (a) establishing a communication link between the decomposer and a parent; (b) receiving a composite message, if any, from the parent; (c) decomposing the composite message into one or more messages; (d) for at least one child of the decomposer, (i) establishing a communication link between the decomposer and a child; (ii) transmitting a selected one of said one or more messages to the child; (iii) for each additional selected child of the composer, if any, repeating steps (d)(i) through (d)(ii); and (e) repeating steps (a) through (d) until terminated; whereby the decomposer is capable of decomposing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of decomposing messages asynchronously with at least one other peripheral in the hierarchy.
Claim 10
Dependent Claim
178 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral, a decomposer, has at least one parent and at least one child, comprising the steps of: for at least one decomposer, (a) establishing a communication link between the decomposer and a parent; (b) receiving a composite message, if any, from the parent; (c) decomposing the composite message into one or more messages; (d) for at least one child of the decomposer, (i) establishing a communication link between the decomposer and a child; (ii) transmitting a selected one of said one or more messages to the child; (iii) for each additional selected child of the composer, if any, repeating steps (d)(i) through (d)(ii); and (e) repeating steps (a) through (d) until terminated; whereby the decomposer is capable of decomposing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of decomposing messages asynchronously with at least one other peripheral in the hierarchy.
Claim 11
Dependent Claim
186 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral has at least one parent and at least one child, comprising the steps of: for at least one peripheral having at least one parent and at least one child, (a) establishing a communication link between the peripheral and a parent; (b) communicating a first composite message, if any, between the peripheral and the parent; (c) for at least one child of the peripheral, (i) establishing a communication link between the peripheral and a child; (ii) communicating a second composite message, if any, between the peripheral and the child; (iii) for each additional selected child of the peripheral, if any, repeating steps (c)(i) through (c)(ii); (d) processing messages at the peripheral; and (e) repeating steps (a) through (d) until terminated; whereby the peripheral is capable of processing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of processing messages asynchronously with at least one other peripheral in the hierarchy.
Claim 12
Dependent Claim
186 words
Method for data communication between a computer and at least three peripherals connected along a plurality of communication channels, the peripherals being connected in a hierarchy wherein at least one peripheral has at least one parent and at least one child, comprising the steps of: for at least one peripheral having at least one parent and at least one child, (a) establishing a communication link between the peripheral and a parent; (b) communicating a first composite message, if any, between the peripheral and the parent; (c) for at least one child of the peripheral, (i) establishing a communication link between the peripheral and a child; (ii) communicating a second composite message, if any, between the peripheral and the child; (iii) for each additional selected child of the peripheral, if any, repeating steps (c)(i) through (c)(ii); (d) processing messages at the peripheral; and (e) repeating steps (a) through (d) until terminated; whereby the peripheral is capable of processing messages independently of at least one indirectly connected peripheral in the hierarchy, and is also capable of processing messages asynchronously with at least one other peripheral in the hierarchy.
References Cited (Backward Citations)
US3810101A
Cited
US4097695A
Cited
EP0018754A1
Cited
US4325147A
Cited
US4833672A
Cited
US4845744A
Cited
US4766534A
Cited
US4907225A
Cited
US4910669A
Cited
US4920484A
Cited
WO1991014229A1
Cited
US5245609A
Cited
US5117430A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-07-27 | 2002-01-26 | 2002-07-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-07-27 | 2006-01-26 | 2006-07-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-07-27 | 2010-01-26 | 2010-07-28 | $7700.00 | Window Closed / Lapsed |