Computers & Internet Books:

Link Reversal Algorithms

Customer rating

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Share this product

Link Reversal Algorithms by Jennifer Welch
Save $39.00
$66.99 was $105.99
or 4 payments of $16.75 with Learn more
In stock with supplier

The item is brand new and in-stock in with one of our preferred suppliers. The item will ship from the Mighty Ape warehouse within the timeframe shown below.

Usually ships within 3-4 weeks

Availability

Delivering to:

Estimated arrival:

  • Around 23-29 August using Express Delivery
    Mighty Ape can deliver this product within 1-2 business days (usually overnight) to urban centres across Australia, and some remote areas. Learn more
  • Around 24-31 August using standard courier delivery

Description

Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered.
Release date Australia
January 1st, 2010
Country of Publication
United States
Imprint
Morgan & Claypool Publishers
Pages
103
Dimensions
187x235x5
ISBN-13
9781608450411
Product ID
6651466

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

  • If you think we've made a mistake or omitted details, please send us your feedback. Send Feedback
  • If you have a question or problem with this product, visit our Help section. Get Help
  • Seen a lower price for this product elsewhere? We'll do our best to beat it. Request a better price
Filed under...