메뉴 건너뛰기




Volumn 3, Issue , 2003, Pages 1439-1447

A tabu search heuristic for the dimensioning of 3G multi-service networks

Author keywords

[No Author keywords available]

Indexed keywords

MULTISERVICE NETWORK; TABU SEARCH HEURISTIC;

EID: 36348966418     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2003.1200598     Document Type: Conference Paper
Times cited : (3)

References (18)
  • 1
    • 0002319143 scopus 로고    scopus 로고
    • Reactive search: Toward self-tuning heuristics
    • V. J. Rayward-Smith, editor, chapter 4, pages 61-83. John Wiley and Sons Ltd
    • R. Battiti, Reactive search: Toward self-tuning heuristics. In V. J. Rayward-Smith, editor, Modern Heuristic Search Methods, chapter 4, pages 61-83. John Wiley and Sons Ltd, 1996.
    • (1996) Modern Heuristic Search Methods
    • Battiti, R.1
  • 2
    • 0035184213 scopus 로고    scopus 로고
    • On WCDMA downlink multiservice coverage and capacity
    • C. Cordier and S. Ortega, "On WCDMA Downlink Multiservice Coverage and Capacity," IEEE Vehicular Technology Conference, Vol. 4, pp. 2754-2758, 2001.
    • (2001) IEEE Vehicular Technology Conference , vol.4 , pp. 2754-2758
    • Cordier, C.1    Ortega, S.2
  • 3
    • 0026895480 scopus 로고
    • A multi-period capacity planning model for backbone computer communication networks
    • A. Dutta and J.-I. Lim, "A Multi-Period Capacity Planning Model for Backbone Computer Communication Networks," Operations Research, Vol. 40, pp. 689-705, 1992.
    • (1992) Operations Research , vol.40 , pp. 689-705
    • Dutta, A.1    Lim, J.-I.2
  • 4
    • 0026990224 scopus 로고
    • An analysis of near optimal call admission and routing model for multi-service loss networks
    • Z. Dziong and L. Mason, "An Analysis of Near Optimal Call Admission and Routing Model for Multi-service Loss Networks," Proceedings of IEEE INFOCOM'92, pp. 141-152, 1992.
    • (1992) Proceedings of IEEE INFOCOM'92 , pp. 141-152
    • Dziong, Z.1    Mason, L.2
  • 5
    • 84907707545 scopus 로고    scopus 로고
    • Ecole Polytechnique de Montréal, Ericsson Research Contract Report, Revised version 2003 (the initial version was written in 2001 and coauthored by B. Jaumard, C. Klam and R. Malhamé)
    • S. Esposito, B. Jaumard, R, Malhamé, Call Admission Control Policies and Dimensioning of Multimedia 3G Networks-Simulation Plan. Ecole Polytechnique de Montréal, Ericsson Research Contract Report, Revised version 2003 (the initial version was written in 2001 and coauthored by B. Jaumard, C. Klam and R. Malhamé).
    • Call Admission Control Policies and Dimensioning of Multimedia 3G Networks-Simulation Plan
    • Esposito, S.1    Jaumard, B.2    Malhamé, R.3
  • 7
    • 0024646782 scopus 로고
    • A system for routing and capacity assignment in computer communication networks
    • B. Gavish and I. Neumann, "A System for Routing and Capacity Assignment in Computer Communication Networks," IEEE Trans. on Communications, Vol. 37, pp. 360-366, 1989.
    • (1989) IEEE Trans. on Communications , vol.37 , pp. 360-366
    • Gavish, B.1    Neumann, I.2
  • 8
    • 0027649380 scopus 로고
    • Dimensioning of adaptively routed network
    • Aug.
    • A. Girard and B. Liau, "Dimensioning of Adaptively Routed Network," IEEE/ACM Transactions on Networking, Vol. 1, No. 4, pp. 460-468, Aug. 1993.
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , Issue.4 , pp. 460-468
    • Girard, A.1    Liau, B.2
  • 9
    • 0000411214 scopus 로고
    • Tabu search-Part i
    • F. Glover "Tabu search-Part I", ORSA Journal on Computing 1(3), 190-206, 1989.
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 10
    • 0025260212 scopus 로고
    • Algorithms for the maximum satisfiability problem
    • P. Hansen, and B. Jaumard, "Algorithms for the Maximum Satisfiability Problem," Computing 44 (1990) 279-303.
    • (1990) Computing , vol.44 , pp. 279-303
    • Hansen, P.1    Jaumard, B.2
  • 13
    • 0031333633 scopus 로고    scopus 로고
    • Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing
    • Dec.
    • D. Medhi and S. Guptan, "Network Dimensioning and Performance of Multiservice, Multirate Loss Networks with Dynamic Routing," IEEE/ACM Transactions on Networking, Vol. 5., No. 6, pp. 944-957, Dec. 1997.
    • (1997) IEEE/ACM Transactions on Networking , vol.5 , Issue.6 , pp. 944-957
    • Medhi, D.1    Guptan, S.2
  • 14
    • 84907709386 scopus 로고    scopus 로고
    • Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing
    • D. Medhi and D. Tipper, "Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing," to appear in Telecomunication Systems.
    • Telecomunication Systems
    • Medhi, D.1    Tipper, D.2
  • 15
    • 0028407068 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
    • April
    • A.K. Parekh and R.G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case," IEEE/ACM Transactions on Networking, Vol. 2, No 2, pp. 137-150, April 1994.
    • (1994) IEEE/ACM Transactions on Networking , vol.2 , Issue.2 , pp. 137-150
    • Parekh, A.K.1    Gallager, R.G.2


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