Supporting Research

From VuzeWiki
Jump to: navigation, search

Over the years Azureus/Vuze has made its platform available to university researchers from around the world to prototype and test various areas of research.


Dasu[edit]

http://www.aqualab.cs.northwestern.edu/projects/Dasu.html

Some Internet Service Providers (ISPs) set complex policies based on time of day, service level or application; others are known to over-subscribe their networks, actively shape traffic or even discourage heavy hitters. To you, the end user, these policies translate into noticeable time-of-day variations on bandwidth availability, limited performance for specific applications, or simply overall degradation of the quality of service received. As a consumer you want to be sure that you are getting the service that you're paying for and are informed of any network management practices that impact your performance. The main goal of Dasu is to efficiently capture these variations by constantly monitoring and measuring the level of service provided by your ISP, so that you can make informed decisions about your choice of service provider.

Ono[edit]

http://www.aqualab.cs.northwestern.edu/projects/Ono.html

The main goal of this plugin is simple -- to improve download speeds for your BitTorrent client. For most P2P applications, the decision regarding which peer to download from is generally arbitrary. When most peers offer good download performance, the random solution works well. However, if most peers are in a different part of the world from you, your downloads can really suffer.

The Ono plugin avoids this by proactively finding peers that are close to you (in a networking sense). These peers generally offer better response time, which can lead to significantly improved performance. We identify those peers that are near you by reusing network measurements from content distribution networks (CDNs), i.e. without performing extensive path measurement or probing.

HVI[edit]

http://bussard-c0llect0r.ath.cx/hvi/1013-general/

Hierarchical Vivaldi (HVI) coordinate system.

http://www.youtube.com/watch?v=vVXWaCRigI0

Syrah[edit]

http://www.eecs.harvard.edu/~syrah/nc/wild-web/

Network coordinates provide a mechanism for selecting and placing servers efficiently in a large distributed system. This approach works well as long as the coordinates continue to accurately reflect network topology. We conducted a long-term study of a subset of a million-plus node coordinate system and found that it exhibited some of the problems for which network coordinates are frequently criticized, for example, inaccuracy and fragility in the presence of violations of the triangle inequality. Fortunately, we show that several simple techniques remedy many of these problems. Using the Azureus BitTorrent network as our testbed, we show that live, large-scale network coordinate systems behave differently than their tame PlanetLab and simulation-based counterparts. We find higher relative errors, more triangle inequality violations, and higher churn. We present and evaluate a number of techniques that, when applied to Azureus, efficiently produce accurate and stable network coordinates.

Vanish[edit]

http://vanish.cs.washington.edu/

Computing and communicating through the Web makes it virtually impossible to leave the past behind. College Facebook posts or pictures can resurface during a job interview; a lost or stolen laptop can expose personal photos or messages; or a legal investigation can subpoena the entire contents of a home or work computer, uncovering incriminating or just embarrassing details from the past.

Our research seeks to protect the privacy of past, archived data — such as copies of emails maintained by an email provider — against accidental, malicious, and legal attacks. Specifically, we wish to ensure that all copies of certain data become unreadable after a user-specified time, without any specific action on the part of a user, without needing to trust any single third party to perform the deletion, and even if an attacker obtains both a cached copy of that data and the user's cryptographic keys and passwords.

Cubit[edit]

http://www.cs.cornell.edu/~bwong/cubit

Cubit is a system that provides fully decentralized approximate keyword search capabilities to Azureus as a standard plugin. Approximate search means that you can use Cubit to find a movie, song or artist even if you don't know which spelling variation is used in the title or in her name. It gives you what you mean instead of what you asked for exactly, and returns the best results in the network in only a few seconds.

http://sourceforge.net/projects/cubit

P4P[edit]

http://www-net.cs.yale.edu/p4p/vuze/

P4P is an on-going research project at the Laboratory of Networked Systems at Yale University to make peer-to-peer (P2P) applications faster and more network efficient. Current P2P applications can be network inefficient, since they may download content from random peers in different networks or parts of the world, which can be costly to Internet service providers (ISPs). Thus, improvements to P2P network efficiency can help acceptance of P2P by these providers. Recent large-scale field tests have demonstrated that P4P achieves these goals.

Torrent Guard[edit]

http://torrentguard.netcom.it.uc3m.es/bittorrent/torrentguard/bittorrent/torrentguard/index.html

TorrentGuard: stopping scam and malware distribution in the BitTorrent ecosystem.

Treeple[edit]

http://cs.okstate.edu/~khethav/Research.html

Treeple is a new scheme for secure latency estimation for P2P networks. Integration of this scheme will improve latency estimation for peers which in-turn can be used to help improve download performance. The goal of plugin is to enable further research into secure and accurate network coordinate systems (e.g. Vivaldi is installed on Vuze). Network coordinate systems allow accurate estimation of pairwise network distances between nodes on the Internet, without the two nodes contacting each other. This is useful in many applications, such as reducing inter-ISP communication and downloading a file from the closest node.