lie consider the problem of coordinating access to the various channels of a single-hop W D X network. We present HiPeR-C, a new reservation protocol specifically designed t o overcome the potential ineficiencies 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 control overhead. Packets are scheduled for transmission using algorithms that can effectively mask the tuning times. HiPeR-l also uses pipelining to mask processing times and propagation delays. We use Markov chain theory to obtain a necessary and suficient condition f o r 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.1 In t 1 . 0 ducti o 11 IVavelength Division Multiplexing (WDM) is the most promising technology for bridging the gap between the speed of electronics and the virtually unlimited bandwidth available within the optical medium. One of the candidate WDM architectures for implementing a new generation of high speed communication networks is the single-hop architecture [9]. In a single-hop network, both a transmitter a t the source and a receiver at the destination must operate on the same wavelength for a successful packet transmission. Thus, the problem of coordinating access to the various wavelengths of the network arises. This problem is further complicated by the fact that, a t high data rates, propagation delays, processing times, and transceiver tuning times all become nonnegligible, and may actually be significantly larger than the packet transmission time. A number of reservation protocols for single-hop networks have appeared in the literature; we review some of these protocols in the next section.In this paper, we present HiPeR-b, a new reservation protocol for single-hop WDM local area networks. The novelty of HiPeR-b lies in the fact that, by transmitting a single control packet, nodes can make reservations for multiple 'This work was supported in part by a grant from the Center for Advanced Computing and Communication, NC State University. data packets. Thus, control overhead is significantly reduced, and nodes can use scheduling algorithms that can effectively mask tuning times [12]. HiPeR-t also uses pipelining to mask processing times and propagation delays; parameter 1 (the look-ahead) of the protocol controls the degree of pipelining. Drawing upon results from Markov chain theory, we obtain a necessary and sufficient condition for the stability of the protocol that provides insight in the factors affecting the protocol's operation. In the analysis, we assume arrival processes that capt...