Optimal routing in cloud networks with time constraints

Yi-Kuei Lin, Shin Guang Chen*

*Corresponding author for this work

研究成果: Article同行評審

摘要

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.

原文English
頁(從 - 到)77-85
頁數9
期刊Journal of Internet Technology
15
發行號1
DOIs
出版狀態Published - 18 二月 2014

指紋 深入研究「Optimal routing in cloud networks with time constraints」主題。共同形成了獨特的指紋。

引用此