Skip to main content

Scalable Distributed Data Analysis on Structured P2P Network

  • Conference paper
  • First Online:
Advances in Network-Based Information Systems (NBiS 2017)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 7))

Included in the following conference series:

  • 1493 Accesses

Abstract

In recent years, a lot of Internet of Things (IoT) devices have been developed, so we can obtain a huge amount of data (big data) from the IoT devices. In order to utilize the big data, a scalable data analysis system is required. Therefore, in this paper, I propose a scalable distributed data analysis system on a structured P2P network. In the proposed system, the IoT devices communicate with each other as nodes of a ring-type structured P2P network such as Chord. When a node requests a data analysis process, each node performs a part of the data analysis process, and the request node aggregates the partial analysis results. In my previous study, I made a scalable distributed aggregation system which calculates summations or averages of values obtained by each node. The proposed system is an extended system of the previous study, but the proposed system supports not only simple data aggregation but also data analysis such as Principal Component Analysis. In this paper, I explain how to analyze big data on a structured P2P network. In addition, I also present some simulation results, and I show that the amount of communication data required for each node is \(O(\log N)\), where N is the number of nodes.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

References

  1. Abe, K., Abe, T., Ueda, T., Ishibashi, H., Matsuura, T.: Aggregation skip graph: a skip graph extension for efficient aggregation query over P2P networks. Int. J. Adv. Internet Technol. 4(3), 103–110 (2012)

    Google Scholar 

  2. Alsheikh, M.A., Lin, S., Niyato, D., Tan, H.P.: Machine learning in wireless sensor networks: algorithms, strategies, and applications. IEEE Commun. Surv. Tutor. 16(4), 1996–2018 (2014)

    Article  Google Scholar 

  3. Aspnes, J., Shah, G.: Skip graphs. ACM Trans. Algorithms 3(4), 37 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Graffi, K., Stingl, D., Rueckert, J., Kovacevic, A., Steinmetz, R.: Monitoring and management of structured peer-to-peer systems. In: Proceedings of the 9th International Conference on Peer-to-Peer Computing, P2P 2009, pp. 311–320 (2009)

    Google Scholar 

  5. Liang, Y., Balcan, M.F.F., Kanchanapally, V., Woodruff, D.: Improved distributed principal component analysis. In: Advances in Neural Information Processing Systems, vol. 27, pp. 3113–3121 (2014)

    Google Scholar 

  6. Macua, S.V., Belanovic, P., Zazo, S.: Consensus-based distributed principal component analysis in wireless sensor networks. In: Proceedings of the 11th International Workshop on Signal Processing Advances in Wireless Communications (2010)

    Google Scholar 

  7. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, pp. 161–172 (2001)

    Google Scholar 

  8. Schulz, S., Blochinger, W., Hannak, H.: Capability-aware information aggregation in peer-to-peer grids. J. Grid Comput. 7(2), 135–167 (2009)

    Article  Google Scholar 

  9. Schütt, T., Schintke, F., Reinefeld, A.: Range queries on structured overlay networks. Comput. Commun. 31(2), 280–291 (2008)

    Article  Google Scholar 

  10. Shafaat, T.M., Ghodsi, A., Haridi, S.: A practical approach to network size estimation for structured overlays. Lecture Notes Computer Science, vol. 5343, pp. 71–83 (2008)

    Google Scholar 

  11. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  12. Takeda, A., Oide, T., Takahashi, A., Suganuma, T.: Accurate data aggregation on unstable structured P2P network. In: Proceedings of the 29th IEEE International Conference on Advanced Information Networking and Applications, AINA 2015, pp. 542–549 (2015)

    Google Scholar 

  13. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 (2004)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by a Grant-in-Aid for Information Communication Technology of the Telecommunications Advancement Foundation, Japan.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atsushi Takeda .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Takeda, A. (2018). Scalable Distributed Data Analysis on Structured P2P Network. In: Barolli, L., Enokido, T., Takizawa, M. (eds) Advances in Network-Based Information Systems. NBiS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 7. Springer, Cham. https://doi.org/10.1007/978-3-319-65521-5_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65521-5_65

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65520-8

  • Online ISBN: 978-3-319-65521-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics