scispace - formally typeset
Journal ArticleDOI

A nonblocking architecture for broadband multichannel switching

Reads0
Chats0
TLDR
The architecture proposed in the paper accomplishes the task without employing any cell resequencing mechanism and is internally nonblocking and bufferless.
Abstract
The paper investigates multichannel switching as a promising alternative to traditional single-channel switching where virtual paths established in a switch are between a single input channel and a single output channel. A particular non-blocking condition is derived for flip networks, which is exploited to realize a multichannel switching architecture that supports an arbitrary number of channel groups. The architecture is internally nonblocking and bufferless. Using one flip network recursively a number of times based on the number of channel groups, the resulting architecture becomes efficient in the sense that the cross point complexity is O(N log/sub 2/ N) for N inputs. Other distinguishing features are the abilities to provide multicasting, superrate switching (i.e., rates that exceed the capacity of a single channel are accommodated), multirate switching (i.e., bit pipes of different rates are supported simultaneously), multiple performance requirements (i.e., services with different performance requirements are treated accordingly), and fair access to all inputs (i.e., no input is systematically discriminated against). In multichannel switching, cells belonging to a single session can traverse multiple channels. Providing the cell sequencing integrity becomes a challenging issue. The architecture proposed in the paper accomplishes the task without employing any cell resequencing mechanism. >

read more

Citations
More filters
Journal ArticleDOI

Efficient data allocation over multiple channels at broadcast servers

TL;DR: This paper shows how to minimize the average response time given multiple broadcast channels by optimally partitioning data among them and offers an approximation algorithm that is less complex than the optimal and shows that its performance is near-optimal for a wide range of parameters.
Journal ArticleDOI

A literature survey on traffic dispersion

E. Gustafsson, +1 more
- 01 Mar 1997 - 
TL;DR: This article looks at a specific instance of traffic dispersion in communication networks, where the processes are communication processes, and the resource is the link capacity in a packet switched network.
Journal ArticleDOI

Architectural choices in large scale ATM switches

TL;DR: This paper seeks to clarify the key architectural issues for ATM switching system design and provides a survey of the current state-of-the-art.
Patent

Packet switching apparatus with multi-channel and multi-cast switching functions and packet switching system using the same

TL;DR: In this paper, an improved packet switching apparatus with multichannel and multi-cast switching functions and a packet switching system using the same which are capable of more simplifying the routing of an internal routing during the integration of the switching apparatus by using a simpler 2×2 switch device for a concentration network in order to provide a routing network and a recirculation path and using a pattern connection characteristic consisting of a column and row.
Patent

Earliest-deadline-first queuing cell switching architecture and method

TL;DR: The earliest deadline first (EDF) cell switching as discussed by the authors uses at least one EDF queue for each of the output ports in a cell switch so that no two output ports have a common earliest-deadline-first queue.
References
More filters
Book

Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Journal ArticleDOI

Parallel Processing with the Perfect Shuffle

TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Book

Switching and Finite Automata Theory

TL;DR: Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
Journal ArticleDOI

Queueing in high-performance packet switching

TL;DR: In this article, the authors study the performance of four different approaches for providing the queuing necessary to smooth fluctuations in packet arrivals to a high-performance packet switch, including input queuing, smoothing, output queuing and completely shared buffering.
Related Papers (5)