EP0281757A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Message transfer system and method
Assignee: Hitachi Ltd
•
Filing: 1988-02-02
•
Granted: —
•
Expires: 2008-02-02
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 (5) in 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 (5), 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
EP
Data Source
google_patents
Last Synchronized
2026-11-10 02:30
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: 8
Claim 1
Independent Claim
132 words
A message transfer system wherein messages are transferred among a plurality of nodes (51...54) by segmenting each of the messages into a plurality of packets on a transmission loop (1); characterized in that each of at least two nodes (51...54) constituting said system comprises message buffer means (5) to register packets in correspondence with addresses of the mate nodes from which messages are to be received, means (12) to reassemble an original message from received packets, means (2) to detect whether or not packets having arrived are registered, means (2) to discriminate whether or not the packets having arrived are to be received, and means (13) to permit the reception and reassembly of only the packets from the mate nodes limited by the detection means as well as the discrimination means (2).
Claim 2
Dependent Claim
132 words
A message transfer system wherein messages are transferred among a plurality of nodes (51...54) by segmenting each of the messages into a plurality of packets on a transmission loop (1); characterized in that each of at least two nodes (51...54) constituting said system comprises message buffer means (5) to register packets in correspondence with addresses of the mate nodes from which messages are to be received, means (12) to reassemble an original message from received packets, means (2) to detect whether or not packets having arrived are registered, means (2) to discriminate whether or not the packets having arrived are to be received, and means (13) to permit the reception and reassembly of only the packets from the mate nodes limited by the detection means as well as the discrimination means (2).
Claim 3
Dependent Claim
57 words
A message transfer system as defined in claim 1, further comprising means (3) to register the packet having arrived, anew in an empty field of said message buffer means (5) in a case where said packet is detected as being unregistered by the detection means (2) and where said message buffer means (5) has the empty field.
Claim 4
Dependent Claim
52 words
A message transfer system as defined in claim 1 or 2, wherein said message buffer means (5) consists of a plurality of message buffers each of which corresponds to one packet having arrived, so that messages from the mates equal in number to said message buffers can be simultaneously waited and received.
Claim 5
Dependent Claim
32 words
A message transfer system as defined in claim 2 or 3, further comprising means to return the packet having arrived, as being unreceivable when said message buffer means has no empty field.
Claim 6
Dependent Claim
31 words
A message transfer system as defined in claim 4, further comprising means to resend the packet returned as being unreceivable, when a timer value has matched with a preset wait time.
Claim 7
Dependent Claim
118 words
A message transfer method wherein messages are transferred among a plurality of nodes (51...54) by segmenting each of the messages into a plurality of packets on a transmission loop (1); characterized in that an operation of each of at least two nodes (51...54) comprises the steps of performing message buffering for registering packets in correspondence with addresses of the mate nodes from which messages are to be received, reassembling an original message from received packets, detecting whether or not packets having arrived are registered, discriminating whether or not the packets having arrived are to be received, and permitting the reception and reassembly of only packets from the mate nodes limited by the detection as well as the discrimination.
Claim 8
Dependent Claim
118 words
A message transfer method wherein messages are transferred among a plurality of nodes (51...54) by segmenting each of the messages into a plurality of packets on a transmission loop (1); characterized in that an operation of each of at least two nodes (51...54) comprises the steps of performing message buffering for registering packets in correspondence with addresses of the mate nodes from which messages are to be received, reassembling an original message from received packets, detecting whether or not packets having arrived are registered, discriminating whether or not the packets having arrived are to be received, and permitting the reception and reassembly of only packets from the mate nodes limited by the detection as well as the discrimination.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.