Search results for "optimization"
showing 10 items of 2824 documents
FUZZY TCP: A PRELIMINARY STUDY
2002
Implementing efficient TCP for the Internet necessarily has to cope with the problem that the source does not know in advance which window allocation policy should be the best to use for a given network condition. In this paper, an on-line adaptive fuzzy system is used at the source in an objective to find the best possible weighted combination among the available policies.
Fault-Tolerant Application Mapping on to ZMesh topology based Network-on-Chip Design
2020
This paper proposes Particle Swarm Optimization (PSO) based fault-tolerant application mapping on to ZMesh topology based Network-on-Chip (NoC) design. Permanent faults in application cores has been considered and performed application mapping using PSO. The major contribution of this paper is to find out the best position for the spare core to be placed in the network using PSO. Experimentations have been carried out by scaling the ZMesh network size and percentage of network faults. The results show that the proposed approach leads to minimum overhead in communication cost over fault-free result.
On the role of symmetry in solving maximum lifetime problem in two-dimensional sensor networks
2016
We analyze a continuous and discrete symmetries of the maximum lifetime problem in two dimensional sensor networks. We show, how a symmetry of the network and invariance of the problem under a given transformation group $G$ can be utilized to simplify its solution. We prove, that for a $G$-invariant maximum lifetime problem there exists a $G$-invariant solution. Constrains which follow from the $G$-invariance allow to reduce the problem and its solution to a subset, an optimal fundamental region of the sensor network. We analyze in detail solutions of the maximum lifetime problem invariant under a group of isometry transformations of a two dimensional Euclidean plane.
Efficient Steering Mechanism for Mobile Network-Enabled UAVs
2022
HTTP Adaptive Streaming (HAS) is becoming the de-facto video delivery technology over best-effort networks nowadays, thanks to the myriad advantages it brings. However, many studies have shown that HAS suffers from many Quality of Experience (QoE)-related issues in the presence of competing players. This is mainly caused by the selfishness of the players resulting from the decentralized intelligence given to the player. Another limitation is the bottleneck link that could happen at any time during the streaming session and anywhere in the network. These issues may result in wobbling bandwidth perception by the players and could lead to missing the deadline for chunk downloads, which result …
Priority Levels Based Multi-hop Broadcasting Method for Vehicular Ad hoc Networks
2015
International audience; This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to achieve since it has to take into account some parameters related to the network environment, for example, the network density, in order to avoid causing radio interferences. In this paper, we propose a novel Autonomic Dissemination Method (ADM) which delivers messages in accordance with given priority and density levels. The proposed approach is based on two steps: an offline optimization process and an adaptation to the network …
Consensus for networks with unknown but bounded disturbances
2009
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' states is affected by unknown but bounded disturbances. Here the main contribution is the formulation and solution of what we call the $\epsilon$-consensus problem, where the states are required to converge in a target set of radius $\epsilon$ asymptotically or in finite time. We introduce as a solution a dead-zone policy that we denote as the lazy rule.
Remark on a nonlocal isoperimetric problem
2017
Abstract We consider isoperimetric problem with a nonlocal repulsive term given by the Newtonian potential. We prove that regular critical sets of the functional are analytic. This optimal regularity holds also for critical sets of the Ohta–Kawasaki functional. We also prove that when the strength of the nonlocal part is small the ball is the only possible stable critical set.
On optimizing firewall performance in dynamic networks by invoking a novel swapping window-based paradigm
2018
Designing and implementing efficient firewall strategies in the age of the Internet of Things (IoT) is far from trivial. This is because, as time proceeds, an increasing number of devices will be connected, accessed and controlled on the Internet. Additionally, an everincreasingly amount of sensitive information will be stored on various networks. A good and efficient firewall strategy will attempt to secure this information, and to also manage the large amount of inevitable network traffic that these devices create. The goal of this paper is to propose a framework for designing optimized firewalls for the IoT. This paper deals with two fundamental challenges/problems encountered in such firewalls…
Numerical methods for nonlinear inverse problems
1996
AbstractInverse problems of distributed parameter systems with applications to optimal control and identification are considered. Numerical methods and their numerical analysis for solving this kind of inverse problems are presented, main emphasis being on the estimates of the rate of convergence for various schemes. Finally, based on the given error estimates, a two-grid method and related algorithms are introduced, which can be used to solve nonlinear inverse problems effectively.
An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
1983
This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties. The method is an extension of our earlier method published in this journal (Zionts, S., Wallenius, J. 1976. An interactive programming method for solving the multiple criteria problem. Management Sci. 22 (6) 652–663.). Various technical problems present in predecessor versions have been resolved. In addition to presenting the supporting theory and algorithm, we discuss certain options in implementation and summarize our practical experience with several versions of the method.