Patents by Inventor Pritam De
Pritam De has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9270585Abstract: A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.Type: GrantFiled: January 24, 2011Date of Patent: February 23, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Todd R. Manion, Kevin Charles Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Brian R. Lieuallen, Pritam De, Sandeep Kishan Singhal
-
Patent number: 8977686Abstract: Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.Type: GrantFiled: April 3, 2012Date of Patent: March 10, 2015Assignee: Microsoft CorporationInventors: Todd R. Manion, Kevin C. Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Travis C. Luke, Upshur W. Parks, Brian R. Lieuallen, Pritam De, Pallavi Choudhury
-
Patent number: 8645967Abstract: Secure marshaling of data via one or more intermediate processes is provided. A source process may create a named shared memory section resulting in a first handle to the shared memory section. The source process may populate the shared memory section with information. An access control list may secure the shared memory section by preventing the one or more intermediate processes from accessing content of the shared memory section, while allowing a target process to access the content. The first handle and a name of the shared memory section may be marshaled to a first intermediate process resulting in a respective new handle to the shared memory section. A last intermediate process may marshal the name to a target process, which may use the name to obtain access to the content of the shared memory section.Type: GrantFiled: August 30, 2011Date of Patent: February 4, 2014Assignee: Microsoft CorporationInventors: Charles Alan Ludwig, Joaquin Guanter Gonzalbez, Pritam De
-
Publication number: 20130054917Abstract: Secure marshaling of data via one or more intermediate processes is provided. A source process may create a named shared memory section resulting in a first handle to the shared memory section. The source process may populate the shared memory section with information. An access control list may secure the shared memory section by preventing the one or more intermediate processes from accessing content of the shared memory section, while allowing a target process to access the content. The first handle and a name of the shared memory section may be marshaled to a first intermediate process resulting in a respective new handle to the shared memory section. A last intermediate process may marshal the name to a target process, which may use the name to obtain access to the content of the shared memory section.Type: ApplicationFiled: August 30, 2011Publication date: February 28, 2013Applicant: MICROSOFT CORPORATIONInventors: Charles Alan Ludwig, Joaquin Guanter Gonzalbez, Pritam De
-
Publication number: 20120203835Abstract: Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.Type: ApplicationFiled: April 3, 2012Publication date: August 9, 2012Applicant: MICROSOFT CORPORATIONInventors: Todd R. Manion, Kevin C. Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Travis C. Luke, Upshur W. Parks, Brian R. Lieuallen, Pritam De, Pallavi Choudhury
-
Patent number: 8161095Abstract: Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.Type: GrantFiled: March 12, 2007Date of Patent: April 17, 2012Assignee: Microsoft CorporationInventors: Todd R. Manion, Kevin C. Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Travis C. Luke, Upshur W. Parks, Brian R. Lieuallen, Pritam De, Pallavi Choudhury
-
Publication number: 20110119400Abstract: A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.Type: ApplicationFiled: January 24, 2011Publication date: May 19, 2011Applicant: MICROSOFT CORPORATIONInventors: Todd R. Manion, Kevin Charles Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Brian R. Lieuallen, Pritam De, Sandeep Kishan Singhal
-
Patent number: 7895345Abstract: A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.Type: GrantFiled: April 13, 2007Date of Patent: February 22, 2011Assignee: Microsoft CorporationInventors: Todd R. Manion, Kevin Charles Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Brian R. Lieuallen, Pritam De, Sandeep Kishan Singhal
-
Publication number: 20080253306Abstract: A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate.Type: ApplicationFiled: April 13, 2007Publication date: October 16, 2008Applicant: Microsoft CorporationInventors: Todd R. Manion, Kevin Charles Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Brian R. Lieuallen, Pritam De, Sandeep Kishan Singhal
-
Publication number: 20080225860Abstract: Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched.Type: ApplicationFiled: March 12, 2007Publication date: September 18, 2008Applicant: Microsoft CorporationInventors: Todd R. Manion, Kevin C. Ransom, Jeremy L. Dewey, Scott A. Senkeresty, Travis C. Luke, Upshur W. Parks, Brian R. Lieuallen, Pritam De, Pallavi Choudhury
-
Publication number: 20050289244Abstract: The invention relates to a method, system, network node and computer program for processing packet data in a communication network, which comprises at least a first network node. In the method a first packet is received at the first network node. In the first network node is assigned for the first packet a chain comprising at least two logical service entities based on at least one service determination rule. A data unit comprising at least part of the first packet is formed. The data unit is processed in at least one logical service entity in the chain and a second packet is transmitted from the first network node comprising data sent by at least one logical service entity in the chain. The benefits of the invention relate to improved flexibility in introducing new value-added service for packet data and improved performance in the first network node.Type: ApplicationFiled: June 28, 2004Publication date: December 29, 2005Inventors: Himansu Sahu, Pritam De, Shashank Merchant, Gopi Krishna