Abstract

Optical burst switching (OBS) is emerging as the switching technology for next generation optical networks. Advantages of optical packet switching and circuit switching are combined in OBS and overcoming their limitations. Data (or payload) is separated from control packet. A control packet is sent before the payload to reserve the resources on the path to the destination of payload. When a control packet arrives at an intermediate node a wavelength scheduling algorithm is used by the scheduler to schedule the data burst on an outgoing wavelength channel. The required information to schedule a data burst are arrival time and duration of data burst, which are obtained from the control packet. On the other hand, scheduler keeps availability of time slots on every wave length channel and schedule a data burst in a channel depending upon the scheduling algorithm it uses. Different scheduling algorithms have been proposed in literature to schedule payload/ data burst. They differ in burst loss and complexity. Depending upon the channel selection strategy, they can be classified as Horizon and Void filling algorithm. Though these algorithms give less burst loss but channel utilization is very less. In this paper we introduce a new approach, which will give less burst loss and also utilize existing channels in efficient way. Also the performance of this proposed scheduling scheme has been analyzed and compared it with the existing void filling schemes. It is shown by simulations that the proposed scheme gives somewhat better performances compared to the existing schemes in terms of channel utilization and packet loss.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.