메뉴 건너뛰기




Volumn 3, Issue , 2007, Pages 1809-1814

A distributed ant colony algorithm based on cross-entropy for multi-constraints QoS routing

Author keywords

Cross entropy; Distributed algorithm; Multi constraints; QoS routing

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; PACKET LOSS; PARALLEL ALGORITHMS; QUALITY OF SERVICE;

EID: 34347209910     PISSN: 17389445     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICACT.2007.358722     Document Type: Conference Paper
Times cited : (2)

References (6)
  • 1
    • 0000228665 scopus 로고    scopus 로고
    • The Cross-Entropy Method for Combinatorial and Continuous Optimization
    • R. Y. Rubinstein, "The Cross-Entropy Method for Combinatorial and Continuous Optimization", Methodology and Computing in Applied Probability, 1999, pp. 127-190.
    • (1999) Methodology and Computing in Applied Probability , pp. 127-190
    • Rubinstein, R.Y.1
  • 2
    • 34347226110 scopus 로고
    • M.Dorigo, The Ant System: An Autocatalytic Optimizing Process
    • Technical Report No. 91-016 Revised, Politecnico di Milano, Italy
    • Maniezzo, V. & A. Colorni, M.Dorigo, The Ant System: An Autocatalytic Optimizing Process, Technical Report No. 91-016 Revised, Politecnico di Milano, Italy, 1991.
    • (1991)
    • Maniezzo, V.1    Colorni, A.2
  • 5
    • 34347216545 scopus 로고    scopus 로고
    • NS-2, http://www.isi.edu/nsnam/.
    • NS-2
  • 6
    • 0038562798 scopus 로고    scopus 로고
    • Inet-3.0: Internet topology generator
    • Technical Report, CSE-TR-456-02, Ann Arbor: University of Michigan
    • Jamin S. & J. Winick, Inet-3.0: Internet topology generator, Technical Report, CSE-TR-456-02, Ann Arbor: University of Michigan, 2002.
    • (2002)
    • Jamin, S.1    Winick, J.2


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