This paper deals with an extended framework of the distributed asymptotic agreement problem by allowing the presence of unilateral interactions (optimistic or pessimistic) in place of bilateral ones, for a large class of nonlinear monotone time-varying networks. In this original setup we firstly introduce notions of unilateral optimistic and/or pessimistic interaction, of associated bicolored edge in the interaction graph and a suitable graph-theoretical connectedness property. Secondly, we formulate a new assumption of integral connectivity and show that it is su cient to guarantee exponential convergence towards the agreement subspace. Finally, we show that the proposed conditions are also necessary for consensuability and discuss how the new notions of bicolored graph and related connectivity concepts encompass the usual criteria in the standard case of bilateral interactions. Theoretical advances are emphasized through illustrative examples given both to support the discussion and to highlight how the proposed framework extends all existing conditions for consensus of monotone networks.
Multilayer networks describe well many real interconnected communication and transportation systems, ranging from computer networks to multimodal mobility infrastructures. Here, we introduce a model in which the nodes have a limited capacity of storing and processing the agents moving over a multilayer network, and their congestions trigger temporary faults which, in turn, dynamically affect the routing of agents seeking for uncongested paths. The study of the network performance under different layer velocities and node maximum capacities reveals the existence of delicate trade-offs between the number of served agents and their time to travel to destination. We provide analytical estimates of the optimal buffer size at which the travel time is minimum and of its dependence on the velocity and number of links at the different layers. Phenomena reminiscent of the slower is faster effect and of the Braess' paradox are observed in our dynamical multilayer setup.
In this paper, we face the challenging issue of defining and implementing an effective law for load balancing in Content Delivery Networks (CDNs). We base our proposal on a formal study of a CDN system, carried out through the exploitation of a fluid flow model characterization of the network of servers. Starting from such characterization, we derive and prove a lemma about the network queues equilibrium. This result is then leveraged in order to devise a novel distributed and time-continuous algorithm for load balancing, which is also reformulated in a time-discrete version. The discrete formulation of the proposed balancing law is eventually discussed in terms of its actual implementation in a real-world scenario. Finally, the overall approach is validated by means of simulations
The recent increased interest in distributed and flexible wireless pervasive applications has drawn great attention to Wireless Networked Control Systems (WNCS) architectures based on Wireless Sensor and Actuator Networks (WSANs) and the resulting Quality of Service (QoS) obtained in specific applications. In wireless monitoring systems based on WSANs, providing certain QoS specifications in terms of reliability and energy efficiency is crucial for the sensors/actuators as they perform actions based on the data samples/received with a limited amount of energy to spend. To this aim the paper introduces the cooperative-based routing algorithm to guarantee a good performance trade-off between reliability and energy efficiency of the overall wireless monitoring system. Simulations have been carried out in order to quantify the impact of the proposed algorithm on the overall monitoring system reliability and energy efficiency and a comparison is presented with the existing Ad-hoc On-Distance Vector (AODV), the cooperation along the shortest non-cooperative path (CASNCP) and minimum-power cooperative routing (MPCR) algorithms. Finally it is shown the application of the proposed algorithm to healthcare monitoring system pointing out as the cooperation-based routing algorithms are suitable and rewarding for the management of the future generation of monitoring systems
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.