Online Social Network Data Placement over Clouds
Lei Jiao
Doctoral thesis
Date of Examination:
2014-07-10
Date of issue:
2014-08-11
Advisor:
Fu, Xiaoming Prof. Dr.
Referee:
Li, Jun Prof. Dr.
Referee:
Hogrefe, Dieter Prof. Dr.
Persistent Address: http://hdl.handle.net/11858/00-1735-0000-0022-5F4A-3
Files in this item
Name:
Thesis.pdf
Size:
1,4 MB
Format:
PDF
The following license files are associated with this item:
Abstract
English
Internet services today are often deployed and operated in data centers and clouds; users access and use the services by connecting to such data centers from their computing devices. For availability, fault tolerance, and proximities to users at diverse regions, a service provider often needs to run the service at multiple data centers or clouds that are distributed at different geographic locations, while aiming to achieve many system objectives, e.g., a service provider may want to reduce the money spent in using cloud resources, provide satisfactory service quality, data availability to users, limit the carbon footprint of the service, and so on. Inside a data center, a service provider is also concerned about some system objectives, e.g., running a service across servers may need to diminish the traffic that passes the oversubscribed core of the data center network. A variety of system objectives can be addressed by carefully splitting and placing data at different clouds or servers. For instance, different clouds may charge different prices and emit different amounts of carbon for executing the same workload; they also have different proximities to users. Different servers inside a data center could reside at different positions in the data center network, where the traffic between servers at a common rack does not affect the network core but the traffic between servers at different racks may do. It is important for a service provider to make right decisions about where to place users' data over a group of clouds or servers, as data placement influences system objectives. This thesis investigates the data placement problem for the Online Social Network (OSN) service, one of the most popular Internet services nowadays. Data placement for the OSN service has many challenges. First of all, users' data are interconnected. Ideally, the data of a user and the data of her friend should be co-located at the same cloud or server so that the user can access all the required data at a single site, saving any possible additional delay and traffic going across cloud or sever boundaries. Secondly, the master-slave replication complicates the data placement. A user may have a master replica that accepts both read and write operations and several slave replicas that only accept read operations; master and slave contribute differently to different system objectives and the best locations to place them can also be different. Thirdly, if multiple system objectives are considered, they are often intertwined, contradictory, and cannot be optimized simultaneously. Saving expense needs data to be placed at cheap clouds; reducing carbon prefers data to be placed at clouds with less carbon intensity; providing short latency requires data be placed close to users; data of friends also need to be co-located. All these requirements cannot be met at the same time and we desire a certain approach to seek trade-offs. On the other hand, in the scenario inside a data center, the topology of data center networks matters because, for different topologies, one often has different network traffic performance goals and thus different optimal data placements. Our contribution is that we study three different settings of the OSN data placement problem by a combination of modeling, analysis, optimization, and extensive simulations, capturing real-word scenarios in different contexts while addressing all the aforementioned challenges. In the first problem, we optimize the service provider’s monetary expense in using resources of geo-distributed clouds with guaranteed service quality and data availability, while ensuring that relevant users' data are always co-located. Our proposed approach is based on swapping the roles, master or slave, of a user's data replicas. In the second problem, we optimize multiple system objectives of different dimensions altogether when placing data across clouds by proposing a unified approach of decomposing the problem into two subproblems of placing masters and slaves respectively. We leverage the graph cuts technique to solve the master placement problem and use a greedy approach to place slaves. In the third problem, focused on the scenario inside a single data center, we encode different data center network topologies and performance goals into our data placement problem and solve it by borrowing our previous idea of swapping the roles of replicas and adapting it to reaching network performance goals while doing role-swaps. To validate our proposed approaches for each problem, we carry out extensive evaluations using real-world large-scale data traces. We demonstrate that, compared with state-of-the-art, de facto, and baseline methods, our approaches have significant advantages in saving the monetary expense, optimizing multiple objectives, and achieving various data center network performance goals, respectively. We also have discussions on complexity, optimality, scalability, design alternatives, etc.
Keywords: cloud computing; data centers; online social networks; optimization
