Patents by Inventor Aleksandr Stolyar
Aleksandr Stolyar 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: 10536578Abstract: A method for mapping ready agents to incoming transactions has steps for (a) placing incoming transactions in a first queue managed by software executing from a machine-readable medium on a computerized appliance; (b) issuing a determined number of invitations in a period of time to agents known to be available to consider an invitation to interact with an incoming transaction; (c) placing identification of ready agents, who have accepted an invitation to interact, in a second queue managed by the software; (d) mapping transactions from the first queue to agents from the second queue; (e) monitoring changes in state of both the first and the second queues in the time period; and (f) adjusting determined number of invitations in step (b) in a manner to drive a chosen system performance metric toward a desired target value.Type: GrantFiled: April 3, 2018Date of Patent: January 14, 2020Inventors: Aleksandr Stolyar, Martin Ira Reiman, Nikolay Korolev, Vladimir Mezhibovsky, Herbert Willi Artur Ristock
-
Publication number: 20180227422Abstract: A method for mapping ready agents to incoming transactions has steps for (a) placing incoming transactions in a first queue managed by software executing from a machine-readable medium on a computerized appliance; (b) issuing a determined number of invitations in a period of time to agents known to be available to consider an invitation to interact with an incoming transaction; (c) placing identification of ready agents, who have accepted an invitation to interact, in a second queue managed by the software; (d) mapping transactions from the first queue to agents from the second queue; (e) monitoring changes in state of both the first and the second queues in the time period; and (f) adjusting determined number of invitations in step (b) in a manner to drive a chosen system performance metric toward a desired target value.Type: ApplicationFiled: April 3, 2018Publication date: August 9, 2018Inventors: Aleksandr Stolyar, Martin Ira Reiman, Nikolay Korolev, Vladimir Mezhibovsky, Herbert Willi Artur Ristock
-
Patent number: 9955012Abstract: A method for mapping ready agents to incoming transactions has steps for (a) placing incoming transactions in a first queue managed by software executing from a machine-readable medium on a computerized appliance; (b) issuing a determined number of invitations in a period of time to agents known to be available to consider an invitation to interact with an incoming transaction; (c) placing identification of ready agents, who have accepted an invitation to interact, in a second queue managed by the software; (d) mapping transactions from the first queue to agents from the second queue; (e) monitoring changes in state of both the first and the second queues in the time period; and (f) adjusting determined number of invitations in step (b) in a manner to drive a chosen system performance metric toward a desired target value.Type: GrantFiled: February 23, 2010Date of Patent: April 24, 2018Assignee: GENESYS TELECOMMUNICATIONS LABORATORIES, INC.Inventors: Aleksandr Stolyar, Martin Ira Reiman, Nikolay Korolev, Vladimir Mezhibovsky, Herbert Ristock
-
Patent number: 9525727Abstract: Various embodiments relate to a method, device, and machine-readable storage medium including: receiving a work request for distribution among a plurality of servers; selecting a server of the plurality to receive the work request including: determining whether at least one of the plurality of servers has previously indicated a capacity for additional work, and when at least one has indicated such capacity, selecting the server from a set of servers identified from the plurality as having previously indicated a capacity for additional work; and transmitting the work request to the server. Various embodiments relate to a method, device, and machine-readable storage medium including: maintaining and processing a plurality of requests; determining, based on the plurality of requests, that the server has capacity to process at least one additional request; selecting a load distributor from a plurality of load distributors; and transmitting an indication of capacity to the load distributor.Type: GrantFiled: June 10, 2014Date of Patent: December 20, 2016Assignee: Alcatel LucentInventors: Aleksandr Stolyar, Thomas Woo
-
Patent number: 9405588Abstract: Assigning virtual machines to host machines in a cloud computing arrangement includes at least one of several techniques that facilitate reducing or minimizing the number of host machines serving virtual machines. One technique includes using place holders in place of a virtual machine that vacates a host machine. The place holders indicate the type of vacated virtual machine and are replaced with a new virtual machine request of a corresponding type. Another technique includes a greedy assignment algorithm for identifying a host machine for a new virtual machine request that will yield an optimized increment to a value of a function that corresponds to a current cloud resource allocation. One technique includes using a modified version of a derivative of the function used in the greedy assignment algorithm, with the modification depending on a number of virtual machines in the cloud system at the time of the new request.Type: GrantFiled: May 18, 2012Date of Patent: August 2, 2016Assignee: Alcatel LucentInventor: Aleksandr Stolyar
-
Patent number: 9378503Abstract: Example embodiments are directed to methods of routing requests within a system having a plurality of server pools. At least one of the methods provides a method of routing requests within a system having a plurality of server pools. The method includes receiving a request at the system, first determining a first value associated with a first request type of the received request and second determining a probability of routing based on the first value and a probability of rerouting. The first value is a virtual queue value for requests of the first request type. The second determining is performed without determining an input rate at which the requests of the first request type are received. The received request is routed to at least one of the plurality of server pools based on the probability of routing.Type: GrantFiled: June 30, 2010Date of Patent: June 28, 2016Assignee: Alcatel LucentInventor: Aleksandr Stolyar
-
Patent number: 9286134Abstract: Methods and apparatuses for real-time adaptive placement of a virtual machine are provided. In an embodiment, a virtual machine is received at a routing component, the routing component having a processor in communication with a memory. By the processor in communication with the memory, a target data center is determined from a plurality of data centers based on a data center index, and the virtual machine is routed to the target data center. A physical machine is chosen within the target data center for placing the virtual machine.Type: GrantFiled: December 31, 2012Date of Patent: March 15, 2016Assignee: Alcatel LucentInventors: Yang Guo, Aleksandr Stolyar, Anwar Walid
-
Patent number: 9253101Abstract: Methods are provided for metering the usage, on a group of lines subject to a group user agreement, of the data processing capacity of a network. Implementations include steps of receiving usage reports from respective lines of the group at least when usage quotas granted to the lines are exhausted; maintaining a total, over the group, of usage that has been reported by the lines and of outstanding usage quotas that have been granted to the lines; and maintaining a comparison between the total outstanding group quota and a limit that depends on the total reported group usage, so as to detect violation events when said quota violates the limit. Upon occurrence of violation events, instructions for the processors serving respective lines to reallocate quota are sent selectively.Type: GrantFiled: October 17, 2012Date of Patent: February 2, 2016Assignee: Alcatel LucentInventors: Yigal Bejerano, Pramod Koppol, John Reid, Daniel Andrews, Aleksandr Stolyar, Sreedhar Rao
-
Publication number: 20150358402Abstract: Various embodiments relate to a method, device, and machine-readable storage medium including: receiving a work request for distribution among a plurality of servers; selecting a server of the plurality to receive the work request including: determining whether at least one of the plurality of servers has previously indicated a capacity for additional work, and when at least one has indicated such capacity, selecting the server from a set of servers identified from the plurality as having previously indicated a capacity for additional work; and transmitting the work request to the server. Various embodiments relate to a method, device, and machine-readable storage medium including: maintaining and processing a plurality of requests; determining, based on the plurality of requests, that the server has capacity to process at least one additional request; selecting a load distributor from a plurality of load distributors; and transmitting an indication of capacity to the load distributor.Type: ApplicationFiled: June 10, 2014Publication date: December 10, 2015Inventors: Aleksandr Stolyar, Thomas Woo
-
Patent number: 9131371Abstract: There is provided a method and apparatus for managing a random access communication system. More specifically, there is provided calculating a first value representative of a transmission success rate between first and second wireless nodes, wherein the transmissions from the first node create interference at a third node, calculating a second value representative of a transmission success rate for transmissions between one or more other nodes and the third node, and setting an access attempt percentage for the first node based on the first value and the second value.Type: GrantFiled: September 30, 2005Date of Patent: September 8, 2015Assignee: Alcatel LucentInventors: Piyush Gupta, Aleksandr Stolyar
-
Publication number: 20140189707Abstract: Methods and apparatuses for real-time adaptive placement of a virtual machine are provided. In an embodiment, a virtual machine is received at a routing component, the routing component having a processor in communication with a memory. By the processor in communication with the memory, a target data center is determined from a plurality of data centers based on a data center index, and the virtual machine is routed to the target data center. A physical machine is chosen within the target data center for placing the virtual machine.Type: ApplicationFiled: December 31, 2012Publication date: July 3, 2014Applicant: ALCATEL-LUCENT USA INC.Inventors: Yang Guo, Aleksandr Stolyar, Anwar Walid
-
Patent number: 8730923Abstract: A resource allocation algorithm identifies a resource hogger in a wireless communication system data sharing arrangement and control shared resource overuse by the resource hogger. In one embodiment, the base station for a given sector in the system tracks the time-slot usage of each active user in the sector. If the usage for any user reaches a predetermined hogger threshold, normal target QoS enforcement is suspended for that user to allow more time slots to be allocated to the other, non-hogger users. When the resource hogger user's usage falls below the threshold, target QoS enforcement is returned to that user. Temporarily suspending target QoS enforcement for resource hoggers and allocating the remaining resources to other users prevents resource hoggers from deteriorating performance of the entire system.Type: GrantFiled: June 11, 2003Date of Patent: May 20, 2014Assignee: Alcatel LucentInventors: Daniel Matthew Andrews, Qi Bi, Frances Jiang, Aleksandr Stolyar, Yang Yang
-
Publication number: 20140105018Abstract: Methods are provided for metering the usage, on a group of lines subject to a group user agreement, of the data processing capacity of a network. Implementations include steps of receiving usage reports from respective lines of the group at least when usage quotas granted to the lines are exhausted; maintaining a total, over the group, of usage that has been reported by the lines and of outstanding usage quotas that have been granted to the lines; and maintaining a comparison between the total outstanding group quota and a limit that depends on the total reported group usage, so as to detect violation events when said quota violates the limit. Upon occurrence of violation events, instructions for the processors serving respective lines to reallocate quota are sent selectively.Type: ApplicationFiled: October 17, 2012Publication date: April 17, 2014Applicant: Alcatel-Lucent USA Inc.Inventors: Daniel M. Andrews, Pramod Koppol, John B. Reid, Yigal Bejerano, Aleksandr Stolyar, Sridhar Sripathi
-
Publication number: 20130311662Abstract: Assigning virtual machines to host machines in a cloud computing arrangement includes at least one of several techniques that facilitate reducing or minimizing the number of host machines serving virtual machines. One technique includes using place holders in place of a virtual machine that vacates a host machine. The place holders indicate the type of vacated virtual machine and are replaced with a new virtual machine request of a corresponding type. Another technique includes a greedy assignment algorithm for identifying a host machine for a new virtual machine request that will yield an optimized increment to a value of a function that corresponds to a current cloud resource allocation. One technique includes using a modified version of a derivative of the function used in the greedy assignment algorithm, with the modification depending on a number of virtual machines in the cloud system at the time of the new request.Type: ApplicationFiled: May 18, 2012Publication date: November 21, 2013Inventor: Aleksandr Stolyar
-
Patent number: 8516085Abstract: Systems and techniques to set a new service rate for one or more queues of a router and a new power consumption level for a router is disclosed. The queues are configured to store data packets awaiting transmission from the router. The setting of the new service rate or rates and new power level is based on a service rate of the one or more queues and a power consumption level of the router. The techniques disclosed further include resetting a new service rate for the one or more queues of the router and a new power consumption level of the router. The resetting of the new service rate or rates and new power level is based on a service rate of the one or more queues and a power consumption level of the router. The setting and resetting steps are based differently on the power consumption level of the router.Type: GrantFiled: March 7, 2005Date of Patent: August 20, 2013Assignee: Alcatel LucentInventor: Aleksandr Stolyar
-
Patent number: 8411624Abstract: A method of dynamic resource allocations in wireless network is disclosed. The method provides that a base station in the network allocates resources to users independently of other base stations and without resource planning. Resource allocations are done based at least in part on a local optimization objective and a channel quality indicator from one or more users, and result in efficient resource reuse.Type: GrantFiled: July 1, 2009Date of Patent: April 2, 2013Assignee: Alcatel LucentInventors: Aleksandr Stolyar, Harish Viswanathan
-
Patent number: 8295231Abstract: A method of dynamic resource allocations in wireless network is disclosed. The method provides that a base station in the network allocates resources to users independently of other base stations and without resource planning. Resource allocations are done based at least in part on a local optimization objective and a channel quality indicator from one or more users, and result in efficient resource reuse.Type: GrantFiled: June 28, 2007Date of Patent: October 23, 2012Assignee: Alcatel LucentInventors: Aleksandr Stolyar, Harish Viswanathan
-
Publication number: 20120005370Abstract: Example embodiments are directed to methods of routing requests within a system having a plurality of server pools. At least one of the methods provides a method of routing requests within a system having a plurality of server pools. The method includes receiving a request at the system, first determining a first value associated with a first request type of the received request and second determining a probability of routing based on the first value and a probability of rerouting. The first value is a virtual queue value for requests of the first request type. The second determining is performed without determining an input rate at which the requests of the first request type are received. The received request is routed to at least one of the plurality of server pools based on the probability of routing.Type: ApplicationFiled: June 30, 2010Publication date: January 5, 2012Inventor: Aleksandr Stolyar
-
Patent number: 8027327Abstract: An apparatus includes a first node configured to transmit both data frames and requests for channel reservations to a local contention neighborhood of a network. The first node is configured to compete with other nodes of the neighborhood for reservations to the channel. The first node is configured to dynamically update a stored value of an access priority for the first node and to transmit said requests with a rate that depends on the stored value.Type: GrantFiled: June 25, 2004Date of Patent: September 27, 2011Assignee: Alcatel LucentInventors: Piyush Gupta, Yogesh Sankarasubramaniam, Aleksandr Stolyar
-
Publication number: 20110077016Abstract: Embodiments are described herein to provide an efficient, adaptive and distributed approach to wireless resource allocation that seeks to maximize system capacity and/or coverage on the reverse link. The general approach is for each cell (sector) base station to allocate (102) its mobile units to frequency subbands based on a local optimization objective. This objective takes into account the performance “costs” to the neighboring cells/sectors of transmissions by different mobile units in different subbands. An example of such an optimization objective can be the maximization of the “utility” of user transmission rates within the sector minus the cost of the transmissions to neighboring cells/sectors.Type: ApplicationFiled: September 30, 2009Publication date: March 31, 2011Inventors: Aleksandr Stolyar, Harish Viswanathan