1 |
Sheu, P.-R., and S.-T. Chen, 'A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem,' Computer Comm., Vol.25, pp.825-833, 2002
DOI
ScienceOn
|
2 |
Q. Zho, M. Parsa, and J. J. Garcia-Luna-Aceves, 'A source-based algorithm for near-optimum delay-constrained multicasting,' IEEE INFOCOM'95 Proc., pp.377-385, March, 1995
DOI
|
3 |
Ballardie, T., Francis, P., and Crowcroft, J., 'Core based tree(CBT) : An architecture for scalable inter-domain multicast routing,' Computer Commun. Rev., Vol.23, No.4, pp.85-95, 1993
DOI
|
4 |
Hakimi, S. L., 'Steiner's problem in graphs and its implication,' Networks, Vol.1, pp.113-133, 1971
DOI
|
5 |
Rouskas, G. N., and Baldine, I., 'Multicast routing with end-to-end delay and delay variation constraints,' IEEE JSAC, Vol.15, No.3, pp.346-356, April, 1997
DOI
ScienceOn
|
6 |
Rodionov, A. S., and Choo, H., 'On generating random network structures: Connected Graphs,' Springer-Verlag Lecture Notes in Computer Science, Vol.3090, pp.483-491, August, 2004
|