Network Synchronization in the Presence of Random Routing Delays

碩士 === 國立交通大學 === 電信工程研究所 === 104 === The packet delay variation (PDV) is usually a major error source in a packet-based synchronization system. The PDV at the queue buffer in each switching hub along the master-to-slave route presents a considerable uncertainty in the clock recovery system. A popul...

Full description

Bibliographic Details
Main Authors: Wu, I-Min, 吳怡旻
Other Authors: Su, Yu-Ted
Format: Others
Language:en_US
Published: 2016
Online Access:http://ndltd.ncl.edu.tw/handle/04168272468125847841
id ndltd-TW-104NCTU5435134
record_format oai_dc
spelling ndltd-TW-104NCTU54351342017-09-06T04:22:26Z http://ndltd.ncl.edu.tw/handle/04168272468125847841 Network Synchronization in the Presence of Random Routing Delays 隨機路徑延遲下的網路同步 Wu, I-Min 吳怡旻 碩士 國立交通大學 電信工程研究所 104 The packet delay variation (PDV) is usually a major error source in a packet-based synchronization system. The PDV at the queue buffer in each switching hub along the master-to-slave route presents a considerable uncertainty in the clock recovery system. A popular method to mitigate PDVs is to apply the minimum filter that uses only the packet with the least delay, i.e., we select, among the arriving packets, the packet with the minimum master and slave timestamp difference to compute the clock offset and discards all other packets. However, PDV does not always follow a distribution that is amenable to (sample-)minimum filtering. It has been shown that for congested networks, the sample-mean filter or the sample-maximum filter may yield better performance. We consider two general parametric packet delay (PD) models. The first model assumes that the PD follows an Erlang distribution with unknown order parameter and traffic rate parameter, and the second model describes the PD by a mixed-Erlang distribution. For the first traffic model, we derive the generalized maximum likelihood estimator (GMLE) to jointly estimate the clock offset and model parameters. To estimate the clock offset with the second model, we invoke the concept of moment matching to estimate the mixing coefficients first and then find the solution with the least squared third moment error. This approach may fail to give an accurate estimate when a subset of the mixing coefficients become very small. To deal with this shortcoming, we add a model selection step by classing the mixing parameter combinations into seven cases (models). The model selection criterion is based on the Kullback-Leibler divergence (distance) between the sampled delay distribution and the quantized model distribution. Simulated numerical behaviors of the proposed synchronizers are presented. We find that, except for the special case when traffic rate parameter of the first model is very small, our estimators are unbiased and offer much improved mean performance than that of the minimum filter. Su, Yu-Ted 蘇育德 2016 學位論文 ; thesis 57 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立交通大學 === 電信工程研究所 === 104 === The packet delay variation (PDV) is usually a major error source in a packet-based synchronization system. The PDV at the queue buffer in each switching hub along the master-to-slave route presents a considerable uncertainty in the clock recovery system. A popular method to mitigate PDVs is to apply the minimum filter that uses only the packet with the least delay, i.e., we select, among the arriving packets, the packet with the minimum master and slave timestamp difference to compute the clock offset and discards all other packets. However, PDV does not always follow a distribution that is amenable to (sample-)minimum filtering. It has been shown that for congested networks, the sample-mean filter or the sample-maximum filter may yield better performance. We consider two general parametric packet delay (PD) models. The first model assumes that the PD follows an Erlang distribution with unknown order parameter and traffic rate parameter, and the second model describes the PD by a mixed-Erlang distribution. For the first traffic model, we derive the generalized maximum likelihood estimator (GMLE) to jointly estimate the clock offset and model parameters. To estimate the clock offset with the second model, we invoke the concept of moment matching to estimate the mixing coefficients first and then find the solution with the least squared third moment error. This approach may fail to give an accurate estimate when a subset of the mixing coefficients become very small. To deal with this shortcoming, we add a model selection step by classing the mixing parameter combinations into seven cases (models). The model selection criterion is based on the Kullback-Leibler divergence (distance) between the sampled delay distribution and the quantized model distribution. Simulated numerical behaviors of the proposed synchronizers are presented. We find that, except for the special case when traffic rate parameter of the first model is very small, our estimators are unbiased and offer much improved mean performance than that of the minimum filter.
author2 Su, Yu-Ted
author_facet Su, Yu-Ted
Wu, I-Min
吳怡旻
author Wu, I-Min
吳怡旻
spellingShingle Wu, I-Min
吳怡旻
Network Synchronization in the Presence of Random Routing Delays
author_sort Wu, I-Min
title Network Synchronization in the Presence of Random Routing Delays
title_short Network Synchronization in the Presence of Random Routing Delays
title_full Network Synchronization in the Presence of Random Routing Delays
title_fullStr Network Synchronization in the Presence of Random Routing Delays
title_full_unstemmed Network Synchronization in the Presence of Random Routing Delays
title_sort network synchronization in the presence of random routing delays
publishDate 2016
url http://ndltd.ncl.edu.tw/handle/04168272468125847841
work_keys_str_mv AT wuimin networksynchronizationinthepresenceofrandomroutingdelays
AT wúyímín networksynchronizationinthepresenceofrandomroutingdelays
AT wuimin suíjīlùjìngyánchíxiàdewǎnglùtóngbù
AT wúyímín suíjīlùjìngyánchíxiàdewǎnglùtóngbù
_version_ 1718527273160671232