Download E-books Collaborative Web Hosting: Challenges and Research Directions (SpringerBriefs in Computer Science) PDF

By Reaz Ahmed, Raouf Boutaba 

This short provides a peer-to-peer (P2P) web-hosting infrastructure (named pWeb) which may rework networked, home-entertainment units into light-weight taking part internet servers for over and over storing and serving multimedia and websites. the problems addressed contain making sure content material availability, Plexus routing and indexing, naming schemes, net identification, collaborative net seek, community structure and content material indexing. In pWeb, user-generated voluminous multimedia content material is proactively uploaded to a close-by community place (preferably in the comparable LAN or no less than, in the related ISP) and a dependent P2P mechanism guarantees net accessibility through monitoring the unique content material and its replicas. This new paradigm of data administration strives to supply low or no-cost cloud garage and entices the top clients to add voluminous multimedia content material to the cloud facts facilities. notwithstanding, it ends up in problems in privateness, community structure and content material availability. Concise and functional, this short examines the advantages and pitfalls of the pWeb web-hosting infrastructure. it's designed for pros and practitioners engaged on P2P and internet administration and is usually an invaluable source for advanced-level scholars learning networks or multimedia.

Show description

Read Online or Download Collaborative Web Hosting: Challenges and Research Directions (SpringerBriefs in Computer Science) PDF

Similar Computer Science books

Programming Massively Parallel Processors: A Hands-on Approach (Applications of GPU Computing Series)

Programming vastly Parallel Processors discusses easy ideas approximately parallel programming and GPU structure. ""Massively parallel"" refers back to the use of a big variety of processors to accomplish a collection of computations in a coordinated parallel approach. The ebook information quite a few thoughts for developing parallel courses.

Cyber Attacks: Protecting National Infrastructure

No country – particularly the USA – has a coherent technical and architectural process for fighting cyber assault from crippling crucial serious infrastructure prone. This e-book initiates an clever nationwide (and foreign) discussion among the overall technical group round right equipment for lowering nationwide probability.

Cloud Computing: Theory and Practice

Cloud Computing: idea and perform presents scholars and IT pros with an in-depth research of the cloud from the floor up. starting with a dialogue of parallel computing and architectures and dispensed platforms, the booklet turns to modern cloud infrastructures, how they're being deployed at top businesses resembling Amazon, Google and Apple, and the way they are often utilized in fields akin to healthcare, banking and technological know-how.

Platform Ecosystems: Aligning Architecture, Governance, and Strategy

Platform Ecosystems is a hands-on advisor that gives a whole roadmap for designing and orchestrating vivid software program platform ecosystems. not like software program items which are controlled, the evolution of ecosystems and their myriad contributors has to be orchestrated via a considerate alignment of structure and governance.

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

Show sample text content

The API of the naming authority contains the next services: RegisterWebID(WebID) and InvalidateWebID(WebID). those services are officially offered in Algorithms 1 and three, respectively. The functionality RegisterWebID(webID), is utilized by a peer to check in its net IDs with the naming authority. A peer first generates an internet identification for its site. the main points in regards to the internet identification new release strategy can be mentioned in Sect. three. four. 6. The functionality first unearths out the first code be aware (targetCodeWord) answerable for the internet identity. Then it creates a listing of code phrases that fall in the Hamming sphere of radius r (which is an international parameter) headquartered at targetCodeWord. The functionality iterates over the record and registers the internet identity by means of checking even if the peer linked to the code notice is alive or no longer after which checking the distinctiveness of the net identification utilizing the API functionality IsPeerAlive and sign in. check in easily saves the mapping among pRL and peer IP:port tackle. If the functionality can effectively sign in the net identity no less than at one peer then it returns precise another way returns fake. If failure happens then the peer has to generate one other internet identity and take a look at to sign in back. three. four A Collaborative Naming Scheme 23 set of rules 1 RegisterWebID(webID) 1: 2: three: four: five: 6: 7: eight: nine: 10: eleven: 12: thirteen: 14: 15: count number ← zero targetCodeWord ← encode(webId) codeWordList ← [targetCodeWord, decode(targetCodeWord, r)] {r is an international parameter} for all codeWord ∈ codeWordList do if IsPeerAlive(codeWord) = precise then if Register(codeWord, webID) = actual then count number ← count number + 1 finish if finish if finish for if count number > zero then go back real else go back fake finish if The peer linked to the first code observe is answerable for protecting the pRL mapping information replicated around the overlay community. each peer storing a few pRL mapping runs set of rules 2 to keep up an appropriate variety of replicas. The research for quantifying the precise variety of replicas in varied community stipulations will depend on the Plexus routing protocol. set of rules 2 ReplicateWebID(webID) 1: webIDList ← WebIDs from in the neighborhood saved pRL mappings 2: for all webID ∈ webIDList do three: targetCodeWord ← encode(webId) four: if targetCodeWord = localCodeWord then five: codeWordList ← [decode(targetCodeWord, r)] 6: for all codeWord ∈ codeWordList do 7: Register(codeWord, webID) eight: finish for nine: finish if 10: finish for whilst a peer comes to a decision to delete its web site from pWeb, it makes use of the functionality InvalidateWebID(WebID). This functionality invalidates all pRL mapping replicas from all friends. set of rules three InvalidateWebID(webID) 1: 2: three: four: five: targetCodeWord ← encode(webId) codeWordList ← [targetCodeWord, decode(targetCodeWord, r)] {r is an international parameter} for all codeWord ∈ codeWordList do Invalidate(codeWord, webID) finish for 24 three Naming three. four. five identify solution The identify answer approach is lovely common and follows an identical precept because the algorithms offered within the earlier part. whilst a peer desires to unravel a pRL, it makes use of the encode functionality to determine the first codeword, and the decode functionality to discover the codewords inside Hamming radius (r) of the first codeword (i.

Rated 4.13 of 5 – based on 18 votes

About the Author