Name
Abstract | ||
|---|---|---|
In real-time multicast, delay and inter-destination delay variation of group members are bounded above by a value. The problem is known as Delay and Delay Variation Bounded Multicast Tree (DVBMT), which is proven to be NP-complete. In this paper, we propose a directional approach (DCS) for core selection and tree generation satisfying delay and inter-destination delay variation constraints. After selecting a core node, to build a lower inter-destination delay variation tree, we propose another algorithm (DCSBLVT) based on k-shortest-paths. Simulation results show that the proposed algorithms remove the drawbacks of existing algorithms, and have better performance in terms of delay, inter-destination delay, error probability, and execution time. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/HPCC-SmartCity-DSS.2016.0075 | 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS) |
Keywords | Field | DocType |
QoS,multicast,core,delay,delay variation | End-to-end delay,Network delay,Computer science,Queuing delay,Transmission delay,Real-time computing,Round-trip delay time,Multicast,Elmore delay,Distributed computing,Processing delay | Conference |
ISBN | Citations | PageRank |
978-1-5090-4298-2 | 1 | 0.36 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Meghrig Terzian | 2 | 2 | 2.09 |