Abstract
Hop-based burst-cluster transmission improves fairness significantly in OBS ring networks. However, in mesh networks, the overall burst loss probability increases using the method because the transmission of a burst-cluster from an ingress node is often synchronized with a burst-cluster from another ingress node. In order to resolve the synchronization issue, we propose in this article the utilization of random scheduling for hop-based burst-cluster transmission. In random scheduling, the maximum waiting time is determined in advance from the maximum acceptable delay of an IP packet and the buffer size of the ingress node. Every time a burst-cluster is generated, a scheduler derives the actual waiting time at random based on the obtained maximum waiting time. When a timer becomes the actual waiting time, the burst cluster is transmitted from the scheduler. By simulation, we evaluate the effectiveness of random scheduling for NSFNET. Numerical examples show that the random scheduling can resolve the synchronization issue and can decrease the overall burst loss probability. In addition, it is shown that random scheduling can also improve the fairness significantly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Qiao C., Woo M.: Optical burst switching (OBS)—a new paradigm for an optical Internet. J. High Speed Netw. 8(1), 69–84 (1999)
Wei Y., McFarland R.I.: Just-in-time signaling for WDM optical burst switching networks. J. Lightwave Technol. 18(12), 2019–2037 (2000)
Zhou B., Bassiouni M.A., Li G.: Improving fairness in optical burst switching networks. J. Opt. Netw. 3(4), 214–228 (2004)
Ueda M., Tachibana T., Kasahara S.: Last-hop preemptive scheme based on the number of hops for optical burst switching networks. J. Opt. Netw. 4(10), 648–660 (2005)
Ueda M., Tachibana T., Kasahara S.: Intermediate-hop preemption to improve fairness in optical burst switching networks. IEICE Trans. Commun. E91-B(3), 1290–1298 (2005)
Orawiwattanakul, T., Ji, Y.: Preemption scheme for improving source level fairness in optical burst switching. In: Proceedings of 4th International Conference on Innovations in Information Technology, pp. 710–714, November 2007
Zhou B., Bassiouni M.A.: Concurrent enhancement of network throughput and fairness in optical burst switching environments. Photon. Netw. Commun. 14(2), 199–207 (2007)
Tachibana, T., Kasahara, S., Harai, H.: Burst-cluster transmission based on the number of hops for improving fairness in optical burst switching networks. In: Proceedings of the IEEE Globecom 2006, December 2006
Tachibana T., Kasahara S.: Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks. IEEE Commun. Mag. 44(5), 46–55 (2006)
Yuan, C., Li, Z., Xu, A.: A novel burst assembly algorithm for OBS networks based on data-length time-lag product. In: Proceedings of Asia-Pacific Conference, pp. 319–323 (2005)
Transmission Impairments due to Speech Processing, ITU-T Recommendation G. 113 (International Telecommunication Union, 2002)
Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical Report DEC-TR-301, Digital Equipment Corporation, July 1984
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Oulad Nassar, B., Tachibana, T. & Sugimoto, K. Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks. Photon Netw Commun 19, 292–300 (2010). https://doi.org/10.1007/s11107-009-0234-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-009-0234-6