Skip to main content
SpringerLink
Log in

REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

This paper addresses the resource reservation problem in a packet switching network. REBOOK, the presented algorithm, provides deterministic, fast (real-time) dynamic resource allocation and release. Based on a stateful approach, it handles faults and network errors, and recovers from route changes and unexpected flows shutdown. The distributed scheme used to store flows information avoids the need of searching for entries within the routers’ control memory when packets are received and guarantees constant complexity. REBOOK can be implemented in hardware and is compatible with any packet switching network. In the Internet, it can be integrated in TCP or used with UDP to make it network friendly. Moreover, a slightly extended implementation of RSVP can be used as signalling and hosting protocol. A software implementation as standalone protocol has been developed to prove its effectiveness, robustness, and performance.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Floyd, S., Fall, K.: Promoting the use of end-to-end congestion control in the internet. IEEE/ACM. Trans. Netw. 7(4), 458–473 (1999)

    Article  Google Scholar 

  2. Yang, C.-Q., Reddy, A.V.S.: A taxonomy for congestion control algorithms in packet switching networks. IEEE. Netw. Mag. 9(4), 34–45 (1995)

    Article  Google Scholar 

  3. Zhang, L., Deering, E.S., Estrin, D., Shenker, S., Zappala, D.: RSVP: A new resource reservation protocol. IEEE. Netw. 7(5), 8–18 (1993)

    Article  Google Scholar 

  4. Mathy, L., Hutchison, D., Schmid, S., Coulson, G.: Improving RSVP for better support of internet multimedia communications In Proceedings of ICMS’99, pp. 102–106. Florence Italy, IEEE press (1999)

    Google Scholar 

  5. Almesberger, W., Giordano, S., Mameli, R., Salsano, S., Salvatore, F.: Combining IntServ and DiffServ under Linux, Public file. Citeseer, Princeton, New Jersey (1999)

    Google Scholar 

  6. Sohail, S., Jha, S.: The survey of bandwidth broker technical report UNSW CSE TR 0206 school of computer science and engineering. University of New South Wales, Sydney, Australia (2002)

    Google Scholar 

  7. Zhang, Z.-L., Duan, Z., Hou, Y.T.: Scalable design of bandwidth brokers. IEICE Trans. Commun. E84–B(8), 2011–2025 (2001)

    Google Scholar 

  8. Katabi, D., Handley, M., Rohrs, C.: Congestion control for high bandwidth delay product networks. SIGCOMM’02, Pittsburgh, Pennsylvania, USA (2002)

    Google Scholar 

  9. Xia, Y., Subramanian, L., Kalynaraman, S.: One more bit is enough. SIGCOMM’05, Philadelphia, Pennsylvania, USA (2005)

    Google Scholar 

  10. Ping, J., Zihui, G., Kurose, J.F., Towsley, D.: A comparison of hard-state and soft-state signaling protocols. IEEE/ACM. Trans. Netw. 15(2), 281–294 (2007)

    Article  Google Scholar 

  11. Kuhns, F., Turner, J., Norden, S.: Lightweight flow setup for wirespeed resource reservation. In Proceedings of the Allerton Conference on communication, control and computing (2003)

  12. Ping, P., Schulzrinne, H.: YESSIR: A simple reservation mechanism for the internet. Comm. Rev. 29(2), 89–101 (1999)

    Article  Google Scholar 

  13. Kuhns, F., Turner, J., Norden, S.: Lightweight flow setup for wirespeed resource reservation. In Proceeding of the Allerton Conference communication, control and computing (2003)

  14. Minei, I.: White Paper. MPLS DiffServ-aware traffic engineering. Juniper Networks (2004)

  15. Sharma, V., Hellstrand, F.: Framework for multi-protocol label switching (MPLS)-based recovery. RFC 3469 (2003)

  16. Dogar, F.R., Uzmi, Z., Baqai, S.: CAIP: A Restoration routing architecture for diffserv aware mpls traffic engineering. 5th Workshop on Design of Reliable Communication Networks (DRCN), 55–60 (2005)

  17. Anjali, T., Scoglio, C., de Oliveira, J., Akyildiz, I., Uhl, G.: Optimal policy for LSP setup in MPLS networks. Comput. Netw. 39(2), 165–183 (2002)

    Article  Google Scholar 

  18. Movsichoff, B.A., Lagoa, C.M., Che, H.: End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery. IEEE/ACM. Trans.Netw. 15(4), 813–823 (2007)

    Article  Google Scholar 

  19. Kvalbein, A., Hansen, F.A., Čičić, T., Gjessing, S., Lysne, O.: Fast IP network recovery using multiple routing configurations. INFOCOM 2006. 25th IEEE, International Conference on computer communications proceedings, 1–11 April 2006

  20. Bhatia, R.S., Kodialam, M., Lakshman, T.V., Sengupta, S.: Bandwidth guaranteed routing with fast restoration against link and node failures. IEEE/ACM. Trans. Netw. 16(6), 1321–1330 (2008)

    Article  Google Scholar 

  21. Psounis, K., Ghosh, A., Prabhakar, B., Wang, G.: SIFT: A simple algorithm for trucking Elephant flows and taking advantage of power laws. In Proceedings of the 43rd Allerton Conference on Communication, control, and computing. Urbana-Champain, Illinois, USA, Sept 2005

  22. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE. Trans. Inf. Theory. 22(6), 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  23. Ji, P., Ge, Z., Kurose, J., Towsley, D.: A Comparison of hard-state and soft-state signaling protocols. Proc. SIGCOMM’03, Karlsruhe, Germany (2003)

    Google Scholar 

  24. Baker, F., Lindell, B., Talwar, M.: RSVP Cryptographic authentication. RFC 2747, Jan 2000

  25. Braden, R., Zhang, L.: RSVP Cryptographic authentication—Updated message type value. RFC 3097, Apr 2001

  26. CYGWIN web site <http://www.cygwin.com>

Download references

Acknowledgments

The authors wish to thank Davide Pierattoni, Mirko Loghi, Mario Baldi, Fulvio Risso, Ivan Macor, Silvano Gai, Pietro Nicoletti, Balaji Prabhakar and Tom Edsall for their collaboration and precious suggestions.

Author information

Authors and Affiliations

  1. Department of Electrical, Management and Mechanical Engineering, University of Udine, Via delle Scienze 208, 33100, Udine, Italy

    Pier Luca Montessoro & Daniele De Caneva

Authors
  1. Pier Luca Montessoro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniele De Caneva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pier Luca Montessoro.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Montessoro, P.L., De Caneva, D. REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm. J Netw Syst Manage 18, 418–446 (2010). https://doi.org/10.1007/s10922-010-9167-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-010-9167-8

Keywords

Search

Navigation