English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 90773/120835 (75%)
Visitors : 25084025      Online Users : 360
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 學位論文 >  Item 140.119/98623
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/98623


    Title: 以任務分配解決即時金融服務中突發流量及網路不穩定問題
    Task Assignment for Real-time Financial Service System under Bursty Traffic and Unstable Networks
    Authors: 陳泰銘
    Chen, Tai Ming
    Contributors: 蔡子傑
    Tsai, Tzu Chieh
    陳泰銘
    Chen, Tai Ming
    Keywords: 任務分配
    負載平衡
    突發流量
    網路不穩定
    網路延遲自相關模型
    排隊理論
    金融3.0
    Task Assignment
    Load Balance
    Bursty Traffic
    Network Instability
    Network Delay Autocorrelation Model
    Queuing Theory
    Bank 3.0
    Date: 2016
    Issue Date: 2016-07-01 15:17:13 (UTC+8)
    Abstract: 最近,金融科技(FinTech)和行動金融服務,吸引越來越多的目光。新的創新金融科技服務,改變了金融服務的消費行為。行動網路的發展使人們能夠隨時隨地的享受行動銀行的服務已經是個不爭的事實。然而,由於無線網路先天的特性以及行動裝置的移動性,使行動金融的服務品質受到網路不穩定的影響。而且,隨著Bank 3.0時代的來臨,將會有大量的使用者同時使用行動金融服務,特別是在股市開盤以及重大訊息揭露的時候。因著大量使用者瞬間湧入,以及無線網路不穩定的影響,交易系統的效能很可能會時好時壞,所以無法滿足即時金融市場的需求。
    本論文中,我們提出「行動銀行訊息即服務」的框架,使系統能夠很容易的水平擴充,並且能夠輕易的實現雙向通訊和雙向交易等多項行動金融服務。為了達到最少成本追求最大利益的目的,我們發展了能夠適應突發流量以及網路不穩定性的任務分配演算法,使得不用增加額外硬體成本的前提下改善系統效能。然後,為了實驗欲模擬大量行動裝置的使用者,我們觀察真實網路的特性並發明了網路延遲自相關模型來驗證我們提出的任務分配演算法。結果顯示,透過此任務分配演算法,確實能夠有效改善系統資源管理的能力。最後,本研究將系統佈署於真實網路環境當中,並且發現進行同樣實驗的結果與採用網路延遲自相關模型的實驗結果一致。因此,本研究間接驗證了網路自相關模型的正確性,以及證明本任務分配演算法,在突發流量和網路不穩定的即時行動金融服務環境下,能有效降低系統響應時間。
    FinTech (financial technology) and mobile financial services are getting more and more attention recently. New innovative FinTech services change the consumption behavior for financial services. It is an indisputable fact development of the mobile Internet allows people to enjoy mobile banking everywhere and anytime. However, due to the nature of wireless networking and the mobility of the mobile device, the quality of mobile financial service will be affected by network instability. Moreover, with the coming of Bank 3.0, a huge amount of users would be in the mobile service of finance simultaneously, especially when the instances of the stock market opening or disclosure of highly important financial message. As the result of bursty traffic and network instability, the performance of transaction system is up and down, making it tough to satisfy the demand of real-time financial markets.
    In this thesis, we propose a “Mobile Banking Messaging as a Service Framework” that can easily scale out and fulfill functions comprising Bilateral Communication, Bilateral Trading, and many other mobile financial services. To pursuit of the greatest benefit along with investment of the least resources, we develop the task assignment algorithm which can adapt the system to bursty traffic and unstable networks to improve performance for free. Then, in order to simulate a large number of mobile users, we observe the characteristic of real-world network delay and propose a network delay autocorrelation model to verify our task assignment algorithm. The results of experiment show that we could actually use our task assignment algorithm to improve the ability of the system to manage resource. Finally, we deploy our system in a real-world network delay environment and find that the results obtained in the real condition are the same with our simulation results. Therefore, this research can indirectly verify the correctness of the network delay autocorrelation model, and prove that our task assignment algorithm can effectively reduce the system response time for real-time mobile financial service system under bursty traffic and unstable networks.
    Reference: [1] KING, Brett. Bank 3.0: Why Banking Is No Longer Somewhere You Go But Something You Do. John Wiley & Sons, 2012.
    [2] 陳欣昌. 下一步: 數位證券 3.0. 證券服務, 2014, 628: 9-14.
    [3] KING, Brett. Breaking Banks: The Innovators, Rogues, and Strategists Rebooting Banking. John Wiley & Sons, 2014.
    [4] 隨時隨地隨取的行動銀行創新實務分享, Available: https://www.fisc.com.tw/Upload/727606e2-2b6d-450a-a519-950191c11010/TC/14.pdf
    [5] SKINNER, Chris. Digital Bank: Strategies to launch or become a digital bank. Marshall Cavendish International Asia Pte Ltd, 2014.
    [6] 分秒必爭,期貨商砸錢提升IT系統, Available: http://news.ltn.com.tw/news/business/paper/654740
    [7] XV, Lingbo; MENG, Qingjun. Interference in and Ecological Strategies to Mobile Financial Services Developed by Commercial Banks. Open Journal of Social Sciences, 2015, 3.07: 194.
    [8] 股票即時交易倒數計時,新制引爆市場洗牌:證券業生存戰, Available: http://news.pchome.com.tw/magazine/print/li/iThome/9908/137753280084570075005.htm
    [9] 臺灣證券交易所, 縮短撮合秒數時程規劃專區, Available: http://www.twse.com.tw/ch/trading/information/information2.php
    [10] 臺灣證券業啟動IT軍備競賽,證交所領軍打造逐筆撮合平臺, Available: http://www.ithome.com.tw/people/96276
    [11] Google Cloud Messaging, Available: https://developers.google.com/cloud-messaging/gcm
    [12] Apple Push Notification Service, Available: https://developer.apple.com/library/ios/documentation/NetworkingInternet/Conceptual/RemoteNotificationsPG/Chapters/ApplePushService.html
    [13] Parse, Available: https://parse.com/products/push
    [14] LINE – Naver, Available: http://line.me/zh-hant/
    [15] WhatsApp, Available: https://www.whatsapp.com/?l=zh_tw
    [16] 業界首見!日本 SBI 證券散戶可透過 Line 下單, Available: http://ascii.jp/elem/000/000/923/923586/
    [17] REALTIME, Ignite. Openfire Server, 2009.
    [18] Connection Manager Module - Ignite Realtime: Openfire, Available: http://www.igniterealtime.org/projects/openfire/connection_manager.jsp
    [19] XU, Zhong; HUANG, Rong. Performance study of load balancing algorithms in distributed web server systems. CS213 Parallel and Distributed Processing Project Report, 2009, 1.
    [20] A predictive modified round robin scheduling algorithm for web server clusters, 2015
    [21] SIDHU, Amandeep Kaur; KINGER, Supriya. Analysis of load balancing techniques in cloud computing. International Journal of Computers & Technology, 2013, 4.2: 737-741.
    [22] WANG, Weikun; CASALE, Giuliano. Evaluating Weighted Round Robin Load Balancing for Cloud Web Services. In: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on. IEEE, 2014. p. 393-400.
    [23] BUOT, Max. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Journal of the American Statistical Association, 2006, 101.473: 395-396.
    [24] FALLIS, Don. The reliability of randomized algorithms. The British journal for the philosophy of science, 2000, 51.2: 255-271.
    [25] TENG, Sheng-bo; LIAO, Jian-xin; ZHU, Xiao-min. Dynamic weighted random load balancing algorithm for SIP application server. The Journal of China Universities of Posts and Telecommunications, 2009, 16.4: 67-70.
    [26] CHOI, DongJun; CHUNG, Kwang Sik; SHON, JinGon. An Improvement on the Weighted Least-Connection Scheduling Algorithm for Load Balancing in Web Cluster Systems. In: Grid and Distributed Computing, Control and Automation. Springer Berlin Heidelberg, 2010. p. 127-134.
    [27] TEO, Yong Meng; AYANI, Rassul. Comparison of load balancing strategies on cluster-based web servers. Simulation, 2001, 77.5-6: 185-195.
    [28] GUPTA, Varun, et al. Analysis of join-the-shortest-queue routing for web server farms. Performance Evaluation, 2007, 64.9: 1062-1081.
    [29] GUILLEMIN, Fabrice; SIMONIAN, Alain. Analysis of the shortest queue first service discipline with two classes. In: Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2013. p. 1-10.
    [30] KOKILAVANI, T.; AMALARETHINAM, Dr DI George. Load balanced min-min algorithm for static meta-task scheduling in grid computing. International Journal of Computer Applications, 2011, 20.2: 43-49.
    [31] PATEL, Gaurang; MEHTA, Rutvik; BHOI, Upendra. Enhanced Load Balanced Min-min Algorithm for Static Meta Task Scheduling in Cloud Computing. Procedia Computer Science, 2015, 57: 545-553. x
    [32] BONALD, Thomas, et al. A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing systems, 2006, 53.1-2: 65-84.
    [33] Ahmed El Rheddane, No¨el De Palma, Alain Tchana, Scalable Store and Forward Messaging. In: Cloud Computing (CLOUD), 2013 The Fourth International Conference on Cloud Computing, GRIDs, and Virtualization
    [34] ZHANG, Lijun; ZHU, Qiuyu. The Overtime Waiting Model for Web Server Performance Evaluation. In: Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2014 International Conference on. IEEE, 2014. p. 229-232.
    [35] HARCHOL-BALTER, Mor. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013.
    [36] ZHANG, Lijun; ZHU, Qiuyu. The Overtime Waiting Model for Web Server Performance Evaluation. In: Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2014 International Conference on. IEEE, 2014. p. 229-232.
    [37] PRABHAVAT, Sumet, et al. Effective delay-controlled load distribution over multipath networks. Parallel and Distributed Systems, IEEE Transactions on, 2011, 22.10: 1730-1741.
    [38] DigitalOcean: Simple Cloud Infrastructure for Developers, Available: https://www.digitalocean.com/
    Description: 碩士
    國立政治大學
    資訊科學學系
    102753032
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0102753032
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File SizeFormat
    303201.pdf3055KbAdobe PDF436View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback