Content search and routing under custodian unavailability in information-centric networks
| Autor: | Anubhab Banerjee, Chintha Tellambura, Bitan Banerjee, Anand Seetharam |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer Networks and Communications
Computer science business.industry 05 social sciences 050801 communication & media studies 020206 networking & telecommunications Denial-of-service attack 02 engineering and technology Internet topology 0508 media and communications Server 0202 electrical engineering electronic engineering information engineering The Internet Cache Routing (electronic design automation) Unavailability business Computer network |
| Zdroj: | Computer Networks. 141:92-101 |
| ISSN: | 1389-1286 |
| Popis: | Dealing with the sudden unavailability of content custodians (origin servers) in a network has received limited attention in information-centric networks (ICN). We consider a scenario where the content custodians in an ICN are temporarily unavailable, possibly due to reasons such as device malfunctioning, power outage or Denial of Service (DoS) attacks. In contrast to the traditional host-centric Internet, users can still be served in an ICN as content is cached at in-network nodes. We begin by making the observation that if caches continue to operate using their native cache insertion and eviction policies after the content custodians become unavailable, over time the network content diversity decreases. Therefore, we recommend freezing network caches once the custodians become unavailable. We then propose a routing and search algorithm, Content Exploration under Server Unavailability (CESU), that uses breadcrumbs to effectively locate content cached at in-network nodes and serve user requests when the custodians are unavailable. We perform extensive simulations on real Internet topologies in the Icarus simulator and demonstrate that CESU can efficiently locate content cached in the network. CESU outperforms shortest path routing in terms of content requests served by 56% on average, and achieves up to 98.5% of the total request serving potential. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect