Global access network evolution

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 136-149

  Chamberland, Steven ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Access network evolution problem; Branch and bound; Digital subscriber line (xDSL) technologies; Fiber to the micro node (FTTn); Fiber to the node (FTTN); Fiber to the premises (FTTP); Integer mathematical programming; XDSL from the central office (CO)

Indexed keywords

ACCESS NETWORK; ACCESS NETWORK EVOLUTION PROBLEM; BRANCH AND BOUNDS; BRANCH-AND-BOUND; CENTRAL OFFICES; DIGITAL SUBSCRIBER LINES (XDSL); FIBER-TO-THE-PREMISES; INTEGER MATHEMATICAL PROGRAMMING;

DIGITAL TELEVISION; DSL; HEURISTIC ALGORITHMS; HIGH DEFINITION TELEVISION; INTEGER PROGRAMMING; INTERNET PROTOCOLS; MODEMS; NUMERICAL ANALYSIS; TABU SEARCH; TELEPHONE LINES; TELEVISION BROADCASTING; TELEVISION NETWORKS; TRANSMITTERS;

FIBERS;

EID: 77249154015     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2021430     Document Type: Article

References (39)

1. "Delivering triple play services-Transforming the broadband access network," Alcatel-Lucent Inc., White Paper, 2005 [Online. Available: www.alcatel-lucent.com
2. K. Altinkemer and H. Pirkul, "Heuristics with constant error guarantees for the multi-center capacitated minimum spanning tree problem," J. Inf. Optim. Sci., vol.13, no.1, pp. 49-71, 1992.
3. A. Balakrishnan, T. L. Magnanti, A. Shulman, and R. T. Wong, "Models for planning capacity expansion in local access telecommunication networks," Ann. Oper. Res., vol.33, pp. 239-1234, 1991.
4. A. Balakrishnan, T. L. Magnanti, and R. T. Wong, "A decomposition algorithm for local access telecommunications network expansion planning," Oper. Res., vol.43, no.1, pp. 58-75, 1995.
5. D. Bienstock, "Computational experiences with an effective heuristic for some capacity expansion problems in local access networks," Telecommun. Syst., vol.1, no.1, pp. 379-400, 1993.
6. S. Chamberland and B. Sanso, "Topological expansion of multiple ring metropolitan area networks," Networks, vol.36, no.4, pp. 210-224, 2000.
7. B. Gavish, "Topological design of telecommunication networks-Local access design methods," Ann. Oper. Res., vol.33, pp. 17-71, 1991.
8. A. Girard, B. Sanso, and L. Dadjo, "A tabu search for access network design," Ann. Oper. Res., vol.106, pp. 229-262, 2001.
9. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer, 1997.
10. M. Goldstein and B. Rothfarb, "The one-terminal TELPAK problem," Oper. Res., vol.19, no.1, pp. 156-169, 1971.
11. L. Gouveia, "A 2nd constraint formulation for the capacitated minimal spanning tree problem," Oper. Res., vol.43, no.1, pp. 130-141, 1995.
12. A. Haidine, R. Zhao, P. Domschitz, R. Lehnert, and T. R. Banniza, "Planning and optimization of a hybrid fibre-VDSL access infrastructure," presented at the Int. Symp. Services an Local Access, 2004
13. Amendment: Media Access Control Parameters, Physical Layers, and Management Parameters for Subscriber Access Networks, IEEE Std. 802.3ah, IEEE, 2004.
14. "Using the CPLEX callable library and CPLEX mixed integer library," ILOG, Inc., 2005.
15. "Asymmetric digital subscriber line (ADSL) transceivers," ITU-T, Recommendation G.992.1, 1999.
16. "Gigabit-capable passive optical networks (GPON): General characteristics," ITU-T, Recommendation G.984.1, 2003.
17. "Very high speed digital subscriber line (VDSL) transceivers," ITU-T, Recommendation G.993.1, 2004.
18. "ATM-based multi-pair bonding," ITU-T, Recommendation G.998.1, 2005.
19. "Ethernet-based multi-pair bonding," ITU-T, Recommendation G.998.2, 2005.
20. "Implementation of the "Abuse of receiver" method for FEXT cancellation," ITU-T, Temporary Document SD-064, 2007.
21. A. Kershenbaum, "Computing capacitated minimal spanning trees efficiently," Networks, vol.4, no.4, pp. 299-310, 1974.
22. J. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol.7, no.1, pp. 48-50, 1956.
23. C. Lee, "An algorithm for the design of multi-type concentrator networks," J. Oper. Res. Soc., vol.44, no.5, pp. 471-482, 1993.
24. Y.-J. Lee and M. Atiquzzaman, "Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem," Comput. Commun., vol.28, no.11, pp. 1371-1379, 2005.
25. G. R. Mateus and R. V. L. Franqueira, "Model and heuristic for a generalized access network design problem," Telecommun. Syst., vol.15, no.3-4, pp. 257-271, 2000.
26. P. McGregor and D. Shen, "Network design: An algorithm for the access facility location problem," IEEE Trans. Commun., vol.25, no.1, pp. 61-73, Jan. 1977.
27. A. J. Mayhew, S. J. Page, A. M. Walker, and S. I. Fisher, "Fibre to the home-Infrastructure deployment issues," BT Technol. J., vol.20, no.2, pp. 91-103, 2002.
28. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
29. C. Mazzali, R. Whitman, and B. Deutsch, "Optimization of FTTN passive optical networks continues," Lightw. Mag., vol.22, no.1, 2005.
30. R. A. Patterson, E. Rolland, and H. Pirkul, "A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem," J. Heuristics, vol.5, no.2, pp. 159-180, 1999.
31. H. Pirkul and R. Gupta, "Topological design of centralized computer networks," Int. Trans. Operat. Res., vol.4, no.1, pp. 75-83, 1997.
32. H. Pirkul and V. Nagarajan, "Locating concentrators in centralized computer networks," Ann. Oper. Res., vol.36, pp. 247-261, 1992.
33. H. Pirkul and S. Narasimhan, "Hierarchical concentrator location problem," Comput. Commun., vol.15, no.3, pp. 185-191, 1992.
34. K. F. Poon, A. Conway, G. Wardrop, and J. Mellis, "Successful application of genetic algorithms to network design and planning," BT Tech. J., vol.18, no.4, pp. 32-41, 2000.
35. K. F. Poon, D. B. Mortimore, and J. Mellis, "Designing optimal FTTN and PON networks using new automatic methods," in Proc. Int. Conf. Access Technol., 2006, pp. 45-48.
36. R. Prim, "Shortest connection networks and some generalizations, " Bell Syst. Tech. J., vol.36, pp. 1389-1401, 1957.
37. G. M. Schneider and M. N. Zastrow, "An algorithm for the design of multilevel concentrator networks," Comput. Netw., vol.6, no.1, pp. 1-11, 1982.
38. A. Shulman and R. Vachani, "An algorithm for capacity expansion of local access networks," in Proc. IEEE INFOCOM, 1990, pp. 221-229.
39. R. Zhao, S. Götze, and R. Lehnert, "A visual planning tool for hybrid fibre-VDSL access networks with heuristic algorithms," in Proc. IEEE Int. Workshop on Design of Reliab. Commun. Netw., 2005, pp. 541-548.