Skip to main content

Naming and Addressing

Some Remarks on a Basic Networking Ingredient

  • Chapter
  • 612 Accesses

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

Abstract

A discussion of “names”, “addresses”, and their relation to each other from first principles is provided. We put this discussion into the context of the structure of communication systems, where we compare layered schemes vs. functionally complete ones. We identify the need for namespaces with proper information hiding and how to relate such namespaces to each other by a correctly interpreted name resolution concept. It turns out that this approach simplifies a number of aspects of communication system design; for example, it turns out that name resolution and neighbor discovery are essentially the same thing. A basic view is given on names, addresses, and compartments. Name resolution is presented as the centerpiece of the problem.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    We note in passing that we deviate here considerably from the NIPCA architecture. Day writes, e.g.,

    The addresses must be large enough to name all elements that can be communicated without relaying at the layer above. [2]

    Hence, he regards names and addresses as fairly interchangeable concepts. In the terminology presented here, a phrase like “an address names something” would not be considered correct.

  2. 2.

    In principle, any shared compartment (not necessarily a node compartment) enables address binding. The practical cases for such bindings turn out to be rather esoteric, so we ignore them for the present discussion.

  3. 3.

    We ignore here the degenerate case of an entity obtaining an address from another entity inside its own namespace.

  4. 4.

    The only other type of such compartments are those that directly represent physical communication, where neighborhood is realized by properties of physical signal propagation.

  5. 5.

    In such a case, there would be a least two different assisting compartments involved (else, they would be neighbors); it is conceivable, however, that the forwarding steps can all take place over the same assisting compartment and yet the two entities engaged in communication are not considered as neighbors because of access control limitations. This is, however, a rather specific case, as in fact this would make the membership of the two communicating entities to the same originating compartment rather questionable.

  6. 6.

    This does of course not mean that all IP entities themselves are neighbors. Clearly, the IP entities themselves are not all neighbors; rather, any entities E 1 and E 2 belonging to some compartment C and bot connected to IP are considered C neighbors with respect to IP, according to the definition of Sect. 5.2.4.4.

References

  1. G. Coulouris, J. Dollimore, T. Kindberg, Distributed Systems Concepts and Design, 4th edn. (Addison Wesley, Reading, 2005)

    Google Scholar 

  2. J. Day, Patterns in Network Architecture—A Return to Fundamentals, 1st edn. (Prentice Hall, New York, 2007)

    Google Scholar 

  3. C. Jelger, C. Tschudin, S. Schmid, G. Leduc, Basic abstractions for an autonomic network architecture, in World of Wireless, Mobile and Multimedia Networks, WoWMoM 2007, IEEE Intl. Symposium (2007), p. 16, http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Basic+Abstractions+for+an+Autonomic+Network+Architecture#0

  4. M. Lottor, RFC 1078: TCP Port Service Multiplexer (TCPMUX) (1988), http://www.ietf.org/rfc/rfc1078.txt

  5. S.e. Randriamasy, Mechanisms for Generic Paths (2009)

    Google Scholar 

  6. J. Saltzer, On the Naming and Binding of Network Destinations (1993)

    Google Scholar 

  7. J.F. Shoch, A note on inter-network naming, addressing, and routing (1978), http://ana-3.lcs.mit.edu/~jnc/tech/ien/ien19.txt

  8. N. Shroff, R. Srikant, A tutorial on cross-layer optimization in wireless networks, IEEE J. Sel. Areas Commun. 24(8), 1452–1463 (2006), doi:10.1109/JSAC.2006.879351

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Holger Karl .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Karl, H., Biermann, T., Woesner, H. (2011). Naming and Addressing. In: Correia, L., Abramowicz, H., Johnsson, M., Wünstel, K. (eds) Architecture and Design for the Future Internet. Signals and Communication Technology. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9346-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-9346-2_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-9345-5

  • Online ISBN: 978-90-481-9346-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics