Related papers: Packet Transport on Scale Free Networks
It is well known that many real world networks have the power-law degree distribution (scale-free property). However there are no rigorous results for continuous-time quantum walks on such realistic graphs. In this paper, we analyze…
Current practice of shaping subscriber traffic based on token bucket by Internet service provider (ISP) allows short-term fluctuations in its shaped rate and thereby enables a subscriber to transmit traffic at a higher rate than a…
This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…
In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…
Large-scale quantum networks, known as quantum internet, hold great promises for advanced distributed quantum computing and long-distance quantum communication. It is essential to have a proper theoretical analysis of the quantum network…
Link dimensioning is used by ISPs to properly provision the capacity of their network links. Operators have to make provisions for sudden traffic bursts and network failures to assure uninterrupted operations. In practice, traffic averages…
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We…
We study the performance of Weibull and scale free Internet-like networks and compare them to a classical random graph based network. The scaling of the traffic load with the nodal degree is established, and confimed in a numerical…
Transport processes on spatial networks are representative of a broad class of real world systems which, rather than being independent, are typically interdependent. We propose a measure of utility to capture key features that arise when…
We propose an information-based model for network dynamics in which imperfect information leads to networks where the different vertices have widely different number of edges to other vertices, and where the topology has hierarchical…
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.…
We scrutinize the temporally-resolved speed of active cargo transport in living cells, and show intermittent bursting motions. These nonlinear fluctuations follow a scaling law over several decades of time and space, the statistical…
Internet traffic on a network link can be modeled as a stochastic process. After detecting and quantifying the properties of this process, using statistical tools, a series of mathematical models is developed, culminating in one that is…
We introduce a macroscopic model for a network of conveyor belts with various speeds and capacities. In a different way from traffic flow models, the product densities are forced to move with a constant velocity unless they reach a maximal…
The work presented in this thesis concerns different aspects of dynamical processes on networks. The first subject considered is the theoretical modeling of exploration processes of complex networks, such as the ``traceroute'' process used…
Time-critical cyber-physical applications demand the timely delivery of information. In this work, we employ a high-speed packet processing testbed to quantitatively analyze a packet forwarding application running on a shared memory…
In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets…
Transport is an important function of networks. Studying transport efficiency sheds light on the dynamic processes occurring within various underlying structures and offers a wide range of applications. To construct networks with different…
We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {\em By construction}, the model has critical behavior…
This paper criticises the notion that long-range dependence is an important contributor to the queuing behaviour of real Internet traffic. The idea is questioned in two different ways. Firstly, a class of models used to simulate Internet…