Abstract
Timely recovery from network component failures is essential to the applications that require guaranteed-performance communication services. To achieve dependable communication, there have been several proposals that can be classified into two categories: reactive and proactive.
The reactive approach tries to reroute traffic upon detection of a network link/node failure. This approach may suffer from contention and resource shortage when multiple connections need to be rerouted at the same time. The proactive approach, on the other hand, prepares a backup channel in advance that will be activated upon failure of the corresponding primary channel due to a broken link or node. The proactive approach, although it offers higher dependability, incurs higher routing overhead than the reactive approach.
We propose a hybrid approach that reduces signaling overhead by decoupling backup routing from resource provisioning. We also propose an efficient backup routing algorithm for the hybrid approach. Our in-depth simulation results show that the proposed approach can achieve the ability of failure recovery comparable to the proactive scheme without the need for broadcasting the routing information.
The work reported in this paper was supported in part by the Office of Naval Research under Grant No. N00014-99-1-0465.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Paxson, V.: End-to-end routing behavior in the internet. IEEE/ACM Transaction on Networking 5 (1997) 601–615
Labovitz, C., Ahuja, A., Jahanian, F.: Experimental study of internet stability and backbone failures. In: Proceedings of IEEE FTCS’99. (1999) 278–285
Banerjea, A., Parris, C., Ferrari, D.: Recovering guaranteed performance service connections from single and multiple faults. In: Proceedings of IEEE GLOBECOM’ 94, San Francisco, CA (1994) 162–168
Banerjea, A.: Fault recovery for guaranteed performance communications connections. IEEE Transactions on Computer Systems 7 (1999) 653–668
Dovrolis, C., Ramanathan, P.: Resource aggregation for fault tolerance in integrated services networks. Computer Communication Review 28 (1998) 39–53
Han, S., Shin, K.G.: Efficient spare resource allocation for fast restoration of realtime channels from network component failures. In: Proceedings of IEEE RTSS’97. (1997) 99–108
Han, S., Shin, K.G.: Fast restoration of real-time communication service from component failures in multihop networks. In: Proceedings of ACM SIGCOMM’97. (1997) 77–88
Han, S., Shin, K.G.: A primary-backup channel approach to dependable real-time communication in multi-hop networks. IEEE Transactions on Computers 47 (1998)
Spring, N., Mahajan, R., Wetherall, D.: Measuring isp topologies with rocketfuel. In: Proceedings of ACM SIGCOMM 2002. (2002) 133–146
Calvert, K., Zegura, E.: Gt-itm: Georgia tech internetwork topology models. http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz. (1996)
Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: Proceedings of INFOCOM 2000. (2000) 902–911
Kim, S., Qiao, D., Kodase, S., Shin, K.G.: Design and evaluation of routing schemes for dependable real-time connections. In: Proceedings of DSN 2001. (2001) 285–294
Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed path selection for shared restoration connections. In: Proceedings of INFOCOM 2002. (2002) 140–149
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Shin, K.G. (2003). Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive