Skip to main content

Part of the book series: Signals and Communication Technology ((SCT))

  • 440 Accesses

Abstract

A telecommunication network is composed of a number of nodes. Each node can be either a terminal host or a web cache location. Objects are downloaded throughout the network among the nodes. An object can represent either a file or any other resource to be shared (e.g. machine time). For memory saving and for safety reasons, each object is composed of a number of portions and not all the portions are located within the same node, because no node should have the complete knowledge of each object. It means that a single node can have only a part of the file. It is strongly recommendable because if a single node should be accessed without authorization, the information retrieved would not be sufficient to detect the overall content.

Concerning networking viewpoint the following main issues will characterize the performance of object exchange: Position of the information, Strategy to reach the information, Algorithm to download information, Capacity Planning. The paper proposes a control architecture that considers the mentioned issues. It is composed of three layers: Local, Network and Planning Controller. The Local Controller acts locally to each node at object downloading time scale (seconds/minutes) and, after an “advanced flooding” signaling query to get informed about the object portions’ position, decides from which node (or nodes) each portion needs to be downloaded; the Network Controller may change the distribution of the object portions among the nodes; it acts with larger time scale (hours/day) and is centralized; the Planning Controller may change the dimension of each single portion and increase/decrease the physical link and node capacities. The order of magnitude of its intervention is weeks/months. The problem is modeled through a mathematical formulation and a specific cost function, which takes into account all the necessary details, is introduced for each controller as well as a minimization procedure.

A preliminary performance evaluation analyses the effect of the Local Controller.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Verma, D. C: Content Distribution Networks, An Engineering Approach. John Wiley & Sons, Inc., New York (2002)

    Google Scholar 

  2. SETI@Home, URL: http://setiathome.ssl.berkeley.edu

    Google Scholar 

  3. Freenet, URL: http://freenetproject.org/

    Google Scholar 

  4. NeuroGrid P2P Search, URL: http://www.neurogrid.net/

    Google Scholar 

  5. Parameswaran, M., Susarla, A., Whinston, A.B.: P2P Networking: An Information Sharing Alternative. IEEE Computer (2001) 31–38

    Google Scholar 

  6. Stavrou, A., Rubenstein, D., Sahu, S.: A Lightweight, Robust P2P System to Handle Flash Crowds. IEEE Journal on Selected Areas in Communications (2004) 6–17

    Google Scholar 

  7. Stading, T., Maniatis, P., Baker, M.: Peer-to-Peer Caching Schemes to Address Flash Crowds. Proceedings of IPTPS’02, Cambridge, MA, March 2002, 203–213

    Google Scholar 

  8. Ripeanu, M., Foster, I., Iamnitchi A.: Mapping the Gnutella Network: Properties of Large-scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing (2002) 50–57

    Google Scholar 

  9. Ng, T. S. E., Chu, Y., Rao, S. G., Sripanidkulchai K., Zhang H.: Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems. Proceedings of IEEE INFOCOM 2003, San Francisco, CA, March 2003, 2199–2209

    Google Scholar 

  10. Ge, Z., Figueiredo, D. R., Jaiswal, S., Kurose, J., Towsley, D.: Modeling Peer-Peer File Sharing Systems. Proceedings of IEEE INFOCOM 2003, San Francisco, CA, March 2003, 2188–2198

    Google Scholar 

  11. Yang, X., de Veciana, G.: Service Capacity of Peer-to-Peer Networks. Proceedings of IEEE INFOCOM 2004, Honk Kong, March 2004, 2242–2255

    Google Scholar 

  12. Kalogeraki, V., Chen, F.: Managing Distributed Objects in Peer-to-Peer systems. IEEE Network (2004) 22–29

    Google Scholar 

  13. Ross, K.: Multiservice Loss Models for Broadband Telecommunication Networks. Springer Verlag, Berlin (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Bisio, I., Marchese, M., Mongelli, M., Raviola, A. (2006). Distributed Information Retrieval In GRID Environment: A Formal Approach. In: Davoli, F., Palazzo, S., Zappatore, S. (eds) Distributed Cooperative Laboratories: Networking, Instrumentation, and Measurements. Signals and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/0-387-30394-4_23

Download citation

  • DOI: https://doi.org/10.1007/0-387-30394-4_23

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29811-5

  • Online ISBN: 978-0-387-30394-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics