Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the ll-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree and ACK messages are passed along the edges of this so-called ACK tree. For building up this tree variations of the expanding ring search (ERS) scheme have been proposed. Hover, our simulations show that ERS scales poorly. ,  propose an alternative scheme for building up ACK trees. This scheme is based on a so-called token repository service, where a token represents the right to connect to a certain node in the corresponding ACK tree. Nodes that want to join a group just request a token for this group from the (distributed) token repository service. Our simulations show that our scheme causes a much lor message overhead than ERS. Moreover, the quality of the resulting ACK trees in terms of delay and reliability is in many cases higher if generated with our scheme.
['Kurt Rothermel', 'Christian Maihöfer']
I am writing a research paper on a idea A robust and efficient mechanism for constructing multicast acknowledgement trees
[{"from": "human", "value": "I am writing a research paper on a idea A robust and efficient mechanism for constructing multicast acknowledgement trees"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the ll-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree and ACK messages are passed along the edges of this so-called ACK tree. For building up this tree variations of the expanding ring search (ERS) scheme have been proposed. Hover, our simulations show that ERS scales poorly. ,  propose an alternative scheme for building up ACK trees. This scheme is based on a so-called token repository service, where a token represents the right to connect to a certain node in the corresponding ACK tree. Nodes that want to join a group just request a token for this group from the (distributed) token repository service. Our simulations show that our scheme causes a much lor message overhead than ERS. Moreover, the quality of the resulting ACK trees in terms of delay and reliability is in many cases higher if generated with our scheme."}]