高级检索

    IPRPS——一种简单有效的设计加权公平排队算法的模型

    IPRPS-A SIMPLE AND EFFICIENT METHODOLOGY FOR THE DESIGN OF THE WEIGHTED FAIR QUEUEING ALGORITHM

    • 摘要: PRPS是一种设计加权公平排队算法的数据包模型 ,Stiliadis指出 PRPS具有与设计加权公平排队算法的理想模型—— RPS相近的延迟和公平性特性 .但实际上 ,在最坏情况下 ,PRPS与 RPS会有很大的差距 .首先指出这种差距的存在 ,同时通过调节数据包进入 PRPS的时间 ,提出了一种简单有效地设计加权公平排队算法的模型—— IPRPS,并证明了 IPRPS具有与 RPS几乎相同的延迟和公平性特性

       

      Abstract: PRPS is a methodology for the design of the weighted fair queueing (WFQ) algorithm based on packets. PRPS can provide as similar end to end delay bound and fairness as RPS-an ideal methodology for designing the weighted fair queueing algorithm. However, there are large discrepancies between the services provided by the packet RPS (PRPS) system and the fluid RPS system in bad circumstances. The discrepancies are listed and an improved PRPS (IPRPS) is proposed by adjusting the time of every input packet. IPRPS is a simple and efficient methodology for the design of the WFQ algorithm. The services provided by IPRPS are almost identical to that of RPS,differing by no more than one maximum size packet.

       

    /

    返回文章
    返回