Skip to main content

Replication between Geographically Separated Clusters - An Asynchronous Scalable Replication Mechanism for Very High Availability

  • Conference paper
  • First Online:
Databases in Telecommunications II (DBTel 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2209))

Included in the following conference series:

  • 207 Accesses

Abstract

In telecommunication systems such as Home Location Registers (HLRs) and AAA-servers (Authentication, Authorization, and Accounting) requirements on availability, real-time, scalability, consistency and persistence (durability) of the data storage are important. A base for high availability, real-time, scalability, and consistency can be achieved by using a distributed real-time main memory database system-implemented on a local cluster of shared nothing processors. Even higher availability and improved persistence can be achieved through an additional level of redundancy, combined with geographical separation. Two or more clusters are separated geographically to protect against site failure or site unreachability, due to any reason, including externally caused disasters such as earthquakes, bombs or fires. A wide-area replication mechanism ensures that the database is always consistent and nearly always complete (up-to-date), at all sites. The persistency requirement on telecommunication systems is usually not as severe as, for example, banking systems. On the other hand, the availability and realtime requirements are usually very high, with milli-second response times and fail-over times of no more than a few seconds when a site fails.

The protocol chosen for replication between the separate sites/clusters can impact both availability and performance. If strict synchronous replication (2PC or 3PC) is imposed on all geographically replicated transactions, then clients will be forced to wait a considerable time on replies from geographically distant sites. A synchronous protocol can also have a tendency to propagate problems-upstream. from one site to others. Finally, if the replication protocol becomes a bottleneck then this will undermine the throughput and scalability of the local cluster.

This paper presents an asynchronous replication mechanism that preserves the availability, scalability, and consistency requirements while at the same time achieving acceptable level of persistency/completeness.

The paper also presents the Ericsson TelORB1 platform including a distributed soft real-time main-memory database system. TelORB and the replication mechanism described here, is already in service in commercial HLRs and other products.

TelORB is a registered trademark of Ericsson. For more information see www.telorb.com

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernstein P., Hadzilacos V., and Goodman N.: Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987

    Google Scholar 

  2. Clustra Systems Inc., 620 3rd Street, Oakland, CA: The Five9s Pilgrimage: Toward the Next Generation of High-Availability Systems, Technical White Paper, 2000.

    Google Scholar 

  3. Breitbart Y., Komondoor R., Rastogi R., Seshadri S., and Silberschatz A.: Update Propagation Protocols For Replicated Databases, In Proc. of ACM SIGMOD Int.l Conf. on Management of Data, Philadelphia, Pennsylvania, June 1999.

    Google Scholar 

  4. Garcia Molina H.: Performance of Update Algorithms for Replicated Data in a Distributed Database, TR STAN-CS-79-744, CS Dept., Stanford Univ., Stanford CA, June 1979.

    Google Scholar 

  5. Gray J. and Reuter A.: Transaction Processing: Concepts and Techniques, Morgan Kaufman Publishers, San Mateo, CA, 1993.

    MATH  Google Scholar 

  6. Huang Y. and Kintala C.: Software Implemented Fault Tolerance: Technologies and Experience, In Proc. of the 23rd Int.l Symp. on Fault-Tolerant Computing, Austin Texas, June 1993.

    Google Scholar 

  7. IBM, New Orchard Road, Armonk, NY 10504 (USA). DB2: Replication Guide and Reference, SC26-9642-00, June 1999.

    Google Scholar 

  8. Lee I., Iyer R.: Software Dependability in the Tandem GUARDIAN System, In IEEE Transactions on Software Engineering, Vol. 21, No 5, May 1995.

    Google Scholar 

  9. [LNPR99] Lindström J., Niklander T., Porkka P., Raatikainen K.: A Distributed Real-Time Main-Memory Database for Telecommunication, In Proc. of the Workshop on Databases in Telecommunications, Edinburgh, September 6 1999.

    Google Scholar 

  10. Lyon J.: Tandem.s Remote Data Facility, In Proc. of IEEE Compcon, 1990

    Google Scholar 

  11. Oracle Corporation, 500, Oracle Parkway, Redwood City, CA 94065. Oracle8itm Advanced Replication, Technical White Paper, November 1998.

    Google Scholar 

  12. Sullivan M. and Stonebraker M: Using Write Protected Data Structures To Improve Software Fault Tolerance in Highly Available Database Management Systems. In the 17th Int.l Conf. On Very Large Databases (VLDB), September 1991

    Google Scholar 

  13. Hennert L. and Larruy A: TelORB-The distributed communications operating system, Ericsson Review No. 03, 1999

    Google Scholar 

  14. TimesTen Performance Software: Data Replication and TimesTen. High-Availability for the Next Generation, Technical White Paper, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Björnerstedt, A., Ketoja, H., Sintorn, J., Sköld, M. (1999). Replication between Geographically Separated Clusters - An Asynchronous Scalable Replication Mechanism for Very High Availability. In: Jonker, W. (eds) Databases in Telecommunications II. DBTel 2001. Lecture Notes in Computer Science, vol 2209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45432-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45432-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42623-3

  • Online ISBN: 978-3-540-45432-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics