Cloud computing has gained interest amongst commercial organizations, research communities, developers and other individuals during the past few years. In order to move ahead with research in field of data management and to enable processing of such data, we need benchmark datasets and freely available data which are publicly accessible. Google in May 2011 released a trace of a cluster of 11k machines referred as "Google Cluster Trace". This trace contains cell information of about 29 days. This paper provides analysis of resource usage and requirements in this trace and is an attempt to give an insight about such kind of production trace similar to the ones in cloud environment. The major contributions of this paper include statistical profile of jobs based on resource usage, clustering of workload patterns and classification of jobs into different types based on k-means clustering. Though there have been earlier works for analysis of this trace, but our analysis provides several new findings such as jobs in a production trace are trimodal and there occurs symmetry in the tasks within a long job type.
The behavior of peoples’ request for a post on online social media is a stochastic process that makes post’s ranking highly skewed in nature. We mean peoples interest for a post can grow/decay exponentially or linearly. Considering this nature of the evolutionary peoples’ interest, this paper presents a Growth-based Popularity Predictor (GPP) model for predicting and ranking the web-contents. Three different kinds of web-based real datasets namely Movielens, Facebook-wall-post and Digg are used to evaluate the performance of the proposed model. This performance is measured based on four information-retrieval metrics Area Under receiving operating Characteristic (AUC), Novelty, Precision, and Kendal’s Tau. The obtained results show that the prediction performance can be further improved if the score is mapped onto a cumulative predicted item’s ranking.
Cloud environment is usually associated with non-homogeneity and dynamicity in terms of resource usage and access at all levels. The study of this heterogeneous and non-uniform behavior is therefore an important problem. Google cluster trace which is a production trace released by Google in November 2014 serves as an example of a high scale Cloud environment. This paper deals with statistical analysis of this cluster trace. Since the size of production trace is very huge therefore, Hive which is a HadoopDistributed File System (HDFS) based platform for querying and analysis of big data, has been used. Hive was accessed through its Beeswax interface. The data was imported into HDFS through HCatalog. Apart from Hive, Pig which is a scripting language and provides abstraction on top of Hadoop was used. The method adopted deals with clustering and studying the distribution of arrival time of jobs, distribution of resource usage and also study of distribution of process runtime. To the best of our knowledge the analytical method adopted by us is novel. The findings revealed that jobs in a production trace can be classified into major, mediocre and minor resource usage types. Furthermore, it can be concluded from our study that arrival time of jobs followed weibull distribution. Usage of resources such as CPU and memory was observed to be following a zipf like distribution while study of process runtime shows that some jobs had very small values of runtime while others had very large values hence they followed heavy tailed distribution. Our analysis will help researchers in properly understanding the nonhomogenous and dynamic behavior synonymous with cloud environment. It will also help them in developing new algorithms for resource allocation and scheduling in Cloud.
This chapter presents query-broadcasting techniques used to minimize expenses of the route discovery in ad hoc networks. A broad variety of such techniques have been proposed that improved the effectiveness and efficiency in various aspects of route discovery considering time and energy. Time-to-live based broadcast is the most common controlled flooding scheme widely used in routing protocols. One category of such techniques leveraged the routing history, while other category used broadcast repealing strategy to cancel the query-broadcast after successful route discovery.