US6310892B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reliable connectionless network protocol
Assignee: Oracle International Corp
•
Filing: 1998-01-09
•
Granted: 2001-10-30
•
Expires: 2018-01-09
Abstract
Abstract A reliable connectionless protocol is used in a networking environment. A transport layer receives data for transfer between a source node and a destination node on a network. The transport layer divides the data into predetermined length data packets, and generates a segment header for each data packet. The transport layer generates independent segments by combining each data packet with a corresponding segment header. Consequently, each segment, including the first segment and the last segment, contains a data packet. The independent segments are transferred from the source node to the destination node via the network without establishing a connection. A transport layer on the destination node creates local state upon receipt of the first segment, and extracts the data from the data packets to re-construct the original data. The local state is released when the destination node receives the last segment in the message.
Inventors
- 👤 Jeffrey C. Olkin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 22:45
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 42
Claim 1
Independent Claim
111 words
A method for transferring data from a source node to a destination node over a network, the method comprising the computer-implemented steps of: dividing said data into a series of one or more segments; creating a plurality of packets, wherein each packet of said plurality of packets includes: first data that allows said destination node to determine whether all segments of said series have been received at said destination node, and second data that allows said destination node to order said segments to reconstruct said data that was divided into said series of one or more segments; and sending said plurality of packets from said source node to said destination node.
Claim 2
Independent Claim
111 words
A method for transferring data from a source node to a destination node over a network, the method comprising the computer-implemented steps of: dividing said data into a series of one or more segments; creating a plurality of packets, wherein each packet of said plurality of packets includes: first data that allows said destination node to determine whether all segments of said series have been received at said destination node, and second data that allows said destination node to order said segments to reconstruct said data that was divided into said series of one or more segments; and sending said plurality of packets from said source node to said destination node.
Claim 3
Dependent Claim
35 words
The method of claim 1 , wherein said first data includes third data that indicates whether each packet of said plurality of packets includes a first segment of said series of one or more segments.
Claim 4
Dependent Claim
39 words
The method of claim 2 , wherein said third data includes a first bit that is set by the source node to indicate that a particular packet includes said first segment of said series of one or more segments.
Claim 5
Dependent Claim
35 words
The method of claim 1 , wherein said first data includes third data that indicates whether each packet of said plurality of packets includes a last segment of said series of one or more segments.
Claim 6
Dependent Claim
40 words
The method of claim 4 , wherein said third data includes a second bit that is not set by the source node to indicate that a particular packet includes said last segment of said series of one or more segments.
Claim 7
Dependent Claim
32 words
The method of claim 1 , wherein said first data that indicates whether each packet of said plurality of packets includes an intermediate segment of said series of one or more segments.
Claim 8
Dependent Claim
51 words
The method of claim 6 , wherein said third data includes a first bit that is not set by the source node and a second bit that is set by the source node to indicate that a particular packet includes said intermediate segment of said series of one or more segments.
Claim 9
Dependent Claim
24 words
The method of claim 1 , wherein said first data includes third data that indicates whether said plurality of packets consists of one packet.
Claim 10
Dependent Claim
54 words
The method of claim 8 , wherein said third data includes a first bit that is set by the source node and a second bit that is not set by the source node to indicate that said series of one or more segments consists of one segment that is included in said one packet.
Claim 11
Dependent Claim
39 words
The method of claim 1 , wherein said second data includes a sequence number that indicates for each packet of said plurality of packet s a position in said series for each segment that is included in each packet.
Claim 12
Dependent Claim
23 words
The method of claim 1 , wherein each packet of said plurality of packets further includes third data that identifies the source node.
Claim 13
Dependent Claim
26 words
The method of claim 1 , wherein each packet of said plurality of packets further includes third data that specifies an address of the destination node.
Claim 14
Dependent Claim
25 words
The method of claim 1 , wherein each packet of said plurality of packets further includes third data that specifies a size of each packet.
Claim 15
Dependent Claim
62 words
The method of claim 1 , further comprising the computer-implemented steps of: receiving, at said source node from said destination node, an acknowledgement for each packet that is received by said destination node; and when said acknowledgement for a particular packet is not received within a predetermined length of time, sending said particular packet from said source node to said destination node.
Claim 16
Dependent Claim
26 words
The method of claim 14 , wherein said predetermined length of time is adjusted based on how long after sending each packet said acknowledgement is received.
Claim 17
Independent Claim
118 words
A method for transferring data from a source node to a destination node over a network, the method comprising the computer-implemented steps of: receiving, at said destination node from said source node, a plurality of packets, wherein each packet of said plurality of packets includes a segment created by said source node dividing said data into a series of segment; determining based on first data included in each packet whether all segments of said series have been received at said destination node; and when all segments of said series have been received, ordering said segments based on second data included in each packet to reconstruct said data that was divided into said series of one or more segments.
Claim 18
Independent Claim
118 words
A method for transferring data from a source node to a destination node over a network, the method comprising the computer-implemented steps of: receiving, at said destination node from said source node, a plurality of packets, wherein each packet of said plurality of packets includes a segment created by said source node dividing said data into a series of segment; determining based on first data included in each packet whether all segments of said series have been received at said destination node; and when all segments of said series have been received, ordering said segments based on second data included in each packet to reconstruct said data that was divided into said series of one or more segments.
Claim 19
Dependent Claim
89 words
The method of claim 16 , further comprising the steps of: initializing, at said destination node, local state information in response to said destination node receiving a first packet of said plurality of packets, wherein said destination node uses said local state information to track additional packets of said plurality of packets that are received, and wherein said destination node uses said local state information to order said segments; and discarding, at said destination node, said local state information after all packets of said plurality of packets are received.
Claim 20
Dependent Claim
33 words
The method of claim 17 , wherein said step of discarding said local state information is performed after a predetermined length of time after all packets of said plurality of packets are received.
Claim 21
Dependent Claim
44 words
The method of claim 17 , further comprising the computer-implemented step of: receiving a duplicate of a particular packet of said plurality of packets, wherein said particular packet has already been received at said destination node; and discarding said duplicate of said particular packet.
Claim 22
Dependent Claim
134 words
A computer-readable medium carrying one or more sequences of instructions for transferring data from a source node to a destination node over a network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: divide said data into a series of one or more segments; create a plurality of packets, wherein each packet of said plurality of packets includes: first data that allows said destination node to determine whether all segments of said series have been received at said destination node, and second data that allows said destination node to order said segments to reconstruct said data that was divided into said series of one or more segments; and send said plurality of packets from said source node to said destination node.
Claim 23
Dependent Claim
134 words
A computer-readable medium carrying one or more sequences of instructions for transferring data from a source node to a destination node over a network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: divide said data into a series of one or more segments; create a plurality of packets, wherein each packet of said plurality of packets includes: first data that allows said destination node to determine whether all segments of said series have been received at said destination node, and second data that allows said destination node to order said segments to reconstruct said data that was divided into said series of one or more segments; and send said plurality of packets from said source node to said destination node.
Claim 24
Dependent Claim
36 words
The computer-readable medium of claim 20 , wherein said first data includes third data that indicates whether each packet of said plurality of packets includes a first segment of said series of one or more segments.
Claim 25
Dependent Claim
40 words
The computer-readable medium of claim 21 , wherein said third data includes a first bit that is set by the source node to indicate that a particular packet includes said first segment of said series of one or more segments.
Claim 26
Dependent Claim
36 words
The computer-readable medium of claim 20 , wherein said first data includes third data that indicates whether each packet of said plurality of packets includes a last segment of said series of one or more segments.
Claim 27
Dependent Claim
41 words
The computer-readable medium of claim 23 , wherein said third data includes a second bit that is not set by the source node to indicate that a particular packet includes said last segment of said series of one or more segments.
Claim 28
Dependent Claim
33 words
The computer-readable medium of claim 20 , wherein said first data that indicates whether each packet of said plurality of packets includes an intermediate segment of said series of one or more segments.
Claim 29
Dependent Claim
52 words
The computer-readable medium of claim 25 , wherein said third data includes a first bit that is not set by the source node and a second bit that is set by the source node to indicate that a particular packet includes said intermediate segment of said series of one or more segments.
Claim 30
Dependent Claim
25 words
The computer-readable medium of claim 20 , wherein said first data includes third data that indicates whether said plurality of packets consists of one packet.
Claim 31
Dependent Claim
55 words
The computer-readable medium of claim 27 , wherein said third data includes a first bit that is set by the source node and a second bit that is not set by the source node to indicate that said series of one or more segments consists of one segment that is included in said one packet.
Claim 32
Dependent Claim
39 words
The computer-readable medium of claim 20 , wherein said second data includes a sequence number that indicates for each packet of said plurality of packets a position in said series for each segment that is included in each packet.
Claim 33
Dependent Claim
24 words
The computer-readable medium of claim 20 , wherein each packet of said plurality of packets further includes third data that identifies the source node.
Claim 34
Dependent Claim
27 words
The computer-readable medium of claim 20 , wherein each packet of said plurality of packets further includes third data that specifies an address of the destination node.
Claim 35
Dependent Claim
26 words
The computer-readable medium of claim 20 , wherein each packet of said plurality of packets further includes third data that specifies a size of each packet.
Claim 36
Dependent Claim
61 words
The computer-readable medium of claim 20 , further comprising instructions to: receive, at said source node from said destination node, an acknowledgement for each packet that is received by said destination node; and when said acknowledgement for a particular packet is not received within a predetermined length of time, send said particular packet from said source node to said destination node.
Claim 37
Dependent Claim
27 words
The computer-readable medium of claim 33 , wherein said predetermined length of time is adjusted based on how long after sending each packet said acknowledgement is received.
Claim 38
Dependent Claim
141 words
A computer-readable medium carrying one or more sequences of instructions for transferring data from a source node to a destination node over a network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: receive, at said destination node from said source node, a plurality of packets, wherein each packet of said plurality of packets includes a segment created by said source node dividing said data into a series of segments; determine based on first data included in each packet whether all segments of said series have been received at said destination node; and when all segments of said series have been received, order said segments based on second data included in each packet to reconstruct said data that was divided into said series of one or more segments.
Claim 39
Dependent Claim
141 words
A computer-readable medium carrying one or more sequences of instructions for transferring data from a source node to a destination node over a network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: receive, at said destination node from said source node, a plurality of packets, wherein each packet of said plurality of packets includes a segment created by said source node dividing said data into a series of segments; determine based on first data included in each packet whether all segments of said series have been received at said destination node; and when all segments of said series have been received, order said segments based on second data included in each packet to reconstruct said data that was divided into said series of one or more segments.
Claim 40
Dependent Claim
89 words
The computer-readable medium of claim 35 , further comprising instructions to: initialize, at said destination node, local state information in response to said destination node receiving a first packet of said plurality of packets, wherein said destination node uses said local state information to track additional packets of said plurality of packets that are received, and wherein said destination node uses said local state information to order said segments; and discard, at said destination node, said local state information after all packets of said plurality of packets are received.
Claim 41
Dependent Claim
34 words
The computer-readable medium of claim 36 , wherein said step of discarding said local state information is performed after a predetermined length of time after all packets of said plurality of packets are received.
Claim 42
Dependent Claim
43 words
The computer-readable medium of claim 36 , further comprising instructions to: receive a duplicate of a particular packet of said plurality of packets, wherein said particular packet has already been received at said destination node; and discard said duplicate of said particular packet.
References Cited (Backward Citations)
US4493021A
Cited
US4975952A
Cited
WO1988007293A1
Cited
US5050166A
Cited
US5235595A
Cited
US4954965A
Cited
US5220562A
Cited
US5377192A
Cited
US5151899A
Cited
US5572678A
Cited
US5251207A
Cited
US5260933A
Cited
US5379296A
Cited
US5386412A
Cited
US5444709A
Cited
US5491800A
Cited
US5852721A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-10-29 | 2005-04-30 | 2005-10-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-10-29 | 2009-04-30 | 2009-10-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-10-29 | 2013-04-30 | 2013-10-30 | $7700.00 | Window Closed / Lapsed |