Skip to main content

WDCS: A Weight-Based Distributed Coordinate System

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9486))

Abstract

Many Internet-based applications, such as Content Distribution Networks (CDNs), BitTorrent and Network Game Accelerator, require the knowledge of the distance between each pair of network hosts. Due to the large number of hosts in these applications, measuring all of the pairwise distances is too time-consuming and traffic-inefficient. Network Coordinate System (NCS) is an innovative approach to obtain the pairwise distances by measuring only part of the distances and thereafter utilizing the collected information to predict the remaining pairwise distances. However, due to Triangle Inequality Violation (TIV) and measurement errors, the accuracy of the existing NCS schemes is low. In this paper, we propose a novel distributed NCS scheme, WDCS, that uses a well-designed algorithm to select an appropriate set of landmarks and employs the W_RUN_PACE method to eliminate the impact of measurement errors or outliers. Through extensive experiments, we found that WDCS outperforms the state-of-the-art NCS schemes in terms of prediction accuracy and convergence speed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Krishnan, R., Madhyastha, H.V., Srinivasan, S., Jain, S., Krishnamurthy, A., Anderson, T., Gao, J.: Moving beyond end-to-end path information to optimize CDN performance. In: Proceedings of ACM SIGCOMM Internet Measurement Conference, pp. 190–201. ACM (2009)

    Google Scholar 

  2. Azureus bittorrent. http://sourceforge.net/projects/azureus/

  3. Agarwal, S., Lorch, J.R.: Matchmaking for online games and other latency-sensitive P2P systems. In: ACM SIGCOMM Computer Communication Review, vol. 39, pp. 315–326. ACM (2009)

    Google Scholar 

  4. Eugene Ng, T.S., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proceedings of IEEE INFOCOM, vol. 1, pp. 170–179. IEEE, April 2002

    Google Scholar 

  5. Mao, Y., Saul, L.K.: Modeling distances in large-scale networks by matrix factorization. In: Proceedings of the ACM SIGCOMM Conference on Internet Measurement, pp. 278–287. ACM, October 2004

    Google Scholar 

  6. Mao, Y., Saul, L.K., Smith, J.M.: Ides: an internet distance estimation service for large networks. IEEE J. Sel. Areas Commun. 24(12), 2273–2284 (2006)

    Article  Google Scholar 

  7. Lee, S., Zhang, Z., et al.: On suitability of Euclidean embedding of Internet hosts. In: Proceedings of the 2006 ACM SIGMetrics/Performance (2006)

    Google Scholar 

  8. Lee, D.D., Seung, H.S.: Learning the parts of objects by nonnegative matrix factorization. Nature 401(6755), 788–791 (1999)

    Google Scholar 

  9. Cheng, J., Guan, X., Qiang, Y., Jiang, H., Dong, Y.: RNC: a high-precision network coordinate system. In: The 22nd International Symposium of Quality of Service (IWQoS), pp. 228–237, May 2014

    Google Scholar 

  10. Lee, D.D., Sebastian Seung, H.: Algorithms for non-negative matrix factorization

    Google Scholar 

  11. Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  12. Chen, Y., Wang, X., Shi, C., Lua, E.K., Fu, X., Deng, B., Li, X.: Phoenix: a weight-based network coordinate system using matrix factorization. IEEE Trans. Netw. Serv. Manage. 8(4), 334–347 (2011)

    Article  Google Scholar 

  13. Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: Proceedings of the ACM SIGCOMM, pp. 15–26. ACM Press, New York (2004)

    Google Scholar 

  14. Stribling, J.: All pairs of ping data for planetlab. http://www.pdos.lcs.mit.edu/~strib/pl_app

  15. The P2PSim project. http://pdos.csail.mit.edu/p2psim/

  16. Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: estimating latency between arbitrary internet end hosts. In: Proceedings of ACM SIGCOMM Internet Measurement Workshop, pp. 5–18. ACM, November 2002

    Google Scholar 

Download references

Acknowledgement

This work was financially supported by National Natural Science Foundation of China with Grants No. 61370216 and No. 61100191, and Shenzhen Strategic Emerging Industries Program with Grants No. ZDSY20120613125016389, No. JCYJ20120613151201451 and No. JCYJ20130329153215152.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongwei Du .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, Y., Du, H., Ye, Q. (2015). WDCS: A Weight-Based Distributed Coordinate System. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics