Method of detecting drift between two clocks

• US 20030179780A1
• Filed: 03/20/2002
• Published: 09/25/2003
• Est. Priority Date: 03/20/2002
• Status: Abandoned Application

• Current Assignee: Zarlink Semiconductor Inc. (Microchip Technology Incorporated)
• Original Assignee: Zarlink Semiconductor Inc. (Microchip Technology Incorporated)
• Inventors: Walker, Anthony, Barrack, Craig
• Application Number:
  US10/103,299
• Publication Number:
  US 20030179780A1
• Time in Patent Office: Days
• US Class Current: 370/508
• CPC Class Codes: H04J 3/0664 unidirectional timestamps

Abstract

A method of and apparatus for detecting drift between two clocks is presented. The apparatus comprises a hardware implementation of a clock drift evaluator. The evaluator monitors received packets associated with a data stream, and extracts a time stamp generated by a source clock from each packet. A difference d between the extracted time stamp and the local time is compared against a d_ref value to determine whether the packet was received early or late. On a prescribed schedule, the degree of late and early receipt of packets is compared against a tolerance level to determine whether a relative drift exists between the pacing of the source clock and the pacing of the local clock. The detection of drift between the two clocks provides support for service level guarantees in provisioning data streaming services in packet-switched environments.

Claims

1. A clock drift evaluator comprising:

a. a time stamp extractor for extracting time stamp values from each received data packet of a data stream, the time stamp values being generated by a source clock;

b. an arithmetic unit providing a time difference value between the time stamp value extracted from each received data packet and a current local time value derived from a local clock;

c. comparison means comparing the time difference value against a time reference value to determine whether each received data packet is one of;

an early received packet, an on-time received packet, and a late received packet;

d. means for providing an evaluation of clock drift based on indications of an extent of early and late packet arrivals.

2. A clock drift evaluator as claimed in claim 1, wherein the evaluator further comprises:

a. an epoch counter advanced with time, the roll over event of which marks an evaluation epoch;

b. a counter tallying a total number of received packets during the evaluation epoch; and

c. means for providing an adjustment threshold normalized to the total number of received packets during the evaluation epoch.

3. A clock drift evaluator as claimed in claim 2, wherein the means for providing the adjustment threshold further comprises:

a lookup table having a plurality of adjustment threshold entries, each adjustment threshold entry corresponding to a range of total number of received packets during the evaluation epoch.

4. A clock drift evaluator as claimed in claim 3, wherein the lookup table further comprises paired range entries denoting each one of the ranges corresponding to each one of the plurality of adjustment threshold entries.

5. A clock drift evaluator as claimed in claim 4, wherein the lookup table further comprises a comparator for each one of the paired range entries, the comparator comparing the total number of received packets during the evaluation epoch with the range entry to determine whether the total number of received packets exceeds the value specified by the range entry.

6. A clock drift evaluator as claimed in claim 5, wherein the lookup table further comprises an AND gate for each one of the pair of range entries, the AND gate receiving as a first input the output of the comparator corresponding to one of the paired range entries and as a second input the negated output of the comparator corresponding to the other one of the paired range entries, to output a logic high value when the total number of received packets during the epoch is within the denoted range, wherein the output of the AND gate is subsequently used to output the corresponding adjustment threshold.

7. A clock drift evaluator as claimed in claim 3, wherein the lookup table further comprises a range entry denoting each one of the ranges, each range entry holding a specification thereof specifying most significant digits only.

8. A clock drift evaluator as claimed in claim 7, wherein the lookup table further comprises a comparator for each one of the range entries, the comparator comparing the total number of received packets during the evaluation epoch with the range entry to determine whether the total number of received packets equals the value specified by the range entry, wherein the output of the comparator is subsequently used to output the corresponding adjustment threshold.

9. A clock drift evaluator as claimed in claim 2, wherein the mans for providing the evaluation of clock drift further comprises:

a. a late received packet counter for counting instances of late packet arrivals to provide the indication of the extent of late packet arrivals;

b. an early received packet counter for counting instances of early packet arrivals to provide the indication of the extent of early packet arrivals; and

c. a pair of drift evaluation comparators, each one of the drift evaluation comparators, triggered by the roll over event, comparing the indication of the extent of late packet arrivals and the extent of early packet arrivals against the normalized adjustment threshold.

10. A clock drift evaluator as claimed in claim 1, wherein the clock drift evaluator further comprises means for generating the reference time value.

11. A method of detecting clock drift between two clocks comprising the steps of:

a. extracting a time stamp value generated by a source clock from each received packet of a monitored data stream downstream from the source clock;

b. deriving a time difference value between the stamp value and a current local time value provided by a local clock;

c. determining whether each received data packet is one of;

an early received packet, an on-time received packet, and a late received packet;

d. determining whether clock drift exists between the source clock and the local clock by comparing degrees of late and early packet arrivals against an adjustment threshold level.

12. A method as claimed in claim 11, wherein determining whether clock drift exists between the source clock and the local clock, the method further comprises a step of:

comparing the degree of late and early received packets against a normalized adjustment threshold level.

13. A method as claimed in claim 11, wherein determining whether clock drift exists between the source clock and the local clock, the method further comprises a step of:

determining, on a prescribed schedule, whether clock drift exists between the source clock and the local clock.

14. A method as claimed in claim 13, wherein the prescribed schedule comprises of time periods and in comparing the degrees of late and early packet arrivals against the adjustment threshold, the method further comprises a prior step of:

providing the adjustment threshold normalized to a total number of data packets received during a time period.

15. A method as claimed in claim 11, wherein determining whether the received packet is one of:

an early received packet, an on-time received packet, and late received packet, the method further comprises a step of;

comparing the time difference value against a reference time value.

16. A method as claimed in claim 11, wherein determining whether the received packet is one of:

an early received packet, an on-time received packet, and late received packet, the method further comprises steps of;

a. tallying a number of early packet arrivals to specify the degree of early packet arrivals; and

b. tallying a number of late packet arrivals to specify the degree of late packet arrivals.

17. A method as claimed in claim 15, wherein the method further comprises step of:

generating the d_ref value.

18. A method as claimed in claim 17, wherein generating the reference time value, the method further comprises a step of:

averaging a plurality of time difference values.

19. A method as claimed in claim 18, wherein averaging a plurality of time difference values, the method further comprises a step of:

performing bit operations in averaging the plurality of time difference values.

20. A method as claimed in claim 19, wherein performing bit operations in averaging the plurality of time difference values, the method further comprises steps of:

a. accumulating 2{circumflex over ( 

)}n (2ⁿ) time difference values into a register holding a binary representation thereof; and

b. shifting the binary representation n times to discard least significant digits therefrom.

21. A method as claimed in claim 17, wherein generating the reference time value, the method further comprises a step of:

averaging a plurality of half ping times.

22. A method as claimed in claim 21, wherein averaging a plurality of half ping times, the method further comprises a step of:

performing bit operations in averaging the plurality of half ping times.

23. A method as claimed in claim 22, wherein performing bit operations in averaging the plurality of half ping times, the method further comprises steps of:

a. accumulating a number 2{circumflex over ( 

)}n (2ⁿ) of ping times into a register holding a binary representation thereof; and

b. shifting the binary representation n+1 times to discard least significant digits therefrom.