Abstract
AbstractResource reservation is a widely used mechanism in distributed systems and high-performance networks, and the optimization of its performance has been greatly concerned. Data structure is used to store summary information of reservation requests to provide direct basis for the admission control, so it is important to optimize the performance of data structure. In this paper, the existing data structures for resource reservations are analyzed and two new data structures—the resource clue tree and the resource binary tree—are proposed to solve the problem of low performance of non-slotted tree structures. The description performance, processing performance and store performance of several data structures are analyzed and compared with the timeslot array by experiments. The results show that the resource clue tree can achieve better performance than the timeslot array in some cases.Keywordsresource reservationdata structureresource clue treeresource binary tree
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
