Patent US5682384A successfully refreshed from Google Patents.
US5682384A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and methods achieving multiparty synchronization for real-time network application
Assignee: Individual
•
Filing: 1995-10-31
•
Granted: 1997-10-28
•
Expires: 2015-10-31
Abstract
Abstract In network applications that are distributed across more than two hosts in the network, a scheme capable of synchronizing and grouping packets into the so called fusion sets for playback is needed. Those packets arrive from different sources at a receiver, where they are "mixed" together for playback. The receiver can be one of the hosts/sources in the application, or a master host where packets from all the hosts arrive there first and subsequently are being forwarded back to all hosts. Basically, the apparatus and method operates as follows: the receiver accepts packets from other sources, and for each packet it computes its reference time (or expected arrival time). At the receiver, time is divided into reference intervals. Packets, one packet from each source, that their corresponding reference times are within the same reference interval at the receiver, they belong to the same fusion set for synchronization. In addition to reference times, the method/apparatus uses the so named zeta times which are constructed from the reference times by adding a constant time interval to the reference times of the same source, and this constant may or may not be the same for each source. The transmission of the packets is non-continuous periodic and the generation periods of the packets may be integer multiple to a fundamental period T. In addition, the use of feedback and of smaller reference intervals are shown to shorten the total delay time of the packets in the fusion set.
Inventors
- 👤 Panagiotis N. Zarros
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 12:33
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/062; H04J3/0632
Claims Analysis
Total Claims: 42
Claim 1
Independent Claim
165 words
A method for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the method comprising the steps of: transmitting said packets from each source to said receiver, and at least one of said sources transmits said packets non-continuously; estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta time is defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; dividing time at said receiver in reference intervals; and determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval.
Claim 2
Independent Claim
165 words
A method for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the method comprising the steps of: transmitting said packets from each source to said receiver, and at least one of said sources transmits said packets non-continuously; estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta time is defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; dividing time at said receiver in reference intervals; and determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval.
Claim 3
Dependent Claim
71 words
The method as recited in claim 1 further comprising the step of delaying said packets whose said zeta times belong to same said fusion set a minimum but large enough time to compensate for: variable transmission delays or jitter among said packets transmitted from same said source, and said packets belonging to same said fusion set to be synchronized among themselves according to requirements of a specific real time network application.
Claim 4
Dependent Claim
45 words
The method as recited in claim 1 further comprising the step of reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 5
Dependent Claim
47 words
The method as recited in claim 1 wherein said step of transmitting said packets from each source to said receiver further includes said sources transmitting said packets to said receiver periodically, said transmission periods are multiple integer of a fundamental period, said multiple integer includes integer one.
Claim 6
Dependent Claim
77 words
The method as recited in claim 1 further comprises the steps of: attaching a sequence number to said transmitting packet at said source; denoting each said reference interval at said receiver with a sequence number; and mapping said sequence numbers of said reference intervals with said sequence numbers of said transmitting packets, said zeta time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 7
Dependent Claim
47 words
The method as recited in claim 1 wherein said step of estimating said zeta time further comprises the step of estimating time delays from each of said sources to said receiver, said time delays are used to determine said times X i for each said source i.
Claim 8
Dependent Claim
34 words
The method as recited in claim 1 wherein said step of estimating said zeta times further comprising the step of estimating bounds of said jitter for said packets arriving from all of said sources.
Claim 9
Dependent Claim
44 words
The method as recited in claim 1 further comprising the step of estimating frequency offsets of clocks of said sources with respect to clock of said receiver, said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
Claim 10
Dependent Claim
52 words
The method as recited in claim 1 further comprising the step of estimating signs of said frequency offsets of said clocks of said sources with respect to said clock of said receiver, said signs of said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
Claim 11
Independent Claim
170 words
An apparatus for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the apparatus comprising: means for transmitting said packets from each source to said receiver, and at least one of said sources transmits said packets non-continuously; means for estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta times are defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X 1 is a real number which is constant for packets from same said source i; means for dividing time at said receiver in reference intervals; and means for determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval.
Claim 12
Independent Claim
170 words
An apparatus for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the apparatus comprising: means for transmitting said packets from each source to said receiver, and at least one of said sources transmits said packets non-continuously; means for estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta times are defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X 1 is a real number which is constant for packets from same said source i; means for dividing time at said receiver in reference intervals; and means for determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval.
Claim 13
Dependent Claim
70 words
The apparatus as recited in claim 10 further comprising means for delaying said packets whose said zeta times belong to same said fusion set a minimum but large enough time to compensate for: variable transmission delays or jitter among said packets transmitted from same said source, and said packets belonging to same said fusion set to be synchronized among themselves according to requirements of a specific real time network application.
Claim 14
Dependent Claim
44 words
The apparatus as recited in claim 10 further comprising means for reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 15
Dependent Claim
49 words
The apparatus as recited in claim 10 wherein said means of transmitting said packets from each source to said receiver further comprises means for said sources transmitting said packets to said receiver periodically, said transmission periods are multiple integer of a fundamental period, said multiple integer includes integer one.
Claim 16
Dependent Claim
80 words
The apparatus as recited in claim 10 further comprising: means for attaching a sequence number to said transmitting packet at said source; means for denoting each said reference interval at said receiver with a sequence number; and means for mapping said sequence numbers of said reference intervals with said sequence numbers of said transmitting packets, said zeta time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 17
Dependent Claim
46 words
The apparatus as recited in claim 10 wherein said means of estimating said zeta times further comprises means of estimating time delays from each of said sources to said receiver, said time delays are used to determine said times X i for each said source i.
Claim 18
Dependent Claim
33 words
The apparatus as recited in claim 10 wherein said means of estimating said zeta times further comprising means of estimating bounds of said jitter for said packets arriving from all of said sources.
Claim 19
Dependent Claim
43 words
The apparatus as recited in claim 10 further comprising means of estimating frequency offsets of clocks of said sources with respect to clock of said receiver, said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
Claim 20
Dependent Claim
51 words
The apparatus as recited in claim 10 further comprising means of estimating signs of said frequency offsets of said clocks of said sources with respect to said clock of said receiver, said signs of said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
Claim 21
Independent Claim
115 words
A method for transmitting packets from sender to receiver in a packet based computer network, the method comprising the steps of: transmitting said packets from said sender non-continuously; estimating reference times (expected arrival times t ref ,n) and maximum bound of network jitter of said packets at said receiver, wherein said estimated maximum bound of network jitter (Δ max ) is defined as the maximum difference of a packet arrival time (t n ) from its corresponding reference time; said packet is played back at said receiver a time interval after its corresponding said reference time, length of said time interval equals length of said estimated maximum bound of network jitter plus an error term.
Claim 22
Independent Claim
115 words
A method for transmitting packets from sender to receiver in a packet based computer network, the method comprising the steps of: transmitting said packets from said sender non-continuously; estimating reference times (expected arrival times t ref ,n) and maximum bound of network jitter of said packets at said receiver, wherein said estimated maximum bound of network jitter (Δ max ) is defined as the maximum difference of a packet arrival time (t n ) from its corresponding reference time; said packet is played back at said receiver a time interval after its corresponding said reference time, length of said time interval equals length of said estimated maximum bound of network jitter plus an error term.
Claim 23
Dependent Claim
83 words
The method as recited in claim 19 further comprising the steps of: said sender attaching a sequence number to said transmitting packets; dividing time at said receiver in reference intervals and denoting said reference intervals with a sequence number; mapping said sequence numbers of said transmitting packets with said sequence numbers of said reference intervals at said receiver, said reference time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 24
Dependent Claim
44 words
The method as recited in claim 19 further comprising the step of estimating frequency offset of clock of said sender with respect to clock of said receiver, said frequency offset is used to improve estimation of said reference times and shorten said error term.
Claim 25
Dependent Claim
52 words
The method as recited in claim 19 further comprising the step of estimating sign of said frequency offset of said clock of said sender with respect to said clock of said receiver, said sign of said frequency offset is used to improve estimation of said reference times and shorten said error term.
Claim 26
Independent Claim
116 words
An apparatus for transmitting packets from sender to receiver in a packet based computer network, the apparatus comprising: means for transmitting said packets from said sender non-continuously; means for estimating reference times (expected arrival times t ref ,n) and maximum bound of network jitter of said packets at said receiver, wherein said estimated maximum bound of network jitter (Δ max ) is defined as the maximum difference of a packet arrival time (t n ) from its corresponding reference time; means for playing back said packet at said receiver a time interval after its corresponding said reference time, length of said time interval equals length of said maximum bound of network jitter plus an error term.
Claim 27
Independent Claim
116 words
An apparatus for transmitting packets from sender to receiver in a packet based computer network, the apparatus comprising: means for transmitting said packets from said sender non-continuously; means for estimating reference times (expected arrival times t ref ,n) and maximum bound of network jitter of said packets at said receiver, wherein said estimated maximum bound of network jitter (Δ max ) is defined as the maximum difference of a packet arrival time (t n ) from its corresponding reference time; means for playing back said packet at said receiver a time interval after its corresponding said reference time, length of said time interval equals length of said maximum bound of network jitter plus an error term.
Claim 28
Dependent Claim
87 words
The apparatus as recited in claim 23 further comprising: means for attaching a sequence number to said transmitting packets at said sender; means for dividing time at said receiver in reference intervals and denoting said reference intervals with a sequence number; means for mapping said sequence numbers of said transmitting packets with said sequence numbers of said reference intervals at said receiver, said reference time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 29
Dependent Claim
43 words
The apparatus as recited in claim 23 further comprising means of estimating frequency offset of clock of said sender with respect to clock of said receiver, said frequency offset is used to improve estimation of said reference times and shorten said error term.
Claim 30
Dependent Claim
51 words
The apparatus as recited in claim 23 further comprising means of estimating sign of said frequency offset of said clock of said sender with respect to said clock of said receiver, said sign of said frequency offset is used to improve estimation of said reference times and shorten said error term.
Claim 31
Independent Claim
187 words
A method for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the method comprising the steps of: transmitting said packets from each source to said receiver; estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta time is defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; dividing time at said receiver in reference intervals; determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval; and reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 32
Independent Claim
187 words
A method for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the method comprising the steps of: transmitting said packets from each source to said receiver; estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta time is defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; dividing time at said receiver in reference intervals; determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval; and reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 33
Dependent Claim
71 words
The method as recited in claim 27 further comprising the step of delaying said packets whose said zeta times belong to same said fusion set a minimum but large enough time to compensate for: variable transmission delays or jitter among said packets transmitted from same said source, and said packets belonging to same said fusion set to be synchronized among themselves according to requirements of a specific real time network application.
Claim 34
Dependent Claim
77 words
The method as recited in claim 27 further comprises the steps of: attaching a sequence number to said transmitting packet at said source; denoting each said reference interval at said receiver with a sequence number; and mapping said sequence numbers of said reference intervals with said sequence numbers of said transmitting packets, said zeta time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 35
Dependent Claim
47 words
The method as recited in claim 27 wherein said step of estimating said zeta time further comprises the step of estimating time delays from each of said sources to said receiver, said time delays are used to determine said times X i for each said source i.
Claim 36
Dependent Claim
44 words
The method as recited in claim 27 further comprising the step of estimating frequency offsets of clocks of said sources with respect to clock of said receiver, said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
Claim 37
Independent Claim
194 words
An apparatus for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the apparatus comprising: means for transmitting said packets from each source to said receiver; means for estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta times are defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; means for dividing time at said receiver in reference intervals; means for determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval; and means for reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 38
Independent Claim
194 words
An apparatus for identifying packets to belong in a fusion set, said packets arriving at a receiver transmitted from different sources in a packet based computer network, the apparatus comprising: means for transmitting said packets from each source to said receiver; means for estimating zeta times of arriving said packets from each source at said receiver, wherein said zeta times are defined as: t z ,n i =t ref ,n i +X i , wherein t z ,n i is said n'th zeta time from source i, t ref ,n i is n'th expected arrival time of packet from said source i (reference time), and time X i is a real number which is constant for packets from same said source i; means for dividing time at said receiver in reference intervals; means for determining said fusion set of said zeta times, said zeta times belonging to same said fusion set also belong to same said reference interval; and means for reducing said reference interval by sending a feedback packet to each one of said sources, said feedback packet containing information related to position of said zeta time within its corresponding said reference interval.
Claim 39
Dependent Claim
70 words
The apparatus as recited in claim 32 further comprising means for delaying said packets whose said zeta times belong to same said fusion set a minimum but large enough time to compensate for: variable transmission delays or jitter among said packets transmitted from same said source, and said packets belonging to same said fusion set to be synchronized among themselves according to requirements of a specific real time network application.
Claim 40
Dependent Claim
87 words
The apparatus as recited in claim 32 further comprising: means for attaching a sequence number to said transmitting packets at said sender; means for dividing time at said receiver in reference intervals and denoting said reference intervals with a sequence number; means for mapping said sequence numbers of said transmitting packets with said sequence numbers of said reference intervals at said receiver, said reference time of said packet whose said sequence number mapped with said sequence number of said reference interval is within said mapped reference interval.
Claim 41
Dependent Claim
46 words
The apparatus as recited in claim 32 wherein said means of estimating said zeta times further comprises means of estimating time delays from each of said sources to said receiver, said time delays are used to determine said times X i for each said source i.
Claim 42
Dependent Claim
43 words
The apparatus as recited in claim 32 further comprising means of estimating frequency offsets of clocks of said sources with respect to clock of said receiver, said frequency offsets are used to improve estimation of said zeta times and shorten said reference intervals.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-10-27 | 2001-04-28 | 2001-10-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-10-27 | 2005-04-28 | 2005-10-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-10-27 | 2009-04-28 | 2009-10-28 | $7700.00 | Window Closed / Lapsed |