141 Hits in 9.3 sec

Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks

A. Khalil, A. Hadjiantonis, C.M. Assi, A. Shami, G. Ellinas, M.A. Ali
2006 Journal of Lightwave Technology  
This paper addresses the problem of dynamically provisioning both low-speed 1 unicast and multicast connection requests in mesh-based wavelength division multiplexing (WDM) optical networks.  ...  In addition, a constraint-based grooming strategy is devised to utilize the overall network resources as efficiently as possible.  ...  To the best of our knowledge, the problem of grooming dynamic multicast traffic and designing a light-tree-based hypergraph logical topology (HGLT) for dynamic multicast traffic in WDM networks has not  ... 
doi:10.1109/jlt.2005.861922 fatcat:ul2yfebwmvcg3gfxwk2sxjmb64

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

Cai Lu, Hongbin Luo Luo, Sheng Wang Wang, Lemin Li Li
2006 ETRI Journal  
This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks.  ...  Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions.  ...  Dynamic Provisioning of Survival Multicast Session In this section, we establish simulations on dynamic provisioning of survival multicast sessions in an optical WDM mesh network.  ... 
doi:10.4218/etrij.06.0105.0158 fatcat:jgyyogos3bfu3afoloeu3fayku

Longest Path First WDM Multicast Protection for Maximum Degree of Sharing [chapter]

Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseung Choo
2006 Lecture Notes in Computer Science  
In this paper, we investigate efficient approaches and algorithms for protecting multicast sessions against any single link failure while establishing multicast sessions in WDM mesh networks.  ...  Since degree of sharing among the paths is essential to reduce the total cost and blocking probability, we propose the longest path first-shared disjoint paths (LPF-SDP) algorithm which decides the priority  ...  The simulation results both for static multicast sessions and for dynamic ones in the sample network and random networks show that our LPF-SDP yields the least total network cost and the blocking performance  ... 
doi:10.1007/11758501_155 fatcat:bguzg3f4t5eajewtuxtckqwcje

Physical Layer Impairments in the Optimization of the Next-Generation of All-Optical Networks [chapter]

Javier E.
2012 Optical Fiber Communications and Devices  
They also propose using all resources efficiently in order to decrease the blocking probability.  ...  Liao et al. (2006) explore the dynamic problem of WDM mesh networks with MTG to analyze and improve the blocking probability, by proposing an algorithm based on light-tree integrated with grooming.  ...  Physical Layer Impairments in the Optimization of the Next-Generation of All-Optical Networks, Optical Fiber Communications and Devices, Dr Moh.  ... 
doi:10.5772/26438 fatcat:a5melmzy3nb37mrk7vsa2sj4sa

Performance analysis of multicast routing and wavelength assignment protocol with dynamic traffic grooming in WDM networks

N. Kaliammal, G. Gurusamy
2011 International Journal of Communication Systems  
In this paper, a multicast routing and wavelength assignment protocol for capacity improvement in wavelength division multiplexing (WDM) networks is designed.  ...  An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization as well as minimizing  ...  In Optimized Dynamic Traffic Grooming for Multicast Traffic technique, Maximizing bandwidth capacity algorithm is used to increase resource utilization, and to minimize the blocking probability for future  ... 
doi:10.1002/dac.1339 fatcat:p7jmocl4lvbwjlekdudkdprdcu

Multicast Traffic Grooming based Light-tree in WDM Mesh Networks

Ashok Kumar Pradhan, Tanmay De
2013 Procedia Technology - Elsevier  
This paper propose a heuristic algorithm called Saturated-Light-Tree based Multicast Traffic Grooming (SLTMTG) that solves grooming, routing and wavelength assignment problems.  ...  The performance of proposed algorithm has compared with existing Multicast Traffic Grooming (MTG) algorithm.  ...  The authors in [12] proposed an on-line multicast traffic grooming algorithm called multicast dynamic light-tree grooming (MTDGA), which adopts dynamically changing light-trees as the building block  ... 
doi:10.1016/j.protcy.2013.12.436 fatcat:tdqw3egl3bdv5joh2qhlf2kdue


2014 Journal of Computer Science  
In the proposed work, the focus is on increasing the available wavelength in the all-optical networks, for which the Routing and Wavelength Assignment plays a vital role.  ...  Experimentally the proposed algorithm works by means of constructing Multiple Minimum Spanning Trees (MMST) using Mayeda and Seshu algorithm considering the QoS parameter delay and avoids the call blocking  ...  The static multicast advance reservation problem for all-optical wavelength-routed WDM networks was proposed in the work by (Charbonneau and Vokkarane, 2012) .  ... 
doi:10.3844/jcssp.2014.224.232 fatcat:fkxrxbr2arel5k4skldogcnkx4

A Heuristic Approach for Multicast Traffic Grooming in Optical WDM Mesh Networks

Ashok Kumar Pradhan, Subhendu Barat, Tanmay De
2013 International Journal of Computer Network and Information Security  
In this work, multicast traffic grooming problem is addressed to maximize the bandwidth utilization for a set of sessions in an optical WDM mesh topology.  ...  We propose a heuristic approach called Prioritized Multicast Traffic Grooming (PMTG) for constructing multicast tree and a first fit algorithm for wavelength assignment.  ...  blocking probability and saving ports of multicast requests in optical networks.  ... 
doi:10.5815/ijcnis.2014.01.06 fatcat:whkcv4mzfvh6dcvfakyqoljxly

On multicasting in wavelength-routing mesh networks

Ashraf Hamad, Tao Wu, Ahmed E. Kamal, Arun K. Somani
2006 Computer Networks  
In particular, the following must be determined: • The link capacity, in terms of the number of fibers per link, 1 For the case of networks provisioned for multicasting.  ...  The paper discusses the challenges of multicast support in optical wavelength routing networks, and reports on the advances made so far in this venue.  ...  AOM-R in Networks with No Splitting Capabilities [40] The authors in [40] proposed a new routing algorithm for the [N,W,B] -S n -C n -M n network model.  ... 
doi:10.1016/j.comnet.2005.12.012 fatcat:avkuytxxv5b67ae4v3ypzxmhke

A Flexible Scalable Solution for All-Optical Multifiber Multicasting: SLAM

Fatih Koksal, Cem Ersoy
2007 Journal of Lightwave Technology  
a performance loss in other metrics (one extra transmitter for 12 multicast sessions).  ...  In this paper, we evaluate and propose scalable layered all-optical multicasting (SLAM), which is a scalable version of LAMA, for any size static or dynamic multicasting problems.  ...  We proposed to use the layered graph for modeling the WDM network as described in [15] - [17] for all-optical multicasting.  ... 
doi:10.1109/jlt.2007.902773 fatcat:pznhgc25n5ajrkz3ijywxo2veu

Multicasting in WDM networks with heterogeneous group weights

Jingyi He, Danny H. K. Tsang, S.-H. Gary Chan
2004 Journal of Optical Networking  
We address multicasting in a wavelength-routed WDM network in which each destination node has different, as opposed to the traditional uniform, weights for different multicast groups.  ...  We propose for this purpose a routing and wavelength assignment (RWA) heuristic that serves the group of the largest weight first (LWF).  ...  Acknowledgments This work was supported, in part, by the Area of Excellence Scheme in Information Technology of the University Grant Council (AoE/E-01/99) and by the Competitive Earmarked  ... 
doi:10.1364/jon.3.000534 fatcat:pfxstegk6vbyhi7zbrnfu7hdtq

A multicast reinforcement learning algorithm for WDM optical networks

P. Garcia, A. Zsigri, A. Guitton
2003 Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003.  
In this paper we propose a reinforcement learning algorithm for the multicast routing and wavelength assigment (MRWA) problem.  ...  The proposed algorithm is a good solution to the (MRWA) problem, since it reduces the blocking probability of the multicast communication requests.  ...  In this paper, dynamic traffic demand is assumed, so the aim is to minimize the blocking probability in the network.  ... 
doi:10.1109/contel.2003.176942 fatcat:hymrrwdoxjhg5nydlwapuginqu

A New Centralized Multicast Wavelength Allocation Algorithm in Optical Fiber Network

Rafed Sabbar, Hamed Saffa
2012 International Journal of Soft Computing and Software Engineering [JSCSE]  
The research is found the blocking probability, capacity decreasing and the time delay for different networks and compared with different algorithms.  ...  The simulation result shows that the proposed algorithm increases the communication in a delay constrained application constrained Anite wavelength WDM mesh network (DWA) using various algorithms.  ...  search technique to route multicast sessions in a WDM result shows that the proposed algorithm increases the ained application by reducing rate of request blocking in a sparse DM mesh network.  ... 
doi:10.7321/jscse.v2.n11.2 fatcat:fau4lv5nlfb57llbllsu7orfke

Grooming of multicast sessions in WDM ring networks

Harsha V. Madhyastha, N.K.M. Naga Srinivas, Girish V. Chowdhary, C. Siva R. Murthy, Arun K. Somani, Zhensheng Zhang
2003 OptiComm 2003: Optical Networking and Communications  
In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks.  ...  We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles.  ...  Generation of Sessions While generating a multicast session for a n node ring network, each of the n nodes was given equal probability of being the source node for the session.  ... 
doi:10.1117/12.533147 fatcat:xicwqhhnsjdinozl32h7ndtf3u

Modeling and Performance Analysis of Small Group Multicast with Deflection Routing in Optical Burst Switched Networks

Xiaodong Huang, Qingya She, Tao Zhang, Kejie Lu, J.P. Jue
2008 IEEE Journal on Selected Areas in Communications  
We first propose a multicast scheme for small group multicast in OBS networks. To reduce burst loss due to potential burst contentions, a deflection routing scheme for multicast is proposed.  ...  In this paper, we focus on the problem of effectively supporting a large number of small group multicasts in optical burst switched (OBS) networks.  ...  For dynamic traffic, as in OBS networks, the algorithm for calculating a multicast tree must run in real time.  ... 
doi:10.1109/jsac-ocn.2008.030507 fatcat:vh73hvp42zbdrfywop547emnna
« Previous Showing results 1 — 15 out of 141 results