Skip to main content

Advertisement

Springer Nature Link
Log in

Fast Fourier transform based efficient data processing technique for big data processing speed enhancement in P2P computing environment

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Recently, as the mobile phone technology has been developed, apps used on mobile phones have also been developed rapidly in P2P cloud computing environment. In particular, as the IoT(Internet of Things) technology has been grafted on mobile phones, large and small data have been diversified centering on P2P computing environments. However, due to the diverse sizes and uses of big data used in P2P environments, users have many complaints regarding the low accuracy of big data search results and service delay. Previous studies have been actively researched to develop a technology that can cheaply construct and efficiently utilize IT infrastructure for big data processing. In particular, research has been conducted on technologies in which a large number of servers distribute and manage a huge amount of data generated or processed from a portable device such as a smartphone. However, existing researchers do not only store and manage big data, but also need additional data latency and service delay prevention technology to cope with various problems flexibly and to prevent service interruption. Currently, there are many researchers, but until now, there has been no research to satisfy user’s search delay time and accuracy by using size and usage of big data. This paper proposes a fast Fourier transform-based efficient data processing scheme so that users can accurately search for desired data out of different kinds (size, use, type, etc.) of big data in P2P cloud computing environment. The proposed scheme utilizes the keywords used by users to search big data as coefficients of polynomial expressions with a view to enhancing polynomial expression transformation speeds. In addition, the proposed scheme organized the coefficients of polynomial expressions that constitute subnets in pairs with probability values for processing in linkage with each other to enhance data accessibility. In particular, the proposed scheme transforms the vectors shown using the coefficients of polynomial expressions in pairs with the polynomial expressions so that searched data can be quickly identified thereby minimizing user service delay time. As a result of the performance evaluation, the data processing time was improved by 7.3% on average compared with the existing techniques and the server’s data processing rate per unit time was improved by 11.1% on average compared to existing techniques. In addition, according to the data size, the communication delay time between the server and the user improved by an average of 8.9% and server overhead was 10.4% lower than the existing techniques on average.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Jung YC (2012) Big data revolution and media policy issues. In Proc. of KISDI premium report 12(2):1–22

  2. Son SY (2013) Big data, online marketing, and privacy protection. In Proc. of KISDI premium report 13(1):1–26

  3. Tankard C (2012) Big data security. In proc. of Netw Secur 5–8

  4. Manyika J, Chui M, Brown B, Bughin J, Dobbs R, Roxburgh C, Byers AH (2011) Big data: the next frontier for innovation. competition, and productivity. In Proc. of Mckinsey global institute pp.1–137

  5. Shen P, Zhou Y, Chen K (2013) A Probability Based subnet selection method for hot event detection in Sina Weibo microblogging. In Proc. of the 2013 IEEE/ACM international conference on advances in social networks analysis and mining 1410–1413

  6. Chen K, Zhou Y, Zha H, He J, Shen P, Yang X (2013) Cost-effective node monitoring for online hot event detection in Sina Weibo. In Proc. of the 22nd international conference on world wide web ACM. 107–108

  7. Kempe D, Klenberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In Proc. of the ninth ACM SIGKDD international conference on knowledge discovery and data mining 137–146

  8. Demchenko Y, De Laat C, Membrey P (2014) Defining architecture components of the big data ecosystem. In Proc. of the 2014 international conference on collaboration technologies and systems (CTS) 104–112

  9. Fowles GR (1989) Introduction to modern optics. Dover, New York

    Google Scholar 

  10. Gauss CF (1866) Nachlass: Theoria interpolationis methodo nova tractata. onigliche Gesellschaft der Wissenschaften 3:265–327

    Google Scholar 

  11. Heideman MT, Johnson DH, Burrus CS (1984) Gauss and the history of the fast Fourier transform. In Proc of IEEE ASSP Magazine 1(4):14–21

  12. Sorensen HV, Jones DL, Heideman MT, Burrus CS (1987) Real-valued fast Fourier transform algorithms. In proc. of IEEE Trans Acoust Speech Signal Process 35(6):849–863

  13. Hu H, Wen Y, Chua TS, Li X (2014) Toward scalable Systems for big Data Analytics: a technology tutorial,” In proc. of IEEE Access. 2:652–687

  14. Paryasto M, Alamsyah A, Rahardjo B (2014) Kuspriyanto, “big-data security management issues. In Proc. of the 2nd international conference on information and communication technology(ICoICT). 59–63

  15. R. H. Weber, “Internet of Things: New Security and Privacy Challenges,” In Proc. of Computer Law & Security Review, Vol. 26, No. 1, pp. 23–30, 2010

  16. H. Gao, J. Yan, and Y. Mu, “Dynamic trust model for federated identity management,” In Proc. of the 4th international conference on network and system security(NSS), pp. 55–61, 2010

  17. H. S. Ning, H. Liu, Yang L.T. “Cyberentity security in the internet of things,” in proc. of Computer, Vol. 46, No. 4, pp. 46–53, April 2013

  18. Tobias Heer, Oscar Garcia-Morchon, Rene Hummen, Sye Loong Keoh, Sandeep S Kumar, and Klaus Wehrle, “Security challenges in the IP-based internet of things,” In proc. of Wirel Pers Commun, Vol. 61, No. 3, pp. 527–542, 2011

  19. Park SO (2009) The framework for providing compatibility to various web browser plug-ins. Master's Thesis, KAIST

    Google Scholar 

  20. B. B. Miao, X. B. Jin, “Compression processing estimation method for time series big data,” In Proc. of the 27th Chinese control and decision conference(2015 CCDC), pp. 1807–1811, 2015

  21. C. Barbieru and F. Pop, “Soft real-time Hadoop scheduler for big data processing in smart cities,” In Proc. of the 2016 I.E. 30th international conference on advanced information networking and application(AINA), pp. 863–870, Mar. 2016

  22. Kim JT, Oh BJ, Park JY (2013) Standard trends for the BigData technologies. In Proc. of 2013 electronics and telecommunications trends 28(1) 92–99

  23. T. Joelsson, Mobile web browser extensions, master of science thesis, KTH information and communication Technology, 2008

Download references

Acknowledgements

This Research was supported by the Tongmyong University Research Grants 2017.

Author information

Authors and Affiliations

  1. Department of Information and Communication Convergence Engineering, Mokwon University, 88 Doanbuk-ro, Seo-gu, Daejeon, 302-729, South Korea

    Yoon-Su Jeong

  2. Department of Information Security, Tongmyong University, 428, Sinseonno, Nam-gu, Busan, 608-711, South Korea

    Seung-Soo Shin

Authors
  1. Yoon-Su Jeong
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Seung-Soo Shin
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Seung-Soo Shin.

Additional information

This article is part of the Topical Collection: Special Issue on Convergence P2P Cloud Computing

Guest Editor: Jung-Soo Han

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jeong, YS., Shin, SS. Fast Fourier transform based efficient data processing technique for big data processing speed enhancement in P2P computing environment. Peer-to-Peer Netw. Appl. 11, 1186–1196 (2018). https://doi.org/10.1007/s12083-018-0652-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0652-2

Keywords