US5931916A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for retransmitting data packet to a destination host by selecting a next network address of the destination host cyclically from an address list
Assignee: British Telecommunications PLC
•
Filing: 1995-12-08
•
Granted: 1999-08-03
•
Expires: 2015-12-08
Abstract
Abstract In a multi-processor environment, a plurality of nodes interconnected by a number of networks each run a number of users processes and messages transferred by the processes are transmitted sequentially from a transmitting node to a receiving node using a different network for each datagram to be transferred.
Inventors
- 👤 Richard J. Barker
- 👤 Andrew M. Lucking
- 👤 James C. T. Chapman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 20:40
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5691; H04L12/5692; H04L9/00; H04L9/40; H04L69/00; H04L69/14
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
147 words
A method of transferring data packets between processes running in a multi-processor environment of the kind comprising a plurality of host computers each accessible at a plurality of network node addresses, the method comprising: establishing for each process to be addressed a destination host identity and a destination host port, establishing for each destination host identity an address list comprising a plurality of corresponding network node addresses, for each transmission of a data packet selecting from the respective address list for the destination host a network node address being the next address cyclically in the list to the last address used for transmission between the nodes, adding to the data packet a header defining the selected network node address and the destination port, monitoring return data for packet acknowledgement and retransmitting any data packet not so acknowledged to the next network node address in the address list.
Claim 2
Independent Claim
147 words
A method of transferring data packets between processes running in a multi-processor environment of the kind comprising a plurality of host computers each accessible at a plurality of network node addresses, the method comprising: establishing for each process to be addressed a destination host identity and a destination host port, establishing for each destination host identity an address list comprising a plurality of corresponding network node addresses, for each transmission of a data packet selecting from the respective address list for the destination host a network node address being the next address cyclically in the list to the last address used for transmission between the nodes, adding to the data packet a header defining the selected network node address and the destination port, monitoring return data for packet acknowledgement and retransmitting any data packet not so acknowledged to the next network node address in the address list.
Claim 3
Dependent Claim
52 words
A method of transferring data packets as claimed in claim 1, further characterised in that each message header sent between processes includes a message sequence number which is incremented by the transmitting node to permit the receiving node to identify the absence of one or more messages in a sequence of messages.
Claim 4
Dependent Claim
31 words
A method of transferring data packets as claimed in claim 2, further characterised in that the transmitting node increments the sequence number on receipt of an acknowledgement from the receiving node.
Claim 5
Dependent Claim
51 words
A method of transferring data packets as claimed in claim 2, further characterised in that the receiving node holds a record of the last received sequence number and on receipt of a data packet including the correct sequence number returns an acknowledgement to the transmitting node and increments its sequence number.
Claim 6
Dependent Claim
39 words
A method of transferring data packets as claimed in claim 4, further characterised in that on detection of an incorrect sequence number one less than the correct sequence number the receiving node returns an acknowledgement to the transmitting node.
Claim 7
Dependent Claim
49 words
A method of transferring data packets as claimed in claim 4, further characterised in that in the absence of a correctly received sequence number the receiving node returns a message bearing the received sequence number with a flag indicating that an out of sequence data packet has been received.
Claim 8
Dependent Claim
36 words
A method of transferring data packets as claimed in claim 2, further characterised in that on identifying the absence of a message in a sequence of messages the receiving node withholds acknowledgement from the transmitting node.
Claim 9
Dependent Claim
47 words
A method of transferring data packets as claimed in claim 7, further characterised in that in the absence of an acknowledgement within a predetermined time period, the transmitting node causes the retransmission of any previously forwarded data packet on which an acknowledgement has not previously been received.
Claim 10
Dependent Claim
52 words
A method of transferring data packets as claimed in claim 2, further characterised in that the receiving node receives a plurality of data packets from the transmitting node and sends an acknowledgement either on receipt of a predetermined number of data packets or on expiry of a pre-determined period whichever occurs first.
Claim 11
Dependent Claim
38 words
A method of transferring data packets as claimed in claim 9, further characterised in that on receiving an acknowledgement carrying a particular message sequence number, the transmitting node determines that all previously numbered data packets have been received.
Claim 12
Dependent Claim
52 words
A method of transferring data packets as claimed in claim 10, further characterised in that on receipt of a data packet bearing an out of sequence message number the receiving node stores the data packet until all previously numbered data packets are received prior to sending an acknowledgement of the data packet.
Claim 13
Dependent Claim
64 words
A method of transferring data packets as claimed in claim 11, further characterised in that if the receiving node message sequence number of the latest data packet received exceeds the lowest message sequence number of a message not yet received by a predetermined number, the receiving node transmits an acknowledgement of the last data packet received which has the highest sequential message sequence number.
Claim 14
Dependent Claim
71 words
A method of transferring data packets as claimed in claim 1, further characterised in that the header includes a fragment number which indicates that the transfer data packet is only a portion of the complete data packet to be transferred between the sending and receiving processes and the receiving node re-assembles the fragments of the complete data packet from a number of transferred data packets for transmission to the receiving process.
Claim 15
Dependent Claim
38 words
A method of transferring data packets as claimed in claim 1, further characterised in that any network node address in the respective address list exceeding a predetermined number of data packets failures is eliminated from the address list.
Claim 16
Dependent Claim
33 words
A method of transferring data packets as claimed in claim 14, further characterised in that a plurality of attempts are made at periodic intervals to establish a connection to eliminated network node addresses.
References Cited (Backward Citations)
US4058672A
Cited
WO1984000860A1
Cited
US5088032A
Cited
US4901312A
Cited
US4947389A
Cited
EP0512174A1
Cited
US5293488A
Cited
US5432907A
Cited
US5260933A
Cited
US5541911A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-02 | 2003-02-01 | 2003-08-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-02 | 2007-02-01 | 2007-08-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-02 | 2011-02-01 | 2011-08-03 | $7700.00 | Window Closed / Lapsed |