Hybrid fiber co-axial CATV network design with variable capacity optical network units

European Journal of Operational Research

Volumn 123, Issue 1, 2000, Pages 73-85

  Gupta, Rakesh ^a   Pirkul, Hasan ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CABLE TELEVISION SYSTEMS; COAXIAL CABLES; COMPUTATIONAL COMPLEXITY; FIBER OPTICS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; REGULATORY COMPLIANCE; TELECOMMUNICATION SERVICES;

COMPUTATIONAL TESTING; HYBRID FIBER COAXIAL NETWORKS; LAGRANGIAN RELAXATION; OPTICAL NETWORK UNIT; TELECOMMUNICATION REGULATION;

ELECTRIC NETWORK ANALYSIS;

EID: 0033884984     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00070-3     Document Type: Article

References (24)

1. V. Ahuja, Design and Analysis of Computer Communication Networks, McGraw-Hill, New York, 1982.
2. Altinkemer K., Gavish B. Heuristics with constant error guarantees for the design of tree networks. Management Science. 34(3):1988;331-341.
3. A. Balakrishnan, K. Altinkemer, Using a hop constrained model to generate alternative communications network design, ORSA Journal on Computing 4 (1992) 192-205.
4. F. Bock, An algorithm to construct a minimum directed spanning tree in a directed network, in developments in operations research, in: B. Avi-Itzhak (Ed.), Proceedings of Third Annual Conference Israel Conference on Operations Research, Gordon and Breach, London, 1969.
5. W.S. Ciciora, Cable Television in the United States - An Overview, Cable Television Laboratories, Inc., Colorado, 1995.
6. D.A. Clark, Technology Options and Capabilities: What does What, How, in the Unpredictable Certainty: Information Infrastructure Through 2000, National Academy Press, Washington, DC, 1996.
7. Dijkstra E.W. A note on two problems in connection with graphs. Numerical Mathematics. 1:1959;269-271.
8. Dutta A., Kawatra R. Topological design of a centralized communication network with unreliable links and node outage costs. European Journal of Operational Research. 77(2):1994;344-356.
9. Fisher M.L. An applications oriented guide to Lagrangian relaxation. Interfaces. 15:1985;1-18.
10. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
11. B. Gavish, K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: Proceedings of the IEEE Conference on Communications, 1986, pp. 130-139.
12. B. Gavish, Topological design of computer communication networks - the overall design problem, European Journal of Operational Research, 58 (2), COM-33, 12 (1992) 149-172.
13. P.F. Gagen, W.E. Pugh, Hybrid fiber-coax access networks, Bell Labs Technical Journal, 1996, pp. 28-35.
14. L. Gouveia, P. Martins, An extended flow based formulation for the capacitated minimal spanning tree, in: Third ORSA Telecommunications conference, Boca Raton, FL, 1995.
15. S.A. Grezlak, H. Miles, Jr., E.S. Szurkowski, W.P. Weber, Jr., Residential data services via hybrid fiber-coax local access networks, Bell Labs Technical Journal, 1996, pp. 88-99.
16. Hall L. Experience with a cutting plane algorithm for the capacitated spanning tree problem. INFORMS Journal on Computing. 8(3):1996;219-234.
17. B. Kumar, Broadband Communications - A Professionals Guide to ATM, Frame Relay, SMDS, SONET and B-ISDN, McGraw-Hill Series on Computer Communications, McGraw-Hill, New York, 1995.
18. Malik K., Yu G. A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks. 23:1993;525-532.
19. A. Mirzain, Lagrangean relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks, 1985, pp. 1-20.
20. N. Omoigui, M. Sirbu, C. Eldering, N. Himayat, Comparing integrated broadband architectures from an economic and public policy perspective, in: G. Brock (Ed.), Telecommunications and Internet Policy, Lawrence Erlbaum, Washington, DC, 1996.
21. Papadimitrou C.H. The complexity of the capacitated tree problem. Networks. 8:1978;217-230.
22. Pirkul H., Narasimhan S. Hierarchical concentrator location problem. Computer Communications. 15(3):1992;185-191.
23. Pirkul H., Nagarajan V. Locating concentrators in centralized computer networks. Annals of Operations Research. 36:1992;247-262.
24. H. Pirkul, R. Gupta, CATV hybrid fiber co-axial network design, under review.