[Ns-developers] GSoc: P2P Projects

[Marcello Caleffi]

Dear Swark,
it seems to me that you have very good experience in P2P systems, and  
clearly this is very useful in developing a MP2P routing protocol.
However, it seems too that you are neglecting a lot of routing  
aspects, i.e. discovering the neighbors, estimating the link  
qualities from and to those neighbors, building the routing tables,  
disseminating the routing infos toward the networks, selecting the  
best route according to a certain metric which has to take into  
account the link qualities, and so on.
My personal experience about implementing a routing protocol from  
just a research paper description, is one year of hard work about  
figuring how the protocol has to work. And my experience as research  
paper writer is too little space to explain in detail how things  
work. For these reasons I suggest (it is a suggestion, not a  
constraint) to implement a MP2P protocol which is already available  
as source code. ATR and MADPastry are.
Clearly, this suggestion depends on the candidate experience: if he  
is a graduate or a Ph.D. student, if he has strong ability in C++  
programming, if he has already designed a routing protocol or a P2P  
protocol, etc.

IMHO

PS Chord and Pastry are P2P applications, not MP2P protocols since  
they assume the presence of a routing underlay.
PSS Ns-3 is the simulation environment. You don't need another one to  
manage such activities.

Marcello

Il giorno 27/mar/09, alle ore 16:36, swark ha scritto:

> Dear marcello,
>     Thank you for your kindly guiding. I have a question: Which  
> protocol should be implemented to the NS-3? ATR or MADPastry or  
> some other protocol designated? Or even a protocol in the papers  
> you listed? If the protocol is prearranged I can pull a focus on  
> the protocol in advance and make it more suitable for the NS-3.
>     More over, I think it is not a big problem to just implement a  
> certain existing protocol to the NS-3. What I think more is what  
> about implementing a simulation environment: There is a P2P  
> creating helper which let the user set the number of the peer  
> nodes, the type of P2P protocol (such as Chord, Pastry, etc) to  
> use, and the probability distribution of nodes’ joining and  
> leaving activities, and a log tracer which could easily trace the  
> activities of nodes in P2P layer.
>     If this environment could be implemented, I think it can bring  
> more convenience to all researchers in the P2P field and can also  
> be conducive to the promotion of the NS-3.
>     What do you think?
>     Thank you very much.
>
> Regards,
> swark
> swark2006 at gmail.com
> 2009-03-27
>
>
> ----- Original Message -----
> From: Marcello Caleffi
> To: swark2006
> Sent: 2009-03-26, 23:51:16
> Subject: Re: [Ns-developers] GSoc: P2P Projects
>
>
>
> >Dear Swark,
> >I'm giving you an overview of the research topic with a copy&paste,
> >and as you can see, MP2P (mobile peer-to-peer) systems are related
> >both with MANET routing and traditional P2P systems.
> > From an operational point of view, the project requires to the
> >student the implementation of a MP2P protocol, which means the
> >implementation of the routing procedures as well as of the info
> >dissemination & discovery functionalities.
> >All the cited protocols are good candidates for the implementation.
> >However, I think that it is more reasonable asking the student to
> >implement a protocol which is already available as ns-2 code (often
> >the papers give just an overview of all the stuffs needed to make an
> >working protocol, and it is very hard to deduce the lacking parts).
> >
> >More questions and suggestions are ALWAYS welcome :-)
> >
> ><<
> >Peer-To-Peer (P2P) and Mobile Ad hoc NETworks (MANETs) share the same
> >key concepts of self-organization and distributing computing, and
> >both aim to provide connectivity in a completely decentralized
> >environment [1], [2].
> >Moreover, both lack central entities to which delegate the management
> >and the coordination of the network and relay on a time-variant
> >topology. In fact, in P2P networks the time variability is due to
> >joining/leaving peers, while in MANET ones it is due to both node
> >mobility and propagation condition instability.
> >Despite these similarities, the adoption of the P2P paradigm to
> >disseminate and discover information in a MANET scenario rises to new
> >and challenging problems [1], [3]. The main issue concerns the layer
> >where they operate: P2Ps build and maintain overlay networks at the
> >application-layer, assuming the presence of an underlying network
> >routing which assures connectivity among nodes, while MANETs focus on
> >providing a multi-hop wireless connectivity among nodes.
> >This issue is a major problem in trying to couple a P2P overlay
> >network over a MANET: in [4], [5] it has been proved that simply
> >deploying P2P over MANETs may cause poor performances due to the lack
> >of cooperation and communication between the two layers, causing so
> >significant message overhead and redundancy. For these reasons,
> >different cross-layer approaches have been presented and they can be
> >classified according to the adopted solution for the resource
> >discovery procedure.
> >More specifically, in unstructured P2Ps, peers are unaware of the
> >resources that neighboring peers in the overlay network maintain [6],
> >[7]. So, they typically resolve search requests by means of flooding
> >techniques and rely on resource replication to improve the lookup
> >performance and reliability. Differently, in structured P2P networks
> >peers have knowledge about the resources offered by overlay
> >neighbors, usually by resorting to the Distributed Hash Table (DHT)
> >paradigm and, therefore, the search requests are forwarded by means
> >of unicast communications.
> >Clearly, the scenarios where MANETS operate make unsuitable both
> >flooding and replication mechanisms, except for small networks and/or
> >high joining/leaving peer rates. In the last years structured P2P
> >networks have gained attention: EKTA [8] and DPSR [9] integrate a
> >Pastry-like [10] structured P2P protocol with the DSR routing
> >algorithm, while CROSSRoad [11] integrates a Pastry-like DHT over the
> >OLSR routing algorithm, and VRR [12] proposes a routing algorithm
> >which provides indirect routing by resorting to a Pastry-like  
> structure
> >too. ITR (ATR) [13] shares several similarity with Kademlia [14] and
> >MADPastry [15], [16] integrates the Pastry protocol with the AODV
> >routing algorithm.
> >
> >[1] R. Schollmeier, I. Gruber, and M. Finkenzeller,   outing in
> >mobile adhoc and peer-to-peer networks a comparison,?in Revised
> >Papers from the NETWORKING 2002 Workshops on Web Engineering and  
> Peer-
> >to-Peer Computing. London, UK: Springer-Verlag, 2002, pp. 172?86.
> >[2] A. Oram, Peer-to-Peer - Harnessing the power of disruptive
> >technologies. O嵇eillt, 2001.
> >[3] A. C. Viana, M. D. de Amorim, S. Fdida, and J. F. de Rezende,
> >  elforganization in spontaneous networks: the approach of dht-based
> >routing protocols,?Ad Hoc Networks, vol. 3, no. 5, pp. 589?06,
> >September 2005.
> >[4] G. Ding and B. Bhargava,   eer-to-peer file-sharing over mobile
> >ad hoc networks,?in PERCOMW ?4: Proceedings of the Second IEEE
> >Annual Conference on Pervasive Computing and Communications
> >Workshops. IEEE Computer Society, October 2004, pp. 104?08.
> >[5] L. B. Oliveira, I. G. Siqueira, and A. A. F. Loureiro,   n the
> >performance of ad hoc routing protocols under a peer-to-peer
> >application,?Journal of Parallel and Distributed Computing, vol. 65,
> >no. 11, pp. 1337?347, 2005.
> >[6] M. Conti, E. Gregori, and G. Turi, 鶝 cross-layer optimization  
> of
> >gnutella for mobile ad hoc networks,?in MobiHoc ?5: Proceedings of
> >the 6th ACM international symposium on Mobile ad hoc networking and
> >computing, 2005, pp. 343?54.
> >[7] B. Tang, Z. Zhou, A. Kashyap, and T. cker Chiueh, 鶝n integrated
> >approach for p2p file sharing on multi-hop wireless networks,?in
> >WiMob?005: IEEE International Conference on Wireless And Mobile
> >Computing, Networking And Communications, vol. 3, August 2005, pp.
> >268?274.
> >[8] H. Pucha, S. M. Das, and Y. C. Hu, 鶡kta: an efficient dht
> >substrate for distributed applications in mobile ad hoc networks,?in
> >WMCSA 2004: Sixth IEEE Workshop on Mobile Computing Systems and
> >Applications, 2004, pp. 163?73.
> >[9] H. Pucha, S. M. Das, and Y. Hu,   mposed route reuse in ad hoc
> >network routing protocols using structured peer-to-peer overlay
> >routing,?IEEE Transactions on Parallel and Distributed Systems, vol.
> >17, no. 12, pp. 1452?467, 2006.
> >[10] A. Rowstron and P. Druschel,   astry: Scalable, decentralized
> >object location and routing for large-scale peer-to-peer systems,?in
> >IFIP/ACM International Conference on Distributed Systems Platforms
> >(Middleware), Nov. 2001, pp. 329?50.
> >[11] F. Delmastro, 鶢rom pastry to crossroad: Cross-layer ring
> >overlay for ad hoc networks,?in IEEE International Conference on
> >Pervasive Computing and Communications Workshops, 2005, pp. 60?4.
> >[12] M. Caesar, M. Castro, E. Nightingale, G. O鵱hea, and A.
> >Rowstron,   irtual ring routing: network routing inspired by dhts,?
> >in SIGCOMM ?6: Proceedings of the 2006 conference on Applications,
> >technologies,
> >architectures, and protocols for computer communications, 2006, pp.
> >351?62.
> >[13] M. Caleffi, L. Paura "P2P over MANET: Indirect Tree-based
> >Routing" Proc. of IEEE PerCom '09: Seventh Annual IEEE International
> >Conference on Pervasive Computing and Communications, Galveston TX
> >(USA), March 9-13 2009.
> >[14] P. Maymounkov and D. Mazi`eres,   ademlia: A peer-to-peer
> >information system based on the xor metric,?in IPTPS: 1st
> >International workshop on Peer-To-Peer Systems, 2002, pp. 53?5.
> >[15] T. Zahn and J. Schiller,   ADPastry: A DHT Substrate for
> >Practicably Sized MANETs,?in Proc. of 5th Workshop on Applications
> >and Services in Wireless Networks (ASWN2005), June 2005.
> >[16] K. Takeshita, M. Sasabe, and H. Nakano,   obile p2p networks for
> >highly dynamic environments,?in PERCOM ?8: Proceedings of the 2008
> >Sixth Annual IEEE International Conference on Pervasive Computing and
> >Communications, 2008, pp. 453?57.
> > >>
> >
> >
> >
> >Il giorno 25/mar/09, alle ore 01:52, swark ha scritto:
> >
> >> Dear Marcello,Joseph,
> >>     I am very interesting in this project. My current research is
> >> focus on P2P streaming area and I am implementing Kademlia on
> >> FALPS. Is there any detail requirements for this project besides
> >> the brief induction on the http://www.nsnam.org/wiki/index.php/
> >> GSOC2009Projects ?
> >>     Thank you very much.
> >>
> >>
> >> Regards,
> >> swark
> >> swark2006 at gmail.com
> >> 2009-03-25
> >>
> >> ----- Original Message -----
> >> From: Joseph Kopena
> >> To: ns-developers,ns-3-users
> >> Sent: 2009-03-25, 00:28:58
> >> Subject: [Ns-developers] GSoc: P2P Projects
> >>
> >>
> >>
> >>> Hi folks,
> >>>
> >>> Marcello Caleffi has stepped forward to mentor a project on P2P
> >>> systems, moving that into our priority project topics along  
> with (in
> >>> no particular order): Click integration, NSC, emulation, router
> >>> models, MAC and PHY models.  A project blurb has been added to the
> >>> ideas page at [1].  Again, we stress that this project would  
> focus on
> >>> implementing or porting commonly used or cited work, protocols,  
> and
> >>> implementations.  This is not an opening for a P2P research  
> project,
> >>> this is an opening to develop a toolset supporting a wide  
> variety of
> >>> P2P research projects.
> >>>
> >>> Thx again to Marcello!
> >>>
> >>> [1] http://www.nsnam.org/wiki/index.php/GSOC2009Projects
> >>>
> >>> --
> >>> - joe kopena
> >>> right here and now
> >