信元丢失率的英文

• clr cell loss rate
• maximum cell loss ratio

• "信"英文翻译    letter; mail
• "元"英文翻译    first; primary
• "丢失"英文翻译    lose
• "率"英文翻译    rate; ratio; proportion
• "平均信元丢失率" 英文翻译 :    mclr mean cell loss rate
• "最大信元丢失率" 英文翻译 :    mclr maximum cell loss ratio
• "单元丢失率" 英文翻译 :    clr cell loss rate
• "信元丢失" 英文翻译 :    loc loss of cell
• "信元丢失比" 英文翻译 :    clr cell loss ratio
• "信元丢失比率" 英文翻译 :    clr cell lo ratio; clr cell loss ratio
• "信元丢失概率" 英文翻译 :    clcell loss probability
• "信元丢失优先级" 英文翻译 :    cell loss priority (clp)
• "信元丢失优先权" 英文翻译 :    clcell loss priority; clp:cell loss priority
• "信元丢失优先域" 英文翻译 :    cell-loss priority field
• "信元丢失优先级指示" 英文翻译 :    clpi cell loss priority indication
• "信元丢弃率" 英文翻译 :    cell discard rate
• "码元丢失法" 英文翻译 :    bit dropping technique
• "信元损失率" 英文翻译 :    cell loss rate clr
• "分组丢失率" 英文翻译 :    plr packet loss rate
• "细胞丢失率" 英文翻译 :    cell loss rate
• "信息丢失率" 英文翻译 :    rate of information loss
• "单元丢失概率" 英文翻译 :    cl cell loss probability; clcell loss probability
• "码元丢失技术" 英文翻译 :    bit dropping technique
• "信元的丢失" 英文翻译 :    loc loss of oam cell oam
• "选择性信元丢弃" 英文翻译 :    scd selective cell discard

• Cell loss ratio , clr
  信元丢失率
• Finally , simulation shows the performance of the mean delay , the mean buffer , and frame utilization compared with the wrr algorithm
  最后,论文将仿真结果与wrr调度算法在平均时延、地面缓冲区大小、信元丢失率、 tdma帧利用率等方面进行了比较。
• The queueing problems of cbr traffic in atm networks are analyzed . simple closed expressions of the upper bound on the cell loss ratio ( clr ) and mean cell delay in a finite buffer system are derived
  分析了atm网络cbk业务排队性能，给出了一种简单的计算cbr业务信元丢失率上界和信元平均时延的解析表达式。
• It is expected that an end - system that adapts its traffic in accordance with the feedback will experience a low cell loss ratio and obtain a fair share of the available bandwidth according to a network specific allocation policy
  我们希望有一种与反馈相一致并适应传输业务的端系统能够承受低信元丢失率，并且根据网络特殊的分配原则公平的分享可用带宽。
• Consequently a new cac scheme for cbr traffic , lv ~ ? { ~ l ~ : atm ~ iija ~ jlijf ~ linear approximation cac scheme based on the lowest rate replacing , is presented . instead of using the tail of the infinite queue length distribution as an estimate to clr , this cac scheme obtains clr by the upper bound on it , and qos can be well guaranteed in our scheme
  在此基础上，提出了一种新的cbr业务连接允许控制机制；基于最小速率替换的线性近似cac机制，该机制能够提供服务质量保证，并且采用了有限容量缓冲区情况下cbr业务信元丢失率的上界，而不是将clr用无限容量缓冲区排队系统的队长尾部分布来近似。
• In this paper , we study the performance of input - buffered atm switching with window - access scheme and output - grouping architecture . the close - form formulae of maximum switch throughput , mean cell delay and cell loss probability are obtained by probability generating function approach . the accuracy of theoretical analysis is verified by computer simulations and results show that the maximum switching throughput will reach 99 % under random uniform traffic when the window size and the group size are 4 and 16 respectively
  本文提出了具有组合的窗口接入和线群输出结构的输入缓冲atm交换网络并对其性能进行了研究.通过概率生成函数方法得到了计算该交换网络最大吞吐率，平均信元时延和信元丢失率的封闭表达式，并通过计算机模拟实验验证了理论分析的精确性.研究结果表明，在随机均匀业务下，当窗口尺寸和输出群尺寸分别为4和16时，最大吞吐率可达到99