Skip to main content
Log in

A novel method for delivering multimedia e-advertisement data base on use multi-path and multi-seed peer-to-peer-like approach

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

Abstract

With the fact that digital signage are characterized for the variable and abundant multimedia visual and audio expressions and exhibit advantages of multiplicity, locality, real-time, segmentation, and existence, they have been predicted to emerge as the major trend in the future advertising in various surveys. Focused on the characteristics of disseminating the multimedia electronic advertisements through the network, there will be an enormous amount of data transmitted and various electronic advertising distributed in accordance with the regions. To specifically address these needs, we will propose a multi-path, multi-seed dissemination approach suitable for the delivery of the multimedia electronic advertisements. In this paper, within a peer-to-peer network structure, the network cluster will be first formed in accordance with the locality. Based on each cluster’s locality, the electronic advertisements designated for dissemination into a specific cluster can then be determined. We then apply the seed concept formed by BitTorrent to segment the entire multimedia electronic advertisement into myriad seeds. At the same time, this paper adopts the Optimal Multi-Path Routing proposed by Guoliang Xue to design a peer-to-peer-like multiple multi-path framework, followed by the distribution of myriad seeds into each node within the cluster. Each node’s bandwidth will also be utilized to complete the re-transmission of the multimedia electronic advertisement for achieving the objective of establishing multimedia electronic advertisement on each node. The NCTUns Network Simulator and Emulator was utilized to simulate the transmission status for variable number of node. The approach proposed by this manuscript can be applied to different set-up parameters and data size. The experimental results indicate that the key determining factor of transmission time under the multi-path and multi-seed dissemination approach is the data size. Transmitting the same data size under a multi-path and multi-seed approach does not increase the transmission time as the number of nodes increase. Simulations demonstrate that the multi-path and multi-seed dissemination approach is suitable for the delivery of the multimedia electronic advertisements.

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

Access this article

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
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Newman A, Dennis C, Wright LT, King T (2010) Shoppers’ experiences of digital signage-a cross-national qualitative study. Int J Digit Content Technol Appl 4(7):50–57

    Article  Google Scholar 

  2. Suqiura K, Dayarathna M, Withana A (2010) Design and implementation of distributed and scalable multimedia signage system. In: IEEE 2010 Second International Conference on Ubiquitous and Future Networks (ICUFN), pp 273–278

  3. Dennis C, Newman A, Michon R, Brakus J, Wright L (2010) The mediating effects of perception and emotion: Digital signage in mall atmospherics. J Retail Consum Serv 17(3):205–215

    Article  Google Scholar 

  4. Yu KM, Yu CY, Yeh BH, Hsu CH, Hsieh HN (2010) The design and implementation of a mobile location-aware digital signage system. In: IEEE 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pp 235–238

  5. Chen Q, Malric F, Zhang Y, Abid M, Cordeiro A, Petriu E, Georganas N (2009) Interacting with digital signage using hand gestures. In: ICIAR ’09 Proceedings of the 6th International Conference on Image Analysis and Recognition, pp 347–358

  6. Liu Z, Chen C (2006) Modeling bittorrent-like peer-to-peer systems. IEEE Commun Lett 10(7):513–515

    Google Scholar 

  7. NCTUns Network Simulator and Emulator website. http://nsl.csie.nctu.edu.tw/nctuns.html

  8. Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596–615

    Article  MathSciNet  Google Scholar 

  9. Doe N, Pang CY (1984) Shortest–path algorithms: Taxonomy and annotation. Networks 14(2):275–323

    Article  MathSciNet  Google Scholar 

  10. Ahuja RK (1988) Minimum cost-reliability ratio path problem. Comput Oper Res 15(1):83–89

    Article  MATH  Google Scholar 

  11. Hu TC (1961) The maximum capacity route problem. Oper Res 9(6):898–900

    Article  Google Scholar 

  12. Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2):153–161

    Article  MATH  MathSciNet  Google Scholar 

  13. Martins EQV, dos Santos JLE (1997) An algorithm for the quickest path problem. Oper Res Lett 20(4):195–198

    Article  MATH  MathSciNet  Google Scholar 

  14. Xue GL, Sun SZ, Ben Rosen J (1992) Minimum time message transmission in networks. In: IEEE Fourth International Conference on Computing and Information, pp 22–25

  15. Rosen JB, Sun SZ, Xue GL (1991) Algorithms for the quickest path problem and the enumeration of quickest paths. Comput Oper Res 18(6):579–584

    Article  MATH  MathSciNet  Google Scholar 

  16. Chen YL (1994) Finding the k quickest simple paths in a network. Inf Process Lett 50(2):89–92

    Article  MATH  Google Scholar 

  17. Chen YL (1993) An algorithm for finding the k quickest paths in a network. Comput Oper Res 20(1):59–65

    Article  MATH  MathSciNet  Google Scholar 

  18. Xue G, Sun H, Ben Rosen J (1998) Fast data transmission and maximal dynamic flow. Inf Process Lett 66(3):127–132

    Article  MATH  Google Scholar 

  19. Xue G (2000) Optimal multi-path end-to-end data transmission in networks. In: Fifth IEEE Symposium on Computers and Communications, pp 581–586

  20. Nishida H, Ngugen T (2011) Optimal client–server assignment for internet distributed systems. In: IEEE 2011 Proceedings of 20th International Conference on Computer Communications and Networks, pp 1–6

  21. Kolahi SS, Chand N, Soorty BK, Qu Z (2010) Performance comparison of IPv4 and IPv6 in peer-peer and client server local area networks. In: 2010 IEEE 10th International Conference on Computer and Information Technology, pp 41–45

  22. Kang C (2011) Survey of search and optimization of P2P networks. Peer-to-Peer Netw Appl 4(3):211–218

    Article  Google Scholar 

  23. Ganjam A, Rao SG, Sripanidkulchai K, Zhan J, Zhang H (2010) On-demand waypoints for live P2P video broadcasting. Peer-to-Peer Netw Appl 3(4):277–293

    Article  Google Scholar 

  24. Harjula E, Ylianttila M, Ala-Kurikka J, Riekki J, Sauvola J (2004) Plug-and-play application platform: Towards mobile peer-to-peer. In: Proceedings of 3rd international conference on Mobile and ubiquitous multimedia, pp 63–69

  25. Schollmerier R (2001) A definition of peer-to-peer networking towards a delimitation against classical client–server concepts. In: Proceedings of the IFIP Workshop on IP and ATM Traffic Management (WATM’01)

  26. Napster website. http://www.napster.com

  27. Gnutella website. http://www.gnutella.com

  28. Day M, Rosenberg J, Sugano H (2000) A model for presence and instant messaging. RFC 2778, Internet Engineering Task Force

  29. Kwok SH, Chan KY (2004) An enhanced Gnutella P2P protocol: A search perspective. In: IEEE 18th International Conference on Advanced Information Networking and Applications, pp 599–604

  30. JXTA website. http://www.sun.com/software/jxta

  31. Liscano R, Jost A, Dersingh A, Hu H (2004) Session-based service discovery in peer-to-peer communications. In: Proceedings of International Conference on Electrical and Computer Engineering, pp 1477–1481

  32. Maibaum N, Mundt T (2002) JXTA: A technology facilitating mobile peer-to-peer networks. In: IEEE International Mobility and Wireless Access Workshop, pp 7–13

  33. Cohen B (2003) Incentives build robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer systems, pp 68–72

Download references

Acknowledgments

The authors would like to express our thanks to Wei-Lung Huang for the discussions which helped us develop the ideas and help with experimental design, and the editor and anonymous reviewers for the helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu-Hsin Cheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, YH., Chen, DJ. A novel method for delivering multimedia e-advertisement data base on use multi-path and multi-seed peer-to-peer-like approach. Peer-to-Peer Netw. Appl. 7, 53–65 (2014). https://doi.org/10.1007/s12083-012-0175-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-012-0175-1

Keywords

Navigation