-
公开(公告)号：US08553540B2
公开(公告)日：2013-10-08
申请号：US12762016
申请日：2010-04-16
申请人： Sanjeev Mehrotra , Tong L. Wynn , Jin Li , Sudipta Sengupta
发明人： Sanjeev Mehrotra , Tong L. Wynn , Jin Li , Sudipta Sengupta
IPC分类号： H04L12/26
CPC分类号： H04L47/25 , H04L47/22 , H04L47/2416 , H04L47/29 , H04L47/30
摘要： 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.
摘要翻译： 在各种实施例中，公开了用于混合速率加上基于窗口的拥塞协议的方法和系统，其控制到网络的分组传输速率并提供低排队延迟，实际上零分组丢失，多个流之间的网络资源的公平分配以及全部 链接利用率。 在一个实施例中，可以使用拥塞窗口来控制未完成比特的最大数量，可以使用传输速率来控制进入网络的分组的速率（分组起搏），基于排队延迟的速率更新可以用于控制 可以利用容忍范围内的排队延迟并尽可能减少分组丢失，并且可以使用积极的提升/优雅退避来充分利用链路容量，并且可以使用加法增加乘法减少（AIMD）速率控制来提供多个 流动。
-
公开(公告)号：US20130263151A1
公开(公告)日：2013-10-03
申请号：US13438465
申请日：2012-04-03
IPC分类号： G06F9/46
CPC分类号： G06F9/5083
摘要： 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.
摘要翻译： 描述了一种技术，通过该技术，一致的散列表的哈希表保持代表分布式系统的节点的值。 分配阶段使用一致的散列函数和选择算法来将表示节点的值分配给分组。 在独立的映射阶段，映射机制确定性地将对象标识符/密钥映射到一个存储区，作为映射到bin。
-
公开(公告)号：US08422395B2
公开(公告)日：2013-04-16
申请号：US12242775
申请日：2008-09-30
CPC分类号： H04L45/00 , H04L12/1863 , H04L45/16 , H04L45/22 , H04L45/28 , H04L45/38 , H04L45/745 , H04L47/125 , H04L47/15
摘要： Exemplary methods, systems, and computer program products describe selecting a gateway based on health and performance information of a plurality of gateways. The techniques describe gateways advertising health and performance information, computing devices creating a table of this health and performance information, and selecting a gateway using the table. In response to changes in the health and performance information, the computing device may select a different gateway. The process allows network traffic load to be distributed across a plurality of gateways. This process further provides resilience by allowing a plurality of active gateways to substitute for a non-functioning gateway.
摘要翻译： 描述了基于多个网关的健康和性能信息来选择网关的示例性方法，系统和计算机程序产品。 这些技术描述了网关广告健康和性能信息，计算设备创建这种健康和性能信息的表格，以及使用该表选择网关。 响应于健康和性能信息的变化，计算设备可以选择不同的网关。 该过程允许网络流量负载分布在多个网关上。 该过程通过允许多个活动网关来替代不起作用的网关进一步提供弹性。
-
公开(公告)号：US08260951B2
公开(公告)日：2012-09-04
申请号：US12612395
申请日：2009-11-04
申请人： Minghua Chen , Miroslav Ponec , Sudipta Sengupta , Jin Li , Philip A. Chou
发明人： Minghua Chen , Miroslav Ponec , Sudipta Sengupta , Jin Li , Philip A. Chou
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L65/80 , H04L67/1085
摘要： 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.
摘要翻译： 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。
-
65.发明授权Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures 有权在具有针对路由器故障的弹性的IP-over-optical网络中，潜在可变流量的高效且可靠的路由公开(公告)号：US08194535B2
公开(公告)日：2012-06-05
申请号：US11141257
申请日：2005-05-31
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： In one embodiment, a method for supporting recovery from failure of a node in a network of nodes interconnected by links A set of two or more intermediate nodes (excluding the failed node) between an ingress point and an egress point is selected. Next, based on available bandwidth of the network, a non-zero fraction of the service level to route from the ingress point to each intermediate node is determined. Packets are then routed in two phases by: (1) determining one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level, and (2) determining one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.
摘要翻译： 在一个实施例中，选择用于支持通过链路互连的节点网络中的节点从在入口点和出口点之间的两个或多个中间节点（不包括故障节点）组成的恢复的方法。 接下来，基于网络的可用带宽，确定从入口点到每个中间节点路由的服务级别的非零分数。 然后，分组通过以下两个阶段路由分组：（1）确定从入口点到每个中间节点的一个或多个路径，用于路由服务级别的相应部分，以及（2）确定从每个中间节点到 出口点用于路由服务级别的相应部分。
-
公开(公告)号：US20100082838A1
公开(公告)日：2010-04-01
申请号：US12242913
申请日：2008-09-30
申请人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
发明人： Jiajun Wang , Cheng Huang , Sudipta Sengupta , Jin Li
IPC分类号： G06F15/16
CPC分类号： H04L47/19 , H04L47/10 , H04L47/12 , H04L47/25 , H04L67/104
摘要： 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.
摘要翻译： 一种ISP友好的速率分配系统和方法，可减少对等（P2P）网络中ISP边界的网络流量，系统和方法的实施方案不断解决全局优化问题，并据此规定每个网络上分配多少带宽 连接。 系统和方法的实施例最小化与P2P网络通信的服务器上的负载，从而最小化ISP不友好的业务，同时保持最小服务器负载不受影响，并最大化对等体预取。 使用两种不同的技术来计算速率分配，包括效用函数优化技术和最低成本流量制定技术。 效用函数优化技术构建效用函数并优化该效用函数。 最小成本流量制定技术使用具有顶点集合和边集合的二分图生成最小成本流程公式。 使用拉格朗日乘数解决分布式最小成本流公式。
-
公开(公告)号：US20100080144A1
公开(公告)日：2010-04-01
申请号：US12242775
申请日：2008-09-30
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L12/1863 , H04L45/16 , H04L45/22 , H04L45/28 , H04L45/38 , H04L45/745 , H04L47/125 , H04L47/15
摘要： Exemplary methods, systems, and computer program products describe selecting a gateway based on health and performance information of a plurality of gateways. The techniques describe gateways advertising health and performance information, computing devices creating a table of this health and performance information, and selecting a gateway using the table. In response to changes in the health and performance information, the computing device may select a different gateway. The process allows network traffic load to be distributed across a plurality of gateways. This process further provides resilience by allowing a plurality of active gateways to substitute for a non-functioning gateway.
摘要翻译： 描述了基于多个网关的健康和性能信息来选择网关的示例性方法，系统和计算机程序产品。 这些技术描述了网关广告健康和性能信息，计算设备创建这种健康和性能信息的表格，以及使用该表选择网关。 响应于健康和性能信息的变化，计算设备可以选择不同的网关。 该过程允许网络流量负载分布在多个网关上。 该过程通过允许多个活动网关来替代不起作用的网关进一步提供弹性。
-
公开(公告)号：US20090138618A1
公开(公告)日：2009-05-28
申请号：US11945306
申请日：2007-11-27
申请人： Jin Li , Sudipta Sengupta , Miroslav Ponec , Minghua Chen , Philip A. Chou
发明人： Jin Li , Sudipta Sengupta , Miroslav Ponec , Minghua Chen , Philip A. Chou
IPC分类号： G06F15/173
CPC分类号： H04L67/104 , H04L65/80 , H04L67/1085
摘要： 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.
摘要翻译： 通过设计为使用许多路由路径集的路由系统来减轻与服务器和客户端之间选择有利的网络路由相关联的困难，其中相应的集合包括覆盖所有客户端的多个路由路径，包括通过其他客户端。 然后，服务器可以在所有路由路径集之间分配数据流。 服务器还可以在客户端之间发送数据流时检测计算机网络的性能，并且可以调整包括路由的路由路径集合的分配。 客户端还可以被配置为例如在视频会议会话中作为其他数据流的服务器操作，并且可以被配置为发送检测到的路由性能信息以及各种数据流的部分。
-
公开(公告)号：US20070253403A1
公开(公告)日：2007-11-01
申请号：US11414147
申请日：2006-04-28
IPC分类号： H04L12/28
摘要： A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.
摘要翻译： 一种计算机实现的方法，用于计算通过链路互连并具有至少一个入口点和至少一个出口点的节点网络的数据路由方案的吞吐量。 该方法包括：从第一线性程序和第二线性程序的组合中导出多项式大小的线性程序并求解多项式大小的线性程序。 第一个线性程序具有无穷大的约束，并且使进入点和出口点之间的路径中的链路的最大链路利用率最小化。 第二线性程序确定是否违反了第一线性程序的任何约束。
-
公开(公告)号：US20060002291A1
公开(公告)日：2006-01-05
申请号：US10880887
申请日：2004-06-30
申请人： Mansoor Alicherry , Iraj Saniee , Sudipta Sengupta
发明人： Mansoor Alicherry , Iraj Saniee , Sudipta Sengupta
IPC分类号： H04L12/26
CPC分类号： H04L45/28 , H04L45/00 , H04L45/123 , H04L45/124 , H04L45/22
摘要： A number of techniques are described for routing methods that improve resistance to faults affecting groups of links subject to common risks. One of these techniques accounts for failure potentials in physical networks by considering shared risk link groups separately from performance and costs metrics in determining a primary routing path and a backup path. A shared risk link group (SRLG) is an attribute attached to a link to identify edges that have physical links in common and can therefore be simultaneously disrupted due to a single fault. Another technique considers node disjointness and provides a solution of two paths that are as node disjoint as possible and minimizes administrative costs. The techniques may further be combined in a priority order thereby providing a solution of at least two paths that are strictly SRLG disjoint, as node-disjoint as possible, and have minimum administrative costs. Due to the priority order of evaluation and typical network physical configurations of links, with the links associated common fault SRLGs, the priority ordering technique is very efficient in determining at least two paths for routing between a source and destination node.
-
-
-
-
-
-
-
-
-
搜索结果
71 条记录 (耗时 0.058 秒)
