Home // AFIN 2011, The Third International Conference on Advances in Future Internet // View article

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

Authors:
Kensuke Hashimoto
Yumi Takaki
Chikara Ohta
Hisashi Tamaki

Keywords: breadcrumbs, hop-aware, query induction, in-network cache

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

Pages: 69 to 73

Copyright: Copyright (c) IARIA, 2011

Publication date: August 21, 2011

Published in: conference

ISSN: 2308-4340

ISBN: 978-1-61208-148-9

Location: Nice/Saint Laurent du Var, France

Dates: from August 21, 2011 to August 27, 2011