{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
