The Least Reusable Channel Burst Scheduling Discipline

Abstract

This paper presents a novel channel scheduling discipline for optical burst switching networks called Least Reusable Channel (LRC). LRC decides on which void to allocate an incoming burst based on the potentiality of reusing the voids created. These decisions consider the routes as well as the network load. It is shown via numerical examples that the LRC produces lower blocking probability and distributes more uniformly the losses among routes than existing scheduling disciplines.