Topology aggregation for combined additive and restrictive metrics

Authors:
Daniel Bauer;John N. Daigle;Ilias Iliadis;Paolo Scotton
Affiliations:
Zurich Research Laboratory, Rüschlikon, Switzerland;Zurich Research Laboratory, Rüschlikon, Switzerland;Zurich Research Laboratory, Rüschlikon, Switzerland;Zurich Research Laboratory, Rüschlikon, Switzerland
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2006

Citing 12
Cited 2

Introduction to algorithms

Introduction to algorithms
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Topology aggregation for hierarchical routing in ATM networks

ACM SIGCOMM Computer Communication Review
Routing high-bandwidth traffic in max-min fair share networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Optimal PNNI complex node representations for restrictive costs and minimal path computation time

IEEE/ACM Transactions on Networking (TON)
Topology aggregation for directed graphs

IEEE/ACM Transactions on Networking (TON)
Algorithm 97: Shortest path

Communications of the ACM
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Routing Through Networks with Hierarchical Topology Aggregation

ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Traffic engineering with MPLS in the Internet

IEEE Network: The Magazine of Global Internetworking

Resource Information Aggregation in Hierarchical Grid Networks

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Scheduling efficiency of resource information aggregation in grid networks

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a hierarchical network, nodes are aggregated to groups for the purpose of simplifying routing. Each group has a set of ingress-egress nodes, and routing information is conveyed to the outside world in the form of a transition matrix (or other equivalent form) that gives the cost of traversing the network between each ingress-egress node pair. In this paper, we present a transition matrix that has enough descriptive power to support service requirements that have both restrictive (bandwidth) and additive (delay) constraints. We present a solution in the form of a matrix whose elements are functions that map requested bandwidth to minimum delay. These functions describe the efficient frontier of the solution space, and we specify a generic procedure for calculating the efficient frontier for various delay functions. The complexity of this procedure is given for a set of well-known delay functions that are of practical importance.