Abstract

This paper presents a novel channel scheduling policy for optical burst switching networks called least reusable channel (LRC). LRC decides to which interval of the output channel (void) an incoming burst should be allocated on the basis of reuse of the remaining voids. LRC dynamically uses information available to make allocation decisions. It is shown here that LRC produces lower blocking probability and distributes losses more uniformly among routes than do other existing scheduling policies.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call