未來研究方向

在完成本篇論文，中間經過了許多的困難與問題，也受到許多人的幫 助，讓我可以堅持而完成論文，同時受到許多人所給予的指正及建 議，使本論文得以更加完善。但時間匆促，本架構仍有許多不足和考 量不夠的地方，列舉如下，以期作為後續改善或應用於不同環境。

本論文所展現的方法是一個同時利用多重路徑法與BitTorrent的架 構、適於多媒體電子廣告的分眾性及大量資料的傳送，而這個方法是 不是可以轉用於不同的應用上，就必須考慮本論文所提出的特性是否 適合該應用。

因多媒體電子廣告所構成的封閉式對等網路，是因為其商業的考量，

以期望有封閉和穩定的特性。同時，也使得我們未考慮到非封閉式的 網路特性時，要如何達到負載平衡的問題，所以要應用不同網路環境 時，必須考慮到不同網路環境的特性及傳送時的網路情況，才不致於 發生擁塞的情況。

而本論文所提出的方法，首先要由派送系統的伺服器從多媒體電子廣 告資料庫中取出必要的廣告，帶和叢集中的中繼點採取一對一的傳送 工作，雖然簡化了操作流程，但也形成所有的廣告都要先由此一要徑

參 考 文 獻

1. Bezjian-Avery, A., B. Calder and D. Iacobucci, New media interactive advertising vs. traditional advertising, Journal of Advertising Research, Vol. 38, No. 4 (July), pp.

23-32,1998.

2. Jeff Sauer. Picture This: Digital Signage, Sound & Video Contractor, P20-22, 2004.

3. Sanju Khatri, Digital-signage market generates new opportunities, iSuppli/Stanford Resources, 2004.

4. Sanju Khatri, Dynamic Digital Signage Captures InfoComm＇s Attention: Market Expected to Grow to US$1.2 Billion in 2007, iSuppli/Stanford Resources, 2003.

5. Matthew Tullman, Ready For Take Off -Getting Beyond The Pilot In Dynamic Digital Signage, Systems Contractor News New York, P 62. , 2004.

6. Robert W Rycroft, Don E Kash.. Managing complex

networks--key to 21st century innovation success, Research Technology Management, Washington: May/Jun 1999. Vol. 42, Iss. 3; p. 13, 1999.

7. Marianne Wilson, Signage Goes Digital, Chain Store Age, P75-76, 2004.

8. Y.L. Chen and Y.H Chin, The quickest path problem, Comput.

Oper. Res. 17,153-161,1990.

9. J.B. Rosen, S.-Z. Sun and G. -L. Xue, ALGORITHMS FOR THE QUICKEST PATH PROBLEM AND THE ENUMERATION OF QUICKEST PATHS, Computers Ops Res. Vol. 18, No.6, pp.579-584,1991.

10. Y.L. Chen, Finding the k quickest simple paths in a network, Information Processing Letters 50, 89-92, 1994.

11. Y.L. Chen, AN ALGORITHM FOR FINDING THE k QUICKEST PATHS IN A NETWORK, Computer Ops Res. Vol. 20, No. 1, pp. 59-65, 1993.

12. Guoliang Xue, Optimal Multi-Path End-to-End Data Transmission in Networks, IEEE, 2000.

13. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J.ACM., Vol.34, pp. 596-615, 1987.

14. N Doe and C-Y Pang, Shortest-path algorithms : taxonomy and annotation. Networks, Vol.14, pp.275-323, 1984.

15. R.K. Ahuja, Minimum cost-reliability ratio problem,

Computers and Operations Research, Vol. 16, pp.83-89, 1988.

16. T. C. Hu, The Maximum Capacity Route Problem, Operations Research, Vol. 9, No. 6, pp. 898-900, 1961

17. Ernesto de Queiros Vieira Martins, Jose Luis Esteves dos Santos, An algorithm for the quickest path problem.

Operations Research Letters 20, pp. 195-198, 1997.

18. Guo-Liang Xue, Shang-Zhi Sun, J.Ben Rosen, Minimum Time Message Transmission in Networks, IEEE, 1992.

19. Guoliang Xue, Hsangzhi Sun, J.Ben Rosen, Fast data transmission and maximal dynamic flow, Information Processing Letters 66, pp. 127-132, 1998.

20. G. White, E. Fisch, U. Pooch, Computer System and Network Security, CRC Press, Inc., 1996.

21. Kalogeraki, V., Chen, F., Managing distributed objects in peer-to-peer systems, Network, Vol. 18, pp. 22-29, 2004.

22. A. Crespo and H. Garcia-Molina, Routing Indices For Peer-to -Peer Systems, In Proceedings of the 22nd International Conference on Distributed Systems, pages 23--32, Vienna, Austria, 2002.

24. M. Ripeanu, I. Foster, and A. Iamnitchi, Mapping the Gnutella Network: Properties of Large-Scale Peer-To-Peer Systems and Implications for System Design, IEEE Internet Computing, Vol. 6, No. 1, pp.50-57, January-February 2002.

25. Choi Y, Park D, Associativity based clustering and query stride for on-demand routing protocols in ad hoc networks, JOURNAL OF COMMUNICATIONS AND NETWORKS 4 (1): 4-13 MAR 2002 26. Liang J, Kumar R, Ross KW, The FastTrack overlay: A

measurement study, COMPUTER NETWORKS 50 (6): 842-858 APR 13 2006.

27. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, ACM SIGCOMM 2001, San Deigo, CA, pp. 149-160, August 2001.

28. Pastry : A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November, 2001

29. Izal M, Urvoy-Keller G, Biersack EW, Felber PA, Al Hamra A, Garces-Erice L, Dissecting BitTorrent: Five months in a torrent's lifetime, PASSIVE AND ACTIVE NETWORK MEASUREMENT LECTURE NOTES IN COMPUTER SCIENCE 3015: 1-11 2004

30. Ziqian Liu, Student Member, IEEE, and Changjia Chen, Senior Member, IEEE, Modeling BitTorrent-like Peer-to-Peer Systems, IEEE COMMUNICATIONS LETTERS, VOL. 10, NO. 7, JULY 2006

31. 鄭宏揚，點對點多重路徑網路之最佳化分析，義守大學資訊工程研究所，

2003。

32. 陳積弘，DLC：可擴展式點對點查詢與資料分享架構，交通大學資訊工程研

究所，2005。