-
公开(公告)号：US07394763B2
公开(公告)日：2008-07-01
申请号：US10851493
申请日：2004-05-21
Applicant: Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
Inventor： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
CPC classification number: H04L45/125 , H04L45/02 , H04L45/306 , H04L63/0227 , H04L63/1441
Abstract: A network of nodes interconnected by links has content filtering specified at certain nodes, and routing of packet connections through the network is generated based on the specified content-filtering nodes. The network is specified via a content-filtering node placement method and a network-capacity maximization method so as to apply content filtering to packets for substantially all traffic (packet streams) carried by the network.
Abstract translation: 通过链路互连的节点网络具有在某些节点处指定的内容过滤，并且基于指定的内容过滤节点生成通过网络的分组连接的路由。 通过内容过滤节点放置方法和网络容量最大化方法来指定网络，以对网络承载的基本上所有业务（分组流）的分组应用内容过滤。
-
62.发明申请Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks 有权用于处理无线网状网络中的业务变化的链路传输调度的方法和装置公开(公告)号：US20070237081A1
公开(公告)日：2007-10-11
申请号：US11394372
申请日：2006-03-30
Applicant: Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
Inventor： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
CPC classification number: H04L45/00 , H04L43/0882 , H04L45/302 , H04W28/08 , H04W40/12 , Y02D70/22 , Y02D70/34
Abstract: The invention includes a method and apparatus for generating a link transmission schedule for handling traffic variation in wireless networks without dynamic scheduling or routing. The method includes determining fixed traffic capacities associated with respective wireless links of a wireless network according to a routing algorithm, and generating, using the routing algorithm and the fixed traffic capacities, a link transmission schedule including at least one condition by which traffic is transmitted using each of the network links. The link transmission schedule is adapted to remain substantially fixed during dynamic traffic changes. The routing algorithm may be a two-phase routing algorithm in which traffic is distributed by each node in the wireless network to every node in the wireless network using traffic split ratios. For two-phase routing, fixed traffic capacities may be determined using ingress and egress traffic capacities and traffic split ratios associated with respective nodes in the wireless network.
Abstract translation: 本发明包括一种用于在没有动态调度或路由的情况下生成用于处理无线网络中的业务变化的链路传输调度的方法和装置。 该方法包括根据路由算法确定与无线网络的相应无线链路相关联的固定业务容量，以及使用路由算法和固定业务容量生成链路传输调度，链路传输调度包括至少一个使用 每个网络链接。 链路传输调度适于在动态业务改变期间保持基本固定。 路由算法可以是两阶段路由算法，其中使用业务分流比将流量由无线网络中的每个节点分配给无线网络中的每个节点。 对于两相路由，可以使用入口和出口业务容量以及与无线网络中的相应节点相关联的业务分流比来确定固定业务容量。
-
公开(公告)号：US20060133430A1
公开(公告)日：2006-06-22
申请号：US11018282
申请日：2004-12-21
Applicant: Harsha Nagesh , Viswanath Poosala , Sudipta Sengupta , Peter Winzer
Inventor： Harsha Nagesh , Viswanath Poosala , Sudipta Sengupta , Peter Winzer
CPC classification number: H04J3/1617 , H04J2203/0083 , H04J2203/0094 , H04L47/10 , H04L47/125 , H04L47/283 , H04L47/34
Abstract: A load-balanced network architecture is disclosed in which a traffic flow deliverable from a source node to a destination node via intermediate nodes is split into parts, and the parts are distributed to respective ones of the intermediate nodes. Path delay differences for the parts are substantially equalized by delay adjustment at one or more of the intermediate nodes, and packets of one or more of the parts are scheduled for routing from respective ones of the intermediate nodes to the destination node based on arrival times of the packets at the source node.
-
64.发明申请Efficient and robust routing of potentially-variable traffic with local restoration agains link failures 有权具有本地恢复的潜在可变流量的高效且可靠的路由再次发生链路故障公开(公告)号：US20050271060A1
公开(公告)日：2005-12-08
申请号：US11141372
申请日：2005-05-31
Applicant: Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
Inventor： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
CPC classification number: H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
Abstract: A method for supporting recovery from failure of a link in a network of nodes interconnected by links comprises: (a) selecting an intermediate node between an ingress point and an egress point of the network, wherein the intermediate node minimizes 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; wherein the selection identifies 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, each path structure comprising a primary path and one or more link backup detours protecting each link on the primary path; (b) implementing, during a first routing phase, a first routing method for routing a fraction of a service level between the ingress point and the intermediate node along the primary path of the first path structure; and (c) implementing, during a second routing phase, a second routing method for routing a fraction of the service level between the intermediate node and the egress point along the primary path of the second path structure.
Abstract translation: 一种用于支持通过链路互连的节点网络中的链路故障恢复的方法包括：（a）在所述网络的入口点和出口点之间选择中间节点，其中所述中间节点将（i） 入口点和中间节点之间的容量约束和（ii）中间节点与出口点之间的容量约束; 其中所述选择识别所述入口点和所述中间节点之间的第一路径结构以及所述中间节点和所述出口点之间的第二路径结构，每个路径结构包括主路径和一个或多个链路备用绕路，以保护所述中间节点和所述出口点之间的每个链路 主路径 （b）在第一路由阶段期间，实施第一路由选择方法，用于沿着所述第一路径结构的所述主路径在所述入口点和所述中间节点之间路由服务级别的一部分; 以及（c）在第二路由阶段期间实施用于沿着所述第二路径结构的所述主路径路由所述中间节点和所述出口点之间的服务级别的一部分的第二路由方法。
-
65.发明申请Efficient and robust routing of potentially-variable traffic for path restoration following link failure 有权链路故障后路径恢复的潜在可变流量的高效鲁棒路由公开(公告)号：US20050270972A1
公开(公告)日：2005-12-08
申请号：US11141705
申请日：2005-05-31
Applicant: Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
Inventor： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
IPC: H04L12/56
CPC classification number: H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
Abstract: A method for supporting recovery from failure of a path in a network of nodes interconnected by links comprises: (a) selecting an intermediate node between an ingress point and an egress point of the network, wherein the intermediate node minimizes 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; wherein the selection identifies a first link-disjoint path set between the ingress point and the intermediate node, and a second link-disjoint path set between the intermediate node and the egress point, each link-disjoint path set comprising a backup path and at least one primary path; (b) implementing, during a first routing phase, a first routing method for routing a fraction of a service level between the ingress point and the intermediate node along each of the one or more primary paths of the first link-disjoint path set; and (c) implementing, during a second routing phase, a second routing method for routing a fraction of the service level between the intermediate node and the egress point along each of the one or more primary paths of the second link-disjoint path set.
Abstract translation: 一种用于支持通过链路互连的节点网络中的路径故障恢复的方法包括：（a）在所述网络的入口点和出口点之间选择中间节点，其中所述中间节点将（i） 入口点和中间节点之间的容量约束和（ii）中间节点与出口点之间的容量约束; 其中所述选择识别在所述入口点和所述中间节点之间设置的第一链接 - 不相交路径，以及在所述中间节点和所述出口点之间设置的第二链路 - 不相交路径，每个链路 - 不相交路径集合包括备用路径并且至少 一条主路 （b）在第一路由阶段期间实施第一路由方法，用于沿着所述第一链路 - 不相交路径集合的所述一个或多个主路径中的每一个路由在所述入口点和所述中间节点之间的服务级别的一部分; 以及（c）在第二路由阶段期间实施第二路由选择方法，用于沿着所述第二链路 - 不相交路径集合的所述一个或多个主路径中的每一个路由在所述中间节点和所述出口点之间的所述服务级别的一部分。
-
Patent Agency Ranking
公开(公告)号：US08422395B2
公开(公告)日：2013-04-16
申请号：US12242775
申请日：2008-09-30
Applicant: Albert Greenberg , David A. Maltz , Parantap Lahiri , Parveen K. Patel , Sudipta Sengupta
Inventor： Albert Greenberg , David A. Maltz , Parantap Lahiri , Parveen K. Patel , Sudipta Sengupta
CPC classification number: H04L45/00 , H04L12/1863 , H04L45/16 , H04L45/22 , H04L45/28 , H04L45/38 , H04L45/745 , H04L47/125 , H04L47/15
Abstract: 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.
Abstract translation: 描述了基于多个网关的健康和性能信息来选择网关的示例性方法，系统和计算机程序产品。 这些技术描述了网关广告健康和性能信息，计算设备创建这种健康和性能信息的表格，以及使用该表选择网关。 响应于健康和性能信息的变化，计算设备可以选择不同的网关。 该过程允许网络流量负载分布在多个网关上。 该过程通过允许多个活动网关来替代不起作用的网关进一步提供弹性。
-
67.发明授权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
Applicant: Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
Inventor： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC: G01R31/08
CPC classification number: H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
Abstract: 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.
Abstract translation: 在一个实施例中，选择用于支持通过链路互连的节点网络中的节点从在入口点和出口点之间的两个或多个中间节点（不包括故障节点）组成的恢复的方法。 接下来，基于网络的可用带宽，确定从入口点到每个中间节点路由的服务级别的非零分数。 然后，分组通过以下两个阶段路由分组：（1）确定从入口点到每个中间节点的一个或多个路径，用于路由服务级别的相应部分，以及（2）确定从每个中间节点到 出口点用于路由服务级别的相应部分。
-
公开(公告)号：US20100080144A1
公开(公告)日：2010-04-01
申请号：US12242775
申请日：2008-09-30
Applicant: Albert Greenberg , David A. Maltz , Parantap Lahiri , Parveen K. Patel , Sudipta Sengupta
Inventor： Albert Greenberg , David A. Maltz , Parantap Lahiri , Parveen K. Patel , Sudipta Sengupta
IPC: H04L12/26
CPC classification number: H04L45/00 , H04L12/1863 , H04L45/16 , H04L45/22 , H04L45/28 , H04L45/38 , H04L45/745 , H04L47/125 , H04L47/15
Abstract: 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.
Abstract translation: 描述了基于多个网关的健康和性能信息来选择网关的示例性方法，系统和计算机程序产品。 这些技术描述了网关广告健康和性能信息，计算设备创建这种健康和性能信息的表格，以及使用该表选择网关。 响应于健康和性能信息的变化，计算设备可以选择不同的网关。 该过程允许网络流量负载分布在多个网关上。 该过程通过允许多个活动网关来替代不起作用的网关进一步提供弹性。
-
公开(公告)号：US20070253403A1
公开(公告)日：2007-11-01
申请号：US11414147
申请日：2006-04-28
Applicant: Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
Inventor： Muralidharan Kodialam , Tirunell Lakshman , Sudipta Sengupta
IPC: H04L12/28
Abstract: 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.
Abstract translation: 一种计算机实现的方法，用于计算通过链路互连并具有至少一个入口点和至少一个出口点的节点网络的数据路由方案的吞吐量。 该方法包括：从第一线性程序和第二线性程序的组合中导出多项式大小的线性程序并求解多项式大小的线性程序。 第一个线性程序具有无穷大的约束，并且使进入点和出口点之间的路径中的链路的最大链路利用率最小化。 第二线性程序确定是否违反了第一线性程序的任何约束。
-
公开(公告)号：US20060002291A1
公开(公告)日：2006-01-05
申请号：US10880887
申请日：2004-06-30
Applicant: Mansoor Alicherry , Iraj Saniee , Sudipta Sengupta
Inventor： Mansoor Alicherry , Iraj Saniee , Sudipta Sengupta
IPC: H04L12/26
CPC classification number: H04L45/28 , H04L45/00 , H04L45/123 , H04L45/124 , H04L45/22
Abstract: 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.
-
-
-
-
-
-
-
-
-
Search Results
71
records
(took 0.026 seconds)
