Flow and congestion control allow the users of a telecommunication network to regulate the traffic that they send into the network in accordance with the quality of service that they require. Flow control may be performed by the network, as is the case in asynchronous transfer mode (ATM) networks (the available bit rate (ABR) transfer capacity), or by the users themselves, as is the case in the...

In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equili...

The theory of super network is an effective method to various traffic networks with means of multiple decision-making. It provides us with a favorable pricing decision tool for it combines a practical transport network with the space pricing decision. Spatial price equilibrium problem has always been the important research direction of the Transport Economics and regional transportation plannin...

Network Pricing Optimization is formulated first as a Network Design Problem where the design variables are tolls, the objective function is the Social Surplus and the equilibrium constraint is any current multi-user multimodal stochastic traffic assignment model with elastic demand up to trip generation and asymmetric arc cost function Jacobian. Network Pricing Optimization is then formulated ...

internet traffic has grown exponentially over last few years due to provision of multiple class services through internet backbone. with the explosive use of internet, contemporary internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. in this paper, an analysis is made how forecasting technique, routing algorithm and genetic...

Traditionally, traffic assignment allocates trips to links in a traffic network. Nowadays it is also useful to recommend routes. Here, it is interesting to recommend routes that are as close as possible to the system optimum, while also considering the user equilibrium. To compute an approximation of such an assignment, we use a hybrid approach in which an optimization process based on an evolu...

In this paper we introduce the notions of characteristic and potential functions of directed graphs and study their properties. The main motivation for our research is the stochastic equilibrium traffic assignment problem, in which the drivers choose their routes with some probabilities. Since the number of the strategies in this game is very big, we need to find an efficient way of computation...

This study investigates dynamic system-optimal (DSO) and user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. A morning commute problem with many-to-one pattern origin–destination (OD) demand an evening one-to-many OD are considered. Specifically, we first derive closed-form solution to the DSO based on regularities cost flow variables. By utilizing...

The dynamic network equilibrium models have a renewed interest in Europe, Japan and North America. This is due to the design and implementation of Advanced Transport Telematic (ATT) systems require of network models which may evaluate dynamically such actions. The main modeling approaches for the dynamic network equilibrium are: Aggregated macroscopic models in which traffic flows are regarded ...