2013
DOI: 10.1016/j.endm.2013.05.111
|View full text |Cite
|
Sign up to set email alerts
|

Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…Restriction (8) prevents any ONU must be connected with one single link to the ODN. Next, (9) restricts that in a candidate site it must be placed at most one AWG. In (10) it is restricted the problem to the fact that an AWG must be connected at least with one ingoing and one outgoing link and, as restricted in (11), with a maximum number of connections not exceeding its capacity k. Equation (12) takes into account the losses of any link must not exceed the value related with the ONU's receptors sensitivity.…”
Section: Minimum-cost Problemmentioning
confidence: 99%
“…Restriction (8) prevents any ONU must be connected with one single link to the ODN. Next, (9) restricts that in a candidate site it must be placed at most one AWG. In (10) it is restricted the problem to the fact that an AWG must be connected at least with one ingoing and one outgoing link and, as restricted in (11), with a maximum number of connections not exceeding its capacity k. Equation (12) takes into account the losses of any link must not exceed the value related with the ONU's receptors sensitivity.…”
Section: Minimum-cost Problemmentioning
confidence: 99%
“…When considering different paths between optical splitters and ONUs, these paths can potentially share the trenches with paths to other ONUs. A heuristic, based on a network flow formulation and presented by Van Loggerenberg, Grobler and Terblanche [5], constructs feasible solutions by limiting the number of paths to improve fibre duct sharing. A disintegration heuristic is proposed [6] in an attempt to reduce computing times by using the output of a centroid, a density-based, and a hybrid clustering algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…By (optimally) sharing utility ducts, only one duct is created for multiple utility networks, this way the cost linked to digging the duct and (if applicable) repairing the pavement can be shared, which results in clear cost reductions. This approach is easily applied to a greenfield situation, but harder to apply in a brownfield situation since any previously installed cables have to be taken into account [1]- [4]. 2.…”
Section: Introductionmentioning
confidence: 99%