Advertisement

Abstract

Previously proposed wavelength scheduling algorithms in optical burst switching networks process each reservation request individually and in a greedy manner. In this paper we propose a new family of wavelength scheduling algorithms that process a batch of reservation requests together instead of processing them one by one. When a control burst with a reservation request arrives to a free batch scheduler, the scheduler waits for a small amount of time, called the acceptance delay, before deciding to accept or reject the reservation request. After the acceptance delay has passed, the scheduler processes all the reservation requests that have arrived during the acceptance delay, then it accepts the requests that will maximize the utilization of the wavelength channels. We describe an optimal batch scheduler that serves as an upper bound on the performance of batch scheduling algorithms. Furthermore, we introduce two heuristic batch scheduling algorithms. The performance of the proposed algorithms is evaluated using a discrete-event simulation model. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.

References

  1. 1.
    Qiao, C., Yoo, M.: Optical burst switching (obs) - a new paradigm for an optical internet. Journal of High Speed Networks 8, 69–84 (1999)Google Scholar
  2. 2.
    Wei, J.Y., McFarland, R.I.: Just-in-time signaling for wdm optical burst switching networks. Journal of Lightwave Technology 18, 2019–2037 (2000)CrossRefGoogle Scholar
  3. 3.
    Kaheel, A., Alnuweiri, H.: Wavelength scheduling algorithms in buffer-less optical burst switching networks. In: Proceedings of IASTED International Multi-Conference on Wireless and Optical Communications-WOC 2004, Canada (2004)Google Scholar
  4. 4.
    Xiong, Y., Vandenhoute, M., Cankaya, C.: Control architecture in optical burstswitched wdm networks. IEEE Journal on Selected Areas in Communications 18, 1838–1851 (2000)CrossRefGoogle Scholar
  5. 5.
    Matula, D.W.: Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM 30, 217–427 (1983)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Yannakakis, M.: The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters 24, 133–137 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Arkin, M., Silverberg, E.: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics 18, 1–8 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)zbMATHGoogle Scholar
  9. 9.
    Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New york (1998)zbMATHGoogle Scholar
  10. 10.
    OPNET Technologies Inc.: OPNET Modeler (2005), Web page: http://www.opnet.com/
  11. 11.
    Kaheel, A., Alnuweiri, H., Gebali, F.: Analytical evaluation of blocking probability in optical burst switching networks. In: Proceedings of IEEE International Conference on Communications-ICC 2004, France (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ayman Kaheel
    • 1
  • Hussein Alnuweiri
    • 1
  1. 1.University of British ColumbiaVancouverCanada

Personalised recommendations