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 this paper, we consider user selection algorithms for Multi-user MIMO systems with perfect or partial channel state information at the transmitter (CSIT). A novel user selection algorithm based on chordal distance is proposed. The basic principle is to serve the user subset in which one is approximately orthogonal to the others. Since the chordal distance relies only on the channel direction information,...
Stepping-stone is the most popular way used to attack other computers. Some insiders use stepping-stone to launch their attacks pretending to be outsiders. In this paper, we propose a novel algorithm to detect stepping-stone insider attacks through comparing outgoing and incoming connections. We modify the existing packet matching algorithm by introducing sliding window to make the algorithm more...
The distributed system made the large-scale scientific computing possible in a cost effective way. And the hardware resources in such systems are also getting much cheaper than years before. However, the problem of executing the job using minimum resources is still reasonable and important, especially for the cloud environment, who has to save energy and control cost. Unfortunately, only a few existing...
In this paper we present a replication approach which utilizes the availability information of nodes in the network. By performing Box-Jenkins's ARIMA model on the availability information, a prediction model is devised which helps to predict the future availability of the node. Based on this information highly requested data is replicated to nodes which complement each others availability in the...
Multi-resource sharings among virtual machines (VM)are very important in data center, but also bring contentions for cache, disk and network in host server. Recent studies focus primarily on locally optimizing resource sharings in a single server, or global optimization of mitigating cache and memory contentions. But it remains an open question how to efficiently find optimal co-schedules for cache,...
The recent deployment of multiprocessors (such as multicores) as the mainstream computing platform has given rise to a new concurrent programming impetus. In such a context it becomes extremely important to be able to design shared objects that can cope with the net effect of asynchrony and process crashes. This paper is a theory-oriented introduction to wait-free synchronization for such systems...
Due to limitations of power, computation capability and storage resources, wireless sensor networks are vulnerable to many attacks. The paper proposed a novel routing protocol algorithm for Wireless sensor network. The proposed routing protocol algorithm can adopt suitable routing technology for the nodes according to distance of nodes to the base station, density of nodes distribution and residual...
Based on the relaying scheme which permits the relay node to jointly encode the data information from two source nodes, a new network low density parity check (NLDPC) code is designed for the Rayleigh fading channel. Since the log-likelihood ratio (LLR) of the signal received from the fading channel is not a Gaussian random variable, the Gaussian Approximation algorithm cannot be employed directly...
Packet classification is an important topic for high speed routers nowadays. There are many packet classification algorithms based on decision tree like Hicuts, Hyper cuts and Hyper split. Because Hicuts and Hyper cuts divides the rule sets by cutting the address space into equal-sized subspaces, their cutting efficiency is not good. Although Hyper split proposed a good end-point-based cutting scheme,...
Low Extra Delay Background Transport (LEDBAT) congestion control algorithm is designed to address the unfairness problem of TCP aggravated by applications that use multiple TCP connections for data transfer. LEDBAT operates under the assumption that the queue delay at the access router of the bottleneck link will be the primary varying contributor to end-to-end one-way delay. However this assumption...
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.