发明名称 HIERARCHICAL PRIORITIZED ROUND ROBIN (HPRR) SCHEDULING
摘要 The HPRR method uses token bucket rate classifiers to mark each individual packet as conforming or not conforming to a traffic specification for the flow [PER-FLOW QUEUES 1, 2, 3, 4]. Flows are considered to be in a single service class [CLASS A, B, D]. One such class is distinguished as a default "best effort" service class [D]. Each service class is assigned a weight corresponding to its fraction of bandwidth granted to the class when all classes are active. The HPRR method allows a packet from a flow to be forwarded in one of two ways, either as part of its class's allocated bandwidth or as part of the best effort bandwidth. By always providing two paths for a flow to send its packets, a flow is always given its fair share of two different classes: its primary or configured class and the best effort class.
申请公布号 WO0124428(B1) 申请公布日期 2001.05.17
申请号 WO2000US26312 申请日期 2000.09.25
申请人 MOTOROLA INC. 发明人 PATRICK, MICHAEL
分类号 H04L12/54;H04L12/813;H04L12/819;H04L12/833;H04L12/851;H04L12/863;H04L12/873;H04L12/877;(IPC1-7):H04J3/22;H04L12/56 主分类号 H04L12/54
代理机构 代理人
主权项
地址