Compression and expansion in graphs using overlays

Bilal Khan, Kiran R. Bhutani

Research output: Contribution to journalArticle

Abstract

In this article, we describe how to construct physical computer network topologies, which can support the establishment of overlays that reduce or increase the distances between nodes. Reducing pairwise distances (i.e., compression) implies that the overlay enjoys significantly lower inter-node latencies compared to the ambient physical network; such an overlay can be used to implement a "high-performance mode" for disaster situations in which network responsiveness is of critical importance. On the other hand, increasing pairwise distances (i.e., expansion) implies that the overlay exhibits significantly higher internode latencies compared to the ambient physical network; such an overlay can be used to implement a brief "dilated state" in networks that have been infected by a malicious worm, where slowing down the infection spread allows greater time for antidote generation. We show that it is possible to design physical networks which support overlays whose logical link bandwidth is equal to the physical link bandwidth while providing arbitrarily high compression or expansion. We also show that it is possible to "grow" such networks over time in a scalable way, that is to say, it is possible to retain the compression/expansion properties while augmenting the network with new nodes, by making relatively small adjustments to the physical and overlay network structure.

Original languageEnglish (US)
Pages (from-to)36-42
Number of pages7
JournalNetworks
Volume58
Issue number1
DOIs
StatePublished - Aug 1 2011

Fingerprint

Telecommunication links
Bandwidth
Overlay networks
Computer networks
Disasters
Topology

Keywords

  • compression
  • diameter
  • expansion
  • graphs embeddings
  • overlays

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Compression and expansion in graphs using overlays. / Khan, Bilal; Bhutani, Kiran R.

In: Networks, Vol. 58, No. 1, 01.08.2011, p. 36-42.

Research output: Contribution to journalArticle

Khan, Bilal ; Bhutani, Kiran R. / Compression and expansion in graphs using overlays. In: Networks. 2011 ; Vol. 58, No. 1. pp. 36-42.
@article{b0bd22d167c8471498d97e7a06463412,
title = "Compression and expansion in graphs using overlays",
abstract = "In this article, we describe how to construct physical computer network topologies, which can support the establishment of overlays that reduce or increase the distances between nodes. Reducing pairwise distances (i.e., compression) implies that the overlay enjoys significantly lower inter-node latencies compared to the ambient physical network; such an overlay can be used to implement a {"}high-performance mode{"} for disaster situations in which network responsiveness is of critical importance. On the other hand, increasing pairwise distances (i.e., expansion) implies that the overlay exhibits significantly higher internode latencies compared to the ambient physical network; such an overlay can be used to implement a brief {"}dilated state{"} in networks that have been infected by a malicious worm, where slowing down the infection spread allows greater time for antidote generation. We show that it is possible to design physical networks which support overlays whose logical link bandwidth is equal to the physical link bandwidth while providing arbitrarily high compression or expansion. We also show that it is possible to {"}grow{"} such networks over time in a scalable way, that is to say, it is possible to retain the compression/expansion properties while augmenting the network with new nodes, by making relatively small adjustments to the physical and overlay network structure.",
keywords = "compression, diameter, expansion, graphs embeddings, overlays",
author = "Bilal Khan and Bhutani, {Kiran R.}",
year = "2011",
month = "8",
day = "1",
doi = "10.1002/net.20411",
language = "English (US)",
volume = "58",
pages = "36--42",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Compression and expansion in graphs using overlays

AU - Khan, Bilal

AU - Bhutani, Kiran R.

PY - 2011/8/1

Y1 - 2011/8/1

N2 - In this article, we describe how to construct physical computer network topologies, which can support the establishment of overlays that reduce or increase the distances between nodes. Reducing pairwise distances (i.e., compression) implies that the overlay enjoys significantly lower inter-node latencies compared to the ambient physical network; such an overlay can be used to implement a "high-performance mode" for disaster situations in which network responsiveness is of critical importance. On the other hand, increasing pairwise distances (i.e., expansion) implies that the overlay exhibits significantly higher internode latencies compared to the ambient physical network; such an overlay can be used to implement a brief "dilated state" in networks that have been infected by a malicious worm, where slowing down the infection spread allows greater time for antidote generation. We show that it is possible to design physical networks which support overlays whose logical link bandwidth is equal to the physical link bandwidth while providing arbitrarily high compression or expansion. We also show that it is possible to "grow" such networks over time in a scalable way, that is to say, it is possible to retain the compression/expansion properties while augmenting the network with new nodes, by making relatively small adjustments to the physical and overlay network structure.

AB - In this article, we describe how to construct physical computer network topologies, which can support the establishment of overlays that reduce or increase the distances between nodes. Reducing pairwise distances (i.e., compression) implies that the overlay enjoys significantly lower inter-node latencies compared to the ambient physical network; such an overlay can be used to implement a "high-performance mode" for disaster situations in which network responsiveness is of critical importance. On the other hand, increasing pairwise distances (i.e., expansion) implies that the overlay exhibits significantly higher internode latencies compared to the ambient physical network; such an overlay can be used to implement a brief "dilated state" in networks that have been infected by a malicious worm, where slowing down the infection spread allows greater time for antidote generation. We show that it is possible to design physical networks which support overlays whose logical link bandwidth is equal to the physical link bandwidth while providing arbitrarily high compression or expansion. We also show that it is possible to "grow" such networks over time in a scalable way, that is to say, it is possible to retain the compression/expansion properties while augmenting the network with new nodes, by making relatively small adjustments to the physical and overlay network structure.

KW - compression

KW - diameter

KW - expansion

KW - graphs embeddings

KW - overlays

UR - http://www.scopus.com/inward/record.url?scp=79960736607&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960736607&partnerID=8YFLogxK

U2 - 10.1002/net.20411

DO - 10.1002/net.20411

M3 - Article

AN - SCOPUS:79960736607

VL - 58

SP - 36

EP - 42

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -