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.
In most differential evolution (DE) algorithms, little work for the design of the mutation operator is directly relevant to the information of fitness landscape of the problem being solved. As the previous studies show, different mutation strategies are suitable for different problems with different fitness landscapes, and the performance of the mutation strategy is tightly linked to the fitness landscape...
Container, as a light-weight virtualization solution, emerges in recent years, and provides effective approaches for managing computing resources. Due to the complexity of the containerized computing environment, setting up runtime configuration presents a great challenge. To make better use of hardware resources and simplify the processes of environment setup, we propose a resource provisioning approach...
In this paper, we study the probabilistic caching for an N-tier wireless heterogeneous network (HetNet) using stochastic geometry. A general and tractable expression of the successful delivery probability (SDP) is first derived. We then optimize the caching probabilities for maximizing the SDP in the high signal-to-noise ratio (SNR) region. The problem is proved to be convex and solved efficiently...
To reduce the average file delivery time under limited backhaul bandwidth, a fractional dynamic caching scheme, that coordinates the utilization of the backhaul and the cache storage, is proposed in this paper. In our scheme, only parts of the files are pre-fetched and stored in the static storage segment of small base stations (SBSs), while the remaining parts of the files will be fetched into the...
The shared computational resources provided by the mobile cloud computing paradigm offer the opportunity for mobile devices to reduce the energy expended, or the latency incurred, in performing significant computational tasks. To maximize their impact, cloud computing systems must jointly optimize the allocation of the computational and radio resources. We consider a scenario in which two mobile users...
In this paper, we investigate the problem of energy-efficiency for physical layer multicasting in multi-cell network under the assumption that only downlink channel distribution information (CDI) is available at the base station. Each BS, equipped with multiple antennas, uses a single beamformer to convey a common information to a group of single antenna users. The problem is formulated as the global...
Recognizing the central role of Lagrange multipliers in network resource allocation, a novel learn-and-adapt stochastic dual gradient (LA-SDG) method is developed in this paper to learn the empirical optimal Lagrange multiplier from historical data, and adapt to the upcoming resource allocation strategy. Remarkably, it only requires one more sample (gradient) evaluation than the celebrated stochastic...
Particle Swarm Optimization (PSO) is a powerful algorithm that can search a solution for a function which contains a large number of peaks and valleys. However, PSO might encounter a difficulty when the function gets more complex or the number of attributes (dimensions) grows larger. This paper proposes a modification of PSO by using the incremental attribute strategy along with the centroid of particle's...
Optimal node placement is studied for multi-hop free-space optical communications where any node can be a user. The lognormal weak turbulence channel is assumed. First, the problem of node placement is formulated as a constrained multi-objective optimization problem. Then, according to the priority of each user, the multi-objective problem is simplified to a constrained single-objective problem where...
To meet the challenges of big data stream mobile computing, several low power methods are proposed on processor micro-architecture level to improve the energy efficiency in the process of communication, which includes: (1) A heterogeneous variable-length VLIW architecture with power saving mode is introduced to reduce data path power. (2) Concatenating operation is employed to forward intermediate...
With the development of web service technology, identifying and discovering the users with similar preferences have an important significance to service selection and service optimization in the service environment. In order to divide the users into groups based on their preference similarity in the process of service selection, a combination-based clustering algorithm, named AAK, is presented in...
Data-parallel jobs transfer massive amounts of data between a series of successive stages. The coflow abstraction is proposed to represent a group of parallel flows between two stages and efficiently improves stage-level performance. However, state-of-the-art coflow scheduling techniques are agnostic to the jobs' inter-coflow semantics and thus are suboptimal in reducing the average job completion...
In this paper, we propose an optimal resource pool management for sharable VNFs in service chaining. In the proposed method, each resource pool is managed to place each VNF in servers for multiple service chains by solving an optimization problem. In the optimization problem, VNFs that are shared by multiple service chains are determined, and an appropriate amount of resources can be used for each...
The development, implementation, variant, and future directions of a new swarm intelligence algorithm, brain storm optimization (BSO) algorithm, are comprehensively surveyed. Brain storm optimization algorithm is a new and promising swarm intelligence algorithm, which simulates the human brainstorming process. Through the convergent operation and divergent operation, individuals in BSO are grouped...
Modern datacenters are increasingly required to deal with latency-sensitive applications. A major question here is how to represent latency in desired objectives. Incorporation of multiple traffic characteristics (e.g., packet values and required processing requirements) significantly increases the complexity of buffer management policies. In this work, we consider weighted throughput optimization...
The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter V in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon...
This paper proposes an algorithm for optimal decentralized traffic engineering in communication networks. We aim at distributing the traffic among the available routes such that the network utility is maximized. In some practical applications, modeling network utility using non-concave functions is of particular interest, e.g., video streaming. Therefore, we tackle the problem of optimizing a generalized...
The future generation of transportation system will be featured by electrified public transportation. To fulfill metropolitan transit demands, electric vehicles (EVs) must be continuously operable without recharging downtime. Wireless Power Transfer (WPT) techniques for in-motion EV charging is a solution. It however brings up a challenge: how to deploy charging lanes in a metropolitan road network...
The content delivery network (CDN) intensively uses cache to push the content close to end users. Over both traditional Internet architecture and emerging cloud-based framework, cache allocation has been the core problem that any CDN operator needs to address. As the first step for cache deployment, CDN operators need to discover or estimate the distribution of user requests in different geographic...
Distributed storage systems are known to be susceptible to long tails in response time. It has been shown that in modern online applications such as Bing, Facebook, and Amazon, the long tail of latency is of particular concern, with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique in distributed storage to achieve high data...
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.