2012
DOI: 10.1364/jocn.4.000571
|View full text |Cite
|
Sign up to set email alerts
|

Multicast Overlay for High-Bandwidth Applications Over Optical WDM Networks

Abstract: Multicast communication in wavelength division multiplexed (WDM) networks is traditionally supported by the assumption that the optical crossconnects are multicast capable, i.e., they are capable of switching an incoming signal to more than one output interface. A naïve method of supporting this functionality in a multicast-incapable (MI) environment is by creating a virtual topology consisting of lightpaths from the multicast source to each destination of the multicast session. For large sets of multicast req… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 21 publications
0
8
0
Order By: Relevance
“…The Multicast Destination Failure Protection ILP formulated below is based in part on the Drop at Member Node (DMN) multicast overlay ILP, presented in [14]. The DMN approach to establishing multicast circuits in optical networks efficiently establishes a logical overlay over the underlying physical network.…”
Section: Integer Linear Programming Solutionmentioning
confidence: 99%
“…The Multicast Destination Failure Protection ILP formulated below is based in part on the Drop at Member Node (DMN) multicast overlay ILP, presented in [14]. The DMN approach to establishing multicast circuits in optical networks efficiently establishes a logical overlay over the underlying physical network.…”
Section: Integer Linear Programming Solutionmentioning
confidence: 99%
“…Two core network topologies are tested, i.e., the 14-node NSFNET and the 28-node US Backbone [11]. To generate the multicast requests, we set the average size of the multicast groups (i.e., |D i |) as 4, determine the member nodes with the assumption that each node in the topology has equal probability to be included, and then select the source node randomly from the 6 calculate the shortest-path from V in to V out ; 7 store the path in sp; 8 insert sp into T i ; 9 store the end node of sp as d i,j ; member nodes. The size of a multicast group can vary from 1 (unicast) to |V | − 1 (broadcast).…”
Section: Performance Evaluationsmentioning
confidence: 99%
“…To this end, it would be interesting to investigate overlay multicast (OL-M) in EONs built with multicast-incapable (MI) switches. For OL-M, a logic light-tree is constructed for a multicast request and multiple unicast lightpaths are then set up to actually carry it [8]. Therefore, multicast is accomplished over the MI infrastructure, and cost-effective network planning and provisioning are feasible, especially when multicast traffic is not dominant.…”
mentioning
confidence: 99%
“…Recently, some multicast tree routing issues were investigated for networks with fixed multicasting source and destination nodes [6][7][8][9][10][11][12][13]. The authors in [6] studied the online routing of bandwidth-guaranteed multicasts in traditional IP networks which can be applied into provisioning bandwidth-guaranteed virtual private network (VPN) services under the "hose" service model.…”
Section: Introductionmentioning
confidence: 99%
“…The authors in [8] studied the joint optimization problem of multicast routing and sparse splitting in WDM networks wherein some switches are incapable of splitting light. The work in [9] focused on supporting multicast routing from electronic layers in Multicast Incapable (MI) WDM networks. The work in [11][12][13] given.…”
Section: Introductionmentioning
confidence: 99%