並列摘要
This paper proposes an efficient method to derive the optimal routing path from the end-user to the specific server with time constraints. Although this paper is based on ”backtracking,” no other literature has been reported using the same methodology for this problem. The results of this study show that it is very efficient by comparing with the best known algorithm. The optimal routing path from the end-user to the specific server with various time constraints can be efficiently derived by the proposed method. This method enables the possibility of providing optimal dynamic routing service and hopes to solve the timeliness problem in cloud computing environment. Some numerical examples are demonstrated to explain this method.
延伸閱讀
- Chieh, L. M. (2016). An Efficient Routing Algorithm based on Segment Routing in Software-Defined Networking [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0411201614430741
- 張嘉惠（2007）。Adaptive Network Coding Based Routing in Delay-Tolerant Networks〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2007.01337
- Tse, S. H. (1997). The performance of interval routing in general networks [doctoral dissertation, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200007379
- 林祺富（2012）。A Throughput - Oriented Routing Scheme in Cognitive Radio Networks〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-2801201415012757
- 林志穎（2016）。Modeling and Delay Analysis for Cloud Networks〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0020-2601201619480600