Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multicast is an efficient way for group communication over the Internet. The performance of multicast relies greatly on the multicast tree constructed among the group members. Constructing a multicast tree spanning a set of group members with minimum cost is called Steiner tree problem which is a ll-known NP-hard problem. Existing heuristic algorithms can build such a Steiner tree statically when the group members are known in advance. Hover, in many multicast tree dynamically. In addition, QoS is becoming a more important issue in multicast applications, and many applications, pose a tight bound on end-to-end delay. ,  design a heuristic algorithm which can construct a delay constrained minimum cost multicast tree dynamically. Our algorithm can add or remove a group number without rerouting the path beten the source and other group members. The algorithm not only avoids packet loss but also saves network bandwidth. Our algorithm guarantees that the end-to-end delay beten the source and any group member is bounded with a threshold. Simulation results show that the algorithm achieves a good balance beten the cost of a multicast tree and the time of the construction.
['Min Yang', 'Y.-Y. Yang']
I am writing a research paper on a idea Constructing minimum cost dynamic multicast trees under delay constraint
[{"from": "human", "value": "I am writing a research paper on a idea Constructing minimum cost dynamic multicast trees under delay constraint"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multicast is an efficient way for group communication over the Internet. The performance of multicast relies greatly on the multicast tree constructed among the group members. Constructing a multicast tree spanning a set of group members with minimum cost is called Steiner tree problem which is a ll-known NP-hard problem. Existing heuristic algorithms can build such a Steiner tree statically when the group members are known in advance. Hover, in many multicast tree dynamically. In addition, QoS is becoming a more important issue in multicast applications, and many applications, pose a tight bound on end-to-end delay. ,  design a heuristic algorithm which can construct a delay constrained minimum cost multicast tree dynamically. Our algorithm can add or remove a group number without rerouting the path beten the source and other group members. The algorithm not only avoids packet loss but also saves network bandwidth. Our algorithm guarantees that the end-to-end delay beten the source and any group member is bounded with a threshold. Simulation results show that the algorithm achieves a good balance beten the cost of a multicast tree and the time of the construction."}]