4,664 research outputs found
EVEREST IST - 2002 - 00185 : D23 : final report
Deliverable públic del projecte europeu EVERESTThis deliverable constitutes the final report of the project IST-2002-001858 EVEREST. After its successful completion, the project presents this document that firstly summarizes the context, goal and the approach objective of the project. Then it presents a concise summary of the major goals and results, as well as highlights the most valuable lessons derived form the project work. A list of deliverables and publications is included in the annex.Postprint (published version
Energy-efficient wireless communication
In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters
New dynamic bandwidth allocation algorithm analysis: DDSPON for ethernet passive optical networks
This project aims to present the state of the art in Dynamic Bandwidth Allocation (DBA) solutions, as well as the study and evaluation of one proposal of DBA algorithm: the Distributed Dynamic Scheduling for EPON (DDSPON), which is the UPC contribution to the research in scheduling algorithms for EPON
Quality of service optimization of multimedia traffic in mobile networks
Mobile communication systems have continued to evolve beyond the currently deployed Third
Generation (3G) systems with the main goal of providing higher capacity. Systems beyond 3G
are expected to cater for a wide variety of services such as speech, data, image transmission,
video, as well as multimedia services consisting of a combination of these. With the air interface
being the bottleneck in mobile networks, recent enhancing technologies such as the High Speed
Downlink Packet Access (HSDPA), incorporate major changes to the radio access segment of
3G Universal Mobile Telecommunications System (UMTS). HSDPA introduces new features
such as fast link adaptation mechanisms, fast packet scheduling, and physical layer retransmissions
in the base stations, necessitating buffering of data at the air interface which presents a
bottleneck to end-to-end communication. Hence, in order to provide end-to-end Quality of
Service (QoS) guarantees to multimedia services in wireless networks such as HSDPA, efficient
buffer management schemes are required at the air interface.
The main objective of this thesis is to propose and evaluate solutions that will address the
QoS optimization of multimedia traffic at the radio link interface of HSDPA systems. In the
thesis, a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for
multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent
flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the
real-time component of the multimedia traffic, being delay sensitive and loss tolerant, is given
transmission priority; while the non-real-time component, being loss sensitive and delay tolerant,
enjoys space priority. Hence, based on the TSP queuing paradigm, new buffer managementalgorithms are designed for joint QoS control of the diverse components in a multimedia session
of the same HSDPA user. In the thesis, a TSP based buffer management algorithm known as the
Enhanced Time Space Priority (E-TSP) is proposed for HSDPA. E-TSP incorporates flow
control mechanisms to mitigate congestion in the air interface buffer of a user with multimedia
session comprising real-time and non-real-time flows. Thus, E-TSP is designed to provide
efficient network and radio resource utilization to improve end-to-end multimedia traffic
performance. In order to allow real-time optimization of the QoS control between the real-time
and non-real-time flows of the HSDPA multimedia session, another TSP based buffer management
algorithm known as the Dynamic Time Space Priority (D-TSP) is proposed. D-TSP
incorporates dynamic priority switching between the real-time and non-real-time flows. D-TSP
is designed to allow optimum QoS trade-off between the flows whilst still guaranteeing the
stringent real-time component’s QoS requirements. The thesis presents results of extensive
performance studies undertaken via analytical modelling and dynamic network-level HSDPA
simulations demonstrating the effectiveness of the proposed TSP queuing system and the TSP
based buffer management schemes
HDeepRM: Deep Reinforcement Learning para la Gestión de Cargas de Trabajo en Clústeres Heterogéneos
ABSTRACT: High Performance Computing (HPC) environments offer users computational capability as a service. They are constituted by computing clusters, which are groups of resources available for processing jobs sent by the users. Heterogeneous configurations of these clusters allow for providing resources fitted to a wider spectrum of workloads, superior to that of traditional homogeneous approaches. This in turn improves the computational and energetic efficiency of the service.
Scheduling of resources for incoming jobs is undertaken by a workload manager following a established policy. Classic policies have been developed for homogeneous environments, with literature focusing on improving job selection policies. Nevertheless, in heterogeneous configurations the resource selection is as relevant for optimizing the offered service.
Complexity of scheduling policies grows with the number of resources and degree of heterogeneity in the service. Deep Reinforcement Learning (DRL) has been recently evaluated in homogeneous workload management scenarios as an alternative to deal with complex patterns. It introduces an artificial agent which estimates via learning the optimal scheduling policy for a given system.
In this thesis, HDeepRM, a novel framework for the study of DRL agents in heterogeneous clusters is designed, implemented, tested and distributed. This leverages a state-of-the-art simulator, and offers users a clean interface for developing their own bespoke agents, as well as evaluating them before going into production.
Evaluations have been undertaken to demonstrate the validity of the framework. Two agents based on well-known reinforcement learning algorithms are implemented over HDeepRM, and results show the research potential in this area for the scientific community.RESUMEN: Los entornos de High Performance Computing (HPC) ofrecen capacidad computacional como servicio a sus usuarios. Están formados por clústeres de cómputo, grupos de recursos que aceptan y procesan trabajos enviados por los usuarios. Las configuraciones heterogéneas permiten disponer de recursos adecuados a un espectro de cargas de trabajo superior al de los clústeres homogéneos tradicionales, mejorando la eficiencia computacional y energética del servicio.
La asociación de trabajos con recursos del sistema es llevada a cabo por un gestor de cargas de trabajo siguiendo una política de planificación. Las políticas clásicas han sido desarrolladas para entornos homogéneos, y la literatura se centra en la selección del trabajo. Sin embargo, en entornos heterogéneos la selección del recurso es de relevancia para la optimización del servicio.
La complejidad de las políticas de planificación crece con el número de recursos y la heterogeneidad del sistema. El Aprendizaje Profundo por Refuerzo o Deep Reinforcement Learning (DRL) ha sido recientemente objeto de estudio como alternativa para la gestión de cargas de trabajo. En él, se propone un agente artificial que estima mediante aprendizaje la política de planificación óptima para un determinado sistema.
En esta tesis se describe el proceso de creación de HDeepRM, un nuevo marco de trabajo cuyo objetivo es el estudio de agentes basados en DRL para la estimación de políticas de planificación en clústeres heterogéneos. Implementado sobre un simulador actual, HDeepRM permite crear y evaluar nuevos agentes antes de llevarlos a producción.
Se ha llevado a cabo el diseño, implementación, pruebas y empaquetado del software para poder distribuirlo a la comunidad científica. Finalmente, en las evaluaciones se demuestra la validez del marco de trabajo, y se implementan sobre él dos agentes basados en algoritmos de DRL. La comparación de estos con políticas clásicas muestra el potencial de investigación en este área.Máster en Ingeniería Informátic
Quality-of-service management in IP networks
Quality of Service (QoS) in Internet Protocol (IF) Networks has been the subject of
active research over the past two decades. Integrated Services (IntServ) and
Differentiated Services (DiffServ) QoS architectures have emerged as proposed
standards for resource allocation in IF Networks. These two QoS architectures
support the need for multiple traffic queuing systems to allow for resource
partitioning for heterogeneous applications making use of the networks. There have
been a number of specifications or proposals for the number of traffic queuing
classes (Class of Service (CoS)) that will support integrated services in IF Networks,
but none has provided verification in the form of analytical or empirical investigation
to prove that its specification or proposal will be optimum.
Despite the existence of the two standard QoS architectures and the large volume of
research work that has been carried out on IF QoS, its deployment still remains
elusive in the Internet. This is not unconnected with the complexities associated with
some aspects of the standard QoS architectures. [Continues.
Datacenter Traffic Control: Understanding Techniques and Trade-offs
Datacenters provide cost-effective and flexible access to scalable compute
and storage resources necessary for today's cloud computing needs. A typical
datacenter is made up of thousands of servers connected with a large network
and usually managed by one operator. To provide quality access to the variety
of applications and services hosted on datacenters and maximize performance, it
deems necessary to use datacenter networks effectively and efficiently.
Datacenter traffic is often a mix of several classes with different priorities
and requirements. This includes user-generated interactive traffic, traffic
with deadlines, and long-running traffic. To this end, custom transport
protocols and traffic management techniques have been developed to improve
datacenter network performance.
In this tutorial paper, we review the general architecture of datacenter
networks, various topologies proposed for them, their traffic properties,
general traffic control challenges in datacenters and general traffic control
objectives. The purpose of this paper is to bring out the important
characteristics of traffic control in datacenters and not to survey all
existing solutions (as it is virtually impossible due to massive body of
existing research). We hope to provide readers with a wide range of options and
factors while considering a variety of traffic control mechanisms. We discuss
various characteristics of datacenter traffic control including management
schemes, transmission control, traffic shaping, prioritization, load balancing,
multipathing, and traffic scheduling. Next, we point to several open challenges
as well as new and interesting networking paradigms. At the end of this paper,
we briefly review inter-datacenter networks that connect geographically
dispersed datacenters which have been receiving increasing attention recently
and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial
Effective Resource and Workload Management in Data Centers
The increasing demand for storage, computation, and business continuity has driven the growth of data centers. Managing data centers efficiently is a difficult task because of the wide variety of datacenter applications, their ever-changing intensities, and the fact that application performance targets may differ widely. Server virtualization has been a game-changing technology for IT, providing the possibility to support multiple virtual machines (VMs) simultaneously. This dissertation focuses on how virtualization technologies can be utilized to develop new tools for maintaining high resource utilization, for achieving high application performance, and for reducing the cost of data center management.;For multi-tiered applications, bursty workload traffic can significantly deteriorate performance. This dissertation proposes an admission control algorithm AWAIT, for handling overloading conditions in multi-tier web services. AWAIT places on hold requests of accepted sessions and refuses to admit new sessions when the system is in a sudden workload surge. to meet the service-level objective, AWAIT serves the requests in the blocking queue with high priority. The size of the queue is dynamically determined according to the workload burstiness.;Many admission control policies are triggered by instantaneous measurements of system resource usage, e.g., CPU utilization. This dissertation first demonstrates that directly measuring virtual machine resource utilizations with standard tools cannot always lead to accurate estimates. A directed factor graph (DFG) model is defined to model the dependencies among multiple types of resources across physical and virtual layers.;Virtualized data centers always enable sharing of resources among hosted applications for achieving high resource utilization. However, it is difficult to satisfy application SLOs on a shared infrastructure, as application workloads patterns change over time. AppRM, an automated management system not only allocates right amount of resources to applications for their performance target but also adjusts to dynamic workloads using an adaptive model.;Server consolidation is one of the key applications of server virtualization. This dissertation proposes a VM consolidation mechanism, first by extending the fair load balancing scheme for multi-dimensional vector scheduling, and then by using a queueing network model to capture the service contentions for a particular virtual machine placement
Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing
The availability of many-core computing platforms enables a wide variety of technical solutions for systems across the embedded, high-performance and cloud computing domains. However, large scale manycore systems are notoriously hard to optimise. Choices regarding resource allocation alone can account for wide variability in timeliness and energy dissipation (up to several orders of magnitude). Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing covers dynamic resource allocation heuristics for manycore systems, aiming to provide appropriate guarantees on performance and energy efficiency. It addresses different types of systems, aiming to harmonise the approaches to dynamic allocation across the complete spectrum between systems with little flexibility and strict real-time guarantees all the way to highly dynamic systems with soft performance requirements. Technical topics presented in the book include:
Load and Resource Models
Admission Control
Feedback-based Allocation and Optimisation
Search-based Allocation Heuristics
Distributed Allocation based on Swarm Intelligence
Value-Based Allocation
Each of the topics is illustrated with examples based on realistic computational platforms such as Network-on-Chip manycore processors, grids and private cloud environments.Note.-- EUR 6,000 BPC fee funded by the EC FP7 Post-Grant Open Access Pilo
- …