ILP Formulation for p-Cycle Construction Based on Flow Conservation

Wu, Bin; Yeung, Kwan L.; Xu, Shizhong

doi:10.1109/glocom.2007.440

Cited by 13 publications

(20 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead of using (2), the objective in the heuristic ILP is (14) Note that in (14) is different from the cost ratio in (2). As a consequence of using the sum of all the decimal alarm codes (i.e., in (14)) for the (heuristic) monitor cost, has lost the accurate physical meaning in the monitor/bandwith cost tradeoff.…”

Section: B Heuristic Ilpmentioning

confidence: 99%

“…Since no flow-based analysis is required, constraints (3)- (8) in the optimal ILP are removed. To summarize, the heuristic ILP consists of objective (14) and constraints (9)- (13) only. Though the optimal (minimum) monitoring cost is not ensured, the heuristic ILP can still achieve the optimal localization degree according to constraints (10)- (13).…”

Section: B Heuristic Ilpmentioning

confidence: 99%

“…As one of the contributions of this paper, we introduce the concept of nonsimple m-cycle. A nonsimple cycle [12]- [14] can traverse a node multiple times but a link at most once. Fig.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Monitoring Cycle Design for Fast Link Failure Localization in All-Optical Networks

Yeung

2009

J. Lightwave Technol.

Self Cite

View full text Add to dashboard Cite

Abstract-A monitoring cycle (m-cycle) is a preconfigured optical loop-back connection of supervisory wavelengths with a dedicated monitor. In an all-optical network (AON), if a link fails, the supervisory optical signals in a set of m-cycles covering this link will be disrupted. The link failure can be localized using the alarm code generated by the corresponding monitors. In this paper, we first formulate an optimal integer linear program (ILP) for m-cycle design. The objective is to minimize the monitoring cost which consists of the monitor cost and the bandwidth cost (i.e., supervisory wavelength-links). To reduce the ILP running time, a heuristic ILP is also formulated. To the best of our survey, this is the first effort in m-cycle design using ILP, and it leads to two contributions: 1) nonsimple m-cycles are considered; and 2) an efficient tradeoff is allowed between the monitor cost and the bandwidth cost. Numerical results show that our ILP-based approach outperforms the existing m-cycle design algorithms with a significant performance gain.

show abstract

Section: B Heuristic Ilpmentioning

confidence: 99%

Section: B Heuristic Ilpmentioning

confidence: 99%

See 1 more Smart Citation

Monitoring Cycle Design for Fast Link Failure Localization in All-Optical Networks

Yeung

2009

J. Lightwave Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, two alternative approaches one can propose next: (a) use pre-generated set of cycle candidates, of limited reasonable cardinality, generated in advance, in off-line mode, (b) generate online cycle candidates on demand, whereas the number of generated cycles is a priori unknown. The former approach is called pre-generation technique, whereas the latter -enumeration technique, [5,6]. In both cases a "good" p-cycles are expected from the generation algorithm.…”

Section: Generation Of P-cyclesmentioning

confidence: 99%

“…In both cases a "good" p-cycles are expected from the generation algorithm. The problem of generation cycle components is nontrivial and has been studied among others in [5,6,7,8,9,10].…”

Section: Generation Of P-cyclesmentioning

confidence: 99%

An Algorithm for Unrestored Flow Optimization in Survivable Networks Based on p-Cycles

Smutnicki

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper provides compound algorithm for Unrestorable Flow Optimisation (UFO) problem formulated for computer networks protected by p-cycles, created on the base of mathematical model and solution approaches proposed in our complementary paper [1]. Components of the algorithm have been selected carefully and then experimentally tested in order to compose the best final algorithm. Results of the wide computer tests on common benchmarks have been also presented as well as some practical conclusions following from the research made.

show abstract