会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明专利
    • DE60306723D1
    • 2006-08-24
    • DE60306723
    • 2003-06-09
    • NOKIA CORP
    • RUUTU JUSSIKILKKI KALEVI
    • H04L12/56H04L12/28
    • A multimode queuing system (600) for DiffSery routers is provided. The multimode buffering and scheduling system that can be adjusted to show either "pure" Assured Forwarding/Expedited Forwarding (AF/EF) behavior, "pure" DiffServ Urgency Importance (DSUI) behavior, or a combination of the AF/EF behavior and the DSUI behavior. An operation point parameter may be set to select the desired behavior. DiffServ products utilizing the combination of the behaviors are flexible and more configurable as compared to only AF/EF products. The multimode queuing system deployment is simple and is a low cost modification to DiffServ routers. The same hardware and/or software implementation can support both mechanisms with very small additional cost and effort. Also the management of the system is simplified. For example, there is no need for several parallel queuing systems.A multimode queuing system (600) for DiffSery routers is provided. The multimode buffering and scheduling system that can be adjusted to show either "pure" Assured Forwarding/Expedited Forwarding (AF/EF) behavior, "pure" DiffServ Urgency Importance (DSUI) behavior, or a combination of the AF/EF behavior and the DSUI behavior. An operation point parameter may be set to select the desired behavior. DiffServ products utilizing the combination of the behaviors are flexible and more configurable as compared to only AF/EF products. The multimode queuing system deployment is simple and is a low cost modification to DiffServ routers. The same hardware and/or software implementation can support both mechanisms with very small additional cost and effort. Also the management of the system is simplified. For example, there is no need for several parallel queuing systems.
    • 28. 发明专利
    • PACKET FLOW CONTROL METHOD AND DEVICE
    • AU2002367068A1
    • 2003-07-30
    • AU2002367068
    • 2002-12-19
    • NOKIA CORP
    • RUUTU JUSSIZHANG DONGMEISHI YUCUNY RENAUDMA JIANLE KHIEMNAIM GHASSAM
    • H04L47/762H04W28/14H04W84/04H04L12/56
    • The present invention relates to a method and network node for controlling packet flow in a buffer means ( 13; 14 ) of a network node of a data network, wherein a nominal capacity is assigned to each data flow, and an additional or free capacity is shifted from a first flow portion to a second flow portion when a new data packet of said second flow portion has been received and said nominal capacity has been exceeded. The nominal capacity may be an upper buffer memory limit used for controlling queuing of data packets in a buffer memory ( 13 ) of said buffer means, wherein the memory space of the buffer memory ( 13 ) is shared between a plurality of channels allocated to respective packet data connections. Then, the free capacity corresponds to a memory space shifted from a first channel to a second channel, when a new data packet of the second channel has been received and not enough memory space is available for the second channel. Thus, a dynamic buffer-sharing mechanism is provided which reduces the number of packet drops in the buffer memory ( 13 ) during congestion and improves network throughput. Alternatively, the nominal capacity may be a nominal flow rate at which data flow traffic is guaranteed in a QoS scheduling algorithm. Then, a residual rate corresponding to the difference between the nominal flow rate and an instantaneous traffic is shifted between flow portions of a buffer means controlled by the scheduling algorithm to maximize total system throughput.