Related papers: Packet Transport on Scale Free Networks
We developed analytical and numerical methods to study a transport of non-interacting particles in large networks consisting of M d-dimensional containers C_1,...,C_M with radii R_i linked together by tubes of length l_{ij} and radii a_{ij}…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
Interaction networks, consisting of agents linked by their interactions, are ubiquitous across many disciplines of modern science. Many methods of analysis of interaction networks have been proposed, mainly concentrating on node degree…
An intuitive overview of the scalability of a variety of types of wireless networks is presented. Simple heuris- tic arguments are demonstrated here for scaling laws presented in other works, as well as for conditions not previously…
Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The…
The behavior of complex networks under failure or attack depends strongly on the specific scenario. Of special interest are scale-free networks, which are usually seen as robust under random failure but appear to be especially vulnerable to…
Most existing routing strategies to improve transport efficiency have little attention what order should the packets be delivered, just simply used first-in-first-out queue discipline. However, it is far from optimal. In this paper we apply…
We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modeled to arrive at the source node randomly. Our goal…
Traffic modeling of communication networks such as Internet has become a very important field of research. A number of interesting phenomena are found in measurements and traffic simulations. One of them is the propagation of congestion…
The increasing global spread of electric vehicles (EVs) has introduced significant interdependence between transportation and power networks. Most of the previous studies on coupled networks focus on the formation of equilibrium states…
This paper presents a modeling approach to infer scheduling and routing patterns from digital freight transport activity data for different freight markets. We provide a complete modeling framework including a new discrete-continuous…
V2V technologies bridge two infrastructures: the communications infrastructure and the transportation infrastructure. These infrastructures are interconnected and interdependent. On the one hand, the communications network enables V2V…
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…
Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…
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…
The knowledge about the true nature of the traffic in computer networking is a key requirement in the design of such networks. The phenomenon of self-similarity is a characteristic of the traffic of current client/server packet networks in…
The deployment of modern network applications is increasing the network size and traffic volumes at an unprecedented pace. Storing network-related information (e.g., traffic traces) is key to enable efficient network management. However,…
Large-scale quantum networks with thousands of nodes require scalable network protocols and physical hardware to realize. In this work, we introduce packet switching as a new paradigm for quantum data transmission in both future and…
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling…
A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed…