摘要: Data-intensive distributed applications can increase their performance by running on a cluster of hosts connected via high-bandwidth interconnections. However, there is no effective method to find such bandwidth-constrained in decentralized fashion. Our work inspired prior that treats Internet bandwidth as an approximate tree metric space. This paper presents decentralized, accurate, and efficient hosts, given the desired size minimum interconnection bandwidth. We describe centralized polynomial time algorithm for space, along with proof correctness. then provide version algorithm. Simulation experiments two real-world datasets confirm our clustering approach achieves high accuracy scalability. also discuss costs decentralization how treeness dataset affects accuracy.
sci-hub.se 参考文章(25)
Sung-Ju Lee, Puneet Sharma, Sujata Banerjee, Sujoy Basu, Rodrigo Fonseca, Measuring Bandwidth Between PlanetLab Nodes Lecture Notes in Computer Science. pp. 292- 305 ,(2005) , 10.1007/978-3-540-31966-5_23
Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque, Distributed Approximation Algorithm for Resource Clustering Structural Information and Communication Complexity. pp. 61- 73 ,(2008) , 10.1007/978-3-540-69355-0_7
Sukhyun Song, Pete Keleher, Bobby Bhattacharjee, Alan Sussman, Brief announcement: decentralized network bandwidth prediction international symposium on distributed computing. pp. 198- 200 ,(2010) , 10.1007/978-3-642-15763-9_19
Venugopalan Ramasubramanian, Fabian Kuhn, Ittai Abraham, Archit Gupta, Dahlia Malkhi, Aditya Akella, Mahesh Balakrishnan, A Unified Network Coordinate System for Bandwidth and Latency pp. 15- ,(2008)
Les Cottrell, pathChirp: Efficient available bandwidth estimation for network paths Proc. Passive and Active Measurements Workshop, Apr. 2003. ,(2003) , 10.2172/813038
A. Aggarwal, H. Imai, N. Katoh, S. Suri, Fining k points with minimum spanning trees and related problems symposium on computational geometry. pp. 283- 291 ,(1989) , 10.1145/73833.73865
Shishir Bharathi, Ann Chervenak, Ewa Deelman, Gaurang Mehta, Mei-Hui Su, Karan Vahi, Characterization of scientific workflows workflows in support of large-scale science. pp. 1- 10 ,(2008) , 10.1109/WORKS.2008.4723958
David Eppstein, Jeff Erickson, Iterated nearest neighbors and finding minimal polytypes symposium on discrete algorithms. pp. 64- 73 ,(1993) , 10.5555/313559.313612
Jeannie Albrecht, David Oppenheimer, Amin Vahdat, David A. Patterson, Design and implementation trade-offs for wide-area resource discovery ACM Transactions on Internet Technology. ,vol. 8, pp. 18- ,(2008) , 10.1145/1391949.1391952
Jaehwan Lee, Pete Keleher, Alan Sussman, Decentralized resource management for multi-core desktop grids international parallel and distributed processing symposium. pp. 1- 11 ,(2010) , 10.1109/IPDPS.2010.5470420