Tata Consultancy Services Limited

Anantha Simha

Hemant Kumar Rath

Bighnaraj Panigrahi

Samar Shailendra

Shameemraj Mohinuddin Nadaf

Ajay Kattepur

Vishvesh Revoori

Jyotirmoy Karjee

Sipra Behera

Arun Kumar A V

Balamuralidhar Purushothaman

Arijit Mukherjee

Rajan Mindigal Alasingara Bhattachar

Aniruddh Rao Kabbinale

Munmun Sengupta

Prasant Kumar Misra

Hemant Kumar

Alok Ranjan

Senthilmurugan Sengottuvelan

Rashmi Ramamohan

K N R Surya Vara Prasad

Visali Mushunuri

Hermant Kumar Rath

Bighnaraj Panigrah I

Bighnaraj Panig Rahi

Samar Shaile Ndra

Vishvesh Revoorsi

In order to make use of computational resources available at runtime through fog networked robotics paradigm, it is critical to estimate average performance capacities of deployment hardware that is generally heterogeneous. It is also not feasible to replicate runtime deployment framework, collected sensor data and realistic offloading conditions for robotic environments. In accordance with an embodiment of the present disclosure, computational algorithms are dynamically profiled on a development testbed, combined with benchmarking techniques to estimate compute times over the deployment hardware. Estimation in accordance with the present disclosure is based both on Gustafson's law as well as embedded processor benchmarks. Systems and methods of the present disclosure realistically capture parallel processing, cache capacities and differing processing times across hardware.

Systems and methods for estimating computation times a-priori in fog computing robotics

Methods and Systems for automatic information extraction by performing self-learning crawling and rule-based data mining is provided. The method determines existence of crawl policy within input information and performs at least one of front-end crawling, assisted crawling and recursive crawling. Downloaded data set is pre-processed to remove noisy data and subjected to classification rules and decision tree based data mining to extract meaningful information. Performing crawling techniques leads to smaller relevant datasets pertaining to a specific domain from multi-dimensional datasets available in online and offline sources.

Self-learning based crawling and rule-based data mining for automatic information extraction

Robotic applications are important in both indoor and outdoor environments. Establishing reliable end-to-end communication among robots in such environments are inevitable. Many real-time challenges in robotic communications are mainly due to the dynamic movement of robots, battery constraints, absence of Global Position System (GPS), etc. Systems and methods of the present disclosure provide assisted link prediction (ALP) protocol for communication between robots that resolves real-time challenges link ambiguity, prediction accuracy, improving Packet Reception Ratio (PRR) and reducing energy consumption in-terms of lesser retransmissions by computing link matrix between robots and determining status of a Collaborative Robotic based Link Prediction (CRLP) link prediction based on a comparison of link matrix value with a predefined covariance link matrix threshold. Based on determined status, robots either transmit or receive packet, and the predefined covariance link matrix threshold is dynamically updated. If the link to be predicted is unavailable, the system resolves ambiguity thereby enabling communication between robots.

System and method for assisted link prediction mechanism in robotic communications

A method and a system is disclosed herein for co-operative on-path and off-path caching policy for information centric networks (ICN). In an embodiment, a computer implemented method and system is provided for cooperative on-path and off-path caching policy for information centric networks in which the edge routers or on-path routers optimally store the requested ICN contents and are supported by a strategically placed central off-path cache router for additional level of caching. A heuristic mechanism has also been provided to offload and to optimally store the contents from the on-path routers to off-path central cache router. The present scheme optimally stores the requested ICN contents either in the on-path edge routers or in strategically located off-path central cache router. The present scheme also ensures optimal formulation resulting in reduced cache duplication, delay and network usage.

Method and system for co-operative on-path and off-path caching policy for information centric networks

In LTE Random Access Channel (RACH) mechanism, devices use slotted ALOHA based protocol for RACH message exchange. During these messages exchange, if a device does not get a response from a base-station (BS), the device assumes that it is not able to reach base station due to insufficient transmission power and increases transmit power to reach to the base station. However, at higher density most of requests are lost due to collision. In existing RACH procedure, device unnecessarily ramps power in next RACH process which leads to power wastage in already resource constrained device. When there is failure of reception of RACH process, the present disclosure computes time delays (TD) based on a RSSI value obtained from a message transmitted by the BS, and initiates RACH process accordingly. The embodiments further enable requests transmission from device to BS by ramping power of the devices based on the computed TD.

Systems and methods for delay based power ramping of devices

This disclosure relates to managing Fog computations between a coordinating node and Fog nodes. In one embodiment, a method for managing Fog computations includes receiving a task data and a request for allocation of at least a subset of a computational task. The task data includes data subset and task constraints associated with at least the subset of the computational task. The Fog nodes capable of performing the computational task are characterized with node characteristics to obtain resource data associated with the Fog nodes. Based on the task data and the resource data, an optimization model is derived to perform the computational task by the Fog nodes. The optimization model includes node constraints including battery degradation constraint, communication path loss constraint, and heterogeneous computational capacities of Fog nodes. Based on the optimization model, at least the subset of the computational task is offloaded to a set of Fog nodes.

Optimal deployment of fog computations in IoT environments

This disclosure relates generally to distributed robotic networks, and more particularly to communication link-prediction in the distributed robotic networks. In one embodiment, robots in a robotic network, which are mobile, can establish communication with a cloud network through a fog node, wherein the fog node is a static node. A robot can directly communicate with a fog node (R2F) if the fog node is in the communication range of the robot. If there is no fog node in the communication range of the robot, then the robot can establish communication with another robot (R2R) and indirectly communicate with the fog node through the connected robot. Communication link prediction is used to identify one or more communication links that can be used by a robot for establishing communication with the cloud network. A link that satisfies requirements in terms of link quality and any other parameter is used for communication purpose.

Method and system for communication link prediction in distributed robotic networks

The present application provides a method and system for sharing of unlicensed spectrum. The disclosed method and system when implement improves the spectral efficiency of LTE users and also improves the overall performance of LAA and Wi-Fi users. A BS senses the channel for any ongoing transmissions for a CCA period which is equal to DIFS time period of Wi-Fi. If the channel is busy (CCA-busy), it enters into back-off stage by selecting a uniform random number from [0, C&#x2212;1] as the back-off counter, where Cis the fixed congestion window size. If the channel is free for a CCA period (CCA-idle), the back-off counter gets decremented by unity until it reaches zero. Once the back-off counter reaches zero, LAA again senses and schedules its down-link transmissions for a maximum channel occupancy period, provided the channel is free.

Method and system for sharing of unlicensed spectrum

This disclosure relates generally to provisioning network services in a cloud computing environment, and more particularly to framework for provisioning network services in a heterogeneous cloud computing environment. In one embodiment, the disclosure includes a network as a service (NaaS) layer under a cloud provisioning platform. The NaaS layer can be interfaced with any cloud provisioning platform. The NaaS layer serves the networking needs of the heterogeneous cloud environment. It provides network services like monitoring, notifications, QoS policies, network topology and other services. For example, the cloud provisioning platform defines a virtual network and attaches a plurality of virtual machines to it. All the communications related to creation/deletion/update of virtual networks, virtual subnets, virtual ports, virtual router, virtual interfaces etc., are sent to the NaaS layer. On receiving the communication, the NaaS layer takes necessary steps to provide the network services as per the needs of the request. Apart from provisioning, the NaaS layer periodically monitors the network elements as well.

Framework for provisioning network services in cloud computing environment

A method and system for optimizing a distributed enterprise information technology (IT) network infrastructure is disclosed, wherein the IT infrastructure comprises at least one server, at least one storage element, and at least one network element. The method comprises collecting data and arranging the collected data pertaining to an existing state of the information technology network infrastructure in a first set of templates. The method further comprises mapping the existing state and a new state of at least one of the at least one server and at least one storage element with an existing set of network elements using the first set of templates to form a second set of templates, wherein the method further comprises of planning the new state of the IT network infrastructure for transformation using the first set of templates and the second set of templates, the new state being an optimized state.

Method and a system for automating an enterprise network optimization

A method and system is provided for distributed optimal caching for information centric networking. The system and method disclosed herein enables each router/node in the network to make an independent decision to solve the optimization problem based upon a cost feedback from its neighbors. Content is received by a first router which determines if it should store the content in its cache based on a Characterizing Metrics (CM) value or send it to a neighbor router j, where the neighbor router j is selected based on a transaction cost determination. The node j on receiving the content shared with itself again performs similar computation to determine if the content should be stored in its cache. The method is performed iteratively for optimal distributed caching.

Method and system for distributed optimal caching of content over a network

This disclosure relates generally to autonomous devices, and more particularly to method and system to optimally allocate warehouse procurement tasks to distributed autonomous devices. The method includes obtaining, at a coordinating agent, a global task associated with the warehouse and information associated with the robotic agents. The information includes a count and status of the robotic agents. The global task is profiled to obtain a set of sub-tasks and constraints associated with the set of sub-tasks are identified. The constraints include utilization constraint and/or pricing constraints. A distributed, decentralized optimal task allocation is performed amongst the robotic agents based on constraints to obtain optimal performance of robotic agents. The distributed optimal task allocation includes performing primal or dual decomposition of the set of sub-tasks by each robotic agent and updating corresponding primal/dual variables by the coordinating agent when the optimization is performed based on utilization constraint and pricing constraints, respectively.

Method and system for optimally allocating warehouse procurement tasks to distributed robotic agents

The present disclosure is related to a system and method for providing aerial communication services to users trapped in disaster conditions and need immediate attention. It includes an UAV mounted with a central base station to establish communication services with each communication equipment by modeling of an emergency communication network. It analyzes utility function of criticalities to assure an efficient resource allocation mechanism where critical users get preference over non-critical users. The users can be in a critical state either due to low remaining energy of at least one communication equipment of the one or more users or because of the criticality due to their physical surroundings and data rate component to ensure throughput for the communication services. An assisted global positioning system (A-GPS) is being used for obtaining information of physical criticality of the users distributed over a geographical area.

Aerial communication framework for providing communication services to users trapped in emergency

System(s) and method(s) for designing a network of one or more entities in an enterprise is disclosed. A design type along with configurable design parameters is selected from a list of designs. Requirements associated with design of entities are collected from the users. The requirements and configurable design parameters are analyzed to obtain analysis results. Based on at least one of a layer-wise requirement and distribution or a zone-wise requirement and distribution, network devices and modules associated with the entities are determined. One or more designs are generated for the network of entities based on the layer-wise requirement and distribution or the zone-wise requirement and distribution of network devices and modules associated with the entities in the enterprise.

System and method for designing a network for one or more entities in an enterprise

A technique for estimating cache size for cache routers in information centric networks (ICNs) is disclosed. In an example, an average rate of incoming requests and a probability of occurrence of each request at a cache router in a predefined time interval is determined. Further, a relation between cache hit and cache miss with and without replacement is derived based on the probability of occurrence of each request. Furthermore, an entropy of the requests is computed based on the probability of occurrence of each request. Moreover, a diversity index of the requests is calculated based on the entropy and the average rate of the requests. A cache size for the cache router is then estimated based on a user defined probability of cache hit, the average rate of the requests, the diversity index of the requests and the relation between the cache hit and cache miss with and without replacement.

Growing community of inventors

Bengaluru, India

Anantha Simha