Skip to main content

Research on Efficient Non-slotted Tree Structures for Advance Reservation

  • Conference paper
  • 1019 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 401))

Abstract

Resource 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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reinhardt, W.: Advance Resource Reservation and its Impact on Reservation Protocols. In: Proc. of Broadband Islands 1995, Dublin, Ireland (September 1995)

    Google Scholar 

  2. Burchard, L.-O.: Analysis of Data Structures for Admission Control of Advance Reservation Requests. IEEE Transactions on Knowledge and Data Engineering 17(3), 413–424 (2005)

    Article  Google Scholar 

  3. Xiong, N., Vasilakos, A.V., Yang, L.T., Song, L., Pan, Y., Kannan, R., Li, Y.: Comparative Analysis of Quality of Service and Memory Usage for Adaptive Failure Detectors in Healthcare Systems. IEEE Journal on Selected Areas in Communications 27(4), 495–509 (2009)

    Article  Google Scholar 

  4. Burchard, L.-O., Heiss, H.-U.: Performance Evaluation of Data Structures For Admission Control in Bandwidth Brokers, Technical Report TR-KBS-01-02, Communications and Operating Systems Group, Technical University of Berlin (May 2002)

    Google Scholar 

  5. Wang, T., Chen, J.: Bandwidth Tree - A Data Structure for Routing in Networks with Advance Reservation. In: 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, pp. 37–44 (April 2002)

    Google Scholar 

  6. Andreicaf, M., Ţăpuş, N.: Time Slot Groups - A Data Structure for QoS-Constrained Advance Bandwidth Reservation and Admission Control. In: 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, pp. 354–357 (September 2008)

    Google Scholar 

  7. Andreicaf, M., Ţăpuş, N.: Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling. In: International Symposium on Parallel and Distributed Computing, Timisoara, pp. 285–292 (July 2008)

    Google Scholar 

  8. Brodnik, A., Nilsson, A.: An Efficient Data Structure for Advance Bandwidth Reservations on the Internet. In: Proc. of the 3rd Conference on Computer Science and Electrical Engineering, pp. 1–5 (2002)

    Google Scholar 

  9. Xiong, Q., Wu, C., Xing, J., Wu, L., Zhang, H.: A Linked-List Data Structure for Advance Reservation Admission Control. In: Third International Conference, ICCNMC 2005, Zhangjiajie, China, pp. 901–910 (August 2005)

    Google Scholar 

  10. Bn, O., Nilsson, A., Norrgkd, J., Pink, S.: Performance of QoS Agents for Provisioning Network Resources. In: Seventh International Workshop on Quality of Service (IWQoS 1999), London, pp. 17–26 (1999)

    Google Scholar 

  11. Wu, L., Yu, T., He, Y., Li, F.: A index linked list suited for resource reservation. Journal of Wut (Information & Management Engineering) 33(6), 904–908 (2011) (in Chinese)

    Google Scholar 

  12. Berson, S., Lindell, R., Braden, R.: An Architecture for Advance Reservations in the Internet, Technical report, USC Information Sciences Institute (July 1998)

    Google Scholar 

  13. Xiong, N., Jia, X., Yang, L.T., Vasilakos, A.V., Pan, Y., Li, Y.: A Distributed Efficient Flow Control Scheme for Multi-rate Multicast Networks. IEEE Transactions on Parallel and Distributed Systems 21(9), 1254–1266 (2010)

    Article  Google Scholar 

  14. Xiong, N., Vasilakos, A.V., Yang, L.T., Pan, Y., Wang, C.-X., Vandenberg, A.: Distributed Explicit Rate Schemes in Multi-input Multi-output Network Systems. IEEE Transactions on Systems, Man, and Cybernetics, Part C 40(3), 1–12 (2010)

    Google Scholar 

  15. Burchard, L.-O.: On the Performance of Computer Networks with Advance Reservation Mechanisms. In: Proc. 11th IEEE International Conference of Networks (ICON 2003), pp. 449–454 (2003)

    Google Scholar 

  16. Burchard, L.-O., Droste-Franke, M.: Fault Tolerance in Networks with an Advance Reservation Service. In: Jeffay, K., Stoica, I., Wehrle, K. (eds.) IWQoS 2003. LNCS, vol. 2707, pp. 215–228. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Burchard, L.-O., Hovestadt, M., Kao, O., Keller, A., Linnert, B.: The Virtual Resource Manager: An Architecture for SLA-aware Resource Management. In: Proc. IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2004), pp. 126–133 (April 2004)

    Google Scholar 

  18. Sulistioa, A., Cibejb, U., Prasadc, S.K., Buyyaa, R.: GarQ: An Efficient Scheduling data Structure for Advance Reservations of Grid Resources. International Journal of Parallel, Emergent and Distributed Systems 24(1), 1–19 (2009)

    Article  MathSciNet  Google Scholar 

  19. Krzysztof, K., Ariel, O., Jan, W.: Multicriteria, Multi-user Scheduling in Grids with Advance Reservation. Journal of Scheduling 13(5), 493–508 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kannan, R., Sanjay, R., Ye, X.: Advance Reservations and Scheduling for Bulk Transfers in Research Networks. IEEE Transactions on Parallel and Distributed Systems 20(11), 1682–1697 (2009)

    Article  Google Scholar 

  21. Xiong, N., Vasilakos, A.V., Yang, L.T., Wang, C.-X., Kannan, R., Changf, C.-C., Pan, Y.: A Novel Self-Tuning Feedback Controller for Active Queue Management Supporting TCP Flows. Information Sciences 180(11), 2249–2263 (2010)

    Article  MathSciNet  Google Scholar 

  22. Chongyang, X., Hamad, A., Nasir, G.: Routing and Scheduling in Distributed Advance Reservation Networks. In: IEEE Global Telecommunications Conference, Miami, FL, pp. 1–6 (December 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, L., Dang, P., Yu, T., Nie, L. (2013). Research on Efficient Non-slotted Tree Structures for Advance Reservation. In: Su, J., Zhao, B., Sun, Z., Wang, X., Wang, F., Xu, K. (eds) Frontiers in Internet Technologies. Communications in Computer and Information Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53959-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53959-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53958-9

  • Online ISBN: 978-3-642-53959-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics