Skip to main content

Improving Topological Routing in N2R Networks

  • Conference paper
Book cover Combinatorial and Algorithmic Aspects of Networking (CAAN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4852))

Included in the following conference series:

  • 355 Accesses

Abstract

Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed for some regular structures such as Grid or Honeycomb. An initial proposal has also been developed for the N2R structures. This paper proposes a modification of this previous algorithm, and in addition two other alternatives. The three options are systematically analyzed in terms of executing time and path distances, showing that trade-offs are needed in order to determine which algorithm is best for a given case. Also, the possible practical applications the methods could have, are discussed for different traffic scenarios.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pedersen, J.M., Knudsen, T.P., Madsen, O.B.: Topological Routing in Large-Scale Networks. In: IEEE/ICACT 2004, Korea, February 2004, p. 912 (2004), Available: http://ieeexplore.ieee.org/iel5/9073/28787/01293001.pdf

  2. Martel, C., Van Nguyen: Analyzing Kleinberg’s (and other) small-world Models. In: Annual ACM Symposium on Principles of Distributed Computing archive Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, St. John’s, Newfoundland, Canada, pp. 179–188 (2004), ISBN:1-58113-802-4

    Google Scholar 

  3. Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  4. Pedersen, J.M., Riaz, M.T., Madsen, O.B.: A Simple, Efficient Routing Scheme for N2R Network Structures. In: IT&T Annual Conference 2005, Cork, Ireland, pp. 69–80 (2005)

    Google Scholar 

  5. Grover, W.D.: Mesh-Based Survivable Networks, Options and Strategies for Optical, MPLS, SONET and ATM Network, 1st edn. Prentice Hall PTR, Englewood Cliffs (2003)

    Google Scholar 

  6. Sanchez, M.G.S., Rumin, R.C., Gutierrez, J.M.: Triple Play Network Modelling for Spain. MsC Thesis. Control Department Aalborg University (June 2006)

    Google Scholar 

  7. Pedersen, J.M.: Structural Quality of Service in Large-Scale Network. PhD Thesis. Control Departament, Aalborg University (April 2005)

    Google Scholar 

  8. Jorgensen, T., Pedersen, L., Pedersen, J.M.: Reliability in single, double and N2R ring network structures. In: CIC 2005. The International Conference on Communications in Computing, Las Vegas, Nevada, United States, June 2005, pp. 2–4 (2005)

    Google Scholar 

  9. Madsen, O.B., Knudsen, T.P., Pedersen, J.M.: SQoS as the Base for Next Generation Global Infrastructure. In: Proc. of IT&T 2003, Information Technology and Telecommunications. Annual Conference 2003, Letterkenny, Ireland, October 2003, pp. 127–136 (2003), Available: http://www.kommunikation.aau.dk/ddn/Filertildownload/SQoSastheBaseforNextGenerationGlobal.pdf

  10. Karagiannis, T., Papagiannaki, K., Faloutsos, M.: BLINC: Multilevel traffic classification in the dark. ACM SIGCOMM 35(4), 4 (2005), Available: http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-KarPap.pdf

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jeannette Janssen Paweł Prałat

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gutierrez Lopez, J.M., Cuevas Rumin, R., Pedersen, J.M., Madsen, O.B. (2007). Improving Topological Routing in N2R Networks. In: Janssen, J., Prałat, P. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2007. Lecture Notes in Computer Science, vol 4852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77294-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77294-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77293-4

  • Online ISBN: 978-3-540-77294-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics