会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method for Organizing Packets Belonging to Streams, and Associated Equipment
    • 组织流媒体和相关设备的方法
    • US20100278053A1
    • 2010-11-04
    • US11919752
    • 2006-04-20
    • James RobertsAbdesselem KortebiLuca Muscariello
    • James RobertsAbdesselem KortebiLuca Muscariello
    • H04L12/26
    • H04L47/52H04L47/10H04L47/17H04L47/2441H04L47/50H04L47/623Y10T477/755
    • The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.
    • 当所述流(F)在活动流的列表上时,在将所述分组引入公平共享调度机制(6)中时,本发明的方法在于确定属于每个新的输入分组(P)的流(F) 当在活动流列表中不存在所述流(F)时,在获得对参考时间段内的所述流量的输入数据项数量(I.Bytes)的估计时,将所述估计与最大值进行比较 (MaxBytes),其中根据公平共享数据速率确定参考时间段或最大值,在将所述流添加到活动流列表中并将分组(P)引入公平共享调度机制(6)中时, 如果所述估计超过最大值,并且在替代情况下将分组(P)引入优先级队列(5)的末尾。
    • 2. 发明授权
    • Method for organizing packets belonging to streams, and associated equipment
    • 用于组织属于流的数据包和相关设备的方法
    • US07933204B2
    • 2011-04-26
    • US11919752
    • 2006-04-20
    • James RobertsAbdesselem KortebiLuca Muscariello
    • James RobertsAbdesselem KortebiLuca Muscariello
    • H04L1/00
    • H04L47/52H04L47/10H04L47/17H04L47/2441H04L47/50H04L47/623Y10T477/755
    • The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.
    • 当所述流(F)在活动流的列表上时,在将所述分组引入公平共享调度机制(6)中时,本发明的方法在于确定属于每个新的输入分组(P)的流(F) 当在活动流列表中不存在所述流(F)时,在获得对参考时间段内的所述流量的输入数据项数量(I.Bytes)的估计时,将所述估计与最大值进行比较 (MaxBytes),其中根据公平共享数据速率确定参考时间段或最大值,在将所述流添加到活动流列表中并将分组(P)引入公平共享调度机制(6)中时, 如果所述估计超过最大值,并且在替代情况下将分组(P)引入优先级队列(5)的末尾。