Performance study of new OBS channel scheduling algorithms in a multiservice network

M. A. Aydin; T. Atmaca; O. C. Turna; H. Zaim

doi:10.1109/ICNS.2009.27

Performance study of new OBS channel scheduling algorithms in a multiservice network

M. A. Aydin, T. Atmaca, O. C. Turna, H. Zaim

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Citations (Scopus)

Abstract

This paper presents a comparative study between JET (Just Enough Time) and a number of new preemptive channel scheduling algorithms in Optical Burst Switching (OBS) with QoS (Quality of Service) requirement. In terms of performance criteria, loss rate in byte, access delay and end-toend delay are considered. A 2-state MMPP (Markov Modulated Poisson Process) traffic generator on a 14-node mesh network topology illustrating NSFNET is designed as the testbed. NS2 Network Simulation tool is used for our tests. Bursts are created using a hybrid model that takes into account both timeout and maximum length threshold mechanisms. In core and edge nodes, in order to satisfy QoS requirements two mechanisms such as Regulative Wavelength Grouping (RWG) and priority based queuing are used. RWG mechanism, where the number of wavelengths for each traffic class is arranged for adjusting the burst drop probability of traffic classes under a specific threshold value, is used for providing priority levels in core nodes. In priority based queuing, bursts are sent according to their priority order, in edge nodes. Simulation works have shown that our preemptive channel scheduling algorithms give better results compared to the other studied algorithms while considering QoS.

Original language	English
Title of host publication	Proceedings of the 5th International Conference on Networking and Services, ICNS 2009
Pages	242-248
Number of pages	7
DOIs	https://doi.org/10.1109/ICNS.2009.27
Publication status	Published - 2009
Externally published	Yes
Event	5th International Conference on Networking and Services, ICNS 2009 - Valencia, Spain Duration: 20 Apr 2009 → 25 Apr 2009

Publication series

Name	Proceedings of the 5th International Conference on Networking and Services, ICNS 2009

Conference

Conference	5th International Conference on Networking and Services, ICNS 2009
Country/Territory	Spain
City	Valencia
Period	20/04/09 → 25/04/09

Keywords

Access delay
Channel scheduling algorithms
End-to-end delay
Loss rate
Optical burst switching (OBS)
QoS
Simulation
Traffic models

Access to Document

10.1109/ICNS.2009.27

Cite this

Aydin, M. A., Atmaca, T., Turna, O. C., & Zaim, H. (2009). Performance study of new OBS channel scheduling algorithms in a multiservice network. In Proceedings of the 5th International Conference on Networking and Services, ICNS 2009 (pp. 242-248). Article 4976767 (Proceedings of the 5th International Conference on Networking and Services, ICNS 2009). https://doi.org/10.1109/ICNS.2009.27

@inproceedings{03ab1c4409ce4800803f49f52173ce25,

title = "Performance study of new OBS channel scheduling algorithms in a multiservice network",

abstract = "This paper presents a comparative study between JET (Just Enough Time) and a number of new preemptive channel scheduling algorithms in Optical Burst Switching (OBS) with QoS (Quality of Service) requirement. In terms of performance criteria, loss rate in byte, access delay and end-toend delay are considered. A 2-state MMPP (Markov Modulated Poisson Process) traffic generator on a 14-node mesh network topology illustrating NSFNET is designed as the testbed. NS2 Network Simulation tool is used for our tests. Bursts are created using a hybrid model that takes into account both timeout and maximum length threshold mechanisms. In core and edge nodes, in order to satisfy QoS requirements two mechanisms such as Regulative Wavelength Grouping (RWG) and priority based queuing are used. RWG mechanism, where the number of wavelengths for each traffic class is arranged for adjusting the burst drop probability of traffic classes under a specific threshold value, is used for providing priority levels in core nodes. In priority based queuing, bursts are sent according to their priority order, in edge nodes. Simulation works have shown that our preemptive channel scheduling algorithms give better results compared to the other studied algorithms while considering QoS.",

keywords = "Access delay, Channel scheduling algorithms, End-to-end delay, Loss rate, Optical burst switching (OBS), QoS, Simulation, Traffic models",

author = "Aydin, {M. A.} and T. Atmaca and Turna, {O. C.} and H. Zaim",

year = "2009",

doi = "10.1109/ICNS.2009.27",

language = "English",

isbn = "9780769535869",

series = "Proceedings of the 5th International Conference on Networking and Services, ICNS 2009",

pages = "242--248",

booktitle = "Proceedings of the 5th International Conference on Networking and Services, ICNS 2009",

note = "5th International Conference on Networking and Services, ICNS 2009 ; Conference date: 20-04-2009 Through 25-04-2009",

}

Aydin, MA, Atmaca, T, Turna, OC & Zaim, H 2009, Performance study of new OBS channel scheduling algorithms in a multiservice network. in Proceedings of the 5th International Conference on Networking and Services, ICNS 2009., 4976767, Proceedings of the 5th International Conference on Networking and Services, ICNS 2009, pp. 242-248, 5th International Conference on Networking and Services, ICNS 2009, Valencia, Spain, 20/04/09. https://doi.org/10.1109/ICNS.2009.27

Performance study of new OBS channel scheduling algorithms in a multiservice network. / Aydin, M. A.; Atmaca, T.; Turna, O. C. et al.
Proceedings of the 5th International Conference on Networking and Services, ICNS 2009. 2009. p. 242-248 4976767 (Proceedings of the 5th International Conference on Networking and Services, ICNS 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Performance study of new OBS channel scheduling algorithms in a multiservice network

AU - Aydin, M. A.

AU - Atmaca, T.

AU - Turna, O. C.

AU - Zaim, H.

PY - 2009

Y1 - 2009

N2 - This paper presents a comparative study between JET (Just Enough Time) and a number of new preemptive channel scheduling algorithms in Optical Burst Switching (OBS) with QoS (Quality of Service) requirement. In terms of performance criteria, loss rate in byte, access delay and end-toend delay are considered. A 2-state MMPP (Markov Modulated Poisson Process) traffic generator on a 14-node mesh network topology illustrating NSFNET is designed as the testbed. NS2 Network Simulation tool is used for our tests. Bursts are created using a hybrid model that takes into account both timeout and maximum length threshold mechanisms. In core and edge nodes, in order to satisfy QoS requirements two mechanisms such as Regulative Wavelength Grouping (RWG) and priority based queuing are used. RWG mechanism, where the number of wavelengths for each traffic class is arranged for adjusting the burst drop probability of traffic classes under a specific threshold value, is used for providing priority levels in core nodes. In priority based queuing, bursts are sent according to their priority order, in edge nodes. Simulation works have shown that our preemptive channel scheduling algorithms give better results compared to the other studied algorithms while considering QoS.

AB - This paper presents a comparative study between JET (Just Enough Time) and a number of new preemptive channel scheduling algorithms in Optical Burst Switching (OBS) with QoS (Quality of Service) requirement. In terms of performance criteria, loss rate in byte, access delay and end-toend delay are considered. A 2-state MMPP (Markov Modulated Poisson Process) traffic generator on a 14-node mesh network topology illustrating NSFNET is designed as the testbed. NS2 Network Simulation tool is used for our tests. Bursts are created using a hybrid model that takes into account both timeout and maximum length threshold mechanisms. In core and edge nodes, in order to satisfy QoS requirements two mechanisms such as Regulative Wavelength Grouping (RWG) and priority based queuing are used. RWG mechanism, where the number of wavelengths for each traffic class is arranged for adjusting the burst drop probability of traffic classes under a specific threshold value, is used for providing priority levels in core nodes. In priority based queuing, bursts are sent according to their priority order, in edge nodes. Simulation works have shown that our preemptive channel scheduling algorithms give better results compared to the other studied algorithms while considering QoS.

KW - Access delay

KW - Channel scheduling algorithms

KW - End-to-end delay

KW - Loss rate

KW - Optical burst switching (OBS)

KW - QoS

KW - Simulation

KW - Traffic models

UR - http://www.scopus.com/inward/record.url?scp=67650661398&partnerID=8YFLogxK

U2 - 10.1109/ICNS.2009.27

DO - 10.1109/ICNS.2009.27

M3 - Conference contribution

AN - SCOPUS:67650661398

SN - 9780769535869

T3 - Proceedings of the 5th International Conference on Networking and Services, ICNS 2009

SP - 242

EP - 248

BT - Proceedings of the 5th International Conference on Networking and Services, ICNS 2009

T2 - 5th International Conference on Networking and Services, ICNS 2009

Y2 - 20 April 2009 through 25 April 2009

ER -

Performance study of new OBS channel scheduling algorithms in a multiservice network

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this