Network capacity assignment for multicast services using genetic algorithms

IEEE Communications Letters

Volumn 8, Issue 6, 2004, Pages 403-405

  Atzori, Luigi ^a   Raccis, Alessio ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; GENETIC ALGORITHMS; HEURISTIC METHODS; MULTICASTING; OPTIMIZATION; PROBABILITY; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

MULTICAST TRAFFIC; NETWORK CAPACITY ASSIGNMENT; OPTIMAL LINK CAPACITY; TRANSMISSION DELAY;

TELECOMMUNICATION NETWORKS;

EID: 3142730681     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2004.831328     Document Type: Article

References (4)

1. H. Sayoud, K. Takahashi, and B. Vaillant, "Designing communication networks topologies using steady-state genetic algorithms," IEEE Commun. Lett., vol. 5, pp. 113-115, March 2001.
2. M. Prytz and A. Forsgren, "Dimensioning of Multicast Network That Uses Shortest Path Routing Distribution Trees," Dep. Math., Royal Inst. of Technol., Stockholm, Sweden, Rep. TRITA-MAT-2001-OS2, 2001.
3. S. Chen, O. Günlük, and B. Yener, "The multicast packing problem," IEEE/ACM Trans. Networking, vol. 8, pp. 311-318, June 2000.
4. H. Takahashi and A. Matsuyama, "An approximation solution for the Steiner tree problem in graphs," Math. Japonica, vol. 24, pp. 573-577, 1980.