Network coding aware instantaneous recovery scheme based on optimal traffic splitting

Jose, Agostinho Antonio; Muktadir, Abu Hena Al; Oki, Eiji

doi:10.1587/comex.1.28

Cited by 13 publications

(17 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2, known as synthetic network [2], COST 239 network [1], Indian network [6], and Japan photonic network (JPN 25) [8], respectively. The traffic demands for all possible source-destination pairs are set equal.…”

Section: Resultsmentioning

confidence: 99%

“…Let 2 ðs i ; s j Þ, which is called an effective gain for 2SD, be the product of the coding gain and bandwidth demand for ðs i ; s j Þ. 2 UNTIL Â 2 is empty. At the end we select a set of b k 2 c pairs with the highest effective gain in each of the case, where bxc demotes the largest integer not greater than x.…”

Section: Coding Gainmentioning

confidence: 99%

“…Coding aware 1+1 protection techniques presented in [1,2] reduces the backup resource requirement for conventional 1+1 protection. In the 2SD (two sources and a common destination) scenario, coding can be performed at some intermediate node [1] (known as network coding [3]).…”

Section: Introductionmentioning

confidence: 99%

“…In the 2SD (two sources and a common destination) scenario, coding can be performed at some intermediate node [1] (known as network coding [3]). In the TS (traffic splitting) scenario [2,4], coding is performed at the source node with split data.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A hybrid instantaneous recovery route design scheme with two different coding aware scenarios

2015

Self Cite

View full text Add to dashboard Cite

This letter proposes a hybrid scheme for instantaneous recovery 1+1 protection route design for all possible source-destination pairs in a network. In the proposed scheme two different coding aware scenarios, namely the TS (traffic splitting) scenario and the 2SD (two sources and a common destination) scenario, are used intelligently according to the largest effective gain first policy. We compare the total costs of all the working and protection paths obtained by the proposed scheme, the TS scenario, and the 2SD scenario. Numerical results observe that the proposed scheme achieves more resource saving than the TS or 2SD scenario in our examined networks. Keywords: 1+1 protection, instantaneous recovery, traffic splitting, hybrid scheme, coding Classification: Internet References

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Coding Gainmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A hybrid instantaneous recovery route design scheme with two different coding aware scenarios

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…Agostinho et al presented an NC aware instantaneous recovery scheme with traffic splitting in [6]. However, this scheme demands large node degrees for both source and destination nodes.…”

Section: Introductionmentioning

confidence: 99%

A mathematical model for routing in 1+1 protection with network coding for instantaneous recovery

Muktadir

Oki

2012

IEICE ComEX

Self Cite

View full text Add to dashboard Cite

Abstract:The 1+1 protection provides instantaneous receiverinitiated recovery from any single link failure by using at least double network resources. This letter presents an Integer Quadratic Programming (IQP) model to determine an optimum set of routes that minimizes the required network resources for 1+1 protection using the network coding (NC) technique while maintaining the capability of instantaneous recovery. The cost obtained from our developed IQP model is compared with that of the conventional minimal-cost routing policy, where both approaches include the NC effect. Numerical results show that the IQP model achieves almost double resource saving effect in our examined networks.

show abstract

Differential delay aware instantaneous recovery scheme with traffic splitting

Muktadir

Oki

2015

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary This paper proposes a differential delay aware instantaneous recovery scheme with traffic splitting, in order to tackle multiple link failures, for networks with the coding capability. In the proposed scheme, traffic at the source is split into K equal parts and sent through K working paths. P protection paths carry encoded traffic created from the K split parts at the source. In order to recover from any t failure(s), where 1≤t≤P, the destination node has to buffer the remaining (K + P − t) parts, until the part experiencing the longest delay reaches the destination. The amount of memory buffers depends on the maximum allowable differential delay Δ, the highest difference of delays of any two among the (K + P) disjoint paths, supported at the destination. A large value of Δ increases the amount of required memory buffers, which negatively affects the achievable resource saving because of splitting. We thoroughly investigate how routing with splitting is influenced with respect to Δ, encoding/decoding costs, optical interface rates, buffering costs, the number of protection paths, the number of nodes in the network, and the minimum number of adjacent nodes. The path setup, encoding, synchronization, and merging (decoding) operations are discussed in order to support the proposed scheme. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Network coding aware instantaneous recovery scheme based on optimal traffic splitting

Cited by 13 publications

References 3 publications

A hybrid instantaneous recovery route design scheme with two different coding aware scenarios

A hybrid instantaneous recovery route design scheme with two different coding aware scenarios

A mathematical model for routing in 1+1 protection with network coding for instantaneous recovery

Differential delay aware instantaneous recovery scheme with traffic splitting

Contact Info

Product

Resources

About