Skip to main content

Analytical Examination of Route Discovery Traffic

  • Chapter
  • 301 Accesses

Zusammenfassung

The task of finding an optimal path with respect to multiple criteria, as it is intended in the proposed context-based routing, can be categorised in the category of socalled Multi-Constrained Path (MCP) problems.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH

About this chapter

Cite this chapter

Wenning, BL. (2010). Analytical Examination of Route Discovery Traffic. In: Context-Based Routing in Dynamic Networks. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9709-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-8348-9709-1_5

  • Publisher Name: Vieweg+Teubner

  • Print ISBN: 978-3-8348-1295-7

  • Online ISBN: 978-3-8348-9709-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics