Path Loss Rate Driven Burst Assembly in OBS Networks

  • Burak Kantarci
  • Sema Oktug
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4263)


In this paper a novel optical burst assembly technique, namely path loss rate driven burst assembly which is an enhancement on an adaptive threshold based burst assembly is proposed. Path loss rate driven burst assembly adjusts the threshold values based on the feedback obtained from the network. Each egress node sends feedback packets periodically to each ingress node informing them on the contention level along the path. As the traffic along the corresponding path becomes lighter, an ingress node allows the corresponding burst generator to use greater time and size threshold values. Conversely, under heavy traffic along the path, the corresponding burst generators are forced to decrease the time and size threshold parameters. The results are obtained in terms of byte loss rate and delay, and compared with those obtained under nonadaptive (static) burst assembly and previously proposed link loss rate based adaptive threshold burst assembly. It is observed that the proposed technique significantly decreases the byte loss rate as the traffic gets heavier by keeping the end to end delay in a feasible range.


Loss Rate Size Threshold Burst Size Optical Burst Switching Outgoing Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Xu, J., Qiao, C., Li, J., Xu, G.: Efficient Channel Scheduling Algorithms in Optical Burst Switched Networks. In: Proc. IEEE International Conference on Computer Communications (INFOCOM), March 2003, vol. 3, pp. 2268–2278 (2003)Google Scholar
  2. 2.
    Chen, Y., Qiao, C., Li, J., Xu, G.: Optical Burst Switching: A New Area in Optical Networking Research. IEEE Network 18, 16–23 (2004)CrossRefGoogle Scholar
  3. 3.
    Ge, A., Callegati, F., Tamil, L.: On Optical Burst Switching and Self-similar Traffic. IEEE Communication Letters 4(3), 98–100 (2000)CrossRefGoogle Scholar
  4. 4.
    Oh, S., Kang, M.: A Burst Assembly Algorithm in Optical Burst Switching Networks. In: Proc. Optical Fiber Communications Conference and Exhibit (OFC), May 2003, pp. 771–773 (2003)Google Scholar
  5. 5.
    Luo, J., Zen, Q., Chi, H., Zhang, Z., Zhao, H.: The impacts of burst assembly on the traffic properties in optical burst switching networks. In: Proc. IEEE International Conference on Communication Technology, April 2003, vol. 1, pp. 521–524 (2003)Google Scholar
  6. 6.
    Kantarci, B., Oktug, S.: Adaptive Threshold Based Burst Assembly in OBS Networks. In: Proc. Canadian Conference on Electrical and Computer Engineering (CCECE), May 2006 (to appear)Google Scholar
  7. 7.
    Battestilli, T., Perros, H.: A Performance Study of an Optical Burst Switched Network with Simultaneous Dynamic Link Possession. Computer Networks 50(2), 219–236 (2006)MATHCrossRefGoogle Scholar
  8. 8.
    Cano, M.D., Malgosa-Sanahuja, J., Cerdan, F., Garcia-Haro, J.: Internet Measurements and Data Study Over the Regional. In: Proc. IEEE Pacific RIM Conference on Communications, Computers and Signal Processing, vol. 2, pp. 393–396 (2001)Google Scholar
  9. 9.
    Kantarci, B., Oktug, S., Atmaca, T.: Performance of Optical Burst Switching Techniques under Self-similar and Poisson Traffic Based on Various Burst Assembly Techniques. Elsevier Computer Communications (under review, 2006)Google Scholar
  10. 10.
    Hu, G., Dolzer, K., Gauger, C.: Does Burst Assembly Really Reduce Self-similarity? In: Optical Fiber Communications Conference (OFC). OSA Trends in Optics and Photonics Series, vol. 86, pp. 124–126 (2003)Google Scholar
  11. 11.
    Vokkarane, V.M., Qiong, Z., Jue, J.P., Biao, C.: Generalized Burst Assembly and Scheduling Techniques for QoS Support in Optical Burst-Switched Networks. In: Proc. IEEE Global Telecommunications Conference, November 2002, vol. 3, pp. 2747–2751 (2002)Google Scholar
  12. 12.
    Taqqu, M.S., Willinger, W., Sherman, R.: Proof of a Fundamental Result in Self-similar Traffic Modeling. ACM/SIGCOMM Computer Communications Review 27, 5–23 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Burak Kantarci
    • 1
  • Sema Oktug
    • 1
  1. 1.Department of Computer Engineering, Computer Networks Research Lab.Istanbul Technical UniversityIstanbulTurkey

Personalised recommendations