In recent years, much work has been devoted to developing protocols and architectures for supporting the growing trend of data-oriented services. One drawback of many of these proposals is the need to upgrade or replace all the routers in order for the new systems to work. Among the few systems that allow for gradual deployment is the recently-proposed Breadcrumbs technique for distributed coordination among caches in a cache network. Breadcrumbs uses information collected locally at each cache during past downloads to support in-network guiding of current requests to desired content. Specifically, during content download a series of short-term pointers, called breadcrumbs, is set up along the download path. Future requests for this content are initially routed towards the server which holds (a copy of) this content. However, if this route leads the request to a Breadcrumbs-supporting router, this router re-directs the request in the direction of the latest downloaded, using the aforementioned pointers. Thus, content requests are initially forwarded by a location ID (e.g., IP address), but encountering a breadcrumb entry can cause a shift over to content-based routing. This property enables the Breadcrumbs system to be deployed gradually, since it only enhances the existing location-based routing mechanism (i.e. IP-based routing). In this paper we evaluate the performance of a network where Breadcrumbs is only partially deployed. Our simulation results show Breadcrumbs performs poorly when sparsely deployed. However, if an overlay of Breadcrumbs-supporting routers is setup, system performance is greatly improved. We believe that the reduced load on servers achieved with even a limited deployment of Breadcrumbs-supporting routers, combined with the flexibility of being able to deploy the system gradually, should motivate further investigation and eventual deployment of Breadcrumbs.
[1]
Albert-László Barabási,et al.
Statistical mechanics of complex networks
,
2001,
ArXiv.
[2]
Van Jacobson,et al.
Networking named content
,
2009,
CoNEXT '09.
[3]
Jörg Ott,et al.
On content-centric router design and implications
,
2010,
ReARCH '10.
[4]
James F. Kurose,et al.
Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks
,
2009,
IEEE INFOCOM 2009.
[5]
Ibrahim Matta,et al.
On the origin of power laws in Internet topologies
,
2000,
CCRV.
[6]
Srinivasan Seshan,et al.
Packet caches on routers: the implications of universal redundant traffic elimination
,
2008,
SIGCOMM '08.
[7]
Xueyan Tang,et al.
Coordinated En-Route Web Caching
,
2002,
IEEE Trans. Computers.
[8]
Li Fan,et al.
Web caching and Zipf-like distributions: evidence and implications
,
1999,
IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).