CHESS: An application-aware space for enhanced scalable services in overlay networks
Pages 1239 - 1253
Abstract
We introduce in this paper CHESS, an application-aware space for enhanced scalable (In our context, the scalability feature is satisfied when the system overhead is linear with the number of its nodes.) services in overlay networks. In this new space, the proximity of peers is determined according to a utility function that considers the network parameters (e.g., delay, bandwidth, and loss rate) impacting application performance. We motivate the need for this new notion by showing that the proximity in the delay space does not automatically lead to a proximity in another space (e.g., space of the bandwidth). For determining the proximity in CHESS, network parameters must be estimated easily and scalably. Therefore, we use the matrix factorization approach for estimating the delay and loss parameters. Besides, we propose a scalable model that estimates the bandwidth among peers using the bandwidth of the indirect paths that join them via a set of landmarks. Our idea is that an indirect path shares the same tight link with the direct path with a probability that depends on the location of the corresponding landmark with respect to the direct path or any of the two peers subject to bandwidth inference. The results show that characterizing the proximity in CHESS provides a much better quality than that obtained when using the delay proximity for large file transfer applications. The whole study is supported by real measurements carried out over Planetlab.
References
[1]
F. Dabek, R. Cox, F. Kaashoek, R. Morris, Vivaldi: a decentralized network coordinate system, ACM Sigcomm, 2004.
[2]
B. Gueye, A. Ziviani, M. Crovella, S. Fdida, Constraint-based geolocation of internet hosts, ACM IMC, 2004.
[3]
Ng, E. and Zhang, H., Predicting internet network distance with coordinates-based approaches. IEEE Infocom.
[4]
L. Tang, M. Crovella, Virtual landmarks for the internet, ACM IMC, 2003.
[5]
An open, distributed platform for developing, deploying and accessing planetary-scale network services. Available from: <http://www.planet-lab.org/>.
[6]
B. Wong, A. Silvkins, E.G. Sirer, Meridian: a lightweight network location service without virtual coordinates, ACM Sigcomm, 2005.
[7]
Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y. and Zhang, L., IDMaps: a global internet host distance estimation service. IEEE/ACM Transactions on Networking.
[8]
Shavitt, Y. and Tankel, T., Big-bang simulation for embedding network distances in euclidean space. IEEE Infocom.
[9]
Ratnasamy, S., Handly, M., Karp, R. and Shenker, S., Topologically-aware overlay construction and server selection. IEEE Infocom.
[10]
H. Lim, J. Hou, C. Choi, Constructing internet coordinate system based on delay measurement, ACM IMC, 2003.
[11]
M. Malli, C. Barakat, W. Dabbous, An enhanced scalable proximity model, IEEE International Workshop on Quality of Service, 2006.
[12]
M. Malli, C. Barakat, W. Dabbous, Landmark-based end-to-end bandwidth inference, Infocom Student Workshop, 2006.
[13]
N. Hu, P. Steenkiste, Exploiting internet sharing for large scale available bandwidth estimation, ACM IMC, 2005.
[14]
Battista, G., Patrignani, M. and Pizzonia, M., Computing the types of the relationships betweeen autonomous systems. IEEE Infocom.
[15]
Gao, L., On inferring autonomous system relationships in the internet. IEEE/ACM Transactions on Networking.
[16]
Z. Mao, L. Qiu, J. Wang, Y. Zhang, On AS-level path inference, Sigmetrics, 2005.
[17]
L. Peterson, V. Pai, N. Spring, A. Bavier, Using PlanetLab for Network Research: Myths, Realities, and Best Practices, Technical Report, 2005.
[18]
J. Navratil, L. Cottrell. Available from: <http://www-iepm.slac.stanford.edu/tools/abing/>, 2004.
[19]
J. Navratil, L. Cottrell, ABwE: a pratical approach to available bandwidth estimation, PAM, 2003.
[20]
J. Navratil. Available from: <http://www.slac.stanford.edu/jiri/PLANET>, 2004.
[21]
V. Padmanabhan, L. Subramanian, An investigation of geographic mapping techniques for internet hosts, ACM SIGCOMM, 2001.
[22]
B. Wong, I. Stoyanov, E. Sirer, Octant: a comprehensive framework for the geolocalization of internet hosts, in: NSDI, 2007.
[23]
R. Bindal, P. Cao, W. Chan, Improving traffic locality in bittorrent via biased neighbour selection, in: IEEE ICDCS, 2006.
[24]
Cooperative Association for Internet Data Analysis, Available from: <http://www.caida.org/>.
[25]
Cardwell, N., Savage, S. and Anderson, T., Modeling TCP latency. IEEE Infocom.
[26]
Malli, M., Barakat, C. and Dabbous, W., An efficient approach for content delivery in overlay networks. IEEE CCNC.
[27]
Nelder, J. and Meed, R., A simplex method for function minimization. Computer Journal. v7. 308-313.
[28]
M. Costa, M. Castro, A. Rowstron, P. Key, PIC: practical internet coordinates for distance estimation, ICDCS, 2004.
[29]
S. Banerjee, T. Griffin, M. Pias, The interdomain connectivity of Planetlab nodes, ACM PAM, 2004.
[30]
K. Lakshminarayanan, V. Padmanabhan, Some findings on network performance of broadband hosts, ACM IMC, 2003.
[31]
E. Lua, T. Griffin, M. Pias, H. Zheng, J. Crowcroft, On the accuracy of embeddings for internet coordinate systems, ACM IMC, 2005.
[32]
H. Zheng, E. Lua, M. Pias, T. Griffin, Internet routing policies and round-trip-times, PAM, 2005.
[33]
M. Malli, C. Barakat, W. Dabbous, Application-level versus network-level proximity, AINTEC, 2005.
[34]
J. Ledlie, P. Gardner, M. Seltzer, Network coordinates in the wild, NSDI, 2007.
[35]
Y. Mao, L. Saul, Modelling distances in large-scale networks by matrix factorization, ACM IMC, 2004.
[36]
Mao, Y., Saul, L. and Smith, J., IDES: an internet distance estimation service for large networks. IEEE JSAC.
Index Terms
- CHESS: An application-aware space for enhanced scalable services in overlay networks
Recommendations
Increasing QoS in Selfish Overlay Networks
A routing overlay network is an application-layer overlay on the existing Internet routing substrate that allows an alternative routing service. Recent studies have suggested that such networks might contain selfish nodes, which develop their strategies ...
QoSMap: Achieving Quality and Resilience through Overlay Construction
ICIW '09: Proceedings of the 2009 Fourth International Conference on Internet and Web Applications and ServicesWe describe QoSMap, an overlay construction mechanism which computes high quality overlay networks for applications having stringent constraints on hop-degrading QoS metrics and provides resilience against the Internet’s unpredictable network behavior. ...
SPAD: A distributed middleware architecture for QoS enhanced alternate path discovery
In the next generation Internet, the network will evolve from a plain communication medium into one that provides endless services to the users. These services will be composed of multiple cooperative distributed application elements. We name these ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2007.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 April 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024