Search results for "resource allocation."
showing 10 items of 138 documents
A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling
2009
We consider the problem of allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. More specifically, the user is presented with `n ' sets of data points, S 1 , S 2 , ..., S n , where the set S i has N i points drawn from two classes {*** 1 , *** 2 }. A random sample in set S i belongs to *** 1 with probability u i and to *** 2 with probability 1 *** u i , with {u i }. i = 1, 2, ...n , being the quantities to be learnt. The problem is both interesting and non-trivial because while both n and each N i are large, the number of samples that can be drawn is bounded by a constant, c . We solve the problem by first modelling it a…
The simulation and analysis of the revenue critierion based adaptive WFQ
2003
This paper presents the simulation and analysis of the adaptive resource allocation model, which was proposed and theoretically considered in our previous works. It relies upon the Weighted Fair Queueing (WFQ) service policy and uses the revenue criterion to adjust weights. The purpose of the proposed model is to maximize a provider's revenue and, at the same time, ensure the required Quality-of-Service (QoS) for end-users. Our previous works provided the theoretical evaluation of the proposed model and considered the single-node case only. This paper presents more realistic network scenario, which includes a set of clients and several intermediate switching nodes with the proposed model. T…
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation
2019
Abstract REACT is a distributed resource allocation protocol used to negotiate a max–min allocation of airtime for multi-hop ad hoc wireless networks. Two approaches are proposed for a node to realize its REACT allocation in a contention-based MAC protocol. This is achieved by tuning its contention window to a value that corresponds to its allocation. Only a change in the allocation, due to a change in local traffic requirements or local network views, results in re-tuning. The approaches for tuning are implemented in commercial Wi-Fi devices and their stability and convergence are studied experimentally in the w-iLab.t wireless network testbed. These properties are also studied analyticall…
Deep Completion Autoencoders for Radio Map Estimation
2022
Radio maps provide metrics such as power spectral density for every location in a geographic area and find numerous applications such as UAV communications, interference control, spectrum management, resource allocation, and network planning to name a few. Radio maps are constructed from measurements collected by spectrum sensors distributed across space. Since radio maps are complicated functions of the spatial coordinates due to the nature of electromagnetic wave propagation, model-free approaches are strongly motivated. Nevertheless, all existing schemes for radio occupancy map estimation rely on interpolation algorithms unable to learn from experience. In contrast, this paper proposes a…
Network-Assisted Resource Allocation with Quality and Conflict Constraints for V2V Communications
2018
The 3rd Generation Partnership Project (3GPP) has recently established in Rel. 14 a network-assisted resource allocation scheme for vehicular broadcast communications. Such novel paradigm is known as vehicle--to--vehicle (V2V) \textit{mode-3} and consists in eNodeBs engaging only in the distribution of sidelink subchannels among vehicles in coverage. Thereupon, without further intervention of the former, vehicles will broadcast their respective signals directly to their counterparts. Because the allotment of subchannels takes place intermittently to reduce signaling, it must primarily be conflict-free in order not to jeopardize the reception of signals. We have identified four pivotal types…
Data-Driven Spectrum Cartography via Deep Completion Autoencoders
2019
Spectrum maps, which provide RF spectrum metrics such as power spectral density for every location in a geographic area, find numerous applications in wireless communications such as interference control, spectrum management, resource allocation, and network planning to name a few. Spectrum cartography techniques construct these maps from a collection of measurements collected by spatially distributed sensors. Due to the nature of the propagation of electromagnetic waves, spectrum maps are complicated functions of the spatial coordinates. For this reason, model-free approaches have been preferred. However, all existing schemes rely on some interpolation algorithm unable to learn from data. …
On the Fidelity of IEEE 802.11 commercial cards
2006
The IEEE 802.11 D CF protocol is known to be fair in terms of long-term resource repartition among the contending stations. However, when considering real scenarios, where commercial 802.11 cards interact, very unpredictable as well as sometimes surprising behaviors emerge. Motivation of this paper is to investigate the reasons of the very evident disagreement between the theoretical IEEE 802.11 DCF protocol models and its practical implementations. Inparticular, we try to characterize the card behavior not only in terms of perceived throughput, but also in terms of low-level channel access operations. In fact, the simple throughput analysis does not allow to identify what affecting paramet…
On Utilizing Stochastic Non-linear Fractional Bin Packing to Resolve Distributed Web Crawling
2014
This paper deals with the extremely pertinent problem of web crawling, which is far from trivial considering the magnitude and all-pervasive nature of the World-Wide Web. While numerous AI tools can be used to deal with this task, in this paper we map the problem onto the combinatorially-hard stochastic non-linear fractional knapsack problem, which, in turn, is then solved using Learning Automata (LA). Such LA-based solutions have been recently shown to outperform previous state-of-the-art approaches to resource allocation in Web monitoring. However, the ever growing deployment of distributed systems raises the need for solutions that cope with a distributed setting. In this paper, we prese…
Optimal Resource Discovery Paths of Gnutella2
2008
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
Real-time transmission over Switched Ethernet using a contracts based framework
2009
Switched Ethernet is being used for real time transmissions in industrial automation more and and more. Most modern industrial switches are equipped with mechanisms to deal with time predictability. However, real-time transmission not only requires these mechanisms, but also the proper policies for managing network resources. This paper proposes the use of contracts. A contract is a set of transmission specifications which are negotiated between the applications and the run-time support. They define the application workload and the required performance guarantees. We implement contracts for real-time streaming as an extension of FRESCOR (Framework for Real-time Embedded Systems based on COn…