In-network Hop-aware Query Induction Scheme for Implicit Coordinated Content Caching

The breadcrumb scheme was proposed to realize content distribution in next-generation networks. In the breadcrumb (BC) scheme, each node maintains a small piece, called a "breadcrumb," of query induction information. The BC scheme can, however, increase the amount of traffic as well as file acquisition delay since a query for a file is may diverted away from the nearest server with the file even if the query passes close to the server. This paper proposes a hop-aware breadcrumb scheme, in which the query induction information includes latest file acquisition node ID, which enables a query to be diverted toward a closer node, the latest file acquisition node, or the server. Simulations show that the hop-aware breadcrumb scheme yields shorter file acquisition time than the breadcrumb scheme.