On TechRepublic: Five super-secret features in Windows 7
BNET Business Network:
BNET
TechRepublic
ZDNet

FREE Registration is required

Overview:

A distributed online algorithm is considered for maximizing throughput in a network of clients and servers, modeled as a bipartite graph. Unlike most prior work on online load balancing, it do not assume centralized control and seek algorithms and lower bounds for decentralized algorithms in which each participant has only local knowledge about the state of itself and its neighbors. This problem can be seen as analogous to the recent work on oblivious routing in, but with the objective of maximizing throughput rather than minimizing congestion. In contrast to that work, it proves a strong lower bound (polynomial in n, the size of the graph) on the competitive ratio of any oblivious algorithm.

(Is this item miscategorized? Does it need more tags? Let us know.)

Format:PDFSize:192 KB
Date:Jan 2008
Pages:26
advertisement

White Papers, Webcasts, and Resources

Featured Training Courses

advertisement

SmartPlanet

Click Here

Returning users: Log In Here!

Already registered on BNET, TechRepublic, or ZDNet? Simply log in.

Free Membership: Sign Up Now!

Sign up for a free membership today and get instant and unlimited access to one of the largest databases of white papers, webcasts, and casestudies anywhere. Your FREE membership allows you to:

  • Download an unlimited amount of content, including classic and current white papers, case studies, webcasts and more
  • Track content on your chosen topics of interest
  • Receive targeted email alerts when your favorite content is added
  • Save content for future reading
  • Receive our member newsletter

When you register to access this library, you allow us to share your information with companies that produce products or services featured in the library--so that such companies may contact you with information and offers regarding their products and services. This enables us to keep the library a free service. As a library registrant, you will receive a complimentary subscription to the ZDNet white paper newsletter and e-mail Must-Read News Alerts. You can unsubscribe from these at any time. By clicking the Sign up button, you indicate that you agree to our Terms and Conditions and have read and understand our Privacy Policy (updated).