IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i3d10.1007_s10878-018-0326-2.html
   My bibliography  Save this article

Client assignment problems for latency minimization

Author

Listed:
  • Gruia Călinescu

    (Illinois Institute of Technology)

  • Xiaolang Wang

    (Illinois Institute of Technology)

Abstract

Interactivity is a primary performance measure for distributed interactive applications (DIAs). In a network supporting a DIA, interactivity performance depends on both client-to-server network latencies and inter-server network latencies. An optimization problem, which we term FCSA, is to find an optimum way how clients are assigned to servers such that the largest latency on an interactivity path between two clients (client 1 to server 1, server 1 to server 2, then server 2 to client 2) is minimized. Previous work showed that it is NP-hard to approximate this problem with a ratio better than 4 / 3 and gave a 3-approximation algorithm. In this paper, we give a (3 / 2)-approximation algorithm for FCSA, and show that it is NP-hard to obtain a better ratio. We also give a (3 / 2)-approximation algorithm when server capacity constraints are considered.

Suggested Citation

  • Gruia Călinescu & Xiaolang Wang, 2019. "Client assignment problems for latency minimization," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 889-900, April.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0326-2
    DOI: 10.1007/s10878-018-0326-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0326-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-0326-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dorit S. Hochbaum & David B. Shmoys, 1985. "A Best Possible Heuristic for the k -Center Problem," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 180-184, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Barbara Anthony & Vineet Goyal & Anupam Gupta & Viswanath Nagarajan, 2010. "A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 79-101, February.
    2. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    3. Renbo Huang & Guirong Zhuo & Lu Xiong & Shouyi Lu & Wei Tian, 2023. "A Review of Deep Learning-Based Vehicle Motion Prediction for Autonomous Driving," Sustainability, MDPI, vol. 15(20), pages 1-43, October.
    4. Wei Ding & Ke Qiu, 2020. "Approximating the asymmetric p-center problem in parameterized complete digraphs," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 21-35, July.
    5. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    6. Abdul Suleman, 2017. "On ill-conceived initialization in archetypal analysis," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 11(4), pages 785-808, December.
    7. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    8. Yi Xu & Jigen Peng & Wencheng Wang & Binhai Zhu, 2018. "The connected disk covering problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 538-554, February.
    9. Viswanath Nagarajan & Baruch Schieber & Hadas Shachnai, 2020. "The Euclidean k -Supplier Problem," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 1-14, February.
    10. Kobbi Nissim & Rann Smorodinsky & Moshe Tennenholtz, 2018. "Segmentation, Incentives, and Privacy," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1252-1268, November.
    11. Xuqing Bai & Hong Chang & Xueliang Li, 0. "More on limited packings in graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-19.
    12. Raphael Kramer & Manuel Iori & Thibaut Vidal, 2020. "Mathematical Models and Search Algorithms for the Capacitated p -Center Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 444-460, April.
    13. Arindam Karmakar & Sandip Das & Subhas C. Nandy & Binay K. Bhattacharya, 2013. "Some variations on constrained minimum enclosing circle problem," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 176-190, February.
    14. Sándor P. Fekete & Joseph S. B. Mitchell & Karin Beurer, 2005. "On the Continuous Fermat-Weber Problem," Operations Research, INFORMS, vol. 53(1), pages 61-76, February.
    15. José Alejandro Cornejo Acosta & Jesús García Díaz & Ricardo Menchaca-Méndez & Rolando Menchaca-Méndez, 2020. "Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(9), pages 1-16, September.
    16. Nicolas Dupin & Frank Nielsen & El-Ghazali Talbi, 2021. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front," Mathematics, MDPI, vol. 9(4), pages 1-30, February.
    17. Dongyue Liang & Liquan Mei & James Willson & Wei Wang, 2016. "A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1417-1429, May.
    18. Ye, Mao & Zhang, Peng & Nie, Lizhen, 2018. "Clustering sparse binary data with hierarchical Bayesian Bernoulli mixture model," Computational Statistics & Data Analysis, Elsevier, vol. 123(C), pages 32-49.
    19. Felix Bock, 2022. "Hierarchy cost of hierarchical clusterings," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 617-634, August.
    20. Alexander Estes & David J. Lovell & Michael O. Ball, 2019. "Unsupervised prototype reduction for data exploration and an application to air traffic management initiatives," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 467-510, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0326-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.