Patents by Inventor Shahrokh Sadjadi
Shahrokh Sadjadi 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: 10394821Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: GrantFiled: August 31, 2016Date of Patent: August 27, 2019Assignee: Cisco Technology, Inc.Inventors: Ying Liu, Shahrokh Sadjadi
-
Publication number: 20160371338Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: ApplicationFiled: August 31, 2016Publication date: December 22, 2016Inventors: Ying Liu, Shahrokh Sadjadi
-
Patent number: 9449071Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: GrantFiled: July 9, 2013Date of Patent: September 20, 2016Assignee: Cisco Technology, Inc.Inventors: Ying Liu, Shahrokh Sadjadi
-
Patent number: 8745707Abstract: Techniques for concurrent access to a resource object, such as a database object, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.Type: GrantFiled: January 14, 2005Date of Patent: June 3, 2014Assignee: Cisco Technology, Inc.Inventor: Shahrokh Sadjadi
-
Publication number: 20130297609Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: ApplicationFiled: July 9, 2013Publication date: November 7, 2013Inventors: YING LIU, Shahrokh Sadjadi
-
Patent number: 8484212Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: GrantFiled: January 21, 2011Date of Patent: July 9, 2013Assignee: Cisco Technology, Inc.Inventors: Ying Liu, Shahrokh Sadjadi
-
Publication number: 20120191678Abstract: In an embodiment, a method comprises dividing collected data into data clusters based on proximity of the data and adjusting the clusters based on density of data in individual clusters. Based on first data points in a first cluster, a first average point in the first cluster is determined. Based on second data points in a second cluster, a second average point in the second cluster is determined. Aggregate data, comprising the first average point and the second average point, are stored in storage. Upon receiving a request to provide data for a particular coordinate, the reconstructed data point is determined by interpolating between the first average point and the second average point at the particular coordinate. Accordingly, aggregated data may be stored and when a request specifies data that was not actually stored, a reconstructed data point with an approximated data value may be provided as a substitute.Type: ApplicationFiled: January 21, 2011Publication date: July 26, 2012Inventors: Ying Liu, Shahrokh Sadjadi
-
Patent number: 7743146Abstract: A method of controlling concurrent users of a distributed resource on a network is disclosed. In one aspect, there are one or more local lock managers executing on corresponding hosts and cooperating as a distributed lock manager. The resource is limited to a maximum number of concurrent users. A user identification for each user is associated with one host. In response to a request associated with a particular user associated with a first host, a lock is requested from a first local lock manager process executing on the first host. A related method of handling a request for a count-limited resource includes receiving a request from a client process for the computer resource. If it is determined that the request exceeds a maximum count for the resource, then it is determined whether a current time is within a retry time period of the client's first request.Type: GrantFiled: December 19, 2007Date of Patent: June 22, 2010Assignee: Cisco Technology, Inc.Inventor: Shahrokh Sadjadi
-
Patent number: 7483889Abstract: In one embodiment, a method for persistent data authorization includes receiving a query at a management device and identifying authorization constraints at the management device utilizing an authorization model. The authorization model includes at least one group hierarchy defining authorization based on a relationship between levels in the hierarchy. The query is modified based on the authorization constraints and the modified query is sent to the database. Data is received in response to the modified query and is configured for transmission from the management device without further filtering. The query received at the management device and the modified query are both configured for communication directly with the database with no modification to the database required for the modified query. A system and apparatus for persistent data authorization are also disclosed.Type: GrantFiled: December 1, 2006Date of Patent: January 27, 2009Assignee: Cisco Technology, Inc.Inventors: Alex Wang, Shahrokh Sadjadi
-
Publication number: 20080162481Abstract: A method of controlling concurrent users of a distributed resource on a network is disclosed. In one aspect, there are one or more local lock managers executing on corresponding hosts and cooperating as a distributed lock manager. The resource is limited to a maximum number of concurrent users. A user identification for each user is associated with one host. In response to a request associated with a particular user associated with a first host, a lock is requested from a first local lock manager process executing on the first host. A related method of handling a request for a count-limited resource includes receiving a request from a client process for the computer resource. If it is determined that the request exceeds a maximum count for the resource, then it is determined whether a current time is within a retry time period of the client's first request.Type: ApplicationFiled: December 19, 2007Publication date: July 3, 2008Applicant: Cisco Technology, Inc.Inventor: Shahrokh Sadjadi
-
Publication number: 20080133530Abstract: In one embodiment, a method for persistent data authorization includes receiving a query at a management device and identifying authorization constraints at the management device utilizing an authorization model. The authorization model includes at least one group hierarchy defining authorization based on a relationship between levels in the hierarchy. The query is modified based on the authorization constraints and the modified query is sent to the database. Data is received in response to the modified query and is configured for transmission from the management device without further filtering. The query received at the management device and the modified query are both configured for communication directly with the database with no modification to the database required for the modified query. A system and apparatus for persistent data authorization are also disclosed.Type: ApplicationFiled: December 1, 2006Publication date: June 5, 2008Applicant: CISCO TECHNOLOGY, INC.Inventors: Alex Wang, Shahrokh Sadjadi
-
Patent number: 7328263Abstract: A method of controlling concurrent users of a distributed resource on a network is disclosed. In one aspect, there are one or more local lock managers executing on corresponding hosts and cooperating as a distributed lock manager. The resource is limited to a maximum number of concurrent users. A user identification for each user is associated with one host. In response to a request associated with a particular user associated with a first host, a lock is requested from a first local lock manager process executing on the first host. A related method of handling a request for a count-limited resource includes receiving a request from a client process for the computer resource. If it is determined that the request exceeds a maximum count for the resource, then it is determined whether a current time is within a retry time period of the client's first request.Type: GrantFiled: January 30, 2001Date of Patent: February 5, 2008Assignee: Cisco Technology, Inc.Inventor: Shahrokh Sadjadi
-
Publication number: 20050138375Abstract: Techniques for concurrent access to a resource object, such as a database object, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.Type: ApplicationFiled: January 14, 2005Publication date: June 23, 2005Inventor: Shahrokh Sadjadi
-
Patent number: 6850938Abstract: Techniques for concurrent access to a resource object, such as a database, include generating a lock data structure for a particular resource object. The lock data structure includes data values for a resource object identification, a lock type, and a version number. The version number is related to a number of changes to the resource object since the lock data structure was generated. A request is received from a requesting process. The request is for a requested lock type for access to the particular resource object. It is determined whether to grant the request based on the requested lock type and the lock type in the lock data structure. By carrying a lock version number in a lock data structure managed by a lock manager, improved optimistic locking is provided in a database. In particular, the approach enables introduction of optimistic locking to a legacy database without requiring burdensome changes to a database table schema.Type: GrantFiled: February 8, 2001Date of Patent: February 1, 2005Assignee: Cisco Technology, Inc.Inventor: Shahrokh Sadjadi