Instantaneous recovery route design scheme using multiple coding-aware protection scenarios
| Autor: | Phong Vu Pham, Bijoy Chand Chatterjee, Eiji Oki, Abu Hena Al Muktadir |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Imagination
Mathematical optimization Computer science Link protection media_common.quotation_subject Resource saving 020206 networking & telecommunications 02 engineering and technology Cost reduction Search engine 020210 optoelectronics & photonics Common path Linear network coding 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering media_common Coding (social sciences) |
| Zdroj: | Telecommunication Systems. 64:75-85 |
| ISSN: | 1572-9451 1018-4864 |
| DOI: | 10.1007/s11235-016-0159-1 |
| Popis: | This paper proposes an instantaneous recovery route design scheme using multiple coding-aware link protection scenarios to achieve higher link cost reduction in the network. In this scheme, two protection scenarios, namely, (i) traffic splitting (TS), and (ii) two sources and a common destination (2SD) are used to integrate multiple sources and a common destination. The proposed scheme consists of two phases. In the first phase, the proposed scheme determines routes for 2SD and TS scenarios of all possible source-destination pairs to minimize the total link cost. In this phase, the network coding is applied to the common path within each scenario, individually. In the second phase, network coding is applied to the common path between two scenarios (or a scenario pair) in order to enhance the resource saving. This phase develops conditions that select the most appropriate combination of scenario pairs, such as TS---TS, 2SD---2SD, and 2SD---TS for network coding, including their proofs. Using these conditions, a heuristic algorithm is introduced in order to select the most appropriate combination of scenario pairs for further enhancing of resource saving. Simulation results show that the proposed scheme outperforms the conventional 1 + 1 protection scheme, the TS scenario, and the 2SD scenario in terms of link cost reduction in the network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink