2016年
Computational time complexity of allocation problem for distributed servers in real-time applications.
18th Asia-Pacific Network Operations and Management Symposium(APNOMS)
- ,
- ,
- ,
- 巻
- 1
- 号
- 開始ページ
- 1
- 終了ページ
- 4
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1109/APNOMS.2016.7737236
- 出版者・発行元
- IEEE
This paper analyzes the computational time complexity of the allocation problem for data processing functions among multiple users and distributed servers in the distributed processing communication scheme for a real-time network application. In the distributed processing communication scheme, the application is processed on a data processing function in the distributed servers in order to minimize the delay time. We prove that the allocation problem for data processing functions among multiple users and distributed servers is an NP-complete problem.
- リンク情報
-
- DOI
- https://doi.org/10.1109/APNOMS.2016.7737236
- DBLP
- https://dblp.uni-trier.de/rec/conf/apnoms/BaKCO16
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000392160000043&DestApp=WOS_CPL
- URL
- https://dblp.uni-trier.de/rec/conf/apnoms/2016
- URL
- https://dblp.uni-trier.de/db/conf/apnoms/apnoms2016.html#BaKCO16
- ID情報
-
- DOI : 10.1109/APNOMS.2016.7737236
- ISBN : 9784885523045
- DBLP ID : conf/apnoms/BaKCO16
- Web of Science ID : WOS:000392160000043