US5247464A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Node location by differential time measurements
Assignee: Enterasys Networks Inc
•
Filing: 1989-05-25
•
Granted: 1993-09-21
•
Expires: 2009-05-25
Abstract
Abstract A system for determining the physical location of nodes on a network. The system includes two stations each of which has a clock. Each station uses its clock to determine the arrival times at the station of a packet transmitted over the network from a first node to a second node and of a reply packet sent by the second node to the first node. The arrival times of the packets and the corresponding reply packets are then used to calculate the distance along the network which separates the first and second node. Measurement of packet arrival times for all of the nodes yields the position of all of the nodes on the network.
Inventors
- 👤 Robert A. Curtis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:55
CPC Classifications
H; H04; H04L; H04L43/00
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
225 words
A method for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the method comprising: a. receiving a first packet and a second packet at a first station located at a first location on said segment, the first packet being sent over said network segment by the first node, and the second packet being sent over said network segment by the second node; b. recording a first arrival time that is the time at which the first packet arrives at the first station; c. recording a second arrival time that is the time at which the second packet arrives at the first station; d. receiving the first packet and the second packet at a second station located at a second location of said segment; e. recording a third arrival time that is the time at which the first packet arrives at the second station; f. recording a fourth arrival time that is the time at which the second packet arrives at the second station; and g. computing a distance along said network segment between the first node and second node based solely upon the first, second, third and fourth arrival times and a factor which is independent of packet arrival and transmission times.
Claim 2
Independent Claim
225 words
A method for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the method comprising: a. receiving a first packet and a second packet at a first station located at a first location on said segment, the first packet being sent over said network segment by the first node, and the second packet being sent over said network segment by the second node; b. recording a first arrival time that is the time at which the first packet arrives at the first station; c. recording a second arrival time that is the time at which the second packet arrives at the first station; d. receiving the first packet and the second packet at a second station located at a second location of said segment; e. recording a third arrival time that is the time at which the first packet arrives at the second station; f. recording a fourth arrival time that is the time at which the second packet arrives at the second station; and g. computing a distance along said network segment between the first node and second node based solely upon the first, second, third and fourth arrival times and a factor which is independent of packet arrival and transmission times.
Claim 3
Dependent Claim
65 words
The method of claim 1 wherein the step of computing the distance is performed by computing the following equation: [D=A*[(T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)]] D=A*((T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)) where A is said factor and where D is the distance, T 21 is the second arrival time, T 11 is the first arrival time, T 22 is the fourth arrival time, and T 12 is the third arrival time.
Claim 4
Dependent Claim
32 words
The method of claim 2 wherein said first and second packets propagate over said network segment at a measurable speed and A is equal to about one half of said measurable speed.
Claim 5
Independent Claim
253 words
An apparatus for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the apparatus comprising: a. a first station connected to said network segment at a first location, the first station for receiving packets at the first location, the first station including a first means for recording a first arrival time that is the time at which a first packet arrives at the first station and a second arrival time that is the time at which a second packet arrives at the first station, the first packet being sent by the first node over said network segment, and the second packet being sent by the second node over said network segment; b. a second station connected to said network segment at a second location, the second station for receiving packets at the second location, the second station including a second means for recording a third arrival time that is the time at which the first packet arrives at the second station and a fourth arrival time that is the time at which the second packet arrives at the second station; and c. a computational element in communication with said first and second stations for computing a distance along said network segment between the first node and second node based solely upon the first, second, third and fourth arrival times and a factor which is independent of packet arrival and transmission times.
Claim 6
Independent Claim
253 words
An apparatus for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the apparatus comprising: a. a first station connected to said network segment at a first location, the first station for receiving packets at the first location, the first station including a first means for recording a first arrival time that is the time at which a first packet arrives at the first station and a second arrival time that is the time at which a second packet arrives at the first station, the first packet being sent by the first node over said network segment, and the second packet being sent by the second node over said network segment; b. a second station connected to said network segment at a second location, the second station for receiving packets at the second location, the second station including a second means for recording a third arrival time that is the time at which the first packet arrives at the second station and a fourth arrival time that is the time at which the second packet arrives at the second station; and c. a computational element in communication with said first and second stations for computing a distance along said network segment between the first node and second node based solely upon the first, second, third and fourth arrival times and a factor which is independent of packet arrival and transmission times.
Claim 7
Dependent Claim
34 words
The apparatus of claim 4 wherein the first node and the second node are coupled to the network segment at locations along said network segment which are situated between the first and second locations.
Claim 8
Dependent Claim
63 words
The apparatus of claim 4 wherein the computational element computes the distance based upon the following equation: [D=A*[(T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)]] D=A*((T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)) where A is said factor and where D is the distance, T 21 is the second arrival time, T 11 is the first arrival time, T 22 is the fourth arrival time, and T 12 is the third arrival time.
Claim 9
Dependent Claim
32 words
The apparatus of claim 6 wherein said first and second packets propagate over said network segment at a measurable speed and A is equal to about one half of said measurable speed.
Claim 10
Dependent Claim
83 words
The apparatus of claim 4 wherein the first recording means comprises: a first detector for detecting the arrivals at the first station of the first and second packets; a first timing circuit electrically coupled to said first detector for determining the first and second arrival times based upon the detected arrivals at the first station of the first and second packets, respectively; and a first memory electrically coupled to said first timing circuit for receiving and storing the first and second arrival times.
Claim 11
Dependent Claim
34 words
The apparatus of claim 8 wherein the first and second packets each includes a preamble and wherein the first detector detects the arrivals of the first and second packets by detecting their respective preambles.
Claim 12
Dependent Claim
86 words
The apparatus of claim 8 wherein the second recording means comprises: a. a second detector for detecting the arrivals at the second station of the first and second packets; b. a second timing circuit electrically coupled to said second detector for determining the third and fourth arrival times based upon the detected arrivals at the second station of the first and second packets, respectively; and c. a second memory electrically coupled to said second timing circuit for receiving and storing the third and fourth arrival times.
Claim 13
Dependent Claim
16 words
The apparatus of claim 10 wherein the first and second timing circuits need not be synchronized.
Claim 14
Dependent Claim
88 words
The apparatus of claim 10, wherein each of the plurality of nodes has a corresponding address and wherein the first station further comprises first recognizer logic electrically coupled to the first detector and the first memory for determining the addresses of the first and second nodes which respectively sent the first and second packets by extracting information contained in the first and second packets, the address determined by the first recognizer logic being stored in the first memory in association with the corresponding first and second arrival times.
Claim 15
Dependent Claim
76 words
The apparatus of claim 12, wherein the second station further comprises second recognizer logic electrically coupled to the second detector and the second memory for determining the addresses of the first and second nodes which respectively sent the first and second packets by extracting information contained in the first and second packets, the addresses determined by the second recognizer logic being stored in the second memory in association with the corresponding third and fourth arrival times.
Claim 16
Independent Claim
436 words
An apparatus for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the apparatus comprising; a. a first station connected to said network segment at a first location, the first station for receiving packets at the first location, the first station comprising: i. a first detector for detecting the arrivals at the first station of a first packet and a second packet, the first packet being sent over said network segment by the first node, and the second packet being sent over said network segment by the second node; ii. a first timing circuit electrically coupled to said first detector for determining a first arrival time and a second arrival time based upon the detected arrivals at the first station of the first and second packets, respectively, the first arrival time being the time at which the first packet arrives at the first station and the second arrival time being the time at which the second packet arrives at the first station; and iii. a first memory electrically coupled to said first timing circuit for receiving and storing the first and second arrival times; b. a second station connected to said network segment at a second location, the second station for receiving packets at the second location, the second station comprising: i. a second detector for detecting the arrivals at the second station of the first packet and the second packet; ii. a second timing circuit electrically coupled to said second detector for determining a third arrival time and a fourth arrival time based upon the detected arrivals at the second station of the first and second packets, respectively, the third arrival time being the time at which the first packet arrives at the second station and the fourth arrival time being the time at which the second packet arrives at the second station; and ii. a second memory electrically coupled to said second timing circuit for receiving and storing the third and fourth arrival times; and c. a computation element in communication with said first and second station for computing a distance along said network segment between the first node and second node based upon the following equation: [D=A*[(T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)]] D=A*((T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)) where A is a factor which is independent of packet arrival and transmission times and where D is the distance, T 21 is the second arrival time, T 11 is the first arrival time, T 22 is the fourth arrival time, and T 12 is the third arrival time.
Claim 17
Independent Claim
436 words
An apparatus for determining locations of nodes along a network segment, said segment having a plurality of nodes coupled thereto, said plurality of nodes having at least a first node and a second node, the apparatus comprising; a. a first station connected to said network segment at a first location, the first station for receiving packets at the first location, the first station comprising: i. a first detector for detecting the arrivals at the first station of a first packet and a second packet, the first packet being sent over said network segment by the first node, and the second packet being sent over said network segment by the second node; ii. a first timing circuit electrically coupled to said first detector for determining a first arrival time and a second arrival time based upon the detected arrivals at the first station of the first and second packets, respectively, the first arrival time being the time at which the first packet arrives at the first station and the second arrival time being the time at which the second packet arrives at the first station; and iii. a first memory electrically coupled to said first timing circuit for receiving and storing the first and second arrival times; b. a second station connected to said network segment at a second location, the second station for receiving packets at the second location, the second station comprising: i. a second detector for detecting the arrivals at the second station of the first packet and the second packet; ii. a second timing circuit electrically coupled to said second detector for determining a third arrival time and a fourth arrival time based upon the detected arrivals at the second station of the first and second packets, respectively, the third arrival time being the time at which the first packet arrives at the second station and the fourth arrival time being the time at which the second packet arrives at the second station; and ii. a second memory electrically coupled to said second timing circuit for receiving and storing the third and fourth arrival times; and c. a computation element in communication with said first and second station for computing a distance along said network segment between the first node and second node based upon the following equation: [D=A*[(T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)]] D=A*((T.sub.21 -T.sub.11)-(T.sub.22 -T.sub.12)) where A is a factor which is independent of packet arrival and transmission times and where D is the distance, T 21 is the second arrival time, T 11 is the first arrival time, T 22 is the fourth arrival time, and T 12 is the third arrival time.
References Cited (Backward Citations)
US4813012A
Cited
US4890278A
Cited
US4896315A
Cited
US4916444A
Cited
US4939718A
Cited
US4845735A
Cited
US4930093A
Cited
US4901004A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-09-20 | 1997-03-22 | 1997-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-09-20 | 2001-03-22 | 2001-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-09-20 | 2005-03-22 | 2005-09-21 | $7700.00 | Window Closed / Lapsed |