187,638 research outputs found
Correlated Resource Models of Internet End Hosts
Understanding and modelling resources of Internet end hosts is essential for
the design of desktop software and Internet-distributed applications. In this
paper we develop a correlated resource model of Internet end hosts based on
real trace data taken from the SETI@home project. This data covers a 5-year
period with statistics for 2.7 million hosts. The resource model is based on
statistical analysis of host computational power, memory, and storage as well
as how these resources change over time and the correlations between them. We
find that resources with few discrete values (core count, memory) are well
modeled by exponential laws governing the change of relative resource
quantities over time. Resources with a continuous range of values are well
modeled with either correlated normal distributions (processor speed for
integer operations and floating point operations) or log-normal distributions
(available disk space). We validate and show the utility of the models by
applying them to a resource allocation problem for Internet-distributed
applications, and demonstrate their value over other models. We also make our
trace data and tool for automatically generating realistic Internet end hosts
publicly available
Internet scheduling environment with market-driven agents
This paper describes a new generation scheduling paradigm, the Internet scheduling environment. It is formed by a group of Internet scheduling agents which share computational resources to solve scheduling problems in a distributed and collaborative manner. We propose a migration scheme to transform existing standalone scheduling systems to Internet scheduling agents that can communicate with each other and solve problems beyond individual capabilities. To coordinate computational resource collaboration among agents, we introduce the market-based control mechanism is which self-interested agents initiate or participate in auctions to sell or buy scheduling problems. Efficient allocation of computational resources is achieved through the auctions. This paper also describes a prototype Internet scheduling environment named LekiNET, which is migrated from LEKIN®, a flexible job shop scheduling system. The experiments on the LekiNET testbed demonstrate that the agent-based market-driven Internet scheduling environment is feasible and advantageous to future scheduling research and development.published_or_final_versio
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
Small-world networks, distributed hash tables and the e-resource discovery problem
Resource discovery is one of the most important underpinning problems behind producing a scalable,
robust and efficient global infrastructure for e-Science. A number of approaches to the resource discovery
and management problem have been made in various computational grid environments and prototypes
over the last decade. Computational resources and services in modern grid and cloud environments can be
modelled as an overlay network superposed on the physical network structure of the Internet and World
Wide Web. We discuss some of the main approaches to resource discovery in the context of the general
properties of such an overlay network. We present some performance data and predicted properties based
on algorithmic approaches such as distributed hash table resource discovery and management. We describe
a prototype system and use its model to explore some of the known key graph aspects of the global
resource overlay network - including small-world and scale-free properties
M-grid: Using Ubiquitous Web Technologies to create a Computational Grid
There are many potential users and uses for grid computing. However, the concept of sharing computing resources excites security concerns and, whilst being powerful and flexible, at least for novices, existing systems are complex to install and use. Together these represent a significant barrier to potential users who are interested to see what grid computing can do. This paper describes m-grid, a system for building a computational grid which can accept tasks from any user with access to a web browser and distribute them to almost any machine with access to the internet and manages to do this without the installation of additional software or interfering with existing security arrangements
- …