Network coding for optical-layer multicast

Manley, Eric D.; Deogun, Jitender S.; Xu, Lisong

doi:10.1109/broadnets.2008.4769125

Cited by 12 publications

(11 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our previous work on applying network coding to all-optical networks considered the coarse-grained version of Lun et al's [12] subgraph problem for all-optical multicast [30]. Kim et al considered the coarse-grained static network coding problem for optical networks [31].…”

Section: Network Coding In Optical Networkmentioning

confidence: 99%

All-Optical Network Coding

Manley

Deogun

et al. 2010

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate the application of network coding to all-optical networks from both the algorithmic and infrastructural perspectives. We study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic which provides robustness against link failures in the network. We present a heuristic for solving this problem and compare it with both inefficient optimal methods and non-network coding approaches. Our experiments show that our heuristic provides near optimal performance while significantly outperforming existing approaches for dedicated multicast protection. We also propose architectures for specialized alloptical circuits capable of performing the processing required for network coding and show how these devices can be effectively deployed in an all-optical multicast network.

show abstract

Section: Network Coding In Optical Networkmentioning

confidence: 99%

All-Optical Network Coding

Manley

Deogun

et al. 2010

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similarly for l link failure protection, l + 1 link disjoint paths are required. The problem of finding such a subgraph with minimum cost is NPhard for any given l [35] (for l = 0 it is the Steiner Minimal Tree problem). Therefore authors propose a heuristic algorithm to solve this problem for given l. The heuristic, Robust Coded Multicast (RCM), is in fact a generalization of shortest path heuristic (SPH) for Steiner tree problem.…”

Section: Iv2 Robust Network Coding In Optical Networkmentioning

confidence: 99%

“…In [35] an all-optical infrastructure for networking coding is presented. The authors assume that multicastcapable OXC with wavelength conversion for all wavelengths is available and propose detailed designs for adding network coding ability to the OXC.…”

Section: V1 All Optical Network Codingmentioning

confidence: 99%

“…The product then would be of degree 2(m − 1), i.e., the result has 2m − 1 bits. Authors in [35] show how multiplication unit can be designed using optical delay units (for shifting), AN D gates (for single bit multiplication), and XOR gates (for final addition). Authors further address the problem of normalizing the 2m − 1-bit result to an m-bit format.…”

Section: Component-level Designmentioning

confidence: 99%

“…In summary authors show how optical linear network coding can be implemented using optical delay units, AN D gates, XOR gates, and existing optical switching technologies. For a detailed description of proposed components please refer to [35].…”

Section: Component-level Designmentioning

confidence: 99%

See 2 more Smart Citations

Network coding-based protection

Kamal

Mohandespour

2014

Optical Switching and Networking

View full text Add to dashboard Cite

This paper serves as a tutorial lecture on the use of network coding to provide resource efficient, and agile proactive protection. Network coding, which was introduced in [1], allows intermediate network nodes to form linear combinations of packets received on different input links. The use of network coding results in capacity enhancement. This capacity enhancement is used to provide protection channels which are used to carry combinations of redundant data, and are solved by the receivers in order to recover data lost due to network failures.The paper starts by addressing network coding-based protection of bidirectional unicast connections, and explains the use p-Cycles to carry linear combinations of the redundant data units. The paper also discusses an earlier protection strategy which is based on diversity coding, in which the linear combinations are formed at special nodes, including sources, and is used to protect unidirectional connections. A generalized network coding-based protection which uses a tree to carry the linear combinations will be presented. Protection of multicast connections using network coding is also explained

show abstract

Protecting multicast services in optical internet backbones

Long

Kamal

2013

Computer Networks

View full text Add to dashboard Cite

Many applications in the future Internet will use the multicasting service mode. Since many of these applications will generate large amounts of traffic, and since users expect a high level of service availability, it is important to provision multicasting sessions in the future Internet while also providing protection for multicast sessions against network component failures. In this paper we address the multicast survivability problem of using minimum resources to provision a multicast session and its protection paths (trees) against any single-link failure. We propose a new, and a resource efficient, protection scheme, namely, Segment-based Protection Tree (SPT). In SPT scheme, a given multicast session is first provisioned as a primary multicast tree, and then each segment on the primary tree is protected by a multicast tree instead of a path, as in most existing approaches. We also analyze the recovery performance of SPT and design a Reconfiguration Calculation Algorithm to compute the average number of reconfigurations upon any link failure. By extending SPT to address dynamic traffic scenarios, we also propose two heuristic algorithms, Cost-based SPT (CB SPT) and Wavelength-based SPT (WB SPT). We study the performance of the SPT scheme in different traffic scenarios. The numerical results show that SPT outperforms the best existing approaches, optimal path-pair-based shared disjoint paths (OPP SDP). SPT uses less than 10% extra resources to provision a survivable multicast session over the optimal solution and up to 4% lower than existing approaches under various traffic scenarios and has an average number of reconfigurations 10-86% less than the best cost efficient approach. Moreover, in dynamic traffic cases, both CB SPT and WB SPT achieves overall blocking probability with 20% lower than OPP SDP in most network scenarios.

show abstract

Network coding for optical-layer multicast

Cited by 12 publications

References 26 publications

All-Optical Network Coding

All-Optical Network Coding

Network coding-based protection

Protecting multicast services in optical internet backbones

Contact Info

Product

Resources

About