System And Method For Implementing Active Queue Management Enhancements For Variable Bottleneck Rates
    21.
    发明申请
    System And Method For Implementing Active Queue Management Enhancements For Variable Bottleneck Rates 有权
    用于实现可变瓶颈率的活动队列管理增强的系统和方法

    公开(公告)号:US20130308456A1

    公开(公告)日:2013-11-21

    申请号:US13629731

    申请日:2012-09-28

    申请人: Andrea Francini

    发明人: Andrea Francini

    IPC分类号: H04L12/24

    CPC分类号: H04L47/28 H04L47/30 H04L47/32

    摘要: An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method for a buffer management scheme. Certain embodiments of the invention improve the response of AQM schemes with controllable parameters to variations of the output rate of the bottleneck buffer. The impact on TCP performance can be substantial in most cases where the bottleneck rate is not guaranteed to be fixed. The new solution allows AQM schemes to achieve queue stability despite continuous variations of the bottleneck rate.

    摘要翻译: 根据本发明的原理对现有技术进行了改进,其涉及用于缓冲器管理方案的系统和方法的新方法。 本发明的某些实施例将具有可控参数的AQM方案的响应改进为瓶颈缓冲器的输出速率的变化。 在大多数情况下,在不能确保瓶颈率的情况下,对TCP性能的影响可能很大。 新的解决方案允许AQM方案实现队列稳定性,尽管瓶颈率不断变化。

    ENERGY EFFICIENT CONNECTIONLESS ROUTING WITH SIMPLE LOOKUP
    22.
    发明申请
    ENERGY EFFICIENT CONNECTIONLESS ROUTING WITH SIMPLE LOOKUP 审中-公开
    能源效率高,无连接无线路由

    公开(公告)号:US20130077630A1

    公开(公告)日:2013-03-28

    申请号:US13247477

    申请日:2011-09-28

    IPC分类号: H04L12/56

    CPC分类号: H04L45/50 H04L45/04

    摘要: An energy efficient connectionless routing method with simple lookup is disclosed for reducing the number of address lookups associated with a message packet. The energy efficient connectionless routing method with simple lookup includes determining a label sequence which will allow the message packet to traverse a plurality of MPLS domains and affixing the label sequence to the header of the message packet. This allows the message packet to traverse a plurality of MPLS domains without requiring a subsequent IP address lookup at every MPLS domain boundary. The energy efficient connectionless routing method with simple lookup is particularly useful for reducing power consumption associated with TCAM operations during IP address lookups. In addition, a Label Sequencing Edge Router is disclosed for performing the method.

    摘要翻译: 公开了一种具有简单查找功能的节能无连接路由方法,用于减少与消息分组相关联的地址查找次数。 具有简单查找的节能无连接路由方法包括确定标签序列,其将允许消息分组穿越多个MPLS域并将标签序列附加到消息分组的报头。 这允许消息分组遍历多个MPLS域,而不需要在每个MPLS域边界处进行后续的IP地址查找。 具有简单查找功能的节能无连接路由方法对于降低与IP地址查找期间的TCAM操作相关的功耗特别有用。 另外,公开了一种用于执行该方法的标签排序边缘路由器。

    Method and apparatus for guaranteeing data transfer rates and delays in data packet networks using generalized discrete data transfer rate approach
    23.
    发明授权
    Method and apparatus for guaranteeing data transfer rates and delays in data packet networks using generalized discrete data transfer rate approach 失效
    使用广义离散数据传输速率方法保证数据分组网络中的数据传输速率和延迟的方法和装置

    公开(公告)号:US07031255B2

    公开(公告)日:2006-04-18

    申请号:US10748378

    申请日:2003-12-30

    IPC分类号: H04J1/16 H04J12/28

    摘要: A scheduler and method for use in packet communication systems apply a generalized discrete-rate scheduling technique which removes the limitation of the linear increase in sorting complexity with the number of supported service rates. The set of supported service rates may be increased without increasing the number of timestamps that need to be sorted. Conversely, the generalized discrete-rate scheduler supports a given number of service rates using a smaller number of rate FIFO queues, thus further reducing complexity. Such improved performance is achieved by splitting, for scheduling purposes only, a connection or session into multiple sub-connections or sub-sessions. The technique can be applied to per-connection-timestamp and no-per-connection-timestamp discrete-rate schedulers, as well as to any other discrete-rate scheduler.

    摘要翻译: 在分组通信系统中使用的调度器和方法应用广义离散速率调度技术,其消除了排序复杂度线性增加与支持服务速率数量的限制。 可以增加支持服务速率的集合,而不增加需要排序的时间戳的数量。 相反,广义离散速率调度器使用较少数量的速率FIFO队列支持给定数量的服务速率,因此进一步降低了复杂度。 这种改进的性能通过仅将调度目的分成多个子连接或子会话中的连接或会话来实现。 该技术可以应用于每连接时间戳和无连接时间戳离散速率调度器以及任何其他离散速率调度器。

    Method and apparatus for guaranteeing data transfer rates and delays in data packet networks using discrete data transfer rates
    24.
    发明授权
    Method and apparatus for guaranteeing data transfer rates and delays in data packet networks using discrete data transfer rates 失效
    使用离散数据传输速率保证数据分组网络中的数据传输速率和延迟的方法和装置

    公开(公告)号:US06618391B1

    公开(公告)日:2003-09-09

    申请号:US09247742

    申请日:1999-02-09

    IPC分类号: H04L1228

    摘要: A scheduler and method for use in ATM and packet communication systems applies a no-per-connection-timestamp discrete-rate scheduling technique which does not require the computation and storage of one timestamp per connection, and only maintains a single timestamp per supported service rate. The elimination of the per-connection timestamps has no negative effect on the delay bounds guaranteed by the scheduler. The total implementation cost of such schedulers which approximate the Generalized Processor Sharing (GPS) policy is reduced, since there is less complexity involved in maintaining and sorting the timestamps for all connections.

    摘要翻译: 在ATM和分组通信系统中使用的调度器和方法应用无连接时间戳离散速率调度技术,其不需要每个连接的一个时间戳的计算和存储,并且仅维护每个支持服务速率的单个时间戳 。 每个连接时间戳的消除对调度器保​​证的延迟界限没有负面影响。 由于在维护和排序所有连接的时间戳方面涉及到较少的复杂性,因此减少了近似于通用处理器共享(GPS)策略的这种调度器的总实现成本。

    System for guaranteeing data transfer rates and delays in packet networks
    25.
    发明授权
    System for guaranteeing data transfer rates and delays in packet networks 失效
    用于保证数据传输速率和分组网络延迟的系统

    公开(公告)号:US6075791A

    公开(公告)日:2000-06-13

    申请号:US959362

    申请日:1997-10-28

    摘要: A system is disclosed which services a plurality of queues associated with respective data connections such that the system guarantees data transfer rates and data transfer delays to the data connections. This is achieved by associating each connection having at least one data packet waiting in its associated queue (such a connection called a backlogged connection) with a timestamp generated as a function of system parameters including (a) the number of queues that are backlogged, (b) the data transfer rate guaranteed to each connection, (c) the sum of data transfer rates guaranteed to all backlogged connections, (d) the previous timestamp of the connection, and (e) the weighted sum of the timestamps of all backlogged connections, each timestamp weighted by the data transfer rate guaranteed to the corresponding connection. The backlogged connection associated with the timestamp having the smallest value among all of the backlogged connections is then identified and a data packet is transmitted from the queue corresponding to that connection. A new timestamp is then generated for that connection if it is still backlogged. Once the transmission of the data packet is completed, the foregoing determination of the connection with the minimum timestamp is then repeated to identify the next queue to be serviced.

    摘要翻译: 公开了一种系统,其服务与相应数据连接相关联的多个队列,使得系统保证数据传输速率和数据传输延迟到数据连接。 这是通过将具有在其相关联的队列中的至少一个数据包等待的连接(这种称为备用连接的连接)与作为系统参数的函数生成的时间戳相关联来实现的,所述时间戳包括(a)被积压的队列的数量( b)保证每个连接的数据传输速率,(c)保证所有有效连接的数据传输速率的总和,(d)连接的先前时间戳,以及(e)所有阻塞连接的时间戳的加权和 ,每个时间戳由保证对应连接的数据传输速率加权。 然后识别与所有积压的连接中具有最小值的时间戳相关联的积存连接,并且从对应于该连接的队列发送数据分组。 然后,如果该连接仍然是积压的,则为该连接生成新的时间戳。 一旦完成了数据分组的传输,则重复上述与最小时间戳的连接的确定,以识别待维护的下一个队列。

    Congestion control based on flow control

    公开(公告)号:US10038639B2

    公开(公告)日:2018-07-31

    申请号:US15268023

    申请日:2016-09-16

    IPC分类号: H04L12/801

    摘要: The present disclosure generally discloses a congestion control capability for use in communication systems (e.g., to provide congestion control over wireless links in wireless systems, over wireline links in wireline systems, and so forth). The congestion control capability may be configured to provide congestion control for a transport flow of a transport connection, sent from a transport flow sender to a transport flow receiver, based on flow control associated with the transport flow. The transport flow may traverse a flow queue of a link buffer of a link endpoint. The link endpoint may provide to the transport flow sender, via an off-band signaling channel, an indication of the saturation state of the flow queue of the transport flow. The transport flow sender may control transmission of packets of the transport flow based on the indication of the saturation state of the flow queue of the transport flow.

    NETWORKED TRANSPORT LAYER SOCKET
    27.
    发明申请

    公开(公告)号:US20180159965A1

    公开(公告)日:2018-06-07

    申请号:US15368540

    申请日:2016-12-02

    IPC分类号: H04L29/06 H04L12/24

    CPC分类号: H04L69/161 H04L41/02

    摘要: The present disclosure generally discloses a networked transport layer socket capability. The networked transport layer socket capability, for transport layer connection of a communication device attached to a network access device, moves the transport layer connection endpoint of the transport layer connection of the communication device (which also may be referred to as a client transport layer socket of the transport layer connection of the communication device) from the communication device into the network access device. The application client at the application layer of the communication device, rather than communicating with the client transport layer socket of the transport layer of the communication device internally within the communication device, communicates with the client transport layer socket of the transport layer of the communication device, which is provided within the network access device for the communication device, via a communication path between the communication device and the network access device.

    LONGEST QUEUE IDENTIFICATION
    28.
    发明申请

    公开(公告)号:US20170295113A1

    公开(公告)日:2017-10-12

    申请号:US15091890

    申请日:2016-04-06

    IPC分类号: H04L12/861 H04L12/863

    摘要: The present disclosure generally discloses a longest queue identification mechanism. The longest queue identification mechanism, for a set of queues of a buffer, may be configured to identify the longest queue of the set of queues and determine a length of the longest queue of the set of queues. The longest queue identification mechanism may be configured to identify the longest queue of the set of queues using only two variables including a longest queue identifier (LQID) variable for the identity of the longest queue and a longest queue length (LQL) variable for the length of the longest queue. It is noted that the identity of the longest queue of the set of queues may be an estimate of the identity of the longest queue and, similarly, that the length of the longest queue of the set of queues may be an estimate of the length of the longest queue.

    CONTROL OF CONGESTION WINDOW SIZE OF AN INFORMATION TRANSMISSION CONNECTION
    29.
    发明申请
    CONTROL OF CONGESTION WINDOW SIZE OF AN INFORMATION TRANSMISSION CONNECTION 审中-公开
    控制信息传输连接的窗口大小

    公开(公告)号:US20150236966A1

    公开(公告)日:2015-08-20

    申请号:US14562050

    申请日:2014-12-05

    摘要: A capability for controlling a size of a congestion window of an information transmission connection (ITC) is provided. The size of the congestion window of the ITC may be controlled based on a threshold, which may be based on an ideal bandwidth-delay product (IBDP) value. The IBDP value may be based on a product of an information transmission rate measure and a time measure. The information transmission rate measure may be based on a target information transmission rate for the ITC. The time measure may be based on a round-trip time measured between a sender of the ITC and a receiver of the ITC. The threshold may be a cap threshold where the size of the congestion window is prevented from exceeding the cap threshold. The threshold may be a reset threshold which may be used to control a reduction of the size of the congestion window.

    摘要翻译: 提供了用于控制信息传输连接(ITC)的拥塞窗口的大小的能力。 可以基于可以基于理想的带宽延迟乘积(IBDP)值的阈值来控制ITC的拥塞窗口的大小。 IBDP值可以基于信息传输速率测量和时间测量的乘积。 信息传输速率测量可以基于ITC的目标信息传输速率。 时间测量可以基于在ITC的发送者和ITC的接收者之间测量的往返时间。 阈值可以是上限阈值,其中阻止了拥塞窗口的大小超过上限阈值。 阈值可以是可以用于控制拥塞窗口的大小的减小的复位阈值。

    EXPEDITING THE DISTRIBUTION OF DATA FILES BETWEEN A SERVER AND A SET OF CLIENTS
    30.
    发明申请
    EXPEDITING THE DISTRIBUTION OF DATA FILES BETWEEN A SERVER AND A SET OF CLIENTS 审中-公开
    对服务器和一组客户之间的数据文件进行分发

    公开(公告)号:US20130041935A1

    公开(公告)日:2013-02-14

    申请号:US13510311

    申请日:2010-11-19

    IPC分类号: G06F15/16

    CPC分类号: H04L67/2861

    摘要: Expediting the distribution of data files between a server and a set of clients. The present invention relates to client-server systems and, more particularly, to cache nodes in client-server systems. In a client-server arrangement, a source system transfers data files from the source system to a server cache node connected to the source system. The server cache node sends a list of data files cached in the server cache node to a client cache node. The client cache node sends a request to the server cache node for new data files cached in the server cache node, based on the list received from the server cache node. The server cache node sends the requested data files to the client cache node and the client cache node transfers the data files to a destination system.

    摘要翻译: 加速在服务器和一组客户端之间分发数据文件。 本发明涉及客户机 - 服务器系统,更具体地,涉及客户机 - 服务器系统中的高速缓存节点。 在客户端 - 服务器安排中,源系统将数据文件从源系统传输到连接到源系统的服务器缓存节点。 服务器缓存节点将缓存在服务器缓存节点中的数据文件列表发送到客户端缓存节点。 客户端缓存节点根据从服务器缓存节点接收到的列表,向服务器缓存节点发送缓存在服务器缓存节点中的新数据文件的请求。 服务器缓存节点将请求的数据文件发送到客户端缓存节点,客户机缓存节点将数据文件传送到目标系统。