Skip to main content

A Network Aware Resource Discovery Service

  • Conference paper
  • First Online:
Book cover Computer Performance Engineering (EPEW 2019)

Abstract

Internet in recent years has become a huge set of channels for content distribution highlighting limits and inefficiencies of the current protocol suite originally designed for host-to-host communication. In this paper we exploit recent advances in Information Centric Networks in the attempt to reshape the actual Internet infrastructure from a host-centric to a name-centric paradigm where the focus is on named data instead of machine name hosting those data. In particular, we propose a Content Name System Service that provides a new network aware Content Discovery Service. The CNS behavior and architecture uses the BGP inter-domain routing information. In particular, the service registers and discovers resource names in each Autonomous System: contents are discovered by searching through the augmented AS graph representation classifying ASes into customer, provider, and peering, as the BGP protocol does. Performance of CNS can be characterized by the fraction of Autonomous Systems that successfully locate a requested content and by the average number of CNS Servers explored during the search phase. A C-based simulator of CNS is developed and is run over real ASes topologies provided by the Center for Applied Internet Data Analysis to provide estimates of both performance indexes. Preliminary performance and sensitivity results show the CNS approach is promising and can be efficiently implemented by incrementally deploying CNS Servers.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Notes

  1. 1.

    The ASes can establish also other type of relationships such as “sibling” and “backup”. For the purposes of this paper we neglect them.

  2. 2.

    Depending on a local policy, the CNS could ask to republish the content every n seconds.

  3. 3.

    At the beginning of the search, the sender is just the authoritative-CNS itself, while in the middle of the location process, the sender is a provider-CNS.

  4. 4.

    Do not choose the customer-CNS that have sent the query.

  5. 5.

    Successive execution of code in Fig. 3 will later invert the direction from uphill to downhill, i.e. we push downhill the query.

  6. 6.

    E.g. synchronizing mail or telephone contact across multiple google accounts.

References

  1. Bari, M.F., et al.: A survey of naming and routing in information-centric networks. IEEE Commun. Mag. 50(12), 44–53 (2012)

    Article  Google Scholar 

  2. CAIDA: Center for Applied Internet Data Analysis: AS relationship (2016). http://www.caida.org/data/as-relationships/

  3. Chand, R., Cosnard, M., Liquori, L.: Powerful resource discovery for arigatoni overlay network. Future Gener. Comput. Syst. 24(1), 31–48 (2008)

    Article  Google Scholar 

  4. Elmagarmid, A.K., Ipeirotis, P.G., Verykios, V.S.: Duplicate record detection: a survey. IEEE Trans. Knowl. Data Eng. 19(1), 1–16 (2007)

    Article  Google Scholar 

  5. Gao, L.: On inferring autonomous system relationships in the internet. IEEE/ACM Trans. Netw. 9(6), 733–745 (2001)

    Article  Google Scholar 

  6. Jacobson, V., et al.: Networking named content. In: Proceedings of CoNEXT. ACM (2009)

    Google Scholar 

  7. Koponen, T., et al.: A data-oriented (and beyond) network architecture. SIGCOMM Comput. Commun. Rev. 37(4), 181–192 (2007)

    Article  Google Scholar 

  8. Maymounkov, P., Mazières, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45748-8_5

    Chapter  MATH  Google Scholar 

  9. Mockapetris, P.: Domain names - concepts and facilities (1983). https://tools.ietf.org/html/rfc882. RCF 883, updated 973, 1034, 1035

  10. Rekhter, Y., Li, T.: A Border Gateway Protocol 4 (BGP-4) (1995). https://tools.ietf.org/html/rfc4271. RCF 4271, obsoletes 1654, 1267, 1163, 1105

  11. Shang, W., et al.: Named data networking of things. In: Proceedings of IEEE IoTDI (2016)

    Google Scholar 

  12. Xylomenos, G., et al.: A survey of information-centric networking research. IEEE Commun. Surv. Tutor. 16(2), 1024–1049 (2014)

    Article  Google Scholar 

  13. Zhang, L., et al.: Named data networking. Comput. Commun. Rev. 44(3), 66–73 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

The work has been partially supported by the HOME (Hierarchical Open Manufacturing Europe) project, supported by the Regione Piemonte, Italia (framework program POR FESR 14/20).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matteo Sereno .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liquori, L., Gaeta, R., Sereno, M. (2020). A Network Aware Resource Discovery Service. In: Gribaudo, M., Iacono, M., Phung-Duc, T., Razumchik, R. (eds) Computer Performance Engineering. EPEW 2019. Lecture Notes in Computer Science(), vol 12039. Springer, Cham. https://doi.org/10.1007/978-3-030-44411-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44411-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44410-5

  • Online ISBN: 978-3-030-44411-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics