More cooperation or coordination is necessary for future UDN (Ultra-Dense Network) scenario of 5G network, of which ICIC (Inter-Cell Interference Coordination) is a promising and typical scheme. Cooperating cellular n...
详细信息
ISBN:
(纸本)9781631900631
More cooperation or coordination is necessary for future UDN (Ultra-Dense Network) scenario of 5G network, of which ICIC (Inter-Cell Interference Coordination) is a promising and typical scheme. Cooperating cellular network may be thought as a special kind of distributedcomputing system, whose basic theory and toolsets could be adopted. CAP theory for distributedcomputing state that any networked shared-data system can have at most two of three desirable properties: consistency (C), high availability (A) and tolerance to network partitions (P) of the data. Since partition could not be avoided in such system, consistency or availability has to be forfeited to a certain extent. this paper extends the CAP theorem to the UDN case, and redefines the consistency, availability and partition-tolerance in the context of future cellular network architecture. then ICIC process are interpreted with cellular CAP theorem, and the evaluation framework is developed. An improved ICIC scheme is proposed based on such framework.
Now a days distributed systems are backbone of majority of the networked applications. It has multiple entities working collaboratively. this collaboration needs to be coordinated by an entity among the member entitie...
详细信息
Welcome to Cluj-Napoca, Romania, at the 2015 IEEE 11thinternationalconference on Intelligent Computer Communication and Processing. the main goal of this conference is providing an international forum and discussion...
详细信息
A language has been developed for queries which serves as an extension of the browsing model of hypertext systems. the query language and data model fit naturally into a distributed environment. A simple and efficient...
详细信息
ISBN:
(纸本)0818621443
A language has been developed for queries which serves as an extension of the browsing model of hypertext systems. the query language and data model fit naturally into a distributed environment. A simple and efficient method is discussed for processing distributed queries in this language. Results of experiments run on a distributed data server using this algorithm are presented.
A simple owner protocol for implementing a causal distributed shared memory (DSM) is presented, and it is argued that this implementation is more efficient than comparable coherent DSM implementations. Moreover, it is...
详细信息
ISBN:
(纸本)0818621443
A simple owner protocol for implementing a causal distributed shared memory (DSM) is presented, and it is argued that this implementation is more efficient than comparable coherent DSM implementations. Moreover, it is shown that writing programs for causal memory is no more difficult than writing programs for atomic shared memory.
We develop an online optimisation framework for self tuning of computer systems. Towards this, we first discuss suitable objective functions. We then develop an iterative technique that is robust to noisy measurements...
详细信息
ISBN:
(纸本)9783642113215
We develop an online optimisation framework for self tuning of computer systems. Towards this, we first discuss suitable objective functions. We then develop an iterative technique that is robust to noisy measurements of objective function and also requires fewer perturbations on the configuration. We essentially adapt the Nelder-Mead algorithm to work with constrained variables and also allow noisy measurements. Extensive experimental results on a queueing model and on an actual system illustrate the performance of our scheme.
A synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local cloc...
详细信息
ISBN:
(纸本)0818621443
A synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local clock. the algorithm does not require master/slave clocks and reduces the number of messages needed. As a result it is suitable for use in large distributed systems.
this is a position paper on the current state of the art in distributed Model Predictive Control (M PC) and our view on its future potential. We present results from a recent survey of 35 distributed MPC approaches. F...
详细信息
ISBN:
(纸本)9781479931064
this is a position paper on the current state of the art in distributed Model Predictive Control (M PC) and our view on its future potential. We present results from a recent survey of 35 distributed MPC approaches. For this, we propose a way in which distributed MPC approaches can be categorized for comparison. We also link the potential that these approaches have to the domain of other fields such as integrated environmental optimal decision making and cyber-physical systems. Many challenges for realizing these links have to be faced. We present our views on how the advances in several highly active research domains could be used to overcome these challenges. As such, this paper is intended as a starting point for the exploration of various novel research cooperations.
A new paradigm to design computer systems called evolving reconfigurable architecture (ERA) is proposed. Several holistic principles are introduced and pursued through the ERA design cycle. We show how reconfigurabili...
详细信息
the rapid increase in the global availability and use of the Internet has made it the most effective platform for the distribution of product information and advertising when compared to the traditional media such as ...
详细信息
ISBN:
(纸本)9781467377010
the rapid increase in the global availability and use of the Internet has made it the most effective platform for the distribution of product information and advertising when compared to the traditional media such as print, television and radio. In addition, in the case of Online Social Networks (OSN), one can take advantage of the influences that one's actions has on other users and, in particular, one's friends. Even if a user does not purchase a product, their online mention of the product can have positive or negative influences. this social behavior can be used to improve advertising strategies. For example, if a user is given an advertisement impression (a linked icon) and clicks on it then it is more likely that their friends (if told of the action) will also click if they are subsequently given the impression. In this paper we provide a Stochastic Dynamic Programming formulation of this problem together with its solution. Because of the computational complexity of the solution we provide a simple heuristic that we show to be computationally much faster.
暂无评论