Optical Many Casting Using QoS Depend Layer Aware Mechanism

Full Text (PDF, 1406KB), PP.65-72

Views: 0 Downloads: 0

Author(s)

R.C. Arun Chander 1,* P.Karunakaran 2 S.Venkatraman 3 I.Hameem Shanavas 4

1. Dept of Electronics & communication, K.L.N college of Engineering, Madurai, India

2. Department of ECE, K.L.N College of Information Technology, Madurai, India

3. Department of ECE, Vel Tech Chennai, India

4. Department of ECE, M.V.J College of Engineering, Bangalore-67, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2012.09.09

Received: 24 Oct. 2011 / Revised: 21 Mar. 2012 / Accepted: 16 May 2012 / Published: 8 Aug. 2012

Index Terms

BER, Constraint Based Routing (CBR), Manycast, Optical Burst-Switched Networks (OBS), Quality Of Service, Qos Routing, WDM

Abstract

Many distributed applications require a group of destinations to be coordinated to a single source. Multicasting is a communication paradigm to implement these distributed applications. In multicasting, at least one of the member in the group cannot satisfy the service requirement of the application, the multicast request said to be blocked. On the contrary in manycasting, destinations can join or leave the group, depending upon whether it satisfies the service requirement or not. Manycasting is performed over optical burst-switched (OBS) networks based on multiple qualities of service (QoS) constraints. The multiple constraints can be in the form of physical layer impairments, transmission delay, and reliability of the link. Destinations qualify only if they satisfy the Qos constraints. We develop a simple yet efficient routing algorithm which is based on the classic shortest path algorithm. The proposed layer aware FEC (L-FEC) generates repair symbols so that protection of less important dependency layers can be used with protection of more important layers for combined error correction.

Cite This Paper

R.C. Arun Chander, P.Karunakaran, S.Venkatraman, I.Hameem Shanavas, "Optical Manycasting Using Qos Depend Layer Aware Mechanism", International Journal of Information Technology and Computer Science(IJITCS), vol.4, no.9, pp.65-72, 2012. DOI:10.5815/ijitcs.2012.09.09

Reference

[1]Balagangdhar G.Bathula and vinod M.Vokkarane,”QOS-Based many casting over optical Burst switched (OBS) networks,”, IEEE/ACM Transaction on Networking, FEB. 2010,. pp. 271–283.

[2]N. Charbonneau, V. M. Vokkarane, R. Balasubramanian, and D. Silvia, “Mascot: Manycast architecture for service-oriented tactical applications,” in Proc. IEEE Int. Conf. Technol. Homeland Secur., Waltham, MA, May 2009, pp. 171–176.

[3]B. G. Bathula, “QoS aware quorum casting over optical burst switched networks,” Ph.D. dissertation, Indian Inst. Sci., Bangalore, India, 2008.

[4]X. Huang, Q. She, V. M. Vokkarane, and J. P. Jue, “Many casting over optical burst-switched (OBS) networks,” in Proc. IEEE ICC, Glasgow, Scotland, May 2007, pp. 2353–2358.

[5]A. Jukan, “Optical control plane for the grid community,” IEEE Commun. Surv. Tutor., vol. 9, no. 3, pp. 30–44, 2007.

[6]M. D. Leenheer, F. Farahmand, K. Lu, T. Zhang, P. Thysebaert, B. Volckaert, F. D. Turck, B. Dhoedt, P. Demeester, and J. P. Jue, “Anycast algorithms supporting optical burst switched grid networks,” in Proc. IEEE ICNS, Silicon Valley, CA, Jul. 2006, pp. 63–69.

[7]X. Qiu, R. Telikepalli, T. Drwiega, and J. Yan, “Reliability and availability assessment of storage area network extension solutions,” IEEE Commun. Mag., vol. 43, no. 3, pp. 80–85, Mar. 2005.

[8]A. Jukan and G. Franzl, “Path selection methods with multiple constraints in service-guaranteed WDM networks,” IEEE/ACM Trans.Netw. vol. 12, no. 1, pp. 59–72, Feb. 2004.

[9]A. Jukan and G. Franzl, “Constraint-based path selection methods for on-demand provisioning in WDM networks,” in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 827–836.

[10]L.Xu, H. G. Perros, and G. Rouskas, “Techniques for optical packet switching and optical burst switching,” IEEE Commun. Mag., vol. 39,no. 1, pp. 136–142, Jan. 2001.

[11]S.Y.Cheung and A. Kumar, “Efficient quorumcast routing algorithms,” in Proc. IEEE INFOCOM, Toronto, ON, Canada, Jun. 1994,pp. 840–847.