In this paper we investigate a variant of variable neighborhood search, variable descent search, for the delay-constrained least-cost multicast routing problems ...
Multicast routing consists of concurrently sending the same information from a source to a subset of all possible destinations in a computer network thus ...
Missing: Relinking | Show results with:Relinking
mization problem called rooted delay-constrained minimum spanning tree (RD- ... Path Relinking Approach for Delay-Constrained. Least-Cost Multicast Routing ...
main goals, the minimum path cost from source to each destination (Shortest ... Based Algorithm for Delay-Constrained minimum-Cost. Multicasting”, in ...
... Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. Ghaboosi N., Haghighat A.T.. 2007 , citations by CoLab: 10. 10. CITATIONS.
Ghaboosi, N., Haghighat, A.T.: A path relinking approach for delay-constrained least-cost multicast routing problem. In: 19th IEEE International Conference ...
The main challenge of this multicast is to ensure the service availability and reliability using a path protection scheme, which is to find a redundant path ...
Abstract—Multicast routing consists of concurrently sending the same information from a source to a subset of all possible destinations in a computer ...
... way cookies are used by the portal. You can change the cookie ... A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem.
More recently, in [15] a path-relinking approach was applied to the problem. ... Algorithm for Delay-Constrained Least-Cost Multicast Routing. In Proceedings ...