Abstract
The dependability of a network is its ability to cope with failures, i.e., to maintain established connections even in case of failures. IP routing protocols (such as OSPF and RIP) do not fit the dependability objectives of today applications. Usual forwarding techniques based on destination address (like IP) induce many-to-one connections. Thus, if a dependable connection is needed, all primary paths and protections having the same destination must be established in a coordinated way. Otherwise, loops may be established. In this paper, we propose a fault recovery for many-to-one connections based on a cold (preplanned) protection. The main advantage of our approach is that the recovery in case of failures is achieved within a short delay. Additionally, with respect to other approaches, the dependability of the routing scheme is increased in the way that it statistically copes with many failures. The algorithm we propose computes an efficient backup for an arbitrary primary tree using an improved multi-tree algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Krizanc, D., Zhang, L.: Many-to-one packet routing via matching. In: Annual International Conference on Computing and Combinatorics, Shanghai, China (1997)
Makedon, F., Simvonis, A.: Many-to-one packet routing on the mesh. In: Annual Conference on Computer Science (1999)
Ee, C.T., Bajcsy, R.: Congestion control and fairness for many-to-one routing in sensor networks. In: International Conference on Embedded networked sensor systems, Baltimore, USA (2004)
Duato, J.: A theory of fault-tolerant routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems 8, 790–802 (1997)
Goyal, M., Ramakrishnan, K.K., Feng, W.C.: Achieving Faster Failure Detection in OSPF Networks. IEEE ICC (2003)
Obradovic, D.: Formal Analysis of Convergence of Routing Protocols. PhD thesis, University of Pennsylvania (2001)
Maier, G., Pattavina, A., De Patre, S., Martinelli, M.: Optical Network Survivability: Protection Techniques in the WDM Layer. Photonic Network Communications 3/4, 251–269 (2002)
Anand, V., Qiao, C.: Static versus dynamic establishment paths in WDM networks, Part I. IEEE ICC 1, 198–204 (2000)
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II – Restoration. IEEE ICC 3, 2023–2030 (1999)
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part I – Protection. IEEE INFOCOM 2, 744–751 (1999)
Nakamura, R., Ono, H., Nishikawara, K.: Reliable switching services. IEEE Globecom (1994)
Johnson, D., Johnson, G.N., Beggs, S.L., Botahm, C., Hawker, I., Chng, R.S.K., Sinclair, M.C., O’Mahony, M.J.: Distributed restoration strategies in telecommunications networks. IEEE ICC 1, 483–488 (1994)
Médard, M., Finn, S.G., Barry, R.A.: Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking 7, 641–652 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Molnár, M., Guitton, A., Cousin, B., Marie, R. (2005). Efficient Protection of Many-to-One Communications. In: Dal Cin, M., Kaâniche, M., Pataricza, A. (eds) Dependable Computing - EDCC 5. EDCC 2005. Lecture Notes in Computer Science, vol 3463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408901_27
Download citation
DOI: https://doi.org/10.1007/11408901_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25723-3
Online ISBN: 978-3-540-32019-7
eBook Packages: Computer ScienceComputer Science (R0)