Transition matrix generation for complex node representation

Iliadis, Ilias; Scotton, Paolo

doi:10.1109/atm.1999.786901

Cited by 9 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The transition matrix [5,6] is a convenient way to represent the costs of traversing a subnetwork between any two border nodes. In [5], the authors have presented a kind of algorithm, using the graph coloring technique, to compute the transition matrix of a subnetwork in terms of symmetric restrictive link parameters, such as residual bandwidth. And in [6], elements of the transition matrix are expressed as vectors to take into consideration more than one link parameter in topology aggregation.…”

Section: Related Workmentioning

confidence: 99%

“…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%

See 1 more Smart Citation

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

Section: Related Workmentioning

confidence: 99%

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

show abstract

“…However, the computational overhead may be prohibitive or at least expensive. The TA technique used in [Iliadis and Scotton 1999] (transition matrix with a graph coloring algorithm) is amenable to partial or differential updates under some conditions when re-aggregation is necessary without full-blown invocation of the algorithm. Another differential update is proposed for a linear programming solution of TA mechanism specific to ATM PNNI standard in [Iwata et al 1998].…”

Section: Re-aggregation Mechanismsmentioning

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

“…While IP networks only aggregate routing information, with two to three levels of hierarchy, ATM-PNNI [AF96] also summarizes bandwidth and delay characteristics to allow QoS routing. In [IS99], a complex node representation that captures the relevant characteristics of the nodes at the lower hierarchy levels is proposed. Likewise, distributed network management [YGY91, LS01, SQK00, QK99] uses hierarchical structures to better scale with large numbers of nodes and complex management tasks such as distributed monitoring with mid-level managers.…”

Section: Related Workmentioning

confidence: 99%

“…5 (b). SummarizeMetrics() computes a transition matrix [IS99] T with the shortest path composed of diff-serv++ capable routers only. The scatter set S 1 is defined by GetLogicalNode() as the logical node associated with the current node, for instance, node B for node B 1.…”

Section: Ds-summarizementioning

confidence: 99%

Distributed Service Deployment over Programmable Networks

Haas¹,

Droz²,

Stiller

2001

Operations &Amp; Management: 12th International Workshop on Distributed Systems, DSOM 2001, Nancy, France, October 15-17, 2001:

View full text Add to dashboard Cite

This paper presents the elements of a framework enabling QoS-aware service deployment over programmable heterogeneous networks. For ease of service deployment, it is expected that network management tools will require the network itself to participate in this task so as to be able to scale to very large numbers of network elements, with widely varying programmability levels. Three categories of service deployment are considered, namely services spanning along paths in the network, services involving only selected nodes, and combinations of both. The underlying hierarchical structure and the representation of capabilities used by the mechanism to deploy new services into a network automatically are presented. A formal description of the mechanism based on a Gather-Compute-Scatter paradigm is introduced and then illustrated by examples of all three service-deployment categories.

show abstract

Transition matrix generation for complex node representation

Cited by 9 publications

References 2 publications

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

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

Analysis of Topology Aggregation techniques for QoS routing

Distributed Service Deployment over Programmable Networks

Contact Info

Product

Resources

About