Name
Title | ||
|---|---|---|
Multicast Routing Using Delay Intervals for Collaborative and Competitive Applications. |
Abstract | ||
|---|---|---|
Collaborative and competitive applications require that participants receive messages almost simultaneously and before a specified time. These requirements have been addressed by the delay variation-bounded multicasting tree (DVBMT) problem. In this paper, we propose the interval multicast subgraph (IMS) problem to address these requirements. IMS addresses these constraints with an interval of acc... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCOMM.2018.2865484 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Delays,Multicast communication,Heuristic algorithms,Quality of service,Multicore processing,Complexity theory,Runtime | Graph,Multicast algorithms,Computer science,Correctness,Computer network,Quality of service,Electronic engineering,Mathematical proof,Multicast,Multi-core processor,Variation value | Journal |
Volume | Issue | ISSN |
66 | 12 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Andrus | 1 | 0 | 0.34 |
| Shankar M. Banik | 2 | 55 | 8.42 |
| Breeanne Baker Swart | 3 | 0 | 0.68 |
| Michael P. Verdicchio | 4 | 6 | 1.46 |