ATM layouts with bounded hop count and congestion

Authors:
Michele Flammini;Enrico Nardelli;Guido Proietti
Affiliations:
Dipartimento di Matematica Pura ed Applicata, University of L'Aquila, Via Vetoio loc. Coppito, 67100 L'Aquila, Italy;Dipartimento di Matematica Pura ed Applicata, University of L'Aquila, Via Vetoio loc. Coppito, 67100 L'Aquila, Italy and Istituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle R ...;Dipartimento di Matematica Pura ed Applicata, University of L'Aquila, Via Vetoio loc. Coppito, 67100 L'Aquila, Italy and Istituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle R ...
Venue:
Distributed Computing
Year:
2001

Citing 10
Cited 0

Gigabit networking

Gigabit networking
The virtual path layout problem in fast networks (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
The layout of virtual paths in ATM networks

IEEE/ACM Transactions on Networking (TON)
Integrated Broadband Networks; An Introduction to ATM-Based Networks

Integrated Broadband Networks; An Introduction to ATM-Based Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Scalable Approach to Routing in ATM Networks

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Path Layout in ATM Networks

SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Optimal Layouts on a Chain ATM Network (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Hop-congestion trade-offs for high-speed networks

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce and analyze two new cost measures related to the communication overhead and the space requirements associated with virtual path layouts in ATM networks, that is the edge congestion and the node congestion. Informally, the edge congestion of a given edge e at an incident node u is defined as the number of VPs terminating at or starting from u and using e, while the node congestion of a node v is defined as the number of VPs having v as an endpoint. We investigate the problem of constructing virtual path layouts allowing to connect a specified root node to all the others in at most h hops and with maximum edge or node congestion c, for two given integers h and c. We first give tight results concerning the time complexity of the construction of such layouts for both the two congestion measures, that is we exactly determine all the tractable and intractable cases. Then, we provide some combinatorial bounds for arbitrary networks, together with optimal layouts for specific topologies such as chains, rings and grids.