公开(公告)号：US09619417B2

公开(公告)日：2017-04-11

申请号：US13162877

申请日：2011-06-17

申请人： Adiseshu Hari ,  Andrea Francini ,  Yuh-Jye Chang ,  Manoj K. Jaitly

发明人： Adiseshu Hari ,  Andrea Francini ,  Yuh-Jye Chang ,  Manoj K. Jaitly

IPC分类号： G06F9/44 ,  G06F13/38 ,  H04M1/725 ,  H04L29/08 ,  H04L29/12 ,  H04L12/773

CPC分类号： G06F13/385 ,  G06F8/38 ,  H04L45/60 ,  H04L61/2521 ,  H04L67/04 ,  H04L67/16 ,  H04M1/72525

摘要： A managed Universal Serial Bus (USB) service capability is disclosed. The managed USB service capability is configured to use a mobile computing device (e.g., a smartphone or other suitable mobile computing device) to support a set of services for a computer (e.g., a desktop, a laptop, and the like) capable of connecting to the mobile computing device via a USB connection. The managed USB service capability enables local and/or remote control of the mobile computing device to operate in various USB device classes, such that the mobile computing device can provide various managed USB services for the computer via the peripheral connection. In this manner, the mobile computing device may be dynamically configured to operate as one or more of a network interface, a virtual private network (VPN) client, a smart card, a serial console, a mass-storage device, a booting device, and the like.

公开(公告)号：US08842540B2

公开(公告)日：2014-09-23

申请号：US13629731

申请日：2012-09-28

申请人： Andrea Francini

发明人： Andrea Francini

IPC分类号： H04L12/26

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方案实现队列稳定性，尽管瓶颈率不断变化。

公开(公告)号：US08441927B2

公开(公告)日：2013-05-14

申请号：US13006142

申请日：2011-01-13

申请人： Andrea Francini

发明人： Andrea Francini

IPC分类号： G06F11/00 ,  H04J1/16 ,  H04L1/00 ,  H04L12/26

CPC分类号： H04L47/32 ,  H04L47/12 ,  H04L47/193 ,  H04L47/28 ,  H04L47/31

摘要： 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 called Periodic Early Discard (PED). The invention builds on the observation that, in presence of TCP traffic, the length of a queue can be stabilized by selection of an appropriate frequency for packet dropping. For any combination of number of TCP connections and distribution of the respective RTT values, there exists an ideal packet drop frequency that prevents the queue from over-flowing or under-flowing. While the value of the ideal packet drop frequency may quickly change over time and is sensitive to the series of TCP connections affected by past packet losses, and most of all is impossible to compute inline, it is possible to approximate it with a margin of error that allows keeping the queue occupancy within a pre-defined range for extended periods of time. The PED scheme aims at tracking the (unknown) ideal packet drop frequency, adjusting the approximated value based on the evolution of the queue occupancy, with corrections of the approximated packet drop frequency that occur at a timescale that is comparable to the aggregate time constant of the set of TCP connections that traverse the queue.

摘要翻译： 根据本发明的原理，对现有技术进行了改进，该原理涉及一种称为周期性早期丢弃（PED）的缓冲器管理方案的系统和方法的新方法。 本发明基于以下观察结果：在存在TCP业务的情况下，可以通过选择适当的分组丢弃频率来稳定队列的长度。 对于TCP连接数量和相应RTT值的分配的任何组合，存在一个理想的分组丢弃频率，可以防止队列过流或欠流。 虽然理想分组丢弃频率的值可能随时间快速变化，并且对由过去分组丢失影响的一系列TCP连接敏感，并且最重要的是不可能在线计算，但是可以用误差边界近似它 这允许将队列占用保持在预定义的范围内延长的时间段。 PED方案旨在跟踪（未知）理想的分组丢弃频率，基于队列占用的演变来调整近似值，其中以与总时间常数相当的时间尺度出现的近似分组丢弃频率的校正 穿过队列的TCP连接集。

公开(公告)号：US20110149995A1

公开(公告)日：2011-06-23

申请号：US12642314

申请日：2009-12-18

申请人： Andrea Francini ,  Dimitrios Stiliadis

发明人： Andrea Francini ,  Dimitrios Stiliadis

IPC分类号： H04J3/22

CPC分类号： H04L12/4013 ,  H04L47/10 ,  H04L47/17 ,  H04L47/22 ,  H04L47/2441 ,  Y02D50/10

摘要： A method and system of coordination independent rate adaptation is disclosed. The method and system of coordination independent rate adaptation provides for deploying a rate adaptation subdomain into a packet network having no rate adaptation coordination among the network nodes. The method and system is particularly useful for incremental introduction of rate-adaptive devices in existing networks; combining the best properties of sleep-state exploitation and rate scaling techniques by defining a class of state-setting policies for rate adaptation schemes that enforce tight deterministic bounds on the extra delay that the schemes may cause to network traffic at every node where they are deployed.

摘要翻译： 披露了协调独立速率适应的方法和系统。 协调独立速率适应的方法和系统提供了将速率适配子域部署到网络节点之间没有速率自适应协调的分组网络中。 该方法和系统对现有网络中速率自适应设备的增量引入特别有用; 结合睡眠状态利用的最佳属性和速率缩放技术，通过定义一类用于速率适配方案的状态设置策略，这些策略强制执行紧密的确定性边界，以使得方案可能导致其部署在其每个节点处的网络流量的额外延迟 。

公开(公告)号：US07099330B2

公开(公告)日：2006-08-29

申请号：US10010582

申请日：2001-11-13

申请人： Fabio M. Chiussi ,  Kevin D. Drucker ,  Andrea Francini

发明人： Fabio M. Chiussi ,  Kevin D. Drucker ,  Andrea Francini

IPC分类号： H04L12/56 ,  H04L12/54

CPC分类号： H04L12/5601 ,  H04L47/24 ,  H04L47/28 ,  H04L47/50 ,  H04L47/521 ,  H04L47/525 ,  H04L47/6225 ,  H04L49/205 ,  H04L49/254 ,  H04L49/30 ,  H04L49/3081 ,  H04L2012/5649 ,  H04L2012/5651 ,  H04L2012/5679

摘要： A scheduling apparatus flexibly integrates guaranteed-bandwidth (GB) and best-effort (BE) flows and comprises a combination of a primary weighted-round-robin (WRR) scheduler (PWS) and a secondary WRR scheduler (SWS). The PWS distributes service to the individual GB flows and determines the amount of service that the BE flow aggregate should receive during each frame. The SWS takes care of fairly distributing the service share of the BE aggregate over the individual BE flows. The scheduling apparatus divides the service frame in two subframes. In the first subframe, the PWS fulfills the bandwidth requirements of the GB flows. In the second subframe, the SWS distributes fair service to the BE flows. For each frame, the duration depends on the amount of bandwidth allocated to the GB flows and on the number of GB flows that are backlogged at the beginning of the frame. The amount of bandwidth globally available to BE flows (i.e., the duration of the second subframe) is dynamically adapted to the backlog state of the GB flows, increasing when the GB-flow activity is low, and decreasing when the GB-flow activity intensifies.

公开(公告)号：US06654345B1

公开(公告)日：2003-11-25

申请号：US09432976

申请日：1999-11-03

申请人： Fabio M. Chiussi ,  Andrea Francini

发明人： Fabio M. Chiussi ,  Andrea Francini

IPC分类号： H04L1254

CPC分类号： H04L47/10 ,  H04L49/101 ,  H04L49/25 ,  H04L49/254 ,  H04L49/3018

摘要： Single-bit-timestamp discrete-rate scheduling distributes service to competing connections (e.g., packet connections such as virtual-circuit connections) using a single bit for each connection, rather than using one or more multi-bit timestamps per connection. Single-bit timestamps are computed and sorted for scheduling packets in, for example, Asynchronous Transfer Mode (ATM) networks, for guaranteeing data transfer rates to data sources and data transfer delays from data sources to destinations. Connections are listed in one of N first-in, first-out (FIFO) rate queues j, each rate queue j, 1≦j≦N, associated with one of N service rates. A scheduler identifies the next connection for service as the connection VCj,i being at the head of the rate queue with the minimum corresponding timestamp among those rate queues having timestamps satisfying an eligibility condition. Single-bit-timestamp discrete-rate scheduling uses a multi-bit timestamp value Fj (referred to as the queue timestamp), one bit bQj (referred to as the queue bit) per rate queue j, and a single bit bVCj,i (referred to as the connection bit) for the ith connection VCj,i in rate queue j. The scheduler generates and maintains queue timestamps Fj, queue bits bQj, and connection bits bVCj,i based on whether the rate queues and the connections are backlogged. At timeslot m, the scheduler searches for the queue timestamp FS(m) having the minimum value among the rate queue timestamps associated with currently backlogged rate queues (a FIFO rate queue j is backlogged when the list has at least one connection in the rate queue) and satisfies the eligibility condition according to a selection policy. Single-bit-timestamp discrete-rate scheduling uses only a single bit for each queued connection, and achieves delay bounds and fairness indices that are identical to those of a prior art discrete-rate scheduler using per-connection multi-bit timestamps.

公开(公告)号：US06396843B1

公开(公告)日：2002-05-28

申请号：US09182884

申请日：1998-10-30

申请人： Fabio Massimo Chiussi ,  Andrea Francini ,  Joseph George Kneuer

发明人： Fabio Massimo Chiussi ,  Andrea Francini ,  Joseph George Kneuer

IPC分类号： H04L1228

CPC分类号： H04L47/568 ,  H04L47/28 ,  H04L47/50 ,  H04L47/564 ,  H04L49/25 ,  H04L49/30 ,  H04L49/90 ,  H04L49/9031

摘要： The total implementation complexity of packet schedulers which aim at approximating the Generalized Processor Sharing (GPS) policy is the combination of the complexity of their system-potential function and the complexity involved in sorting the timestamps in order to select the packet with minimum timestamp for transmission. Given that several scheduling algorithms which use a system-potential function of O(1) complexity have been introduced (among them, the Minimum-Delay Self-Clocked Fair Queuing (MD-SCFQ) algorithm achieves optimal delay and excellent fairness properties), the major contribution to the total complexity comes from the task of sorting the timestamps every time a packet is transmitted or received, which is common to all GPS-related schedulers. A method and an apparatus, called the Logarithmic Calendar Queue (LCQ), is disclosed which can achieve a dramatic reduction of the implementation complexity of sorting the timestamps in a GPS-related scheduler, at the cost of very small and controllable degradation of the guaranteed delay bounds. This is achieved by using a plurality of calendar subqueues, each subqueue associated with different granularity for the representation of timestamp values.

摘要翻译： 旨在近似广义处理器共享（GPS）策略的分组调度器的总实现复杂度是其系统潜在功能的复杂性与排序时间戳所涉及的复杂性的组合，以便选择具有最小传输时间戳的分组 。 考虑到使用了具有O（1）复杂度的系统潜在功能的几种调度算法（其中，最小延迟自时钟公平队列（MD-SCFQ）算法实现了最佳延迟和极好的公平性）， 对总体复杂性的主要贡献来自于每次发送或接收分组时的时间戳的任务，这对于所有与GPS相关的调度器是共同的。 公开了一种称为对数日历队列（LCQ）的方法和装置，其可以实现在GPS相关调度器中排序时间戳的实施复杂度的显着降低，其代价是保证的非常小且可控的降级 延迟界限 这通过使用多个日历子队列来实现，每个子队列与用于表示时间戳值的不同粒度相关联。

公开(公告)号：US20180083878A1

公开(公告)日：2018-03-22

申请号：US15268023

申请日：2016-09-16

申请人： Andrea Francini ,  Stepan Kucera ,  Sameerkumar Sharma ,  Joseph D. Beshay

发明人： Andrea Francini ,  Stepan Kucera ,  Sameerkumar Sharma ,  Joseph D. Beshay

IPC分类号： H04L12/801

CPC分类号： H04L47/12 ,  H04L47/11 ,  H04L47/193 ,  H04L47/30 ,  H04L47/33

摘要： 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.

公开(公告)号：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方案实现队列稳定性，尽管瓶颈率不断变化。

公开(公告)号：US20130077630A1

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

申请号：US13247477

申请日：2011-09-28

申请人： Yigal Bejerano ,  Andrea Francini

发明人： Yigal Bejerano ,  Andrea Francini

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操作相关的功耗特别有用。 另外，公开了一种用于执行该方法的标签排序边缘路由器。