Binary Heap Based Fair Scheduling Algorithm in Optical Burst Switching Networks

Saleh Al Omar; Abdelwadood Mesleh; Aws Al-Qaisi

doi:10.15866/irecos.v11i3.8618

Binary Heap Based Fair Scheduling Algorithm in Optical Burst Switching Networks

Saleh Al Omar^(1*), Abdelwadood Mesleh⁽²⁾, Aws Al-Qaisi⁽³⁾

^(*) Corresponding author

Authors' affiliations

DOI: https://doi.org/10.15866/irecos.v11i3.8618

Abstract

In this paper, a binary-heap based fair scheduling algorithm (BFSA) for optical burst switching (OBS) networks is proposed. BFSA calculates the cost function (CF) for every generated burst at edge nodes. CF is calculated using four fair parameters associated with each burst and it is updated at every hop until reaching the destination node. Moreover, a minimum priority queue is implemented using a binary heap tree for all incoming bursts at each code node. In contention case, the minimum cost burst that occupies the root node of the heap is considered as a victim and it is replaced by the new arriving high priority burst flow. BFSA is a fast scheduling scheme that is easily implemented at core nodes with no extra hardware components. BFSA is evaluated in terms of burst loss ratio and throughput using NS-2 simulator. Results reveal that BFSA is able to address fairness in OBS networks as it achieves better burst loss ratio and better throughput. BFSA performs much better than other fairness schemes such as the last hop pre-emption (LHP) and the fair prioritized pre-emption (FPP) schemes. In addition, it shows better fairness performance for higher priority traffic flows.
Copyright © 2016 Praise Worthy Prize - All rights reserved.

Keywords

Optical Burst Switching; Binary Heap; Fairness; OBS Networks

Full Text:

PDF

References

P.Grover, P.Singh, S.Rani, Congestion Reduction in Wireless Mesh Networks, (2015) International Journal of Computer Applications, 124(13), pp. 41-45.
http://dx.doi.org/10.5120/ijca2015905750

S.Tariq, Improving fairness, throughput and blocking performance for long haul and short reach optical networks, Ph.D. Thesis, Department of Electrical Engineering and Computer Science in the College of Engineering and Computer Science at the University of Central Florida Orlando, Florida, 2015.

P.Pavon-Marino, F.Neri, On the myths of optical burst switching, (2011) IEEE Transactions on Communications, 59(9), pp. 2574-2584.
http://dx.doi.org/10.1109/tcomm.2011.063011.100192

R. Lamba, A.Garg, Survey on contention resolution techniques for optical burst switching networks, (2012) International Journal of Engineering Research and Applications, 2, pp. 956-961.

P.Kirci, A.Zaim, Just-in-time, (2006) just-enough-time and horizon signalling protocols on optical burst switches, Optica Applicata, 36(1), pp. 111-123.

S.Tariq, S., M.Bassiouni, Performance evaluation of MPTCP over optical burst switching in data centers, (2014) International Telecommunications Symposium (ITS), pp. 1-5, Sao Paulo.
http://dx.doi.org/10.1109/its.2014.6948036

C.Loi, L.Wanjiun, Y.De-Nian, Service differentiation in optical burst switched networks, (2002) IEEE Global Telecommunications Conference, GLOBECOM'02, vol.3, pp. 2313-2317.
http://dx.doi.org/10.1109/glocom.2002.1189044

M.Ueda, T.Tachibana, S.Kasahara, Last-hop preemptive scheme based on the number of hops for optical burst switching networks, (2005) Journal of Optical Networking, 4(10), pp. 648-660.
http://dx.doi.org/10.1364/jon.4.000648

M.Euda, T. Tachibana, S.Kasahara, Intermediate-hop preemption to improve fairness in optical burst switching networks, (2008) IEICE transactions on communications, 91(3), pp. 710-721.
http://dx.doi.org/10.1093/ietcom/e91-b.3.710

X.Gao, M.Bassiouni, Gu.Li, Addressing conversion cascading constraint in OBS networks through proactive routing, (2009) Photonic Network Communications, 18(1), pp. 90-104.
http://dx.doi.org/10.1007/s11107-008-0173-7

C.Hsu , Li.Yang, On the fairness improvement of channel scheduling in optical burst-switched networks, (2008) Photonic Network Communications, 15(1), pp 51-66.
http://dx.doi.org/10.1007/s11107-007-0087-9

S. Guo, Y. Zhang and Y. Yang, Distributed Power and Rate Allocation with Fairness for Cognitive Radios in Wireless Ad Hoc Networks, (2011) IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, pp. 1-6.
http://dx.doi.org/10.1109/glocom.2011.6134317

N.Chrysos , F.Neeser, M.Gusat, R.Clauberg, C.Minkenberg, C.Basso, K.Valk, Tandem queue weighted fair smooth scheduling, (2014) Design Automation for Embedded Systems, 18(3), pp. 183-197.
http://dx.doi.org/10.1007/s10617-014-9132-y

T.Zhang, W.Dai, G.Wu, X.Li, J.Chen, C.Qiao, A Dual Price-Based Congestion Control Mechanism for Optical Burst Switching Networks, (2014) Journal of Lightwave Technology, 32(14), pp. 2492-2501.
http://dx.doi.org/10.1109/jlt.2014.2327171

Y.Coulibaly, G.Rouskas, M.Abd Latiff, M.Razzaque, S.Mandala, QoS-aware ant-based route, wavelength and timeslot assignment algorithm for optical burst switched networks, (2015) Transactions on Emerging Telecommunications Technologies, 26(11), pp. 1265-1277.
http://dx.doi.org/10.1002/ett.2919

T.Orawiwattanakul, Y.Ji, Y.Zhang, J.Li, Pre-emption scheme for providing Rate Fairness in optical burst switching networks, (2008) International conference on high performance switching and routing, shanghai, pp.39-44.
http://dx.doi.org/10.1109/hspr.2008.4734418

T.Orawiwattanakul, Y.Ji, Y.Zhang, J.Li, Fair bandwidth allocation with distance fairness provisioning in optical burst switching networks, (2009) Journal of Lightwave Technology, 27(16), pp.3370-3380.
http://dx.doi.org/10.1109/jlt.2009.2014971

T.Issariyakul, E.Hossain, Introduction to Network Simulator NS2, Second Edition, Springer, 2012.
http://dx.doi.org/10.1007/978-0-387-71760-9_2

Refbacks

There are currently no refbacks.

Username
Password
Remember me