No abstract

The anisotropic Zheng and Jiang models characterize traffic with a constant rearward velocity. They also consider a constant driver sensitivity which can result in unrealistic behavior. In this paper, a new anisotropic model based on a variable rearward velocity is proposed. The transition width, driver reaction, and sensitivity at transitions are used to characterize this velocity. This width impacts traffic alignment with forward conditions and driver reaction can be aggressive, slow or typical. The performance of the proposed, Zheng and Jiang models is evaluated over a 2000 m circular (ring) road with an inactive traffic bottleneck. Results are presented which show that traffic evolution with the proposed model is more realistic than with the Zheng and Jiang models. INDEX TERMS Anisotropic model, driver reaction, rearward velocity, transition dynamics, Zheng model, Jiang model.

Fixed alternate routing is a potential routing scheme for routing and spectrum allocation (RSA) in elastic optical networks (EON) which has less complexity and time consumption compared to adaptive routing scheme. However, adaptive routing scheme efficiently reduces the amount of network bandwidth blocking probabilities (BBPs) which uses traffic engineered paths and tunes according to the current network status. In this paper, an algorithm for routing is proposed for dynamic traffic in EON which works iteratively to arrange the pre-computed fixed alternate routes offline to incorporate link loading. During the offline process, the pre-computed routes are arranged with an objective to reduce link congestion and diverts lightpaths to the under-utilized links. The proposed scheme merges the properties of fixed alternate routing and adaptive routing and is utilized for dynamic traffic in EON. It has been shown through simulation results that the proposed scheme efficiently improves the performance of RSA in EON and reduces the amount of BBPs compared to the fixed alternate routing and an existing constrained-lower-indexed-block (CLIB) based adaptive routing algorithm. The proposed LCA greatly reduces congestion over all links during dynamic network operation and lowers congestion spikes over some links which occues in the existing alternate routing scheme in different network scenarios.

No abstract

No abstract