On the public citation graph
Restricted dynamic Steiner trees for scalable multicast in datagram networks
0 signed · 62 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1109/49.564136openalex-snapshot
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
inferredcites →https://doi.org/10.1109/90.234851openalex-snapshot
Multicast routing for multimedia communication
inferredcites →https://doi.org/10.1109/glocom.1995.502627openalex-snapshot
Distributed algorithms for multicast path setup in data networks
inferredcites →https://doi.org/10.1109/infcom.1993.253244openalex-snapshot
Routing multipoint connections using virtual paths in an ATM network
inferredcites →https://doi.org/10.1109/infcom.1993.253246openalex-snapshot
How bad is naive multicast routing?
inferredcites →https://doi.org/10.1109/infcom.1995.515879openalex-snapshot
Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks
inferredcites →https://doi.org/10.1109/infcom.1996.497914openalex-snapshot
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferredcites →https://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/179606.179654openalex-snapshot
Multicast routing extensions for OSPF
inferredcites →https://doi.org/10.1145/359657.359665openalex-snapshot
Reverse path forwarding of broadcast packets
inferredcites →https://doi.org/10.17487/rfc1075openalex-snapshot
Distance Vector Multicast Routing Protocol
inferredcites →https://doi.org/10.5555/34233.34235openalex-snapshot
Steiner problem in networks: a survey
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70040openalex-snapshot
Dynamic Algorithms for Approximate Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_14openalex-snapshot
Genetic Algorithms for Dynamic Routing Problems in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/bfb0054367openalex-snapshot
Concurrent multicast in weighted networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.12.009openalex-snapshot
End System Multicast routing for multi-party videoconferencing applications
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.02.015openalex-snapshot
QoS multicast routing for multimedia group communications using intelligent computational methods
inferred← citeshttps://doi.org/10.1016/j.comcom.2017.05.018openalex-snapshot
Bloomflow: Openflow extensions for memory efficient, scalable multicast with multi-stage bloom filters
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110815openalex-snapshot
NDN multicast over wireless networks: A survey on fundamentals, challenges, and open issues
inferred← citeshttps://doi.org/10.1016/j.endm.2016.05.033openalex-snapshot
A degree based approach to find Steiner Trees
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.01.021openalex-snapshot
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.003openalex-snapshot
A super-stabilizing log(n) -approximation algorithm for dynamic Steiner trees
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00262-1openalex-snapshot
Algorithms and protocols for stateless constrained-based routing
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00018-9openalex-snapshot
Concurrent multicast in weighted networks
inferred← citeshttps://doi.org/10.1109/candarw57323.2022.00064openalex-snapshot
Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1109/ccnc.2006.1593232openalex-snapshot
Multicast tree reconfiguration in distributed interactive applications
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189109openalex-snapshot
Extensions to OSPF for tunnel multicasting
inferred← citeshttps://doi.org/10.1109/glocom.2003.1259016openalex-snapshot
Forwarding state reduction for delay-constrained multicasting in IP networks
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037084openalex-snapshot
Scalable and bandwidth-efficient multicast for software-defined networks
inferred← citeshttps://doi.org/10.1109/glocom.2018.8647865openalex-snapshot
Live Video Multicast for Dynamic Users via Segment Routing in 5G Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2003.1203459openalex-snapshot
Deliver multimedia streams with flexible QoS via a multicast DAG
inferred← citeshttps://doi.org/10.1109/icon.2005.1635456openalex-snapshot
Compact Tree Plus Algorithms for Application-Level Multicast Communications in Multihome Networks
inferred← citeshttps://doi.org/10.1109/icpp.2006.13openalex-snapshot
A Service-Centric Multicast Architecture and Routing Protocol
inferred← citeshttps://doi.org/10.1109/icppw.2004.1328028openalex-snapshot
P2P resource pool and its application to optimize wide-area application level multicasting
inferred← citeshttps://doi.org/10.1109/icppw.2004.67openalex-snapshot
P2P resource pool and its application to optimize wide-area application level multicasting
inferred← citeshttps://doi.org/10.1109/infcom.1997.644569openalex-snapshot
Restricted dynamic Steiner trees for scalable multicast in datagram networks
inferred← citeshttps://doi.org/10.1109/infcom.2000.832566openalex-snapshot
Framework for multicast in hierarchical networks
inferred← citeshttps://doi.org/10.1109/infcom.2001.916727openalex-snapshot
A unicast-based approach for streaming multicast
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019368openalex-snapshot
Effective location-guided tree construction algorithms for small group multicast in MANET
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218381openalex-snapshot
Reliable multicast routing for software-defined networks
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524383openalex-snapshot
Multicast traffic engineering for software-defined networks
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486290openalex-snapshot
Online Multicast Traffic Engineering for Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.58openalex-snapshot
Prototyping Service Discovery and Usage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.85openalex-snapshot
Dynamic Group Membership Management for Distributed Interactive Applications
inferred← citeshttps://doi.org/10.1109/mcom.2003.1204747openalex-snapshot
Forwarding stat scalability for a multicast provisioning in ip networks
inferred← citeshttps://doi.org/10.1109/mcom.2005.1381884openalex-snapshot
Providing multicast through recursive unicast
inferred← citeshttps://doi.org/10.1109/reldis.1998.740517openalex-snapshot
Distributed center location algorithm for fault-tolerant multicast in wide-area networks
inferred← citeshttps://doi.org/10.1109/tbc.2019.2932338openalex-snapshot
A QoE-Driven Multicast Strategy With Segment Routing—A Novel Multimedia Traffic Engineering Paradigm
inferred← citeshttps://doi.org/10.1109/tnet.2022.3171832openalex-snapshot
Submarine Cable Network Design for Regional Connectivity
inferred← citeshttps://doi.org/10.1117/1.1886846openalex-snapshot
Efficient multicast routing in wavelength-division-multiplexing networks with light splitting and wavelength conversion
inferred← citeshttps://doi.org/10.1162/1054746041422325openalex-snapshot
End System Multicast Protocol for Collaborative Virtual Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3454openalex-snapshot
Scalable Steiner Tree for Multicast Communications in Software-Defined Networking
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.