Overlay networks and graph theoretic concepts

Authors:
Is-Haka M. Mkwawa;Demetres D. Kouvatsos;Adrian Popescu
Affiliations:
NetPEn - Networks and Performance Engineering Research Unit, Informatics Research Institute, University of Bradford, Bradford, UK;NetPEn - Networks and Performance Engineering Research Unit, Informatics Research Institute, University of Bradford, Bradford, UK;Dept. of Telecommunication Systems, School of Engineering Blekinge Institute of Technology, Karlskrona, Sweden
Venue:
Network performance engineering
Year:
2011

Citing 16
Cited 0

End-to-end routing behavior in the Internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Internet routing instability

IEEE/ACM Transactions on Networking (TON)
A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delayed Internet routing convergence

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Stability issues in OSPF routing

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Measuring the effects of internet path faults on reactive routing

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The Case for Resilient Overlay Networks

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Best-path vs. multi-path overlay routing

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Locating internet routing instabilities

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Can coexisting overlays inadvertently step on each other?

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
An Accurate Communication Model of a Heterogeneous Cluster Based on a Switch-Enabled Ethernet Network

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
On investigating overlay service topologies

Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end WAN service availability

USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Scalable routing protocols for mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.