publications and patents
I have been fortunate enough to work with some great minds during my Research Engineering days. Below are some publications and patents by the team that I was part of.
2020
- USPTOMethod and system for recommendation of a succession of one or more services for a service workflowTridib Mukherjee, Varun Sharma, Aditya Hegde, and 1 more authorJun 2020US Patent 10,678,874
A method and a system for recommendation of a succession of one or more services for a service workflow are disclosed. In an embodiment, a query is received to retrieve one or more services from a repository of a plurality of services stored in a hierarchical structure. The hierarchical structure comprises a plurality of hierarchical levels, each hierarchical level in the plurality of hierarchical levels comprising a set of nodes. Each node in the set of nodes in each hierarchical level, stores a first semantic information and a second semantic information. Further, the query is compared with the first semantic information and the second semantic information associated with a first node. The first node or the second node is selected based on the comparison. Further, the first set of services or the combination of services, associated with the selected node is recommended, as the service workflow, to the user.
2018
- USPTOMethod and system for recommending services to requestorsShruti Kunde, Tridib Mukherjee, Varun Sharma, and 1 more authorAug 2018US Patent 10,051,064
A method and a system for recommending services to a requestor over a communication network. A request comprising one or more keywords and one or more service level agreements (SLAs), is received from a requestor computing device over the communication network, to process one or more tasks. One or more first services from one or more available services are selected based on the request. For a first service from the one or more first services, a first score and a second score is determined. The one or more first services are ranked based on the first score and the second score. A recommendation of the one or more first services is transmitted to the requestor based on the ranking.
- USPTOMethod and system for managing delivery of analytics assets to users of organizations using operating system containersRahul Ghosh, Varun Sharma, Ajith Ramanath, and 2 more authorsFeb 2018US Patent Application 15/237,996. Granted as US 10,241,777 B2 in 2019.
A method and a system are provided to manage analytics assets associated with at least one computer accessible to an organization using operating system (OS) containers. The method comprising receiving a request to process of a task on the user computing device. The method further select a set of analytics assets from a first category, based on at least one of a role of the user in the organization and a historical usage of the one or more analytics assets or a second category that corresponds to the user and are included in the container image associated with the user. The method further update the container image of the user, based on at least the selection of the set of analytics assets from the first category. The method further render the selected set of analytics assets through the updated container image on the user computing device of the user.
2016
- CLOUDSCoPe: A Decision System for Large Scale Container Provisioning ManagementAditya Hegde, Rahul Ghosh, Tridib Mukherjee, and 1 more authorIn IEEE 9th International Conference on Cloud Computing (CLOUD), Feb 2016
Operating system (OS) containers provide a process level virtualization in a multi-tenant Cloud environment. Such containers are becoming increasingly popular in developer community as they facilitate fast development and delivery of enterprise class Cloud services. Furthermore, these containers share a common OS and hence, they have a low resource foot-print leading to reduced provisioning time. In this paper, we investigate such promise of containers while provisioning large scale 3-tier applications. First, through benchmarking, we observe that at very large scale, several application scaling factors (e.g., number of containers of an application provisioned in parallel, application load) and system state parameters (e.g., number of applications and containers running on a system) introduce variability in application provisioning time because of resource bottleneck in general, and specifically due to the OS process overhead. To address such variability, we propose a provisioning decision management system SCoPe that provides an application partitioning and provisioning strategy where we determine the maximum number of containers of every application that can be provisioned in parallel across physical machines, while meeting the service level agreement (SLA) on provisioning time and Cloud provider specific objectives (e.g., maximize consolidation of applications, minimize operating cost). This joint partitioning and provisioning problem is NP-hard and we propose a greedy heuristic solution. Using real data set and through extensive experiments, we demonstrate the performance of SCoPe for large scale container based application provisioning. Compared to other well-known heuristics, SCoPe can reduce the partitioning by 5x or more, while meeting SLAs.
2015
- ICWSA Scalable Approach for Context Based Complex Service DiscoveryShruti Kunde, Rahul Ghosh, Tridib Mukherjee, and 2 more authorsIn IEEE International Conference on Web Services, Feb 2015
Discovering and matching services is an area that has been extensively explored. In this paper we envision services that advertise not only their functional parameters, but also highlight the Quality of Service(QoS) guarantees (or non-functional parameters) they can provide. As a result users can also incorporate QoS requirements along with the service request. Given the vast pool of services available today, leading to complex ontologies, the search space becomes extremely large, increasing the complexity of the search. We construct an overlay reflecting the relationships between the services, which facilitates the pruning of the entire search space. Additionally our system takes into consideration the user context which provides information pertaining to the users preferences. (eg: A user could be performance-savvy or functionally-cautious etc) We propose an algorithm CCD (Context based Complex service Discovery), which utilizes the inputs provided by the users and determines the similarity quotient for the functional and QoS parameters. Our experiments show that CCD significantly improves the scalability of the search by aggressively pruning the search space, achieved by visiting only relevant nodes. CCD further uses the requester context to improve the recommendations provided to the requester. We also compare CCD with two baseline approaches based on the depth-first search algorithm on a travel ontology, which was created using real service definitions from the Open Travel Alliance (OTA).
- ICSOCPersonalized Messaging Engine: The Next Step in Employee EngagementVarun Sharma, Abhishek Tripathi, Saurabh Shrivasta, and 2 more authorsIn IEEE International Conference on Service-Oriented Computing, Feb 2015
Employers today are struggling to engage positively with their employees to reduce attrition and improve productivity. There are solutions in the market which are trying to solve the problem but they suffer from two critical issues. Firstly, the scope of the existing solutions is too narrow to capture each and every interaction happening within the company. Secondly, their learning from the employee behaviour is either non-existent or minimal at best. Personalized Messaging Engine (PME) is an attempt to provide end-to-end system to organizations for effective employee engagement. PME uses SOA principles to connect to each and every system through which employees engage with their employers. It uses the data aggregated from multiple systems to provide a hyper-personalized and dynamic experience to each employee. With the help of APIs, multiple systems can push data to PME and it then processes the data to send relevant pre-configured messages to the employees in the domain of Health, Wealth and Career. Additionally, PME uses several factors to prioritize messages for each and every employee. It uses a state-of-the-art learning engine to combine Subject Matter Experts opinion, Client Strategy, User Experiences and behaviour to find the messages which are most effective for the employees.
2007
- WoWMoMAn Optimal Flow Assignment Framework for Heterogeneous Network AccessJatinder Pal Singh Singh, Tansu Alpcan, Piyush Agrawal, and 1 more authorIn Proc. IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM’07), Feb 2007
We consider a scenario where devices with multiple networking capabilities access networks with heterogeneous characteristics. In such a setting, we address the problem of efficient utilization of multiple access networks (wireless and/or wireline) by devices via optimal assignment of traffic flows with given utilities to different networks. We develop and analyze a device middleware functionality that monitors network characteristics and employs a Markov Decision Process (MDP) based control scheme that in conjunction with stochastic characterization of the available bit rate and delay of the networks generates an optimal policy for allocation of flows to different networks. The optimal policy maximizes, under available bit rate and delay constraints on the access networks, a discounted reward which is a function of the flow utilities. The flow assignment policy is periodically updated and is consulted by the flows to dynamically perform network selection during their lifetimes. We perform measurement tests to collect traces of available bit rate and delay characteristics on Ethernet and WLAN networks on a work day in a corporate work environment. We implement our flow assignment framework in ns-2 and simulate the system performance for a set of elastic video-like flows using the collected traces. We demonstrate that the MDP based flow assignment policy leads to significant enhancement in the QoS provisioning (lower packet delays and packet loss rates) for the flows, as compared to policies which do not perform dynamic flow assignment but statically allocate flows to different networks using heuristics like average available bit rate on the networks.