Advertisement

Administration of P2P Systems Based on Application Contexts

  • Maytiyanin Komkhao
  • Sunantha Sodsee
  • Nanthachai Poolketgij
  • Herwig Unger
Part of the Studies in Computational Intelligence book series (SCI, volume 391)

Abstract

Data derived from application contexts may be used to determine the positions of peers in 2- or 3-dimensional space. The coordinates thus obtained as well as corresponding direction and distance information may help, in turn, to improve routing of and searching for data. Since peers are present at only few positions in a given space, a new, effective algorithm is introduced to establish correct neighbourhood connectivity and a tessalation of the full space by the existing peers. For searching and routing it uses considerably more alternative paths through a structure than known algorithms. Simulations revealed its capability to cope faster and in approximately constant time, independent on network size, with changes in P2P systems brought about by, e.g., newly joining, leaving or failing nodes.

Keywords

Network Size Distribute Hash Table Application Context Neighbour List Grid Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Popescu, A., Ilie, D., Kouvatsos, D.: On the Implementation of a Content-Addressable Network. In: 5th International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks, Karlskrona, Sweden (2008)Google Scholar
  2. 2.
    Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. In: Proceedings of IEEE Communications Surveys and Tutorials, pp. 72–93 (2005)Google Scholar
  3. 3.
    Cholvi, V., Felber, P., Biersack, E.W.: Efficient search in unstructured peer-to-peer networks. In: Proceedings of SPAA, pp. 271–272 (2004)Google Scholar
  4. 4.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM, pp. 161–172 (2001)Google Scholar
  5. 5.
    Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks 50, 3485–3521 (2006)CrossRefGoogle Scholar
  6. 6.
    Fosso Wamba, S., Boeck, H.: Enhancing Information Flow in a Retail Supply Chain using RFID and the EPC Network: a Proof-of-Concept Approach. Journal of Theoretical and Applied Electronic Commerce Research, Special Issue on RFID and Supply Chain Management 3, 92–105 (2008)Google Scholar
  7. 7.
    Michael, K., McCathie, L.: The Pros and Cons of RFID in Supply Chain Management. In: Proceedings of ICMB, pp. 623–629 (2005)Google Scholar
  8. 8.
    Berg, D., Coltzau, H., Sukjit, P., Unger, H., Nicolaysen, J.G.: Passive RFID tag Processing using a P2P architecture. In: Malaysian Software Engineering Conference (2007)Google Scholar
  9. 9.
    Weinstein, R.: RFID: A Technical Overview and Its Application to the Enterprise. In: Proceedings of IT Professional, pp. 27–33 (2005)Google Scholar
  10. 10.
    Huang, D., Verma, M., Ramachandran, A., Zhou, Z.: EPCA Distributed ePedigree Architecture. In: Accepted by the 11th International Workshop on Future Trends of Distributed Computing Systems (2007)Google Scholar
  11. 11.
    P2PNetSim, User’s manual. JNC, AhrensburgGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Maytiyanin Komkhao
    • 1
  • Sunantha Sodsee
    • 1
  • Nanthachai Poolketgij
    • 2
  • Herwig Unger
    • 1
  1. 1.Fernuniversität in HagenHagenGermany
  2. 2.Nakhon Sawan Rajabhat UniversityNakhon SawanThailand

Personalised recommendations