HiPeR-l: a high performance reservation protocol with look-ahead for broadcast WDM networks

We consider the problem of coordinating access to the various channels of a single-hop WDM network. We present HiPeR-l, a new reservation protocol specifically designed to overcome the potential inefficiencies of operating in environments with non-negligible processing, tuning, and propagation delays. HiPeR-l differs from previous reservation protocols in that each control packet makes reservations for all data packets waiting in a node's queues, thus significantly reducing the control overhead. Packets are scheduled for transmission using algorithms that can effectively mask the tuning times. HiPeR-l also uses pipelining to mask the processing times and propagation delays. We use Markov chain theory to obtain a necessary and sufficient condition for the stability of the protocol. The stability condition provides insight into the factors affecting the operation of the protocol, such as the degree of load balancing across the various channels, and the quality of the scheduling algorithms. The analysis is fairly general, as it holds for MMBP-like arrival processes with any number of states, and for non-uniform destinations.