臺灣博碩士論文加值系統

近年來點對點(P2P)檔案分享機制被廣為討論，隨著網際網路的使用者快速的成長，有越來越多的應用都是直接使用在網際網路環境上，使得許多應用耗掉了許多不必要的網路資源(如網路頻寬)。所以，點對點的檔案分享技術可以視為一種可以在分散式環境中用來分享且分散資源的一種技術與應用。點對點應用有很多好處，包括可以改善檔案分享的延展性、避免檔案一致性的問題以及使用較少的硬體需求。然而，隨著點對點應用的成熟以及智慧型運輸系統越來越熱門，我們試著想讓車間環境中也可以達到檔案分享的技術。因此，我們提出了一個架構與機制運用在車間環境上。並且希望可以利用點對點的結構化網路所以使用的分散式雜湊函數表(DHT)技術達到分享檔案於車間環境的可行性。我們也試著討論智慧型運輸系統這個議題使得車間通訊的應用可能更加的多元且廣泛的被使用。

Peer-to-Peer (P2P) file share issue is a widely studied in recent years. With the user of the Internet increasing rapidly, more and more applications perform by Internet. So, P2P refers to a class of system and application that employ distributed resources to perform a critical function in a decentralized environment. There are many benefits of P2P application include improve the scalability and avoid dependency problems、less infrastructures and can help to find out resources rapidly.
By using P2P application, we try to share file on Vehicle-to-Vehicle (V2V) environment. Because of Vehicle-to-Vehicle data communication issue is more and more popularly. We proposed a novel architecture on the V2V environment, hope to delivery data by using DHT-based scheme (Chord-Ring) [1] on structured P2P network.
Finally, we try to discuss this issue and hope to run applications of peer to peer on V2V environment. Moreover, with this architecture, it not only can use P2P network advantages fully but also make the applications of V2V communication more extensively.

ACKNOWLEDGEMENTS I
ABSTRACT II
摘要 III
LIST OF FIGURES V
LIST OF TABLES VI
CHAPER 1 1
INTRODUCTION 1
1.1 Motivations 1
1.2 Background 2
1.3 Architectures and Systems 4
CHAPTER 2 8
BACKGROUNDS 8
2.1 Peer to Peer Overlay Network 8
2.2 Kinds of the P2P Network Architecture 10
2.3 JXTA 23
2.4 Multicasting and routing 26
CHAPTER 3 30
PROPOSED SCHEMES 30
3.1 Flooding the Request Messages 30
3.2 Use AODV Routing Protocol to Deliver Request Messages 31
3.3 Cluster-Based-Topology (CBT) Architecture 31
3.4 Search File on CBT and Chord Architecture 36
3.5 Flow Chart 39
3.6 File Delivery on CBT and Chord Architecture 40
CHAPTER 4 42
SIMULATION RESULTS 42
4.1 Simulation Tools 42
4.2 Our Simulate Environment 42
4.3 Use NS2 to Simulate V2V Communications 44
4.4 Use P2Psim to Simulate Chord Algorithm 50
CHAPTER 5 51
CONCLUSIONS 51
REFERENCES 52

[1] Stoica I., Morris R., Liben-Nowell D., Karger D.R., Kaashoek M.F., Dabek F. and Balakrishnan H., ”Chord :a scalable peer-to-peer lookup protocol for Internet applications,” in Networking, IEEE/ACM Transactions on, pp. 17-32, 2003.
[2] Napster [Online]. Available: http://free.napster.com/
[3] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker, “A scalable content-addressable network”, in Proceedings of SIGCOMM, Aug 2001.
[4] “Secure Hash Standard, ” U.S Dept. Commerce/NIST, National Technical Information Services, Spring-Field, VA, FIPS 180-1, Apr. 1995.
[5] Internet ITS Consortium, http://www.internetits.org.
[6] Dedicated Short Range Communications Project
http://www.leearmstrong.com/DSRC/ DSRCHomeset.htm.
[7] Gnutella [Online]. Available: http://www.gnutella.com/
[8] U.S. Court of Appeals for the Ninth Circuit [Online]. Available: http://www.ca9.uscourts.gov/
[9] Edonkey [Online]. Available: http://en.wikipedia.org/wiki/EDonkey_network
Available: http://www.edonkey2000.com/
[10] Kademlia [Online]. Available: http://zh.wikipedia.org/wiki/Kademlia
[11] Morpheus [Online]. Available: http://www.morpheussoftware.net/
[12] A. Rowstron, P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in IFIP/ACM International Conference on Distributed System Platform, 2001.
[13] Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John Kubiatowicz, ”Tapestry: A Resilient Global-scale Overlay for Service Deployment,”IEEE Journal on Selected Areas in Communications, January 2004.
[14] JXTA [Online]. Available: https://jxta.dev.java.net/
[15] Coolstreaming [Online]. Available: http://www.coolstreaming.org/
[16] Skype [Online]. Available: http://www.skype.com/
[17] S. Lee, W. Su, and M. Gerla, “Ad hoc Wireless Multicast with Mobility Prediction”, Proceeding of IEEE ICCCN'99, Boston, MA, pp. 4-9, 1999.
[18] W. Su, “Motion Prediction in Mobile/Wireless Networks”, PhD Dissertation, UCLA Computer Science Department, Los Angeles, CA, 1999.
[19] M. Takai et al., “GloMoSim: A Scalable Network Simulation Environment”, Technical report 990027, UCLA, Computer Science Department, 1999.
[20] Tein-Yaw Chung, Chia-Hung Tsai, Ming-Hong Wu, Ming-Yen Lai. “Architecture and Implementation of Cluster-based Peer-to-Peer Topology and Its Application in Search”, in Journal of Internet Technology (JIT), Jan 2006.
[21] P2Psim [Online]. Available: http://pdos.csail.mit.edu/p2psim/index.html