Abstract
In this paper, we take an availability-centric view on Quality of Service (QoS) and focus on the issues of providing availability guarantees for widely distributed systems such as web servers and peer-to-peer (P2P) file sharing systems. We propose a concept called Quality of Availability (QoA) in which the availability is treated as a new controllable QoS parameter. The newly refined fine-grained availability definitions and QoA metrics enable the specification and evaluation of the different level of availability for different users and applications. We tackle specifically the replica placement (RP) problem where our focus is on choosing the number and location of replicas while (1) meeting different availability QoS requirement levels for all individual users and (2) taking the intermittent connectivity of system nodes explicitly into account. We decompose the RP problem into two sub-problems: (1) improving QoA and (2) guaranteeing QoA. We investigate a number of simulations - for full and partial replication models and static and dynamic placements - to compare and evaluate the achieved availability QoS of the developed RP algorithms. Our proposed QoA concept and model can be used as a base mechanism for further study on the effectiveness of realistic replication schemes on both availability and performance QoS for widely distributed systems.
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
Zheng Wang. Internet QoS: Architectures and Mechanisms for Quality of Service. Lucent Technologies, 2001.
J. Schmitt. Heterogeneous Network QoS Systems. Kluwer Academic Pub., June 2001. ISBN 0-793-7410-X.
H. Schulzrinne. “QoS over 20 Years”. Invited Talk in IWQoS’01. Karlsruhe, Germany, 2001.
HP Forum. Providing Open Architecture High Availability Solutions, Revision 1.0, Feb. 2001. document available at <http://www.mcg.mot.com/us/products/ solutions/ha_solutions_OnlinePDF.pdf
G. Coulouris, J. Dollimore and T. Kindberg. Distributed Systems, 3rd Ed., Addison-Wesley, 2001.
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. “Search and replication in unstructured peer-to-peer networks.” In Proc. of the 16th annual ACM International Conf. on Supercomputing (ICS’02), New York, USA, June 2002.
E. Cohen and S. Shenker. Replication Strategies in unstructured peer-to-peer networks. In Proc. of ACM SIGCOMM’02, Pittsburgh, USA, Aug. 2002.
Gnutella. http://www.gnutella.com/.
KaZaA. http://www.kazaa.com/.
G. On, J. Schmitt and R. Steinmetz. “On Availability QoS for Replicated Multimedia Service and Content.” in LNCS 2515 (IDMS-PROMS’02), pp. 313–326, Portugal, Nov. 2002.
Christos H. Papadimitrio and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, ISBN 0-13-152462-3, 1982.
C. Lucet and J.-F. Manouvrier. “Exact Methods to compute Network Reliability”. In Proc. of 1st International Conf. on Mathematical Methods in Reliability, Bucharest, Roumanie, Sep. 1997.
LEDA-the library of efficient data types and algorithms. Algorithmic Solutions Software GmbH. software available at <http://www.algorithmic-solutions.com/
J. Kangasharju, J. Roberts and K.W. Ross. “Object Replication Strategies in Content Distribution Networks”, Computer Communications, Vol.25(4), pp. 376–383, March 2002.
S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt and L. Zhang. “On the Placement of Internet Instrumentation”, In Proc. of IEEE INFOCOM’00, Mar. 2000.
S. Jamin, C. Jin, A. R. Kurc, D. Raz, Y. Shavitt. “Constrained Mirror Placement on the Internet”, In Proc. of IEEE INFOCOM’01, pp. 31–40, 2001.
P. Krishnan, D. Raz and Y. Shavitt. “The Cache Location Problem”, In IEEE/ACM Transactions on Networking, 8(5), pp. 568–582, Oct. 2000.
J. Kangasharju, K.W. Ross, and D. Turner. Optimal Content Replication in P2P Communities. Manuscript. 2002.
G. On, J. Schmitt and R. Steinmetz. “Admission Controlled Replica Placement algorithms.” Technical Report KOM-TR-2003-7, April. 2003.
Haifeng Yu and Amin Vahdat. “Minimal Replication Cost for Availability” In Proc. of the 21th ACM Symposium on Principles of Distributed Computing (PODC), July 2002.
N. Mladenovic, M. Labbe and P. Hansen. “Solving the p-Center Problem with Tabu Search and Variable Neighbourhood Search” July 2000. paper available at <http://www.crt.umontreal.ca/>
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
On, G., Schmitt, J., Steinmetz, R. (2003). Quality of Availability: Replica Placement for Widely Distributed Systems. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive