REBOOK: a deterministic, robust and scalable resource booking algorithm

This paper addresses the resource reservation problem in a packet switching network. REBOOK, the presented algorithm, provides deterministic, fast (real-time) dynamic resource allocation and release. Based on a stateful approach, it handles faults and network errors, and recovers from route changes and unexpected flows shutdown. The distributed scheme used to store flows information avoids the need of searching for entries within the routers’ control memory when packets are received and guarantees constant complexity. REBOOK can be implemented in hardware and is compatible with any packet switching network. In the Internet, it can be integrated in TCP or used with UDP to make it network friendly. Moreover, a slightly extended implementation of RSVP can be used as signalling and hosting protocol. A software implementation as standalone protocol has been developed to prove its effectiveness, robustness, and performance.