Related papers: Message transport characteristics in communication…
We study message transfer in a $2-d$ communication network of regular nodes and randomly distributed hubs. We study both single message transfer and multiple message transfer on the lattice. The average travel time for single messages…
We address the problem of message transfer in a communication network. The network consists of nodes and links, with the nodes lying on a two dimensional lattice. Each node has connections with its nearest neighbours, whereas some special…
We study the efficiency of the gradient mechanism of message transfer in a $2-d$ communication network of regular nodes and randomly distributed hubs. Each hub on the network is assigned some randomly chosen capacity and hubs with lower…
We identify the statistical characterizers of congestion and decongestion for message transport in model communication lattices. These turn out to be the travel time distributions, which are Gaussian in the congested phase, and log-normal…
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 analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…
The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $x$ requests to transmit, then it receives a fraction of the capacity proportional to $\log(1+x)$,…
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
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…
We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic…
The generic feature of traffic in a network of flowing electronic data packets is a phase transition from a stationary free-flow phase to a continuously growing congested non-stationary phase. In the most simple network of directed oriented…
Many real-world communication networks often have hybrid nature with both fixed nodes and moving modes, such as the mobile phone networks mainly composed of fixed base stations and mobile phones. In this paper, we discuss the information…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
We investigate a probabilistic model for routeing in a multihop ad-hoc communication network, where each user sends a message to the base station. Messages travel in hops via other users, used as relays. Their trajectories are chosen at…
Nodes movements play a significant role in disseminating messages in the sparse mobile ad-hoc network. In the network scenarios, where traditional end-to-end paths do not exist, mobility creates opportunities for nodes to connect and…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
Consider the classical problem of information dissemination: one (or more) nodes in a network have some information that they want to distribute to the remainder of the network. In this paper, we study the cost of information dissemination…
We analyze transport on a graph with multiple constraints and where the weight of the edges connecting the nodes is a dynamical variable. The network dynamics results from the interplay between a nonlinear function of the flow, dissipation,…