A frequent-pattern approach for optical networks routing planning
- 45 Downloads
Optical burst switching (OBS) networks have been receiving much attention as a promising approach to build the next generation optical Internet. In the bufferless DWDM switching technology, burst loss that should be minimized is the key design parameter. One of the critical design issues in OBS network is how to plan the optimal routing path in order to minimize burst dropping due to network resource contention. This study proposes the burst frequent-pattern tree (BFP-Tree) approach to pre-determine a suitable routing path in the OBS network. The BFP-Tree approach essentially is a learning-based mechanism that is able to determine a suitable transmission path from the historical network transaction data. The experiment results show that the successful rates of routing paths obtained by the BFP-Tree approach are able to converge to those of the optimal results.
KeywordsOptical burst switching Routing path Network management
Unable to display preview. Download preview PDF.
- 2.Qiao C., Yoo M.: Optical burst switching (OBS)-a new paradigm for an optical internet. J. High Speed Netw 8(1), 69–84 (1999)Google Scholar
- 6.Bregni S., Guerra G., Pattavina A.: Optical switching IP traffic using input buffered architectures. Opt. Netw. Mag. 3(6), 20–29 (2002)Google Scholar
- 10.Wang X., Morikawa H., Aoyama T.: Priority-based wavelength assignment algorithm for burst switched WDM optical networks. IEICE Trans. Commun. e86-b(5), 1508–1514 (2003)Google Scholar
- 13.Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. Proceedings of the ACM-SIGMOD International Conference, pp. 207–216. Washington, D. C., USA, May 1993Google Scholar
- 14.Borgelt, C., Kruse, R.: Induction of association rules: apriori implementation. 15th Conference on Computational Statistics, pp. 395–400, (Compstat 2002, Berlin, Germany). Physica Verlag, Heidelberg, Germany (2002)Google Scholar
- 15.Orlando, S., Palmerini, P., Perego, R.: Enhancing the apriori algorithm for frequent set counting. Proceedings of the 3rd International Conference on Data Warehousing and Knowledge Discovery, pp. 71–82. Munich, Germany, September 5–7, (2001)Google Scholar
- 18.Hwang I.S., Chiu C.C., Su R.R., Shyu Z.D.: Burst routing planning for optical networks using the association rule approach. Int. J. Comput. Sci. Netw. Secur. (IJCSNS) 6(10), 173–178 (2006)Google Scholar
- 21.Maunder, A.S., Hjálmtýsson, G., VanderMerwe, K., Ramakrishnan K.K.: Evaluating the performance of UNITE’s hop-by-hop routing vs. source routing, ATM Forum/98–0784, October (1998)Google Scholar