Viceroy: A Scalable and Dynamic Emulation of the Butterfly

• Relevant Publications
• Viceroy Group
• Viceroy Implementation
• Viceroy Applet Information - install plugin of java 1.4
• Ring Implementation

 

---

Links To Relevant Publications:


• Viceroy: A Scalable and Dynamic Emulation of the Butterfly. D. Malkhi, M. Naor and D. Ratajczak.
  InProceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), August 2002.
  Postscript.
• Viceroy - on the implementation of a Peer to Peer network. By O.Dobzinski and A. Talmy.
  Leibntiz Technical Report (Tech Report), Hebrew Univeristy of Jerusalem 2003.
  Postscript.
• Improved Lookup Algorithms for Viceroy. By O.Dobzinski and A. Talmy.
  To appear in DASD: Design, Analysis, and Simulation of Distrubuted Systems 2004 (DASD04) Virginia USA, 2004
  PDF.

  Back to top

    

  ---

  The viceroy group includes:
  

  Supervisor:

  Dr. Dahlia Malkhi email: dalia@cs.huji.ac.il

  Group Developers:

  AnatTalmy

  Oren Dobzinski

  Keren Horowitz

  Danny Bickson

  Roy Werber
   
  

  Back to top

  ---

  Viceroy Implementation
   

  An overview of the system and its implementation, can be found in Viceroy Overview Microsoft Word , PDF

  The complete javadoc can be found in Viceroy API.

  The source code can be found in here.

  Supervisor:

  Dr. Dahlia Malkhi

  Developers:

  Anat Talmy  , Oren Dobzinski

  In order to run the Viceroy application (not the applet), get the jar file first. The main file there is viceroy.LocalViceroyPeer. Make sure you have log4j in your classpath. You can also run statistics on viceroy: call the main class 'viceroy.ViceroyStatistics' with the parameters [size of network] [number of lookups] [type of lookup algorithm] or  with no parameters at all.

  an interesting option is to run viceroy.ViceroyStatistics  with 'X Y All', where X and Y are numbers. You will get a comparison of all algorithms. Enjoy.

  Back to top

  ---

  Viceroy Applet
  

  A short description of the below applet:

  The first view is the initial net of the peers in the form of the Viceroy topology. each node is presented as a square and they are organzied according to their ids and levels.
• You can change the view of the nodes (RING,BFS,DFS) by pressing the "Line" button;
• You can click on a node and view its attirbutes: id,address,level,connections etc.
• the "All" button presents the type of connections that you can view: the "Ring" connections, the "up" connections, the "down" connections, the "butterfly" connections and "All" includes them all.
• You can change the nodes' size by pressing the corresponding button.
• The "Ring Radius" button helps to get a full glance of the ring presentation.
• The "None" button can change the presentation for a full connections presentation, which means that all the conncetions of ALL the nodes are presented.
• The "Join" button stands for the operations one can apply on the viceroy network; join, leave and lookup. In order to perform a leave/lookup operations, one must click the relevant peer which is supposed to perform this action. The button with the number inside indicates the number of peers that one might want to join the system. The button with the title "lookup val" indicates the value which one might want to look for. Of course after setting the correct operation and its argument one must click the "Trigger Action" button.

  Attention: If, for example, the ids of two nodes are close, it could happen that in the GUI one of them would not be seen. Try to change to "Ring" view and diminish the size of the nodes and then return to "Line" view.

  Back to top

  ---

  Ring Implementation
  

  Implementation of Distributed Hash Table in a ring with atomic data access.

  Implementation of viceroy cummnication layer.

  Supervisor:

  Dr. Dahlia Malkhi

  Developer:

  Danny Bickson  

  An overview of the system and its implementation can be found in Ring Doc.

  The complete javadoc can be found in Ring API.

  The source code can be found in here.

  Back to top