公开(公告)号：US08553540B2

公开(公告)日：2013-10-08

申请号：US12762016

申请日：2010-04-16

Applicant: Sanjeev Mehrotra ,  Tong L. Wynn ,  Jin Li ,  Sudipta Sengupta

Inventor： Sanjeev Mehrotra ,  Tong L. Wynn ,  Jin Li ,  Sudipta Sengupta

IPC: H04L12/26

CPC classification number: H04L47/25 ,  H04L47/22 ,  H04L47/2416 ,  H04L47/29 ,  H04L47/30

Abstract: In various embodiments, methods and systems are disclosed for a hybrid rate plus window based congestion protocol that controls the rate of packet transmission into the network and provides low queuing delay, practically zero packet loss, fair allocation of network resources amongst multiple flows, and full link utilization. In one embodiment, a congestion window may be used to control the maximum number of outstanding bits, a transmission rate may be used to control the rate of packets entering the network (packet pacing), a queuing delay based rate update may be used to control queuing delay within tolerated bounds and minimize packet loss, and aggressive ramp-up/graceful back-off may be used to fully utilize the link capacity and additive-increase, multiplicative-decrease (AIMD) rate control may be used to provide fairness amongst multiple flows.

Abstract translation: 在各种实施例中，公开了用于混合速率加上基于窗口的拥塞协议的方法和系统，其控制到网络的分组传输速率并提供低排队延迟，实际上零分组丢失，多个流之间的网络资源的公平分配以及全部 链接利用率。 在一个实施例中，可以使用拥塞窗口来控制未完成比特的最大数量，可以使用传输速率来控制进入网络的分组的速率（分组起搏），基于排队延迟的速率更新可以用于控制 可以利用容忍范围内的排队延迟并尽可能减少分组丢失，并且可以使用积极的提升/优雅退避来充分利用链路容量，并且可以使用加法增加乘法减少（AIMD）速率控制来提供多个 流动。

公开(公告)号：US20130263151A1

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

申请号：US13438465

申请日：2012-04-03

Applicant: Jin Li ,  Cheng Huang ,  Sudipta Sengupta ,  Christopher Broder Wilson

Inventor： Jin Li ,  Cheng Huang ,  Sudipta Sengupta ,  Christopher Broder Wilson

IPC: G06F9/46

CPC classification number: G06F9/5083

Abstract: Described is a technology by which a consistent hashing table of bins maintains values representing nodes of a distributed system. An assignment stage uses a consistent hashing function and a selection algorithm to assign values that represent the nodes to the bins. In an independent mapping stage, a mapping mechanism deterministically maps an object identifier/key to one of the bins as a mapped-to bin.

Abstract translation: 描述了一种技术，通过该技术，一致的散列表的哈希表保持代表分布式系统的节点的值。 分配阶段使用一致的散列函数和选择算法来将表示节点的值分配给分组。 在独立的映射阶段，映射机制确定性地将对象标识符/密钥映射到一个存储区，作为映射到bin。

公开(公告)号：US08260951B2

公开(公告)日：2012-09-04

申请号：US12612395

申请日：2009-11-04

Applicant: Minghua Chen ,  Miroslav Ponec ,  Sudipta Sengupta ,  Jin Li ,  Philip A. Chou

Inventor： Minghua Chen ,  Miroslav Ponec ,  Sudipta Sengupta ,  Jin Li ,  Philip A. Chou

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L65/80 ,  H04L67/1085

Abstract: Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams.

Abstract translation: 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。

公开(公告)号：US20100082838A1

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

申请号：US12242913

申请日：2008-09-30

Applicant: Jiajun Wang ,  Cheng Huang ,  Sudipta Sengupta ,  Jin Li

Inventor： Jiajun Wang ,  Cheng Huang ,  Sudipta Sengupta ,  Jin Li

IPC: G06F15/16

CPC classification number: H04L47/19 ,  H04L47/10 ,  H04L47/12 ,  H04L47/25 ,  H04L67/104

Abstract: An ISP-friendly rate allocation system and method that reduces network traffic across ISP boundaries in a peer-to-peer (P2P) network, Embodiments of the system and method continuously solve a global optimization problem and dictate accordingly how much bandwidth is allocated on each connection. Embodiments of the system and method minimize load on a server in communication with the P2P network, minimize ISP-unfriendly traffic while keeping the minimum server load unaffected, and maximize peer prefetching. Two different techniques are used to compute rate allocation, including a utility function optimization technique and a minimum cost flow formulation technique. The utility function optimization technique constructs a utility function and optimizes that utility function. The minimum cost flow formulation technique generates a minimum cost flow formulation using a bipartite graph have a vertices set and an edges set. A distributed minimum cost flow formulation is solved using Lagrangian multipliers.

Abstract translation: 一种ISP友好的速率分配系统和方法，可减少对等（P2P）网络中ISP边界的网络流量，系统和方法的实施方案不断解决全局优化问题，并据此规定每个网络上分配多少带宽 连接。 系统和方法的实施例最小化与P2P网络通信的服务器上的负载，从而最小化ISP不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。

公开(公告)号：US20090138618A1

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

申请号：US11945306

申请日：2007-11-27

Applicant: Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

Inventor： Jin Li ,  Sudipta Sengupta ,  Miroslav Ponec ,  Minghua Chen ,  Philip A. Chou

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L65/80 ,  H04L67/1085

Abstract: Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams.

Abstract translation: 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。

公开(公告)号：US08027245B2

公开(公告)日：2011-09-27

申请号：US11141705

申请日：2005-05-31

Applicant: Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

IPC: H04L12/26

CPC classification number: H04L45/12 ,  H04L45/04 ,  H04L45/24 ,  H04L47/125

Abstract: In one embodiment, a method for supporting recovery from failure of a path in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two link-disjoint path sets, each comprising a backup path and at least one primary path, with a first path set between the ingress point and the intermediate node, and a second path set between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path set in predetermined proportions, and then from the intermediate node to the final destination via the second path set.

Abstract translation: 在一个实施例中，一种用于支持通过链路互连的节点网络中的路径故障恢复的方法。 选择网络的入口点和出口点之间的中间节点以最小化（i）入口点和中间节点之间的容量约束的和，以及（ii）中间节点和出口点之间的容量约束 。 所述选择识别两个链路不相交路径集，每个链路不相交路径集合包括备用路径和至少一个主路径，其中在入口点和中间节点之间设置第一路径，以及在中间节点和出口点之间设置的第二路径。 为了最大化网络吞吐量，分组以两个阶段路由，首先通过以预定比例设置的第一路径，然后经由第二路径集从中间节点到最终目的地路由到中间节点。

公开(公告)号：US07978594B2

公开(公告)日：2011-07-12

申请号：US11141372

申请日：2005-05-31

Applicant: Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

IPC: H04L12/56

CPC classification number: H04L45/12 ,  H04L45/04 ,  H04L45/24 ,  H04L47/125

Abstract: In one embodiment, a method for supporting recovery from failure of a link in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two path structures, each comprising a primary path and one or more link backup detours protecting each link on the primary path, with a first path structure between the ingress point and the intermediate node, and a second path structure between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path structure in predetermined proportions, and then from the intermediate node to the final destination via the second path structure.

Abstract translation: 在一个实施例中，一种用于支持通过链路互连的节点网络中的链路故障的恢复的方法。 选择网络的入口点和出口点之间的中间节点以最小化（i）入口点和中间节点之间的容量约束的和，以及（ii）中间节点和出口点之间的容量约束 。 所述选择识别两个路径结构，每个路径结构包括主路径和保护主路径上的每个链路的一个或多个链路备用绕路，其中入口点和中间节点之间的第一路径结构以及中间节点之间的第二路径结构 和出口点。 为了最大化网络吞吐量，分组以两个阶段路由，首先通过第一路径结构以预定比例，然后经由第二路径结构从中间节点到最终目的地路由到中间节点。

公开(公告)号：US07593348B2

公开(公告)日：2009-09-22

申请号：US10776466

申请日：2004-02-11

Applicant: Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sudipta Sengupta

IPC: H04L12/28

CPC classification number: H04L45/00 ,  H04L41/0654 ,  H04L41/0896 ,  H04L41/5025 ,  H04L45/14 ,  H04L45/50

Abstract: A given network of nodes that are interconnected by links having corresponding capacities has each link's capacity divided into working capacity and restoration capacity without a priori information about network traffic characteristics. Allocation of working capacity and restoration capacity for the network might be optimized by characterization of the network in accordance with a linear programming problem (LPP) subject to network constraints and then generating a solution to the LPP either exactly or with an approximation. Partitioning the capacity of each link in the network into working and restoration capacities minimizes the restoration capacity overhead in the network to allow for higher network utilization.

Abstract translation: 通过具有相应容量的链路相互连接的给定的节点网络将每个链路的容量划分为工作容量和恢复能力，而无需关于网络流量特性的先验信息。 可以根据网络约束的线性规划问题（LPP）对网络的分配进行优化，然后通过精确地或以近似生成LPP的解决方案，来优化网络的工作能力和恢复能力。 将网络中的每个链路的容量划分为工作和恢复能力，可以最大限度地减少网络中的恢复能力开销，从而实现更高的网络利用率。

公开(公告)号：US20070153674A1

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

申请号：US11321549

申请日：2005-12-29

Applicant: Mansoor Alicherry ,  Peter Hessler ,  Viswanath Poosala ,  Walter Rothkegel ,  Sudipta Sengupta

Inventor： Mansoor Alicherry ,  Peter Hessler ,  Viswanath Poosala ,  Walter Rothkegel ,  Sudipta Sengupta

IPC: H04J1/16

CPC classification number: H04J14/0227 ,  H04J3/085 ,  H04J14/0284 ,  H04J14/0291 ,  H04J2203/006 ,  H04L12/437

Abstract: Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan. Implementation of the pre-configured protection cycle plan may further comprise the node at least one of sending at least one message to another node in the data communication network and receiving at least one message from another node in the data communication network.

Abstract translation: 公开了使用信令协议的改进的p循环恢复技术。 例如，一种在数据通信网络的至少一个节点中用于从故障中恢复的技术，其中数据通信网络包括多个节点和用于连接多个节点的多个链路，包括以下步骤/操作。 在至少一个节点处获得故障的通知。 确定故障是单个链路故障还是节点故障和多个链路故障之一。 当故障是单个链路故障时，实施预配置的保护周期（p周期）计划，但是当故障是节点故障和多个链路故障之一时，则不实现，这样网络中的两个独立路径不连接 在实施预先配置的保护周期计划时。 预配置的保护周期计划的实现可以进一步包括至少一个消息发送到数据通信网络中的另一个节点并且从数据通信网络中的另一节点接收至少一个消息中的至少一个。

公开(公告)号：US20050265258A1

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

申请号：US11106410

申请日：2005-04-14

Applicant: Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

IPC: H04L12/56 ,  H04L12/28

CPC classification number: H04L45/12 ,  H04L45/04 ,  H04L45/24 ,  H04L47/125

Abstract: A scheme for a carrier to route one or more packets of traffic to their destination after ensuring that they pass through a pre-determined intermediate node also in the carrier's domain permits the carrier to handle all permissible traffic patterns without knowledge of the traffic matrix, subject to edge-link capacity constraints. A method of routing data through a network of nodes interconnected by links and having at least one ingress point and at least one egress point, comprises the steps of: receiving a request for a path with a service demand for routing data between the ingress point and the egress point; selecting a set of one or more intermediate nodes between the ingress point and the egress point; determining, based on a bandwidth of said network, respective fractions of the data to send from the ingress point to each node of the set of one or more intermediate nodes; routing the data in the determined respective fractions from the ingress point to each node of the set of one or more intermediate nodes; and routing the data from each node of the set of one or more intermediate nodes to the egress point.

Abstract translation: 一种运营商在确保它们经过载波域中的预定中间节点之后将一个或多个业务流量路由到其目的地的方案允许运营商处理所有可允许的业务模式，而不了解业务矩阵，主体 到边缘链接容量限制。 一种通过链路互连并具有至少一个入口点和至少一个出口点的节点网络路由数据的方法，包括以下步骤：接收对具有服务需求的路径的请求，以在入口点和 出口点; 在入口点和出口点之间选择一个或多个中间节点的集合; 基于所述网络的带宽确定要从所述入口点向所述一个或多个中间节点的集合中的每个节点发送的数据的各个分数; 将确定的各个分数中的数据从入口点路由到一个或多个中间节点的集合中的每个节点; 以及将数据从一个或多个中间节点的集合中的每个节点路由到出口点。