Replication for web hosting systems

Sivasubramanian, S.; Szymaniak, Michal; Pierre, Guillaume; Steen, Maarten van

doi:10.1145/1035570.1035573

Cited by 116 publications

(62 citation statements)

References 84 publications

(116 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Data placement problems have been studied extensively in the context of database management (Gavish and Suh 1992;Liu Sheng and Lee 1992;Pirkul 1986;Wolfson et al 1997), organization of distributed file systems (Bokhari 1987;Laning and Leonard 1983), cooperative caching in networks (Korupolu et al 1999), and more recently, content delivery networks and Web traffic (Bektas et al 2007(Bektas et al , 2008; Rodolakis et al 2006;Sivasubramanian et al 2004). Related problems of on-line data management were considered in the competitive analysis framework, e.g.…”

Section: Related Workmentioning

confidence: 99%

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

Drwal

Józefczyk

2013

Ann Oper Res

View full text Add to dashboard Cite

The data placement problem arises in the design and operation of Content Delivery Networks-computer systems used to efficiently distribute Internet traffic to the users by replicating data objects (media files, applications, database queries, etc.) and caching them at multiple locations in the network. This allows not only to reduce the processing load on the server hardware, but also helps eliminating transmission network congestion. Currently all major Internet content providers entrust their offered services to such systems. In this paper we formulate the data placement problem as quadratic binary programming problem, taking into account server processing time, storage capacity and communication bandwidth. Two decomposition-based solution approaches are proposed: the Lagrangian relaxation and randomized rounding. Computational experiments are conducted in order to evaluate and compare the performance of presented algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

Drwal

Józefczyk

2013

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…But still some major issues in this design are [2] 1) How do we select and estimate the metrics for taking replication decisions? 2) When do we replicate a given document?…”

Section: An Overview Of File Server Group In Distributed Systemsmentioning

confidence: 99%

An Overview of File Server Group in Distributed Systems

Zakarya¹,

Rahman²,

Ullah³

2012

IJET

View full text Add to dashboard Cite

Abstract-The file server is a key factor to accomplish the data sharing essential in distributed systems. The file server is perhaps the most heavily used resource of the distributed systems and as an outcome; its performance is vital and critical to the victory of the system. The explosive growth of the Web contents and Internet users has led to increasing concentration on two major challenges in these systems: scalability and high availability of network file system. A simple load-sharing mechanism for the NFS client to switch to a lightly-load server based on the number of NFS client's RPC requests for a period of time, making these systems more efficient and scalable. The replication techniques are used for improving the availability of Distributed systems in FSG. We also discussed distributed application in terms of java programming language. In this paper we have proposed a new architecture for Distributed Systems that provides better security. Our proposed solution is more secure & efficient in the sense that a client can not search the whole group for a specific file, because the group header maintains a huge database of all the group members along with their specific services they offers. Also load balancing mechanism is improved where the group header keeps a record of connected users to a specific server. Every group member is not required to advertise their state.Index Terms-Sun network file system (NFS), file server group (FSG), andrew file system (AFS), group header (GH), secure file system (SFS), log-structured file system (LFS), serverless file system (XFS / xFS).

show abstract

“…See, for example [37] for comprehensive information on many aspects of CDNs and [80] for a survey on the technical aspects of replication. Surveys on P2P systems can be found in e.g., [2,5].…”

Section: Notesmentioning

confidence: 99%

Network Coding Applications

Fragouli

Soljanin²

2007

FNT in Networking

133

View full text Add to dashboard Cite

Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial deals with wireless and content distribution networks, considered to be the most likely applications of network coding, and it also reviews emerging applications of network coding such as network monitoring and management. Multiple unicasts, security, networks with unreliable links, and quantum networks are also addressed. The preceding companion deals with theoretical foundations of network coding.

show abstract

Replication for web hosting systems

Cited by 116 publications

References 84 publications

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

An Overview of File Server Group in Distributed Systems

Network Coding Applications

Contact Info

Product

Resources

About