中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

71 records (took 0.03 seconds)

    Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures
    51.
    发明申请
    Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures 有权
    在具有针对路由器故障的弹性的IP-over-optical网络中，潜在可变流量的高效且可靠的路由

    公开(公告)号：US20050265255A1

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

    申请号：US11141257

    申请日：2005-05-31

    Applicant: Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

    Inventor： Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

    IPC: H04L12/56 ,  H04L12/28 ,  H04L12/26

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

    Abstract: A method for supporting recovery from failure of a node in a network of nodes interconnected by links, wherein the failed node is in a path providing a service level between an ingress point and an egress point of the network, comprises: (a) selecting a set of one or more intermediate nodes between the ingress point and the egress point, the set excluding the failed node; (b) determining, 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; (c) implementing, during a first routing phase, a first routing method to determine one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level; and (d) implementing, during a second routing phase, a second routing method to determine one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.

    Abstract translation: 一种用于支持通过链路互连的节点网络中的节点的故障恢复的方法，其中所述故障节点处于提供所述网络的入口点和出口点之间的服务水平的路径中，包括：（a）选择 在入口点和出口点之间的一个或多个中间节点的集合，不包括故障节点的集合; （b）基于网络的可用带宽确定从入口点到每个中间节点路由的服务级别的非零分数; （c）在第一路由阶段期间实施第一路由方法，以确定从入口点到每个中间节点的一条或多条路径，用于路由服务级别的相应部分; 以及（d）在第二路由阶段期间实施第二路由方法，以确定从每个中间节点到出口点的一条或多条路径，用于路由服务级别的相应部分。

    Multicast routing with service-level guarantees between ingress egress-points in a packet network
    52.
    发明授权
    Multicast routing with service-level guarantees between ingress egress-points in a packet network 失效
    组播路由在分组网络中的入口出口之间具有业务级保证

    公开(公告)号：US06778531B1

    公开(公告)日：2004-08-17

    申请号：US09677009

    申请日：2000-09-29

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

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

    IPC: H04L1228

    CPC classification number: H04L45/302 ,  H04L12/18 ,  H04L45/00 ,  H04L45/125 ,  H04L45/16 ,  H04L45/50

    Abstract: A packet network of interconnected nodes employs a method of routing with service-level guarantees to determine a path through the network for a requested multicast, label-switched path Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from a directed tree determined in accordance with the method of multicast routing with service-level guarantees. For a first implementation, a heuristic algorithm uses a scaling phase that iteratively adjusts a maximum arc capacity, determines the resulting tree for the iteration, and selects the tree as the routing tree that provides the “maximum” flow. For a second implementation, the heuristic algorithm computes maximum multicast flows and determines links in the network that are “critical” to satisfy future multicast routing requests. A multicast routing tree is selected such that provisioning the flows over its links “minimally interferes” with capacity of paths needed for future demands.

    Abstract translation: 互连节点的分组网络采用路由服务级别保证的方法来确定针对所请求的多播的路由，标签交换路径每个节点包括一个或多个基于构造的转发表转发分组的路由器 从根据具有服务级别保证的多播路由方法确定的有向树。 对于第一个实现，启发式算法使用迭代地调整最大电弧容量的缩放阶段，确定迭代的结果树，并选择该树作为提供“最大”流的路由树。 对于第二个实现，启发式算法计算最大组播流，并确定网络中“关键”的链路以满足未来的组播路由请求。 选择组播路由树，使得通过其链路的流量以最小限度地干扰未来需求所需路径的容量。

    Structuring storage based on latch-free B-trees
    54.
    发明授权
    Structuring storage based on latch-free B-trees 有权
    基于无闩锁B树构建存储

    公开(公告)号：US09003162B2

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

    申请号：US13527880

    申请日：2012-06-20

    Applicant: David Lomet ,  Justin Levandoski ,  Sudipta Sengupta

    Inventor： David Lomet ,  Justin Levandoski ,  Sudipta Sengupta

    IPC: G06F12/10

    CPC classification number: G06F12/10 ,  G06F12/0804 ,  G06F17/30327 ,  G06F17/30377 ,  Y10S707/99951

    Abstract: A request to modify an object in storage that is associated with one or more computing devices may be obtained, the storage organized based on a latch-free B-tree structure. A storage address of the object may be determined, based on accessing a mapping table that includes map indicators mapping logical object identifiers to physical storage addresses. A prepending of a first delta record to a prior object state of the object may be initiated, the first delta record indicating an object modification associated with the obtained request. Installation of a first state change associated with the object modification may be initiated via a first atomic operation on a mapping table entry that indicates the prior object state of the object. For example, the latch-free B-tree structure may include a B-tree like index structure over records as the objects, and logical page identifiers as the logical object identifiers.

    Abstract translation: 可以获得修改与一个或多个计算设备相关联的存储中的对象的请求，该存储是基于无闩锁B树结构组织的。 可以基于访问包括将逻辑对象标识符映射到物理存储地址的映射指示符的映射表来确定对象的存储地址。 可以启动对对象的先前对象状态的第一增量记录的前缀，所述第一增量记录指示与所获取的请求相关联的对象修改。 可以通过指示对象的先前对象状态的映射表项上的第一原子操作来启动与对象修改相关联的第一状态改变的安装。 例如，无闩锁B树结构可以包括作为对象的记录上的B树类索引结构，以及逻辑页标识符作为逻辑对象标识符。

    STRUCTURING STORAGE BASED ON LATCH-FREE B-TREES
    55.
    发明申请
    STRUCTURING STORAGE BASED ON LATCH-FREE B-TREES 有权
    基于无需B-TREES的结构存储

    公开(公告)号：US20130346725A1

    公开(公告)日：2013-12-26

    申请号：US13527880

    申请日：2012-06-20

    Applicant: David Lomet ,  Justin Levandoski ,  Sudipta Sengupta

    Inventor： David Lomet ,  Justin Levandoski ,  Sudipta Sengupta

    IPC: G06F12/10

    CPC classification number: G06F12/10 ,  G06F12/0804 ,  G06F17/30327 ,  G06F17/30377 ,  Y10S707/99951

    Abstract: A request to modify an object in storage that is associated with one or more computing devices may be obtained, the storage organized based on a latch-free B-tree structure. A storage address of the object may be determined, based on accessing a mapping table that includes map indicators mapping logical object identifiers to physical storage addresses. A prepending of a first delta record to a prior object state of the object may be initiated, the first delta record indicating an object modification associated with the obtained request. Installation of a first state change associated with the object modification may be initiated via a first atomic operation on a mapping table entry that indicates the prior object state of the object. For example, the latch-free B-tree structure may include a B-tree like index structure over records as the objects, and logical page identifiers as the logical object identifiers.

    Abstract translation: 可以获得修改与一个或多个计算设备相关联的存储中的对象的请求，该存储是基于无闩锁B树结构组织的。 可以基于访问包括将逻辑对象标识符映射到物理存储地址的映射指示符的映射表来确定对象的存储地址。 可以启动对对象的先前对象状态的第一增量记录的前缀，所述第一增量记录指示与所获取的请求相关联的对象修改。 可以通过指示对象的先前对象状态的映射表项上的第一原子操作来启动与对象修改相关联的第一状态改变的安装。 例如，无闩锁B树结构可以包括作为对象的记录上的B树类索引结构，以及逻辑页标识符作为逻辑对象标识符。

    LOAD AWARE RESOURCE ALLOCATION IN WIRELESS NETWORKS
    59.
    发明申请
    LOAD AWARE RESOURCE ALLOCATION IN WIRELESS NETWORKS 有权
    在无线网络中加载资源分配

    公开(公告)号：US20090180431A1

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

    申请号：US12014760

    申请日：2008-01-15

    Applicant: Sudipta Sengupta ,  Minghua Chen ,  Ranveer Chandra

    Inventor： Sudipta Sengupta ,  Minghua Chen ,  Ranveer Chandra

    IPC: H04Q7/00 ,  G06T11/20

    CPC classification number: H04W72/0486 ,  H04W16/14 ,  H04W72/0446 ,  H04W72/0453 ,  H04W72/085

    Abstract: A technique for resource allocation in a wireless network (for example, an access point type wireless network), which supports concurrent communication on a band of channels, is provided. The technique includes accepting connectivity information for the network that supports concurrent communication on the band of channels. A conflict graph is generated from the connectivity information. The generated conflict graph models concurrent communication on the band of channels. A linear programming approach, which incorporates information form the conflict graph and rate requirements for nodes of the network, can be utilized to maximize throughput of the network.

    Abstract translation: 提供了一种支持在频带上并发通信的无线网络（例如，接入点型无线网络）中的资源分配技术。 该技术包括接收支持在频带上并发通信的网络的连接信息。 从连接信息生成冲突图。 生成的冲突图形模拟了频道上的并发通信。 可以利用线性规划方法，其中包含形成网络节点的冲突图和速率要求的信息，以最大化网络的吞吐量。

    Maximum-throughput routing of traffic in the hose model
    60.
    发明授权
    Maximum-throughput routing of traffic in the hose model 有权
    软管模型中流量的最大吞吐量路由

    公开(公告)号：US07558209B2

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

    申请号：US11414147

    申请日：2006-04-28

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

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

    IPC: G01R31/08 ,  H04L12/28

    CPC classification number: H04L45/00 ,  H04L45/14 ,  H04L45/62

    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: 一种计算机实现的方法，用于计算通过链路互连并具有至少一个入口点和至少一个出口点的节点网络的数据路由方案的吞吐量。 该方法包括：从第一线性程序和第二线性程序的组合中导出多项式大小的线性程序并求解多项式大小的线性程序。 第一个线性程序具有无穷大的约束，并且使进入点和出口点之间的路径中的链路的最大链路利用率最小化。 第二线性程序确定是否违反了第一线性程序的任何约束。

Patent Agency Ranking