Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks

Kiran R. Bhutani, Abdella Battou, Bilal Khan

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We propose two methods for aggregation of peer group topology in hierarchical ATM networks. Both proposed aggregation methods transform a given peer group into a star graph representation. Our first approach optimally preserves, in a least square sense, the original costs of routing through the peer group. Our second approach assigns a weighted vector to the nucleus of the Logical Group Node, which quantifies the error in the compact representation. The two schemes are dual, in the sense that the first is best suited for peergroups where traffic patterns are unpredictable, and the second is suited for peergroups where traffic patterns can be characterized. Both the proposed schemes are practical: For peer groups with nodes V, links E, and n border nodes B ⊂ V, the approaches run in O(n|V|log|V| + n|E|+ poly(n)) time. The size of the final representation is small (linear in the number of border nodes) and can be computed efficiently. The scalability of the proposed algorithms makes them well-suited for use in practice. We also present a general method for measuring the degree of confidence in an aggregation scheme.

Original languageEnglish (US)
Pages (from-to)125-134
Number of pages10
JournalIntelligent Automation and Soft Computing
Volume6
Issue number2
DOIs
StatePublished - Jan 1 2000

Fingerprint

Hierarchical Networks
Aggregation
Agglomeration
Topology
Vertex of a graph
Asynchronous transfer mode
Stars
Traffic
Scalability
ATM Networks
Star Graph
Graph Representation
Nucleus
Confidence
Assign
Least Squares
Quantify
Routing
Costs
Transform

Keywords

  • ATM routing
  • Hierarchical PNNI networks
  • Logical group nodes
  • Topology aggregation

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Artificial Intelligence

Cite this

Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks. / Bhutani, Kiran R.; Battou, Abdella; Khan, Bilal.

In: Intelligent Automation and Soft Computing, Vol. 6, No. 2, 01.01.2000, p. 125-134.

Research output: Contribution to journalArticle

@article{cf71785f723543608a72ab032dd786e6,
title = "Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks",
abstract = "We propose two methods for aggregation of peer group topology in hierarchical ATM networks. Both proposed aggregation methods transform a given peer group into a star graph representation. Our first approach optimally preserves, in a least square sense, the original costs of routing through the peer group. Our second approach assigns a weighted vector to the nucleus of the Logical Group Node, which quantifies the error in the compact representation. The two schemes are dual, in the sense that the first is best suited for peergroups where traffic patterns are unpredictable, and the second is suited for peergroups where traffic patterns can be characterized. Both the proposed schemes are practical: For peer groups with nodes V, links E, and n border nodes B ⊂ V, the approaches run in O(n|V|log|V| + n|E|+ poly(n)) time. The size of the final representation is small (linear in the number of border nodes) and can be computed efficiently. The scalability of the proposed algorithms makes them well-suited for use in practice. We also present a general method for measuring the degree of confidence in an aggregation scheme.",
keywords = "ATM routing, Hierarchical PNNI networks, Logical group nodes, Topology aggregation",
author = "Bhutani, {Kiran R.} and Abdella Battou and Bilal Khan",
year = "2000",
month = "1",
day = "1",
doi = "10.1080/10798587.2000.10768165",
language = "English (US)",
volume = "6",
pages = "125--134",
journal = "Intelligent Automation and Soft Computing",
issn = "1079-8587",
publisher = "AutoSoft Press",
number = "2",

}

TY - JOUR

T1 - Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks

AU - Bhutani, Kiran R.

AU - Battou, Abdella

AU - Khan, Bilal

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We propose two methods for aggregation of peer group topology in hierarchical ATM networks. Both proposed aggregation methods transform a given peer group into a star graph representation. Our first approach optimally preserves, in a least square sense, the original costs of routing through the peer group. Our second approach assigns a weighted vector to the nucleus of the Logical Group Node, which quantifies the error in the compact representation. The two schemes are dual, in the sense that the first is best suited for peergroups where traffic patterns are unpredictable, and the second is suited for peergroups where traffic patterns can be characterized. Both the proposed schemes are practical: For peer groups with nodes V, links E, and n border nodes B ⊂ V, the approaches run in O(n|V|log|V| + n|E|+ poly(n)) time. The size of the final representation is small (linear in the number of border nodes) and can be computed efficiently. The scalability of the proposed algorithms makes them well-suited for use in practice. We also present a general method for measuring the degree of confidence in an aggregation scheme.

AB - We propose two methods for aggregation of peer group topology in hierarchical ATM networks. Both proposed aggregation methods transform a given peer group into a star graph representation. Our first approach optimally preserves, in a least square sense, the original costs of routing through the peer group. Our second approach assigns a weighted vector to the nucleus of the Logical Group Node, which quantifies the error in the compact representation. The two schemes are dual, in the sense that the first is best suited for peergroups where traffic patterns are unpredictable, and the second is suited for peergroups where traffic patterns can be characterized. Both the proposed schemes are practical: For peer groups with nodes V, links E, and n border nodes B ⊂ V, the approaches run in O(n|V|log|V| + n|E|+ poly(n)) time. The size of the final representation is small (linear in the number of border nodes) and can be computed efficiently. The scalability of the proposed algorithms makes them well-suited for use in practice. We also present a general method for measuring the degree of confidence in an aggregation scheme.

KW - ATM routing

KW - Hierarchical PNNI networks

KW - Logical group nodes

KW - Topology aggregation

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

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

U2 - 10.1080/10798587.2000.10768165

DO - 10.1080/10798587.2000.10768165

M3 - Article

AN - SCOPUS:0346041799

VL - 6

SP - 125

EP - 134

JO - Intelligent Automation and Soft Computing

JF - Intelligent Automation and Soft Computing

SN - 1079-8587

IS - 2

ER -