%0 Conference Paper %B 2011 Proceedings IEEE INFOCOM %D 2011 %T Decentralized, accurate, and low-cost network bandwidth prediction %A Sukhyun Song %A Keleher,P. %A Bhattacharjee, Bobby %A Sussman, Alan %K accuracy %K approximate tree metric space %K Bandwidth %K bandwidth allocation %K bandwidth measurement %K decentralized low cost system %K distributed tree %K end-to-end prediction %K Extraterrestrial measurements %K Internet %K low-cost network bandwidth prediction %K Measurement uncertainty %K pairwise bandwidth %K Peer to peer computing %K Prediction algorithms %K trees (mathematics) %X The distributed nature of modern computing makes end-to-end prediction of network bandwidth increasingly important. Our work is inspired by prior work that treats the Internet and bandwidth as an approximate tree metric space. This paper presents a decentralized, accurate, and low cost system that predicts pairwise bandwidth between hosts. We describe an algorithm to construct a distributed tree that embeds bandwidth measurements. The correctness of the algorithm is provable when driven by precise measurements. We then describe three novel heuristics that achieve high accuracy for predicting bandwidth even with imprecise input data. Simulation experiments with a real-world dataset confirm that our approach shows high accuracy with low cost. %B 2011 Proceedings IEEE INFOCOM %I IEEE %P 6 - 10 %8 2011/04/10/15 %@ 978-1-4244-9919-9 %G eng %R 10.1109/INFCOM.2011.5935251 %0 Conference Paper %B IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09 %D 2009 %T Rigorous Probabilistic Trust-Inference with Applications to Clustering %A DuBois,Thomas %A Golbeck,Jennifer %A Srinivasan, Aravind %K Clustering algorithms %K Conferences %K Educational institutions %K Extraterrestrial measurements %K Inference algorithms %K Intelligent agent %K random graphs %K Social network services %K trust inferrence %K Visualization %K Voting %K Web sites %X The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how trustworthy its creator is. Since no individual can have direct knowledge of more than a small fraction of information authors, methods for inferring trust are needed. We propose a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph. In addition to having an intuitive interpretation, our algorithm has several advantages, noteworthy among which is the creation of an inferred trust-metric space where the shorter the distance between two people, the higher their trust. Metric spaces have rigorous algorithms for clustering, visualization, and related problems, any of which is directly applicable to our results. %B IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09 %I IEEE %V 1 %P 655 - 658 %8 2009/09/15/18 %@ 978-0-7695-3801-3 %G eng %R 10.1109/WI-IAT.2009.109 %0 Journal Article %J IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews %D 2003 %T A secure PLAN %A Hicks, Michael W. %A Keromytis,A. D %A Smith,J. M %K active networks %K active-network firewall %K Authentication %K Authorization %K Contracts %K cryptography %K Environmental management %K Extraterrestrial measurements %K functionally restricted packet language %K general-purpose service routines %K Internet %K latency overhead %K namespace-based security %K packet switching %K PLANet %K Planets %K privilege level %K programmable networks %K Safety %K safety risks %K secure PLAN %K security of data %K security risks %K trust management %K two-level architecture %K virtual private network %K Virtual private networks %K Web and internet services %X Active networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This correspondence describes the design and implementation of a security architecture for the active network PLANet. Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN, with an environment of general-purpose service routines governed by trust management. In particular, a technique is used which expands or contracts a packet's service environment based on its level of privilege, termed namespace-based security. The design and implementation of an active-network firewall and virtual private network is used as an application of the security architecture. Measurements of the system show that the addition of the firewall imposes an approximately 34% latency overhead and as little as a 6.7% space overhead to incoming packets. %B IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews %V 33 %P 413 - 426 %8 2003/08// %@ 1094-6977 %G eng %N 3 %R 10.1109/TSMCC.2003.817347