{"title":"考虑延迟不确定性的边缘计算应用安置稳健优化方法","authors":"Jaehee Jeong , Gopika Premsankar , Bissan Ghaddar , Sasu Tarkoma","doi":"10.1016/j.omega.2024.103064","DOIUrl":null,"url":null,"abstract":"<div><p>Edge computing brings computing and storage resources close to end-users to support new applications and services that require low network latency. It is currently used in a wide range of industries, from industrial automation and augmented reality, to smart cities and connected vehicles, where low latency, data privacy, and real-time processing are critical requirements. The latency of accessing applications in edge computing must be consistently below a threshold of a few tens of milliseconds to maintain an acceptable experience for end-users. However, the latency between users and applications can vary considerably depending on the network load and mode of wireless access. An application provider must be able to guarantee that requests are served in a timely manner by their application instances hosted in the edge despite such latency variations. This article focuses on the placement and traffic allocation problem faced by application providers in determining where to place application instances on edge nodes such that requests are served within a certain deadline. It proposes novel formulations based on robust optimization to provide optimal plans that protect against latency variations in a configurable number of network links. The robust formulations are based on two different types of polyhedral uncertainty sets that offer different levels of protection against variations in latency. Extensive simulations show that our robust models are able to keep the number of chosen edge nodes low while reducing the number of latency violations as compared to a deterministic optimization model that only considers the average latency of network links.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":null,"pages":null},"PeriodicalIF":6.7000,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305048324000318/pdfft?md5=6c0e23d49bf05ac6ab6544d50ab755a2&pid=1-s2.0-S0305048324000318-main.pdf","citationCount":"0","resultStr":"{\"title\":\"A robust optimization approach for placement of applications in edge computing considering latency uncertainty\",\"authors\":\"Jaehee Jeong , Gopika Premsankar , Bissan Ghaddar , Sasu Tarkoma\",\"doi\":\"10.1016/j.omega.2024.103064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Edge computing brings computing and storage resources close to end-users to support new applications and services that require low network latency. It is currently used in a wide range of industries, from industrial automation and augmented reality, to smart cities and connected vehicles, where low latency, data privacy, and real-time processing are critical requirements. The latency of accessing applications in edge computing must be consistently below a threshold of a few tens of milliseconds to maintain an acceptable experience for end-users. However, the latency between users and applications can vary considerably depending on the network load and mode of wireless access. An application provider must be able to guarantee that requests are served in a timely manner by their application instances hosted in the edge despite such latency variations. This article focuses on the placement and traffic allocation problem faced by application providers in determining where to place application instances on edge nodes such that requests are served within a certain deadline. It proposes novel formulations based on robust optimization to provide optimal plans that protect against latency variations in a configurable number of network links. The robust formulations are based on two different types of polyhedral uncertainty sets that offer different levels of protection against variations in latency. Extensive simulations show that our robust models are able to keep the number of chosen edge nodes low while reducing the number of latency violations as compared to a deterministic optimization model that only considers the average latency of network links.</p></div>\",\"PeriodicalId\":19529,\"journal\":{\"name\":\"Omega-international Journal of Management Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0305048324000318/pdfft?md5=6c0e23d49bf05ac6ab6544d50ab755a2&pid=1-s2.0-S0305048324000318-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Omega-international Journal of Management Science\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305048324000318\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048324000318","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
A robust optimization approach for placement of applications in edge computing considering latency uncertainty
Edge computing brings computing and storage resources close to end-users to support new applications and services that require low network latency. It is currently used in a wide range of industries, from industrial automation and augmented reality, to smart cities and connected vehicles, where low latency, data privacy, and real-time processing are critical requirements. The latency of accessing applications in edge computing must be consistently below a threshold of a few tens of milliseconds to maintain an acceptable experience for end-users. However, the latency between users and applications can vary considerably depending on the network load and mode of wireless access. An application provider must be able to guarantee that requests are served in a timely manner by their application instances hosted in the edge despite such latency variations. This article focuses on the placement and traffic allocation problem faced by application providers in determining where to place application instances on edge nodes such that requests are served within a certain deadline. It proposes novel formulations based on robust optimization to provide optimal plans that protect against latency variations in a configurable number of network links. The robust formulations are based on two different types of polyhedral uncertainty sets that offer different levels of protection against variations in latency. Extensive simulations show that our robust models are able to keep the number of chosen edge nodes low while reducing the number of latency violations as compared to a deterministic optimization model that only considers the average latency of network links.
期刊介绍:
Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.