Rendezvous point based approach to the multi-constrained multicast routing problem |
| |
| Affiliation: | 1. Armed Forces Radiobiology Research Institute, Bethesda, MD, USA;2. Department of Radiation Biology, F. Edward Hébert School of Medicine, Uniformed Services University of the Health Sciences, Bethesda, MD, USA |
| |
| Abstract: | The Quality of Service (QoS) routing requires a special approach to graph algorithms modeling. One of the mathematical concepts that reflects this class of problems is the multi-constrained minimum Steiner tree problem (MCMST). In this article, the RDP (named after the concept of the RenDezvouz Point), a novel algorithm for solving the MCMST problem is presented. |
| |
| Keywords: | Quality of Service Multi-constrained routing |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
