Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

Fair throughput allocation in Information-Centric Networks

Title: Fair throughput allocation in Information-Centric Networks
Authors: Bonald, Thomas; Mekinda, Léonce; Muscariello, Luca
Contributors: Laboratory of Information, Network and Communication Sciences (LINCS); Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom Paris (IMT); Télécom ParisTech; Orange Labs Issy les Moulineaux; France Télécom; Cisco Systems; CISCO Systems, Inc
Source: ISSN: 1389-1286.
Publisher Information: CCSD; Elsevier
Publication Year: 2017
Subject Terms: ICN; Caching; Fairness; Network Performance Analysis; [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]; [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]
Description: International audience ; Cache networks are the cornerstones of today's Internet, helping it to scale by an extensive use of Content Delivery Networks (CDN). Benefiting from CDN's successful insights, ubiquitous caching through Information-Centric Networks (ICN) is increasingly regarded as a premier future Internet architecture contestant. However, the use of in-network caches seems to cause an issue in the fairness of resource sharing among contents. Indeed, in legacy communication networks, link buffers were the principal resources to be shared. Under max-min flow-wise fair bandwidth sharing [14], content throughput was not tied to content popularity. Including caches in this ecosystem raises new issues since common cache management policies such as probabilistic Least Recently Used (p-LRU) or even more, Least Frequently Used (LFU), may seem detrimental to low popularity objects, even though they significantly decrease the overall link load [3]. In this paper, we demonstrate that globally achieving LFU is a first stage of content-wise fairness. Indeed, any investigated content-wise α-fair throughput allocation permanently stores the most popular contents in network caches by ensuring them a cache hit ratio of 1. As ICN caching traditionally pursues LFU objectives, content-wise fairness specifics remain only a matter of fair bandwidth sharing, keeping the cache management intact.
Document Type: article in journal/newspaper
Language: English
DOI: 10.1016/j.comnet.2017.05.019
Availability: https://hal.science/hal-01590684; https://hal.science/hal-01590684v1/document; https://hal.science/hal-01590684v1/file/BMM17.pdf; https://doi.org/10.1016/j.comnet.2017.05.019
Rights: https://about.hal.science/hal-authorisation-v1/ ; info:eu-repo/semantics/OpenAccess
Accession Number: edsbas.20B3028
Database: BASE