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.
Cloud computing is an innovative service platform to offer diverse resources such as infrastructure, platform and software as services. However, one challenging aspect of such a service is the impatient user threat, which directly leads to numerous negative impacts such as poor throughput, unpredictable workload and waste of resources. In this paper, the problems of conducting system controls in a...
Congestion control plays a significant role in maintaining sufficient network throughput. Variety of methods and algorithms are proposed to solve the bottleneck issue. This paper describes a method based on a particle swarm optimization algorithm and piecewise affine controller for non-stationary, discrete, dynamical model of data exchange network. This solution allows active network nodes buffer...
Typically, mobile users cluster around points of interest in dense urban environments such as city centers forming so-called data traffic hot spots and hot zones. To provide capacity to such users efficiently, mobile operators deploy small cells. However, the deployment of heterogeneous networks, which consist of overlaying macro cells and many co-channel small cells, entails many problems. One typical...
We optimize the disaster backup in multi-datacenter (multi-DC) cloud systems and design disaster-aware algorithms to realize rapid backup with the objective of minimizing the backup window for all the DCs in the network. A mixed integer linear programming (MILP) model is first formulated to optimize the backup processes of all production DCs jointly. We then develop three heuristics that use the one-step...
Cloud computing's pay-per-use model greatly reduces upfront cost and also enables on-demand scalability as service demand grows or shrinks. Hybrid clouds are an attractive option in terms of cost benefit, however, without proper elastic resource management, computational resources could be over-provisioned or under-provisioned, resulting in wasting money or failing to satisfy service demand. In this...
We propose static, dynamic and hybrid cost-awarepolicies for intersection caching and we introduce three different strategies to solve a query computing list intersections. We run experiments over a simulation framework using real data for both document collection and text queries. We observe that: a) cost-aware policies outperform cost-oblivious policies, b) static policies are better than dynamic...
Synchronous dataflow (SDF) models are gaining increased attention in designing software-intensive embedded systems. Especially in the signal processing and multimedia domain, dataflow-oriented models of computation are commonly used by designers reflecting the regular structure of algorithms and providing an intuitive way to specify both sequential and concurrent system functionality. Furthermore,...
Distributed computing systems provide a highly dynamic behavior which originates from heterogeneous computing and storage resources, heterogeneous users and the variety of submitted applications and finally from the heterogeneous communication that takes part among the systems entities. As such applying global optima oriented allocation algorithms usually produces poor results and heuristics are used...
A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher level networks. The dynamic communication performance of the HTN using the dimension-order routing under common traffic patterns have been evaluated, and have been shown to be good. However, dynamic communication performance...
In a task scheduling system for grid computing, most of algorithms such as reservation, backfilling, etc. are commonly used task scheduling algorithm. However, they have some insufficiencies in the system resource utilization rate and the response time due to these algorithms are insufficient in solving resource slot. In order to improve the system resource utilization rate and shorten the response...
Spectrum access scheme is a fundamental component in building efficient wireless networks. Conventional methods such as proactive channel assignment is costly due to large amount of protocol overhead. Also, those algorithms suffer from its inability in dealing with channel dynamics. The opportunistic methods however, spend more time on probing, and suffer from the myopic decisions as well. We present...
The latest version of IEEE 802.11s draft proposes a simple hop-by-hop congestion control framework without the specific algorithm for congestion detection and local rate control. This paper presents a dynamic pricing policy and new rate control model based congestion control scheme which works at the data link layer (DLL) over IEEE 802.11s draft. We introduce dynamic pricing function as one of the...
Usually, the radio channel allocation (RCA) problems of wireless LANs (WLANs) are solved by using various heuristic methods. However, it is not clear that the minmax problem is an NP-hard problem or not. In this paper, we consider WLANs with multiple APs that can be deployed in an ad hoc network. First, we propose a distributed heuristic algorithm (DHA) for RCA, which allocates channels in terms of...
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.