On the public citation graph

Tabu Search Algorithm for Core Selection in Multicast Routing

0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11557654_34openalex-snapshot
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/j.comcom.2009.07.015openalex-snapshot
Tabu search algorithm for RP selection in PIM-SM multicast routing
inferredcites →https://doi.org/10.1016/j.cor.2003.12.007openalex-snapshot
A survey of combinatorial optimization problems in multicast routing
inferredcites →https://doi.org/10.1016/s0140-3664(01)00404-2openalex-snapshot
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem
inferredcites →https://doi.org/10.1023/a:1026118914566openalex-snapshot
Rendezvous Point Relocation in Protocol Independent Multicast-Sparse Mode
inferredcites →https://doi.org/10.1049/el:20000315openalex-snapshot
Core selection algorithm for multicast routingunder multiple QoS constraints
inferredcites →https://doi.org/10.1093/ietcom/e89-b.9.2385openalex-snapshot
On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints
inferredcites →https://doi.org/10.1109/49.564133openalex-snapshot
Multicast routing with end-to-end delay and delay variation constraints
inferredcites →https://doi.org/10.1109/icc.2002.997057openalex-snapshot
RP reselection scheme for real-time applications in delay-constrained multicast networks
inferredcites →https://doi.org/10.1109/icc.2004.1312876openalex-snapshot
Applying clustering algorithms as core selection methods for multiple core trees
inferredcites →https://doi.org/10.1109/icc.2004.1312895openalex-snapshot
Distributed core selection with QoS support
inferredcites →https://doi.org/10.1109/wcnc.2008.480openalex-snapshot
Efficient Algorithm for Reducing Delay Variation on Delay-Bounded Multicast Trees in Heterogeneous Networks
inferredcites →https://doi.org/10.17487/rfc2189openalex-snapshot
Core Based Trees (CBT version 2) Multicast Routing -- Protocol Specification --
inferredcites →https://doi.org/10.17487/rfc2362openalex-snapshot
Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
inferredcites →https://doi.org/10.17487/rfc7761openalex-snapshot
Protocol Independent Multicast - Sparse Mode (PIM-SM): Protocol Specification (Revised)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-15-5679-1_13openalex-snapshot
Prediction of POS Tagging for Unknown Words for Specific Hindi and Marathi Language
inferred← citeshttps://doi.org/10.1007/s11042-014-2405-4openalex-snapshot
A fast and scalable technique for constructing multicast routing trees with optimized quality of service using a firefly based genetic algorithm
inferred← citeshttps://doi.org/10.1109/bwcca.2013.84openalex-snapshot
Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing
inferred← citeshttps://doi.org/10.1109/icocs.2012.6458559openalex-snapshot
D2V-VNS-RPS: Delay and delay variation constrained algorithm based on Variable Neighborhood Search algorithm for RP Selection problem in PIM-SM protocol
inferred← citeshttps://doi.org/10.1109/intech.2013.6653696openalex-snapshot
Parallel GRASP algorithm with delay and delay variation for core selection in shared tree based multicast routing protocols
inferred← citeshttps://doi.org/10.1515/joc-2014-0027openalex-snapshot
A Multi-core Shared Tree Algorithm Based on Network Coding for Multi-point Optical Multicast
inferred← citeshttps://doi.org/10.17762/ijcnis.v6i1.454openalex-snapshot
QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm
inferred← citeshttps://doi.org/10.2991/isrme-15.2015.434openalex-snapshot
Ant Colony Algorithm for Solving the Multicast Routing Problem with QoS Constraints
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.373-375.1182openalex-snapshot
Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.556-562.5343openalex-snapshot
Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4771openalex-snapshot
Delay and Delay Variation Constrained Algorithm based on VNS Algorithm for RP Management in Mobile IPv6
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.