A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks

In this paper, we propose a distributed approach for the least constraining slot allocation scheme in all-optical TDM networks (LC) that was introduced in a previous work. The driving force behind our proposal is the employment of the LC scheme in a GMPLS context. After describing the basic data model and messaging parameters, we focus on defining an efficient LC resource status update scheme, which is essential to achieve compatibility with GMPLS´ periodic link state update standards. Basically, we reduce the rate of resource status updates from once per call to once per few calls, and measure the impact on network performance.