Advertisement

An Efficient Failure Recovery Scheme for Next Generation Network Services Based on Distributed Components

  • Wataru Miyazaki
  • Kazuhiko Kinoshita
  • Hideki Tode
  • Koso Murakami
  • Shinji Kikuchi
  • Satoshi Tsuchiya
  • Atsuji Sekiguchi
  • Tsuneo Katsuyama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5297)

Abstract

With advances of information and communication technologies, many network services can be provided by assortment of desired components running on some nodes in the network, like a distributed component based service. It is effective to reduce the cost of service development. In addition, when a failure occurs, a distributed component based service has multiple components of each function, which can be used to replace the failed component. There is another problem, however a component failure affects the application servers using it. Therefore, in this paper, we propose a novel failure recovery scheme that constructs overlay networks between components having the same function and that provides an efficient search method for the substitute component using these multiple overlay networks. Finally, simulation experiments demonstrate the excellent performance of the proposed scheme.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Weerawarana, S., Curbera, F., Leymann, F., Storey, T., Ferguson, D.F.: Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS-Addressing, WS-BPEL, WS-Reliable Messaging, and More. Prentice Hall, Englewood Cliffs (2005)Google Scholar
  2. 2.
    Lee, C., Knight, D.: Realization of the next-generation network. IEEE Communications Magazine 43, 34–41 (2005)CrossRefGoogle Scholar
  3. 3.
    Falcarin, P., Licciardi, C.A.: Technologies and Guidelines for Service Creation in NGN, Technical-scientific Magazine of Telecom Italia Lab Researchers (December 2003)Google Scholar
  4. 4.
  5. 5.
    Al-Masri, E., Mahmoud, Q.H.: A Framework for Efficient Discovery of Web Services across Heterogeneous Registries. In: 4th IEEE Consumer Communication and Networking Conference (CCNC 2007), pp. 415–419 (January 2007)Google Scholar
  6. 6.
    Al-Masri, E., Mahmoud, Q.H.: Discovering the best web service. In: Proceedings of the 16th international conference on World Wide Web, pp. 1257–1258 (May 2007)Google Scholar
  7. 7.
    Ran, S.: A model for web service discovery with QoS. ACM SIGecom Exchanges 4, 1–10 (2003)CrossRefGoogle Scholar
  8. 8.
    Hao, Y., Zhang, Y.: Web services discovery based on schema matching. In: ACM International Conference Proceeding Series, vol. 244, pp. 107–113 (January 2007)Google Scholar
  9. 9.
    Tode, H., Wada, M., Kinoshita, K., Masaki, T., Murakami, K.: Enhanced Flooding Algorithms Introducing the Concept of Biotic Growth. IEICE Trans. Commun., Special Section on Ubiquitous Networks E88-B(3), 903–910 (2005)Google Scholar
  10. 10.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. ACM SIGCOMM Computer Communication Review 29, 251–263 (1999)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Wataru Miyazaki
    • 1
  • Kazuhiko Kinoshita
    • 1
  • Hideki Tode
    • 2
  • Koso Murakami
    • 1
  • Shinji Kikuchi
    • 3
  • Satoshi Tsuchiya
    • 3
  • Atsuji Sekiguchi
    • 3
  • Tsuneo Katsuyama
    • 3
  1. 1.Department of Information NetworkingOsaka UniversityJapan
  2. 2.Department of Computer Science and Intelligent SystemsOsaka Prefecture UniversityJapan
  3. 3.Organic Computing Lab., Fujitsu Laboratories LimitedJapan

Personalised recommendations