Abstract-The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We provide integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable amount of time. We also develop a rerouting optimization heuristic, which is based on previous work. Experimental results are presented to compare the solutions obtained by the tabu search heuristic and the rerouting optimization heuristic. For both problems, the tabu search heuristic outperforms the rerouting optimization heuristic.Index Terms-Capacity minimization problem, dedicated-path protection, revenue maximization problem, shared-path protection, shared risk link group (SRLG), tabu search, wavelength-routed optical network.

No abstract

The brain uses its intrinsic dynamics to actively predict observed sensory inputs, especially under perceptual ambiguity. However, it remains unclear how this inference process is neurally implemented in biasing perception of ambiguous inputs towards the predicted percepts. The process of perceptual inference can be well illustrated by the phenomenon of bistable apparent motion in the Ternus display, in which subjective perception spontaneously alternates between element motion (EM) and group motion (GM) percepts depending on whether two consecutively presented frames are grouped over time or not. The frequency of alpha-band oscillations has long been hypothesized to gate the temporal window of perceptual grouping over time. Under this hypothesis, variation in the intrinsic alpha frequency should predict perceptual outcome of the bistable Ternus display. Moreover, we hypothesize that the perception system employs this prior knowledge on intrinsic alpha frequency to resolve perceptual ambiguity, by shifting perceptual inference towards the predicted percepts. Using electroencephalography and intracranial recordings, we showed that both between and within subjects, lower prestimulus alpha frequencies (PAFs) predicted the EM percepts since the two frames fell in the same alpha cycle and got temporally integrated, while higher PAFs predicted the GM percepts since the two frames fell in different alpha cycles. Multivariate decoding analysis between the EM percepts with lower PAFs and the GM percepts with higher PAFs further revealed a representation of the subsequently reported bistable percept in the neural signals shortly before the actual appearance of the second frame. Therefore, perceptual inference, based on variation in intrinsic PAFs, biases poststimulus neural representations by inducing preactivation of the predicted percepts. In addition, enhanced prestimulus blood-oxygen-level–dependent (BOLD) signals and network dynamics in the frontoparietal network, together with reduced prestimulus alpha power, upon perceiving the EM percepts suggest that temporal grouping is an attention-demanding process.

No abstract

-Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In a dynamic environment, the end user requests for dynamic scheduled lightpath demands (D-SLDs) need to be serviced without the knowledge of future requests. Even though the starting time of the request may be hours or days from the current time, the end-user however expects a quick response as to whether the request could be satisfied. We propose a twophase approach to dynamically schedule and provision D-SLDs. In the first phase, termed the deterministic lightpath scheduling phase, upon arrival of a lightpath request, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with a deterministic lightpath schedule. In the second phase, termed the lightpath re-optimization phase, we re-provision some already scheduled lightpaths to re-optimize for improving network performance. We study two reoptimization scenarios to reallocate network resources while maintaining the existing lightpath schedules. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce network blocking.