← Back to Patent Explorer
US4930122A Expired / Lapsed US ⏱️ 0.0 years remaining

Message transfer system and method

Assignee: Hitachi Ltd
•
Filing: 1988-01-29
•
Granted: 1990-05-29
•
Expires: 2008-01-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Messages are transferred among a plurality of nodes by segmenting each of the messages into a plurality of packets on a transmission loop, and a receiver circuit which reassembles the segmented packets into the original message by the use of message buffers is comprised in each of the nodes, to detect whether or not a packet having arrived is from a registered mate, so that when the mate of the packet is not registered, the packet having arrived is registered anew in an empty field in any of the message buffers, thereby to perform message buffering, and that when no empty field exists, the packet having arrived is returned as being unreceivable, whereupon the sending mate having received the packet resends it.

Inventors

  • 👤 Yasuhiro Takahashi
  • 👤 Osamu Takada

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 07:37
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 93 words
A message transfer system wherein messages are transferred between at least two nodes on a transmission loop by segmenting each of the messages into a plurality of packets, said system comprising: storage means for registering a code that identifies the sender address from which messages are to be received; message buffer means for receiving and reassembling the message from the received packets; means for controlling the arrival of said packets at said message buffer means, in accordance with whether or not said packets correspond to the registered code which identifies the sender address.
Claim 2
Dependent Claim 93 words
A message transfer system wherein messages are transferred between at least two nodes on a transmission loop by segmenting each of the messages into a plurality of packets, said system comprising: storage means for registering a code that identifies the sender address from which messages are to be received; message buffer means for receiving and reassembling the message from the received packets; means for controlling the arrival of said packets at said message buffer means, in accordance with whether or not said packets correspond to the registered code which identifies the sender address.
Claim 3
Dependent Claim 58 words
A message transfer system as defined in claim 1, wherein said means for controlling further comprises: means to detect empty buffer fields when said received packet does not correspond to any of the registered codes in the storage means and to register said code which identifies the sender address of said received packet in said empty storage means.
Claim 4
Dependent Claim 42 words
A message transfer system as defined in claim 1, wherein said message buffer means comprises a plurality of message buffer fields, such that messages from the sender addresses equal in number to said message buffer fields can be simultaneously received and reassembled.
Claim 5
Dependent Claim 39 words
A message transfer system as defined in claim 2, further comprising means to return the packet to said sender address, when said sender address does not correspond to any of the registered codes and no storage means are available.
Claim 6
Dependent Claim 23 words
A message transfer system as defined in claim 4, further comprising means to retransmit said returned packet after a predetermined period of time.
Claim 7
Dependent Claim 85 words
In a message transfer system wherein messages are transferred between at least two nodes on a transmission loop by segmenting each of the messages into a plurality of packets, a message transfer method comprising the steps of: storing a code for identifying the sender address from which messages are to be received; controlling the arrival of said packets in accordance with whether or not said packets correspond to the registered code which identifies the sender address; and receiving and reassembling the message from the packets.
Claim 8
Dependent Claim 85 words
In a message transfer system wherein messages are transferred between at least two nodes on a transmission loop by segmenting each of the messages into a plurality of packets, a message transfer method comprising the steps of: storing a code for identifying the sender address from which messages are to be received; controlling the arrival of said packets in accordance with whether or not said packets correspond to the registered code which identifies the sender address; and receiving and reassembling the message from the packets.
Claim 9
Dependent Claim 206 words
A communication network system having a plurality of nodes connected to at least a transmission path and at least a processing device which is to be a source or a destination of a message, each of said nodes comprising: means for dividing a message received from said processing device into packets and sending out to said transmission path, each of said packets having a code which identifies the sender address and the destination address; buffer means comprising a plurality of buffer fields for storing received packets sent from other nodes over said path; first memory means for indicating the availability of buffer fields; second memory means for storing said code which identifies the sender address of a received packet; and control means for controlling the arrival of said packets, in accordance with whether or not said code which identifies the sender address of said packet corresponds with said code stored in said second memory means, when said code for identifying the sender address of said received packet does not correspond to said code stored in said second memory means and said first memory means indicates an empty buffer field, storing said code for identifying the sender address of the received packet in said empty buffer field.
Claim 10
Dependent Claim 206 words
A communication network system having a plurality of nodes connected to at least a transmission path and at least a processing device which is to be a source or a destination of a message, each of said nodes comprising: means for dividing a message received from said processing device into packets and sending out to said transmission path, each of said packets having a code which identifies the sender address and the destination address; buffer means comprising a plurality of buffer fields for storing received packets sent from other nodes over said path; first memory means for indicating the availability of buffer fields; second memory means for storing said code which identifies the sender address of a received packet; and control means for controlling the arrival of said packets, in accordance with whether or not said code which identifies the sender address of said packet corresponds with said code stored in said second memory means, when said code for identifying the sender address of said received packet does not correspond to said code stored in said second memory means and said first memory means indicates an empty buffer field, storing said code for identifying the sender address of the received packet in said empty buffer field.
Claim 11
Dependent Claim 55 words
A communication network system according to claim 7, wherein, each node further comprises: means for indicating to the sender address that the node is not ready to receive when said control means determines that the sender address of the received packet does not correspond to the register code and no empty buffer field is available.

References Cited (Backward Citations)

US4736370A Cited
US4665514A Cited
US4755986A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-05-28 1993-11-27 1994-05-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-05-28 1997-11-27 1998-05-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-05-28 2001-11-27 2002-05-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag