Abstract
Previous approaches to the dynamic updating of Shortest Path Trees (SPTs) have in the main focused on just one link state change. Not much work has been done on the problem of deriving a new SPT from an existing SPT for multiple link state decrements in a network that applies link-state routing protocols such as OSPF and IS-IS. This problem is complex because in the process of updating an SPT there are, firstly, no simple forms of node set to presumable contain all nodes to be updated and, secondly, multiple decrements can be accumulated to make the updating much harder. If we adopt the updating mechanisms engaged in one link state change for the case of multiple link state decrements, the result is node update redundancy, as a node changes several times before it reaches its final state in the new SPT. This paper proposes two dynamic algorithms (MaxR, MinD) for obviating unnecessary node updates by having part nodes updated in a branch on the SPT only after selecting a particular node from a built node list. The algorithm complexity analysis and simulation results show that MaxR and MinD require fewer node updates during dynamic update procedures than do other algorithms for updating SPT of multiple link state decrements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fortz B, Thorup M (2002) Optimizing OSPF/IS-IS weights in a changing world. IEEE J Sel Areas Commun 20(4):756–767
Frigioni D, Marchetti-Spaccamela A, Nanni U (1998) Fully dynamic output bounded single source shortest path problem. In: Proceedings of the 7th annual ACM–SIAM symposium on discrete algorithms, Atlanta, GA, pp 212–221
Giladi R, Korach E, Ohayon R (2004) Path selection under multiple QoS constraints—a practical approach. J High Speed Netw 13(2):155–167
Narvaez P, Siu K-Y, Tzeng H-Y (2000) New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans Netw 8(6):734–746
Narvaez P, Siu K-Y, Tzeng H-Y (2001) New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Trans Netw 9(6):706–718
Rastogi R, Breitbart Y, Garofalakis M, Kumar A (2003) Optimal configuration of OSPF aggregates. IEEE/ACM Trans Netw 11(2):181–194
Sengupta S, Saha D, Chaudhuri S (2002) Analysis of enhanced OSPF for routing lightpaths in optical mesh networks. In: Proceedings of IEEE international conference on communications (ICC 2002), pp 2865–2869
Shaikh A, Dube R, Varma A (2002) Avoiding instability during graceful shutdown of OSPF. In: Proceedings of IEEE twenty-first annual joint conference of the IEEE computer and communications societies, pp 883–892
Sharon O (2001) Dissemination of routing information in broadcast networks: OSPF versus IS-IS. IEEE Netw 15(1):56–65
Xiao B, Cao J, Zhuge Q, Shao Z, Sha EH-M (2004) Shortest path tree update for multiple link state decrements. In: Proceedings of the IEEE global telecommunications conference (Globecom 2004), pp 1163–1167
Xiao B, Zhuge Q, Sha EH-M (2004) Efficient algorithms for dynamic update of shortest path tree in networking. J Comput Appl 11:60–75
Zhang B, Mouftah HT (2002) A destination-driven shortest path tree algorithm. In: Proceedings of the IEEE international conference on communications, April 2002, vol 4, pp 2258–2262
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is partially supported by HK RGC PolyU 5196/04E.
Rights and permissions
About this article
Cite this article
Xiao, B., Cao, J. & Lu, Q. Dynamic SPT update for multiple link state decrements in network routing. J Supercomput 46, 237–256 (2008). https://doi.org/10.1007/s11227-007-0164-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-007-0164-y