Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Overlay networks and graph theoretic concepts
Responsible organisation
2011 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 5233, 1039-1054 p.Article in journal (Refereed) Published
Abstract [en]

Overlay networks have shown to be very effective towards the support and enhancement of network performance and the availability of new applications and protocols without interfering with the design of the underlying networks. One of the most challenging open issues in overlay networks, however, is paths overlapping, where overlay paths may share the same physical link and thus, the ability of overlay networks to quickly recover from congestion and path failures is severely affected. This chapter undertakes a review of some graph theoretic based methods for the selection of a set of topologically diverse routers towards the provision of independent paths for better availability, performance and reliability in overlay networks. Moreover, it proposes a graph decomposition-based approach for the maximization of path diversity without degrading network performance of in terms of latency. Some remarks on future developments and challenges in the field of overlay networks are included.

Place, publisher, year, edition, pages
Springer , 2011. Vol. 5233, 1039-1054 p.
Keyword [en]
graph theory, internet, network applications, network decomposition, Overlay networks, protocols
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-7387DOI: 10.1007/978-3-642-02742-0-44ISI: 000290879900044Local ID: oai:bth.se:forskinfo9109378E5413D90CC1257974004A5EBEOAI: oai:DiVA.org:bth-7387DiVA: diva2:834995
Note
Editor(s): Kouvatsos, DD Source: NETWORK PERFORMANCE ENGINEERING: A HANDBOOK ON CONVERGENT MULTI-SERVICE NETWORKS AND NEXT GENERATION INTERNETAvailable from: 2012-09-18 Created: 2011-12-28 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Popescu, Adrian
In the same journal
Lecture Notes in Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 19 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf