Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Lahiri, WA

Parantap Lahiri, Redmond, WA US

Patent application numberDescriptionPublished
20090089438INTELLIGENT NETWORK ADDRESS LOOKUP SERVICE - An intelligent lookup service for a network is provided for clients of a network requesting services of the network that intelligently determines, based on a service requirement of the requested service, optimal service endpoint(s) for providing the requested service. The intelligent lookup service can incorporate predetermined mapping policy and traffic measurements into the determination. In addition, a feedback loop is provided from clients and/or service endpoints to the lookup service concerning measurements about prior connections in the network. The lookup service can include a set of beacons distributed in the network and against which measurements about the network are recorded. A client receives, from the lookup service in response to a request for a network address, a set of candidate service endpoints that pertain to the requested network address and the client connects to one of the candidate service endpoints based on policy or context.04-02-2009
20090303880DATA CENTER INTERCONNECT AND TRAFFIC ENGINEERING - A system for commoditizing data center networking is disclosed. The system includes an interconnection topology for a data center having a plurality of servers and a plurality of nodes of a network in the data center through which data packets may be routed. The system uses a routing scheme where the routing is oblivious to the traffic pattern between nodes in the network, and wherein the interconnection topology contains a plurality of paths between one or more servers. The multipath routing may be Valiant load balancing. It disaggregates the function of load balancing into a group of regular servers, with the result that load balancing server hardware can be distributed amongst racks in the data center leading to greater agility and less fragmentation. The architecture creates a huge, flexible switching domain, supporting any server/any service, full mesh agility, and unregimented server capacity at low cost.12-10-2009
20090307334DATA CENTER WITHOUT STRUCTURAL BOTTLENECKS - A method of networking a plurality of servers together within a data center is disclosed. The method includes the step of addressing a data packet for delivery to a destination server by providing the destination server address as a flat address. The method further includes the steps of obtaining routing information required to route the packet to the destination server. This routing information may be obtained from a directory service servicing the plurality of servers. Once the routing information is obtained, the data packet may be routed to the destination server according to the flat address of the destination server and routing information obtained from the directory service.12-10-2009
20090319688PARTICIPATING IN CLOUD AS TOTALLY STUBBY EDGE - A Totally Stubby Edge (TSE) participates in a cloud under the condition that the TSE may select paths for frames that the TSE introduces to the cloud, but may not transit frames between nodes in the cloud. The edge submits, to an administrator of the cloud, a request to join the cloud. If the administrator allows the request, then the edge is given access to the address tables that define the structure of the cloud, and may insert itself into the structure. The edge may use the address tables to select paths for frames that the edge introduces to the cloud. Normally path decisions are made by devices that the administrator trusts and controls. However, since the TSE selects paths for its own frames but does not transit frames between other nodes in the cloud, the TSE may select paths even if it is untrusted by the administrator.12-24-2009
20100036903DISTRIBUTED LOAD BALANCER - Systems and methods that distribute load balancing functionalities in a data center. A network of demultiplexers and load balancer servers enable a calculated scaling and growth operation, wherein capacity of load balancing operation can be adjusted by changing the number of load balancer servers. Accordingly, load balancing functionality/design can be disaggregated to increase resilience and flexibility for both the load balancing and switching mechanisms of the data center.02-11-2010
20100080144RESILIENT 1:N FIRST-HOP GATEWAY SELECTION MECHANISM - 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.04-01-2010
20100306408AGILE DATA CENTER NETWORK ARCHITECTURE - This patent application relates to an agile network architecture that can be employed in data centers, among others. One implementation provides a virtual layer-2 network connecting machines of a layer-3 infrastructure.12-02-2010
20100318609BRIDGING ENTERPRISE NETWORKS INTO CLOUD - An enterprise namespace may be extended into a cloud of networked resources. A portion of the cloud may be dynamically partitioned, and the extension of the enterprise namespace established within the portion. Cloud resources thus remain as easily accessible to enterprise users as those which are physically located on the enterprise network. Thus, components such as applications, virtual machine instantiations, application states, server states, etc., may be easily migrated between the enterprise network and the cloud.12-16-2010

Shuvendu K. Lahiri, Redmond, WA US

Patent application numberDescriptionPublished
20100169868Unifying Type Checking and Property Checking for Low Level Programs - This document describes a unified type checker and property checker for a low level program's heap and its types. The type checker can use the full power of the property checker to express and verify subtle, program specific type and memory safety invariants well beyond what the native low level program system can check. Meanwhile, the property checker can rely on the type checker to provide structure and disambiguation for the program's heap, enabling more concise and more powerful type-based specifications. This approach makes use of a fully automated Satisfiability Modulo Theories (SMT) solver and a decision procedure for checking type safety, which means that the programmer's only duty is to provide high-level type and property annotations as part of the original program's source.07-01-2010

Patent applications by Shuvendu K. Lahiri, Redmond, WA US

Shuvendu Kumar Lahiri, Redmond, WA US

Patent application numberDescriptionPublished
20110314454INCREMENTAL COMPOSITIONAL DYNAMIC TEST GENERATION - Concepts and technologies are described herein for incremental compositional dynamic test generation. The concepts and technologies described herein are used to increase the code coverage and security vulnerability identification abilities of testing applications and devices, without significantly increasing, and in some cases decreasing, computational and time costs associated with the testing. Test summaries that describe how code is tested by a test engine are generated and stored during testing of code. These test summaries can be evaluated when additional iterations or versions of the code are tested. If functions corresponding to the test summaries are unchanged from, or logically equivalent to, a version of the function previously tested, the test summary may be used when testing the new version of the code.12-22-2011