Decentralized algorithm for joint data placement and rate allocation in content-aware networks

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a mathematical model of data delivery in Content-Aware Network (CAN) is studied. Such network architecture assumes that users access data objects (content) replicated on a number of cache servers. A CAN operator decides on the placement of data objects on behalf of the content publishers, and decides on the transmission rate allocation of users (content consumers downloading content, and publishers uploading and updating their content). A problem of minimizing the mean transmission delay is considered and formulated as a mixed-integer programming problem. Decomposition-based heuristic is proposed, which utilizes projected gradient descent and greedy strategy. The algorithm is presented as a decentralized protocol, embedded in the network architecture. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Ga̧sior, D., & Drwal, M. (2012). Decentralized algorithm for joint data placement and rate allocation in content-aware networks. In Communications in Computer and Information Science (Vol. 291 CCIS, pp. 32–44). https://doi.org/10.1007/978-3-642-31217-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free