B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester
{"title":"用于大规模分布式move服务的自治服务托管","authors":"B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/INM.2009.5188790","DOIUrl":null,"url":null,"abstract":"Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Autonomic service hosting for large-scale distributed MOVE-services\",\"authors\":\"B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester\",\"doi\":\"10.1109/INM.2009.5188790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.\",\"PeriodicalId\":332206,\"journal\":{\"name\":\"2009 IFIP/IEEE International Symposium on Integrated Network Management\",\"volume\":\"17 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IFIP/IEEE International Symposium on Integrated Network Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INM.2009.5188790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IFIP/IEEE International Symposium on Integrated Network Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INM.2009.5188790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Autonomic service hosting for large-scale distributed MOVE-services
Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.