相关论文: Efficient routing on scale-free networks based on …

Maximizing robustness and minimizing cost are common objectives in the design of infrastructure networks. However, most infrastructure networks evolve and operate in a highly decentralized fashion, which may significantly impact the…

We study the evolution of the fastest paths (FP) in transportation networks under increasing congestion. Moving from the common edge-based to a path-based analysis, we examine the directed FPs connecting random origin-destination pairs as…

We give a livelock free routing algorithm for any allowed network. Unlike some other solutions to this problem: 1) packets entering the network have an absolute upper bound on the time to reach their destination; 2) under light loads,…

In Future Internet it is possible to change elements of congestion control in order to eliminate jitter and batch loss caused by the current control mechanisms based on packet loss events. We investigate the fundamental problem of adjusting…

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

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…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…

We study flow scheduling under node capacity constraints. We are given capacitated nodes and an online sequence of jobs, each with a release time and a demand to be routed between two nodes. A schedule specifies which jobs are routed in…

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…

Recent studies on transportation networks have shown that real-time route guidance can inadvertently induce congestion or oscillatory traffic patterns. Nevertheless, such technologies also offer a promising opportunity to manage traffic…

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance…

Network science enables the effective analysis of real interconnected systems, characterized by a complex interplay between topology and interconnections strength. It is well-known that the topology of a network affects its resilience to…

We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while being processed, and each server is shared among the job…

In this paper, a new routing algorithm based on a flooding method is introduced. Flooding techniques have been used previously, e.g. for broadcasting the routing table in the ARPAnet [1] and other special purpose networks [3][4][5].…

Selective attention allows to process stimuli which are behaviorally relevant, while attenuating distracting information. However, it is an open question what mechanisms implement selective routing, and how they are engaged in dependence on…

Traffic congestion has large economic and social costs. The introduction of autonomous vehicles can potentially reduce this congestion by increasing road capacity via vehicle platooning and by creating an avenue for influencing people's…

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…

Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces,…

The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing…