Inbuilt-Burstification Urgency-driven Scheduling (iBUS) Algorithm for packet transport in IP-over-WDM networks

With emerging applications in packet transport net works such as IP over WDM networks (e.g., eBanking), packets need to be delivered within a bounded delay (i.e., given deadlines) with high probability. To satisfy such requirement, we propose an Inbuilt Burstification Urgency driven Scheduling (iBUS) Algorithm in IP over WDM networks. In this approach, packets are assembled into bursts according to their destinations by a preset tinier. The timing burstification can reduce the amount of contentions, and support deadline constraints. Then all assembled bursts need to be scheduled efficiently with the deadline constraint. We introduce the concept of urgency degree as a scheduling metric. Bursts are scheduled according to their urgency degrees so that utilization of available network resources can be maximized under the constraint of deadlines. We also study a high level variant of our algorithm, beta iBUS, where the parameter beta is used to truncate the acceptable range of urgency degrees [0, 1] into [0, beta] (where beta <= 1) so that invalid scheduling caused by high urgency degrees can be minimized. Simulation experiments demonstrate that our proposal can achieve limited loss probabilities with the constraint of bounded delay.