PSO: preventive start-time optimization of OSPF link weights to counter network failure

Kamrul, Islam Mohammad; Oki, Eiji

doi:10.1109/lcomm.2010.06.100363

Cited by 22 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To face the situations of failure inside the networks, routing strategies can be mainly classified into two categories: IP fast reroute techniques [10][11][12][13][14], which are applied within a short period after the failure, and the other strategies [15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

“…Studies in [16,17] addressed avoiding transient loops during routing table updates when link weights are changed in link-state routing protocols. In Kamrul and Oki [18,19] addressed a preventive start-time optimisation (PSO) strategy, in which suitable link weights are configured in advance against network failure for link-state routing protocols. PSO computes an optimal link-weight set order to minimise the worst-case congestion considering all possible single link-failure scenarios in the network.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Smart failure insensitive routing: smart failure insensitive routing to enhance resource utilisation and robustness

2013

Self Cite

View full text Add to dashboard Cite

As the Internet takes an increasingly central role in the authors communications infrastructure, the slowness of routing convergence after network failure is becoming a significant problem in the current link-state-based routing protocol. There is an alternative approach, which is to compute backup routes that allow the failure to be repaired locally by the routers that detect the failure without informing other routers of the failure immediately. Failure insensitive routing (FIR) adopts this approach, in which packet forwarding is based on not only the destination but also the link it arrives from. However, FIR faces two problems. First, a packet may travel an unnecessary path, which degrades resource utilisation efficiency. Second, FIR may fail to set a reroute path even though an active path is available. This study proposes a resilient routing scheme that avoids these two problems by enhancing FIR. It is named smart FIR (S-FIR). Upon failure, S-FIR employs a backup routing table based on the unexpected link from which a packet arrives so that subsequent packets can be forwarded to a different next hop to avoid roll back, whereas the original FIR forwards every packet based on the current working routing table. Numerical results indicate that S-FIR reduces the path length significantly, compared with the original FIR. In addition, in case of any link failure, S-FIR is proven to guarantee that any packet reaches its destination as long as there is a valid path. S-FIR provides more robust routing than FIR.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Smart failure insensitive routing: smart failure insensitive routing to enhance resource utilisation and robustness

2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…Simulation results show that the QC-LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. It should be noted that the girth of the exponent matrix has an important effect on the error performance of QC-LDPC The PSO algorithm is known to be effective in multidimensional, nonlinear optimization problems and has already been used in many fields [28][29][30][31][32]. leads to the lowest error rate.…”

mentioning

confidence: 99%

“…Simulation results show that the QC-LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC-LDPC codes with low encoding complexity.The PSO algorithm is known to be effective in multidimensional, nonlinear optimization problems and has already been used in many fields [28][29][30][31][32]. The application of the PSO algorithm can be categorized into continuous (real-number) PSO and discrete (binary) PSO algorithms [28].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

2012

Int J Communication

View full text Add to dashboard Cite

Low encoding complexity is very important for quasi-cyclic low-density parity-check (QC-LDPC) codes used in wireless communication systems. In this paper, a new scheme is presented to construct QC-LDPC codes with low encoding complexity. This scheme is called two-stage particle swarm optimization (TS-PSO) algorithm, in which both the threshold and girth distribution of QC-LDPC codes are considered. The proposed scheme is composed of two stages. In the first stage, we construct a binary base matrix of QC-LDPC code with the best threshold. The matrix is constructed by combining a binary PSO algorithm and the protograph extrinsic information transfer (PEXIT) method. In the second stage, we search an exponent matrix of the QC-LDPC code with the best girth distribution. This exponent matrix is based on the base matrix obtained in the first stage. Consequently, the parity-check matrix of the QC-LDPC code with the best threshold and best girth distribution are constructed. Furthermore, bit error rate performances are compared for the QC-LDPC codes constructed by proposed scheme, the QC-LDPC code in 802.16e standard, and the QC-LDPC code in Tam's study. Simulation results show that the QC-LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC-LDPC codes with low encoding complexity. leads to the lowest error rate. Optimization of the degree distribution pairs of irregular LDPC codes has already been considered on additive white Gaussian noise (AWGN) channels [9, 13], Rayleigh channels [11], binary erasure channels [14,15], and so on. In addition to the threshold, girth is another important parameter used to construct the LDPC codes [7]. Girth refers to the shortest cycles in the parity-check matrix or Tanner graph of LDPC codes [7,8]. The typical construction method based on girth is the progressive edge-growth (PEG) algorithm, which aims to construct the quasi-cyclic LDPC (QC-LDPC) codes by maximizing the girth of the Tanner graph of LDPC codes [16][17][18].From a practical point of view, the algebraic construction method is a good choice. The QC-LDPC code is a very important subclass of algebraic construction LDPC codes for its structured paritycheck matrix. The parity-check matrix of QC-LDPC codes is formed by the circulant permutation matrix or zero matrix, which may be easily implemented by the shift register. Consequently, QC-LDPC codes have been employed in several advanced communication standards such as 802.16e and 802.11n because of their hardware-friendly structures [1-3].The extrinsic information transfer (EXIT) chart method is another widely used method in the design of irregular LDPC codes because of its simplicity and accuracy [19,20]. However, the conventional EXIT chart method cannot be applied in the multi-edge type and protograph-based LDPC codes. To evaluate the performance of protograph LDPC codes [21], ...

show abstract

IP Traffic Engineering

Oki

Rojas‐Cessa

Tatipamula

et al. 2012

Advanced Internet Protocols, Services, and Applications

View full text Add to dashboard Cite

PSO: preventive start-time optimization of OSPF link weights to counter network failure

Cited by 22 publications

References 9 publications

Smart failure insensitive routing: smart failure insensitive routing to enhance resource utilisation and robustness

Smart failure insensitive routing: smart failure insensitive routing to enhance resource utilisation and robustness

Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

IP Traffic Engineering

Contact Info

Product

Resources

About