The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model ...

This paper explores interrelations between pricing, capacity choice, and financing in transportation networks. We build on the Mohring-Harwitz result on self-financing of optimally designed and priced roads and investigate it in a network environment under various types of second-best regulation. A small network model with endogenous car ownership demonstrates that optimal congestion pricing an...

We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+ε while preserving the minimum spanning forest, where ε > 0 is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a gener...

The objective of this paper is to study the small-signal stability of congested TCP networks. The starting point for this analysis is a fluid model describing the interaction of TCP-controlled traffic with congested routers. Assuming integral action in the active queue management scheme, we compute the network’s equilibrium point about which we determine the network’s small-signal dynamics. Spe...

There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...