Resource reservation in DTM

Abstract

DTM is an optical network with bandwidth reservation and support for dynamic reallocation of bandwidth. DTM is designed for real-time multimedia applications and for high-speed computer communication. DTM provides a service with real-time guarantees: it allows reservation of bandwidth, and has constant delay between two nodes. DTM uses a novel medium-access technique and provides a multicast channel service. This paper describes how resources are reserved in DTM, and describes a DTM prototype implementation to demonstrate that the protocols can be implemented efficiently.

Why Not RSVP over DTM ?

“…The DTM uses a strict resource reservation scheme, where a new channel is admitted only if there is enough free slots. The main point in DTM resource reservation is that a host gets a bandwidth in direct proportion to the number of slots [10]. The DTM supports dynamic reallocation of slots between nodes.…”

Smoothing Algorithms for DTM Networks

“…The total medium capacity is shared by all connected nodes using time division multiplexing. Previous proposals and implementations [5,6] are based on dual-bus topology.…”

“…We proposed two other request orders in [1,3,4] and carried out a performance evaluation study focusing on the fairness of the three variants, which are: -Closest First: KTH-CF algorithm [6] It operates according to the closest first rule. That is, the node that received a connection request when having too few free slots sends the first slot request to the closest node out of nodes with free slots according to the status table.…”

“…In the basic set-up time channel allocation algorithm of DTM (KTH algorithm) [5,6], the request or of nodes during channel allocation is based on the closest first algorithm. We proposed two other request orders in [1,3,4] and carried out a performance evaluation study focusing on the fairness of the three variants, which are: -Closest First: KTH-CF algorithm [6] It operates according to the closest first rule.…”