Date: 11/20 Tuesday 17:00~18:30

Location: 우정정보통신관 (Woojung Building) room #604

Speaker: Jussi Kangasharju (University of Helsinki)

Bio:

Jussi Kangasharju received his MSc from Helsinki University of Technology
in 1998. He received his Diplome d'Etudes Approfondies (DEA) from the Ecole
Superieure des Sciences Informatiques (ESSI) in Sophia Antipolis in 1998.
In 2002 he received his PhD from University of Nice Sophia
Antipolis/Institut Eurecom. In 2002 he joined Darmstadt University of
Technology (TUD), first as post-doctoral researcher, and from 2004 onwards
as assistant professor. In 2007 he successfully passed his 3-year
evaluation for a contract extension at TUD. Since June 2007 Jussi is a
professor at the department of computer science at University of Helsinki.
Since January 2009 he is also the director of the Future Internet research
program at Helsinki Institute for Information Technology (HIIT). Jussi's
research interests are information-centric networks, content distribution,
opportunistic networks, and green ICT. He is a member of IEEE and ACM.

Abstract:

In-network caching of content is a popular technique for eliminating
redundant traffic from the network and improve the performance of network
applications. In this paper we present a novel cooperative caching strategy
to improve performance of in-network caches. Our cooperative scheme is
composed of an admission policy for the incoming data and a content
exchange protocol between neighbor network caches to improve the search
zone. The admission policy enforces that a previously cached data is not
unnecessary replicated in other caches, resulting in more space for new
data. The content exchange protocol allows for exchange on cached data,
increasing the hit rate for incoming requests. The benefits are twofold:
first, we reduce the redundant content caching in the network, and second,
we improve the hit rate by informing the content cached in the nearby
caches. As a proof-of-concept, we have implemented a prototype and
evaluated its performance using different large-scale topologies against
standard non-cooperative caching algorithms. Our numerical results show
that both admission and content exchange policies yield large performance