1) LDT
最小时延树
1.
It begins with the construction of least cost tree(LCT) and least delay tree(LDT), then an iterative algorithm is proposed to construct all the delay-constrained candidate trees, the one with least cos.
以建立最小时延树和最小开销树作为初始条件,运用循环迭代算法,求解满足时延约束的最小开销树。
2) minimum delay
最小时延
1.
By means of queuing analysis and network simulation,the measurability of end-to-end minimum packet delay has been quantificationally analyzed,and it was found that 50 packets was more than enough to measure the minimum delay of a 10 hops long path with very great probability.
以排队分析和网络仿真为手段定量分析了在不同路径长度和流量负载条件下的最小时延可测性,发现约50个探测包即可有很大概率测量到有10跳长路径的最小时延。
3) Minimum group delay
最小群时延
4) minimum delay spanning tree
最小延迟生成树
5) minimum expected delay(MED)
最小预期时延
6) Minimal delays
最小解码时延
补充资料：怀卢延让（时延让新及第）
【诗文】：
冥搜忍饥冻，嗟尔不能休。几叹不得力，到头还白头。
姓名归紫府，妻子在沧洲。又是蝉声也，如今何处游。
【注释】：
【出处】：
全唐诗：卷834-22
冥搜忍饥冻，嗟尔不能休。几叹不得力，到头还白头。
姓名归紫府，妻子在沧洲。又是蝉声也，如今何处游。
【注释】：
【出处】：
全唐诗：卷834-22
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条