跳到主要內容

臺灣博碩士論文加值系統

(35.172.136.29) 您好!臺灣時間:2021/08/02 04:59
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:許仲佑
研究生(外文):Chang-Yu Sui
論文名稱:資源分配在激勵性之移動對等式系統
論文名稱(外文):Rate Allocation over Incentive based Mobile Peer-to-Peer System
指導教授:鍾添曜
指導教授(外文):Tein-Yaw Chung
學位類別:碩士
校院名稱:元智大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:中文
論文頁數:37
中文關鍵詞:移動對等式網路多模網路激勵性搭便車
外文關鍵詞:MP2Pmultimodeincentivefree-riding
相關次數:
  • 被引用被引用:0
  • 點閱點閱:118
  • 評分評分:
  • 下載下載:2
  • 收藏至我的研究室書目清單書目收藏:0
近年來移動對等式網路被廣泛的探討,在移動對等式網路,行動通訊裝置之間在有限的資源限制下,要如何互相鼓勵分享資源並預防搭便車問題是很有挑戰性。而當行動通訊裝置支援多個網路介面,稱之為多模行動通訊裝置,並且使用TCP當作資料交換的通訊協定時,問題將變得極為複雜。因此,此論文利用平行TCP連線來增加在無線網路的吞吐量。此外,我們將行動裝置間資源分配的問題模組化成IRAR的問題,而 IRAR是NP-hard的問題,並提出以下方法解決。首先,我們提出LA_α_RA的方法,是利用Lagrangian結合α-rate allocation [31][32] [33]方法來解決IRAR的問題。第二,為了降低α-rate allocation的時間複雜度,另外提出一個啟發式演算法MPCP取代之。
從模擬的結果可得知,透過LA_α_RA方法,IRAR的效能得以提升並且達到公平性與激勵性。另一方面,從LG_MPCP方法可看出分配資源的結果逼近LA_α_RA。
Mobile Peer-to-Peer networks (MP2P) are expected to be widely studied in the near future, In MP2P, it is a great challenge to encourage resource sharing and prevent free-riding problem between mobile devices with limited resource. The problem becomes even complex when mobile nodes are multimode devices and use TCP for data exchange. This Thesis makes use of parallel TCP connection to explore full utility of bandwidth. For MP2P data exchange, we model the problem to be Incentive based Rate Allocation and Routing (IRAR) problem which is NP-hard. First, we exploit a joint combination of Lagrangian with α-rate allocation [31][32][33] called LG_α_RA to solve IRAR problem. Second, we propose the light-load and heuristic mechanism called Multiple Path Connection Prediction (MPCP) to reduce the complexity by α-rate allocation.
From simulation result, on one hand, the performance of IRAR can be enhanced and achieve fairness and incentive by LG_α_RA. On the other hand, the result of rate allocation by LG_MPCP is much close to LG_α_RA.
Abstract in Chinese iv
Abstract in English v
Acknowledgement vi
Table of Contents vii
List of Figures viii
List of Tables x
ABBREVIATIONS xi
Chapter 1 Introduction 1
1.1. Background & Motivation 1
1.2. Goal 2
1.3. Contributions 3
1.4. Thesis Organization 3
Chapter 2 Related Works 4
2.1. Incentive Mechanism in Static P2P Networks 4
2.2. Incentive Mechanism in Mobile P2P networks 5
2.3. TCP connection game over Mutilpath 6
2.3.1. TCP over wired network 6
2.3.2. TCP over wireless network 7
Chapter 3 Incentive based Rate Allocation and Routing (IRAR) 8
3.1. Problem Formulation 8
3.2. Rate Allocation Mechanism 10
3.3. Incentive based Rate Allocation and Routing (IRAR) 11
3.4. MPCP based on IRAR 13
3.5. Primal-Dual based Cross-Layer Scheme 15
3.5.1. Formulation of the Dual IRAR Problem 15
3.5.2. Solving the Dual Problem by Sub-gradient Method 17
Chapter 4 Simulation Results 18
4.1. Simulation Environment 18
4.2. Effect of Various Parameters 20
4.3. Performance of IRAR 25
Chapter 5 Conclusion and Future Works 31
Chapter 6 References 32
[1]E. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “Survey and comparison of peer-to-peer overlay network schemes,” IEEE Communications Survey and Tutorial, March 2004.
[2]Y. Chen and Y. Yang, “A new 4G architecture providing multimode terminals always best connected services,” IEEE Wireless Communication, Vol.14, No.2, pp.36-41, April 2007.
[3]B. Xie, A. Kumar, and D.P. Agrawal, “Enabling multiservice on 3G and beyond: challenges and future directions,” IEEE Wireless Communication, Vol.15, No.3, pp.66-72, June 2008.
[4]R. Ma, S. Lee, J. Lui and D. Yau, “Incentive and service differentiation in P2P networks: A game theoretic approach,” IEEE/ACM Transactions on networking, Vol. 14, No.5, pp.978-991, October 2006.
[5]M. Li, J. Yu and J. Wu, “Free-riding on bittorrent-like peer-to-peer file sharing systems: modeling analysis and improvement,” IEEE transactions on parallel and distributed systems, Vol.19, No.7, pp.954-966, July 2008.
[6]P. Golle, K.L. Brown, and I. Mironov, “Incentives for sharing in peer-to-peer networks,” Proc. Electronic Commerce, 2001.
[7]M. Han and G. Agha, “ARA: a robust audit to prevent free-riding in P2P networks,” Proc. P2P, 2005.
[8]S. Kamvar, M. Schlosser, and H. Garcia-Molina, “Incentives for combating free-riding on P2P networks,” Proc.Euro-Par, 2003.
[9]N. Liebau, V. Darlagiannis, O. Hechmann, and R. Steinmetz, “Asymmetric incentives in peer-to-peer systems,” Proc. AMCIS, 2005.
[10]L. Ramaswamy and L. Liu, “Free riding: A new challenge to P2P file sharing systems,” Proc. HICSS, 2003.
[11]Y. Liu, C. Yang, K. Xu and H. Chen, “Rank-based incentive mechanism for peer-to-peer networks,” IEEE International Conference on Natural Computation (ICNC), Vol.5, pp.252-256, October 2008.
[12]A. Mondal, S.K. Madria and M. Kitsuregawa, “ABIDE: a bid-based economic incentive model for enticing non-cooperative peers in Mobile-P2P networks,” Proc. DASFAA, 2007.
[13]A. Mondal, S.K. Madria and M. Kitsuregawa, “ConQuer: a peer group-based incentive model for constraint querying in Mobile-P2P networks,” Proc. MDM, 2007.
[14]O. Wolfson, B. Xu and A.P. Sistla, “An economic model for resource exchange in mobile peer-to-peer networks,” Proc. SSDBM, 2004.
[15]B. Xu, O. Wolfson and N. Rishe, ”Benefit and pricing of spatiotemporal information in Mobile peer-o-peer networks,” Proc. HICSS-39, 2006.
[16]A. Mawji and H. Hassanein, “A utility-based incentive scheme for P2P file sharing in mobile ad hoc networks,” IEEE International Conference on Communications (ICC), pp. 2248-2252, May 2008,
[17]L. Buttyan and J.Hubaux, “Stimulating cooperation in self-organizing mobile ad hoc networks,” Mobile Networks and Applications, vol. 8, no. 5, pp. 579-592, 2003.
[18]A. Mawji and H. Hassanein, “Incentives for P2P file sharing in mobile ad hoc networks,” IEEE Consumer Communications and Networking Conference (CCNC), pp.1-5, January 2009.
[19]C. Chang and T. Chung, “A cross-layer design to achieve stable and efficient parallel TCP over next generation wireless networks,” IEEE International Journal of Ad Hoc and Wireless Sensor Networks, 2009.
[20]F. Kelly and T. Voice, “Stability of end-to-end algorithms for joint routing and rate control,” Computer Communication Review, Vol.35:2, pp.5-12, 2005.
[21]H. Han, S. Shakkottai, C. Hollot, R. Srikant and D. Towsley, “Multipath TCP: a joint congestion control and routing scheme to exploit path diversity in the internet,” IEEE/ACM Transactions on networking, Vol.14, No.6, pp.1260-1277, December 2006.
[22]H. Zhang, G. Neglia, D. Towsley and G. Presti, “On unstructured file sharing networks,” IEEE International Conference on Computer Communications, pp.2189-2197, May 2007.
[23]H. Zhang, G. Neglia, D. Towsley, and G. Presti, “Stability and efficiency of unstructured file sharing networks,” IEEE Journal on Selected Areas in Communications., Vol.26, No.7, pp.1284-1294, September 2008.
[24]A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou, “Selfish behavior and stability of the internet: a game-theoretic analysis of TCP,” IEEE/ACM SIGCOMM, pp.117 -130, August 2002.
[25]H. Zhang, D. Towsley, and W. Gong, “TCP connection game: A study on the selfish behavior of tcp users,” IEEE International Conference on Network Protocols (ICNP), November 2005.
[26]P. Key, L. Massoulie, and D. Towsley, “Path selection and multipath congestion control,” IEEE International Conference on Computer Communications, pp.143-151, May 2007.
[27]M. Cao, X. Wang, S. Kim, and M. Madihian, “Multi-hop wireless backhaul networks: a cross-layer design paradigm,” IEEE Journal on Selected Areas in Communications, Vol.25, No.4, pp.738-748, May 2007.
[28]L. Xiao, M. Johansson, and S. Boyd, “Simultaneous Routing and Resource Allocation Via Dual Decomposition,” IEEE Transactions on Communications, Vol.52, No.7, pp.1136-1144, July 2004.
[29]S. Boyd and L. Vandenberghe. (2004) Convex Optimization [Online].
Available: http://www.stanford.edu/people/boyd/cvxbook.html
[30]D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
[31]F. Kelly, A. Maulloo, and D. Tan, “Rate control in communication networks: shadow prices, proportional fairness and stability,” J. Operational Research Society, vol.49, pp.5–12, 1998.
[32]T. Bonald and L. Massoulie, “Impact of fairness on internet performance,” in Performance Evaluation Review, pp. 82-91, 2001.
[33]J. Mo and J. Walrand, “Fair end-to-end window based congestion control,” IEEE/ACM Transactions on Networking, Vol.8, No.5, pp. 556-567, 2000.
[34]F.P. Kelly, “Mathematical Modelling of the Internet,” Mathematics Unlimited—2001 and Beyond, B. Engquist and W. Schmid, eds., pp. 685-702, Springer, 2001
[35]D. Rubenstein, J. Kurose, and D. Towsley, “Detecting shared congestion of flows via end-to-end measurement,” IEEE/ACM Transaction on Networking, Vol.10, No.3, pp.381-395. June 2002.
[36]C. L. Chiang, “Statistical methods of analysis,” World Scientific, 2003
[37]V. Misra, W. B. Gong, and D. Towsley, “Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED,” Computer Communication Review, pp.151-160, 2000.
[38]M. Grant and S. Boyd, “CVX, http://www.stanford.edu/~boyd/cvx/index.html.”
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top