53,994 research outputs found
Understanding collaboration in volunteer computing systems
Volunteer computing is a paradigm in which devices participating in a distributed environment share part of their resources to help others perform their activities. The effectiveness of this computing paradigm depends on the collaboration attitude adopted by the participating devices. Unfortunately for software designers it is not clear how to contribute with local resources to the shared environment without compromising resources that could then be required by the contributors. Therefore, many designers adopt a conservative position when defining the collaboration strategy to be embedded in volunteer computing applications. This position produces an underutilization of the devices’ local resources and reduces the effectiveness of these solutions. This article presents a study that helps designers understand the impact of adopting a particular collaboration attitude to contribute with local resources to the distributed shared environment. The study considers five collaboration strategies, which are analyzed in computing environments with both, abundance and scarcity of resources. The obtained results indicate that collaboration strategies based on effort-based incentives work better than those using contribution-based incentives. These results also show that the use of effort-based incentives does not jeopardize the availability of local resources for the local needs.Peer ReviewedPostprint (published version
Cross-layer scheduling and resource allocation for heterogeneous traffic in 3G LTE
3G long term evolution (LTE) introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS) characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP) and real-time traffic such as voice over internet protocol (VoIP). Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility) under different constraints. We compared our proposed algorithm with proportional fair (PF), exponential proportional fair (EXP-PF), and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics
Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model
We show that a steady-state stock-flow consistent macro-economic model can be
represented as a Constraint Satisfaction Problem (CSP).The set of solutions is
a polytope, which volume depends on the constraintsapplied and reveals the
potential fragility of the economic circuit,with no need to study the dynamics.
Several methods to compute the volume are compared, inspired by operations
research methods and theanalysis of metabolic networks, both exact and
approximate.We also introduce a random transaction matrix, and study the
particularcase of linear flows with respect to money stocks
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Knowledge Discovery in the SCADA Databases Used for the Municipal Power Supply System
This scientific paper delves into the problems related to the develop-ment of
intellectual data analysis system that could support decision making to manage
municipal power supply services. The management problems of mu-nicipal power
supply system have been specified taking into consideration modern tendencies
shown by new technologies that allow for an increase in the energy efficiency.
The analysis findings of the system problems related to the integrated
computer-aided control of the power supply for the city have been given. The
consideration was given to the hierarchy-level management decom-position model.
The objective task targeted at an increase in the energy effi-ciency to
minimize expenditures and energy losses during the generation and
transportation of energy carriers to the Consumer, the optimization of power
consumption at the prescribed level of the reliability of pipelines and
networks and the satisfaction of Consumers has been defined. To optimize the
support of the decision making a new approach to the monitoring of engineering
systems and technological processes related to the energy consumption and
transporta-tion using the technologies of geospatial analysis and Knowledge
Discovery in databases (KDD) has been proposed. The data acquisition for
analytical prob-lems is realized in the wireless heterogeneous medium, which
includes soft-touch VPN segments of ZigBee technology realizing the 6LoWPAN
standard over the IEEE 802.15.4 standard and also the segments of the networks
of cellu-lar communications. JBoss Application Server is used as a server-based
plat-form for the operation of the tools used for the retrieval of data
collected from sensor nodes, PLC and energy consumption record devices. The KDD
tools are developed using Java Enterprise Edition platform and Spring and ORM
Hiber-nate technologies
Auction-based Bandwidth Allocation Mechanisms for Wireless Future Internet
An important aspect of the Future Internet is the efficient utilization of
(wireless) network resources. In order for the - demanding in terms of QoS -
Future Internet services to be provided, the current trend is evolving towards
an "integrated" wireless network access model that enables users to enjoy
mobility, seamless access and high quality of service in an all-IP network on
an "Anytime, Anywhere" basis. The term "integrated" is used to denote that the
Future Internet wireless "last mile" is expected to comprise multiple
heterogeneous geographically coexisting wireless networks, each having
different capacity and coverage radius. The efficient management of the
wireless access network resources is crucial due to their scarcity that renders
wireless access a potential bottleneck for the provision of high quality
services. In this paper we propose an auction mechanism for allocating the
bandwidth of such a network so that efficiency is attained, i.e. social welfare
is maximized. In particular, we propose an incentive-compatible, efficient
auction-based mechanism of low computational complexity. We define a repeated
game to address user utilities and incentives issues. Subsequently, we extend
this mechanism so that it can also accommodate multicast sessions. We also
analyze the computational complexity and message overhead of the proposed
mechanism. We then show how user bids can be replaced from weights generated by
the network and transform the auction to a cooperative mechanism capable of
prioritizing certain classes of services and emulating DiffServ and time-of-day
pricing schemes. The theoretical analysis is complemented by simulations that
assess the proposed mechanisms properties and performance. We finally provide
some concluding remarks and directions for future research
Multiservice UAVs for Emergency Tasks in Post-disaster Scenarios
UAVs are increasingly being employed to carry out surveillance, parcel
delivery, communication-support and other specific tasks. Their equipment and
mission plan are carefully selected to minimize the carried load an overall
resource consumption. Typically, several single task UAVs are dispatched to
perform different missions. In certain cases, (part of) the geographical area
of operation may be common to these single task missions (such as those
supporting post-disaster recovery) and it may be more efficient to have
multiple tasks carried out as part of a single UAV mission using common or even
additional specialized equipment.
In this paper, we propose and investigate a joint planning of multitask
missions leveraging a fleet of UAVs equipped with a standard set of accessories
enabling heterogeneous tasks. To this end, an optimization problem is
formulated yielding the optimal joint planning and deriving the resulting
quality of the delivered tasks. In addition, a heuristic solution is developed
for large-scale environments to cope with the increased complexity of the
optimization framework. The developed joint planning of multitask missions is
applied to a specific post-disaster recovery scenario of a flooding in the San
Francisco area. The results show the effectiveness of the proposed solutions
and the potential savings in the number of UAVs needed to carry out all the
tasks with the required level of quality
- …