Gossip-Based Topology Inference For Efficient Overlay Mapping On Data Centers

Thorsten Schütt,Alexander Reinefeld,Florian Schintke,Marie Hoffmann

2009 IEEE NINTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P 2009)（2009）

引用 7|浏览6

暂无评分

摘要

We present a distributed algorithm for identifying the location of data centers and their relative sizes. This topology information can be used in P2P systems to improve the routing performance, replica placement, or job scheduling.The algorithm uses gossiping with local agglomerative clustering. It is robust to failures and it correctly identifies outliers that are caused, e.g., by temporarily overloaded nodes or network, failures. We present empirical results on the Grid 5000 testbed.

查看译文

关键词

data center,scheduling,job scheduling,topology,routing,clustering algorithms,distributed algorithms,agglomerative clustering,data mining,distributed algorithm,network topology

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要