Abstract
An 11-router Internet Protocol network model based on the Open Shortest Path First (OSPF) routing protocol and Link State Advertisement (LSA) is expressed in the Specification and Description Language (SDL). The corresponding simulation data to verify the performance of a proposed more efficient OSPF LSA refreshment function is presented. Network traffic generated by the routing table refreshment activity using the new function is compared to the traffic generated in the Internet today when using the existing LSA refreshment function. The relative performance characteristics were found to depend on the number of LSA packets per router and the router startup sequence. Such dependencies when using protocol standards in natural language are not always visible until a number of implementations of the standard become available and tested in the field. SDL and tools provide an inexpensive but reliable way of verifying protocols under development in advance of implementation and final agreement.
Special acknowledgement is made to Dr. Ramachandra Munikoti of Nortel Networks Corporation for his guidance on the project and his contribution to the business value concepts and criteria used in this paper.
This is a preview of subscription content, log in via an institution to check access.
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
John T. Moy, OSPF, Anatomy of an Internet Routing Protocol, Addison-Wesley Longman Inc., 1998.
John T. Moy, OSPF Version 2, Internet Engineering Task Force Request For Comment 2328, April 1998.
Zinin, A., Guidelines for Efficient LSA Refreshment in OSPF, Internet Engineering Task Force Internet-Draft, draft-ietf-ospf-refresh-guide.01.txt, July, 2000.
ITU-T, Languages for Telecommunication Applications-Specification and Description Language (SDL-2000). Geneva, ITU, 1999. ITU-T Recommendation Z.100 (11/99).
ITU-T, Languages for Telecommunication Applications-Message Sequence Charts (MSC-2000). Geneva, ITU, 1999. ITU-T Recommendation Z.100 (11/99).
Buhr, R.J.A., Use Case Maps as Architectural Entities for Complex Systems, IEEE Transactions on Software Engineering, Special Issue on Scenario Management, Vol. 24, No. 12, December 1998.
A. Miga, D. Amyot, F. Bordeleau, D. Cameron, M. Woodside, Deriving Message Sequence Charts from Use Case Maps Scenario Specifications, this volume.
Igor S. Sales, Robert L. Probert, From High-Level Behaviour to High-Level Design: Use Case Maps to Specification and Description Language, SBRS 2000, Simpósio Brasileiro de Redes de Computadores, Belo Horizonte, Minas Garais, Brazi, May, 2000.
Telelogic Inc., Telelogic Tau 4.0, Telelogic AB, Malmo Sweden, February, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monkewich, O., Sales, I., Probert, R. (2001). OSPF Efficient LSA Refreshment Function in SDL. In: Reed, R., Reed, J. (eds) SDL 2001: Meeting UML. SDL 2001. Lecture Notes in Computer Science, vol 2078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48213-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-48213-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42281-5
Online ISBN: 978-3-540-48213-0
eBook Packages: Springer Book Archive