Abstract
In todays Internet, a trend towards distributed content delivery systems can be observed. These systems still have to offer the same functionality as centralized architectures, e.g. content localization. While several advantages like load distribution and cost reduction could be gained by using a decentralized distribution platform, they come with a tradeoff in resource consumption. In this paper, we analyze and evaluate a decentralized Content Distribution Application (CDA) with respect to the time needed to locate specific content. We introduce a node model based on queueing theory and provide methods to compute important characteristics like the mean search time. In this model, we do not only consider the external offered load, but also the internal traffic created as a consequence of decentralization.
This work was funded by Siemens AG, Berlin. The authors alone are responsible for the content of the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Proceedungs of the Ninth Workshop on Hot Topics in Operating Systems, Lihue, Hawaii, May 2003 (2003)
Gupta, A., Liskov, B., Rodrigues, R.: Efficient routing for peer-to-peer overlays. In: Proceedings of the First Symposium on Networked Systems Design and Implementation, San Francisco, CA, March 2004 (2004)
Leong, B., Lik, J.: Achieving one-hop dht lookup and strong stabilization by passing tokens. In: 12th International Conference on Networks (ICON 2004), Singapore (November 2004)
Luiz, R.: Monnerat and Claudio L. Amorim. D1ht: A distributed one hop hash table. Rhodes, Greece, April 2006, IEEE International Parallel & Distributed Processing Symposium (2006)
Vinod Muthusamy and Hans-Arno Jacobsen. Small-scale peer-to-peer publish/subscribe. P2PKM’05: Peer-to-Peer Knowledge Management, San Diego, CA, USA (July 2005)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003), doi:10.1145/638334.638336
Takagi, H.: Queueing Analysis: A Foundation of Performance Evaluation, vol. 1. North-Holland, Amsterdam, Netherlands (1991)
Takács, L.: A single server queue with poisson input. Operat. Res. 10, 388–397 (1962)
Thomas Raith. Leistungsuntersuchung von Multi-Bus-Verbindungsnetzwerken in lose gekoppelten Systemen. PhD thesis, Universität Stuttgart (1986)
Tran-Gia, P.: Discrete-time analysis technique and application to usage parameter control modelling in ATM systems. In: Proceedings of the 8th Australian Teletraffic Research Seminar, Melbourne, Australia, (December 1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oechsner, S., Tran-Gia, P. (2007). Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)