Patents by Inventor Mohammad Hossein Bateni
Mohammad Hossein Bateni 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: 9098464Abstract: A method includes receiving demand information from edge routers, estimating an optimal request distribution based on the demand information using a bicriteria approximation algorithm, wherein initial programming states for the estimation are specified by (u, F, D, FS, DS, Fexp, Fimp), where u is a current node, F is a vector representing an available facility for large capacity, D is a vector representing an outsourced large client, FS is an amount of cache server capacity offered to small clients, DS is a total demand of outsourced small clients, Fexp is an index of a cache server being exported from a subtree, and Fimp is an index of another cache server of another subtree that is being utilized, and providing each of the edge routers with anycast route information for the cache servers.Type: GrantFiled: December 2, 2013Date of Patent: August 4, 2015Assignee: AT&T INTELLECTUAL PROPERTY II, L.P.Inventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni
-
Patent number: 8856071Abstract: Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.Type: GrantFiled: August 11, 2009Date of Patent: October 7, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Lukasz Golab, Mohammad Hossein Bateni, Mohammad Hajiaghayi, Howard Karloff
-
Publication number: 20140089522Abstract: A method includes receiving demand information from edge routers, estimating an optimal request distribution based on the demand information using a bicriteria approximation algorithm, wherein initial programming states for the estimation are specified by (u, F, D, FS, DS, Fexp, Fimp), where u is a current node, F is a vector representing an available facility for large capacity, D is a vector representing an outsourced large client, FS is an amount of cache server capacity offered to small clients, DS is a total demand of outsourced small clients, Fexp is an index of a cache server being exported from a subtree, and Fimp is an index of another cache server of another subtree that is being utilized, and providing each of the edge routers with anycast route information for the cache servers.Type: ApplicationFiled: December 2, 2013Publication date: March 27, 2014Inventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni
-
Patent number: 8670351Abstract: An example method involves for a first virtual private network (VPN) installed on a candidate hub router, selecting a first spoke-to-hub assignment solution having a first least memory utilization cost to assign the candidate hub router a quantity of first virtual private edge (VPE) routers serving the first VPN; for a second VPN installed on the candidate hub router, selecting a second spoke-to-hub assignment solution having a second least memory utilization cost to assign the candidate hub router a quantity of second VPE routers serving the second VPN; determining third least memory utilization costs to assign the candidate hub router to a quantity of the first VPE routers, and fourth least memory utilization costs to assign the candidate hub router to a quantity of the second VPE routers; and selecting the first or second spoke-to-hub assignment solution for the candidate hub router based on the least memory utilization costs.Type: GrantFiled: June 22, 2012Date of Patent: March 11, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Mohammad Hajiaghayi, Mohammad Hossein Bateni, Alexandre Gerber, Subhabrata Sen
-
Patent number: 8606964Abstract: A method includes receiving demand information from edge routers, estimating an optimal request distribution based on the demand information using a bicriteria approximation algorithm, wherein initial programming states for the estimation are specified by (u, F, D, FS, DS, Fexp, Fimp), where u is a current node, F is a vector representing an available facility for large capacity, D is a vector representing an outsourced large client, FS is an amount of cache server capacity offered to small clients, DS is a total demand of outsourced small clients, Fexp is an index of a cache server being exported from a subtree, and Fimp is an index of another cache server of another subtree that is being utilized, and providing each of the edge routers with anycast route information for the cache servers.Type: GrantFiled: October 16, 2012Date of Patent: December 10, 2013Assignee: AT&T Intellectual Property II, L.P.Inventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni
-
Publication number: 20130042021Abstract: A method includes receiving demand information from edge routers, estimating an optimal request distribution based on the demand information using a bicriteria approximation algorithm, wherein initial programming states for the estimation are specified by (u, F, D, FS, DS, Fexp, Fimp), where u is a current node, F is a vector representing an available facility for large capacity, D is a vector representing an outsourced large client, FS is an amount of cache server capacity offered to small clients, DS is a total demand of outsourced small clients, Fexp is an index of a cache server being exported from a subtree, and Fimp is an index of another cache server of another subtree that is being utilized, and providing each of the edge routers with anycast route information for the cache servers.Type: ApplicationFiled: October 16, 2012Publication date: February 14, 2013Applicant: AT&T INTELLECTUAL PROPERTY II, L.P.Inventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni
-
Patent number: 8316106Abstract: A system includes a plurality of edge routers and a route controller. The edge routers are configured to direct requests from a client system to one of a plurality of cache servers. Each of the cache servers is configured to provide content to the client system in response to the requests. The route controller is configured to receive demand information from the edge routers, estimate an optimal request distribution based on the demand information using a bicriteria approximation algorithm, and provide each of the edge routers with route information.Type: GrantFiled: December 5, 2008Date of Patent: November 20, 2012Assignee: AT&T Intellectual Property II, LPInventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni
-
Publication number: 20120275344Abstract: An example method involves for a first virtual private network (VPN) installed on a candidate hub router, selecting a first spoke-to-hub assignment solution having a first least memory utilization cost to assign the candidate hub router a quantity of first virtual private edge (VPE) routers serving the first VPN; for a second VPN installed on the candidate hub router, selecting a second spoke-to-hub assignment solution having a second least memory utilization cost to assign the candidate hub router a quantity of second VPE routers serving the second VPN; determining third least memory utilization costs to assign the candidate hub router to a quantity of the first VPE routers, and fourth least memory utilization costs to assign the candidate hub router to a quantity of the second VPE routers; and selecting the first or second spoke-to-hub assignment solution for the candidate hub router based on the least memory utilization costs.Type: ApplicationFiled: June 22, 2012Publication date: November 1, 2012Inventors: Mohammad Hajiaghayi, Mohammad Hossein Bateni, Alexandre Gerber, Subhabrata Sen
-
Patent number: 8218454Abstract: Methods and apparatus to implement scalable routing in network communication systems are disclosed. A disclosed example method involves selecting a plurality of virtual private networks in a communication network and selecting a candidate hub router from a plurality of routers in the communication network. The example method also involves determining a plurality of least memory utilization costs associated with assigning different quantities of spoke routers to the candidate hub router. Each of the least memory utilization costs and corresponding quantity of spoke routers is associated with a corresponding one of the plurality of virtual private networks. For each of the least memory utilization costs, a bandwidth usage of a corresponding one of the quantities of spoke routers is identified.Type: GrantFiled: September 21, 2009Date of Patent: July 10, 2012Assignee: AT&T Intellectual Property I, L.P.Inventors: Mohammad Hajiaghayi, Mohammad Hossein Bateni, Alexandre Gerber, Subhabrata Sen
-
Publication number: 20110069634Abstract: Methods and apparatus to implement scalable routing in network communication systems are disclosed. A disclosed example method involves selecting a plurality of virtual private networks in a communication network and selecting a candidate hub router from a plurality of routers in the communication network. The example method also involves determining a plurality of least memory utilization costs associated with assigning different quantities of spoke routers to the candidate hub router. Each of the least memory utilization costs and corresponding quantity of spoke routers is associated with a corresponding one of the plurality of virtual private networks. For each of the least memory utilization costs, a bandwidth usage of a corresponding one of the quantities of spoke routers is identified.Type: ApplicationFiled: September 21, 2009Publication date: March 24, 2011Inventors: Mohammad Hajiaghayi, Mohammad Hossein Bateni, Alexandre Gerber, Subhabrata Sen
-
Publication number: 20110040727Abstract: Data tables in data warehouses are updated to minimize staleness and stretch of the data tables. New data is received from external sources and, in response, update requests are generated. Accumulated update requests may be batched. Data tables may be weighted to affect the order in which update requests are serviced.Type: ApplicationFiled: August 11, 2009Publication date: February 17, 2011Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Lukasz Golab, Mohammad Hossein Bateni, Mohammad Hajiaghayi, Howard Karloff
-
Publication number: 20100146038Abstract: A system includes a plurality of edge routers and a route controller. The edge routers are configured to direct requests from a client system to one of a plurality of cache servers. Each of the cache servers is configured to provide content to the client system in response to the requests. The route controller is configured to receive demand information from the edge routers, estimate an optimal request distribution based on the demand information using a bicriteria approximation algorithm, and provide each of the edge routers with route information.Type: ApplicationFiled: December 5, 2008Publication date: June 10, 2010Applicant: AT&T CORP.Inventors: Mohammad Taghi Hajiaghayi, Mohammad Hossein Bateni