請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/18441完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 施吉昇 | |
| dc.contributor.author | Zi-You Yeh | en |
| dc.contributor.author | 葉姿佑 | zh_TW |
| dc.date.accessioned | 2021-06-08T01:05:22Z | - |
| dc.date.copyright | 2014-08-25 | |
| dc.date.issued | 2014 | |
| dc.date.submitted | 2014-08-20 | |
| dc.identifier.citation | [1] Metrolink, “An Introduction to Positive Train Control, Metrolink works toward implementing
system wide Positive Train Control,” http://www.metrolinktrains.com/ agency/page/ title/ ptc. [2] “2013 taiwan power company sustainability report, p.2, p.8,” http://www.taipower. com.tw/, Taipower_English_EBook.pdf. [3] “Distributed generation interconnect,” https://www.gedigitalenergy.com/smartgrid_ generation.htm. [4] D. Newman, “RFC 2647, Data Communications, Benchmarking Terminology for Firewall Performance,” http:// tools.ietf.org/ pdf/ rfc2647.pdf , August 1999. [5] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proceedings of the 16th international conference on Supercomputing. ACM, 2002, pp. 84–95. [6] “Depth-first search,” http://en.wikipedia.org/wiki/Depthdiscretionary{-}{}{}first_ search. [7] “The Network Simulator - NS2),” http://www.isi.edu/nsnam/ns/,http://nsnam.isi. edu/nsnam/index.php/Main_Page. [8] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” in Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA’99. Second IEEE Workshop on. IEEE, 1999, pp. 90–100. 39 [9] R. V. Boppana and S. P. Konduru, “An adaptive distance vector routing algorithm for mobile, ad hoc networks,” in INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3. IEEE, 2001, pp. 1753–1762. [10] R. Perlman, “A comparison between two routing protocols: Ospf and is-is,” Network, IEEE, vol. 5, no. 5, pp. 18–24, 1991. [11] C. Diot, W. Dabbous, and J. Crowcroft, “Multipoint communication: A survey of protocols, functions, and mechanisms,” Selected Areas in Communications, IEEE Journal on, vol. 15, no. 3, pp. 277–290, 1997. [12] Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic broadcast for flooding in wireless mobile ad hoc networks,” in Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, vol. 2. IEEE, 2003, pp. 1124–1130. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/18441 | - |
| dc.description.abstract | 網路技術目前已發展出許多對於提高訊息傳送效率的方法，針對異質網路的設計也常見於現實部網中。其中洪水演算法為高可靠度的傳送方式，常見於廣播等使用。但在點對點(Peer-to-Peer, P2P)的網路中，此演算法會產生重複多餘的訊息而造成資源的浪費。
本論文提出改良式的洪水演算法，有效改善了上述的問題。在不影響傳輸可靠度的情況下， 提升了有效吞吐量，大幅降低傳輸成本。 實驗的結果分析也有助於未來在已知設備的頻寬與數量下， 可依其比例關係設計出具最佳有效吞吐量的異質網路架構， 可更有效地利用網路資源。 | zh_TW |
| dc.description.abstract | Current network technology has been able to offer transmission methods
of higher efficiency. Heterogeneous network designs are also common in real-world networks. Among those designs, flooding algorithm is a highly reliable method of transmission, commonly seen in broadcasting. In peer-topeer (P2P) networks, however, this algorithm generates redundant repetitions of information, causing waste of resources. In this thesis a revised flooding algorithm is proposed, which effectively reduces redundant traffic for reliable message transmission in mesh networks. Without compromising transmission reliability, goodput is enhanced, significantly lowering cost of transmission. Analysis of the experiment results is also useful in designing a heterogeneous network structure with highest goodput based on the proportionality where equipment bandwidth and quantity are known, benefitting network efficiency. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-08T01:05:22Z (GMT). No. of bitstreams: 1 ntu-103-P01922005-1.pdf: 4219901 bytes, checksum: 2d7f29fd6c77e5e8894c622144aded5b (MD5) Previous issue date: 2014 | en |
| dc.description.tableofcontents | 口試委員會審定書i
Acknowledgments ii 摘要iii Abstract iv 1 Introduction 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Railway systems . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.2 Power distribution . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Thesis organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Related Works and Objective 6 2.1 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Contribution and Objectives . . . . . . . . . . . . . . . . . . . . . . . . 8 3 System architecture, workload model and quality of service (QoS) requirement, and problem definition 9 3.1 System architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2 Term Definition, Workload Model and QoS requirement . . . . . . . . . 10 3.3 Problem definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4 Design and implementation 12 4.1 Network model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 Network Goodput . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.2.1 Motivated example for goodput . . . . . . . . . . . . . . . . . . 14 4.2.2 Linear model: two paths in one segment S . . . . . . . . . . . . . 15 4.2.3 Linear model: n paths in one segment S . . . . . . . . . . . . . . 18 4.2.4 Linear model: variable paths in m segments . . . . . . . . . . . . 21 4.2.5 Arbitrary Mesh Network: variable paths in 2m 1 segments . . . 22 4.3 Algorithm of transmission . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.3.1 Initialization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.3.2 Algorithm of relay nodes . . . . . . . . . . . . . . . . . . . . . . 23 5 Performance evaluation 25 5.1 Experiment environment . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.1.1 The network simulator . . . . . . . . . . . . . . . . . . . . . . . 25 5.1.2 Parameters setup . . . . . . . . . . . . . . . . . . . . . . . . . . 26 5.2 Evaluation results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 5.2.1 Compared with flooding algorithm . . . . . . . . . . . . . . . . 29 5.2.2 Analysis of goodput . . . . . . . . . . . . . . . . . . . . . . . . 36 6 Conclusion and future development 38 6.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 6.2 Future development . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 | |
| dc.language.iso | en | |
| dc.title | 具服務品質之網狀網路傳輸流量優化機制之設計與實作 | zh_TW |
| dc.title | Research on Qos aware goodput control for heterogeneous mesh
network | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 102-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 陳伶志,逄愛君,王佑中,李佳儒 | |
| dc.subject.keyword | 洪水演算法,網狀網路,有效吞吐量, | zh_TW |
| dc.subject.keyword | flooding,mesh network,goodput, | en |
| dc.relation.page | 29 | |
| dc.rights.note | 未授權 | |
| dc.date.accepted | 2014-08-20 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-103-1.pdf 未授權公開取用 | 4.12 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。