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.
Similar content being viewed by others
References
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
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
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
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
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
Liu Z, Chen C (2006) Modeling bittorrent-like peer-to-peer systems. IEEE Commun Lett 10(7):513–515
NCTUns Network Simulator and Emulator website. http://nsl.csie.nctu.edu.tw/nctuns.html
Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596–615
Doe N, Pang CY (1984) Shortest–path algorithms: Taxonomy and annotation. Networks 14(2):275–323
Ahuja RK (1988) Minimum cost-reliability ratio path problem. Comput Oper Res 15(1):83–89
Hu TC (1961) The maximum capacity route problem. Oper Res 9(6):898–900
Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2):153–161
Martins EQV, dos Santos JLE (1997) An algorithm for the quickest path problem. Oper Res Lett 20(4):195–198
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
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
Chen YL (1994) Finding the k quickest simple paths in a network. Inf Process Lett 50(2):89–92
Chen YL (1993) An algorithm for finding the k quickest paths in a network. Comput Oper Res 20(1):59–65
Xue G, Sun H, Ben Rosen J (1998) Fast data transmission and maximal dynamic flow. Inf Process Lett 66(3):127–132
Xue G (2000) Optimal multi-path end-to-end data transmission in networks. In: Fifth IEEE Symposium on Computers and Communications, pp 581–586
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
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
Kang C (2011) Survey of search and optimization of P2P networks. Peer-to-Peer Netw Appl 4(3):211–218
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
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
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)
Napster website. http://www.napster.com
Gnutella website. http://www.gnutella.com
Day M, Rosenberg J, Sugano H (2000) A model for presence and instant messaging. RFC 2778, Internet Engineering Task Force
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
JXTA website. http://www.sun.com/software/jxta
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
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
Cohen B (2003) Incentives build robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer systems, pp 68–72
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
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-012-0175-1