DESC:METHOD AND SYSTEM FOR DISTRIBUTED OPTIMAL CACHING OF CONTENT OVER A NETWORK ,CLAIMS:1. A method for distributed optimal caching of data in a network architecture; said method comprising processor implemented steps of:
receiving a data from a source (116) at a first router, wherein a caching policy is implemented on the first router;
computing a first characterizing metrics (CM) value for the received data using the caching policy, wherein the first CM value is used to determine whether the data can be stored in the cache of the first router;
storing the received data in a cache of the first router when first CM value is higher than a CM value of a previously cached data stored in the cache of the first router;
storing the received data in the cache of a neighbor router when the first CM value is less than a CM value of previously cached data stored in the cache of the first router, wherein storing the received data in the cache of the neighbor router comprises
selecting from a plurality of neighbor routers, the neighbor router with a least transaction cost,
computing a second CM value for the received data to be stored at the neighbor router using the caching policy, wherein the second CM value is used to determine whether the data can be stored at the neighbor router, and
storing the received data at the cache of the neighbor router when the second CM value is less than a CM value of the data previously stored in the cache of the neighbor router.

2. The method according to claim 1 comprising providing by the neighbor router, a shareable cache to store the received data wherein the shareable cache is a predetermined portion of the total cache of the neighbor router.

3. The method according to claim 1 wherein the transaction cost is determined such that the first router shares qn data with the neighbor router the first router to pay a cost pj such that the total cost for sharing qn is (pj × qn) wherein pj is a function of importance of the data cached at a router and the cache filling rate.

4. The method according to claim1 wherein the method is used for a plurality of caching problems including Web Caching and MANET.

5. The method according to claim 1, wherein the caching policy is Universal Caching (UC) policy and the network architecture is O-ICN architecture and wherein a cache list of an ICN manager is updated by the either first router or the neighbor router when the data is stored in the cache of the first router or the neighbor router respectively.

6. The method according to claim 1 further comprising updating the value of pj and corresponding transaction cost when the data is stored in the cache of the neighbor router wherein the updated value is based on the updated data stored in the cache of the neighbor router.

7. The method according to claim 1 further comprising iteratively performing the steps of claim 1 based on a predetermined parameter wherein the predetermined parameter is defined by a user.

8. A system for optimal caching of data in a Network architecture; said system comprising at least one source (116) and a plurality of clusters wherein the plurality of clusters comprise a plurality of caching devices communicatively coupled with each other wherein the plurality of caching devices are adapted for:
receiving a data from a source (116) at a first router of the plurality of routers, wherein a caching policy is implemented on the first router;
computing a first Characterizing metrics (CM) value for the received data using the caching policy, wherein the first CM value is used to determine whether the data can be stored in the cache of the first router;
storing the data in a cache of the first router when first CM value of the data is higher than a CM value of a previously cached data stored in the cache of the first router;
storing the data in the cache of a neighbor router when the first CM value is less than a CM value of previously cached data stored in the cache of the first router, wherein storing the data in the cache of the neighbor router comprises
selecting from a plurality of neighbor routers, the neighbor router with a least transaction cost,
computing a second CM value for the data to be stored at the neighbor router using the caching policy, wherein the second CM value is used to determine whether the data can be stored at the neighbor router, and
storing the data at the cache of the neighbor router when the second CM value is less than a CM value of the data previously stored in the cache of the neighbor router.

9. The system according to claim 8 neighbor router is further configured to provide, a shareable cache to store the received data wherein the shareable cache is a predetermined portion of the total cache of the neighbor router

10. The system according to claim 8 wherein the transaction cost is determined such that the first router shares qn data with the neighbor router the first router to pay a cost pj such that the total cost for sharing qn is (pj × qn) wherein pj is a function of importance of the data cached at a router and the cache filling rate.

11. The system according to claim 8, wherein the caching policy is Universal Caching (UC) policy and the network architecture is O-ICN architecture and wherein a cache list of an ICN manager is updated by the first router or the neighbor router when the data is stored in the cache of the first router or the neighbor router respectively.

12. The system according to claim 8, further configured to update the value of pj and corresponding transaction cost when the data is stored in the cache of the neighbor router wherein the updated value is based on the updated data stored in the cache of the neighbor router.