Optimal Routing in Cloud Networks with Time Constraints

被引:0
作者
Lin, Yi-Kuei [1 ]
Chen, Shin-Guang [2 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei, Taiwan
[2] Tungnan Univ, Dept Ind Management, New Taipei City, Taiwan
来源
JOURNAL OF INTERNET TECHNOLOGY | 2014年 / 15卷 / 01期
关键词
Cloud computing; Optimal routing; Backtracking; Minimal path; Time constraint; RELIABILITY EVALUATION; MULTISTATE NETWORKS; FLOW NETWORK; SYSTEM; ASSIGNMENT; ALGORITHM; CAPACITY;
D O I
10.6138/JIT.2014.15.1.08
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:77 / 85
页数:9
相关论文
共 25 条