Search results for "Resource allocation"
showing 10 items of 142 documents
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…
Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game
2012
Published version of an article in the journal: Applied Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/s10489-012-0346-z The two-armed bandit problem is a classical optimization problem where a decision maker sequentially pulls one of two arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions are unknown, and thus, one must balance between exploiting existing knowledge about the arms, and obtaining new information. Bandit problems are particularly fascinating because a large class of real world problems, including routing, Quality of Service (QoS) control, game playing, and resource allocation, can be solved …
A graph colouring model for assigning a heterogeneous workforce to a given schedule
1996
Abstract We analyze a heterogeneous workforce assignment problem in which the minimum number of workers required to carry out a machine load plan is calculated. The problem is formulated as a restricted vertex colouring problem and a branch and bound algorithm is presented. The special characteristics of the graph to be coloured allow an efficient implementation of the branch and bound. Computational results show that the algorithm can solve problems of 50 activities, 5, 10 and 15 machines and between 2 to 15 different types of workers in just a few seconds.
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
2017
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …
Energy efficient and distributed resource allocation for wireless powered OFDMA multi-cell networks
2017
In this paper, we investigate the energy efficient resource allocation problem for the wireless powered OFDMA multi-cell networks. In the considered system, the users who have data to transmit in the uplink can only be empowered by the wireless power obtained from multiple base stations (BSs) with a large scale of multiple antennas in the downlink. A time division protocol is considered to divide the time of wireless power transfer (WPT) in the downlink and wireless information transfer (WIT) in the uplink into separate time slot. With the objective to improve the energy efficiency (EE) of the system, we propose the antenna selection, time allocation, subcarrier and power allocation schemes…
Allocation des ressources dans l’informatique en brouillard le calcul du brouillard véhiculaire pour une utilisation optimale des véhicules électriqu…
2019
Abstract: Technological advancements made it possible for Electric vehicles (EVs) to have onboard computation, communication, storage, and sensing capabilities. Nevertheless, most of the time these EVs spend their time in parking lots, which makes onboard devices cruelly underutilized. Thus, a better management and pooling these underutilized resources together would be strongly recommended. The new aggregated resources would be useful for traffic safety applications, comfort related applications or can be used as a distributed data center. Moreover, parked vehicles might also be used as a service delivery platform to serve users. Therefore, the use of aggregated abundant resources for the …
University Governance and Finance: The Impact of Changes in Resource Allocation on Decision Making Structures
2002
When trying to account for changes that take place over time in the structure of any organisation, social scientists often use a conceptual framework known as resource dependency theory. This theory assumes that organisations survive only if they are able to react to changes that occur in the world around them in order to obtain the resources they need to stay in operation. Since they have the capacity for independent action, organisations are not passively shaped by their environment; they sometimes are also able to influence it.
On Unstructured File Sharing Networks
2007
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple connections on multiple paths so as to accelerate data transfer. We model this interaction with an unstructured file sharing game. Users are players and their strategies are the numbers of sessions on available paths. We consider a general bandwidth sharing framework proposed by Kelly [1] and Mo and Walrand [2], with TCP as a special case. Furthermore, we incorporate the Tit-for-Tat strategy (adopted by BitTorrent [3] networks) into the unstructured file sharing game to model the competition in which a connection can be …
Face Processing on Low-Power Devices
2009
The research on embedded vision-based techniques is considered nowadays as one of the most interesting matters of computer vision. In this work we address the scenario in which a real-time face processing system is needed to monitor people walking through some locations. Some face detection (e.g., Viola-Jones face detector) and face recognition (e.g., eigenfaces) approaches have reached a certain level of maturity, so we focused on the development of such techniques on embedded systems taking into account both hardware and software constraints. Our goal is to detect the presence of some known individuals inside some sensitive areas producing a compact description of the observed people. Cap…