Network Synthesis Problems

Wynants, Christelle

doi:10.1007/978-1-4757-3349-5

Cited by 11 publications

(4 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the typical SCA approach, working routing is performed in advance, often via shortest path routing (but not necessarily so), and restoration routing is performed afterwards through some optimal or near optimal method. The objective is typically to minimize spare capacity requirements such that the network is 100% restorable to single-failure events [11,12]. In JCA approaches, working routing is performed hand-in-hand with restoration routing; working and spare capacity is jointly minimized such that the network is 100% restorable to single-failure events [13,14].…”

Section: Straddling Spans P-cyclementioning

confidence: 99%

See 1 more Smart Citation

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

Noor‐E‐Alam

Kasem

Doucette

2012

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

p-cycle networks have attracted a considerable interest in the network survivability literature in recent years. However, most of the existing work assumes a known network topology upon which to apply p-cycle restoration. In the present work, we develop an incremental topology optimization ILP for p-cycle network design, where a known topology can be amended with new fibre links selected from a set of eligible spans. The ILP proves to be relatively easy to solve for small test case instances but becomes computationally intensive on larger networks. We then follow with a relaxation-based decomposition approach to overcome this challenge. The decomposition approach significantly reduces computational complexity of the problem, allowing the ILP to be solved in reasonable time with no statistically significant impact on solution optimality.

show abstract

Section: Straddling Spans P-cyclementioning

confidence: 99%

“…Constraints in (11) place sufficient spare capacity to accommodate all deployed p-cycles. Finally, the constraints in (12) force all span selection variables to equal one if the associated span is assigned any working and/or spare capacity.…”

Section: Ilp Modelmentioning

confidence: 99%

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

Noor‐E‐Alam

Kasem

Doucette

2012

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…For instance, the propensity to have express flows over chains may be lower if demands tend to be very localized than if demands are as likely to cross the continent as go to an adjacent node. We therefore defined and used the following models, following fairly common practice for generating instances of demand patterns for use in research studies [11], [33], [34]. Summary properties of the four demand data sets, as used here, are given in Table I.…”

Section: B Demand Patternsmentioning

confidence: 99%

Design of a meta-mesh of chain subnetworks: enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs

Grover¹,

Doucette

2002

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

We have developed a design refinement to increase the capacity efficiency of span-restorable mesh networks on sparse facility graphs. The new approach views the network as a "meta-mesh of chain subnetworks." This makes the prospect of WDM mesh networking more economically viable than with previous mesh-based designs where the average nodal degree is low. The meta-mesh graph is a homeomorphism of the complete network in which edges are either direct spans or chains of degree-2 nodes. The main advantage is that loop-back-type spare capacity is provided only for the working demands that originate or terminate in a chain and not for the entire flow that crosses a chain. The transiting ("express") flows are entirely mesh-protected within the meta-mesh graph which is of higher average degree and hence efficiency for mesh restoration than the network as a whole. Nodal equipment savings also arise from the grooming of express lightpaths onto the logical chain-bypass span. Only the meta-mesh nodes need optical cross-connect functionality. Other sites use OADMs and/or glassthroughs. The resultant designs comprise a special class of restorable network that is intermediate between pure span restoration and path restoration. Most of the efficiency of path restoration is achieved, but with a span restoration mechanism which is more localized and potentially faster and simpler than path restoration. The concept lends itself to implementation with OADMs having a passive waveband pass-through feature to support the logical chain bypass spans for express lightpaths.

show abstract

“…This paper, then, investigates a water supply network recovery problem, by applying network design problems (NDPs). NDPs, also referred to as network synthesis problems (Wynants [8]), are based on minimum spanning tree and minimum flow cost problems. Here, we adapt the NDP model to a capacitated fixed-charge network design problem (Ghamlouche et al [4]), by adding constraints to the multi-commodity minimum cost flow network problem.…”

Section: Introductionmentioning

confidence: 99%

A Water Line Network Failure Application of Network Design Problems

Mohri¹,

Takeshita²

2015

JMSS

View full text Add to dashboard Cite

This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide demands. The optimal recovery solution was achieved through the application of so-called network design problems (NDPs), which are a form of combinatorial optimization problem. However, a conventional NDP is not suitable for addressing urgent situations because (1) it does not utilize the non-failure arcs in the network, and (2) it is solely concerned with stable costs such as flow costs. Therefore, to adapt the technique to such urgent situations, the conventional NDP is here modified to deal with the specified water supply problem. In addition, a numerical illustration using the Sendai water network is presented.

show abstract

Network Synthesis Problems

Cited by 11 publications

References 34 publications

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization inp-Cycle Networks

Design of a meta-mesh of chain subnetworks: enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs

A Water Line Network Failure Application of Network Design Problems

Contact Info

Product

Resources

About