Related papers: Queue-length synchronization in a communication ne…

In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…

Multiplex networks are representations of multilayer interconnected complex networks where the nodes are the same at every layer. They turn out to be good abstractions of the intricate connectivity of multimodal transportation networks,…

Over the past decade, Supercomputers and Data centers have evolved dramatically to cope with the increasing performance requirements of applications and services, such as scientific computing, generative AI, social networks or cloud…

Decentralized algorithms have gained substantial interest owing to advancements in cloud computing, Internet of Things (IoT), intelligent transportation networks, and parallel processing over sensor networks. The convergence of such…

A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous…

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving…

In many natural synchronization phenomena, communication between individual elements occurs not directly, but rather through the environment. One of these instances is bacterial quorum sensing, where bacteria release signaling molecules in…

This paper studies an important rate allocation problem that arises in many networked and distributed systems: steady-state traffic rate allocation from multiple sources to multiple service nodes when both (i) the access-path delay on each…

Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world…

We study the phase synchronized clusters in the diffusively coupled maps on the Cayley tree networks for heterogeneous delay values. Cayley tree networks comprise of two parts: the inner nodes and the boundary nodes. We find that…

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging…

Delay-based congestion control algorithms provide higher throughput and stability than traditional loss-based AIMD algorithms, but they are inherently unfair against older connections when the queuing and the propagation delay cannot be…

In this paper, inspired by the idea that the hub nodes of a highly heterogeneous network are not only the bottlenecks, but also effective controllers in the network synchronizing process, we bring forward an asymmetrical coupling method…

This work studies a well-known shared-cache coded caching scenario where each cache can serve an arbitrary number of users, analyzing the case where there is some knowledge about such number of users (i.e., the topology) during the content…

Global synchronization in a complex network of oscillators emerges from the interplay between its topology and the dynamics of the pairwise interactions among its numerous components. When oscillators are spatially separated, however, a…

This work studies the effect of hub congestion and time-sensitive demand on a hub-and-spoke location/allocation system. The Hub Location with Congestion and Time-sensitive Demand Problem is introduced, which combines these two main…

The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions…

We suggest an adaptive control scheme for the control of zero-lag and cluster synchronization in delay-coupled networks. Based on the speed-gradient method, our scheme adapts the topology of a network such that the target state is realized.…

We investigate notions of network centrality in terms of the underlying coupling graph of the network, structure of exogenous uncertainties, and communication time-delay. Our focus is on time-delay linear consensus networks, where…

We study traffic flow on roads with a localized periodic inhomogeneity such as traffic signals, using a stochastic car-following model. We find that in cases of congestion, traffic flow can be optimized by controlling the inhomogeneity's…