Efficient frontier formulation for additive and restrictive metrics in hierarchical routing

Bauer, Daniel; Daigle, John N.; Iliadis, Ilias; Scotton, Paolo

doi:10.1109/icc.2000.853718

Cited by 9 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The detailed algorithm of finding the representatives can be found in Appendix I-A. Other related references are [13] and [14]. Sorting links takes time and Dijkstra's algorithm takes time [15].…”

Section: A Mesh Formationmentioning

confidence: 99%

Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

Lui

Nahrstedt

Chen

2004

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Routing is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.

show abstract

Section: A Mesh Formationmentioning

confidence: 99%

Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

Lui

Nahrstedt

Chen

2004

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…C. Lee [4] gave an introductory tutorial on topology aggregation, addressing such issues as the main reason for it and some conventional methods, namely the full mesh approach and the star approach, to achieve topology compression in large hierarchical networks. I. Iliadis et al presented a transition matrix technique for computing the cost of traversing a subnetwork in [5] and [6], which helps to construct the full mesh topology from the information of the original network topology. But they did not consider topologies more compact than the full mesh topology, whose scalability is not satisfactory enough.…”

Section: Introductionmentioning

confidence: 99%

A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks

Zhang¹,

Zheng²,

Zhanga³

et al. 2005

Photon Netw Commun

View full text Add to dashboard Cite

In large scale networks composed of several hierarchical subnetworks, topology aggregation is implemented for both scalability and security consideration. However, due to the special characteristic of optical wavelength-routed networks, existing topology aggregation algorithms cannot be applied directly for topology compression. In this paper, we propose a kind of topology aggregation algorithm suitable for hierarchical wavelength-routed optical networks, thereby considering information of residual wavelengths on network links. Basically, our topology aggregation algorithm is based on a transition matrix technique for constructing a full mesh topology and asymmetric star approach for a more compact topology. Simulations with randomly-generated networks show that topology information compression can be achieved with a little loss of its accuracy: the ratio of border node pairs with representation deviation being well below 10%. Results also indicate that the advantage of our algorithm is also behaved on reducing the amount of link-state-advertisement messages and making networks less vulnerable to propagation delay of these messages over communication links.

show abstract

“…staircase function) in [Bauer et al 2000 , then the path p jk is an element of the efficient frontier from node j to k. The algebraic representation of all the paths sitting on the efficient frontier among all border nodes is referred to as the transition matrix by some studies, such as [Iliadis 2000;Bauer et al 2000].…”

Section: Parameter MIX Selectionmentioning

confidence: 99%

Analysis of Topology Aggregation techniques for QoS routing

et al. 2007

View full text Add to dashboard Cite

We study and compare topology aggregation techniques used in QoS routing. Topology Aggregation (TA) is defined as a set of techniques that abstract or summarize the state information about the network topology to be exchanged, processed and maintained by network nodes for routing purposes. Due to scalability, aggregation techniques have been an integral part of some routing protocols. However, TA has not been studied extensively except under a rather limited context. Under the continuing growth of the Internet, scalability issues of QoS routing have been gaining more importance. Therefore, we survey the current TA techniques, provide methodology to classify, evaluate, and compare their complexities and efficiencies.

show abstract

Efficient frontier formulation for additive and restrictive metrics in hierarchical routing

Cited by 9 publications

References 16 publications

Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks

A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks

Analysis of Topology Aggregation techniques for QoS routing

Contact Info

Product

Resources

About