Advanced traffic management based on the Dynamic Resource Assignment allows a broadband satellite system such as EuroSkyWay (ESW) to dynamically assign the resources of connections. The mechanisms of the dynamic assignment exploit variations of Burstiness exhibited by real time and non real time Variable Bit Rate traffic sources to perform an optimised resource redistribution. The efficiency of...

The road choice behavior of travelers is closely related to their activity planning and location choice. This approach has led to the increasing development of multi-agent and activity-oriented modeling. This work attempts to model travelers’ dynamic departure time/route/destination choice behavior in a queuing network. In this respect, we propose an activity-based predictive dynamic traffic as...

Finding a line plan with corresponding frequencies is an important stage of planning a public transport system. A line plan should permit all passengers to travel with an appropriate quality at appropriate costs for the public transport operator. Traditional line planning procedures proceed sequentially: In a first step a traffic assignment allocates passengers to routes in the network, often b...

To maintain an internally consistent representation with actual traffic conditions, this paper presents an OD demand consistency checking and updating model for on-line dynamic traffic assignment operation. Both predictive and reactive approaches are proposed to minimize (1) the deviations between simulated states and real-world observations and (2) OD demand adjustment magnitude. The two objec...

This paper presents a new practical approximation algorithm for wavelength assignment to splitable lightpaths over WDM rings, with the objective of minimizing the number of SONET ADMs. Allowing the splitting of traffic streams can significantly reduce the number of required ADMs. Moreover, while finding the best assignment is proved to be NP-Hard, the problem seems easier to approximate than th...

The class of simplicial decomposition methods has shown to constitute efficient tools for the solution of the variational inequality formulation of the general traffic assignment problem. The paper presents a particular implementation of such an algorithm, called RSDVI, and a restricted simplicial decomposition algorithm, developed adhoc for diagonal, separable, problems named RSDTA. Both compu...