Chapter

Multi-Domain Traffic Grooming

12/2007; DOI:10.1007/978-0-387-74518-3_15 pp.237-252
0 0
 · 
0 Bookmarks
 · 
22 Views
  • Article: Optimal PNNI complex node representations for restrictive costs and minimal path computation time
    I. Iliadis
    [show abstract] [hide abstract]
    ABSTRACT: The private network-to-network interface (PNNI) protocol, which specifies how topology information is to be distributed in an ATM network, allows ATM switches to be aggregated into clusters called peer groups. Outside of a peer group its topology is aggregated into a single logical node. This method can be applied recursively so that PNNI can hierarchically aggregate network topology state information. To provide good accuracy in choosing optimal paths in a PNNI network, the PNNI standard provides a way to represent a peer group with a structure called the complex node representation. It allows the cost of traversing the peer group between any ingress and egress to be advertised in a compact form. Complex node representations using a small number of links result in a correspondingly short path computation time and therefore in good performance. It is, therefore, desirable that the complex node representation contains as few links as possible. This paper considers the class of complex node representations for which the path computation time is minimal. It assumes that the path selection is based on restrictive costs, such as bandwidth, and considers the symmetric case. It presents a method for constructing the set of the optimal complex node representations in the sense that they use the minimum possible number of links. Central to the development of this method is the establishment of the optimal substructure property of the optimal complex node representations
    IEEE/ACM Transactions on Networking 09/2000; · 2.03 Impact Factor
  • Source
    Article: On Scalable QoS Routing: Performance Evaluation of Topology Aggregation
    Fang Hao, Ellen W. Zegura
    [show abstract] [hide abstract]
    ABSTRACT: A number of important questions remain concerning the scalability of networks with quality of service guarantees. We consider one of these questions: can QoS routing protocols scale to large networks? To address this question, we evaluate performance of techniques that can reduce QoS routing protocol overhead. We specifically focus on topology aggregation, which can reduce overhead by orders of magnitude. We also investigate the interaction of topology aggregation with other important factors that contribute to performance, such as routing update frequency, routing algorithms, and network configuration. Our experiments are based on simulations of relatively large, structured networks. Among our observations, we find --- contrary to intuition --- that topology aggregationdoes not always have a negativeimpact on routing performance. Aggregation can reduce the routing information fluctuation, increase stability, and thus benefit routing performance. We also propose two new methods of aggr...
    01/2000;
  • Source
    Article: Topology aggregation for directed graphs
    B. Awerbuch, Y. Shavitt
    [show abstract] [hide abstract]
    ABSTRACT: This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure, where each sub-network must advertise the cost of routing between each pair of its border nodes. The straight-forward solution of advertising the exact cost for each pair has a quadratic cost which is not practical. We look at the realistic scenario of networks where all links are bidirectional, but their cost (or distance) in the opposite directions might differ significantly. The paper presents a solution with distortion that is bounded by the logarithm of the number of border nodes and the square-root of the asymmetry in the cost of a link. This is the first time that a theoretical bound is given to an undirected graph. We show how to apply our solution to PNNI, and suggest some other heuristics that are tested to perform better than the provenly bounded solution
    IEEE/ACM Transactions on Networking 03/2001; 9(1):82-90. · 2.03 Impact Factor

Show more

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Full-text

View
0 Downloads
Available from

Nasir Ghani