The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Large scale graph processing represents an interesting challenge due to the characteristics of the graph structure. Generally, a distributed graph processing framework is a better choice for large graphs with billions of edges. However, traditional iterative computation models like BSP under-perform due to large communication overheads and slow iterative convergence in a distributed environment. Here,...
Betweenness centrality of a node represents its influence over the spread of information in the network. It is normally defined as the ratio of the number of shortest paths passing through the node among all shortest paths. However, the spread of information may not just pass through the shortest paths which is captured by a new measure of betweenness centrality based on random walks [1]. The random...
This paper initiates the studies of parallel algorithm for core maintenance in dynamic graphs. The core number is a fundamental index reflecting the cohesiveness of a graph, which is widely used in large-scale graph analytics. We investigate the parallelism in the core update process when multiple edges and vertices are inserted. Specifically, we discover a structure called superior edge set, the...
Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-distributed central offices (COs) is not straightforward. Unlike most existing centralized schemes in clouds, VNFs of a service chain usually need to be deployed in multiple COs due to limited...
By softwarizing traditional dedicated hardware based functions to virtualized network functions (VNFs) that can run on standard commodity servers, network function virtualization (NFV) technology promises high efficiency, flexibility and scalability. To NFV service providers, one primary concern is to maximize network throughput and reduce service time. To reach this goal, two main challenges should...
Existing parallel SPARQL query optimizers assume hash-based data partitioning and adopt plan enumeration algorithms with unnecessarily high complexity. Therefore, they cannot easily accommodate other partitioning methods and only consider an unnecessarily limited plan space. To address these problems, we first define a generic RDF data partitioning model to capture the common structure of various...
With an increasing amount of electronic documents,screen-based reading becomes popular, how toimprove the ability of reading deeply and sustaining aprolonged engagement in reading is one of challenges in a digital environment. In this paper, we describe a semantic analysis framework for proactively decreasing fragmented time while screen-based reading. The central idea is to utilize semantic analysis...
Efficient event stream dissemination is a challenging problem in large-scale Online Social Network (OSN) systems due to the costly inter-server communications caused by the per-user view data storage. To solve the problem, previous schemes mainly explore the structure of the social graphs to reduce the inter-server traffics. Based on the observation of high cluster coefficient in OSNs, a state-of-the-art...
Cloud-based video encoding has become more and more popular in Internet, especially for mobile clients, considering their limited resources. Recently, GPUs (Graphics Processor Units) make the cloud-based video encoding more economic and efficient. However, the motion estimation in inter prediction, which usually occupies about 70% encoding time in H.264/AVC, is still a big headache because of its...
In this paper, we propose an O(N) time distributed algorithm for computing betweenness centralities of all nodes in the network where N is the number of nodes. Our distributed algorithm is designed under the widely employed CONGEST model in the distributed computing community which limits each message only contains O(log N) bits. To our best knowledge, this is the first linear time deterministic distributed...
Rendezvous is a fundamental process in constructing cognitive radio networks (CRNs), in which two users find a common channel for communication. The licensed spectrum is assumed to be divided into n non-overlapping channels and the users can sense the spectrum by equipping with cognitive radios. Most of previous works assume that the user can find a set of available channels (the channels not occupied...
The data explosion in the emerging big data era imposes a big burden on the network infrastructure. This vision has urged the evolution of computer networks. By softwarizing traditional dedicated hardware based functions to virtualized network function (VNF) that can run on standard commodity servers, network function virtualization (NFV) technology promises increased networking efficiency, flexibility...
Finding Strongly Connected Components (SCCs) in graphs is one of the important research topics of graph data mining. Traditional methods of finding SCCs need to fully load the whole graph into the main memory of a computer before actual processing. However, with the rapid growth of real-world graphs, the sizes of graphs easily exceed the main memory space of an ordinary computer. The distributed graph...
For many data mining and machine learning tasks, the quality of a similarity measure is the key for their performance. To automatically find a good similarity measure from datasets, metric learning and similarity learning are proposed and studied extensively. Metric learning will learn a Mahalanobis distance based on positive semi-definite (PSD) matrix, to measure the distances between objectives,...
The increasing popularity of photo sharing in social networking service (SNS) complicates the challenge of storing and transmitting large photo data for SNS providers. Distributed web caches are generally used by SNS providers to improve data transmission performance effectively. Two critical factors affect the efficiency of web caches: storage media and replacement algorithms. Solid-state drive (SSD)...
Code offloading has been proposed to improve the performance and energy-efficiency of mobile devices by sending heavy computation tasks to resourceful cloud, instead of executing all tasks on local mobile devices. Unfortunately, current code offloading techniques are not efficient enough because of high communication cost. In this paper, we propose a novel code offloading strategy with cellular traffic...
With the development of cloud computing, there is a growing number of virtual machines (VMs) in the IaaS cloud. The VM owners can install different kinds of software on demand. However, if the software is not updated in time, it would be a great threat to the security of the cloud. But for the VM owners, it is a tedious task to keep all of the installed software up to date. In this paper we present...
With the development of modern computer technology, the growth of purchase funds for storage equipment is far behind the growth of data. How to effectively use the limited storage resources to store data becomes the focus of our research and the data compression technology is the key to solve this problem. The traditional compression technology on the CPU platform could not meet the requirements for...
With the recent findings of excellent emission and absorption characteristics in carbon nanotubes (CNTs), new CMP prototypes with on-chip antennas are now available.Wireless NoC becomes a promising technique among all the CMP interconnection alternatives. By using a recursively defined structure, the two-tier hybrid wireless/wired WCube [1] on-chip interconnecting network scales exponentially with...
Datacenter networks suffer unpredictable performance due to a lack of application level bandwidth guarantees. A lot of attentions have been drawn to solve this problem such as how to provide bandwidth guarantees for Virtualized Machines (VMs), proportional bandwidth share among tenants, and high network utilization under peak traffic. However, existing solutions fail to cope with highly dynamic traffic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.