Dynamic traffic assignment through analytical modeling and optimization has been widely accepted by the IVHS R&D community as a promising traffic control tool for understanding and relieving traffic congestion on conventional highways and city streets. Due to the completely controlled nature of AHS traffic, dynamic assignment of AHS traffic is even more promising. One added dimension of complex...

Flexible grid networks need rigorous resource planning to avoid network over-dimensioning and over-provisioning. The must provision the hardware spectrum resources statically, even for dynamic random bandwidth demands, due infrastructure of flexible networks, limitations, reconfiguration speed control plane. We propose a online–offline probabilistic (FOOP) algorithm static assignment demands. F...

In this paper we compare the performance of opaque and translucent Optical Transport Networks (OTNs) taking into account different regenerator placement strategies. The translucent approach achieves noticeable results under static traffic in terms of saving of deployed resources. On the other hand in the dynamic scenario a translucent OTN suffers from fewer resources and may display high blocki...

Intelligent Transportation System (ITS) is one of the most important urban systems that its functionality affects other urban systems directly and indirectly. In developing societies, increasing the transportation system efficiency is an important concern, because variety of problems such as heavy traffic condition, rise of the accident rate and the reduced performance happen with the rise of p...

This paper describes methods for synthesizing the internal representation of a compiler into a hardware description language; a process often referred to as hardware compilation. We present a framework for this transformation including methods to control the path of execution and ways to deal with the data communication. We show how static single assignment (SSA) is useful to reduce the amount ...

Linear scan register allocation is an efficient alternative to the widely used graph coloring approach. We show how this algorithm can be applied to register-constrained architectures like the Intel x86. Our allocator relies on static single assignment form, which simplifies data flow analysis and tends to produce short live intervals. It makes use of lifetime holes and instruction weights to i...

A number of emerging dynamic traffic analysis applications, such as regional or statewide traffic assignment, require a theoretically rigorous and computationally efficient model to describe the propagation and dissipation of system congestion with bottleneck capacity constraints. An open-source light-weight dynamic traffic assignment (DTA) package, namely DTALite, has been developed to allow a...