Related papers: The effect of bandwidth in scale-free network traf…
In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the…
The volume of data moving through a network increases with new scientific experiments and simulations. Network bandwidth requirements also increase proportionally to deliver data within a certain time frame. We observe that a significant…
We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnection) Reference Model…
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…
We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior,…
The existence of considerable amount of redundancy in the Internet traffic at the packet level has stimulated the deployment of packet-level redundancy elimination techniques within the network by enabling network nodes to memorize data…
In transportation networks, a spontaneous jamming transition is often observed, e.g in urban road networks and airport networks. Because of this instability, flow distribution is significantly imbalanced on a macroscopic level. To mitigate…
Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of…
Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…
Bandwidth optimization for real-time video traffic transmission through the proxy server is a challenging issue for the next- generation network. The self - control of the traffic rate at the proxy server is based on the relative data…
In this paper, urban traffic is modeled using dual graph representation of urban transportation network where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of vehicles on…
We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to…
In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each…
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…
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…
We consider a flow-level model of a network operating under an $\alpha$-fair bandwidth sharing policy (with $\alpha>0$) proposed by Roberts and Massouli\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that…
Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explicated. We investigate the dynamic behaviors of resource/traffic flow on scale-free…
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in terms of a {\em service curve}, which is a function that…
We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow…
We have revealed general physical conditions for the {\it maximization} of the network throughput at which free flow conditions are ensured, i.e., traffic breakdown cannot occur in the whole traffic or transportation network. A physical…