Skip to main content

Group-Scheduling for Multi-Service Optical Burst Switching (OBS) Networks

  • Original Article
  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

We propose a new burst scheduling mechanism for Optical Burst-Switched (OBS) networks. The new approach is made possible by gathering data bursts into groups and performing the scheduling decision for each group collectively. In OBS group-scheduling, bursts will not be considered for scheduling until a pre-defined time period elapses, during which the group of burst header packets would be gathered. By transforming a set of data bursts into a set of corresponding time intervals, the problem of scheduling these bursts is transformed into a combinatorial optimization problem. Graph algorithms are applied to obtain the maximum number of non-overlapping bursts. The proposed OBS group-scheduling scheme is shown to improve the performance of OBS networks over existing scheduling schemes in terms of burst loss probability and channel utilization. With an extension through a sequential optimization, using a Branch-and-Bound technique, the proposed scheme can support multiple classes of service. It is shown that the new scheduling approach has several desired characteristics including fairness and service differentiability among classes in terms of burst loss probability and channel utilization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. T. El-Bawab A. Agrawal F. Poppe L. Sofman D. Papadimitriou B. Rousseau (2003) ArticleTitleThe evolution to opt-switching based core networks Optical Networks Magazine 4 IssueID2 7–19

    Google Scholar 

  2. J.S. Turner (1999) ArticleTitleTerabit burst switching J. High-Speed Networks 8 IssueID1 3–16 Occurrence Handle0964.11011

    MATH  Google Scholar 

  3. C. Qiao M. Yoo (1999) ArticleTitleOptical burst switching (OBS) – A new paradigm for an optical internet J. High-Speed Networks 8 IssueID1 69–84

    Google Scholar 

  4. J.Y. Wei R.I. McFarland (2000) ArticleTitleJust-in-time signaling for WDM optical burst switching networks IEEE/OSA J. Lightwave Technol. 18 IssueID12 2019–2037

    Google Scholar 

  5. Charcranoon, S., El-Bawab, T., Cankaya, H., Shin, J-D.: Groupscheduling for optical burst switched (OBS) networks. Proceedings of IEEE Globecom’03, vol. 5, pp. 2745–2749. San Francisco, CA, USA (2003)

  6. E.M. Arkin E.B. Silverberg (1987) ArticleTitleScheduling jobs with fixed start and end times Discrete Appl. Math. 18 IssueID1 1–8 Occurrence Handle10.1016/0166-218X(87)90037-0 Occurrence Handle88j:90116

    Article  MathSciNet  Google Scholar 

  7. M.R. Garey D.S. Johnson (1976) ArticleTitleScheduling tasks with nonuniform deadlines J. ACM 23 IssueID3 461–467 Occurrence Handle10.1145/321958.321967 Occurrence Handle54 #6929

    Article  MathSciNet  Google Scholar 

  8. M.R. Garey D.S. Johnson (1997) ArticleTitleTwo-processor scheduling with start-times and deadlines SIAM J. Comput. 6 IssueID3 416–426 Occurrence Handle58 #25930

    MathSciNet  Google Scholar 

  9. C.H. Papadimitriou M. Yannakakis (1979) ArticleTitleScheduling interval-ordered tasks SIAM J. Comput. 8 IssueID3 405–409 Occurrence Handle10.1137/0208031 Occurrence Handle80e:68087

    Article  MathSciNet  Google Scholar 

  10. Rifkin A. The utility of foresight in single server scheduling. Manuscript, Dept. of Computer Science, College of William and Mary, Williamsburg, VA USA

  11. M. Yoo C. Qiao S. Dixit (2000) ArticleTitleQoS performance of optical burst switching in IP-over-WDM networks IEEE J. Select Areas Commun. 18 IssueID10 2062–2071

    Google Scholar 

  12. K. Dolzer C. Gauger J. Spath S. Bodamer (2001) ArticleTitleEvaluation of reservation mechanisms in optical burst switching AEU Int. J. Electron. Commun. 55 IssueID1 18–26

    Google Scholar 

  13. Poppe, F., Laevens, K., Michiel, H., Molenaar, S.: Quality-of-service differentiation and fairness in optical burst-switched networks, pp. 118–124. Proc. Opticomm 2002, Boston, MA, USA (2002)

  14. Chen, Y., Hamdi, M., Tsang D.H.K.: Proportional QoS over OBS networks. Proc. IEEE GLOBECOM 2001, vol. 3, pp 1510–1514 San Antonio, TX, USA (2001)

  15. Sofman, L., El-Bawab, T., Laevens, K.: Segmentation overhead in optical burst switching. pp 101–108 Proc. Opticomm 2002, Boston, MA, USA (2002)

  16. Cankaya, H., Charcranoon, S., El-Bawab,T.:Apreemptive scheduling technique for OBS networks with service differentiation. Proc. IEEE Globecom’03, vol. 5, pp. 2704–2708. San Francisco, CA, USA (2003)

  17. A. Agrawal T.S. El-Bawab L. Sofman (2005) ArticleTitleComparative account of bandwidth efficiency in optical burst switching and optical circuit switching networks Photonic Network Commun. 9 IssueID3 279–309

    Google Scholar 

  18. Charcranoon S., El-Bawab T.S., Shin J.-D., Cankaya H.C. A framework for operation and maintenance (OAM) in optical burst switched networks. Accepted for publication in the J. Network Systems Manage. 13(4) (2005)

  19. U. Faigle W.M. Nawijin (1995) ArticleTitleNote on scheduling intervals on-line Discrete Appl. Math. 58 IssueID1 13–17 Occurrence Handle10.1016/0166-218X(95)00112-5 Occurrence Handle95m:90052

    Article  MathSciNet  Google Scholar 

  20. Lipton R.J., Zomkins, A. Online interval scheduling. Proc. the 5th Annual ACM-SIAM Symposium On Discrete Algorithms Arlington, VA, USA, pp. 302–311 (1994)

  21. I. Widjaja (1995) ArticleTitlePerformance analysis of burst admission control protocols IEE Proc. Commun. 142 IssueID1 7–14 Occurrence Handle10.1049/ip-com:19951551

    Article  Google Scholar 

  22. M.R. Garey D.S. Johnson (1979) Computers and Intractability: A guide to the Theory of NP-completeness Freeman New York

    Google Scholar 

  23. F. Gavril (1972) ArticleTitleAlgorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph SIAM J. Comput. 1 IssueID2 180–187 Occurrence Handle10.1137/0201013 Occurrence Handle0227.05116 Occurrence Handle48 #5922

    Article  MATH  MathSciNet  Google Scholar 

  24. Karp, R. Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., (eds.) Complexity of Computer Computations. Plenum Press (1972)

  25. R. Kopf G. Ruhe (1987) ArticleTitleA computational study of the weighted independent set problem for general graphs Foundations Control Eng. 12 IssueID4 167–180 Occurrence Handle89f:05102

    MathSciNet  Google Scholar 

  26. M.C. Golumbic (1980) Algorithmic Graph Theory and Perfect Graphs Academic Press New York

    Google Scholar 

  27. J.R.R. Alfonsin B.A. Reed (2001) Perfect Graph John Wiley & Sons Chichester, England

    Google Scholar 

  28. D.J. Rose R.E. Tarjan G.S. Lueker (1976) ArticleTitleAlgorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 IssueID2 266–283 Occurrence Handle10.1137/0205021 Occurrence Handle53 #12077

    Article  MathSciNet  Google Scholar 

  29. Heinanen, J., Baker, F., Weiss, W., Wroclawski, J. Assured Forwarding PHB Group, RFC 2597 (1999)

  30. Heinanen, J., Guerin, R. A single rate three color marker. RFC 2697 (1999)

  31. S. Verma H. Chaskar R. Ravikanth (2000) ArticleTitleOptical burst switching: a viable solution for terabit IP backbone IEEE Network 14 IssueID6 48–53

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Saravut Charcranoon.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Charcranoon, S., El-Bawab, T.S., Shin, JD. et al. Group-Scheduling for Multi-Service Optical Burst Switching (OBS) Networks. Photon Netw Commun 11, 99–110 (2006). https://doi.org/10.1007/s11107-006-5327-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-006-5327-x

Keywords