|
||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||
ABSTRACT
In this paper, we present a distributed algorithm that autonomously adapts the routing configuration in a broker overlay network to dynamically optimize the system. The possibility of adaptation arises from a new kind of routing algorithms, called hybrid routing algorithms, that combine the usage of different routing algorithms in one overlay network. The presented algorithm works decentralized without global knowledge, performs the optimizations link by link at runtime, and generates only marginal extra traffic. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
General Terms:
Keywords:
Collaborative Colleagues:
|
||||||||||||||||||||||||||||||||