A design algorithm for ring topology centralized-radio-access-network

2013 17th International Conference on Optical Networking Design and Modeling, ONDM 2013

Volumn , Issue , 2013, Pages 173-178

  Agata, Naoki ^a   Agata, Akira ^a   Nishimura, Kosuke ^a  

^a KDDI R AND D LABORATORIES INC   (Japan)

Author keywords

Network theory; Network topology; Operations research

Indexed keywords

CABLE CONSTRUCTION; CONSTRUCTION COSTS; IMPLEMENTATION COST; MOBILE ACCESS NETWORKS; MOBILE DATA TRAFFIC; NETWORK RESILIENCE; NETWORK TOPOLOGY; OPTICAL ACCESS NETWORKS;

ALGORITHMS; CIRCUIT THEORY; COSTS; DESIGN; ELECTRIC NETWORK TOPOLOGY; OPERATIONS RESEARCH; TOPOLOGY;

PASSIVE OPTICAL NETWORKS;

EID: 84879772412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. CMCC, "C-RAN The Road Towards Green RAN," White Paper, http://labs.chinamobile.com/cran/wp-content/uploads/CRAN-white-paper-v2-5-EN. pdf, 2011.
2. S. Nanba, T. Matsunaka, T. Warabino, S. Kaneko and Y. Kishi, "Colony- RAN Architecture for Future Cellular Network," Future Network & Mobile Summit, 2012.
3. "Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method and physical layer specifications Amendment: Media Access Control Parameters, Physical Layers and Management Parameters for Subscriber Access Networks," IEEE Std 802.3ahTM -2004, 2004.
4. E. Bonsma, N. Karunatillake, R. Shipman, M. Shackleton, and D. Mortimore, "Evolving Greenfield Passive Optical Networks," BT Technical Journal, Vol. 21, No. 4, pp. 44-49, 2003.
5. A. Agata and K. Nishimura, "Suboptimal PON Network Designing Algorithm for Minimizing Deployment Cost of Optical Fiber Cables," Optical Network Design and Modeling, 16th International Conference, 2012.
6. G. B. Dantzig and R. H. Ramser, "The Truck Dispatching Problem," Management Science, Vol. 6, pp. 80-91, 1959.
7. T. Asano, N. Katoh, H. Tamaki, T. Tokuyama, "Covering Points in the Plane by k -tours: Towards a Polynomial Time Approximation Scheme for General k, " Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 275-283, 1997.
8. H. Vinod, "Integer Programming and the Theory of Grouping," Journal of the American Statistical Association, vol. 64, No. 326, pp. 506-517 1969.
9. N. Christofides, "Worst-case Analysis of a New Heuristic for the Travelling Salesman Problem," Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
10. S. Arora, "Polynomial Time Approximation Schemes for Euclidian Traveling Salesman and Other Geometric Problems," Journal of the ACM, Vol. 45, No. 5, pp. 753-782, 1998. (Pubitemid 128497506)
11. S. Lin, B. W. Kernighan, "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Reseach, Vol. 21, No.2, pp. 498-516, 1973.
12. G. A. Croes, "A Method for Solving Traveling-Salesman Problems," Operations Research, Vol. 6, pp. 791-812, 1958.
13. M. Haimovich and A. H. G. Rinnooy Kan, "Bounds and Heuristics for Capacitated Routing Problems," Mathematics of Operations Research, Vol. 10, No. 4, pp. 527-542, 1985. (Pubitemid 15600819)
14. P. E. Hart, N. J. Nilsson and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Transactions on Systems Science and Cybermetics, Vol. 4, No. 2, pp. 100-107, 1968.
15. E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, Vol. 1, pp.269-271, 1959.
16. J. R. Shewchuk, "Tetrahedral Mesh Generation by Delaunay Refinement," In Proc. 14th Annual ACM Symposium on Computational Geometry, pp. 86-95, 1998.