230 research outputs found
A flexible algorithm to offload DAG applications for edge computing
Multi-access Edge Computing (MEC) is an enabling technology to leverage new
network applications, such as virtual/augmented reality, by providing faster
task processing at the network edge. This is done by deploying servers closer
to the end users to run the network applications. These applications are often
intensive in terms of task processing, memory usage, and communication; thus
mobile devices may take a long time or even not be able to run them
efficiently. By transferring (offloading) the execution of these applications
to the servers at the network edge, it is possible to achieve a lower
completion time (makespan) and meet application requirements. However,
offloading multiple entire applications to the edge server can overwhelm its
hardware and communication channel, as well as underutilize the mobile devices'
hardware. In this paper, network applications are modeled as Directed Acyclic
Graphs (DAGs) and partitioned into tasks, and only part of these tasks are
offloaded to the edge server. This is the DAG application partitioning and
offloading problem, which is known to be NP-hard. To approximate its solution,
this paper proposes the FlexDO algorithm. FlexDO combines a greedy phase with a
permutation phase to find a set of offloading decisions, and then chooses the
one that achieves the shortest makespan. FlexDO is compared with a proposal
from the literature and two baseline decisions, considering realistic DAG
applications extracted from the Alibaba Cluster Trace Program. Results show
that FlexDO is consistently only 3.9% to 8.9% above the optimal makespan in all
test scenarios, which include different levels of CPU availability, a
multi-user case, and different communication channel transmission rates. FlexDO
outperforms both baseline solutions by a wide margin, and is three times closer
to the optimal makespan than its competitor
Exact solution of the full RMSA problem in elastic optical networks
Exact solutions of the Routing, Modulation, and Spectrum Allocation (RMSA)
problem in Elastic Optical Networks (EONs), so that the number of admitted
demands is maximized while those of regenerators and frequency slots used are
minimized, require a complex ILP formulation taking into account frequency-slot
continuity and contiguity. We introduce the first such formulation, ending a
hiatus of some years since the last ILP formulation for a much simpler RMSA
variation was introduced. By exploiting a number of problem and solver
specificities, we use the NSFNET topology to illustrate the practicality and
importance of obtaining exact solutions.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
Exploiting web technologies to build autonomic wireless sensor networks
Most of the current wireless sensor networks are built for specific applications, with a tight coupling between them and the underlying communication protocols. We present a more flexible architectural approach for building WSNs, in which application-specific features are decoupled from the underlying communication infrastructure, although affecting the network behavior. We propose a framework based on Web technologies that provides a standard interface for accessing the network and configurable service components tailored to meet different application requirements, while optimizing the network scarce resources. Also, a set of ontologies is defined as part of the framework for representing shared knowledge of the WSN domain.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI
Optimal Resource Allocation with Delay Guarantees for Network Slicing in Disaggregated RAN
In this article, we propose a novel formulation for the resource allocation
problem of a sliced and disaggregated Radio Access Network (RAN) and its
transport network. Our proposal assures an end-to-end delay bound for the
Ultra-Reliable and Low-Latency Communication (URLLC) use case while jointly
considering the number of admitted users, the transmission rate allocation per
slice, the functional split of RAN nodes and the routing paths in the transport
network. We use deterministic network calculus theory to calculate delay along
the transport network connecting disaggregated RANs deploying network functions
at the Radio Unit (RU), Distributed Unit (DU), and Central Unit (CU) nodes. The
maximum end-to-end delay is a constraint in the optimization-based formulation
that aims to maximize Mobile Network Operator (MNO) profit, considering a cash
flow analysis to model revenue and operational costs using data from one of the
world's leading MNOs. The optimization model leverages a Flexible Functional
Split (FFS) approach to provide a new degree of freedom to the resource
allocation strategy. Simulation results reveal that, due to its non-linear
nature, there is no trivial solution to the proposed optimization problem
formulation. Our proposal guarantees a maximum delay for URLLC services while
satisfying minimal bandwidth requirements for enhanced Mobile BroadBand (eMBB)
services and maximizing the MNO's profit.Comment: 21 pages, 10 figures. For the associated GitHub repository, see
https://github.com/LABORA-INF-UFG/paper-FGKCJ-202
Exploiting web technologies to build autonomic wireless sensor networks
Most of the current wireless sensor networks are built for specific applications, with a tight coupling between them and the underlying communication protocols. We present a more flexible architectural approach for building WSNs, in which application-specific features are decoupled from the underlying communication infrastructure, although affecting the network behavior. We propose a framework based on Web technologies that provides a standard interface for accessing the network and configurable service components tailored to meet different application requirements, while optimizing the network scarce resources. Also, a set of ontologies is defined as part of the framework for representing shared knowledge of the WSN domain.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI
Middleware orientado a serviços para redes de sensores sem fio
There is a wide range of applications for wireless sensor networks (WSNs) with different needs. The WSN infrastructure and protocols change according to the application needs. To achieve the best performance of the WSN, its operation should be adapted to the application needs. We propose a middleware for WSNs that provides a layer between applications and the network.
The middleware offers a standard mechanism for representing user queries, sensor tasks and data. It also provides an automatic choice of the best network configuration and data dissemination strategy. Users are able to access the WSN without worrying about the underlying infrastructure and software. From the
WSN perspective, the system provides the best match between communication protocols and application requirements.Há uma ampla gama de aplicações para redes de sensores sem fio (RSSF)s, com diferentes necessidades. A infraestrutura e o protocolo de disseminação de dados da rede variam de acordo com a aplicação. Para o
melhor desempenho quanto ao consumo de energia e à qualidade do serviço fornecido pela rede, seu funcionamento deve ser adaptado às necessidades da aplicação. Este trabalho propõe um middleware que oferece uma camada entre aplicações e a rede de sensores e oferece um mecanismo padrão para representar consultas, tarefas e dados. Além disso, fornece a escolha automatizada da configuração da rede e da estratégia de disseminação de dados usada, permitindo ao usuário acessar a rede sem tomar conhecimento de infraestrutura e software subjacentes. Do ponto de vista da rede, o sistema visa obter a melhor combinação entre protocolos de comunicação e requisitos da aplicação
- …