中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

31 records (took 0.017 seconds)

    Method and system for communication link prediction in distributed robotic networks
    1.
    发明授权
    Method and system for communication link prediction in distributed robotic networks 有权

    公开(公告)号：US10425954B2

    公开(公告)日：2019-09-24

    申请号：US15866761

    申请日：2018-01-10

    Applicant: Tata Consultancy Services Limited

    Inventor： Jyotirmoy Karjee ,  Sipra Behera ,  Hemant Kumar Rath ,  Anantha Simha

    IPC: H04W72/08 ,  H04L29/08 ,  H04W4/70 ,  H04W8/00 ,  H04W48/20 ,  H04W84/22

    Abstract: 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.

    CONTROL PLANE OPTIMIZATION OF COMMUNICATION NETWORKS
    3.
    发明申请
    CONTROL PLANE OPTIMIZATION OF COMMUNICATION NETWORKS 有权
    控制平台优化通信网络

    公开(公告)号：US20150271078A1

    公开(公告)日：2015-09-24

    申请号：US14663184

    申请日：2015-03-19

    Applicant: TATA Consultancy Services Limited

    Inventor： Hemant Kumar Rath ,  Vishvesh Revoori ,  Shameemraj Mohinuddin Nadaf ,  Anantha Simha

    IPC: H04L12/801 ,  H04L12/803

    CPC classification number: H04L47/193 ,  H04L45/125 ,  H04L45/42 ,  H04L45/64 ,  H04L47/122 ,  H04L47/125

    Abstract: Optimization of control plane in a software defined network includes obtaining peer information of at least one neighbouring network controller by a network controller and determining a traffic profile variation. The method further includes computing of a self payoff value indicative of one of optimum utilization, underutilization and overutilization of the network controller. The method further includes initiating a non-zero sum game based network control plane optimization operation based on the self payoff value and the traffic profile of the neighbouring network controllers, and may include one of activating additional network controller(s), transferring control of one or more network devices managed by the network controller(s) to a neighbouring greedy network controller, deactivating the network controller, and transferring control of one or more additional network devices managed by the neighbouring network controller(s) to the greedy network controller.

    Abstract translation: 在软件定义的网络中控制平面的优化包括由网络控制器获取至少一个相邻网络控制器的对等体信息并且确定业务轮廓变化。 该方法还包括计算指示网络控制器的最佳利用率，利用不足和过度利用之一的自我收益值。 该方法还包括基于相邻网络控制器的自身收益值和业务简档来启动基于非零和游戏的网络控制平面优化操作，并且可以包括激活附加网络控制器之一，传送一个 或更多的由网络控制器管理的网络设备连接到相邻的贪婪网络控制器，停用网络控制器，以及将由相邻网络控制器管理的一个或多个附加网络设备的控制传送到贪婪网络控制器。

    Method and system for optimal caching of content in an information centric networks (ICN)
    4.
    发明授权
    Method and system for optimal caching of content in an information centric networks (ICN) 有权

    公开(公告)号：US09860318B2

    公开(公告)日：2018-01-02

    申请号：US14966611

    申请日：2015-12-11

    Applicant: TATA Consultancy Services Limited

    Inventor： Bighnaraj Panigrahi ,  Samar Shailendra ,  Hemant Kumar Rath ,  Anantha Simha

    IPC: G06F15/167 ,  H04L29/08

    CPC classification number: H04L67/1097 ,  H04L67/2842 ,  H04L67/2852

    Abstract: The present application provides a method and system for optimal caching of content in the Information Centric Networks (ICN) and a cache replacement based on a content metric value. The method and system comprises requesting for a plurality of content by a user to a nearest local or edge ICN cache router; delivering by the local or edge ICN cache router the requested plurality of content to the user if it is available in its cache; else forwarding the request for the plurality of content to any of intermediate ICN cache router for finding source of the requested plurality of content; downloading the plurality of content in its downstream path; and storing the downloaded plurality of content based on a content metric value derived by a content metric system (CMS) based on a plurality of network parameters for the requested plurality of content.

    UPLINK TRANSMISSION SCHEDULING FOR WIRELESS COMMUNICATION NETWORKS
    6.
    发明申请
    UPLINK TRANSMISSION SCHEDULING FOR WIRELESS COMMUNICATION NETWORKS 有权
    无线通信网络的上行传输调度

    公开(公告)号：US20150029950A1

    公开(公告)日：2015-01-29

    申请号：US14204933

    申请日：2014-03-11

    Applicant: Tata Consultancy Services Limited

    Inventor： Hemant Kumar Rath ,  Munmun Sengupta ,  Anantha Simha

    IPC: H04W72/04

    CPC classification number: H04W72/0413 ,  H04W72/042 ,  H04W72/12 ,  H04W76/00

    Abstract: A method for uplink scheduling over a communication channel in a communication network including at least one UE and an eNodeB, is described. The method comprises determining whether the UE is associated with at least one of Guaranteed Bit Rate (GBR) bearers and non-Guaranteed Bit Rate (non-GBR) bearers. Based on the determining, for each of the GBR-bearers and the non-GBR-bearers, computing a demand for resources for establishing an uplink communication, wherein the demand is computed based physical layer characteristics and transport layer characteristics associated with the communication channel. The demand computed is communicated as a request message to the eNodeB. In response to the request message, receiving an allocation of the resources for uplink scheduling from the eNodeB.

    Abstract translation: 描述了在包括至少一个UE和eNodeB的通信网络中的通信信道上的上行链路调度的方法。 该方法包括确定UE是否与保证比特率（GBR）承载和非保证比特率（非GBR）承载中的至少一个相关联。 基于对每个GBR承载和非GBR承载的确定，计算用于建立上行链路通信的资源需求，其中基于物理层特性和与通信信道相关联的传输层特性来计算需求。 所计算的需求作为请求消息传送到eNodeB。 响应于该请求消息，从eNodeB接收用于上行链路调度的资源的分配。

    Method and system for co-operative on-path and off-path caching policy for information centric networks
    7.
    发明授权
    Method and system for co-operative on-path and off-path caching policy for information centric networks 有权

    公开(公告)号：US10567277B2

    公开(公告)日：2020-02-18

    申请号：US15423228

    申请日：2017-02-02

    Applicant: Tata Consultancy Services Limited

    Inventor： Hemant Kumar Rath ,  Bighnaraj Panigrahi ,  Anantha Simha

    IPC: G06F15/173 ,  H04L12/725 ,  H04L29/08 ,  H04L12/721

    Abstract: 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 optimally allocating warehouse procurement tasks to distributed robotic agents
    8.
    发明授权
    Method and system for optimally allocating warehouse procurement tasks to distributed robotic agents 有权

    公开(公告)号：US10235642B2

    公开(公告)日：2019-03-19

    申请号：US15827513

    申请日：2017-11-30

    Applicant: Tata Consultancy Services Limited

    Inventor： Ajay Kattepur ,  Hemant Kumar Rath ,  Anantha Simha ,  Arijit Mukherjee

    IPC: G06Q10/04 ,  G05B19/418 ,  G05D1/02 ,  G06Q10/08

    Abstract: 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.

    Estimating cache size for cache routers in information centric networks
    9.
    发明授权
    Estimating cache size for cache routers in information centric networks 有权

    公开(公告)号：US10069929B2

    公开(公告)日：2018-09-04

    申请号：US15065520

    申请日：2016-03-09

    Applicant: Tata Consultancy Services Limited

    Inventor： Bighnaraj Panigrahi ,  Samar Shailendra ,  Hemant Kumar Rath ,  Anantha Simha

    IPC: H04L29/08 ,  G06F12/08 ,  G06F12/12 ,  G06F12/0871 ,  G06F12/0813

    Abstract: 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.

Patent Agency Ranking