公开(公告)号：US10291474B2

公开(公告)日：2019-05-14

申请号：US15357241

申请日：2016-11-21

Applicant: Tata Consultancy Services Limited

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

IPC: H04L12/24 ,  H04L29/08 ,  H04L12/733 ,  H04L12/721

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

公开(公告)号：US20170207974A1

公开(公告)日：2017-07-20

申请号：US15357241

申请日：2016-11-21

Applicant: Tata Consultancy Services Limited

Inventor： Samar SHAILENDRA ,  Bighnaraj Panigrahi ,  Senthilmurugan Sengottuvelan ,  Hemant Kumar Rath ,  Anantha Simha

IPC: H04L12/24 ,  H04L12/733 ,  H04L12/721

CPC classification number: H04L41/0893 ,  H04L41/04 ,  H04L45/122 ,  H04L45/124 ,  H04L45/44 ,  H04L67/1097 ,  H04L67/2842

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