公开(公告)号：US08045463B2

公开(公告)日：2011-10-25

申请号：US12182493

申请日：2008-07-30

Applicant: Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

Inventor： Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

IPC: H04J3/14

CPC classification number: H04W40/04 ,  H04L45/127

Abstract: In example methods and algorithms, a node in a wireless mesh network calculates an estimated cost for a packet flow through the node. The estimation may be based on the back-log at the node and the cost of downstream neighbor nodes for the flow. Further, selection of a downstream flow and a downstream neighbor node may be based on the estimation. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received.

Abstract translation: 在示例性方法和算法中，无线网状网络中的节点计算通过节点的分组流的估计成本。 该估计可以基于节点处的back-log和流的下游邻居节点的成本。 此外，下游流和下游邻居节点的选择可以基于估计。 还描述了分组重新排序算法，其拦截在节点处接收的分组，并且如果未接收到分组序列中的较早分组，则将分组的传送延迟到IP层。

公开(公告)号：US07516238B2

公开(公告)日：2009-04-07

申请号：US10676772

申请日：2003-09-30

Applicant: Peter B. Key ,  Laurent Massoulie ,  Bing Wang

Inventor： Peter B. Key ,  Laurent Massoulie ,  Bing Wang

IPC: G06F15/16

CPC classification number: H04L47/27 ,  H04L47/10 ,  H04L47/11

Abstract: In an application-level background transport service, a receiver node infers the available network capacity between itself and a sender node over a control interval. Based on the inferred available network capacity, the receiver node adjusts its receive window size accordingly in order to conservatively optimize the bandwidth used by a background transfer without degrading performance of other foreground transfers on the network. The adjusted receive window size is communicated to the sender node, which is likely to adjust its send window size based on the adjusted receive window size.

Abstract translation: 在应用级后台传输服务中，接收器节点通过控制间隔推测其与发送方节点之间的可用网络容量。 基于推测的可用网络容量，接收机节点相应地调整其接收窗口大小，以便保守地优化由后台传输使用的带宽，而不降低网络上其他前台传输的性能。 经调整的接收窗口大小被传送到发送方节点，发送方节点可能会根据调整后的接收窗口大小调整其发送窗口大小。

公开(公告)号：US20070211633A1

公开(公告)日：2007-09-13

申请号：US11454203

申请日：2006-06-16

Applicant: Dinan Gunawardena ,  Shao Liu ,  Laurent Massoulie ,  Milan Vojnovic ,  Peter B. Key

Inventor： Dinan Gunawardena ,  Shao Liu ,  Laurent Massoulie ,  Milan Vojnovic ,  Peter B. Key

IPC: H04L12/26 ,  G06F15/16 ,  H04J3/14

CPC classification number: H04L47/10 ,  H04L47/18 ,  H04L47/193 ,  H04L47/245 ,  H04L47/25 ,  H04L47/263 ,  H04L47/27 ,  Y02D50/10

Abstract: An end-to-end congestion control is provided that emulates a different service differentiation than the common low-normal priority. This protocol is referred to as 4CP (Competitive, Considerate Congestion Control). The target service differentiation enables provisioning of per-flow average bandwidth guarantees to “normal” traffic, but not at the expense of potentially starving the “low” priority traffic (4CP). It thus features incentive compatibility to file-transfer applications that are throughput-greedy but want to be considerate to other traffic. 4CP is implemented and configured as a sender-only adaptation of standard TCP, and requires no special network feedback. Configuration of the bandwidth guarantee is either statically configured or automatically adjusted by 4CP. The automatic mode aims to be TCP-friendly over appropriately large timescale.

Abstract translation: 提供端到端拥塞控制，其模拟与普通低正常优先级不同的服务区分。 该协议被称为4CP（竞争性，有意思的拥塞控制）。 目标服务差异使得能够将每流量平均带宽保证提供给“正常”流量，但不能以牺牲“低”优先流量（4CP）为代价。 因此，它具有对吞吐量贪心但想要考虑其他流量的文件传输应用程序的激励兼容性。 4CP被实现和配置为标准TCP的仅发送者适配，并且不需要特殊的网络反馈。 带宽保证的配置是静态配置的或由4CP自动调整。 自动模式旨在在适当的大时间尺度上对TCP友好。

公开(公告)号：US5521971A

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

申请号：US252097

申请日：1994-05-31

Applicant: Peter B. Key ,  Thomas R. Griffiths ,  Richard J. Gibbens ,  Francis P. Kelly

Inventor： Peter B. Key ,  Thomas R. Griffiths ,  Richard J. Gibbens ,  Francis P. Kelly

IPC: H04Q3/00 ,  H04L12/54 ,  H04L12/70 ,  H04M3/36 ,  H04Q11/04 ,  H04W28/18 ,  H04M7/00 ,  H04J1/16 ,  H04J3/14

CPC classification number: H04L12/5602 ,  H04M3/36 ,  H04W28/18 ,  H04L2012/5632 ,  H04L2012/5638 ,  H04M2203/2066

Abstract: A communication network (1) comprises a number of network nodes (2, 3, 4 and 5) linked together by transmission paths (6, 7 and 8). A network manager (9) controls acceptance of calls onto transmission paths by classifying an incoming call and selecting from the database (14) an appropriate mean to peak bit rate distribution. This selected distribution is then used with the monitored transmission path load to determine a posterior distribution which reflects the load. The decision to accept or reject the call is made on the basis of the posterior distribution by a call acceptance algorithm considering the effective bandwidth for example.

Abstract translation: 通信网络（1）包括通过传输路径（6,7和8）链接在一起的多个网络节点（2,3,4和5）。 网络管理器（9）通过分类来话呼叫并从数据库（14）中选择适当的平均峰值比特率分布来控制对传输路径的呼叫接收。 然后将该选择的分布与监测的传输路径负载一起使用以确定反映负载的后验分布。 接受或拒绝呼叫的决定是基于考虑有效带宽的呼叫接受算法的后验分布来进行的。

公开(公告)号：US07672234B2

公开(公告)日：2010-03-02

申请号：US11336007

申请日：2006-01-19

Applicant: Derek McAuley ,  Peter B. Key ,  Paul R. Barham ,  Koenraad Laevens

Inventor： Derek McAuley ,  Peter B. Key ,  Paul R. Barham ,  Koenraad Laevens

IPC: G01R31/08 ,  H04L12/66 ,  H04L12/28

CPC classification number: H04L47/33 ,  H04L45/00 ,  H04L45/24 ,  H04L45/245 ,  H04L47/10 ,  H04L47/19 ,  Y02D50/30

Abstract: Network congestion avoidance within aggregated channels is disclosed. In one embodiment, a method first transmits a packet associated with a first channel of a plurality of related channels from a source protocol layer (e.g., a source IP layer) of a source through a network (e.g., the Internet). Next, the method triggers an ECN event by the packet at the network. Finally, at least one channel is determined to have decreased packets transmitted therethrough, in response to the triggering of the ECN event (e.g., based on a congestion pricing criteria).

Abstract translation: 公开了聚合信道内的网络拥塞避免。 在一个实施例中，一种方法首先通过网络（例如因特网）从源的源协议层（例如，源IP层）发送与多个相关信道的第一信道相关联的分组。 接下来，该方法通过网络中的分组触发ECN事件。 最后，响应于ECN事件的触发（例如，基于拥塞定价标准），确定至少一个信道具有通过其传输的减少的分组。

公开(公告)号：US07225267B2

公开(公告)日：2007-05-29

申请号：US10351800

申请日：2003-01-27

Applicant: Peter B. Key ,  Dinan S. Gunawardena ,  Laurent Massoulie

Inventor： Peter B. Key ,  Dinan S. Gunawardena ,  Laurent Massoulie

IPC: G06F15/16

CPC classification number: H04L47/10 ,  H04L47/12 ,  H04L47/2416 ,  H04L47/25 ,  H04L47/263 ,  H04L47/283 ,  H04L47/31

Abstract: Real time communications over a network are adjusted to improve the quality of service (QoS) under incipient congestion conditions. The system detects incipient network congestion and feeds back information regarding the incipient congestion back to the transmitter. Based on this information, the transmission rate is altered appropriately using a control algorithm, which computes the altered transmission rate based on a weight parameter, a gain parameter, and information from a congestion report. The altered transmission rate improves the transmitter's use of the available bandwidth to maintain an acceptable QoS at the receiver.

Abstract translation: 调整网络上的实时通信，以提高初始拥塞条件下的服务质量（QoS）。 该系统检测初始网络拥塞并将关于初始拥塞的信息反馈回发射机。 基于该信息，使用控制算法适当地改变传输速率，该控制算法基于权重参数，增益参数和来自拥塞报告的信息来计算改变的传输速率。 改变的传输速率提高了发射机对可用带宽的使用，以在接收机上维持可接受的QoS。

公开(公告)号：US06947386B2

公开(公告)日：2005-09-20

申请号：US10454411

申请日：2003-06-04

Applicant: Miguel Oom Temudo de Castro ,  Manuel Silverio da Silva Costa ,  Peter B. Key ,  Antony Rowstron

Inventor： Miguel Oom Temudo de Castro ,  Manuel Silverio da Silva Costa ,  Peter B. Key ,  Antony Rowstron

IPC: H04L1/00 ,  H04L29/08 ,  H01L12/28

CPC classification number: H04L67/104 ,  H04L67/1046 ,  H04L67/107 ,  H04L69/329

Abstract: Substantially accurate estimation of coordinates of a subject network node in a coordinate space is accomplished by considering designated coordinates of other positioned nodes within the network. The designation of coordinates in the coordinate space to such nodes allows the computation of predicted coordinate distances between two network nodes based on the coordinates. By optimizing the network distance errors between measured distances and predicted coordinate distances, the predicted coordinates of a subject node joining the network can be iteratively refined. With these estimated coordinates, the coordinate distance between two points in the space may be computed as a prediction of the network distance between the two corresponding nodes. Furthermore, coordinate-based coordinate estimation lends itself to security precautions to protect against malicious reference nodes or external interference.

Abstract translation: 通过考虑网络中其他定位节点的指定坐标来实现对坐标空间中的主题网络节点的坐标的基本准确的估计。 在这些节点的坐标空间中的坐标的指定允许基于坐标计算两个网络节点之间的预测坐标距离。 通过优化测量距离和预测坐标距离之间的网络距离误差，可以迭代地改进加入网络的主体节点的预测坐标。 利用这些估计坐标，空间中两点之间的坐标距离可以被计算为两个对应节点之间的网络距离的预测。 此外，基于坐标的坐标估计还适用于防范恶意参考节点或外部干扰的安全预防措施。

公开(公告)号：US07843828B2

公开(公告)日：2010-11-30

申请号：US10857687

申请日：2004-05-27

Applicant: Peter B. Key ,  Laurent Massoulie ,  Koenraad Laevens

Inventor： Peter B. Key ,  Laurent Massoulie ,  Koenraad Laevens

IPC: H04L12/26

CPC classification number: H04L47/26 ,  H04L47/10 ,  H04L47/193 ,  H04L47/37

Abstract: Methods and systems for detecting and predicting congestion patterns from network feedback are described. In the inventive embodiments, network feedback in the form of binary feedback messages is received. The network feedback can comprise any suitable feedback messages and, in the illustrated and described embodiments comprise packet loss events or ECN marks, to name just a few. The inventive embodiment uses the network feedback to predict when congestion is likely to occur in the future. Based on these predictions, the behavior of end users within the system can be modified so that congestion is reduced. Specifically, the data packets that are typically transmitted by the end users can be delayed until such a time when the predicted congestion is mitigated. Thus, the inventive systems and methods take a predictive, proactive approach to addressing network congestion issues, rather than a reactive approach.

Abstract translation: 描述了从网络反馈中检测和预测拥塞模式的方法和系统。 在本发明实施例中，接收二进制反馈消息形式的网络反馈。 网络反馈可以包括任何合适的反馈消息，并且在所示和所描述的实施例中包括丢包事件或ECN标记，仅举几个例子。 本发明实施例使用网络反馈来预测将来可能发生拥塞的情况。 基于这些预测，可以修改系统内最终用户的行为，从而减少拥塞。 具体来说，通常由最终用户发送的数据分组可以被延迟到预测拥塞减轻的时间。 因此，本发明的系统和方法采取预测性的主动方法来解决网络拥塞问题，而不是反应性方法。

公开(公告)号：US20100027424A1

公开(公告)日：2010-02-04

申请号：US12182493

申请日：2008-07-30

Applicant: Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

Inventor： Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

IPC: H04J3/14

CPC classification number: H04W40/04 ,  H04L45/127

Abstract: Methods and algorithms for path estimation in a wireless mesh network are described. In an embodiment, each node calculates its cost for a packet flow based on the back-log at the node and the cost of downstream neighbor nodes for the flow. The cost is communicated to the upstream neighbor nodes for the flow. When a node has an opportunity to transmit a packet, a flow is selected by the node based on the back-log at the node and the costs received from each of the downstream neighbor nodes. These costs are then also used to select a downstream neighbor node is selected based on the costs received from each of the downstream neighbor nodes. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received.

Abstract translation: 描述了无线网状网络中路径估计的方法和算法。 在一个实施例中，每个节点基于节点的反向日志和流的下游邻居节点的成本来计算分组流的成本。 成本被传送到流的上游邻居节点。 当节点有传送数据包的机会时，节点根据节点的反向日志和从每个下游邻居节点接收的成本选择一个流。 这些成本然后也用于选择下游邻居节点，其基于从每个下游邻居节点接收的成本来选择。 还描述了分组重新排序算法，其拦截在节点处接收的分组，并且如果尚未接收到分组序列中的较早分组，则将分组的传送延迟到IP层。

公开(公告)号：US06842424B1

公开(公告)日：2005-01-11

申请号：US09654737

申请日：2000-09-05

Applicant: Peter B. Key ,  Laurent Massoulie ,  Koenraad Laevens

Inventor： Peter B. Key ,  Laurent Massoulie ,  Koenraad Laevens

IPC: H04L12/56

CPC classification number: H04L47/26 ,  H04L47/10 ,  H04L47/193 ,  H04L47/37

Abstract: Methods and systems for detecting and predicting congestion patterns from network feedback are described. In the inventive embodiments, network feedback in the form of binary feedback messages is received. The network feedback can comprise any suitable feedback messages and, in the illustrated and described embodiments comprise packet loss events or ECN marks, to name just a few. The inventive embodiment uses the network feedback to predict when congestion is likely to occur in the future. Based on these predictions, the behavior of end users within the system can be modified so that congestion is reduced. Specifically, the data packets that are typically transmitted by the end users can be delayed until such a time when the predicted congestion is mitigated. Thus, the inventive systems and methods take a predictive, proactive approach to addressing network congestion issues, rather than a reactive approach.

Abstract translation: 描述了从网络反馈中检测和预测拥塞模式的方法和系统。 在本发明实施例中，接收二进制反馈消息形式的网络反馈。 网络反馈可以包括任何合适的反馈消息，并且在所示和所描述的实施例中包括丢包事件或ECN标记，仅举几个例子。 本发明实施例使用网络反馈来预测将来可能发生拥塞的情况。 基于这些预测，可以修改系统内最终用户的行为，从而减少拥塞。 具体来说，通常由最终用户发送的数据分组可以被延迟到预测拥塞减轻的时间。 因此，本发明的系统和方法采取预测性的主动方法来解决网络拥塞问题，而不是反应性方法。