Topology aggregation with multiple QoS parameters for scalable routing problem

In this paper, we investigate the problem of topology aggregation in QoS-based routing. We propose new algorithms to perform full-mesh and modified-star aggregation, which are ample and effective in network with additive and concave parameters constrained. Time complexity is O(b/sup 2/), where b is...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Communication Technology Proceedings, 2003. ICCT 2003 Vol. 1; pp. 458 - 461 vol.1
Main Authors Luo Yongjun, Bai Yingcai
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Aggregates
Bandwidth
Clustering algorithms
Computer science
Delay
Logic
Mesh networks
Network topology
Peer to peer computing
Routing
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate the problem of topology aggregation in QoS-based routing. We propose new algorithms to perform full-mesh and modified-star aggregation, which are ample and effective in network with additive and concave parameters constrained. Time complexity is O(b/sup 2/), where b is the number of border nodes. We extend the algorithms to topology aggregation with multi-parameters.
ISBN:7563506861
9787563506866
DOI:10.1109/ICCT.2003.1209119