Design of Nonblocking ATM Networks

Authors

J. Andrew Fingerhut, Washington University in St Louis
Rob Jackson, Washington University in St. Louis
Subhash Suri, Washington University in St. Louis
Jonathan S. Turner, Washington University in St. LouisFollow

Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

1996-01-01

Filename

WUCS-96-03.PDF

Technical Report Number

WUCS-96-03

Abstract

This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link cost model, and develop a number of results using it. We also describe a technique for converting tree-structured networks to nonblocking hierarchical networks satisfying limits on the capacity of any single switch.

Comments

Permanent URL: http://dx.doi.org/10.7936/K77P8WM5

Recommended Citation

Fingerhut, J. Andrew; Jackson, Rob; Suri, Subhash; and Turner, Jonathan S., "Design of Nonblocking ATM Networks" Report Number: WUCS-96-03 (1996). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/395