Supported by the National Natural Science Foundation of China(No.61473179);Shandong Province Higher Educational Science and Technology Program(No.J16LN20);Natural Science Foundation of Shandong Province(No.ZR2016FM18);the Youth Scholars Development Program of Shandong University of Technology
Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To reso...
Supported by the State Key Program of National Natural Science Foundation of China (No. 60832009), Natural Science Foundation of Bcijing (No. 4102044), Innovative Project for Young Researchers in Central Higher Education Institutions, China (No. 2009RC0119) and New Generation of Broadband Wireless Mobile Communication Networks of Major Projects of National Science and Technology (No.2009ZX03003-003-01).
It is widely believed that cooperative relay technologies can improve the throughput of multicasting in mobile cellular networks significantly, however, the mobility of the relay terrninals may cause frequent relay li...
This paper presents Sphere, a scalable multicast framework in overlay network. Sphere is a highly efficient, serf-organizing and robust multicast protocol overlayed on the Internet. The main contrihutions of this pape...
An improved heuristic algorithm is developed which can optimize the multicast routing under the condition that both delay and bandwidth are constrained. Performance analysis and computer simulation show that the routi...
The delay constrained least cost multicast routing problem is introduced and then a related genetic algorithm is proposed. Finally, simulation results are shown to prove that the genetic algorithm is fast and effective.
The problem of constructing minimum cost multicast trees with end to end delay and delay variation constraints to meet the quality of service requirements in high speed packet switched environments is studied in t...