分布式服务器分配问题的多项式时间算法

2019 IEEE 8th International Conference on Cloud Networking (CloudNet) Pub Date : 2019-11-01 DOI:10.1109/CloudNet47604.2019.9064128

Takaaki Sawa, Fujun He, Akio Kawabata, E. Oki

{"title":"分布式服务器分配问题的多项式时间算法","authors":"Takaaki Sawa, Fujun He, Akio Kawabata, E. Oki","doi":"10.1109/CloudNet47604.2019.9064128","DOIUrl":null,"url":null,"abstract":"This paper proposes an algorithm for the distributed server allocation problem, namely Minimizing the Maximum Delay (MMD), where an optimal solution is obtained when all server-server delays are the same constant value. We prove that MMD obtains an optimal solution with the polynomial time complexity.","PeriodicalId":340890,"journal":{"name":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Polynomial-time Algorithm for Distributed Server Allocation Problem\",\"authors\":\"Takaaki Sawa, Fujun He, Akio Kawabata, E. Oki\",\"doi\":\"10.1109/CloudNet47604.2019.9064128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an algorithm for the distributed server allocation problem, namely Minimizing the Maximum Delay (MMD), where an optimal solution is obtained when all server-server delays are the same constant value. We prove that MMD obtains an optimal solution with the polynomial time complexity.\",\"PeriodicalId\":340890,\"journal\":{\"name\":\"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CloudNet47604.2019.9064128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet47604.2019.9064128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

针对分布式服务器分配问题，本文提出了一种算法，即最小化最大延迟(MMD)，该算法在所有服务器-服务器延迟均为恒定值时得到最优解。证明了MMD的最优解具有多项式的时间复杂度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Polynomial-time Algorithm for Distributed Server Allocation Problem

This paper proposes an algorithm for the distributed server allocation problem, namely Minimizing the Maximum Delay (MMD), where an optimal solution is obtained when all server-server delays are the same constant value. We prove that MMD obtains an optimal solution with the polynomial time complexity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 IEEE 8th International Conference on Cloud Networking (CloudNet)

自引率

0.00%

发文量