Two-Level Heuristic Algorithm for Utility-Based Data Placement and Rate Allocation in Content-Aware Networks

Abstract

Content-Aware networking is the paradigm of network design, in which users' requests refer to the content instead of servers' addresses for accessing data. Such network architecture assumes that it is the responsibility of the network itself to locate content and deliver it to the user in the most efficient way. In Content-Aware Network (CAN), data objects are replicated on multiple server machines, on behalf of content publishers, with the use of caching protocol. Client user access the content from the most appropriate server, at the rate allocated by the CAN, which affects the perceived utility. In this paper the problem of content placement and transmission rate allocation is considered. The problem is formulated as maximizing the total income of CAN operator, which receives payments proportional to the utility from subscribed users. However, CAN operator needs to pay for link utilization to the physical network operator and for server storage space to the hosting company. A two-level decomposition algorithm is presented which can be used as a decision support tool for the CAN operator.