Abstract

We present a class of problems that arise in the design of the Next Generation Access Networks. The main features of these networks are: to be based on fiber links of relatively long length with respect to traditional copper based networks, users may be reached directly by fibers, and the presence of few central offices managing a large number of users. We present an Integer Programming model that captures the technological constraints and the deployment costs. The model serves as a basis for a decision support tool in the design of the Next Generation Access Networks. Pure Integer Programming cannot handle real-life problem instances, giving rise to new challenges and opportunities for hybrid Constraint Programming-Mathematical Programming methods. In this paper, we compare a LP-based randomized rounding algorithm with a Constraint-based Local Search formulation. The use of an LP relaxation is twofold: it gives lower bounds to the optimal solution, and it is easily embedded into a randomized rounding algorithm. The Constraint-based Local Search algorithm is then exploited to explore the set of feasible solutions. With these algorithms we are able to solve real-life instances for one of the problems presented in this paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Simonis, H.: Constraint applications in networks. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)Google Scholar
  2. 2.
    Kramer, G., Pesavento, G.: Ethernet Passive Optical Network (EPON): building a next-generation optical access network. IEEE Communications Magazine 40(2), 66–73 (2002)CrossRefGoogle Scholar
  3. 3.
    Li, J., Shen, G.: Cost Minimization Planning for Greenfield Passive Optical Networks. Journal of Optical Communications and Networking 1(1), 17–29 (2009)CrossRefGoogle Scholar
  4. 4.
    Aardal, K., Labbe, M., Leung, J., Queyranne, M.: On the two-level uncapacitated facility location problem. INFORMS Journal on Computing 8, 289–301 (1996)MATHCrossRefGoogle Scholar
  5. 5.
    Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming 108(1), 159–176 (2006)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Simonis, H.: A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 104–118. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Smith, B.: Symmetry and Search in a Network Design Problem. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 336–350. Springer, Heidelberg (2005)Google Scholar
  8. 8.
    Lever, J.: A local search/constraint propagation hybrid for a network routing problem. International Journal of Artificial Intelligence Tools 14(1-2), 43–60 (2005)Google Scholar
  9. 9.
    Van Hentenryck, P., Michel, L.: Control abstractions for local search. Constraints 10(2), 137–157 (2005)MATHCrossRefGoogle Scholar
  10. 10.
    Barahona, F., Chudak, F.: Near-optimal solutions to large-scale facility location problems. Discrete Optimization 2(1), 35–50 (2005)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
  12. 12.
    Van Hentenryck, P., Michel, L.: Constraint-based local search. MIT Press, Cambridge (2005)Google Scholar
  13. 13.
    Van Hentenryck, P., Michel, L.: Differentiable invariants. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 604–619. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Stefano Gualandi
    • 1
  • Federico Malucelli
    • 1
  • Domenico L. Sozzi
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di Milano 

Personalised recommendations