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.
This paper proposes a distributed peer-to-peer data lookup technique on DHTs in order to serve range queries over multiple attributes. The scheme, MARQUES, uses space filling curves to map multi-attribute data points to a one-dimensional key space and thus effectively converts multi-attribute range queries into a consecutive series of one-dimensional keys. These keys are then used to place or lookup...
Event matching is the process of checking high volumes of events against large numbers of subscriptions and is a fundamental issue for the overall performance of a large-scale distributed publish/subscribe system. Most existing algorithms are based on counting satisfied component constraints in each subscription. As the scale of a system grows, these algorithms inevitably suffer from performance degradation...
As a space-efficient approach to data archive and backup, data deduplication is becoming increasingly popular in storage systems. However, as the data growing rapidly in data centers, single-node storage node is no longer be able to provide the corresponding throughput and capacities as expected. Building deduplication clusters is considered as a promising strategy to leverage such bottle-neck on...
Congestion is a problem of paramount importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources. Sensor nodes are prone to failure and the misbehavior of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased...
The following routing problem in a queueing system with non-classical information structure is investigated in discrete time. A service system consists of two service stations and two controllers; one controller is affiliated with each station. Each station has an infinite size buffer. The service stations provide the same service with identical Bernoulli(μ) service time distributions and identical...
By leveraging node mobility and exploring a store-carry-and-forward paradigm, delay-tolerant networking enables and assists end-to-end message delivery in many scenarios, e.g., vehicular ad hoc networks and mobile social networks. Most existing work in the literature either focuses on the routing strategies for unicast, or history-based routing for multicast communications. In this paper, we discover...
Many high-performance networks support both advance and immediate bandwidth reservations, the former reserving bandwidth ahead of time in a future time slot to provide guaranteed bandwidth, while the latter allocating bandwidth upon availability in the next immediate time slot. As a result, an ongoing data transfer task based on an immediate reservation may be preempted by the activation of an advance...
Traditional text retrieval techniques greatly consume system resources. Although some file-sharing software realizes file positioning and high-speed downloads, they have no enough capacity to analysis variety format Chinese documents and to extract keywords. At the same time, during the operation of system, it exist hot issues in network routing. This paper proposes an intelligent distributed text...
The enhanced hypercube(denoted by Qn,k) is a very important network model because of its excellent properties which are superior to the corresponding properties of hypercube. For a given connected graph G of order n, a routing R is a set of n(n - 1) simple paths specified for each ordered pair of vertices in G. The load of a vertex (resp.edge) for a given routing R is the number of paths going through...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
We propose QUEST (QUality ESTimation), a new method that accurately estimates IEEE 802.11 wireless link quality with no in-band signaling overhead. Existing link quality estimation methods either are based on hello exchanges by fixing or varying transmission rates or rely on the history (e.g., delivery ratio) of previously sent data packets in a per-rate/-neighbor manner. QUEST on the other hand,...
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.