Collaborative Web Hosting: Challenges and Research Directions (SpringerBriefs in Computer Science)

Collaborative Web Hosting: Challenges and Research Directions (SpringerBriefs in Computer Science)

Reaz Ahmed, Raouf Boutaba 

Language: English

Pages: 58

ISBN: 3319038060

Format: PDF / Kindle (mobi) / ePub

This brief presents a peer-to-peer (P2P) web-hosting infrastructure (named pWeb) that can transform networked, home-entertainment devices into lightweight collaborating Web servers for persistently storing and serving multimedia and web content. The issues addressed include ensuring content availability, Plexus routing and indexing, naming schemes, web ID, collaborative web search, network architecture and content indexing. In pWeb, user-generated voluminous multimedia content is proactively uploaded to a nearby network location (preferably within the same LAN or at least, within the same ISP) and a structured P2P mechanism ensures Internet accessibility by tracking the original content and its replicas. This new paradigm of information management strives to provide low or no-cost cloud storage and entices the end users to upload voluminous multimedia content to the cloud data centers. However, it leads to difficulties in privacy, network architecture and content availability. Concise and practical, this brief examines the benefits and pitfalls of the pWeb web-hosting infrastructure. It is designed for professionals and practitioners working on P2P and web management and is also a useful resource for advanced-level students studying networks or multimedia.

Handbook of Data Structures and Applications

Clustering-Based Support for Software Architecture Restructuring (Software Engineering Research)

Building a Recommendation System with R

Python Network Programming Cookbook





















support partial keyword matching is considered a handicap for DHT-techniques. In the last few years a number of research efforts have focused on extending DHT-techniques for supporting keyword search. Most of these approaches adopted either of the following two strategies: 4.2 Web Search in P2P Networks 29 • Build an additional layer on top of an existing routing mechanism, like Chord [26], CAN [20] or Tapestry [35]. The aim is to reduce the number of DHT lookups per search by mapping related

that assumes a value of one when webpage ui contains 40 4 Collaborative Web Search Algorithm 7 Publish webpage 1: Inputs: ui : URL of the webpage to be advertised 2: Functions: h¯ (ui ): hash map ui to a codeword γr (P): {ck |ck ∈ C ∧ δ (P, ck ) ≤ r} lookup(ck ): Finds the peer that stores ck 3: β (ui ) ← lookup(¯h(ui )) 4: for all out-link uit of {ui } do 5: β (uit ) ← lookup(¯h(uit ))) 6: end for 7: wi ← initial PageRank of ui 8: store < ui , wi , {uit , β (uit )} > to peer β (ui ) 9: Ki

availability-prediction guided replica placement [2, 11], and probabilistic models [12] to reduce redundancy while retaining high availability. These approaches rely on quantitative replication, whereas S-DATA combines both time-based and quantitative replication strategies. Another major difference of S-DATA with these schemes is that they make no distinction between transient and permanent disconnections and data stored at a peer is reused upon its return to the system. Ignoring stored data

codeword Y can be generated from any other codeword X as follows: Y = (X ⊕ gi1 ⊕ gi2 ⊕ . . . ⊕ git ), where gi1 , gi2 , . . . git ∈ G and ⊕ is bitwise XOR operation). Peer X will forward the message to any of X2 (= X ⊕ g2 ), X3 (= X ⊕ g3 ) or X5 (= X ⊕ g5 ), which are one hop nearer to Y than X. If the message is forwarded to X2 then X2 can route the message to Y via X23 (= X ⊕ g2 ⊕ g3 ) or X25 (= X ⊕ g2 ⊕ g5 ). In such an overlay, it is possible to route a query from any source to any

should be independent of the spatial and temporal scope of the referred document. There should also exist easy conversion mechanism for converting URLs to the new naming system, and vice versa. P2P Web system requires a human-readable, flexible naming scheme. The naming authority should be distributed as well as the name resolution architecture. The naming scheme should be compatible with widely accepted Internet naming standards. Below is a list of requirements for naming Web contents in a P2P

Download sample