In-network cache management and resource allocation for information-centric networks
Authors: Psaras, I., Chai, W.K. and Pavlou, G.
Journal: IEEE Transactions on Parallel and Distributed Systems
Volume: 25
Issue: 11
Pages: 2920-2931
ISSN: 1045-9219
DOI: 10.1109/TPDS.2013.304
Abstract:We introduce the concept of resource management for in-network caching environments. We argue that in Information-Centric Networking environments, deterministically caching content messages at predefined places along the content delivery path results in unfair and inefficient content multiplexing between different content flows, as well as in significant caching redundancy. Instead, allocating resources along the path according to content flow characteristics results in better use of network resources and therefore, higher overall performance. The design principles of our proposed in-network caching scheme, which we call ProbCache, target these two outcomes, namely reduction of caching redundancy and fair content flow multiplexing along the delivery path. In particular, ProbCache approximates the caching capability of a path and caches contents probabilistically to: 1) leave caching space for other flows sharing (part of) the same path, and 2) fairly multiplex contents in caches along the path from the server to the client. We elaborate on the content multiplexing fairness of ProbCache and find that it sometimes behaves in favor of content flows connected far away from the source, that is, it gives higher priority to flows travelling longer paths, leaving little space to shorter-path flows. We introduce an enhanced version of the main algorithm that guarantees fair behavior to all participating content flows. We evaluate the proposed schemes in both homogeneous and heterogeneous cache size environments and formulate a framework for resource allocation in in-network caching environments. The proposed probabilistic approach to in-network caching exhibits ideal performance both in terms of network resource utilization and in terms of resource allocation fairness among competing content flows. Finally, and in contrast to the expected behavior, we find that the efficient design of ProbCache results in fast convergence to caching of popular content items.
https://eprints.bournemouth.ac.uk/24726/
Source: Scopus
In-Network Cache Management and Resource Allocation for Information-Centric Networks
Authors: Psaras, I., Chai, W.K. and Pavlou, G.
Journal: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Volume: 25
Issue: 11
Pages: 2920-2931
eISSN: 1558-2183
ISSN: 1045-9219
DOI: 10.1109/TPDS.2013.304
https://eprints.bournemouth.ac.uk/24726/
Source: Web of Science (Lite)
In-network cache management and resource allocation for information-centric networks
Authors: Psaras, I., Chai, W.K. and Pavlou, G.
Journal: IEEE Transactions on Parallel and Distributed Systems
Volume: 25
Issue: 11
Pages: 2920-2931
DOI: 10.1109/TPDS.2013.304
https://eprints.bournemouth.ac.uk/24726/
Source: Manual
In-network cache management and resource allocation for information-centric networks
Authors: Psaras, I., Chai, W.K. and Pavlou, G.
Journal: IEEE Transactions on Parallel and Distributed Systems
Volume: 25
Issue: 11
Pages: 2920-2931
ISSN: 1045-9219
Abstract:We introduce the concept of resource management for in-network caching environments. We argue that in Information-Centric Networking environments, deterministically caching content messages at predefined places along the content delivery path results in unfair and inefficient content multiplexing between different content flows, as well as in significant caching redundancy. Instead, allocating resources along the path according to content flow characteristics results in better use of network resources and therefore, higher overall performance. The design principles of our proposed in-network caching scheme, which we call ProbCache, target these two outcomes, namely reduction of caching redundancy and fair content flow multiplexing along the delivery path. In particular, ProbCache approximates the caching capability of a path and caches contents probabilistically to: 1) leave caching space for other flows sharing (part of) the same path, and 2) fairly multiplex contents in caches along the path from the server to the client. We elaborate on the content multiplexing fairness of ProbCache and find that it sometimes behaves in favor of content flows connected far away from the source, that is, it gives higher priority to flows travelling longer paths, leaving little space to shorter-path flows. We introduce an enhanced version of the main algorithm that guarantees fair behavior to all participating content flows. We evaluate the proposed schemes in both homogeneous and heterogeneous cache size environments and formulate a framework for resource allocation in in-network caching environments. The proposed probabilistic approach to in-network caching exhibits ideal performance both in terms of network resource utilization and in terms of resource allocation fairness among competing content flows. Finally, and in contrast to the expected behavior, we find that the efficient design of ProbCache results in fast convergence to caching of popular content items.
https://eprints.bournemouth.ac.uk/24726/
Source: BURO EPrints