Optimization Methods for Multicast Routing Problems

Carlos A. S. Oliveira ()
Additional contact information
Carlos A. S. Oliveira: AT&T Labs Inc.

Chapter Chapter 5 in Handbook of Artificial Intelligence and Data Sciences for Routing Problems, 2025, pp 93-106 from Springer

Abstract: Abstract In multicast networks, the objective is to send information to multiple users with a single transmission. This allows for savings in bandwidth since data can be shared across network links. An important problem in multicast networks is the determination of an optimum route to be followed by packets in a multicast group. This is known as the multicast routing problem (MRP). A large number of heuristic algorithms have been proposed in recent years to solve the MRP, which is of great interest to network engineers. In this paper, we propose a hybrid metaheuristic approach for the MRP, where a GRASP is used in conjunction with a variable neighborhood search algorithm to find near-optimal solutions to the MRP. Simulation results show that the proposed technique is superior in terms of solution quality.

Keywords: Optimization; Routing; Multicast; Telecommunications; Machine learning (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-78262-6_5

Ordering information: This item can be ordered from
http://www.springer.com/9783031782626

DOI: 10.1007/978-3-031-78262-6_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().