Search results for "computer network"
showing 10 items of 1634 documents
Performance modeling of epidemic routing
2006
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and the number of copies made for a packet can be tra…
The stacker crane problem and the directed general routing problem
2015
[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included.
Optimal Delay-Power Tradeoff in Sparse Delay Tolerant Networks: a preliminary study
2006
In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and config…
Achieving Fair Load Balancing by Invoking a Learning Automata-Based Two-Time-Scale Separation Paradigm.
2020
Author's accepted manuscript. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. In this article, we consider the problem of load balancing (LB), but, unlike the approaches that have been proposed earlier, we attempt to resolve the problem in a fair manner (or rather, it would probably be more appropriate to describe it as an ε-fair manner because, although the LB…
Developing Domain-Knowledge Evolutionary Algorithms for Network-on-Chip Application Mapping
2013
This paper addresses the Network-on-Chip (NoC) application mapping problem. This is an NP-hard problem that deals with the optimal topological placement of Intellectual Property cores onto the NoC tiles. Network-on-Chip application mapping Evolutionary Algorithms are developed, evaluated and optimized for minimizing the NoC communication energy. Two crossover and one mutation operators are proposed. It is analyzed how each optimization algorithm performs with every genetic operator, in terms of solution quality and convergence speed. Our proposed operators are compared with state-of-the-art genetic operators for permutation problems. Finally, the problem is approached in a multi-objective w…
Joint Optimization of Detection Threshold and Resource Allocation in Infrastructure-based Multi-band Cognitive Radio Networks
2012
[EN] Consider an infrastructure-based multi-band cognitive radio network (CRN) where secondary users (SUs) opportunistically access a set of sub-carriers when sensed as idle. The carrier sensing threshold which affects the access opportunities of SUs is conventionally regarded as static and treated independently from the resource allocation in the model. In this article, we study jointly the optimization of detection threshold and resource allocation with the goal of maximizing the total downlink capacity of SUs in such CRNs. The optimization problem is formulated considering three sets of variables, i.e., detection threshold, sub-carrier assignment and power allocation, with constraints on…
Numerical solution of a multi-class model for batch settling in water resource recovery facilities
2017
In Torfs et al. (2017) a new unified framework to model settling tanks in water resource recovery facilities was proposed providing a set of partial differential equations (PDEs) modelling different settling unit processes in wastewater treatment such as primary and secondary settling tanks (PSTs and SSTs). The extension to a multi-class framework to deal with the distributed properties of the settling particles leads to a system of non-linear hyperbolic-parabolic PDEs whose solutions may contain very sharp transitions. This necessitates the use of a consistent and robust numerical method to obtain well-resolved and reliable approximations to the PDE solutions. The use of implicit–explicit …
Multiobjective ant colony search algorithm optimal electrical distribution system planning
2005
A dynamic multiobjective, MO, algorithm based on the ant colony search, the multiobjective ant colony search algorithm, MOACS, is presented. The application domain is that of dynamic planning for electrical distribution systems. A time horizon of H years has been considered during which the distribution system are modified according to the new internal (loads) and external (market, reliability, power quality) requirements. In this scenario, the objectives the Authors consider most important for utilities in strategical planning are: the quality requirement connected to the decrease of the expected number of interruptions per year and customer, in the considered time frame, and the choice fo…
Efficient solution of the first passage problem by Path Integration for normal and Poissonian white noise
2015
Abstract In this paper the first passage problem is examined for linear and nonlinear systems driven by Poissonian and normal white noise input. The problem is handled step-by-step accounting for the Markov properties of the response process and then by Chapman–Kolmogorov equation. The final formulation consists just of a sequence of matrix–vector multiplications giving the reliability density function at any time instant. Comparison with Monte Carlo simulation reveals the excellent accuracy of the proposed method.
Driven Primary Regulation for Minimum Power Losses Operation in Islanded Microgrids
2018
The paper proposes an improved primary regulation method for inverter-interfaced generating units in islanded microgrids. The considered approach employs an off-line minimum losses optimal power flow (OPF) to devise the primary frequency regulation curve’s set-points while satisfying the power balance, frequency and current constraints. In this way, generators will reach an optimized operating point corresponding to a given and unique power flow distribution presenting the minimum power losses. The proposed approach can be particularly interesting for diesel-based islanded microgrids that face, constantly, the issue of reducing their dependency from fossil fuels and of enhancing their gener…