메뉴 건너뛰기




Volumn 53, Issue 4, 2009, Pages 382-391

Cost-effective designs of fault-tolerant access networks in communication systems

Author keywords

Approximation algorithm; Communication network design; Primal dual schema

Indexed keywords

ACCESS NETWORK; COMMUNICATION NETWORK DESIGN; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; COST EFFECTIVE DESIGN; EFFECTIVE COMMUNICATION; ERROR TOLERANCE; FAULT-TOLERANT; GENERAL NETWORKS; HARD PROBLEMS; INAPPROXIMABILITY; LINK COST; MANAGEMENT COSTS; MINIMUM COST; NETWORK DESIGN; NETWORK LINKS; PRIMAL-DUAL SCHEMA; RING ARCHITECTURE; RING CONSTRUCTION; SERVICE PROVIDER;

EID: 67651085519     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20306     Document Type: Article
Times cited : (8)

References (26)
  • 1
    • 67651140766 scopus 로고    scopus 로고
    • SP: GSM base station controller
    • Alvarion, UltraWAVE SP: GSM base station controller, http://www.alvarion. com/upload/contents/291/UltraWAVE-SP-Datasheet.pdf.
    • UltraWAVE
  • 2
    • 34249928131 scopus 로고
    • Models for planning capacity expansion in local access telecommunication networks
    • Balakrishnan, T. L. Magnanti, A. Shulman, and R. T. Wong, Models for planning capacity expansion in local access telecommunication networks, Ann Operat Res 33(1991), 239-284.
    • (1991) Ann Operat Res , vol.33 , pp. 239-284
    • Balakrishnan, T.1    Magnanti, L.2    Shulman, A.3    Wong, R.T.4
  • 3
    • 4544231372 scopus 로고    scopus 로고
    • Designing radio-mobile access networks based on synchronous digital hierarchy rings
    • Billionnet, S. Elloumi, and L. Gruoz Djerbi, Designing radio-mobile access networks based on synchronous digital hierarchy rings, Comput Operat Res 32(2005), 379-394.
    • (2005) Comput Operat Res , vol.32 , pp. 379-394
    • Billionnet1    Elloumi, S.2    Gruoz Djerbi, L.3
  • 6
    • 0034262778 scopus 로고    scopus 로고
    • Topological design of two-level telecommunication networks with modular switches
    • Chamberland, O. Marcotte, and B. Sanso, Topological design of two-level telecommunication networks with modular switches, Operat Res 48(2000), 745-760.
    • (2000) Operat Res , vol.48 , pp. 745-760
    • Chamberland1    Marcotte, O.2    Sanso, B.3
  • 7
    • 0032108328 scopus 로고    scopus 로고
    • Feige, A threshold for approximating set cover, J ACM 45(1998), 634-652.
    • Feige, A threshold for approximating set cover, J ACM 45(1998), 634-652.
  • 8
    • 67651104238 scopus 로고    scopus 로고
    • FutureWei Technologies Inc, AirBridge SP/PCF
    • FutureWei Technologies Inc., AirBridge SP/PCF: Huawei CDMA2000 SP6600., http://www.futurewei.com/itemsdetail.asp?dt=products&ID=101.
    • Huawei CDMA2000 SP6600
  • 9
    • 0002033653 scopus 로고
    • Topological design of telecommunication networks-local access design methods
    • Gavish, Topological design of telecommunication networks-local access design methods, Ann Operat Res 33(1991), 17-71.
    • (1991) Ann Operat Res , vol.33 , pp. 17-71
    • Gavish1
  • 10
    • 0006693277 scopus 로고    scopus 로고
    • Design of SONET ring networks for local access
    • Gawande, J. G. Klincewicz, and H. Luss, Design of SONET ring networks for local access, Adv Perform Anal 2(1999), 159-173.
    • (1999) Adv Perform Anal , vol.2 , pp. 159-173
    • Gawande, J.1    Klincewicz, G.2    Luss, H.3
  • 11
    • 0029289832 scopus 로고    scopus 로고
    • Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24(1995), 296-317.
    • Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24(1995), 296-317.
  • 12
    • 0031999379 scopus 로고    scopus 로고
    • Hatton and F. Cheston, WDM deployment in the local exchange network, IEEE Commun Mag 36(1998), 56-61.
    • Hatton and F. Cheston, WDM deployment in the local exchange network, IEEE Commun Mag 36(1998), 56-61.
  • 13
    • 0003882821 scopus 로고
    • Telecommunications network design algorithms
    • McGraw-Hill, New York
    • Kershenbaum, Telecommunications network design algorithms, Series in Computer Science, McGraw-Hill, New York, 1993.
    • (1993) Series in Computer Science
    • Kershenbaum1
  • 14
    • 2442621462 scopus 로고    scopus 로고
    • A branchand-cut algorithm for the plant-cycle location problem
    • Labbé, I. Rodríguez-Martin, and J. J. Salazar, A branchand-cut algorithm for the plant-cycle location problem, J Operat Res Soc 55(2004), 513-520.
    • (2004) J Operat Res Soc , vol.55 , pp. 513-520
    • Labbé1    Rodríguez-Martin, I.2    Salazar, J.J.3
  • 16
    • 33847165220 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location problems
    • Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM J Comput 36(2006), 411-432.
    • (2006) SIAM J Comput , vol.36 , pp. 411-432
    • Mahdian1    Ye, Y.2    Zhang, J.3
  • 17
    • 33750442870 scopus 로고    scopus 로고
    • Nagy and S. Salhi, Location-routing: Issues, models and methods, Eur J Operat Res 177(2007), 649-672.
    • Nagy and S. Salhi, Location-routing: Issues, models and methods, Eur J Operat Res 177(2007), 649-672.
  • 21
    • 67651104236 scopus 로고    scopus 로고
    • Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Mathematics Operat Res 18(1993), 1-11.
    • Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Mathematics Operat Res 18(1993), 1-11.
  • 22
    • 0030714232 scopus 로고    scopus 로고
    • Raz and M. Safra, A sub-constant error-probability lowdegree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the 29th annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 475-484.
    • Raz and M. Safra, A sub-constant error-probability lowdegree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the 29th annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 475-484.
  • 23
    • 84937441113 scopus 로고    scopus 로고
    • Approximation algorithms for facility location problems
    • Shmoys, Approximation algorithms for facility location problems, Lect Notes Comput Sci 1913(2000), 27-33.
    • (2000) Lect Notes Comput Sci 1913 , pp. 27-33
    • Shmoys1
  • 24
    • 67651104308 scopus 로고    scopus 로고
    • Turkishsellers, Nortel Netas: hot product BSC 3000, http://www. turkishsellers.com/showproduct.aspx?type=prod&id= 780159&compid=21185.
    • Nortel Netas: Hot product BSC , pp. 3000
  • 25
    • 0032634424 scopus 로고    scopus 로고
    • Optimizing a ring based private line telecommunication network using tabu search
    • Xu, S. Y. Chiu, and F. Glover, Optimizing a ring based private line telecommunication network using tabu search, Manage Sci 45(1999), 330-345.
    • (1999) Manage Sci , vol.45 , pp. 330-345
    • Xu, S.1    Chiu, Y.2    Glover, F.3
  • 26
    • 31144452012 scopus 로고    scopus 로고
    • A multiexchange local search algorithm for the capacitated facility location problem
    • Zhang, B. Chen, and Y. Ye, A multiexchange local search algorithm for the capacitated facility location problem, Mathematics Operat Res 30(2005), 389-403.
    • (2005) Mathematics Operat Res , vol.30 , pp. 389-403
    • Zhang1    Chen, B.2    Ye, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.