Computing Medians in Distributed Service Networks: A Mathematical Perspective

Authors

  • Dr. Shailendra Kumar   Assistant Professor in Mathematics, Govt. Raza P. G. College, Rampur, India

Keywords:

Distributed Service Networks, P-Median Problem, Facility Location, Optimization, Decentralized Algorithms, Computational Mathematics.

Abstract

Distributed service networks form the backbone of numerous real-world systems such as logistics, telecommunications, and emergency response infrastructures. An essential optimization task in these networks is computing medians to minimize distance-based costs and ensure efficient service delivery. This paper presents a comprehensive mathematical exploration of the median problem in distributed service networks, reviewing classical formulations, discussing algorithmic strategies, and highlighting challenges and advancements in the distributed setting. Special focus is given to the p-median problem, approximation algorithms, and recent innovations in decentralized computation.

References

  1. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., & Pandit, V. (2001). Local search heuristics for k-median and facility location problems. STOC.
  2. Cohen, R., & Tamir, A. (1991). Solving the p-median problem on a chain and a tree. Operations Research Letters, 10(5), 273–278.
  3. Daskin, M. S. (1995). Network and Discrete Location: Models, Algorithms, and Applications. Wiley.
  4. Drezner, Z., & Hamacher, H. W. (Eds.). (2013). Facility Location: Applications and Theory (2nd ed.). Springer.
  5. Duan, R., & Pettie, S. (2014). Linear-time approximation for the weighted p-center problem. Journal of the ACM (JACM), 61(1), 1–23.
  6. He, H., Jiang, C., & Chen, J. (2014). A decentralized algorithm for solving facility location problems with neighborhood communication. Journal of Parallel and Distributed Computing, 74(2), 1552–1561.
  7. Kariv, O., & Hakimi, S. L. (1979). An algorithmic approach to network location problems. SIAM Journal on Applied Mathematics, 37(3), 539–560.
  8. Khan, A., Fard, H., & Nguyen, N. (2015). A distributed approach for p-median problem in mobile networks. IEEE Transactions on Mobile Computing, 14(7), 1393–1407.
  9. Kleywegt, A. J., & Zhang, J. (2011). Dynamic network facility location. Networks and Spatial Economics, 11(3), 437–463.
  10. Li, M., Xu, X., & Wang, J. (2017). A scalable streaming algorithm for the p-median problem. Information Sciences, 378, 270–284.
  11. Li, Y., Wang, C., & Liu, Z. (2016). Federated optimization for resource placement in distributed systems. Future Generation Computer Systems, 62, 1–11.
  12. Lin, F., & Zhang, Q. (2012). A new multi-agent algorithm for p-median problems. Applied Soft Computing, 12(3), 1043–1052.
  13. Olariu, S., & Xu, Q. (2011). A distributed facility location algorithm for backbone node selection in wireless networks. Ad Hoc Networks, 9(8), 1313–1325.
  14. Rabbat, M. G., & Nowak, R. D. (2011). Distributed optimization in sensor networks. Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, CRC Press.
  15. Shmoys, D. B., Tardos, É., & Aardal, K. (1997). Approximation algorithms for facility location problems. STOC.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-12-30

Issue

Volume 4, Issue 11, November-December-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Dr. Shailendra Kumar "Computing Medians in Distributed Service Networks: A Mathematical Perspective" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 11, pp.347-354, November-December-2018.