Presented by Nick Farnan 11-11-08. New Protocols for Asymmetric Communication Channels. Asymmetric Communications. Setup: Client needs to send server an n -length bit string x
PowerPoint Slideshow about ' New Protocols for Asymmetric Communication Channels' - gannon-hardin
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Proposed for the Web to make particular pages on a site more accessible
Given a rooted tree where each leaf has a probability attached to it (let D be the distribution of these probabilities), the Hotlinking problem moves subtrees up the tree closer to to the root in order to minimize the cost of the tree as a whole.
A k-hotlink-assignment of T is obtained by performing up to k adoptions (where k is some integer) at the root of T, creating T1, and the further find a k-hotlink-assignment for each subtree of T1 that is a child of the root.
This problem has been show to be generalized as: at each node u, adopt a its descendants until all descendants of u are either leaves or have a cost <= (2/(k+2)) * c(u)
Let T be a complete binary tree with 2nleaves (where n is the length of the string being sent from client to server) and a label on each edge such that all edges leading to left children have the label 0 and all the right are labeled 1
Each vertex is then labeled with its path from the root (i.e. going left, right then left from the root would lead to a node labelled “010”)