专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070291644A1 Method and Device for Scheduling Packets for Routing in a Network with Implicit Determination of Packets to be Treated as Priority 有权
标题翻译：用于在网络中路由分组的方法和设备，其中隐含确定要被视为优先级的分组
公开(公告)号：US20070291644A1
公开(公告)日：2007-12-20
申请号：US11667893
申请日：2005-11-15
申请人： James Roberts , Sara Oueslati , Abdesselem Kortebi
发明人： James Roberts , Sara Oueslati , Abdesselem Kortebi
IPC分类号： H04L12/56
CPC分类号： H04L47/20 , H04L47/10 , H04L47/11 , H04L47/15 , H04L47/2441 , H04L47/50 , H04L47/525 , H04L47/527 , H04L47/621 , H04L47/70 , H04L47/822 , H04L47/823
摘要： A method of ordonnancing packets belonging to different flows comprises: a step (E58) of queuing each packet in a queue associated with the flow of said packet; and for each of said queues processed cyclically, a step of sending packets contained in said queue up to a quota for said cycle; said method being characterized in that it further includes: a step (E40, E54) of determining the priority of said packet before said step (E58, E56, E48) of queuing, the priority packets being, firstly, the first packets of the inactive flows, namely the flows for which no packet has been received in said cycle, and, secondly, the packets of the active flows for which the volume of packets received in the cycle is less than the quota; and a step of sending with priority in said cycle packets determined to have priority during said determination step (E40, E54).
摘要翻译：属于不同流的分组的方法包括：对与所述分组的流相关联的队列中的每个分组进行排队的步骤（E58）并且对于周期性地处理的每个所述队列，将包含在所述队列中的分组发送到所述周期的配额的步骤; 所述方法的特征在于还包括：在所述步骤（E 58，E 56，E 48）排队之前确定所述分组的优先级的步骤（E40，E54），所述优先级分组首先是不活动流的第一分组，即在所述周期中没有接收到分组的流，其次，在该周期中接收的分组量小于该分配的活动流的分组; 以及在所述确定步骤（E40，E54）中被确定为具有优先级的所述周期分组中优先发送的步骤。

2. 发明授权

US08311049B2 Method and device for scheduling packets for routing in a network with implicit determination of packets to be treated as priority 有权
标题翻译：用于在网络中路由分组的方法和装置，其中隐含确定要被视为优先级的分组
公开(公告)号：US08311049B2
公开(公告)日：2012-11-13
申请号：US11667893
申请日：2005-11-15
申请人： James Roberts , Sara Oueslati , Abdesselem Kortebi
发明人： James Roberts , Sara Oueslati , Abdesselem Kortebi
IPC分类号： H04L12/28
CPC分类号： H04L47/20 , H04L47/10 , H04L47/11 , H04L47/15 , H04L47/2441 , H04L47/50 , H04L47/525 , H04L47/527 , H04L47/621 , H04L47/70 , H04L47/822 , H04L47/823
摘要： A method of ordonnancing packets belonging to different flows comprises: a step (E58) of queuing each packet in a queue associated with the flow of said packet; and for each of said queues processed cyclically, a step of sending packets contained in said queue up to a quota for said cycle; said method being characterized in that it further includes: a step (E40, E54) of determining the priority of said packet before said step (E58, E56, E48) of queuing, the priority packets being, firstly, the first packets of the inactive flows, namely the flows for which no packet has been received in said cycle, and, secondly, the packets of the active flows for which the volume of packets received in the cycle is less than the quota; and a step of sending with priority in said cycle packets determined to have priority during said determination step (E40, E54).
摘要翻译：属于不同流的分组的方法包括：对与所述分组的流相关联的队列中的每个分组进行排队的步骤（E58）并且对于周期性地处理的每个所述队列，将包含在所述队列中的分组发送到所述周期的配额的步骤; 所述方法的特征在于还包括：在队列的所述步骤（E58，E56，E48）之前确定所述分组的优先级的步骤（E40，E54），所述优先级分组首先是所述无效的第一分组流，即在所述周期中没有接收到分组的流，其次，在该周期中接收的分组量小于配额的活动流的分组; 以及在所述确定步骤（E40，E54）中确定为具有优先级的所述周期分组中优先发送的步骤。

3. 发明申请

US20100278053A1 Method for Organizing Packets Belonging to Streams, and Associated Equipment 有权
标题翻译：组织流媒体和相关设备的方法
公开(公告)号：US20100278053A1
公开(公告)日：2010-11-04
申请号：US11919752
申请日：2006-04-20
申请人： James Roberts , Abdesselem Kortebi , Luca Muscariello
发明人： James Roberts , Abdesselem Kortebi , Luca Muscariello
IPC分类号： H04L12/26
CPC分类号： H04L47/52 , H04L47/10 , H04L47/17 , H04L47/2441 , H04L47/50 , H04L47/623 , Y10T477/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）的末尾。

4. 发明授权

US07933204B2 Method for organizing packets belonging to streams, and associated equipment 有权
标题翻译：用于组织属于流的数据包和相关设备的方法
公开(公告)号：US07933204B2
公开(公告)日：2011-04-26
申请号：US11919752
申请日：2006-04-20
申请人： James Roberts , Abdesselem Kortebi , Luca Muscariello
发明人： James Roberts , Abdesselem Kortebi , Luca Muscariello
IPC分类号： H04L1/00
CPC分类号： H04L47/52 , H04L47/10 , H04L47/17 , H04L47/2441 , H04L47/50 , H04L47/623 , Y10T477/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）的末尾。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式