CONTENT ADDRESSABLE NETWORK
CONTENT ADDRESSABLE NETWORK DISTRIBUTED SYSTEMS PROJECT
INNOCENTI MANZINELLO MOLINAROLI
THE CONTENT-ADDRESSABLE NETWORK ¡ 2-DIMENSIONAL CARTESIAN COORDINATE SPACE ¡ EACH NODE HAS A RECTANGULAR ZONE ¡ BOOTSTRAP NODE MANAGES NODES’ JOIN
JAVA RMI ¡ WE HAVE CHOSEN JAVA RMI FOR THE COMUNICATION BET WEEN NODES ¡ JAVA RMI GIVES US THE POSSIBILIT Y TO SEND REFERENCE OF REMOTE OBJECTS AND CALL METHODS EASILY ¡ GOOD FOR OBJECT ORIENTED PROGRAMMING
ROUTING ¡ route(Message message) CALLED BY ANY NODE THAT NEEDS TO SEND A PACKET TO THE NEXT NODE ¡ nextNode(…) SELECTS THE NODE TO ROUTE THE MESSAGE TO ¡ GREEDY CARTESIAN ROUTING (TO REACH THE DESTINATION MAKING THE LOWEST NUMBER OF HOPS)
ROUTING (2) ¡ WE HAVE CHOSEN HASHMAP TO STORE THE VALUES OF THE CAN HashMap values ¡ THE KEY OF EACH VALUE CORRESPONDS TO A 2DPOINT THROUGH A HASHING FUNCTION
UML CLASS DIAGRAM
WHAT A NODE CAN DO
¡ INSERT (A VALUE) ¡ SEARCH (FOR A VALUE) ¡ REMOVE (A VALUE) ¡ JOIN (A CAN) ¡ LEAVE (THE JOINED CAN)
PERFORMANCE EVALUATION ¡ WE EVALUATE THE TIME FOR EACH MESSAGE TO REACH THE DESTINATION AND COME BACK TO THE SENDER (WITH AN ANSWER) ¡ WE COUNT THE NUMBER OF HOPS OF A MESSAGE ¡ BASED ON THE PREVIOUS T WO PARAMETERS WE CALCULATE THE AVERAGE TIME TO PERFORM AN HOP
THANK YOU!
INNOCENTI MANZINELLO MOLINAROLI
INNOCENTI MANZINELLO MOLINAROLI
THE CONTENT-ADDRESSABLE NETWORK ¡ 2-DIMENSIONAL CARTESIAN COORDINATE SPACE ¡ EACH NODE HAS A RECTANGULAR ZONE ¡ BOOTSTRAP NODE MANAGES NODES’ JOIN
JAVA RMI ¡ WE HAVE CHOSEN JAVA RMI FOR THE COMUNICATION BET WEEN NODES ¡ JAVA RMI GIVES US THE POSSIBILIT Y TO SEND REFERENCE OF REMOTE OBJECTS AND CALL METHODS EASILY ¡ GOOD FOR OBJECT ORIENTED PROGRAMMING
ROUTING ¡ route(Message message) CALLED BY ANY NODE THAT NEEDS TO SEND A PACKET TO THE NEXT NODE ¡ nextNode(…) SELECTS THE NODE TO ROUTE THE MESSAGE TO ¡ GREEDY CARTESIAN ROUTING (TO REACH THE DESTINATION MAKING THE LOWEST NUMBER OF HOPS)
ROUTING (2) ¡ WE HAVE CHOSEN HASHMAP TO STORE THE VALUES OF THE CAN HashMap values ¡ THE KEY OF EACH VALUE CORRESPONDS TO A 2DPOINT THROUGH A HASHING FUNCTION
UML CLASS DIAGRAM
WHAT A NODE CAN DO
¡ INSERT (A VALUE) ¡ SEARCH (FOR A VALUE) ¡ REMOVE (A VALUE) ¡ JOIN (A CAN) ¡ LEAVE (THE JOINED CAN)
PERFORMANCE EVALUATION ¡ WE EVALUATE THE TIME FOR EACH MESSAGE TO REACH THE DESTINATION AND COME BACK TO THE SENDER (WITH AN ANSWER) ¡ WE COUNT THE NUMBER OF HOPS OF A MESSAGE ¡ BASED ON THE PREVIOUS T WO PARAMETERS WE CALCULATE THE AVERAGE TIME TO PERFORM AN HOP
THANK YOU!
INNOCENTI MANZINELLO MOLINAROLI
