Abstract

The paper considered a framework that resource allocation is based on local QoS restriction at each network link in a certain multicast tree, and each link is associated with a probability function whose value is equal to the probability of the linkpsilas resources. An algorithm has been developed to solve the problem of how to partition end-to-end QoS restriction including every member in a multicast group into local restrictions, and the overall security of the multicast tree is maximized.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.