Patents by Inventor Gueyoung Jung

Gueyoung Jung 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: 10567487
    Abstract: Concepts and technologies are disclosed herein for an application deployment engine. A processor that executes an application deployment engine can receive an application request. The processor can obtain network topology data that indicates availability of resources of a data center, an application template associated with the application, and a running time during which an application placement plan is to be identified out of a large number of placement scenarios within the running time. The application template can describe an application flow path associated with the application. The processor can identify the application placement plan, where the application placement plan can include an optimal placement of the application at the data center, before a given running time expires by pruning the large search space. The processor can generate a command to effect deployment of the application in accordance with the application placement plan.
    Type: Grant
    Filed: October 8, 2018
    Date of Patent: February 18, 2020
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Gueyoung Jung, Kaustubh Joshi, Matti A. Hiltunen, Richard D. Schlichting
  • Publication number: 20200012513
    Abstract: Virtual redundancy for active-standby cloud applications is disclosed herein. A virtual machine (“VM”) placement scheduling system is disclosed herein. The system can compute, for each standby VM of a plurality of available standby VMs, a minimum required placement overlap delta to meet an entitlement assurance rate (“EAR”) threshold. The system can compute a minimum number of available VM slots for activating each standby VM to meet the EAR threshold. For each standby VM of a given application, the system can filter out any server of a plurality of servers that does not meet criteria. If a given server meets the criteria, the system can add the given server to a candidate list; sort, in descending order, the candidate list by the minimum required placement overlap delta and the number of available virtual machine slots; and select, from the candidate list of servers, a candidate server from atop the candidate list.
    Type: Application
    Filed: September 16, 2019
    Publication date: January 9, 2020
    Applicants: AT&T Intellectual Property I, L.P., The Regents of the University of Colorado, a Body Corporate
    Inventors: Gueyoung Jung, Kaustubh Joshi, Sangtae Ha
  • Publication number: 20190364116
    Abstract: The concepts and technologies disclosed herein are directed to a policy-driven homing service system that can receive, from a master service orchestrator, a demand specifying a service component to be used to provide, at least in part, a service. The system can receive, from a policy system, a homing constraint. The system can determine, for the demand, an initial set of all potential candidates. The system can apply the homing constraint to each potential candidate in the initial set of all potential candidates. The system can determine a resultant set of potential solutions that satisfy the homing constraint. The system can determine a best solution from the resultant set of potential solutions. The system can send the best solution to the master service orchestrator, which instantiates the demand based upon the best solution.
    Type: Application
    Filed: May 22, 2018
    Publication date: November 28, 2019
    Applicant: AT&T Intellectual Property I, L.P.
    Inventors: Matti Hiltunen, Gueyoung Jung, Shankaranarayanan Puzhavakath Narayanan, Joseph D'Andrea, III, Kaustubh Joshi
  • Patent number: 10476748
    Abstract: A method includes, for components of an application, identifying a plurality of groups including a first group and a second group, The method also includes nesting the first group into the second group to create a nested group, based at least on a level of the first group not exceeding a level of the second group. The method includes deploying the application by placing the components of the nested group within a network in accordance with a restriction of the nested group. The components include at least one virtual machine.
    Type: Grant
    Filed: March 1, 2017
    Date of Patent: November 12, 2019
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Matti Hiltunen, Gueyoung Jung, Joseph D'Andrea, III, Kaustubh Joshi
  • Patent number: 10417035
    Abstract: Virtual redundancy for active-standby cloud applications is disclosed herein. A virtual machine (“VM”) placement scheduling system is disclosed herein. The system can compute, for each standby VM of a plurality of available standby VMs, a minimum required placement overlap delta to meet an entitlement assurance rate (“EAR”) threshold. The system can compute a minimum number of available VM slots for activating each standby VM to meet the EAR threshold. For each standby VM of a given application, the system can filter out any server of a plurality of servers that does not meet criteria. If a given server meets the criteria, the system can add the given server to a candidate list; sort, in descending order, the candidate list by the minimum required placement overlap delta and the number of available virtual machine slots; and select, from the candidate list of servers, a candidate server from atop the candidate list.
    Type: Grant
    Filed: December 20, 2017
    Date of Patent: September 17, 2019
    Assignees: AT&T Intellectual Property I, L.P., The Regents of the University of Colorado, A Body Corporate
    Inventors: Gueyoung Jung, Kaustubh Joshi, Sangtae Ha
  • Publication number: 20190188022
    Abstract: Virtual redundancy for active-standby cloud applications is disclosed herein. A virtual machine (“VM”) placement scheduling system is disclosed herein. The system can compute, for each standby VM of a plurality of available standby VMs, a minimum required placement overlap delta to meet an entitlement assurance rate (“EAR”) threshold. The system can compute a minimum number of available VM slots for activating each standby VM to meet the EAR threshold. For each standby VM of a given application, the system can filter out any server of a plurality of servers that does not meet criteria. If a given server meets the criteria, the system can add the given server to a candidate list; sort, in descending order, the candidate list by the minimum required placement overlap delta and the number of available virtual machine slots; and select, from the candidate list of servers, a candidate server from atop the candidate list.
    Type: Application
    Filed: December 20, 2017
    Publication date: June 20, 2019
    Applicants: AT&T Intellectual Property I, L.P., The Regents of the University of Colorado, a body corporate
    Inventors: Gueyoung Jung, Kaustubh Joshi, Sangtae Ha
  • Patent number: 10210468
    Abstract: Methods and systems are disclosed for providing cloud services to multiple customers in a cloud. One embodiment includes receiving a number of requests for the cloud services from the multiple customers simultaneously or substantially simultaneously; prioritizing the requests based on a probability distribution of actually deploying a service, a budget of the customers, and an expected demand of the requested service based on the probability distribution; generating a number of cloud configurations along with a number of Service Level Agreements (SLAs) for the customers based on prioritization of the requests, a class & past behavior of the customers, and a current demand of the cloud services, the SLAs of the customers include differentiated price offering; recommending the cloud configurations and the SLAs to the customers; allowing the customers to negotiate terms of the SLAs; and providing the cloud services based on the negotiated SLAs to the customers.
    Type: Grant
    Filed: February 18, 2016
    Date of Patent: February 19, 2019
    Assignee: XEROX Corporation
    Inventors: Sujit Gujar, Tridib Mukherjee, Koustuv Dasgupta, Gueyoung Jung
  • Publication number: 20190044999
    Abstract: Concepts and technologies are disclosed herein for an application deployment engine. A processor that executes an application deployment engine can receive an application request. The processor can obtain network topology data that indicates availability of resources of a data center, an application template associated with the application, and a running time during which an application placement plan is to be identified out of a large number of placement scenarios within the running time. The application template can describe an application flow path associated with the application. The processor can identify the application placement plan, where the application placement plan can include an optimal placement of the application at the data center, before a given running time expires by pruning the large search space. The processor can generate a command to effect deployment of the application in accordance with the application placement plan.
    Type: Application
    Filed: October 8, 2018
    Publication date: February 7, 2019
    Applicant: AT&T Intellectual Property I, L.P.
    Inventors: Gueyoung Jung, Kaustubh Joshi, Matti A. Hiltunen, Richard D. Schlichting
  • Patent number: 10097621
    Abstract: Concepts and technologies are disclosed herein for an application deployment engine. A processor that executes an application deployment engine can receive an application request. The processor can obtain network topology data that indicates availability of resources of a data center, an application template associated with the application, and a running time during which an application placement plan is to be identified out of a large number of placement scenarios within the running time. The application template can describe an application flow path associated with the application. The processor can identify the application placement plan, where the application placement plan can include an optimal placement of the application at the data center, before a given running time expires by pruning the large search space. The processor can generate a command to effect deployment of the application in accordance with the application placement plan.
    Type: Grant
    Filed: September 11, 2015
    Date of Patent: October 9, 2018
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Gueyoung Jung, Kaustubh Joshi, Matti A. Hiltunen, Richard D. Schlichting
  • Publication number: 20180255121
    Abstract: A method includes, for components of an application, identifying a plurality of groups including a first group and a second group, The method also includes nesting the first group into the second group to create a nested group, based at least on a level of the first group not exceeding a level of the second group. The method includes deploying the application by placing the components of the nested group within a network in accordance with a restriction of the nested group. The components include at least one virtual machine.
    Type: Application
    Filed: March 1, 2017
    Publication date: September 6, 2018
    Inventors: Matti Hiltunen, Gueyoung Jung, Joseph D'Andrea, III, Kaustubh Joshi
  • Patent number: 9912564
    Abstract: Methods and systems are provided for determining performance characteristics of an application processing system. The method comprises monitoring throughput of a plurality of resources of the system in a selected time window. A change rate is detected in the throughput of the resources, respectively, representative of a change to constancy of workload in at least some of the resources. Such a change in constancy comprises a knee point of a plot of resource usage comprising load relative to throughput. The time of the change rate is identified within the time window. A relatively first to occur of a plurality of resources knee points is determined wherein the resource corresponding to the first to occur is determined to have a fully loaded throughput within the multi-tier processing system. The determination of the first to occur knee point comprises pinpointing a bottleneck starting point within the application processing system.
    Type: Grant
    Filed: March 6, 2014
    Date of Patent: March 6, 2018
    Assignee: Xerox Corporation
    Inventors: Gueyoung Jung, Jinhui Yao
  • Patent number: 9870568
    Abstract: Methods and systems for determining prices of customized virtual machines required to process customer-specified workloads are disclosed. A count of instances of the customized virtual machines, required to process the customer-specified workloads is determined, based on a configuration of the customized virtual machines. The instances of the customized virtual machines are consolidated on virtual machine servers. Further, the prices of the customized virtual machines are determined based on a count of the virtual machine servers, unused resources in the virtual machine servers, and unused resources in the customized virtual machines. The determined prices are recommended to the customer. Further, at least one of the prices of the customized virtual machines or the configuration of at least one or more customized virtual machines is modified, based on a response to the recommendation received from the customer.
    Type: Grant
    Filed: November 19, 2013
    Date of Patent: January 16, 2018
    Assignee: Xerox Corporation
    Inventors: Gueyoung Jung, Tridib Mukherjee, Shruti Kunde
  • Patent number: 9674093
    Abstract: A method, non-transitory computer readable medium, and apparatus for adapting resources of the cluster of nodes for a real-time streaming workflow are disclosed. For example, the method receives a notification that a node of the cluster of nodes associated with an instance of a process of the real-time streaming workflow is predicted to be a bottleneck, identifies a number of hops to send a resource statement when the bottleneck is predicted that minimizes a ripple effect associated with transmitting the resource statement, transmits the resource statement to at least one or more nodes of the cluster of nodes within the number of hops, receives a response from one of the at least one or more nodes within the cluster of nodes and adapts a resource usage to the at least one of the one or more nodes within the cluster of nodes that the response was received from.
    Type: Grant
    Filed: August 18, 2014
    Date of Patent: June 6, 2017
    Assignee: Xerox Corporation
    Inventors: Hyun Joo Kim, Nathan Gnanasambandam, Gueyoung Jung
  • Patent number: 9612876
    Abstract: A method, non-transitory computer readable medium, and apparatus for estimating a completion time for a MapReduce job are disclosed. For example, the method builds a general MapReduce performance model, computes one or more performance characteristics of each one of one or more benchmark workloads, computes one or more performance characteristics of the MapReduce job in the known processing system, selects a subset of the one or more benchmark workloads that have similar performance characteristics as the one or more performance characteristics of the MapReduce job, targets a cluster of processing nodes in a distributed processing system, computes one or more performance characteristics of the subset of the one or more benchmark workloads in the cluster of processing nodes and estimates the completion time for the MapReduce job.
    Type: Grant
    Filed: December 19, 2013
    Date of Patent: April 4, 2017
    Assignee: Xerox Corporation
    Inventors: Jack Yanxin Li, Gueyoung Jung
  • Publication number: 20170078366
    Abstract: Concepts and technologies are disclosed herein for an application deployment engine. A processor that executes an application deployment engine can receive an application request. The processor can obtain network topology data that indicates availability of resources of a data center, an application template associated with the application, and a running time during which an application placement plan is to be identified out of a large number of placement scenarios within the running time. The application template can describe an application flow path associated with the application. The processor can identify the application placement plan, where the application placement plan can include an optimal placement of the application at the data center, before a given running time expires by pruning the large search space. The processor can generate a command to effect deployment of the application in accordance with the application placement plan.
    Type: Application
    Filed: September 11, 2015
    Publication date: March 16, 2017
    Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.
    Inventors: Gueyoung Jung, Kaustubh Joshi, Matti A. Hiltunen, Richard D. Schlichting
  • Patent number: 9552232
    Abstract: A method provides a recommendation for a cloud configuration for deploying a service. In response to receiving a service request, a database is searched for a cloud configuration. The search is performed by acquiring a resource usage pattern for the service. The resource usage pattern is mapped to a multidimensional space, which is searched for a previously deployed cloud configuration having a similar resource usage pattern. In response to finding a previously deployed cloud configuration, the activity management is determined for the previously deployed cloud configuration. A recommendation is made based on the activity management.
    Type: Grant
    Filed: March 12, 2013
    Date of Patent: January 24, 2017
    Assignee: Xerox Corporation
    Inventors: Tridib Mukherjee, Gueyoung Jung
  • Patent number: 9507642
    Abstract: The disclosed embodiments relate to systems and methods for method and systems for sub-allocating computational resources. A first computing device receives information associated with a first set of computational resources from a cloud infrastructure. The first set of computational resources has been allocated to the first computing device by the cloud infrastructure. A first set of parameters associated with a workflow received by the first computing device is determined. The first set of parameters is indicative of a need of the first set of computational resources by the first computing device. One or more computational resources from the first set of computational resources are sub-allocated based on the determined first set of parameters.
    Type: Grant
    Filed: December 4, 2012
    Date of Patent: November 29, 2016
    Assignee: Xerox Corporation
    Inventors: Wendell L Kibler, Paul R Austin, Arturo M Lorenzo, Gueyoung Jung
  • Patent number: 9396184
    Abstract: A method, a system, and a computer program product for translating a document are disclosed. A document in a source language is received and text snippets are extracted from the same. The text snippets are sent to a first set of remote workers for translation and a second set of remote workers for validation. The words in the validated text snippets are assigned a probability score. The words with the highest probability score are combined to generate the translated document.
    Type: Grant
    Filed: August 1, 2012
    Date of Patent: July 19, 2016
    Assignee: Xerox Corporation
    Inventors: Shourya Roy, Julien Bourdaillet, Gueyoung Jung, Yu An Sun
  • Patent number: 9391917
    Abstract: Methods and systems for recommending one or more computational resources. A portion of computational resources is determined from a set of computational resources associated with a datacenter based on a user-profile associated with a user, from one or more users, and the set of computational resources. The user-profile comprises at least one of a required performance level, a required load, or a cost constraint. The one or more computational resources are recommended from the portion of computational resources, in response to requests received from the one or more users.
    Type: Grant
    Filed: April 4, 2014
    Date of Patent: July 12, 2016
    Assignee: Xerox Corporation
    Inventors: Tridib Mukherjee, Gueyoung Jung, Shruti Kunde
  • Patent number: 9367813
    Abstract: Methods and systems for scalable extraction of episode rules using incremental episode tree construction in a multi-application event space comprise compiling events from multiple, different domain logs into in a universal log file, rolling domain-dependent and domain-independent windows through the universal log file to identify distinct event-pattern episodes, adding episodes to an episode tree data structure, pruning less frequent episodes from the episode tree, analyzing the episode tree to identify frequent episode rules, and applying the frequent episode rules to future interactions with users.
    Type: Grant
    Filed: October 28, 2011
    Date of Patent: June 14, 2016
    Assignee: Xerox Corporation
    Inventors: Gueyoung Jung, Shanmuga-Nathan Gnanasambandam, Andres Quiroz Hernandez, Zhiguo Li